%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUN087+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 : n026.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:58 PM UTC 2026
% Result : Theorem 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 57 ( 19 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 57 ( 22 ~; 16 |; 19 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 34 ( 6 sgn 8 !; 11 ?)
% 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(zerotimeszeroeqzero,conjecture,
? [X39] :
( ? [X23] :
( X39 = X23
& r1(X23) )
& ? [X22] :
( r4(X22,X22,X39)
& r1(X22) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zerotimeszeroeqzero) ).
fof(c_0_3,plain,
? [X1] :
! [X2] :
( ( X2 = X1
& r1(X2) )
| ( X2 != X1
& ~ r1(X2) ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_4,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_5,negated_conjecture,
~ ? [X39] :
( ? [X23] :
( X39 = X23
& r1(X23) )
& ? [X22] :
( r4(X22,X22,X39)
& r1(X22) ) ),
inference(assume_negation,[status(cth)],[zerotimeszeroeqzero]) ).
fof(c_0_6,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_3])])])]) ).
cnf(c_0_7,plain,
r1(esk17_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
esk15_1(X1) = esk17_1(X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_9,negated_conjecture,
! [X87,X88,X89] :
( X87 != X89
| ~ r1(X89)
| ~ r4(X88,X88,X87)
| ~ r1(X88) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_10,plain,
( ~ r1(X1)
| X1 = esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
r1(esk16_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
r1(esk15_1(X1)),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( X2 != X3
| ~ r1(X3)
| ~ r4(X1,X1,X2)
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
r4(X1,esk16_1(X1),esk15_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,plain,
esk16_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
esk15_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_17,plain,
( X1 != esk1_0
| r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
( ~ r1(X1)
| ~ r1(X2)
| ~ r4(X1,X1,X2) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
r4(X1,esk1_0,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,plain,
r1(esk1_0),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUN087+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.36 % Computer : n026.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 03:28:06 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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.14/0.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1268835 completed with status 0
% 0.14/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.43 % No SInE strategy applied
% 0.14/0.43 % Search class: FGHSM-FFSF21-SFFFFFNN
% 0.14/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1268842 completed with status 0
% 0.14/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.43 % No SInE strategy applied
% 0.14/0.43 % Search class: FGHSM-FFSF21-SFFFFFNN
% 0.14/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.43 % Preprocessing time : 0.002 s
% 0.14/0.43 % Presaturation interreduction done
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Theorem
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 12
% 0.14/0.43 % Removed by relevancy pruning/SinE : 0
% 0.14/0.43 % Initial clauses : 40
% 0.14/0.43 % Removed in clause preprocessing : 12
% 0.14/0.43 % Initial clauses in saturation : 28
% 0.14/0.43 % Processed clauses : 65
% 0.14/0.43 % ...of these trivial : 0
% 0.14/0.43 % ...subsumed : 0
% 0.14/0.43 % ...remaining for further processing : 65
% 0.14/0.43 % Other redundant clauses eliminated : 7
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 0
% 0.14/0.43 % Backward-rewritten : 5
% 0.14/0.43 % Generated clauses : 22
% 0.14/0.43 % ...of the previous two non-redundant : 22
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 0
% 0.14/0.43 % Paramodulations : 15
% 0.14/0.43 % Factorizations : 0
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 7
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 13
% 0.14/0.43 % ...of those cached : 6
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 25
% 0.14/0.43 % Positive orientable unit clauses : 13
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 2
% 0.14/0.43 % Non-unit-clauses : 10
% 0.14/0.43 % Current number of unprocessed clauses: 13
% 0.14/0.43 % ...number of literals in the above : 20
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 37
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 22
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 18
% 0.14/0.43 % Non-unit clause-clause subsumptions : 0
% 0.14/0.43 % Unit Clause-clause subsumption calls : 12
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 18
% 0.14/0.43 % BW rewrite match successes : 5
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 1804
% 0.14/0.43 % Search garbage collected termcells : 291
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.006 s
% 0.14/0.43 % System time : 0.004 s
% 0.14/0.43 % Total time : 0.009 s
% 0.14/0.43 % Maximum resident set size: 3412 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.016 s
% 0.14/0.43 % System time : 0.016 s
% 0.14/0.43 % Total time : 0.032 s
% 0.14/0.43 % Maximum resident set size: 4608 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------