%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM141-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:44:24 PM UTC 2026
% Result : Unsatisfiable 0.49s 0.65s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 17 unt; 3 nHn; 16 RR)
% Number of literals : 44 ( 7 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_successor_of_set_is_set2_2,negated_conjecture,
~ member(x,successor(x)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_successor_of_set_is_set2_2) ).
cnf(successor,axiom,
union(X1,singleton(X1)) = successor(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',successor) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
cnf(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(prove_successor_of_set_is_set2_1,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_successor_of_set_is_set2_1) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(unordered_pair2,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(c_0_9,negated_conjecture,
~ member(x,successor(x)),
inference(fof_simplification,[status(thm)],[prove_successor_of_set_is_set2_2]) ).
cnf(c_0_10,axiom,
union(X1,singleton(X1)) = successor(X1),
successor ).
cnf(c_0_11,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_12,negated_conjecture,
~ member(x,successor(x)),
c_0_9 ).
cnf(c_0_13,plain,
union(X1,unordered_pair(X1,X1)) = successor(X1),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_15,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_16,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_17,negated_conjecture,
~ member(x,complement(intersection(complement(x),complement(unordered_pair(x,x))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_18,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
member(x,universal_class),
prove_successor_of_set_is_set2_1 ).
cnf(c_0_20,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_21,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
member(x,intersection(complement(x),complement(unordered_pair(x,x)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_23,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_20 ).
cnf(c_0_24,negated_conjecture,
member(x,complement(unordered_pair(x,x))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_26,negated_conjecture,
~ member(x,unordered_pair(x,x)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_25 ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM141-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n020.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 02:08:47 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.55 Running first-order theorem proving
% 0.24/0.56 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.49/0.65 % Version: 3.5.1
% 0.49/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.49/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.49/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.49/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.49/0.65 % Starting sh5l with 300s (1) cores
% 0.49/0.65 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1769326 completed with status 0
% 0.49/0.65 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.49/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.49/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.49/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.49/0.65 % No SInE strategy applied
% 0.49/0.65 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.49/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.49/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.49/0.65 % Starting new_bool_3 with 311s (1) cores
% 0.49/0.65 % Starting new_bool_1 with 308s (1) cores
% 0.49/0.65 % Starting sh5l with 304s (1) cores
% 0.49/0.65 % SubtermCWHack with pid 1769333 completed with status 0
% 0.49/0.65 % Result found by SubtermCWHack
% 0.49/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.49/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.49/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.49/0.65 % No SInE strategy applied
% 0.49/0.65 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.49/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.49/0.65 % Preprocessing time : 0.005 s
% 0.49/0.65
% 0.49/0.65 % Proof found!
% 0.49/0.65 % SZS status Unsatisfiable
% 0.49/0.65 % SZS output start CNFRefutation
% See solution above
% 0.49/0.65 % Parsed axioms : 160
% 0.49/0.65 % Removed by relevancy pruning/SinE : 0
% 0.49/0.65 % Initial clauses : 160
% 0.49/0.65 % Removed in clause preprocessing : 19
% 0.49/0.65 % Initial clauses in saturation : 141
% 0.49/0.65 % Processed clauses : 146
% 0.49/0.65 % ...of these trivial : 0
% 0.49/0.65 % ...subsumed : 24
% 0.49/0.65 % ...remaining for further processing : 122
% 0.49/0.65 % Other redundant clauses eliminated : 2
% 0.49/0.65 % Clauses deleted for lack of memory : 0
% 0.49/0.65 % Backward-subsumed : 6
% 0.49/0.65 % Backward-rewritten : 1
% 0.49/0.65 % Generated clauses : 180
% 0.49/0.65 % ...of the previous two non-redundant : 156
% 0.49/0.65 % ...aggressively subsumed : 0
% 0.49/0.65 % Contextual simplify-reflections : 1
% 0.49/0.65 % Paramodulations : 178
% 0.49/0.65 % Factorizations : 0
% 0.49/0.65 % NegExts : 0
% 0.49/0.65 % Equation resolutions : 2
% 0.49/0.65 % Disequality decompositions : 0
% 0.49/0.65 % Total rewrite steps : 15
% 0.49/0.65 % ...of those cached : 5
% 0.49/0.65 % Propositional unsat checks : 0
% 0.49/0.65 % Propositional check models : 0
% 0.49/0.65 % Propositional check unsatisfiable : 0
% 0.49/0.65 % Propositional clauses : 0
% 0.49/0.65 % Propositional clauses after purity: 0
% 0.49/0.65 % Propositional unsat core size : 0
% 0.49/0.65 % Propositional preprocessing time : 0.000
% 0.49/0.65 % Propositional encoding time : 0.000
% 0.49/0.65 % Propositional solver time : 0.000
% 0.49/0.65 % Success case prop preproc time : 0.000
% 0.49/0.65 % Success case prop encoding time : 0.000
% 0.49/0.65 % Success case prop solver time : 0.000
% 0.49/0.65 % Current number of processed clauses : 113
% 0.49/0.65 % Positive orientable unit clauses : 32
% 0.49/0.65 % Positive unorientable unit clauses: 1
% 0.49/0.65 % Negative unit clauses : 4
% 0.49/0.65 % Non-unit-clauses : 76
% 0.49/0.65 % Current number of unprocessed clauses: 149
% 0.49/0.65 % ...number of literals in the above : 362
% 0.49/0.65 % Current number of archived formulas : 0
% 0.49/0.65 % Current number of archived clauses : 26
% 0.49/0.65 % Clause-clause subsumption calls (NU) : 590
% 0.49/0.65 % Rec. Clause-clause subsumption calls : 450
% 0.49/0.65 % Non-unit clause-clause subsumptions : 25
% 0.49/0.65 % Unit Clause-clause subsumption calls : 86
% 0.49/0.65 % Rewrite failures with RHS unbound : 0
% 0.49/0.65 % BW rewrite match attempts : 10
% 0.49/0.65 % BW rewrite match successes : 3
% 0.49/0.65 % Condensation attempts : 0
% 0.49/0.65 % Condensation successes : 0
% 0.49/0.65 % Termbank termtop insertions : 8468
% 0.49/0.65 % Search garbage collected termcells : 287
% 0.49/0.65
% 0.49/0.65 % -------------------------------------------------
% 0.49/0.65 % User time : 0.025 s
% 0.49/0.65 % System time : 0.008 s
% 0.49/0.65 % Total time : 0.032 s
% 0.49/0.65 % Maximum resident set size: 4036 pages
% 0.49/0.65
% 0.49/0.65 % -------------------------------------------------
% 0.49/0.65 % User time : 0.056 s
% 0.49/0.65 % System time : 0.021 s
% 0.49/0.65 % Total time : 0.077 s
% 0.49/0.65 % Maximum resident set size: 4608 pages
% 0.49/0.65 % E exiting
%------------------------------------------------------------------------------