%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT104+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/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:52 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.44s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 12 unt; 0 def)
% Number of atoms : 12 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 5 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(irreflexive,axiom,
! [X] : ~ less(X,X),
file('MGT002+0.ax',irreflexive) ).
fof(contradiction,axiom,
less(v0,v0),
file('theBenchmark.p',contradiction) ).
fof(f_1_1,plain,
! [X] : ~ less(X,X),
inference(fof_nnf,[status(thm)],[irreflexive]) ).
fof(f_1_2,plain,
! [U_0] : ~ less(U_0,U_0),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
! [U_0] : ~ less(U_0,U_0),
inference(definitional_conversion,[status(esa)],[f_1_2]) ).
cnf(f_1_4,plain,
~ less(U_0,U_0),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_58_1,plain,
less(v0,v0),
inference(fof_nnf,[status(thm)],[contradiction]) ).
fof(f_58_2,plain,
less(v0,v0),
inference(definitional_conversion,[status(esa)],[f_58_1]) ).
cnf(f_58_3,plain,
less(v0,v0),
inference(clausify,[status(thm)],[f_58_2]) ).
cnf(t1,plain,
~ less(v0,v0),
inference(start,[status(thm),parent(0:0)],[f_1_4]) ).
cnf(t2,plain,
less(v0,v0),
inference(extension,[status(thm),parent(t1:1)],[f_58_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT104+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03 This is a FOF_UNS_RFO_SEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/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:24 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.44 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------