%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET012-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:01 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 47 ( 12 unt; 8 nHn; 39 RR)
% Number of literals : 89 ( 0 equ; 43 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(membership_in_subsets,axiom,
( ~ subset(X2,X3)
| ~ member(X1,X2)
| member(X1,X3) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/SET002-0.ax',symmetry_for_set_equal) ).
cnf(complement_of_b_is_c,hypothesis,
equal_sets(complement(b),c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_b_is_c) ).
cnf(not_member_of_set_and_complement,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',not_member_of_set_and_complement) ).
cnf(complement_of_a_is_b,hypothesis,
equal_sets(complement(a),b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_a_is_b) ).
cnf(subsets_axiom2,axiom,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',subsets_axiom2) ).
cnf(member_of_set_or_complement,axiom,
( member(X1,complement(X2))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',member_of_set_or_complement) ).
cnf(subsets_axiom1,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SET002-0.ax',subsets_are_set_equal_sets) ).
cnf(prove_a_equals_c,negated_conjecture,
~ equal_sets(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_equals_c) ).
cnf(c_0_11,plain,
( ~ subset(X2,X3)
| ~ member(X1,X2)
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[membership_in_subsets]) ).
cnf(c_0_12,plain,
( ~ equal_sets(X1,X2)
| subset(X2,X1) ),
inference(fof_simplification,[status(thm)],[set_equal_sets_are_subsets2]) ).
cnf(c_0_13,plain,
( ~ equal_sets(X1,X2)
| equal_sets(X2,X1) ),
inference(fof_simplification,[status(thm)],[symmetry_for_set_equal]) ).
cnf(c_0_14,plain,
( ~ subset(X2,X3)
| ~ member(X1,X2)
| member(X1,X3) ),
c_0_11 ).
cnf(c_0_15,plain,
( ~ equal_sets(X1,X2)
| subset(X2,X1) ),
c_0_12 ).
cnf(c_0_16,plain,
( ~ equal_sets(X1,X2)
| equal_sets(X2,X1) ),
c_0_13 ).
cnf(c_0_17,hypothesis,
equal_sets(complement(b),c),
complement_of_b_is_c ).
cnf(c_0_18,plain,
( ~ member(X1,X3)
| ~ equal_sets(X2,X3)
| member(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,hypothesis,
equal_sets(c,complement(b)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_member_of_set_and_complement]) ).
cnf(c_0_21,hypothesis,
equal_sets(complement(a),b),
complement_of_a_is_b ).
cnf(c_0_22,plain,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
inference(fof_simplification,[status(thm)],[subsets_axiom2]) ).
cnf(c_0_23,hypothesis,
( ~ member(X1,complement(b))
| member(X1,c) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,axiom,
( member(X1,complement(X2))
| member(X1,X2) ),
member_of_set_or_complement ).
cnf(c_0_25,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_20 ).
cnf(c_0_26,hypothesis,
( ~ member(X1,b)
| member(X1,complement(a)) ),
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_27,plain,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
c_0_22 ).
cnf(c_0_28,hypothesis,
( member(X1,c)
| member(X1,b) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,hypothesis,
( ~ member(X1,c)
| member(X1,complement(b)) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_30,hypothesis,
equal_sets(b,complement(a)),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_31,hypothesis,
( ~ member(X1,b)
| ~ member(X1,a) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,hypothesis,
( member(member_of_1_not_of_2(X1,c),b)
| subset(X1,c) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,hypothesis,
( ~ member(X1,c)
| ~ member(X1,b) ),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_34,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
subsets_axiom1 ).
cnf(c_0_35,hypothesis,
( ~ member(X1,complement(a))
| member(X1,b) ),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_36,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| equal_sets(X2,X1) ),
inference(fof_simplification,[status(thm)],[subsets_are_set_equal_sets]) ).
cnf(c_0_37,hypothesis,
( ~ member(member_of_1_not_of_2(X1,c),a)
| subset(X1,c) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
~ equal_sets(a,c),
inference(fof_simplification,[status(thm)],[prove_a_equals_c]) ).
cnf(c_0_39,hypothesis,
( ~ member(member_of_1_not_of_2(c,X1),b)
| subset(c,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,hypothesis,
( member(X1,b)
| member(X1,a) ),
inference(spm,[status(thm)],[c_0_35,c_0_24]) ).
cnf(c_0_41,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| equal_sets(X2,X1) ),
c_0_36 ).
cnf(c_0_42,hypothesis,
subset(a,c),
inference(spm,[status(thm)],[c_0_37,c_0_34]) ).
cnf(c_0_43,negated_conjecture,
~ equal_sets(a,c),
c_0_38 ).
cnf(c_0_44,hypothesis,
( member(member_of_1_not_of_2(c,X1),a)
| subset(c,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,hypothesis,
~ subset(c,a),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_46,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET012-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n002.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:44:18 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 2450336 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: FGHNF-FFSF21-SFFFFFNN
% 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 2450345 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: FGHNF-FFSF21-SFFFFFNN
% 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 : 24
% 0.11/0.45 % Removed by relevancy pruning/SinE : 4
% 0.11/0.45 % Initial clauses : 20
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 20
% 0.11/0.45 % Processed clauses : 81
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 13
% 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 : 170
% 0.11/0.45 % ...of the previous two non-redundant : 138
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 0
% 0.11/0.45 % Paramodulations : 170
% 0.11/0.45 % Factorizations : 0
% 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 : 17
% 0.11/0.45 % ...of those cached : 9
% 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 : 16
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 3
% 0.11/0.45 % Non-unit-clauses : 49
% 0.11/0.45 % Current number of unprocessed clauses: 76
% 0.11/0.45 % ...number of literals in the above : 178
% 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) : 191
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 176
% 0.11/0.45 % Non-unit clause-clause subsumptions : 12
% 0.11/0.45 % Unit Clause-clause subsumption calls : 32
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 6
% 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 : 2264
% 0.11/0.45 % Search garbage collected termcells : 51
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.005 s
% 0.11/0.45 % System time : 0.004 s
% 0.11/0.45 % Total time : 0.009 s
% 0.11/0.45 % Maximum resident set size: 3904 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.009 s
% 0.11/0.45 % System time : 0.006 s
% 0.11/0.45 % Total time : 0.015 s
% 0.11/0.45 % Maximum resident set size: 4864 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------