%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : NUM302+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:59 AM UTC 2026
% Result : Theorem 0.54s 0.88s
% Output : Proof 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 18 unt; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 16 ~; 10 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 26 ( 3 sgn 19 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rdn127,axiom,
rdn_translate(n127,rdn_pos(rdn(rdnn(n7),rdn(rdnn(n2),rdnn(n1))))),
file('NUM005+0.ax',rdn127) ).
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(nn2_less_something,conjecture,
? [X] : less(nn2,X),
file('theBenchmark.p',nn2_less_something) ).
fof(f_128_1,plain,
rdn_translate(n127,rdn_pos(rdn(rdnn(n7),rdn(rdnn(n2),rdnn(n1))))),
inference(fof_nnf,[status(thm)],[rdn127]) ).
cnf(f_128_2,plain,
rdn_translate(n127,rdn_pos(rdn(rdnn(n7),rdn(rdnn(n2),rdnn(n1))))),
inference(clausify,[status(thm)],[f_128_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_402_1,negated_conjecture,
~ ? [X] : less(nn2,X),
inference(negate,[status(cth)],[nn2_less_something]) ).
fof(f_402_2,negated_conjecture,
! [X] : ~ less(nn2,X),
inference(fof_nnf,[status(thm)],[f_402_1]) ).
fof(f_402_3,negated_conjecture,
! [U_135] : ~ less(nn2,U_135),
inference(variable_rename,[status(thm)],[f_402_2]) ).
fof(f_402_4,negated_conjecture,
! [U_135] : ~ less(nn2,U_135),
inference(definitional_conversion,[status(esa)],[f_402_3]) ).
cnf(f_402_5,negated_conjecture,
~ less(nn2,U_135),
inference(clausify,[status(thm)],[f_402_4]) ).
cnf(t1,plain,
~ less(nn2,n127),
inference(start,[status(thm),parent(0:0)],[f_402_5]) ).
cnf(t2,plain,
( ~ rdn_translate(n127,rdn_pos(rdn(rdnn(n7),rdn(rdnn(n2),rdnn(n1)))))
| ~ rdn_translate(nn2,rdn_neg(rdnn(n2)))
| less(nn2,n127) ),
inference(extension,[status(thm),parent(t1:1)],[f_282_4]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(extension,[status(thm),parent(t2:2)],[f_130_2]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
rdn_translate(n127,rdn_pos(rdn(rdnn(n7),rdn(rdnn(n2),rdnn(n1))))),
inference(extension,[status(thm),parent(t2:3)],[f_128_2]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM302+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 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.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 19 18:11:19 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.54/0.88 % SZS status Theorem for theBenchmark
% 0.54/0.88 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------