%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUN054+2 : TPTP v9.2.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n027.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:47 PM UTC 2026
% Result : Theorem 1.28s 1.72s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 49 ( 22 unt; 0 def)
% Number of atoms : 144 ( 45 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 159 ( 64 ~; 50 |; 45 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 113 ( 4 sgn 30 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
fof(zeroplusoneeqone,conjecture,
? [X39] :
( ? [X22] :
( ? [X16] :
( r1(X16)
& r3(X16,X22,X39) )
& ? [X17] :
( r1(X17)
& r2(X17,X22) ) )
& ? [X23] :
( X39 = X23
& ? [X25] :
( r1(X25)
& r2(X25,X23) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zeroplusoneeqone) ).
fof(axiom_1a,axiom,
! [X14,X15] :
? [X16] :
( ? [X17] :
( ? [X18] :
( r2(X15,X18)
& r3(X14,X18,X17) )
& X17 = X16 )
& ? [X19] :
( r2(X19,X16)
& r3(X14,X15,X19) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).
fof(axiom_4a,axiom,
! [X30] :
? [X31] :
( ? [X32] :
( r1(X32)
& r3(X30,X32,X31) )
& X31 = X30 ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).
fof(axiom_3,axiom,
! [X6,X7] :
? [X8] :
! [X9] :
( ( ~ r3(X6,X7,X9)
& X9 != X8 )
| ( r3(X6,X7,X9)
& X9 = X8 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_3) ).
fof(c_0_6,plain,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_7,plain,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_8,negated_conjecture,
~ ? [X39] :
( ? [X22] :
( ? [X16] :
( r1(X16)
& r3(X16,X22,X39) )
& ? [X17] :
( r1(X17)
& r2(X17,X22) ) )
& ? [X23] :
( X39 = X23
& ? [X25] :
( r1(X25)
& r2(X25,X23) ) ) ),
inference(assume_negation,[status(cth)],[zeroplusoneeqone]) ).
fof(c_0_9,plain,
! [X106,X107] :
( r2(X107,esk7_2(X106,X107))
& r3(X106,esk7_2(X106,X107),esk6_2(X106,X107))
& esk6_2(X106,X107) = esk5_2(X106,X107)
& r2(esk8_2(X106,X107),esk5_2(X106,X107))
& r3(X106,X107,esk8_2(X106,X107)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])]) ).
fof(c_0_10,plain,
! [X95,X97] :
( ( r2(X95,X97)
| ~ r2(X95,X97) )
& ( X97 = esk2_1(X95)
| ~ r2(X95,X97) )
& ( r2(X95,X97)
| X97 != esk2_1(X95) )
& ( X97 = esk2_1(X95)
| X97 != esk2_1(X95) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_6])])]) ).
fof(c_0_11,plain,
! [X122] :
( r1(esk14_1(X122))
& r3(X122,esk14_1(X122),esk13_1(X122))
& esk13_1(X122) = X122 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).
fof(c_0_12,plain,
! [X94] :
( ( r1(X94)
| ~ r1(X94) )
& ( X94 = esk1_0
| ~ r1(X94) )
& ( r1(X94)
| X94 != esk1_0 )
& ( X94 = esk1_0
| X94 != esk1_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_7])])]) ).
fof(c_0_13,negated_conjecture,
! [X136,X137,X138,X139,X140,X141] :
( ~ r1(X138)
| ~ r3(X138,X137,X136)
| ~ r1(X139)
| ~ r2(X139,X137)
| X136 != X140
| ~ r1(X141)
| ~ r2(X141,X140) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_14,plain,
r3(X1,esk7_2(X1,X2),esk6_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
esk6_2(X1,X2) = esk5_2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( X1 = esk2_1(X2)
| ~ r2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
r2(X1,esk7_2(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_18,plain,
! [X6,X7] :
? [X8] :
! [X9] :
( ( ~ r3(X6,X7,X9)
& X9 != X8 )
| ( r3(X6,X7,X9)
& X9 = X8 ) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
cnf(c_0_19,plain,
r3(X1,esk14_1(X1),esk13_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
esk13_1(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( X1 = esk1_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
r1(esk14_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
( ~ r1(X1)
| ~ r3(X1,X2,X3)
| ~ r1(X4)
| ~ r2(X4,X2)
| X3 != X5
| ~ r1(X6)
| ~ r2(X6,X5) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,plain,
r3(X1,esk7_2(X1,X2),esk5_2(X1,X2)),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_25,plain,
esk7_2(X1,X2) = esk2_1(X2),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_26,plain,
! [X98,X99,X101] :
( ( r3(X98,X99,X101)
| ~ r3(X98,X99,X101) )
& ( X101 = esk3_2(X98,X99)
| ~ r3(X98,X99,X101) )
& ( r3(X98,X99,X101)
| X101 != esk3_2(X98,X99) )
& ( X101 = esk3_2(X98,X99)
| X101 != esk3_2(X98,X99) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_18])])]) ).
cnf(c_0_27,plain,
r3(X1,esk14_1(X1),X1),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
esk14_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ r2(X4,X3)
| ~ r2(X5,X2)
| ~ r1(X4)
| ~ r1(X5)
| ~ r1(X1) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
r3(X1,esk2_1(X2),esk5_2(X1,X2)),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( r1(X1)
| X1 != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_32,plain,
( X1 = esk3_2(X2,X3)
| ~ r3(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
r3(X1,esk1_0,X1),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
r3(X1,X2,esk8_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,negated_conjecture,
( ~ r2(X1,esk5_2(X2,X3))
| ~ r2(X4,esk2_1(X3))
| ~ r1(X1)
| ~ r1(X4)
| ~ r1(X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
r1(esk1_0),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
esk3_2(X1,esk1_0) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
esk3_2(X1,X2) = esk8_2(X1,X2),
inference(spm,[status(thm)],[c_0_32,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( ~ r2(esk1_0,esk5_2(X1,X2))
| ~ r2(X3,esk2_1(X2))
| ~ r1(X3)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
r2(esk8_2(X1,X2),esk5_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,plain,
esk8_2(X1,esk1_0) = X1,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( ~ r2(esk1_0,esk5_2(X1,X2))
| ~ r2(esk1_0,esk2_1(X2))
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_36]) ).
cnf(c_0_43,plain,
( r2(X1,X2)
| X2 != esk2_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_44,plain,
r2(X1,esk5_2(X1,esk1_0)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( ~ r2(esk1_0,esk5_2(esk1_0,X1))
| ~ r2(esk1_0,esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_42,c_0_36]) ).
cnf(c_0_46,plain,
r2(X1,esk2_1(X1)),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_47,plain,
esk5_2(X1,esk1_0) = esk2_1(X1),
inference(spm,[status(thm)],[c_0_16,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN054+2 : TPTP v9.2.1. Released v7.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n027.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 01:21:50 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.28/1.72 % Version : CSE_E---1.7
% 1.28/1.72 % Problem : theBenchmark.p
% 1.28/1.72 % SZS status Theorem for theBenchmark.p
% 1.28/1.72 % SZS output start CNFRefutation
% See solution above
% 1.28/1.72 % Total time : 1.369s
%------------------------------------------------------------------------------