%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUN076+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 : n019.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:40 PM UTC 2026
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 18 unt; 0 def)
% Number of atoms : 112 ( 36 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 122 ( 49 ~; 37 |; 36 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 89 ( 15 sgn 21 !; 25 ?)
% 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_5a,axiom,
! [X33] :
? [X34] :
( ? [X36] :
( X34 = X36
& r1(X36) )
& ? [X35] :
( r4(X33,X35,X34)
& r1(X35) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_5a) ).
fof(thereexistsanevennumber,conjecture,
? [X39,X22,X23] :
( ? [X17] :
( X17 = X39
& r3(X22,X23,X17) )
& ? [X16] :
( ? [X25] :
( ? [X19] :
( ? [X34] :
( r2(X34,X19)
& r1(X34) )
& r2(X19,X25) )
& r4(X25,X22,X16) )
& X16 = X39 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thereexistsanevennumber) ).
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_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(c_0_5,plain,
? [X1] :
! [X2] :
( ( X2 = X1
& r1(X2) )
| ( X2 != X1
& ~ r1(X2) ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_6,plain,
! [X76] :
( esk15_1(X76) = esk17_1(X76)
& r1(esk17_1(X76))
& r4(X76,esk16_1(X76),esk15_1(X76))
& r1(esk16_1(X76)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_5a])]) ).
fof(c_0_7,negated_conjecture,
~ ? [X39,X22,X23] :
( ? [X17] :
( X17 = X39
& r3(X22,X23,X17) )
& ? [X16] :
( ? [X25] :
( ? [X19] :
( ? [X34] :
( r2(X34,X19)
& r1(X34) )
& r2(X19,X25) )
& r4(X25,X22,X16) )
& X16 = X39 ) ),
inference(assume_negation,[status(cth)],[thereexistsanevennumber]) ).
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_5])])])]) ).
cnf(c_0_9,plain,
r1(esk17_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
esk15_1(X1) = esk17_1(X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
! [X87,X88,X89,X90,X91,X92,X93,X94] :
( X94 != X87
| ~ r3(X88,X89,X94)
| ~ r2(X93,X92)
| ~ r1(X93)
| ~ r2(X92,X91)
| ~ r4(X91,X88,X90)
| X90 != X87 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[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(esk16_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
r1(esk15_1(X1)),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_15,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])]) ).
cnf(c_0_16,negated_conjecture,
( X8 != X2
| ~ r3(X4,X7,X8)
| ~ r2(X6,X5)
| ~ r1(X6)
| ~ r2(X5,X3)
| ~ r4(X3,X4,X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
r4(X1,esk16_1(X1),esk15_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,plain,
esk16_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
esk15_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_20,plain,
r3(X1,esk14_1(X1),esk13_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
esk13_1(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
r1(esk14_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_23,plain,
! [X3] :
? [X4] :
! [X5] :
( ( X5 = X4
& r2(X3,X5) )
| ( X5 != X4
& ~ r2(X3,X5) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
cnf(c_0_24,negated_conjecture,
( ~ r1(X5)
| ~ r2(X6,X1)
| ~ r2(X5,X6)
| ~ r3(X2,X4,X3)
| ~ r4(X1,X2,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_16])]) ).
cnf(c_0_25,plain,
r4(X1,esk1_0,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_26,plain,
r3(X1,esk14_1(X1),X1),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
esk14_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_12,c_0_22]) ).
fof(c_0_28,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_23])])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ r1(X2)
| ~ r2(X3,X4)
| ~ r2(X2,X3)
| ~ r3(esk1_0,X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
r3(X1,esk1_0,X1),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( X2 != esk2_1(X1)
| r2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( ~ r1(X1)
| ~ r2(X2,X3)
| ~ r2(X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
r2(X1,esk2_1(X1)),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_34,plain,
( X1 != esk1_0
| r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_35,negated_conjecture,
( ~ r1(X1)
| ~ r2(esk2_1(X1),X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
r1(esk1_0),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_37,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[c_0_35,c_0_33]) ).
cnf(c_0_38,plain,
$false,
inference(sr,[status(thm)],[c_0_36,c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUN076+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n019.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:24:35 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.44 Running first-order theorem proving
% 0.11/0.44 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.19/0.49 % Version: 3.5.1
% 0.19/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 % Starting sh5l with 300s (1) cores
% 0.19/0.49 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1591370 completed with status 0
% 0.19/0.49 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.49 % No SInE strategy applied
% 0.19/0.49 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.19/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.49 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.50 % Starting new_bool_3 with 136s (1) cores
% 0.19/0.50 % Starting new_bool_1 with 136s (1) cores
% 0.19/0.50 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1591377 completed with status 0
% 0.19/0.50 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.50 % No SInE strategy applied
% 0.19/0.50 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.19/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.50 % Preprocessing time : 0.002 s
% 0.19/0.50 % Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 % Proof found!
% 0.19/0.50 % SZS status Theorem
% 0.19/0.50 % SZS output start CNFRefutation
% See solution above
% 0.19/0.50 % Parsed axioms : 12
% 0.19/0.50 % Removed by relevancy pruning/SinE : 0
% 0.19/0.50 % Initial clauses : 40
% 0.19/0.50 % Removed in clause preprocessing : 12
% 0.19/0.50 % Initial clauses in saturation : 28
% 0.19/0.50 % Processed clauses : 91
% 0.19/0.50 % ...of these trivial : 0
% 0.19/0.50 % ...subsumed : 5
% 0.19/0.50 % ...remaining for further processing : 86
% 0.19/0.50 % Other redundant clauses eliminated : 8
% 0.19/0.50 % Clauses deleted for lack of memory : 0
% 0.19/0.50 % Backward-subsumed : 11
% 0.19/0.50 % Backward-rewritten : 13
% 0.19/0.50 % Generated clauses : 59
% 0.19/0.50 % ...of the previous two non-redundant : 62
% 0.19/0.50 % ...aggressively subsumed : 0
% 0.19/0.50 % Contextual simplify-reflections : 0
% 0.19/0.50 % Paramodulations : 49
% 0.19/0.50 % Factorizations : 0
% 0.19/0.50 % NegExts : 0
% 0.19/0.50 % Equation resolutions : 8
% 0.19/0.50 % Disequality decompositions : 0
% 0.19/0.50 % Total rewrite steps : 25
% 0.19/0.50 % ...of those cached : 8
% 0.19/0.50 % Propositional unsat checks : 0
% 0.19/0.50 % Propositional check models : 0
% 0.19/0.50 % Propositional check unsatisfiable : 0
% 0.19/0.50 % Propositional clauses : 0
% 0.19/0.50 % Propositional clauses after purity: 0
% 0.19/0.50 % Propositional unsat core size : 0
% 0.19/0.50 % Propositional preprocessing time : 0.000
% 0.19/0.50 % Propositional encoding time : 0.000
% 0.19/0.50 % Propositional solver time : 0.000
% 0.19/0.50 % Success case prop preproc time : 0.000
% 0.19/0.50 % Success case prop encoding time : 0.000
% 0.19/0.50 % Success case prop solver time : 0.000
% 0.19/0.50 % Current number of processed clauses : 24
% 0.19/0.50 % Positive orientable unit clauses : 16
% 0.19/0.50 % Positive unorientable unit clauses: 0
% 0.19/0.50 % Negative unit clauses : 1
% 0.19/0.50 % Non-unit-clauses : 7
% 0.19/0.50 % Current number of unprocessed clauses: 25
% 0.19/0.50 % ...number of literals in the above : 58
% 0.19/0.50 % Current number of archived formulas : 0
% 0.19/0.50 % Current number of archived clauses : 59
% 0.19/0.50 % Clause-clause subsumption calls (NU) : 161
% 0.19/0.50 % Rec. Clause-clause subsumption calls : 90
% 0.19/0.50 % Non-unit clause-clause subsumptions : 5
% 0.19/0.50 % Unit Clause-clause subsumption calls : 31
% 0.19/0.50 % Rewrite failures with RHS unbound : 0
% 0.19/0.50 % BW rewrite match attempts : 24
% 0.19/0.50 % BW rewrite match successes : 12
% 0.19/0.50 % Condensation attempts : 0
% 0.19/0.50 % Condensation successes : 0
% 0.19/0.50 % Termbank termtop insertions : 2338
% 0.19/0.50 % Search garbage collected termcells : 343
% 0.19/0.50
% 0.19/0.50 % -------------------------------------------------
% 0.19/0.50 % User time : 0.011 s
% 0.19/0.50 % System time : 0.006 s
% 0.19/0.50 % Total time : 0.017 s
% 0.19/0.50 % Maximum resident set size: 3412 pages
% 0.19/0.50
% 0.19/0.50 % -------------------------------------------------
% 0.19/0.50 % User time : 0.045 s
% 0.19/0.50 % System time : 0.021 s
% 0.19/0.50 % Total time : 0.066 s
% 0.19/0.50 % Maximum resident set size: 4864 pages
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------