%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET071-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:13:25 PM UTC 2026
% Result : Unsatisfiable 5.16s 6.18s
% Output : CNFRefutation 5.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 26 ( 12 unt; 10 nHn; 17 RR)
% Number of literals : 49 ( 19 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(unordered_pair_member,axiom,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(prove_null_unordered_pair_2,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_null_unordered_pair_2) ).
cnf(prove_null_unordered_pair_3,negated_conjecture,
~ member(y,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_null_unordered_pair_3) ).
cnf(prove_null_unordered_pair_1,negated_conjecture,
unordered_pair(x,y) != null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_null_unordered_pair_1) ).
cnf(c_0_7,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_8,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_7 ).
cnf(c_0_9,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_10,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_11,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_13,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_10 ).
cnf(c_0_14,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( unordered_pair(X1,X2) = null_class
| regular(unordered_pair(X1,X2)) = X2
| regular(unordered_pair(X1,X2)) = X1 ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
~ member(x,universal_class),
inference(fof_simplification,[status(thm)],[prove_null_unordered_pair_2]) ).
cnf(c_0_17,plain,
( member(X2,universal_class)
| unordered_pair(X1,X2) = null_class
| regular(unordered_pair(X1,X2)) = X1 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
~ member(y,universal_class),
inference(fof_simplification,[status(thm)],[prove_null_unordered_pair_3]) ).
cnf(c_0_19,negated_conjecture,
~ member(x,universal_class),
c_0_16 ).
cnf(c_0_20,plain,
( member(X1,universal_class)
| member(X2,universal_class)
| unordered_pair(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
unordered_pair(x,y) != null_class,
inference(fof_simplification,[status(thm)],[prove_null_unordered_pair_1]) ).
cnf(c_0_22,negated_conjecture,
~ member(y,universal_class),
c_0_18 ).
cnf(c_0_23,negated_conjecture,
( member(X1,universal_class)
| unordered_pair(x,X1) = null_class ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
unordered_pair(x,y) != null_class,
c_0_21 ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET071-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.37 % Computer : n009.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Mon Sep 21 04:49:48 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 5.16/6.18 % Version: 3.5.1
% 5.16/6.18 % Preprocessing class: FSLSSMSMSSSNFFN.
% 5.16/6.18 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.16/6.18 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.16/6.18 % Starting new_bool_3 with 300s (1) cores
% 5.16/6.18 % Starting new_bool_1 with 300s (1) cores
% 5.16/6.18 % Starting sh5l with 300s (1) cores
% 5.16/6.18 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 876858 completed with status 0
% 5.16/6.18 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 5.16/6.18 % Preprocessing class: FSLSSMSMSSSNFFN.
% 5.16/6.18 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.16/6.18 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.16/6.18 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.16/6.18 % No SInE strategy applied
% 5.16/6.18 % Search class: FGHSM-FFLM31-DFFFFFNN
% 5.16/6.18 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.16/6.18 % Starting SubtermCWHack with 136s (1) cores
% 5.16/6.18 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 5.16/6.18 % Starting new_bool_3 with 311s (1) cores
% 5.16/6.18 % Starting new_bool_1 with 308s (1) cores
% 5.16/6.18 % Starting sh5l with 304s (1) cores
% 5.16/6.18 % new_bool_3 with pid 876867 completed with status 0
% 5.16/6.18 % Result found by new_bool_3
% 5.16/6.18 % Preprocessing class: FSLSSMSMSSSNFFN.
% 5.16/6.18 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.16/6.18 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.16/6.18 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.16/6.18 % No SInE strategy applied
% 5.16/6.18 % Search class: FGHSM-FFLM31-DFFFFFNN
% 5.16/6.18 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.16/6.18 % Starting SubtermCWHack with 136s (1) cores
% 5.16/6.18 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 5.16/6.18 % Starting new_bool_3 with 311s (1) cores
% 5.16/6.18 % Preprocessing time : 0.002 s
% 5.16/6.18 % Presaturation interreduction done
% 5.16/6.18
% 5.16/6.18 % Proof found!
% 5.16/6.18 % SZS status Unsatisfiable
% 5.16/6.18 % SZS output start CNFRefutation
% See solution above
% 5.16/6.18 % Parsed axioms : 94
% 5.16/6.18 % Removed by relevancy pruning/SinE : 0
% 5.16/6.18 % Initial clauses : 94
% 5.16/6.18 % Removed in clause preprocessing : 15
% 5.16/6.18 % Initial clauses in saturation : 79
% 5.16/6.18 % Processed clauses : 4434
% 5.16/6.18 % ...of these trivial : 965
% 5.16/6.18 % ...subsumed : 1356
% 5.16/6.18 % ...remaining for further processing : 2113
% 5.16/6.18 % Other redundant clauses eliminated : 11
% 5.16/6.18 % Clauses deleted for lack of memory : 0
% 5.16/6.18 % Backward-subsumed : 113
% 5.16/6.18 % Backward-rewritten : 56
% 5.16/6.18 % Generated clauses : 81778
% 5.16/6.18 % ...of the previous two non-redundant : 75830
% 5.16/6.18 % ...aggressively subsumed : 0
% 5.16/6.18 % Contextual simplify-reflections : 6
% 5.16/6.18 % Paramodulations : 81755
% 5.16/6.18 % Factorizations : 10
% 5.16/6.18 % NegExts : 0
% 5.16/6.18 % Equation resolutions : 13
% 5.16/6.18 % Disequality decompositions : 0
% 5.16/6.18 % Total rewrite steps : 24311
% 5.16/6.18 % ...of those cached : 23255
% 5.16/6.18 % Propositional unsat checks : 0
% 5.16/6.18 % Propositional check models : 0
% 5.16/6.18 % Propositional check unsatisfiable : 0
% 5.16/6.18 % Propositional clauses : 0
% 5.16/6.18 % Propositional clauses after purity: 0
% 5.16/6.18 % Propositional unsat core size : 0
% 5.16/6.18 % Propositional preprocessing time : 0.000
% 5.16/6.18 % Propositional encoding time : 0.000
% 5.16/6.18 % Propositional solver time : 0.000
% 5.16/6.18 % Success case prop preproc time : 0.000
% 5.16/6.18 % Success case prop encoding time : 0.000
% 5.16/6.18 % Success case prop solver time : 0.000
% 5.16/6.18 % Current number of processed clauses : 1863
% 5.16/6.18 % Positive orientable unit clauses : 436
% 5.16/6.18 % Positive unorientable unit clauses: 1
% 5.16/6.18 % Negative unit clauses : 353
% 5.16/6.18 % Non-unit-clauses : 1073
% 5.16/6.18 % Current number of unprocessed clauses: 71418
% 5.16/6.18 % ...number of literals in the above : 103223
% 5.16/6.18 % Current number of archived formulas : 0
% 5.16/6.18 % Current number of archived clauses : 262
% 5.16/6.18 % Clause-clause subsumption calls (NU) : 105176
% 5.16/6.18 % Rec. Clause-clause subsumption calls : 69453
% 5.16/6.18 % Non-unit clause-clause subsumptions : 1043
% 5.16/6.18 % Unit Clause-clause subsumption calls : 12635
% 5.16/6.18 % Rewrite failures with RHS unbound : 0
% 5.16/6.18 % BW rewrite match attempts : 4663
% 5.16/6.18 % BW rewrite match successes : 35
% 5.16/6.18 % Condensation attempts : 0
% 5.16/6.18 % Condensation successes : 0
% 5.16/6.18 % Termbank termtop insertions : 1741450
% 5.16/6.18 % Search garbage collected termcells : 160
% 5.16/6.18
% 5.16/6.18 % -------------------------------------------------
% 5.16/6.18 % User time : 0.675 s
% 5.16/6.18 % System time : 0.044 s
% 5.16/6.18 % Total time : 0.719 s
% 5.16/6.18 % Maximum resident set size: 3720 pages
% 5.16/6.18
% 5.16/6.18 % -------------------------------------------------
% 5.16/6.18 % User time : 3.417 s
% 5.16/6.18 % System time : 0.151 s
% 5.16/6.18 % Total time : 3.569 s
% 5.16/6.18 % Maximum resident set size: 4608 pages
% 5.16/6.18 % E exiting
%------------------------------------------------------------------------------