%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : NUM297+1 : TPTP v9.3.1. Released v3.1.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 : n016.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:51:58 AM UTC 2026
% Result : Theorem 120.54s 120.81s
% Output : Proof 120.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 27 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 55 ( 27 ~; 23 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 32 ( 0 sgn 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rdnn2,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('NUM005+0.ax',rdnn2) ).
fof(rdnn4,axiom,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
file('NUM005+0.ax',rdnn4) ).
fof(rdn_positive_less23,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('NUM005+1.ax',rdn_positive_less23) ).
fof(rdn_positive_less34,axiom,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('NUM005+1.ax',rdn_positive_less34) ).
fof(rdn_positive_less_transitivity,axiom,
! [X,Y,Z] :
( ( rdn_positive_less(rdnn(Y),rdnn(Z))
& rdn_positive_less(rdnn(X),rdnn(Y)) )
=> rdn_positive_less(rdnn(X),rdnn(Z)) ),
file('NUM005+1.ax',rdn_positive_less_transitivity) ).
fof(less_entry_point_neg_neg,axiom,
! [X,Y,RDN_X,RDN_Y] :
( ( rdn_positive_less(RDN_Y,RDN_X)
& rdn_translate(Y,rdn_neg(RDN_Y))
& rdn_translate(X,rdn_neg(RDN_X)) )
=> less(X,Y) ),
file('NUM005+1.ax',less_entry_point_neg_neg) ).
fof(nn4_less_nn2,conjecture,
less(nn4,nn2),
file('theBenchmark.p',nn4_less_nn2) ).
fof(f_130_1,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(fof_nnf,[status(thm)],[rdnn2]) ).
cnf(f_130_2,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(clausify,[status(thm)],[f_130_1]) ).
fof(f_132_1,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
inference(fof_nnf,[status(thm)],[rdnn4]) ).
cnf(f_132_2,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
inference(clausify,[status(thm)],[f_132_1]) ).
fof(f_268_1,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(fof_nnf,[status(thm)],[rdn_positive_less23]) ).
cnf(f_268_2,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(clausify,[status(thm)],[f_268_1]) ).
fof(f_269_1,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(fof_nnf,[status(thm)],[rdn_positive_less34]) ).
cnf(f_269_2,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(clausify,[status(thm)],[f_269_1]) ).
fof(f_275_1,plain,
! [X,Y,Z] :
( rdn_positive_less(rdnn(X),rdnn(Z))
| ~ rdn_positive_less(rdnn(Y),rdnn(Z))
| ~ rdn_positive_less(rdnn(X),rdnn(Y)) ),
inference(fof_nnf,[status(thm)],[rdn_positive_less_transitivity]) ).
fof(f_275_2,plain,
! [U_2,U_1,U_0] :
( rdn_positive_less(rdnn(U_2),rdnn(U_0))
| ~ rdn_positive_less(rdnn(U_1),rdnn(U_0))
| ~ rdn_positive_less(rdnn(U_2),rdnn(U_1)) ),
inference(variable_rename,[status(thm)],[f_275_1]) ).
cnf(f_275_3,plain,
( rdn_positive_less(rdnn(U_2),rdnn(U_0))
| ~ rdn_positive_less(rdnn(U_1),rdnn(U_0))
| ~ rdn_positive_less(rdnn(U_2),rdnn(U_1)) ),
inference(clausify,[status(thm)],[f_275_2]) ).
fof(f_283_1,plain,
! [X,Y,RDN_X,RDN_Y] :
( less(X,Y)
| ~ rdn_positive_less(RDN_Y,RDN_X)
| ~ rdn_translate(Y,rdn_neg(RDN_Y))
| ~ rdn_translate(X,rdn_neg(RDN_X)) ),
inference(fof_nnf,[status(thm)],[less_entry_point_neg_neg]) ).
fof(f_283_2,plain,
! [U_27,U_26,U_25,U_24] :
( less(U_27,U_26)
| ~ rdn_positive_less(U_24,U_25)
| ~ rdn_translate(U_26,rdn_neg(U_24))
| ~ rdn_translate(U_27,rdn_neg(U_25)) ),
inference(variable_rename,[status(thm)],[f_283_1]) ).
fof(f_283_3,plain,
! [U_27,U_26] :
( ! [U_25] :
( ! [U_24] :
( ~ rdn_positive_less(U_24,U_25)
| ~ rdn_translate(U_26,rdn_neg(U_24)) )
| ~ rdn_translate(U_27,rdn_neg(U_25)) )
| less(U_27,U_26) ),
inference(miniscope,[status(thm)],[f_283_2]) ).
cnf(f_283_4,plain,
( ~ rdn_positive_less(U_24,U_25)
| ~ rdn_translate(U_26,rdn_neg(U_24))
| ~ rdn_translate(U_27,rdn_neg(U_25))
| less(U_27,U_26) ),
inference(clausify,[status(thm)],[f_283_3]) ).
fof(f_402_1,negated_conjecture,
~ less(nn4,nn2),
inference(negate,[status(cth)],[nn4_less_nn2]) ).
fof(f_402_2,negated_conjecture,
~ less(nn4,nn2),
inference(definitional_conversion,[status(esa)],[f_402_1]) ).
cnf(f_402_3,negated_conjecture,
~ less(nn4,nn2),
inference(clausify,[status(thm)],[f_402_2]) ).
cnf(t1,plain,
~ less(nn4,nn2),
inference(start,[status(thm),parent(0:0)],[f_402_3]) ).
cnf(t2,plain,
( ~ rdn_translate(nn4,rdn_neg(rdnn(n4)))
| ~ rdn_translate(nn2,rdn_neg(rdnn(n2)))
| ~ rdn_positive_less(rdnn(n2),rdnn(n4))
| less(nn4,nn2) ),
inference(extension,[status(thm),parent(t1:1)],[f_283_4]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ rdn_positive_less(rdnn(n3),rdnn(n4))
| ~ rdn_positive_less(rdnn(n2),rdnn(n3))
| rdn_positive_less(rdnn(n2),rdnn(n4)) ),
inference(extension,[status(thm),parent(t2:2)],[f_275_3]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(extension,[status(thm),parent(t4:2)],[f_268_2]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(extension,[status(thm),parent(t4:3)],[f_269_2]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(extension,[status(thm),parent(t2:3)],[f_130_2]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t2:3]) ).
cnf(t12,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
inference(extension,[status(thm),parent(t2:4)],[f_132_2]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t2:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM297+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.02 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.08/0.37 % Computer : n016.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Sat Sep 19 18:15:50 UTC 2026
% 0.08/0.37 % CPUTime :
% 120.54/120.81 % SZS status Theorem for theBenchmark
% 120.54/120.81 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------