%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SWV064+1 : TPTP v9.3.1. Bugfixed v3.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 : n009.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 09:02:34 AM UTC 2026
% Result : Theorem 3.35s 3.66s
% Output : Proof 3.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 25 unt; 0 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 109 ( 37 ~; 32 |; 38 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(reflexivity_leq,axiom,
! [X] : leq(X,X),
file('SWV003+0.ax',reflexivity_leq) ).
fof(leq_succ_succ,axiom,
! [X,Y] :
( leq(succ(X),succ(Y))
<=> leq(X,Y) ),
file('SWV003+0.ax',leq_succ_succ) ).
fof(cl5_nebula_array_0005,conjecture,
( ( leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10) )
=> ( leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10)
& leq(n0,n0) ) ),
file('theBenchmark.p',cl5_nebula_array_0005) ).
fof(f_4_1,plain,
! [X] : leq(X,X),
inference(fof_nnf,[status(thm)],[reflexivity_leq]) ).
fof(f_4_2,plain,
! [U_6] : leq(U_6,U_6),
inference(variable_rename,[status(thm)],[f_4_1]) ).
cnf(f_4_3,plain,
leq(U_6,U_6),
inference(clausify,[status(thm)],[f_4_2]) ).
fof(f_42_1,plain,
! [X,Y] :
( ( leq(succ(X),succ(Y))
| ~ leq(X,Y) )
& ( leq(X,Y)
| ~ leq(succ(X),succ(Y)) ) ),
inference(fof_nnf,[status(thm)],[leq_succ_succ]) ).
fof(f_42_2,plain,
! [U_141,U_140] :
( ( leq(succ(U_141),succ(U_140))
| ~ leq(U_141,U_140) )
& ( leq(U_141,U_140)
| ~ leq(succ(U_141),succ(U_140)) ) ),
inference(variable_rename,[status(thm)],[f_42_1]) ).
fof(f_42_3,plain,
( ! [U_145,U_143] :
( leq(succ(U_145),succ(U_143))
| ~ leq(U_145,U_143) )
& ! [U_144,U_142] :
( leq(U_144,U_142)
| ~ leq(succ(U_144),succ(U_142)) ) ),
inference(miniscope,[status(thm)],[f_42_2]) ).
cnf(f_42_4,plain,
( leq(U_144,U_142)
| ~ leq(succ(U_144),succ(U_142)) ),
inference(clausify,[status(thm)],[f_42_3]) ).
fof(f_53_1,negated_conjecture,
( ~ ( leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10)
& leq(n0,n0) )
& leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10) ),
inference(negate,[status(cth)],[cl5_nebula_array_0005]) ).
fof(f_53_2,negated_conjecture,
( ( ~ leq(pv54,minus(n5,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv54)
| ~ leq(n0,pv53)
| ~ leq(n0,pv10)
| ~ leq(n0,n0) )
& leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10) ),
inference(fof_nnf,[status(thm)],[f_53_1]) ).
fof(f_53_3,negated_conjecture,
( ( ~ leq(pv54,minus(n5,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv54)
| ~ leq(n0,pv53)
| ~ leq(n0,pv10)
| ~ leq(n0,n0) )
& leq(pv54,minus(n5,n1))
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv54)
& leq(n0,pv53)
& leq(n0,pv10) ),
inference(definitional_conversion,[status(esa)],[f_53_2]) ).
cnf(f_53_4,negated_conjecture,
leq(n0,pv10),
inference(clausify,[status(thm)],[f_53_3]) ).
cnf(f_53_5,negated_conjecture,
leq(n0,pv53),
inference(clausify,[status(thm)],[f_53_3]) ).
cnf(f_53_6,negated_conjecture,
leq(n0,pv54),
inference(clausify,[status(thm)],[f_53_3]) ).
cnf(f_53_7,negated_conjecture,
leq(pv10,minus(n135300,n1)),
inference(clausify,[status(thm)],[f_53_3]) ).
cnf(f_53_8,negated_conjecture,
leq(pv53,minus(n5,n1)),
inference(clausify,[status(thm)],[f_53_3]) ).
cnf(f_53_9,negated_conjecture,
leq(pv54,minus(n5,n1)),
inference(clausify,[status(thm)],[f_53_3]) ).
cnf(f_53_10,negated_conjecture,
( ~ leq(pv54,minus(n5,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv54)
| ~ leq(n0,pv53)
| ~ leq(n0,pv10)
| ~ leq(n0,n0) ),
inference(clausify,[status(thm)],[f_53_3]) ).
cnf(t1,plain,
( ~ leq(n0,pv10)
| ~ leq(n0,pv53)
| ~ leq(n0,pv54)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv54,minus(n5,n1))
| ~ leq(n0,n0) ),
inference(start,[status(thm),parent(0:0)],[f_53_10]) ).
cnf(t2,plain,
( ~ leq(succ(n0),succ(n0))
| leq(n0,n0) ),
inference(extension,[status(thm),parent(t1:1)],[f_42_4]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
leq(succ(n0),succ(n0)),
inference(extension,[status(thm),parent(t2:2)],[f_4_3]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
leq(pv54,minus(n5,n1)),
inference(extension,[status(thm),parent(t1:2)],[f_53_9]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t1:2]) ).
cnf(t8,plain,
leq(pv53,minus(n5,n1)),
inference(extension,[status(thm),parent(t1:3)],[f_53_8]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t1:3]) ).
cnf(t10,plain,
leq(pv10,minus(n135300,n1)),
inference(extension,[status(thm),parent(t1:4)],[f_53_7]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t1:4]) ).
cnf(t12,plain,
leq(n0,pv54),
inference(extension,[status(thm),parent(t1:5)],[f_53_6]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t1:5]) ).
cnf(t14,plain,
leq(n0,pv53),
inference(extension,[status(thm),parent(t1:6)],[f_53_5]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t1:6]) ).
cnf(t16,plain,
leq(n0,pv10),
inference(extension,[status(thm),parent(t1:7)],[f_53_4]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t1:7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV064+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35 % Computer : n009.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Sun Sep 20 03:01:27 UTC 2026
% 0.07/0.35 % CPUTime :
% 3.35/3.66 % SZS status Theorem for theBenchmark
% 3.35/3.66 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------