%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT115+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n011.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 : Thu Sep 24 08:50:53 AM UTC 2026
% Result : Theorem 0.10s 0.38s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 11 unt; 0 def)
% Number of atoms : 21 ( 19 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 9 ~; 4 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 8 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(issue_injective,axiom,
! [A,B] :
( issue(A) = issue(B)
=> A = B ),
file('theBenchmark.p',issue_injective) ).
fof(pi1_neq_pi2,axiom,
pi1 != pi2,
file('theBenchmark.p',pi1_neq_pi2) ).
fof(conjecture,conjecture,
issue(pi1) != issue(pi2),
file('theBenchmark.p',conjecture) ).
fof(f_1_1,plain,
! [A,B] :
( A = B
| issue(A) != issue(B) ),
inference(fof_nnf,[status(thm)],[issue_injective]) ).
fof(f_1_2,plain,
! [U_1,U_0] :
( U_1 = U_0
| issue(U_1) != issue(U_0) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
cnf(f_1_3,plain,
( U_1 = U_0
| issue(U_1) != issue(U_0) ),
inference(clausify,[status(thm)],[f_1_2]) ).
fof(f_4_1,plain,
pi1 != pi2,
inference(fof_nnf,[status(thm)],[pi1_neq_pi2]) ).
cnf(f_4_2,plain,
pi1 != pi2,
inference(clausify,[status(thm)],[f_4_1]) ).
fof(f_5_1,negated_conjecture,
issue(pi1) = issue(pi2),
inference(negate,[status(cth)],[conjecture]) ).
fof(f_5_2,negated_conjecture,
issue(pi1) = issue(pi2),
inference(definitional_conversion,[status(esa)],[f_5_1]) ).
cnf(f_5_3,negated_conjecture,
issue(pi1) = issue(pi2),
inference(clausify,[status(thm)],[f_5_2]) ).
cnf(t1,plain,
pi1 != pi2,
inference(start,[status(thm),parent(0:0)],[f_4_2]) ).
cnf(t2,plain,
( issue(pi1) != issue(pi2)
| pi1 = pi2 ),
inference(extension,[status(thm),parent(t1:1)],[f_1_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
issue(pi1) = issue(pi2),
inference(extension,[status(thm),parent(t2:2)],[f_5_3]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT115+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n011.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 19 16:21:39 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.38 % SZS status Theorem for theBenchmark
% 0.10/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------