%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : NUM290+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 : n014.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:57 AM UTC 2026
% Result : Theorem 120.13s 120.44s
% Output : Proof 120.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 21 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 37 ( 19 ~; 15 |; 2 &)
% ( 0 <=>; 1 =>; 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 : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 20 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rdn2,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('NUM005+0.ax',rdn2) ).
fof(rdn3,axiom,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('NUM005+0.ax',rdn3) ).
fof(rdn_positive_less23,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('NUM005+1.ax',rdn_positive_less23) ).
fof(less_entry_point_pos_pos,axiom,
! [X,Y,RDN_X,RDN_Y] :
( ( rdn_positive_less(RDN_X,RDN_Y)
& rdn_translate(Y,rdn_pos(RDN_Y))
& rdn_translate(X,rdn_pos(RDN_X)) )
=> less(X,Y) ),
file('NUM005+1.ax',less_entry_point_pos_pos) ).
fof(n2_less_n3,conjecture,
less(n2,n3),
file('theBenchmark.p',n2_less_n3) ).
fof(f_3_1,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(fof_nnf,[status(thm)],[rdn2]) ).
cnf(f_3_2,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(clausify,[status(thm)],[f_3_1]) ).
fof(f_4_1,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(fof_nnf,[status(thm)],[rdn3]) ).
cnf(f_4_2,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(clausify,[status(thm)],[f_4_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_281_1,plain,
! [X,Y,RDN_X,RDN_Y] :
( less(X,Y)
| ~ rdn_positive_less(RDN_X,RDN_Y)
| ~ rdn_translate(Y,rdn_pos(RDN_Y))
| ~ rdn_translate(X,rdn_pos(RDN_X)) ),
inference(fof_nnf,[status(thm)],[less_entry_point_pos_pos]) ).
fof(f_281_2,plain,
! [U_19,U_18,U_17,U_16] :
( less(U_19,U_18)
| ~ rdn_positive_less(U_17,U_16)
| ~ rdn_translate(U_18,rdn_pos(U_16))
| ~ rdn_translate(U_19,rdn_pos(U_17)) ),
inference(variable_rename,[status(thm)],[f_281_1]) ).
fof(f_281_3,plain,
! [U_19,U_18] :
( ! [U_17] :
( ! [U_16] :
( ~ rdn_positive_less(U_17,U_16)
| ~ rdn_translate(U_18,rdn_pos(U_16)) )
| ~ rdn_translate(U_19,rdn_pos(U_17)) )
| less(U_19,U_18) ),
inference(miniscope,[status(thm)],[f_281_2]) ).
cnf(f_281_4,plain,
( ~ rdn_positive_less(U_17,U_16)
| ~ rdn_translate(U_18,rdn_pos(U_16))
| ~ rdn_translate(U_19,rdn_pos(U_17))
| less(U_19,U_18) ),
inference(clausify,[status(thm)],[f_281_3]) ).
fof(f_402_1,negated_conjecture,
~ less(n2,n3),
inference(negate,[status(cth)],[n2_less_n3]) ).
fof(f_402_2,negated_conjecture,
~ less(n2,n3),
inference(definitional_conversion,[status(esa)],[f_402_1]) ).
cnf(f_402_3,negated_conjecture,
~ less(n2,n3),
inference(clausify,[status(thm)],[f_402_2]) ).
cnf(t1,plain,
~ less(n2,n3),
inference(start,[status(thm),parent(0:0)],[f_402_3]) ).
cnf(t2,plain,
( ~ rdn_translate(n2,rdn_pos(rdnn(n2)))
| ~ rdn_translate(n3,rdn_pos(rdnn(n3)))
| ~ rdn_positive_less(rdnn(n2),rdnn(n3))
| less(n2,n3) ),
inference(extension,[status(thm),parent(t1:1)],[f_281_4]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(extension,[status(thm),parent(t2:2)],[f_268_2]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(extension,[status(thm),parent(t2:3)],[f_4_2]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(extension,[status(thm),parent(t2:4)],[f_3_2]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM290+1 : TPTP v9.3.1. Released v3.1.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.10/0.38 % Computer : n014.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sat Sep 19 18:10:51 UTC 2026
% 0.10/0.38 % CPUTime :
% 120.13/120.44 % SZS status Theorem for theBenchmark
% 120.13/120.44 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------