%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : MGT115+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 8 06:16:19 AM UTC 2026
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 14 unt; 0 def)
% Number of atoms : 42 ( 41 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 37 ( 22 ~; 14 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 17 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(issue_injective,axiom,
! [A,B] :
( issue(A) = issue(B)
=> A = B ) ).
fof(pi1_neq_pi2,axiom,
pi1 != pi2 ).
fof(conjecture,conjecture,
issue(pi1) != issue(pi2) ).
fof(subgoal_0,plain,
issue(pi1) != issue(pi2),
inference(strip,[],[conjecture]) ).
fof(negate_0_0,plain,
~ ( issue(pi1) != issue(pi2) ),
inference(negate,[],[subgoal_0]) ).
fof(normalize_0_0,plain,
! [A,B] :
( issue(A) != issue(B)
| A = B ),
inference(canonicalize,[],[issue_injective]) ).
fof(normalize_0_1,plain,
! [A,B] :
( issue(A) != issue(B)
| A = B ),
inference(specialize,[],[normalize_0_0]) ).
fof(normalize_0_2,plain,
issue(pi1) = issue(pi2),
inference(canonicalize,[],[negate_0_0]) ).
fof(normalize_0_3,plain,
pi1 != pi2,
inference(canonicalize,[],[pi1_neq_pi2]) ).
cnf(refute_0_0,plain,
( issue(A) != issue(B)
| A = B ),
inference(canonicalize,[],[normalize_0_1]) ).
cnf(refute_0_1,plain,
( issue(pi2) != issue(X_1)
| pi2 = X_1 ),
inference(subst,[],[refute_0_0:[bind(A,$fot(pi2)),bind(B,$fot(X_1))]]) ).
cnf(refute_0_2,plain,
issue(pi1) = issue(pi2),
inference(canonicalize,[],[normalize_0_2]) ).
cnf(refute_0_3,plain,
X = X,
introduced(tautology,[refl,[$fot(X)]]) ).
cnf(refute_0_4,plain,
( X != X
| X != Y
| Y = X ),
introduced(tautology,[equality,[$cnf( $equal(X,X) ),[0],$fot(Y)]]) ).
cnf(refute_0_5,plain,
( X != Y
| Y = X ),
inference(resolve,[$cnf( $equal(X,X) )],[refute_0_3,refute_0_4]) ).
cnf(refute_0_6,plain,
( issue(pi1) != issue(pi2)
| issue(pi2) = issue(pi1) ),
inference(subst,[],[refute_0_5:[bind(X,$fot(issue(pi1))),bind(Y,$fot(issue(pi2)))]]) ).
cnf(refute_0_7,plain,
issue(pi2) = issue(pi1),
inference(resolve,[$cnf( $equal(issue(pi1),issue(pi2)) )],[refute_0_2,refute_0_6]) ).
cnf(refute_0_8,plain,
( issue(pi1) != issue(X_1)
| issue(pi2) != issue(pi1)
| issue(pi2) = issue(X_1) ),
introduced(tautology,[equality,[$cnf( $equal(issue(pi2),issue(pi1)) ),[1],$fot(issue(X_1))]]) ).
cnf(refute_0_9,plain,
( issue(pi1) != issue(X_1)
| issue(pi2) = issue(X_1) ),
inference(resolve,[$cnf( $equal(issue(pi2),issue(pi1)) )],[refute_0_7,refute_0_8]) ).
cnf(refute_0_10,plain,
( issue(pi1) != issue(X_1)
| pi2 = X_1 ),
inference(resolve,[$cnf( $equal(issue(pi2),issue(X_1)) )],[refute_0_9,refute_0_1]) ).
cnf(refute_0_11,plain,
( issue(pi1) != issue(pi1)
| pi2 = pi1 ),
inference(subst,[],[refute_0_10:[bind(X_1,$fot(pi1))]]) ).
cnf(refute_0_12,plain,
issue(pi1) = issue(pi1),
introduced(tautology,[refl,[$fot(issue(pi1))]]) ).
cnf(refute_0_13,plain,
pi2 = pi1,
inference(resolve,[$cnf( $equal(issue(pi1),issue(pi1)) )],[refute_0_12,refute_0_11]) ).
cnf(refute_0_14,plain,
pi1 != pi2,
inference(canonicalize,[],[normalize_0_3]) ).
cnf(refute_0_15,plain,
( pi2 != pi1
| pi1 = pi2 ),
inference(subst,[],[refute_0_5:[bind(X,$fot(pi2)),bind(Y,$fot(pi1))]]) ).
cnf(refute_0_16,plain,
pi2 != pi1,
inference(resolve,[$cnf( $equal(pi1,pi2) )],[refute_0_15,refute_0_14]) ).
cnf(refute_0_17,plain,
$false,
inference(resolve,[$cnf( $equal(pi2,pi1) )],[refute_0_13,refute_0_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT115+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04 % Command : metis --show proof --show saturation %s
% 0.09/0.36 % Computer : n015.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 7 14:11:30 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.37 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37
% 0.13/0.37 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.13/0.37
%------------------------------------------------------------------------------