%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET005-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 : n017.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:15:57 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of clauses : 65 ( 15 unt; 16 nHn; 50 RR)
% Number of literals : 151 ( 0 equ; 68 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-3 aty)
% Number of variables : 106 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(member_of_intersection_is_member_of_set2,axiom,
( ~ member(X4,X3)
| ~ intersection(X1,X2,X3)
| member(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',member_of_intersection_is_member_of_set2) ).
cnf(member_of_intersection_is_member_of_set1,axiom,
( ~ member(X4,X3)
| ~ intersection(X1,X2,X3)
| member(X4,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',member_of_intersection_is_member_of_set1) ).
cnf(a_intersection_bIc,axiom,
intersection(a,bIc,aIbIc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_intersection_bIc) ).
cnf(b_intersection_c,axiom,
intersection(b,c,bIc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_intersection_c) ).
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(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(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(member_of_both_is_member_of_intersection,axiom,
( ~ member(X4,X1)
| ~ member(X4,X2)
| ~ intersection(X1,X2,X3)
| member(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',member_of_both_is_member_of_intersection) ).
cnf(intersection_axiom2,axiom,
( member(h(X1,X2,X3),X2)
| intersection(X1,X2,X3)
| member(h(X1,X2,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',intersection_axiom2) ).
cnf(intersection_axiom3,axiom,
( ~ member(h(X1,X2,X3),X1)
| ~ member(h(X1,X2,X3),X2)
| ~ member(h(X1,X2,X3),X3)
| intersection(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',intersection_axiom3) ).
cnf(a_intersection_b,axiom,
intersection(a,b,aIb),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_intersection_b) ).
cnf(intersection_axiom1,axiom,
( member(h(X1,X2,X3),X1)
| intersection(X1,X2,X3)
| member(h(X1,X2,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',intersection_axiom1) ).
cnf(prove_aIb_intersection_c_is_aIbIc,negated_conjecture,
~ intersection(aIb,c,aIbIc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_aIb_intersection_c_is_aIbIc) ).
cnf(c_0_13,plain,
( ~ member(X4,X3)
| ~ intersection(X1,X2,X3)
| member(X4,X2) ),
inference(fof_simplification,[status(thm)],[member_of_intersection_is_member_of_set2]) ).
cnf(c_0_14,plain,
( ~ member(X4,X3)
| ~ intersection(X1,X2,X3)
| member(X4,X1) ),
inference(fof_simplification,[status(thm)],[member_of_intersection_is_member_of_set1]) ).
cnf(c_0_15,plain,
( ~ member(X4,X3)
| ~ intersection(X1,X2,X3)
| member(X4,X2) ),
c_0_13 ).
cnf(c_0_16,axiom,
intersection(a,bIc,aIbIc),
a_intersection_bIc ).
cnf(c_0_17,plain,
( ~ member(X4,X3)
| ~ intersection(X1,X2,X3)
| member(X4,X1) ),
c_0_14 ).
cnf(c_0_18,axiom,
intersection(b,c,bIc),
b_intersection_c ).
cnf(c_0_19,plain,
( ~ member(X1,aIbIc)
| member(X1,bIc) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
subsets_axiom1 ).
cnf(c_0_21,plain,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
inference(fof_simplification,[status(thm)],[subsets_axiom2]) ).
cnf(c_0_22,plain,
( ~ member(X1,bIc)
| member(X1,b) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( member(member_of_1_not_of_2(aIbIc,X1),bIc)
| subset(aIbIc,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( ~ subset(X2,X3)
| ~ member(X1,X2)
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[membership_in_subsets]) ).
cnf(c_0_25,plain,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
c_0_21 ).
cnf(c_0_26,plain,
( member(member_of_1_not_of_2(aIbIc,X1),b)
| subset(aIbIc,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( ~ member(X4,X1)
| ~ member(X4,X2)
| ~ intersection(X1,X2,X3)
| member(X4,X3) ),
inference(fof_simplification,[status(thm)],[member_of_both_is_member_of_intersection]) ).
cnf(c_0_28,axiom,
( member(h(X1,X2,X3),X2)
| intersection(X1,X2,X3)
| member(h(X1,X2,X3),X3) ),
intersection_axiom2 ).
cnf(c_0_29,plain,
( ~ subset(X2,X3)
| ~ member(X1,X2)
| member(X1,X3) ),
c_0_24 ).
cnf(c_0_30,plain,
subset(aIbIc,b),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( ~ member(h(X1,X2,X3),X1)
| ~ member(h(X1,X2,X3),X2)
| ~ member(h(X1,X2,X3),X3)
| intersection(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[intersection_axiom3]) ).
cnf(c_0_32,plain,
( ~ member(X4,X1)
| ~ member(X4,X2)
| ~ intersection(X1,X2,X3)
| member(X4,X3) ),
c_0_27 ).
cnf(c_0_33,axiom,
intersection(a,b,aIb),
a_intersection_b ).
cnf(c_0_34,plain,
( ~ member(X1,aIbIc)
| member(X1,a) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_35,plain,
( member(h(X1,X2,X2),X2)
| intersection(X1,X2,X2) ),
inference(ef,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
( ~ member(X1,aIbIc)
| member(X1,b) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
( ~ member(h(X1,X2,X3),X1)
| ~ member(h(X1,X2,X3),X2)
| ~ member(h(X1,X2,X3),X3)
| intersection(X1,X2,X3) ),
c_0_31 ).
cnf(c_0_38,plain,
( ~ member(X1,a)
| ~ member(X1,b)
| member(X1,aIb) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
( member(h(X1,aIbIc,aIbIc),a)
| intersection(X1,aIbIc,aIbIc) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( member(h(X1,aIbIc,aIbIc),b)
| intersection(X1,aIbIc,aIbIc) ),
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_41,plain,
( ~ member(h(X1,X2,X2),X1)
| intersection(X1,X2,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_35]),c_0_35]) ).
cnf(c_0_42,plain,
( member(h(X1,aIbIc,aIbIc),aIb)
| intersection(X1,aIbIc,aIbIc) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_43,plain,
( ~ member(X1,aIb)
| member(X1,b) ),
inference(spm,[status(thm)],[c_0_15,c_0_33]) ).
cnf(c_0_44,axiom,
( member(h(X1,X2,X3),X1)
| intersection(X1,X2,X3)
| member(h(X1,X2,X3),X3) ),
intersection_axiom1 ).
cnf(c_0_45,plain,
intersection(aIb,aIbIc,aIbIc),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( ~ member(X1,b)
| ~ member(X1,c)
| member(X1,bIc) ),
inference(spm,[status(thm)],[c_0_32,c_0_18]) ).
cnf(c_0_47,plain,
( member(h(aIb,X1,X2),X2)
| member(h(aIb,X1,X2),b)
| intersection(aIb,X1,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
~ intersection(aIb,c,aIbIc),
inference(fof_simplification,[status(thm)],[prove_aIb_intersection_c_is_aIbIc]) ).
cnf(c_0_49,plain,
( ~ member(X1,aIbIc)
| member(X1,aIb) ),
inference(spm,[status(thm)],[c_0_17,c_0_45]) ).
cnf(c_0_50,plain,
( ~ member(X1,a)
| ~ member(X1,bIc)
| member(X1,aIbIc) ),
inference(spm,[status(thm)],[c_0_32,c_0_16]) ).
cnf(c_0_51,plain,
( ~ member(h(X1,c,X2),b)
| member(h(X1,c,X2),X2)
| member(h(X1,c,X2),bIc)
| intersection(X1,c,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_28]) ).
cnf(c_0_52,plain,
( member(h(aIb,X1,aIbIc),b)
| intersection(aIb,X1,aIbIc) ),
inference(spm,[status(thm)],[c_0_36,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
~ intersection(aIb,c,aIbIc),
c_0_48 ).
cnf(c_0_54,plain,
( ~ member(X1,a)
| ~ member(X1,bIc)
| member(X1,aIb) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
member(h(aIb,c,aIbIc),bIc),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_19]) ).
cnf(c_0_56,plain,
( ~ member(h(aIb,c,aIbIc),a)
| member(h(aIb,c,aIbIc),aIb) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,plain,
( member(h(X1,X2,aIbIc),X1)
| member(h(X1,X2,aIbIc),a)
| intersection(X1,X2,aIbIc) ),
inference(spm,[status(thm)],[c_0_34,c_0_44]) ).
cnf(c_0_58,plain,
( ~ member(h(X1,X2,aIbIc),X1)
| ~ member(h(X1,X2,aIbIc),X2)
| ~ member(h(X1,X2,aIbIc),a)
| ~ member(h(X1,X2,aIbIc),bIc)
| intersection(X1,X2,aIbIc) ),
inference(spm,[status(thm)],[c_0_37,c_0_50]) ).
cnf(c_0_59,plain,
member(h(aIb,c,aIbIc),aIb),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_53]) ).
cnf(c_0_60,plain,
( ~ member(h(aIb,c,aIbIc),c)
| ~ member(h(aIb,c,aIbIc),a) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_55]),c_0_59])]),c_0_53]) ).
cnf(c_0_61,plain,
( ~ member(X1,bIc)
| member(X1,c) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_62,plain,
~ member(h(aIb,c,aIbIc),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_55])]) ).
cnf(c_0_63,plain,
( ~ member(X1,aIb)
| member(X1,a) ),
inference(spm,[status(thm)],[c_0_17,c_0_33]) ).
cnf(c_0_64,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET005-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n017.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:36:42 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/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.15/0.45 % Version: 3.5.1
% 0.15/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1440633 completed with status 0
% 0.15/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45 % No SInE strategy applied
% 0.15/0.45 % Search class: FGUNF-FFSS32-SFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.45 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1440641 completed with status 0
% 0.15/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.15/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45 % No SInE strategy applied
% 0.15/0.45 % Search class: FGUNF-FFSS32-SFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.45 % Preprocessing time : 0.001 s
% 0.15/0.45 % Presaturation interreduction done
% 0.15/0.45
% 0.15/0.45 % Proof found!
% 0.15/0.45 % SZS status Unsatisfiable
% 0.15/0.45 % SZS output start CNFRefutation
% See solution above
% 0.15/0.45 % Parsed axioms : 16
% 0.15/0.45 % Removed by relevancy pruning/SinE : 0
% 0.15/0.45 % Initial clauses : 16
% 0.15/0.45 % Removed in clause preprocessing : 0
% 0.15/0.45 % Initial clauses in saturation : 16
% 0.15/0.45 % Processed clauses : 394
% 0.15/0.45 % ...of these trivial : 0
% 0.15/0.45 % ...subsumed : 159
% 0.15/0.45 % ...remaining for further processing : 235
% 0.15/0.45 % Other redundant clauses eliminated : 0
% 0.15/0.45 % Clauses deleted for lack of memory : 0
% 0.15/0.45 % Backward-subsumed : 3
% 0.15/0.45 % Backward-rewritten : 3
% 0.15/0.45 % Generated clauses : 738
% 0.15/0.45 % ...of the previous two non-redundant : 567
% 0.15/0.45 % ...aggressively subsumed : 0
% 0.15/0.45 % Contextual simplify-reflections : 24
% 0.15/0.45 % Paramodulations : 702
% 0.15/0.45 % Factorizations : 36
% 0.15/0.45 % NegExts : 0
% 0.15/0.45 % Equation resolutions : 0
% 0.15/0.45 % Disequality decompositions : 0
% 0.15/0.45 % Total rewrite steps : 90
% 0.15/0.45 % ...of those cached : 59
% 0.15/0.45 % Propositional unsat checks : 0
% 0.15/0.45 % Propositional check models : 0
% 0.15/0.45 % Propositional check unsatisfiable : 0
% 0.15/0.45 % Propositional clauses : 0
% 0.15/0.45 % Propositional clauses after purity: 0
% 0.15/0.45 % Propositional unsat core size : 0
% 0.15/0.45 % Propositional preprocessing time : 0.000
% 0.15/0.45 % Propositional encoding time : 0.000
% 0.15/0.45 % Propositional solver time : 0.000
% 0.15/0.45 % Success case prop preproc time : 0.000
% 0.15/0.45 % Success case prop encoding time : 0.000
% 0.15/0.45 % Success case prop solver time : 0.000
% 0.15/0.45 % Current number of processed clauses : 213
% 0.15/0.45 % Positive orientable unit clauses : 36
% 0.15/0.45 % Positive unorientable unit clauses: 0
% 0.15/0.45 % Negative unit clauses : 2
% 0.15/0.45 % Non-unit-clauses : 175
% 0.15/0.45 % Current number of unprocessed clauses: 199
% 0.15/0.45 % ...number of literals in the above : 665
% 0.15/0.45 % Current number of archived formulas : 0
% 0.15/0.45 % Current number of archived clauses : 22
% 0.15/0.45 % Clause-clause subsumption calls (NU) : 6433
% 0.15/0.45 % Rec. Clause-clause subsumption calls : 5283
% 0.15/0.45 % Non-unit clause-clause subsumptions : 185
% 0.15/0.45 % Unit Clause-clause subsumption calls : 230
% 0.15/0.45 % Rewrite failures with RHS unbound : 0
% 0.15/0.45 % BW rewrite match attempts : 15
% 0.15/0.45 % BW rewrite match successes : 2
% 0.15/0.45 % Condensation attempts : 0
% 0.15/0.45 % Condensation successes : 0
% 0.15/0.45 % Termbank termtop insertions : 11865
% 0.15/0.45 % Search garbage collected termcells : 36
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.018 s
% 0.15/0.45 % System time : 0.002 s
% 0.15/0.45 % Total time : 0.021 s
% 0.15/0.45 % Maximum resident set size: 3644 pages
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.094 s
% 0.15/0.45 % System time : 0.014 s
% 0.15/0.45 % Total time : 0.107 s
% 0.15/0.45 % Maximum resident set size: 4864 pages
% 0.15/0.45 % E exiting
%------------------------------------------------------------------------------