%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : NUM298+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 : n004.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 0.32s 0.62s
% Output : Proof 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 17 unt; 0 def)
% Number of atoms : 60 ( 7 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 57 ( 26 ~; 21 |; 8 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 32 ( 2 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rdn2,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('NUM005+0.ax',rdn2) ).
fof(rdnn2,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('NUM005+0.ax',rdnn2) ).
fof(less_entry_point_neg_pos,axiom,
! [X,Y,RDN_X,RDN_Y] :
( ( rdn_translate(Y,rdn_pos(RDN_Y))
& rdn_translate(X,rdn_neg(RDN_X)) )
=> less(X,Y) ),
file('NUM005+1.ax',less_entry_point_neg_pos) ).
fof(less_property,axiom,
! [X,Y] :
( less(X,Y)
<=> ( Y != X
& ~ less(Y,X) ) ),
file('NUM005+1.ax',less_property) ).
fof(n2_not_less_nn2,conjecture,
~ less(n2,nn2),
file('theBenchmark.p',n2_not_less_nn2) ).
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_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_282_1,plain,
! [X,Y,RDN_X,RDN_Y] :
( less(X,Y)
| ~ rdn_translate(Y,rdn_pos(RDN_Y))
| ~ rdn_translate(X,rdn_neg(RDN_X)) ),
inference(fof_nnf,[status(thm)],[less_entry_point_neg_pos]) ).
fof(f_282_2,plain,
! [U_23,U_22,U_21,U_20] :
( less(U_23,U_22)
| ~ rdn_translate(U_22,rdn_pos(U_20))
| ~ rdn_translate(U_23,rdn_neg(U_21)) ),
inference(variable_rename,[status(thm)],[f_282_1]) ).
fof(f_282_3,plain,
! [U_23,U_22] :
( ! [U_21] : ~ rdn_translate(U_23,rdn_neg(U_21))
| ! [U_20] : ~ rdn_translate(U_22,rdn_pos(U_20))
| less(U_23,U_22) ),
inference(miniscope,[status(thm)],[f_282_2]) ).
cnf(f_282_4,plain,
( ~ rdn_translate(U_23,rdn_neg(U_21))
| ~ rdn_translate(U_22,rdn_pos(U_20))
| less(U_23,U_22) ),
inference(clausify,[status(thm)],[f_282_3]) ).
fof(f_284_1,plain,
! [X,Y] :
( ( less(X,Y)
| Y = X
| less(Y,X) )
& ( ( Y != X
& ~ less(Y,X) )
| ~ less(X,Y) ) ),
inference(fof_nnf,[status(thm)],[less_property]) ).
fof(f_284_2,plain,
! [U_29,U_28] :
( ( less(U_29,U_28)
| U_28 = U_29
| less(U_28,U_29) )
& ( ( U_28 != U_29
& ~ less(U_28,U_29) )
| ~ less(U_29,U_28) ) ),
inference(variable_rename,[status(thm)],[f_284_1]) ).
fof(f_284_3,plain,
( ! [U_33,U_31] :
( less(U_33,U_31)
| U_31 = U_33
| less(U_31,U_33) )
& ! [U_32,U_30] :
( ( U_30 != U_32
& ~ less(U_30,U_32) )
| ~ less(U_32,U_30) ) ),
inference(miniscope,[status(thm)],[f_284_2]) ).
cnf(f_284_4,plain,
( ~ less(U_30,U_32)
| ~ less(U_32,U_30) ),
inference(clausify,[status(thm)],[f_284_3]) ).
fof(f_402_1,negated_conjecture,
less(n2,nn2),
inference(negate,[status(cth)],[n2_not_less_nn2]) ).
fof(f_402_2,negated_conjecture,
less(n2,nn2),
inference(definitional_conversion,[status(esa)],[f_402_1]) ).
cnf(f_402_3,negated_conjecture,
less(n2,nn2),
inference(clausify,[status(thm)],[f_402_2]) ).
cnf(t1,plain,
( ~ less(nn2,n2)
| ~ less(n2,nn2) ),
inference(start,[status(thm),parent(0:0)],[f_284_4]) ).
cnf(t2,plain,
less(n2,nn2),
inference(extension,[status(thm),parent(t1:1)],[f_402_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ rdn_translate(n2,rdn_pos(rdnn(n2)))
| ~ rdn_translate(nn2,rdn_neg(rdnn(n2)))
| less(nn2,n2) ),
inference(extension,[status(thm),parent(t1:2)],[f_282_4]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t1:2]) ).
cnf(t6,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(extension,[status(thm),parent(t4:2)],[f_130_2]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(extension,[status(thm),parent(t4:3)],[f_3_2]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM298+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.08/0.35 % Computer : n004.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 19 18:11:04 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.32/0.62 % SZS status Theorem for theBenchmark
% 0.32/0.62 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------