%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM387+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:48:58 PM UTC 2026
% Result : Theorem 0.13s 5.68s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 10 unt; 0 def)
% Number of atoms : 18 ( 5 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 11 ~; 2 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 14 ( 0 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t14_ordinal1,conjecture,
! [X1] : X1 != succ(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_ordinal1) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(t10_ordinal1,axiom,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] : X1 != succ(X1),
inference(assume_negation,[status(cth)],[t14_ordinal1]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] : X1 != succ(X1),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_5,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(c_0_6,plain,
! [X5] : in(X5,succ(X5)),
inference(variable_rename,[status(thm)],[t10_ordinal1]) ).
fof(c_0_7,negated_conjecture,
esk1_0 = succ(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_8,plain,
! [X13,X14] :
( ~ in(X14,X13)
| ~ in(X13,X14) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = succ(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
in(esk1_0,esk1_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM387+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/5.61 % Computer : n004.cluster.edu
% 0.13/5.61 % Model : x86_64 x86_64
% 0.13/5.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.61 % Memory : 8046.5625MB
% 0.13/5.61 % OS : Linux 6.8.0-71-generic
% 0.13/5.61 % CPULimit : 300
% 0.13/5.61 % WCLimit : 300
% 0.13/5.61 % DateTime : Mon Sep 21 02:26:25 UTC 2026
% 0.13/5.61 % CPUTime :
% 0.13/5.61 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/5.65 Running first-order theorem proving
% 0.13/5.65 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.13/5.68 % Version: 3.5.1
% 0.13/5.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/5.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/5.68 % Starting new_bool_3 with 300s (1) cores
% 0.13/5.68 % Starting new_bool_1 with 300s (1) cores
% 0.13/5.68 % Starting sh5l with 300s (1) cores
% 0.13/5.68 % new_bool_3 with pid 2051766 completed with status 0
% 0.13/5.68 % Result found by new_bool_3
% 0.13/5.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/5.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/5.68 % Starting new_bool_3 with 300s (1) cores
% 0.13/5.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/5.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/5.68 % Search class: FHHSF-FFSS11-SFFFFFNN
% 0.13/5.68 % partial match(1): FGHSF-FFSS11-SFFFFFNN
% 0.13/5.68 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/5.68 % Starting SubtermCWHack with 31s (1) cores
% 0.13/5.68 % SubtermCWHack with pid 2051769 completed with status 0
% 0.13/5.68 % Result found by SubtermCWHack
% 0.13/5.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/5.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/5.68 % Starting new_bool_3 with 300s (1) cores
% 0.13/5.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/5.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/5.68 % Search class: FHHSF-FFSS11-SFFFFFNN
% 0.13/5.68 % partial match(1): FGHSF-FFSS11-SFFFFFNN
% 0.13/5.68 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/5.68 % Starting SubtermCWHack with 31s (1) cores
% 0.13/5.68 % Preprocessing time : 0.001 s
% 0.13/5.68
% 0.13/5.68 % Proof found!
% 0.13/5.68 % SZS status Theorem
% 0.13/5.68 % SZS output start CNFRefutation
% See solution above
% 0.13/5.68 % Parsed axioms : 33
% 0.13/5.68 % Removed by relevancy pruning/SinE : 22
% 0.13/5.68 % Initial clauses : 13
% 0.13/5.68 % Removed in clause preprocessing : 0
% 0.13/5.68 % Initial clauses in saturation : 13
% 0.13/5.68 % Processed clauses : 21
% 0.13/5.68 % ...of these trivial : 0
% 0.13/5.68 % ...subsumed : 3
% 0.13/5.68 % ...remaining for further processing : 18
% 0.13/5.68 % Other redundant clauses eliminated : 0
% 0.13/5.68 % Clauses deleted for lack of memory : 0
% 0.13/5.68 % Backward-subsumed : 0
% 0.13/5.68 % Backward-rewritten : 2
% 0.13/5.68 % Generated clauses : 9
% 0.13/5.68 % ...of the previous two non-redundant : 8
% 0.13/5.68 % ...aggressively subsumed : 0
% 0.13/5.68 % Contextual simplify-reflections : 0
% 0.13/5.68 % Paramodulations : 9
% 0.13/5.68 % Factorizations : 0
% 0.13/5.68 % NegExts : 0
% 0.13/5.68 % Equation resolutions : 0
% 0.13/5.68 % Disequality decompositions : 0
% 0.13/5.68 % Total rewrite steps : 4
% 0.13/5.68 % ...of those cached : 1
% 0.13/5.68 % Propositional unsat checks : 0
% 0.13/5.68 % Propositional check models : 0
% 0.13/5.68 % Propositional check unsatisfiable : 0
% 0.13/5.68 % Propositional clauses : 0
% 0.13/5.68 % Propositional clauses after purity: 0
% 0.13/5.68 % Propositional unsat core size : 0
% 0.13/5.68 % Propositional preprocessing time : 0.000
% 0.13/5.68 % Propositional encoding time : 0.000
% 0.13/5.68 % Propositional solver time : 0.000
% 0.13/5.68 % Success case prop preproc time : 0.000
% 0.13/5.68 % Success case prop encoding time : 0.000
% 0.13/5.68 % Success case prop solver time : 0.000
% 0.13/5.68 % Current number of processed clauses : 16
% 0.13/5.68 % Positive orientable unit clauses : 7
% 0.13/5.68 % Positive unorientable unit clauses: 0
% 0.13/5.68 % Negative unit clauses : 4
% 0.13/5.68 % Non-unit-clauses : 5
% 0.13/5.68 % Current number of unprocessed clauses: 0
% 0.13/5.68 % ...number of literals in the above : 0
% 0.13/5.68 % Current number of archived formulas : 0
% 0.13/5.68 % Current number of archived clauses : 2
% 0.13/5.68 % Clause-clause subsumption calls (NU) : 1
% 0.13/5.68 % Rec. Clause-clause subsumption calls : 1
% 0.13/5.68 % Non-unit clause-clause subsumptions : 1
% 0.13/5.68 % Unit Clause-clause subsumption calls : 0
% 0.13/5.68 % Rewrite failures with RHS unbound : 0
% 0.13/5.68 % BW rewrite match attempts : 1
% 0.13/5.68 % BW rewrite match successes : 1
% 0.13/5.68 % Condensation attempts : 0
% 0.13/5.68 % Condensation successes : 0
% 0.13/5.68 % Termbank termtop insertions : 774
% 0.13/5.68 % Search garbage collected termcells : 181
% 0.13/5.68
% 0.13/5.68 % -------------------------------------------------
% 0.13/5.68 % User time : 0.003 s
% 0.13/5.68 % System time : 0.003 s
% 0.13/5.68 % Total time : 0.006 s
% 0.13/5.68 % Maximum resident set size: 3648 pages
% 0.13/5.68
% 0.13/5.68 % -------------------------------------------------
% 0.13/5.68 % User time : 0.004 s
% 0.13/5.68 % System time : 0.008 s
% 0.13/5.68 % Total time : 0.012 s
% 0.13/5.68 % Maximum resident set size: 4608 pages
% 0.13/5.68 % E exiting
%------------------------------------------------------------------------------