%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUN081+2 : TPTP v9.2.1. Released v7.3.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 : n025.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 05:00:52 PM UTC 2026
% Result : Theorem 1.27s 1.73s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 10 unt; 0 def)
% Number of atoms : 92 ( 27 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 110 ( 47 ~; 35 |; 28 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 72 ( 10 sgn 18 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
fof(xplusyeqthree,conjecture,
? [X39,X22,X23] :
( r3(X39,X22,X23)
& ? [X16] :
( X23 = X16
& ? [X17] :
( r2(X17,X16)
& ? [X25] :
( r2(X25,X17)
& ? [X19] :
( r1(X19)
& r2(X19,X25) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xplusyeqthree) ).
fof(axiom_4a,axiom,
! [X30] :
? [X31] :
( ? [X32] :
( r1(X32)
& r3(X30,X32,X31) )
& X31 = X30 ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
fof(c_0_4,plain,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_5,negated_conjecture,
~ ? [X39,X22,X23] :
( r3(X39,X22,X23)
& ? [X16] :
( X23 = X16
& ? [X17] :
( r2(X17,X16)
& ? [X25] :
( r2(X25,X17)
& ? [X19] :
( r1(X19)
& r2(X19,X25) ) ) ) ) ),
inference(assume_negation,[status(cth)],[xplusyeqthree]) ).
fof(c_0_6,plain,
! [X123] :
( r1(esk14_1(X123))
& r3(X123,esk14_1(X123),esk13_1(X123))
& esk13_1(X123) = X123 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).
fof(c_0_7,plain,
! [X95] :
( ( r1(X95)
| ~ r1(X95) )
& ( X95 = esk1_0
| ~ r1(X95) )
& ( r1(X95)
| X95 != esk1_0 )
& ( X95 = esk1_0
| X95 != esk1_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_4])])]) ).
fof(c_0_8,negated_conjecture,
! [X137,X138,X139,X140,X141,X142,X143] :
( ~ r3(X137,X138,X139)
| X139 != X140
| ~ r2(X141,X140)
| ~ r2(X142,X141)
| ~ r1(X143)
| ~ r2(X143,X142) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
r3(X1,esk14_1(X1),esk13_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
esk13_1(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( X1 = esk1_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
r1(esk14_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( ~ r3(X1,X2,X3)
| X3 != X4
| ~ r2(X5,X4)
| ~ r2(X6,X5)
| ~ r1(X7)
| ~ r2(X7,X6) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
r3(X1,esk14_1(X1),X1),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
esk14_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,plain,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
cnf(c_0_17,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ r2(X4,X5)
| ~ r2(X5,X6)
| ~ r2(X6,X3)
| ~ r1(X4) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
r3(X1,esk1_0,X1),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( r1(X1)
| X1 != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_20,plain,
! [X96,X98] :
( ( r2(X96,X98)
| ~ r2(X96,X98) )
& ( X98 = esk2_1(X96)
| ~ r2(X96,X98) )
& ( r2(X96,X98)
| X98 != esk2_1(X96) )
& ( X98 = esk2_1(X96)
| X98 != esk2_1(X96) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_16])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X2,X3)
| ~ r2(X3,X4)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
r1(esk1_0),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( r2(X1,X2)
| X2 != esk2_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( ~ r2(esk1_0,X1)
| ~ r2(X1,X2)
| ~ r2(X2,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
r2(X1,esk2_1(X1)),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( ~ r2(esk2_1(X1),X2)
| ~ r2(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
~ r2(esk2_1(esk2_1(esk1_0)),X1),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_27,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN081+2 : TPTP v9.2.1. Released v7.3.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.16/0.34 % Computer : n025.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue May 5 01:23:13 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.27/1.73 % Version : CSE_E---1.7
% 1.27/1.73 % Problem : theBenchmark.p
% 1.27/1.73 % SZS status Theorem for theBenchmark.p
% 1.27/1.73 % SZS output start CNFRefutation
% See solution above
% 1.27/1.73 % Total time : 1.372s
%------------------------------------------------------------------------------