%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUN088+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:43 PM UTC 2026
% Result : Theorem 0.14s 0.47s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 59 ( 21 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 74 ( 38 ~; 26 |; 10 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 30 ( 2 sgn 21 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(zerouneqone,conjecture,
! [X39] :
( ! [X23] :
( ~ r2(X23,X39)
| ~ r1(X23) )
| ! [X22] :
( X22 != X39
| ~ r1(X22) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zerouneqone) ).
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_7a,axiom,
! [X41,X42] :
( ~ r2(X41,X42)
| ! [X43] :
( X43 != X42
| ~ r1(X43) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_7a) ).
fof(c_0_3,negated_conjecture,
~ ! [X39] :
( ! [X23] :
( ~ r2(X23,X39)
| ~ r1(X23) )
| ! [X22] :
( X22 != X39
| ~ r1(X22) ) ),
inference(assume_negation,[status(cth)],[zerouneqone]) ).
fof(c_0_4,plain,
? [X1] :
! [X2] :
( ( X2 = X1
& r1(X2) )
| ( X2 != X1
& ~ r1(X2) ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_5,negated_conjecture,
~ ! [X39] :
( ! [X23] :
( ~ r2(X23,X39)
| ~ r1(X23) )
| ! [X22] :
( X22 != X39
| ~ r1(X22) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X62] :
( ( X62 != esk8_0
| X62 = esk8_0 )
& ( X62 != esk8_0
| r1(X62) )
& ( ~ r1(X62)
| X62 = esk8_0 )
& ( ~ r1(X62)
| r1(X62) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,negated_conjecture,
( r2(esk3_0,esk1_0)
& r1(esk3_0)
& esk2_0 = esk1_0
& r1(esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_8,plain,
( ~ r1(X1)
| X1 = esk8_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
r1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X41,X42] :
( ~ r2(X41,X42)
| ! [X43] :
( X43 != X42
| ~ r1(X43) ) ),
inference(fof_simplification,[status(thm)],[axiom_7a]) ).
cnf(c_0_11,negated_conjecture,
esk8_0 = esk3_0,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
r1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
esk2_0 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X58,X59,X60] :
( ~ r2(X58,X59)
| X60 != X59
| ~ r1(X60) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])])]) ).
cnf(c_0_15,plain,
( ~ r1(X1)
| X1 = esk3_0 ),
inference(rw,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
r1(esk1_0),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( ~ r2(X3,X2)
| X1 != X2
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
r2(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
esk3_0 = esk1_0,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ r1(X2)
| ~ r2(X1,X2) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
r2(esk1_0,esk1_0),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUN088+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.09/0.36 % Computer : n019.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 03:26:04 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/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.14/0.47 % Version: 3.5.1
% 0.14/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.47 % Starting sh5l with 300s (1) cores
% 0.14/0.47 % new_bool_1 with pid 1593851 completed with status 0
% 0.14/0.47 % Result found by new_bool_1
% 0.14/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.47 % Search class: FGHSM-FFMS21-SFFFFFNN
% 0.14/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.47 % SubtermCWHack with pid 1593854 completed with status 0
% 0.14/0.47 % Result found by SubtermCWHack
% 0.14/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.47 % Search class: FGHSM-FFMS21-SFFFFFNN
% 0.14/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.47 % Preprocessing time : 0.001 s
% 0.14/0.47
% 0.14/0.47 % Proof found!
% 0.14/0.47 % SZS status Theorem
% 0.14/0.47 % SZS output start CNFRefutation
% See solution above
% 0.14/0.47 % Parsed axioms : 12
% 0.14/0.47 % Removed by relevancy pruning/SinE : 0
% 0.14/0.47 % Initial clauses : 43
% 0.14/0.47 % Removed in clause preprocessing : 8
% 0.14/0.47 % Initial clauses in saturation : 35
% 0.14/0.47 % Processed clauses : 42
% 0.14/0.47 % ...of these trivial : 0
% 0.14/0.47 % ...subsumed : 0
% 0.14/0.47 % ...remaining for further processing : 42
% 0.14/0.47 % Other redundant clauses eliminated : 3
% 0.14/0.47 % Clauses deleted for lack of memory : 0
% 0.14/0.47 % Backward-subsumed : 0
% 0.14/0.47 % Backward-rewritten : 13
% 0.14/0.47 % Generated clauses : 24
% 0.14/0.47 % ...of the previous two non-redundant : 27
% 0.14/0.47 % ...aggressively subsumed : 0
% 0.14/0.47 % Contextual simplify-reflections : 0
% 0.14/0.47 % Paramodulations : 21
% 0.14/0.47 % Factorizations : 0
% 0.14/0.47 % NegExts : 0
% 0.14/0.47 % Equation resolutions : 3
% 0.14/0.47 % Disequality decompositions : 0
% 0.14/0.47 % Total rewrite steps : 27
% 0.14/0.47 % ...of those cached : 12
% 0.14/0.47 % Propositional unsat checks : 0
% 0.14/0.47 % Propositional check models : 0
% 0.14/0.47 % Propositional check unsatisfiable : 0
% 0.14/0.47 % Propositional clauses : 0
% 0.14/0.47 % Propositional clauses after purity: 0
% 0.14/0.47 % Propositional unsat core size : 0
% 0.14/0.47 % Propositional preprocessing time : 0.000
% 0.14/0.47 % Propositional encoding time : 0.000
% 0.14/0.47 % Propositional solver time : 0.000
% 0.14/0.47 % Success case prop preproc time : 0.000
% 0.14/0.47 % Success case prop encoding time : 0.000
% 0.14/0.47 % Success case prop solver time : 0.000
% 0.14/0.47 % Current number of processed clauses : 26
% 0.14/0.47 % Positive orientable unit clauses : 21
% 0.14/0.47 % Positive unorientable unit clauses: 0
% 0.14/0.47 % Negative unit clauses : 0
% 0.14/0.47 % Non-unit-clauses : 5
% 0.14/0.47 % Current number of unprocessed clauses: 12
% 0.14/0.47 % ...number of literals in the above : 22
% 0.14/0.47 % Current number of archived formulas : 0
% 0.14/0.47 % Current number of archived clauses : 13
% 0.14/0.47 % Clause-clause subsumption calls (NU) : 1
% 0.14/0.47 % Rec. Clause-clause subsumption calls : 1
% 0.14/0.47 % Non-unit clause-clause subsumptions : 0
% 0.14/0.47 % Unit Clause-clause subsumption calls : 4
% 0.14/0.47 % Rewrite failures with RHS unbound : 0
% 0.14/0.47 % BW rewrite match attempts : 10
% 0.14/0.47 % BW rewrite match successes : 8
% 0.14/0.47 % Condensation attempts : 0
% 0.14/0.47 % Condensation successes : 0
% 0.14/0.47 % Termbank termtop insertions : 1671
% 0.14/0.47 % Search garbage collected termcells : 290
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.007 s
% 0.14/0.47 % System time : 0.004 s
% 0.14/0.47 % Total time : 0.011 s
% 0.14/0.47 % Maximum resident set size: 3668 pages
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.009 s
% 0.14/0.47 % System time : 0.010 s
% 0.14/0.47 % Total time : 0.020 s
% 0.14/0.47 % Maximum resident set size: 4864 pages
% 0.14/0.47 % E exiting
%------------------------------------------------------------------------------