%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUN081+2 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:41 PM UTC 2026
% Result : Theorem 0.26s 0.54s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 16 unt; 0 def)
% Number of atoms : 126 ( 41 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 141 ( 56 ~; 42 |; 43 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 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 : 103 ( 10 sgn 31 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( X2 = X1
& r1(X2) )
| ( X2 != X1
& ~ r1(X2) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).
fof(xplusyeqthree,conjecture,
? [X39,X22,X23] :
( ? [X16] :
( ? [X17] :
( ? [X25] :
( ? [X19] :
( r2(X19,X25)
& r1(X19) )
& r2(X25,X17) )
& r2(X17,X16) )
& X23 = X16 )
& r3(X39,X22,X23) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xplusyeqthree) ).
fof(axiom_3,axiom,
! [X6,X7] :
? [X8] :
! [X9] :
( ( X9 = X8
& r3(X6,X7,X9) )
| ( X9 != X8
& ~ r3(X6,X7,X9) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_3) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( X5 = X4
& r2(X3,X5) )
| ( X5 != X4
& ~ r2(X3,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
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/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).
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,negated_conjecture,
~ ? [X39,X22,X23] :
( ? [X16] :
( ? [X17] :
( ? [X25] :
( ? [X19] :
( r2(X19,X25)
& r1(X19) )
& r2(X25,X17) )
& r2(X17,X16) )
& X23 = X16 )
& r3(X39,X22,X23) ),
inference(assume_negation,[status(cth)],[xplusyeqthree]) ).
fof(c_0_10,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_11,plain,
r3(X1,esk14_1(X1),esk13_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
esk13_1(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( ~ r1(X1)
| X1 = esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
r1(esk14_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_15,negated_conjecture,
! [X87,X88,X89,X90,X91,X92,X93] :
( ~ r2(X93,X92)
| ~ r1(X93)
| ~ r2(X92,X91)
| ~ r2(X91,X90)
| X89 != X90
| ~ r3(X87,X88,X89) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_16,plain,
! [X3] :
? [X4] :
! [X5] :
( ( X5 = X4
& r2(X3,X5) )
| ( X5 != X4
& ~ r2(X3,X5) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_17,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_10])])])]) ).
cnf(c_0_18,plain,
r3(X1,esk14_1(X1),X1),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,plain,
esk14_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_20,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])]) ).
cnf(c_0_21,negated_conjecture,
( ~ r2(X7,X6)
| ~ r1(X7)
| ~ r2(X6,X5)
| ~ r2(X5,X4)
| X3 != X4
| ~ r3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
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_16])])])]) ).
cnf(c_0_23,plain,
( ~ r3(X2,X3,X1)
| X1 = esk3_2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
r3(X1,esk1_0,X1),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
r3(X1,X2,esk8_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( ~ r1(X4)
| ~ r2(X6,X3)
| ~ r2(X5,X6)
| ~ r2(X4,X5)
| ~ r3(X1,X2,X3) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
( X2 != esk2_1(X1)
| r2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
esk3_2(X1,esk1_0) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
esk3_2(X1,X2) = esk8_2(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( ~ r1(X1)
| ~ r2(X3,X4)
| ~ r2(X2,X3)
| ~ r2(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_31,plain,
r2(X1,esk2_1(X1)),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
r2(esk8_2(X1,X2),esk5_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_33,plain,
esk8_2(X1,esk1_0) = X1,
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( ~ r1(X1)
| ~ r2(X2,X3)
| ~ r2(esk2_1(X1),X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
r2(X1,esk5_2(X1,esk1_0)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( X1 != esk1_0
| r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_37,negated_conjecture,
( ~ r1(X1)
| ~ r2(esk2_1(X1),X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
r1(esk1_0),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_39,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_40,plain,
$false,
inference(sr,[status(thm)],[c_0_38,c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUN081+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n016.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 03:29:52 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.50 Running first-order theorem proving
% 0.26/0.50 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.26/0.54 % Version: 3.5.1
% 0.26/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.54 % Starting sh5l with 300s (1) cores
% 0.26/0.54 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1453161 completed with status 0
% 0.26/0.54 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.26/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.54 % No SInE strategy applied
% 0.26/0.54 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.26/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.54 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.26/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.54 % Starting new_bool_1 with 136s (1) cores
% 0.26/0.54 % new_bool_3 with pid 1453171 completed with status 0
% 0.26/0.54 % Result found by new_bool_3
% 0.26/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.54 % No SInE strategy applied
% 0.26/0.54 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.26/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.54 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.26/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.54 % Preprocessing time : 0.001 s
% 0.26/0.54 % Presaturation interreduction done
% 0.26/0.54
% 0.26/0.54 % Proof found!
% 0.26/0.54 % SZS status Theorem
% 0.26/0.54 % SZS output start CNFRefutation
% See solution above
% 0.26/0.54 % Parsed axioms : 12
% 0.26/0.54 % Removed by relevancy pruning/SinE : 0
% 0.26/0.54 % Initial clauses : 40
% 0.26/0.54 % Removed in clause preprocessing : 12
% 0.26/0.54 % Initial clauses in saturation : 28
% 0.26/0.54 % Processed clauses : 88
% 0.26/0.54 % ...of these trivial : 0
% 0.26/0.54 % ...subsumed : 4
% 0.26/0.54 % ...remaining for further processing : 84
% 0.26/0.54 % Other redundant clauses eliminated : 7
% 0.26/0.54 % Clauses deleted for lack of memory : 0
% 0.26/0.54 % Backward-subsumed : 11
% 0.26/0.54 % Backward-rewritten : 10
% 0.26/0.54 % Generated clauses : 63
% 0.26/0.54 % ...of the previous two non-redundant : 62
% 0.26/0.54 % ...aggressively subsumed : 0
% 0.26/0.54 % Contextual simplify-reflections : 0
% 0.26/0.54 % Paramodulations : 53
% 0.26/0.54 % Factorizations : 0
% 0.26/0.54 % NegExts : 0
% 0.26/0.54 % Equation resolutions : 7
% 0.26/0.54 % Disequality decompositions : 0
% 0.26/0.54 % Total rewrite steps : 23
% 0.26/0.54 % ...of those cached : 8
% 0.26/0.54 % Propositional unsat checks : 0
% 0.26/0.54 % Propositional check models : 0
% 0.26/0.54 % Propositional check unsatisfiable : 0
% 0.26/0.54 % Propositional clauses : 0
% 0.26/0.54 % Propositional clauses after purity: 0
% 0.26/0.54 % Propositional unsat core size : 0
% 0.26/0.54 % Propositional preprocessing time : 0.000
% 0.26/0.54 % Propositional encoding time : 0.000
% 0.26/0.54 % Propositional solver time : 0.000
% 0.26/0.54 % Success case prop preproc time : 0.000
% 0.26/0.54 % Success case prop encoding time : 0.000
% 0.26/0.54 % Success case prop solver time : 0.000
% 0.26/0.54 % Current number of processed clauses : 25
% 0.26/0.54 % Positive orientable unit clauses : 17
% 0.26/0.54 % Positive unorientable unit clauses: 0
% 0.26/0.54 % Negative unit clauses : 1
% 0.26/0.54 % Non-unit-clauses : 7
% 0.26/0.54 % Current number of unprocessed clauses: 28
% 0.26/0.54 % ...number of literals in the above : 67
% 0.26/0.54 % Current number of archived formulas : 0
% 0.26/0.54 % Current number of archived clauses : 56
% 0.26/0.54 % Clause-clause subsumption calls (NU) : 131
% 0.26/0.54 % Rec. Clause-clause subsumption calls : 70
% 0.26/0.54 % Non-unit clause-clause subsumptions : 3
% 0.26/0.54 % Unit Clause-clause subsumption calls : 29
% 0.26/0.54 % Rewrite failures with RHS unbound : 0
% 0.26/0.54 % BW rewrite match attempts : 19
% 0.26/0.54 % BW rewrite match successes : 10
% 0.26/0.54 % Condensation attempts : 0
% 0.26/0.54 % Condensation successes : 0
% 0.26/0.54 % Termbank termtop insertions : 2309
% 0.26/0.54 % Search garbage collected termcells : 330
% 0.26/0.54
% 0.26/0.54 % -------------------------------------------------
% 0.26/0.54 % User time : 0.010 s
% 0.26/0.54 % System time : 0.004 s
% 0.26/0.54 % Total time : 0.014 s
% 0.26/0.54 % Maximum resident set size: 3668 pages
% 0.26/0.54
% 0.26/0.54 % -------------------------------------------------
% 0.26/0.54 % User time : 0.030 s
% 0.26/0.54 % System time : 0.022 s
% 0.26/0.54 % Total time : 0.052 s
% 0.26/0.54 % Maximum resident set size: 4864 pages
% 0.26/0.54 % E exiting
%------------------------------------------------------------------------------