%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET009-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:00 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.43s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 36 ( 11 unt; 9 nHn; 33 RR)
% Number of literals : 79 ( 0 equ; 41 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 63 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(member_of_difference_or_set2,axiom,
( ~ difference(X2,X3,X4)
| ~ member(X1,X2)
| member(X1,X3)
| member(X1,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-3.ax',member_of_difference_or_set2) ).
cnf(membership_in_subsets,axiom,
( ~ subset(X2,X3)
| ~ member(X1,X2)
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax',membership_in_subsets) ).
cnf(subsets_axiom2,axiom,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax',subsets_axiom2) ).
cnf(b_minus_d,hypothesis,
difference(b,d,bDd),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_minus_d) ).
cnf(member_of_difference,axiom,
( ~ member(X4,X3)
| ~ difference(X1,X2,X3)
| member(X4,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-3.ax',member_of_difference) ).
cnf(not_member_of_difference,axiom,
( ~ difference(X4,X2,X3)
| ~ member(X1,X3)
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-3.ax',not_member_of_difference) ).
cnf(d_is_a_subset_of_a,hypothesis,
subset(d,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_is_a_subset_of_a) ).
cnf(b_minus_a,hypothesis,
difference(b,a,bDa),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_minus_a) ).
cnf(subsets_axiom1,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax',subsets_axiom1) ).
cnf(prove_bDa_is_a_subset_of_bDd,negated_conjecture,
~ subset(bDa,bDd),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_bDa_is_a_subset_of_bDd) ).
cnf(c_0_10,plain,
( ~ difference(X2,X3,X4)
| ~ member(X1,X2)
| member(X1,X3)
| member(X1,X4) ),
inference(fof_simplification,[status(thm)],[member_of_difference_or_set2]) ).
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,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
inference(fof_simplification,[status(thm)],[subsets_axiom2]) ).
cnf(c_0_13,plain,
( ~ difference(X2,X3,X4)
| ~ member(X1,X2)
| member(X1,X3)
| member(X1,X4) ),
c_0_10 ).
cnf(c_0_14,hypothesis,
difference(b,d,bDd),
b_minus_d ).
cnf(c_0_15,plain,
( ~ member(X4,X3)
| ~ difference(X1,X2,X3)
| member(X4,X1) ),
inference(fof_simplification,[status(thm)],[member_of_difference]) ).
cnf(c_0_16,plain,
( ~ difference(X4,X2,X3)
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_member_of_difference]) ).
cnf(c_0_17,plain,
( ~ subset(X2,X3)
| ~ member(X1,X2)
| member(X1,X3) ),
c_0_11 ).
cnf(c_0_18,hypothesis,
subset(d,a),
d_is_a_subset_of_a ).
cnf(c_0_19,plain,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
c_0_12 ).
cnf(c_0_20,hypothesis,
( ~ member(X1,b)
| member(X1,d)
| member(X1,bDd) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( ~ member(X4,X3)
| ~ difference(X1,X2,X3)
| member(X4,X1) ),
c_0_15 ).
cnf(c_0_22,hypothesis,
difference(b,a,bDa),
b_minus_a ).
cnf(c_0_23,plain,
( ~ difference(X4,X2,X3)
| ~ member(X1,X3)
| ~ member(X1,X2) ),
c_0_16 ).
cnf(c_0_24,hypothesis,
( ~ member(X1,d)
| member(X1,a) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,hypothesis,
( ~ member(member_of_1_not_of_2(X1,bDd),b)
| member(member_of_1_not_of_2(X1,bDd),d)
| subset(X1,bDd) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,hypothesis,
( ~ member(X1,bDa)
| member(X1,b) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
subsets_axiom1 ).
cnf(c_0_28,negated_conjecture,
~ subset(bDa,bDd),
inference(fof_simplification,[status(thm)],[prove_bDa_is_a_subset_of_bDd]) ).
cnf(c_0_29,hypothesis,
( ~ member(X1,a)
| ~ member(X1,bDa) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_30,hypothesis,
( ~ member(member_of_1_not_of_2(X1,bDd),b)
| member(member_of_1_not_of_2(X1,bDd),a)
| subset(X1,bDd) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,hypothesis,
( member(member_of_1_not_of_2(bDa,X1),b)
| subset(bDa,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
~ subset(bDa,bDd),
c_0_28 ).
cnf(c_0_33,hypothesis,
( ~ member(member_of_1_not_of_2(bDa,X1),a)
| subset(bDa,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_34,hypothesis,
member(member_of_1_not_of_2(bDa,bDd),a),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n011.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:10 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.43 % Version: 3.5.1
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % sh5l with pid 986709 completed with status 0
% 0.10/0.43 % Result found by sh5l
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.43 % Search class: FGHNF-FFSS32-SFFFFFNN
% 0.10/0.43 % partial match(1): FGHNF-FFSS22-SFFFFFNN
% 0.10/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % SubtermCWHack with pid 986716 completed with status 0
% 0.10/0.43 % Result found by SubtermCWHack
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.43 % Search class: FGHNF-FFSS32-SFFFFFNN
% 0.10/0.43 % partial match(1): FGHNF-FFSS22-SFFFFFNN
% 0.10/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % Preprocessing time : 0.001 s
% 0.10/0.43
% 0.10/0.43 % Proof found!
% 0.10/0.43 % SZS status Unsatisfiable
% 0.10/0.43 % SZS output start CNFRefutation
% See solution above
% 0.10/0.43 % Parsed axioms : 16
% 0.10/0.43 % Removed by relevancy pruning/SinE : 0
% 0.10/0.43 % Initial clauses : 16
% 0.10/0.43 % Removed in clause preprocessing : 0
% 0.10/0.43 % Initial clauses in saturation : 16
% 0.10/0.43 % Processed clauses : 45
% 0.10/0.43 % ...of these trivial : 0
% 0.10/0.43 % ...subsumed : 3
% 0.10/0.43 % ...remaining for further processing : 42
% 0.10/0.43 % Other redundant clauses eliminated : 0
% 0.10/0.43 % Clauses deleted for lack of memory : 0
% 0.10/0.43 % Backward-subsumed : 0
% 0.10/0.43 % Backward-rewritten : 0
% 0.10/0.43 % Generated clauses : 61
% 0.10/0.43 % ...of the previous two non-redundant : 49
% 0.10/0.43 % ...aggressively subsumed : 0
% 0.10/0.43 % Contextual simplify-reflections : 0
% 0.10/0.43 % Paramodulations : 59
% 0.10/0.43 % Factorizations : 2
% 0.10/0.43 % NegExts : 0
% 0.10/0.43 % Equation resolutions : 0
% 0.10/0.43 % Disequality decompositions : 0
% 0.10/0.43 % Total rewrite steps : 4
% 0.10/0.43 % ...of those cached : 1
% 0.10/0.43 % Propositional unsat checks : 0
% 0.10/0.43 % Propositional check models : 0
% 0.10/0.43 % Propositional check unsatisfiable : 0
% 0.10/0.43 % Propositional clauses : 0
% 0.10/0.43 % Propositional clauses after purity: 0
% 0.10/0.43 % Propositional unsat core size : 0
% 0.10/0.43 % Propositional preprocessing time : 0.000
% 0.10/0.43 % Propositional encoding time : 0.000
% 0.10/0.43 % Propositional solver time : 0.000
% 0.10/0.43 % Success case prop preproc time : 0.000
% 0.10/0.43 % Success case prop encoding time : 0.000
% 0.10/0.43 % Success case prop solver time : 0.000
% 0.10/0.43 % Current number of processed clauses : 42
% 0.10/0.43 % Positive orientable unit clauses : 7
% 0.10/0.43 % Positive unorientable unit clauses: 0
% 0.10/0.43 % Negative unit clauses : 1
% 0.10/0.43 % Non-unit-clauses : 34
% 0.10/0.43 % Current number of unprocessed clauses: 20
% 0.10/0.43 % ...number of literals in the above : 57
% 0.10/0.43 % Current number of archived formulas : 0
% 0.10/0.43 % Current number of archived clauses : 0
% 0.10/0.43 % Clause-clause subsumption calls (NU) : 135
% 0.10/0.43 % Rec. Clause-clause subsumption calls : 113
% 0.10/0.43 % Non-unit clause-clause subsumptions : 3
% 0.10/0.43 % Unit Clause-clause subsumption calls : 12
% 0.10/0.43 % Rewrite failures with RHS unbound : 0
% 0.10/0.43 % BW rewrite match attempts : 3
% 0.10/0.43 % BW rewrite match successes : 0
% 0.10/0.43 % Condensation attempts : 0
% 0.10/0.43 % Condensation successes : 0
% 0.10/0.43 % Termbank termtop insertions : 1298
% 0.10/0.43 % Search garbage collected termcells : 39
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.005 s
% 0.10/0.43 % System time : 0.002 s
% 0.10/0.43 % Total time : 0.007 s
% 0.10/0.43 % Maximum resident set size: 3644 pages
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.008 s
% 0.10/0.43 % System time : 0.006 s
% 0.10/0.43 % Total time : 0.014 s
% 0.10/0.43 % Maximum resident set size: 4864 pages
% 0.10/0.43 % E exiting
%------------------------------------------------------------------------------