%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET015-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:04 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of clauses : 53 ( 12 unt; 13 nHn; 42 RR)
% Number of literals : 118 ( 15 equ; 60 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 87 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement1) ).
cnf(complement2,axiom,
( ~ little_set(X1)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement2) ).
cnf(union,axiom,
union(X1,X2) = complement(intersection(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union) ).
cnf(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection3) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection1) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection2) ).
cnf(b_union_a_is_d,hypothesis,
union(bs,as) = ds,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_union_a_is_d) ).
cnf(a2,axiom,
( ~ member(X1,X2)
| little_set(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a2) ).
cnf(a_union_b_is_c,hypothesis,
union(as,bs) = cs,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_union_b_is_c) ).
cnf(extensionality2,axiom,
( X1 = X2
| member(f1(X1,X2),X2)
| member(f1(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',extensionality2) ).
cnf(prove_c_equals_d,negated_conjecture,
cs != ds,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c_equals_d) ).
cnf(extensionality3,axiom,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',extensionality3) ).
cnf(c_0_12,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_13,plain,
( ~ little_set(X1)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_14,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_12 ).
cnf(c_0_15,axiom,
union(X1,X2) = complement(intersection(complement(X1),complement(X2))),
union ).
cnf(c_0_16,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_17,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_18,plain,
( ~ little_set(X1)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_13 ).
cnf(c_0_19,plain,
( ~ member(X1,union(X2,X3))
| ~ member(X1,intersection(complement(X2),complement(X3))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_16 ).
cnf(c_0_21,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_22,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_17 ).
cnf(c_0_23,plain,
( ~ little_set(X1)
| member(X1,union(X2,X3))
| member(X1,intersection(complement(X2),complement(X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_24,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,complement(X3))
| ~ member(X1,union(X2,X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,hypothesis,
union(bs,as) = ds,
b_union_a_is_d ).
cnf(c_0_26,plain,
( ~ member(X1,X2)
| little_set(X1) ),
inference(fof_simplification,[status(thm)],[a2]) ).
cnf(c_0_27,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_21 ).
cnf(c_0_28,plain,
( ~ little_set(X1)
| member(X1,complement(X2))
| member(X1,union(X2,X3)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,hypothesis,
union(as,bs) = cs,
a_union_b_is_c ).
cnf(c_0_30,hypothesis,
( ~ member(X1,ds)
| ~ member(X1,complement(bs))
| ~ member(X1,complement(as)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ member(X1,X2)
| little_set(X1) ),
c_0_26 ).
cnf(c_0_32,plain,
( ~ little_set(X1)
| member(X1,complement(X3))
| member(X1,union(X2,X3)) ),
inference(spm,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_33,hypothesis,
( ~ little_set(X1)
| member(X1,cs)
| member(X1,complement(as)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,hypothesis,
( ~ member(X1,ds)
| ~ member(X1,complement(bs))
| member(X1,as) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_18]),c_0_31]) ).
cnf(c_0_35,hypothesis,
( ~ little_set(X1)
| member(X1,cs)
| member(X1,complement(bs)) ),
inference(spm,[status(thm)],[c_0_32,c_0_29]) ).
cnf(c_0_36,hypothesis,
( ~ member(X1,as)
| member(X1,cs) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_33]),c_0_31]) ).
cnf(c_0_37,hypothesis,
( ~ member(X1,ds)
| member(X1,cs) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_31]),c_0_36]) ).
cnf(c_0_38,axiom,
( X1 = X2
| member(f1(X1,X2),X2)
| member(f1(X1,X2),X1) ),
extensionality2 ).
cnf(c_0_39,negated_conjecture,
cs != ds,
inference(fof_simplification,[status(thm)],[prove_c_equals_d]) ).
cnf(c_0_40,plain,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[extensionality3]) ).
cnf(c_0_41,hypothesis,
( member(f1(ds,X1),X1)
| member(f1(ds,X1),cs)
| ds = X1 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
cs != ds,
c_0_39 ).
cnf(c_0_43,hypothesis,
( ~ member(X1,cs)
| ~ member(X1,complement(as))
| ~ member(X1,complement(bs)) ),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_44,hypothesis,
( ~ little_set(X1)
| member(X1,ds)
| member(X1,complement(as)) ),
inference(spm,[status(thm)],[c_0_32,c_0_25]) ).
cnf(c_0_45,plain,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
c_0_40 ).
cnf(c_0_46,hypothesis,
member(f1(ds,cs),cs),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_41]),c_0_42]) ).
cnf(c_0_47,hypothesis,
( ~ member(X1,cs)
| ~ member(X1,complement(bs))
| member(X1,as) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_18]),c_0_31]) ).
cnf(c_0_48,hypothesis,
( ~ little_set(X1)
| member(X1,ds)
| member(X1,complement(bs)) ),
inference(spm,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_49,hypothesis,
( ~ member(X1,as)
| member(X1,ds) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_44]),c_0_31]) ).
cnf(c_0_50,hypothesis,
~ member(f1(ds,cs),ds),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_42]) ).
cnf(c_0_51,hypothesis,
( ~ member(X1,cs)
| member(X1,ds) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_31]),c_0_49]) ).
cnf(c_0_52,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET015-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n006.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 04:42:42 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % sh5l with pid 2021371 completed with status 0
% 0.11/0.45 % Result found by sh5l
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.45 % Search class: FGHSF-FFSF21-MFFFFFNN
% 0.11/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45 % SubtermCWHack with pid 2021374 completed with status 0
% 0.11/0.45 % Result found by SubtermCWHack
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.45 % Search class: FGHSF-FFSF21-MFFFFFNN
% 0.11/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.45 % Preprocessing time : 0.001 s
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Unsatisfiable
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 15
% 0.11/0.45 % Removed by relevancy pruning/SinE : 1
% 0.11/0.45 % Initial clauses : 14
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 14
% 0.11/0.45 % Processed clauses : 103
% 0.11/0.45 % ...of these trivial : 1
% 0.11/0.45 % ...subsumed : 34
% 0.11/0.45 % ...remaining for further processing : 68
% 0.11/0.45 % Other redundant clauses eliminated : 0
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 0
% 0.11/0.45 % Backward-rewritten : 0
% 0.11/0.45 % Generated clauses : 281
% 0.11/0.45 % ...of the previous two non-redundant : 244
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 12
% 0.11/0.45 % Paramodulations : 271
% 0.11/0.45 % Factorizations : 10
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 0
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 31
% 0.11/0.45 % ...of those cached : 20
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 68
% 0.11/0.45 % Positive orientable unit clauses : 7
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 2
% 0.11/0.45 % Non-unit-clauses : 59
% 0.11/0.45 % Current number of unprocessed clauses: 153
% 0.11/0.45 % ...number of literals in the above : 506
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 0
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 675
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 597
% 0.11/0.45 % Non-unit clause-clause subsumptions : 46
% 0.11/0.45 % Unit Clause-clause subsumption calls : 21
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 0
% 0.11/0.45 % BW rewrite match successes : 0
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 4307
% 0.11/0.45 % Search garbage collected termcells : 22
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.008 s
% 0.11/0.45 % System time : 0.003 s
% 0.11/0.45 % Total time : 0.011 s
% 0.11/0.45 % Maximum resident set size: 3640 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.008 s
% 0.11/0.45 % System time : 0.009 s
% 0.11/0.45 % Total time : 0.018 s
% 0.11/0.45 % Maximum resident set size: 4864 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------