%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUN054+2 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 01:57:36 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 49 ( 24 unt; 0 def)
% Number of atoms : 140 ( 45 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 150 ( 59 ~; 46 |; 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 : 110 ( 5 sgn 30 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( X2 = X1
& r1(X2) )
| ( X2 != X1
& ~ r1(X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
fof(axiom_4a,axiom,
! [X30] :
? [X31] :
( X31 = X30
& ? [X32] :
( r3(X30,X32,X31)
& r1(X32) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).
fof(axiom_3,axiom,
! [X6,X7] :
? [X8] :
! [X9] :
( ( X9 = X8
& r3(X6,X7,X9) )
| ( X9 != X8
& ~ r3(X6,X7,X9) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_3) ).
fof(axiom_1a,axiom,
! [X14,X15] :
? [X16] :
( ? [X19] :
( r3(X14,X15,X19)
& r2(X19,X16) )
& ? [X17] :
( X17 = X16
& ? [X18] :
( r3(X14,X18,X17)
& r2(X15,X18) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( X5 = X4
& r2(X3,X5) )
| ( X5 != X4
& ~ r2(X3,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
fof(zeroplusoneeqone,conjecture,
? [X39] :
( ? [X23] :
( ? [X25] :
( r2(X25,X23)
& r1(X25) )
& X39 = X23 )
& ? [X22] :
( ? [X17] :
( r2(X17,X22)
& r1(X17) )
& ? [X16] :
( r3(X16,X22,X39)
& r1(X16) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zeroplusoneeqone) ).
fof(c_0_6,plain,
? [X1] :
! [X2] :
( ( X2 = X1
& r1(X2) )
| ( X2 != X1
& ~ r1(X2) ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_7,plain,
! [X73] :
( esk13_1(X73) = X73
& r3(X73,esk14_1(X73),esk13_1(X73))
& r1(esk14_1(X73)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).
fof(c_0_8,plain,
! [X45] :
( ( X45 != esk1_0
| X45 = esk1_0 )
& ( X45 != esk1_0
| r1(X45) )
& ( ~ r1(X45)
| X45 = esk1_0 )
& ( ~ r1(X45)
| r1(X45) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_6])])])]) ).
fof(c_0_9,plain,
! [X6,X7] :
? [X8] :
! [X9] :
( ( X9 = X8
& r3(X6,X7,X9) )
| ( X9 != X8
& ~ r3(X6,X7,X9) ) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
cnf(c_0_10,plain,
r3(X1,esk14_1(X1),esk13_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
esk13_1(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ r1(X1)
| X1 = esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
r1(esk14_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X49,X50,X52] :
( ( X52 != esk3_2(X49,X50)
| X52 = esk3_2(X49,X50) )
& ( X52 != esk3_2(X49,X50)
| r3(X49,X50,X52) )
& ( ~ r3(X49,X50,X52)
| X52 = esk3_2(X49,X50) )
& ( ~ r3(X49,X50,X52)
| r3(X49,X50,X52) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_15,plain,
r3(X1,esk14_1(X1),X1),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
esk14_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_17,plain,
! [X57,X58] :
( r3(X57,X58,esk8_2(X57,X58))
& r2(esk8_2(X57,X58),esk5_2(X57,X58))
& esk6_2(X57,X58) = esk5_2(X57,X58)
& r3(X57,esk7_2(X57,X58),esk6_2(X57,X58))
& r2(X58,esk7_2(X57,X58)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])]) ).
fof(c_0_18,plain,
! [X3] :
? [X4] :
! [X5] :
( ( X5 = X4
& r2(X3,X5) )
| ( X5 != X4
& ~ r2(X3,X5) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
cnf(c_0_19,plain,
( ~ r3(X2,X3,X1)
| X1 = esk3_2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
r3(X1,esk1_0,X1),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
r3(X1,X2,esk8_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X46,X48] :
( ( X48 != esk2_1(X46)
| X48 = esk2_1(X46) )
& ( X48 != esk2_1(X46)
| r2(X46,X48) )
& ( ~ r2(X46,X48)
| X48 = esk2_1(X46) )
& ( ~ r2(X46,X48)
| r2(X46,X48) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_18])])])]) ).
cnf(c_0_23,plain,
esk3_2(X1,esk1_0) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
esk3_2(X1,X2) = esk8_2(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
fof(c_0_25,negated_conjecture,
~ ? [X39] :
( ? [X23] :
( ? [X25] :
( r2(X25,X23)
& r1(X25) )
& X39 = X23 )
& ? [X22] :
( ? [X17] :
( r2(X17,X22)
& r1(X17) )
& ? [X16] :
( r3(X16,X22,X39)
& r1(X16) ) ) ),
inference(assume_negation,[status(cth)],[zeroplusoneeqone]) ).
cnf(c_0_26,plain,
r3(X1,esk7_2(X1,X2),esk6_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
esk6_2(X1,X2) = esk5_2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,plain,
( ~ r2(X2,X1)
| X1 = esk2_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
r2(X1,esk7_2(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,plain,
r2(esk8_2(X1,X2),esk5_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,plain,
esk8_2(X1,esk1_0) = X1,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_32,negated_conjecture,
! [X87,X88,X89,X90,X91,X92] :
( ~ r2(X92,X91)
| ~ r1(X92)
| X87 != X91
| ~ r2(X90,X88)
| ~ r1(X90)
| ~ r3(X89,X88,X87)
| ~ r1(X89) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
cnf(c_0_33,plain,
r3(X1,esk7_2(X1,X2),esk5_2(X1,X2)),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
esk7_2(X1,X2) = esk2_1(X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
r2(X1,esk5_2(X1,esk1_0)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( ~ r2(X6,X5)
| ~ r1(X6)
| X3 != X5
| ~ r2(X4,X2)
| ~ r1(X4)
| ~ r3(X1,X2,X3)
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
r3(X1,esk2_1(X2),esk5_2(X1,X2)),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
esk5_2(X1,esk1_0) = esk2_1(X1),
inference(spm,[status(thm)],[c_0_28,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( ~ r1(X1)
| ~ r1(X5)
| ~ r1(X4)
| ~ r2(X5,X2)
| ~ r2(X4,X3)
| ~ r3(X1,X2,X3) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_40,plain,
r3(X1,esk2_1(esk1_0),esk2_1(X1)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( X2 != esk2_1(X1)
| r2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_42,plain,
( X1 != esk1_0
| r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_43,negated_conjecture,
( ~ r1(X3)
| ~ r1(X1)
| ~ r1(X2)
| ~ r2(X2,esk2_1(X3))
| ~ r2(X1,esk2_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
r2(X1,esk2_1(X1)),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_45,plain,
r1(esk1_0),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( ~ r1(X2)
| ~ r1(X1)
| ~ r2(X1,esk2_1(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_47,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[c_0_46,c_0_44]) ).
cnf(c_0_48,plain,
$false,
inference(sr,[status(thm)],[c_0_45,c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN054+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n017.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 03:18:11 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1316707 completed with status 0
% 0.11/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.11/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1316724 completed with status 0
% 0.11/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.45 % Preprocessing time : 0.001 s
% 0.11/0.45 % Presaturation interreduction done
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Theorem
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 12
% 0.11/0.45 % Removed by relevancy pruning/SinE : 0
% 0.11/0.45 % Initial clauses : 40
% 0.11/0.45 % Removed in clause preprocessing : 12
% 0.11/0.45 % Initial clauses in saturation : 28
% 0.11/0.45 % Processed clauses : 108
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 11
% 0.11/0.45 % ...remaining for further processing : 97
% 0.11/0.45 % Other redundant clauses eliminated : 7
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 11
% 0.11/0.45 % Backward-rewritten : 17
% 0.11/0.45 % Generated clauses : 84
% 0.11/0.45 % ...of the previous two non-redundant : 82
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 1
% 0.11/0.45 % Paramodulations : 74
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 7
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 40
% 0.11/0.45 % ...of those cached : 15
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 31
% 0.11/0.45 % Positive orientable unit clauses : 21
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 1
% 0.11/0.45 % Non-unit-clauses : 9
% 0.11/0.45 % Current number of unprocessed clauses: 27
% 0.11/0.45 % ...number of literals in the above : 70
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 63
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 175
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 97
% 0.11/0.45 % Non-unit clause-clause subsumptions : 9
% 0.11/0.45 % Unit Clause-clause subsumption calls : 32
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 25
% 0.11/0.45 % BW rewrite match successes : 16
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 2584
% 0.11/0.45 % Search garbage collected termcells : 332
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.006 s
% 0.11/0.45 % System time : 0.004 s
% 0.11/0.45 % Total time : 0.011 s
% 0.11/0.45 % Maximum resident set size: 3412 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.027 s
% 0.11/0.45 % System time : 0.017 s
% 0.11/0.45 % Total time : 0.044 s
% 0.11/0.45 % Maximum resident set size: 4608 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------