%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUM298+1 : TPTP v9.2.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:53:06 PM UTC 2026
% Result : Theorem 1.30s 1.73s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 9 unt; 0 def)
% Number of atoms : 35 ( 4 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 35 ( 17 ~; 10 |; 5 &)
% ( 2 <=>; 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 : 22 ( 3 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(less_property,axiom,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& X2 != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_property) ).
fof(less_entry_point_neg_pos,axiom,
! [X1,X2,X10,X11] :
( ( rdn_translate(X1,rdn_neg(X10))
& rdn_translate(X2,rdn_pos(X11)) )
=> less(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_neg_pos) ).
fof(n2_not_less_nn2,conjecture,
~ less(n2,nn2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n2_not_less_nn2) ).
fof(rdn2,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn2) ).
fof(rdnn2,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn2) ).
fof(c_0_5,plain,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& X2 != X1 ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
fof(c_0_6,plain,
! [X174,X175,X176,X177] :
( ~ rdn_translate(X174,rdn_neg(X176))
| ~ rdn_translate(X175,rdn_pos(X177))
| less(X174,X175) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_neg_pos])]) ).
fof(c_0_7,plain,
! [X182,X183] :
( ( ~ less(X183,X182)
| ~ less(X182,X183) )
& ( X183 != X182
| ~ less(X182,X183) )
& ( less(X183,X182)
| X183 = X182
| less(X182,X183) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,negated_conjecture,
less(n2,nn2),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[n2_not_less_nn2])]) ).
cnf(c_0_9,plain,
( less(X1,X3)
| ~ rdn_translate(X1,rdn_neg(X2))
| ~ rdn_translate(X3,rdn_pos(X4)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(split_conjunct,[status(thm)],[rdn2]) ).
cnf(c_0_11,plain,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
less(n2,nn2),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( less(X1,n2)
| ~ rdn_translate(X1,rdn_neg(X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(split_conjunct,[status(thm)],[rdnn2]) ).
cnf(c_0_15,negated_conjecture,
~ less(nn2,n2),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM298+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n026.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 00:25:23 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.30/1.73 % Version : CSE_E---1.7
% 1.30/1.73 % Problem : theBenchmark.p
% 1.30/1.73 % SZS status Theorem for theBenchmark.p
% 1.30/1.73 % SZS output start CNFRefutation
% See solution above
% 1.30/1.73 % Total time : 1.370s
%------------------------------------------------------------------------------