%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET131-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:41 PM UTC 2026
% Result : Unsatisfiable 0.31s 0.65s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 20 unt; 3 nHn; 22 RR)
% Number of literals : 53 ( 7 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_member_of_triple2_2,negated_conjecture,
~ member(u,set_builder(x,set_builder(u,set_builder(z,null_class)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_member_of_triple2_2) ).
cnf(definition_of_set_builder,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_of_set_builder) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).
cnf(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(prove_member_of_triple2_1,negated_conjecture,
member(u,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_member_of_triple2_1) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(unordered_pair2,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(c_0_10,negated_conjecture,
~ member(u,set_builder(x,set_builder(u,set_builder(z,null_class)))),
inference(fof_simplification,[status(thm)],[prove_member_of_triple2_2]) ).
cnf(c_0_11,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
definition_of_set_builder ).
cnf(c_0_12,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_13,negated_conjecture,
~ member(u,set_builder(x,set_builder(u,set_builder(z,null_class)))),
c_0_10 ).
cnf(c_0_14,plain,
union(unordered_pair(X1,X1),X2) = set_builder(X1,X2),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_16,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_17,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_18,negated_conjecture,
~ member(u,complement(intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]),c_0_14]),c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_19,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
member(u,universal_class),
prove_member_of_triple2_1 ).
cnf(c_0_21,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_22,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
member(u,intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_24,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_21 ).
cnf(c_0_25,negated_conjecture,
member(u,complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_27,negated_conjecture,
~ member(u,complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_26 ).
cnf(c_0_29,negated_conjecture,
member(u,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_19]),c_0_20])]) ).
cnf(c_0_30,negated_conjecture,
member(u,complement(unordered_pair(u,u))),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_32,negated_conjecture,
~ member(u,unordered_pair(u,u)),
inference(spm,[status(thm)],[c_0_24,c_0_30]) ).
cnf(c_0_33,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_31 ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET131-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.47 % Computer : n009.cluster.edu
% 0.21/0.47 % Model : x86_64 x86_64
% 0.21/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.47 % Memory : 8046.5625MB
% 0.21/0.47 % OS : Linux 6.8.0-71-generic
% 0.21/0.47 % CPULimit : 300
% 0.21/0.47 % WCLimit : 300
% 0.21/0.47 % DateTime : Mon Sep 21 04:55:28 UTC 2026
% 0.21/0.47 % CPUTime :
% 0.21/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.54 Running first-order theorem proving
% 0.25/0.55 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
% 0.31/0.65 % Version: 3.5.1
% 0.31/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.31/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.31/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.65 % Starting sh5l with 300s (1) cores
% 0.31/0.65 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 888633 completed with status 0
% 0.31/0.65 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.31/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.31/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.31/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.65 % No SInE strategy applied
% 0.31/0.65 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.31/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.31/0.65 % Starting new_bool_3 with 311s (1) cores
% 0.31/0.65 % Starting new_bool_1 with 308s (1) cores
% 0.31/0.65 % Starting sh5l with 304s (1) cores
% 0.31/0.65 % sh5l with pid 888641 completed with status 0
% 0.31/0.65 % Result found by sh5l
% 0.31/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.31/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.31/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.65 % No SInE strategy applied
% 0.31/0.65 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.31/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.31/0.65 % Starting new_bool_3 with 311s (1) cores
% 0.31/0.65 % Starting new_bool_1 with 308s (1) cores
% 0.31/0.65 % Starting sh5l with 304s (1) cores
% 0.31/0.65 % Preprocessing time : 0.004 s
% 0.31/0.65 % Presaturation interreduction done
% 0.31/0.65
% 0.31/0.65 % Proof found!
% 0.31/0.65 % SZS status Unsatisfiable
% 0.31/0.65 % SZS output start CNFRefutation
% See solution above
% 0.31/0.65 % Parsed axioms : 94
% 0.31/0.65 % Removed by relevancy pruning/SinE : 0
% 0.31/0.65 % Initial clauses : 94
% 0.31/0.65 % Removed in clause preprocessing : 16
% 0.31/0.65 % Initial clauses in saturation : 78
% 0.31/0.65 % Processed clauses : 140
% 0.31/0.65 % ...of these trivial : 0
% 0.31/0.65 % ...subsumed : 1
% 0.31/0.65 % ...remaining for further processing : 139
% 0.31/0.65 % Other redundant clauses eliminated : 3
% 0.31/0.65 % Clauses deleted for lack of memory : 0
% 0.31/0.65 % Backward-subsumed : 1
% 0.31/0.65 % Backward-rewritten : 0
% 0.31/0.65 % Generated clauses : 63
% 0.31/0.65 % ...of the previous two non-redundant : 44
% 0.31/0.65 % ...aggressively subsumed : 0
% 0.31/0.65 % Contextual simplify-reflections : 1
% 0.31/0.65 % Paramodulations : 60
% 0.31/0.65 % Factorizations : 0
% 0.31/0.65 % NegExts : 0
% 0.31/0.65 % Equation resolutions : 3
% 0.31/0.65 % Disequality decompositions : 0
% 0.31/0.65 % Total rewrite steps : 14
% 0.31/0.65 % ...of those cached : 8
% 0.31/0.65 % Propositional unsat checks : 0
% 0.31/0.65 % Propositional check models : 0
% 0.31/0.65 % Propositional check unsatisfiable : 0
% 0.31/0.65 % Propositional clauses : 0
% 0.31/0.65 % Propositional clauses after purity: 0
% 0.31/0.65 % Propositional unsat core size : 0
% 0.31/0.65 % Propositional preprocessing time : 0.000
% 0.31/0.65 % Propositional encoding time : 0.000
% 0.31/0.65 % Propositional solver time : 0.000
% 0.31/0.65 % Success case prop preproc time : 0.000
% 0.31/0.65 % Success case prop encoding time : 0.000
% 0.31/0.65 % Success case prop solver time : 0.000
% 0.31/0.65 % Current number of processed clauses : 58
% 0.31/0.65 % Positive orientable unit clauses : 22
% 0.31/0.65 % Positive unorientable unit clauses: 0
% 0.31/0.65 % Negative unit clauses : 5
% 0.31/0.65 % Non-unit-clauses : 31
% 0.31/0.65 % Current number of unprocessed clauses: 59
% 0.31/0.65 % ...number of literals in the above : 143
% 0.31/0.65 % Current number of archived formulas : 0
% 0.31/0.65 % Current number of archived clauses : 94
% 0.31/0.65 % Clause-clause subsumption calls (NU) : 880
% 0.31/0.65 % Rec. Clause-clause subsumption calls : 517
% 0.31/0.65 % Non-unit clause-clause subsumptions : 2
% 0.31/0.65 % Unit Clause-clause subsumption calls : 52
% 0.31/0.65 % Rewrite failures with RHS unbound : 0
% 0.31/0.65 % BW rewrite match attempts : 7
% 0.31/0.65 % BW rewrite match successes : 1
% 0.31/0.65 % Condensation attempts : 140
% 0.31/0.65 % Condensation successes : 0
% 0.31/0.65 % Termbank termtop insertions : 7302
% 0.31/0.65 % Search garbage collected termcells : 156
% 0.31/0.65
% 0.31/0.65 % -------------------------------------------------
% 0.31/0.65 % User time : 0.029 s
% 0.31/0.65 % System time : 0.005 s
% 0.31/0.65 % Total time : 0.034 s
% 0.31/0.65 % Maximum resident set size: 3720 pages
% 0.31/0.65
% 0.31/0.65 % -------------------------------------------------
% 0.31/0.65 % User time : 0.156 s
% 0.31/0.65 % System time : 0.031 s
% 0.31/0.65 % Total time : 0.187 s
% 0.31/0.65 % Maximum resident set size: 4864 pages
% 0.31/0.65 % E exiting
%------------------------------------------------------------------------------