%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET813+4 : 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 : 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 02:15:27 PM UTC 2026
% Result : Theorem 0.15s 0.49s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 3 unt; 0 def)
% Number of atoms : 39 ( 4 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 37 ( 14 ~; 13 |; 5 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 1 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thV12,conjecture,
! [X1] :
( member(X1,on)
=> member(X1,suc(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thV12) ).
fof(successor,axiom,
! [X1,X3] :
( member(X3,suc(X1))
<=> member(X3,union(X1,singleton(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+4.ax',successor) ).
fof(union,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X2)
| member(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',union) ).
fof(singleton,axiom,
! [X3,X1] :
( member(X3,singleton(X1))
<=> X3 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',singleton) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( member(X1,on)
=> member(X1,suc(X1)) ),
inference(assume_negation,[status(cth)],[thV12]) ).
fof(c_0_5,plain,
! [X10,X11] :
( ( member(X11,suc(X10))
| ~ member(X11,union(X10,singleton(X10))) )
& ( member(X11,union(X10,singleton(X10)))
| ~ member(X11,suc(X10)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[successor])])]) ).
fof(c_0_6,plain,
! [X16,X17,X18] :
( ( member(X16,union(X17,X18))
| ~ member(X16,X18) )
& ( member(X16,union(X17,X18))
| ~ member(X16,X17) )
& ( member(X16,X18)
| member(X16,X17)
| ~ member(X16,union(X17,X18)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])])]) ).
fof(c_0_7,plain,
! [X19,X20] :
( ( member(X19,singleton(X20))
| X19 != X20 )
& ( X19 = X20
| ~ member(X19,singleton(X20)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[singleton])])]) ).
fof(c_0_8,negated_conjecture,
( ~ member(esk1_0,suc(esk1_0))
& member(esk1_0,on) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_9,plain,
( ~ member(X1,union(X2,singleton(X2)))
| member(X1,suc(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ member(X1,X2)
| member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( X1 != X2
| member(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
~ member(esk1_0,suc(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ member(X1,singleton(X2))
| member(X1,suc(X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
member(X1,singleton(X1)),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET813+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % 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 05:39:21 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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.15/0.49 % Version: 3.5.1
% 0.15/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.49 % Starting sh5l with 300s (1) cores
% 0.15/0.49 % new_bool_3 with pid 1793650 completed with status 0
% 0.15/0.49 % Result found by new_bool_3
% 0.15/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.49 % Search class: FGHSF-FFMF31-SFFFFFNN
% 0.15/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.49 % SubtermCWHack with pid 1793653 completed with status 0
% 0.15/0.49 % Result found by SubtermCWHack
% 0.15/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.49 % Search class: FGHSF-FFMF31-SFFFFFNN
% 0.15/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.49 % Preprocessing time : 0.003 s
% 0.15/0.49
% 0.15/0.49 % Proof found!
% 0.15/0.49 % SZS status Theorem
% 0.15/0.49 % SZS output start CNFRefutation
% See solution above
% 0.15/0.49 % Parsed axioms : 20
% 0.15/0.49 % Removed by relevancy pruning/SinE : 9
% 0.15/0.49 % Initial clauses : 56
% 0.15/0.49 % Removed in clause preprocessing : 0
% 0.15/0.49 % Initial clauses in saturation : 56
% 0.15/0.49 % Processed clauses : 31
% 0.15/0.49 % ...of these trivial : 0
% 0.15/0.49 % ...subsumed : 0
% 0.15/0.49 % ...remaining for further processing : 31
% 0.15/0.49 % Other redundant clauses eliminated : 1
% 0.15/0.49 % Clauses deleted for lack of memory : 0
% 0.15/0.49 % Backward-subsumed : 0
% 0.15/0.49 % Backward-rewritten : 0
% 0.15/0.49 % Generated clauses : 29
% 0.15/0.49 % ...of the previous two non-redundant : 24
% 0.15/0.49 % ...aggressively subsumed : 0
% 0.15/0.49 % Contextual simplify-reflections : 0
% 0.15/0.49 % Paramodulations : 28
% 0.15/0.49 % Factorizations : 0
% 0.15/0.49 % NegExts : 0
% 0.15/0.49 % Equation resolutions : 1
% 0.15/0.49 % Disequality decompositions : 0
% 0.15/0.49 % Total rewrite steps : 1
% 0.15/0.49 % ...of those cached : 0
% 0.15/0.49 % Propositional unsat checks : 0
% 0.15/0.49 % Propositional check models : 0
% 0.15/0.49 % Propositional check unsatisfiable : 0
% 0.15/0.49 % Propositional clauses : 0
% 0.15/0.49 % Propositional clauses after purity: 0
% 0.15/0.49 % Propositional unsat core size : 0
% 0.15/0.49 % Propositional preprocessing time : 0.000
% 0.15/0.49 % Propositional encoding time : 0.000
% 0.15/0.49 % Propositional solver time : 0.000
% 0.15/0.49 % Success case prop preproc time : 0.000
% 0.15/0.49 % Success case prop encoding time : 0.000
% 0.15/0.49 % Success case prop solver time : 0.000
% 0.15/0.49 % Current number of processed clauses : 30
% 0.15/0.49 % Positive orientable unit clauses : 3
% 0.15/0.49 % Positive unorientable unit clauses: 0
% 0.15/0.49 % Negative unit clauses : 2
% 0.15/0.49 % Non-unit-clauses : 25
% 0.15/0.49 % Current number of unprocessed clauses: 48
% 0.15/0.49 % ...number of literals in the above : 149
% 0.15/0.49 % Current number of archived formulas : 0
% 0.15/0.49 % Current number of archived clauses : 0
% 0.15/0.49 % Clause-clause subsumption calls (NU) : 126
% 0.15/0.49 % Rec. Clause-clause subsumption calls : 98
% 0.15/0.49 % Non-unit clause-clause subsumptions : 0
% 0.15/0.49 % Unit Clause-clause subsumption calls : 3
% 0.15/0.49 % Rewrite failures with RHS unbound : 0
% 0.15/0.49 % BW rewrite match attempts : 1
% 0.15/0.49 % BW rewrite match successes : 0
% 0.15/0.49 % Condensation attempts : 0
% 0.15/0.49 % Condensation successes : 0
% 0.15/0.49 % Termbank termtop insertions : 3568
% 0.15/0.49 % Search garbage collected termcells : 956
% 0.15/0.49
% 0.15/0.49 % -------------------------------------------------
% 0.15/0.49 % User time : 0.010 s
% 0.15/0.49 % System time : 0.006 s
% 0.15/0.49 % Total time : 0.016 s
% 0.15/0.49 % Maximum resident set size: 3668 pages
% 0.15/0.49
% 0.15/0.49 % -------------------------------------------------
% 0.15/0.49 % User time : 0.012 s
% 0.15/0.49 % System time : 0.014 s
% 0.15/0.49 % Total time : 0.026 s
% 0.15/0.49 % Maximum resident set size: 4864 pages
% 0.15/0.49 % E exiting
%------------------------------------------------------------------------------