%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET130-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 : n014.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.24s 0.63s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 17 unt; 4 nHn; 15 RR)
% Number of literals : 46 ( 7 equ; 20 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 : 42 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_member_of_triple1_2,negated_conjecture,
~ member(u,set_builder(u,set_builder(y,set_builder(z,null_class)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_member_of_triple1_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(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(unordered_pair3,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).
cnf(prove_member_of_triple1_1,negated_conjecture,
member(u,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_member_of_triple1_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(c_0_9,negated_conjecture,
~ member(u,set_builder(u,set_builder(y,set_builder(z,null_class)))),
inference(fof_simplification,[status(thm)],[prove_member_of_triple1_2]) ).
cnf(c_0_10,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
definition_of_set_builder ).
cnf(c_0_11,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_12,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_13,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_14,negated_conjecture,
~ member(u,set_builder(u,set_builder(y,set_builder(z,null_class)))),
c_0_9 ).
cnf(c_0_15,plain,
union(unordered_pair(X1,X1),X2) = set_builder(X1,X2),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_17,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_12 ).
cnf(c_0_18,negated_conjecture,
member(u,universal_class),
prove_member_of_triple1_1 ).
cnf(c_0_19,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_20,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
c_0_13 ).
cnf(c_0_21,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_22,negated_conjecture,
~ member(u,complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(y,y)),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_14,c_0_15]),c_0_15]),c_0_15]),c_0_16]),c_0_16]),c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( member(u,X1)
| member(u,complement(X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_19 ).
cnf(c_0_25,negated_conjecture,
member(u,unordered_pair(X1,u)),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_26,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_21 ).
cnf(c_0_27,negated_conjecture,
member(u,intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
~ member(u,complement(unordered_pair(X1,u))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET130-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.20/0.46 % Computer : n014.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 04:55:35 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 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.24/0.62 % Version: 3.5.1
% 0.24/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.62 % Starting sh5l with 300s (1) cores
% 0.24/0.62 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3183575 completed with status 0
% 0.24/0.62 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.24/0.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.62 % No SInE strategy applied
% 0.24/0.62 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.24/0.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.62 % Starting new_bool_3 with 311s (1) cores
% 0.24/0.62 % Starting new_bool_1 with 308s (1) cores
% 0.24/0.63 % Starting sh5l with 304s (1) cores
% 0.24/0.63 % new_bool_3 with pid 3183584 completed with status 0
% 0.24/0.63 % Result found by new_bool_3
% 0.24/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.63 % No SInE strategy applied
% 0.24/0.63 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.24/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.63 % Starting new_bool_3 with 311s (1) cores
% 0.24/0.63 % Preprocessing time : 0.004 s
% 0.24/0.63 % Presaturation interreduction done
% 0.24/0.63
% 0.24/0.63 % Proof found!
% 0.24/0.63 % SZS status Unsatisfiable
% 0.24/0.63 % SZS output start CNFRefutation
% See solution above
% 0.24/0.63 % Parsed axioms : 94
% 0.24/0.63 % Removed by relevancy pruning/SinE : 0
% 0.24/0.63 % Initial clauses : 94
% 0.24/0.63 % Removed in clause preprocessing : 16
% 0.24/0.63 % Initial clauses in saturation : 78
% 0.24/0.63 % Processed clauses : 241
% 0.24/0.63 % ...of these trivial : 0
% 0.24/0.63 % ...subsumed : 2
% 0.24/0.63 % ...remaining for further processing : 239
% 0.24/0.63 % Other redundant clauses eliminated : 3
% 0.24/0.63 % Clauses deleted for lack of memory : 0
% 0.24/0.63 % Backward-subsumed : 1
% 0.24/0.63 % Backward-rewritten : 5
% 0.24/0.63 % Generated clauses : 403
% 0.24/0.63 % ...of the previous two non-redundant : 309
% 0.24/0.63 % ...aggressively subsumed : 0
% 0.24/0.63 % Contextual simplify-reflections : 0
% 0.24/0.63 % Paramodulations : 400
% 0.24/0.63 % Factorizations : 0
% 0.24/0.63 % NegExts : 0
% 0.24/0.63 % Equation resolutions : 3
% 0.24/0.63 % Disequality decompositions : 0
% 0.24/0.63 % Total rewrite steps : 96
% 0.24/0.63 % ...of those cached : 67
% 0.24/0.63 % Propositional unsat checks : 0
% 0.24/0.63 % Propositional check models : 0
% 0.24/0.63 % Propositional check unsatisfiable : 0
% 0.24/0.63 % Propositional clauses : 0
% 0.24/0.63 % Propositional clauses after purity: 0
% 0.24/0.63 % Propositional unsat core size : 0
% 0.24/0.63 % Propositional preprocessing time : 0.000
% 0.24/0.63 % Propositional encoding time : 0.000
% 0.24/0.63 % Propositional solver time : 0.000
% 0.24/0.63 % Success case prop preproc time : 0.000
% 0.24/0.63 % Success case prop encoding time : 0.000
% 0.24/0.63 % Success case prop solver time : 0.000
% 0.24/0.63 % Current number of processed clauses : 153
% 0.24/0.63 % Positive orientable unit clauses : 46
% 0.24/0.63 % Positive unorientable unit clauses: 1
% 0.24/0.63 % Negative unit clauses : 32
% 0.24/0.63 % Non-unit-clauses : 74
% 0.24/0.63 % Current number of unprocessed clauses: 219
% 0.24/0.63 % ...number of literals in the above : 475
% 0.24/0.63 % Current number of archived formulas : 0
% 0.24/0.63 % Current number of archived clauses : 99
% 0.24/0.63 % Clause-clause subsumption calls (NU) : 1822
% 0.24/0.63 % Rec. Clause-clause subsumption calls : 1122
% 0.24/0.63 % Non-unit clause-clause subsumptions : 3
% 0.24/0.63 % Unit Clause-clause subsumption calls : 224
% 0.24/0.63 % Rewrite failures with RHS unbound : 0
% 0.24/0.63 % BW rewrite match attempts : 47
% 0.24/0.63 % BW rewrite match successes : 5
% 0.24/0.63 % Condensation attempts : 0
% 0.24/0.63 % Condensation successes : 0
% 0.24/0.63 % Termbank termtop insertions : 13576
% 0.24/0.63 % Search garbage collected termcells : 156
% 0.24/0.63
% 0.24/0.63 % -------------------------------------------------
% 0.24/0.63 % User time : 0.041 s
% 0.24/0.63 % System time : 0.009 s
% 0.24/0.63 % Total time : 0.050 s
% 0.24/0.63 % Maximum resident set size: 3976 pages
% 0.24/0.63
% 0.24/0.63 % -------------------------------------------------
% 0.24/0.63 % User time : 0.139 s
% 0.24/0.63 % System time : 0.035 s
% 0.24/0.63 % Total time : 0.175 s
% 0.24/0.63 % Maximum resident set size: 4864 pages
% 0.24/0.63 % E exiting
%------------------------------------------------------------------------------