%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET013-2 : 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 : n004.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:02 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.46s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of clauses : 56 ( 13 unt; 6 nHn; 50 RR)
% Number of literals : 113 ( 0 equ; 56 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 83 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(membership_in_subsets,axiom,
( ~ subset(X2,X3)
| ~ member(X1,X2)
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',membership_in_subsets) ).
cnf(set_equal_sets_are_subsets2,axiom,
( ~ equal_sets(X1,X2)
| subset(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',set_equal_sets_are_subsets2) ).
cnf(symmetry_for_set_equal,axiom,
( ~ equal_sets(X1,X2)
| equal_sets(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',symmetry_for_set_equal) ).
cnf(intersection_of_b_and_a_is_d,hypothesis,
equal_sets(intersection(bs,as),ds),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_b_and_a_is_d) ).
cnf(member_of_both_is_member_of_intersection,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',member_of_both_is_member_of_intersection) ).
cnf(member_of_intersection_is_member_of_set2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',member_of_intersection_is_member_of_set2) ).
cnf(intersection_of_a_and_b_is_c,hypothesis,
equal_sets(intersection(as,bs),cs),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_a_and_b_is_c) ).
cnf(member_of_intersection_is_member_of_set1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',member_of_intersection_is_member_of_set1) ).
cnf(subsets_axiom2,axiom,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',subsets_axiom2) ).
cnf(subsets_axiom1,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',subsets_axiom1) ).
cnf(subsets_are_set_equal_sets,axiom,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| equal_sets(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',subsets_are_set_equal_sets) ).
cnf(prove_c_equals_d,negated_conjecture,
~ equal_sets(cs,ds),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c_equals_d) ).
cnf(c_0_12,plain,
( ~ subset(X2,X3)
| ~ member(X1,X2)
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[membership_in_subsets]) ).
cnf(c_0_13,plain,
( ~ equal_sets(X1,X2)
| subset(X2,X1) ),
inference(fof_simplification,[status(thm)],[set_equal_sets_are_subsets2]) ).
cnf(c_0_14,plain,
( ~ equal_sets(X1,X2)
| equal_sets(X2,X1) ),
inference(fof_simplification,[status(thm)],[symmetry_for_set_equal]) ).
cnf(c_0_15,plain,
( ~ subset(X2,X3)
| ~ member(X1,X2)
| member(X1,X3) ),
c_0_12 ).
cnf(c_0_16,plain,
( ~ equal_sets(X1,X2)
| subset(X2,X1) ),
c_0_13 ).
cnf(c_0_17,plain,
( ~ equal_sets(X1,X2)
| equal_sets(X2,X1) ),
c_0_14 ).
cnf(c_0_18,hypothesis,
equal_sets(intersection(bs,as),ds),
intersection_of_b_and_a_is_d ).
cnf(c_0_19,plain,
( ~ member(X1,X3)
| ~ equal_sets(X2,X3)
| member(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,hypothesis,
equal_sets(ds,intersection(bs,as)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[member_of_both_is_member_of_intersection]) ).
cnf(c_0_22,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[member_of_intersection_is_member_of_set2]) ).
cnf(c_0_23,hypothesis,
equal_sets(intersection(as,bs),cs),
intersection_of_a_and_b_is_c ).
cnf(c_0_24,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[member_of_intersection_is_member_of_set1]) ).
cnf(c_0_25,plain,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
inference(fof_simplification,[status(thm)],[subsets_axiom2]) ).
cnf(c_0_26,hypothesis,
( ~ member(X1,intersection(bs,as))
| member(X1,ds) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_21 ).
cnf(c_0_28,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_22 ).
cnf(c_0_29,hypothesis,
( ~ member(X1,cs)
| member(X1,intersection(as,bs)) ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_30,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_24 ).
cnf(c_0_31,hypothesis,
equal_sets(cs,intersection(as,bs)),
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_32,plain,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
c_0_25 ).
cnf(c_0_33,hypothesis,
( ~ member(X1,bs)
| ~ member(X1,as)
| member(X1,ds) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,hypothesis,
( ~ member(X1,cs)
| member(X1,bs) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
subsets_axiom1 ).
cnf(c_0_36,hypothesis,
( ~ member(X1,cs)
| member(X1,as) ),
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_37,hypothesis,
( ~ member(X1,intersection(as,bs))
| member(X1,cs) ),
inference(spm,[status(thm)],[c_0_19,c_0_31]) ).
cnf(c_0_38,hypothesis,
( ~ member(X1,ds)
| member(X1,intersection(bs,as)) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_39,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| equal_sets(X2,X1) ),
inference(fof_simplification,[status(thm)],[subsets_are_set_equal_sets]) ).
cnf(c_0_40,hypothesis,
( ~ member(member_of_1_not_of_2(X1,ds),bs)
| ~ member(member_of_1_not_of_2(X1,ds),as)
| subset(X1,ds) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,hypothesis,
( member(member_of_1_not_of_2(cs,X1),bs)
| subset(cs,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,hypothesis,
( member(member_of_1_not_of_2(cs,X1),as)
| subset(cs,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_43,negated_conjecture,
~ equal_sets(cs,ds),
inference(fof_simplification,[status(thm)],[prove_c_equals_d]) ).
cnf(c_0_44,hypothesis,
( ~ member(X1,as)
| ~ member(X1,bs)
| member(X1,cs) ),
inference(spm,[status(thm)],[c_0_37,c_0_27]) ).
cnf(c_0_45,hypothesis,
( ~ member(X1,ds)
| member(X1,bs) ),
inference(spm,[status(thm)],[c_0_30,c_0_38]) ).
cnf(c_0_46,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| equal_sets(X2,X1) ),
c_0_39 ).
cnf(c_0_47,hypothesis,
subset(cs,ds),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_48,negated_conjecture,
~ equal_sets(cs,ds),
c_0_43 ).
cnf(c_0_49,hypothesis,
( ~ member(member_of_1_not_of_2(X1,cs),as)
| ~ member(member_of_1_not_of_2(X1,cs),bs)
| subset(X1,cs) ),
inference(spm,[status(thm)],[c_0_32,c_0_44]) ).
cnf(c_0_50,hypothesis,
( member(member_of_1_not_of_2(ds,X1),bs)
| subset(ds,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_35]) ).
cnf(c_0_51,hypothesis,
~ subset(ds,cs),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_52,hypothesis,
( ~ member(X1,ds)
| member(X1,as) ),
inference(spm,[status(thm)],[c_0_28,c_0_38]) ).
cnf(c_0_53,hypothesis,
~ member(member_of_1_not_of_2(ds,cs),as),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_54,hypothesis,
( member(member_of_1_not_of_2(ds,X1),as)
| subset(ds,X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_35]) ).
cnf(c_0_55,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET013-2 : 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/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 04:41:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.46 % Version: 3.5.1
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.46 % Starting sh5l with 300s (1) cores
% 0.10/0.46 % sh5l with pid 2266893 completed with status 0
% 0.10/0.46 % Result found by sh5l
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.46 % Starting sh5l with 300s (1) cores
% 0.10/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.46 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.10/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.46 % SubtermCWHack with pid 2266901 completed with status 0
% 0.10/0.46 % Result found by SubtermCWHack
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.46 % Starting sh5l with 300s (1) cores
% 0.10/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.46 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.10/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.46 % Preprocessing time : 0.001 s
% 0.10/0.46
% 0.10/0.46 % Proof found!
% 0.10/0.46 % SZS status Unsatisfiable
% 0.10/0.46 % SZS output start CNFRefutation
% See solution above
% 0.10/0.46 % Parsed axioms : 24
% 0.10/0.46 % Removed by relevancy pruning/SinE : 6
% 0.10/0.46 % Initial clauses : 18
% 0.10/0.46 % Removed in clause preprocessing : 0
% 0.10/0.46 % Initial clauses in saturation : 18
% 0.10/0.46 % Processed clauses : 410
% 0.10/0.46 % ...of these trivial : 0
% 0.10/0.46 % ...subsumed : 130
% 0.10/0.46 % ...remaining for further processing : 280
% 0.10/0.46 % Other redundant clauses eliminated : 0
% 0.10/0.46 % Clauses deleted for lack of memory : 0
% 0.10/0.46 % Backward-subsumed : 1
% 0.10/0.46 % Backward-rewritten : 2
% 0.10/0.46 % Generated clauses : 1493
% 0.10/0.46 % ...of the previous two non-redundant : 1391
% 0.10/0.46 % ...aggressively subsumed : 0
% 0.10/0.46 % Contextual simplify-reflections : 1
% 0.10/0.46 % Paramodulations : 1487
% 0.10/0.46 % Factorizations : 6
% 0.10/0.46 % NegExts : 0
% 0.10/0.46 % Equation resolutions : 0
% 0.10/0.46 % Disequality decompositions : 0
% 0.10/0.46 % Total rewrite steps : 64
% 0.10/0.46 % ...of those cached : 17
% 0.10/0.46 % Propositional unsat checks : 0
% 0.10/0.46 % Propositional check models : 0
% 0.10/0.46 % Propositional check unsatisfiable : 0
% 0.10/0.46 % Propositional clauses : 0
% 0.10/0.46 % Propositional clauses after purity: 0
% 0.10/0.46 % Propositional unsat core size : 0
% 0.10/0.46 % Propositional preprocessing time : 0.000
% 0.10/0.46 % Propositional encoding time : 0.000
% 0.10/0.46 % Propositional solver time : 0.000
% 0.10/0.46 % Success case prop preproc time : 0.000
% 0.10/0.46 % Success case prop encoding time : 0.000
% 0.10/0.46 % Success case prop solver time : 0.000
% 0.10/0.46 % Current number of processed clauses : 277
% 0.10/0.46 % Positive orientable unit clauses : 111
% 0.10/0.46 % Positive unorientable unit clauses: 0
% 0.10/0.46 % Negative unit clauses : 4
% 0.10/0.46 % Non-unit-clauses : 162
% 0.10/0.46 % Current number of unprocessed clauses: 995
% 0.10/0.46 % ...number of literals in the above : 2393
% 0.10/0.46 % Current number of archived formulas : 0
% 0.10/0.46 % Current number of archived clauses : 3
% 0.10/0.46 % Clause-clause subsumption calls (NU) : 1572
% 0.10/0.46 % Rec. Clause-clause subsumption calls : 1552
% 0.10/0.46 % Non-unit clause-clause subsumptions : 126
% 0.10/0.46 % Unit Clause-clause subsumption calls : 250
% 0.10/0.46 % Rewrite failures with RHS unbound : 0
% 0.10/0.46 % BW rewrite match attempts : 156
% 0.10/0.46 % BW rewrite match successes : 2
% 0.10/0.46 % Condensation attempts : 0
% 0.10/0.46 % Condensation successes : 0
% 0.10/0.46 % Termbank termtop insertions : 23046
% 0.10/0.46 % Search garbage collected termcells : 55
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.030 s
% 0.10/0.46 % System time : 0.003 s
% 0.10/0.46 % Total time : 0.033 s
% 0.10/0.46 % Maximum resident set size: 3648 pages
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.031 s
% 0.10/0.46 % System time : 0.008 s
% 0.10/0.46 % Total time : 0.039 s
% 0.10/0.46 % Maximum resident set size: 4864 pages
% 0.10/0.46 % E exiting
%------------------------------------------------------------------------------