%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET013-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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 4.45s 1.16s
% Output : CNFRefutation 4.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 34 ( 11 unt; 4 nHn; 30 RR)
% Number of literals : 71 ( 15 equ; 33 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 46 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',intersection1) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',intersection2) ).
cnf(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',intersection3) ).
cnf(intersection_of_b_and_a_is_d,hypothesis,
intersection(bs,as) = ds,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_b_and_a_is_d) ).
cnf(extensionality3,axiom,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',extensionality3) ).
cnf(intersection_of_a_and_b_is_c,hypothesis,
intersection(as,bs) = cs,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_a_and_b_is_c) ).
cnf(extensionality2,axiom,
( X1 = X2
| member(f1(X1,X2),X2)
| member(f1(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',extensionality2) ).
cnf(prove_c_equals_d,negated_conjecture,
cs != ds,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c_equals_d) ).
cnf(c_0_8,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_9,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_10,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_11,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_8 ).
cnf(c_0_12,hypothesis,
intersection(bs,as) = ds,
intersection_of_b_and_a_is_d ).
cnf(c_0_13,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_9 ).
cnf(c_0_14,plain,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[extensionality3]) ).
cnf(c_0_15,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_10 ).
cnf(c_0_16,hypothesis,
intersection(as,bs) = cs,
intersection_of_a_and_b_is_c ).
cnf(c_0_17,hypothesis,
( ~ member(X1,ds)
| member(X1,bs) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,axiom,
( X1 = X2
| member(f1(X1,X2),X2)
| member(f1(X1,X2),X1) ),
extensionality2 ).
cnf(c_0_19,negated_conjecture,
cs != ds,
inference(fof_simplification,[status(thm)],[prove_c_equals_d]) ).
cnf(c_0_20,hypothesis,
( ~ member(X1,ds)
| member(X1,as) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_21,plain,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
c_0_14 ).
cnf(c_0_22,hypothesis,
( ~ member(X1,bs)
| ~ member(X1,as)
| member(X1,ds) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_23,hypothesis,
( ~ member(X1,cs)
| member(X1,bs) ),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_24,hypothesis,
( member(f1(X1,ds),X1)
| member(f1(X1,ds),bs)
| X1 = ds ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
cs != ds,
c_0_19 ).
cnf(c_0_26,hypothesis,
( ~ member(X1,cs)
| member(X1,as) ),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_27,hypothesis,
( member(f1(X1,ds),X1)
| member(f1(X1,ds),as)
| X1 = ds ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_28,hypothesis,
( ~ member(f1(X1,ds),X1)
| ~ member(f1(X1,ds),bs)
| ~ member(f1(X1,ds),as)
| X1 = ds ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,hypothesis,
member(f1(cs,ds),bs),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,hypothesis,
member(f1(cs,ds),as),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25]) ).
cnf(c_0_31,hypothesis,
~ member(f1(cs,ds),cs),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),c_0_25]) ).
cnf(c_0_32,hypothesis,
( ~ member(X1,as)
| ~ member(X1,bs)
| member(X1,cs) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_33,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET013-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n001.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 04:46:58 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 4.45/1.16 % Version: 3.5.1
% 4.45/1.16 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.45/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.45/1.16 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.45/1.16 % Starting new_bool_3 with 300s (1) cores
% 4.45/1.16 % Starting new_bool_1 with 300s (1) cores
% 4.45/1.16 % Starting sh5l with 300s (1) cores
% 4.45/1.16 % new_bool_1 with pid 2211286 completed with status 9
% 4.45/1.16 % new_bool_3 with pid 2211285 completed with status 9
% 4.45/1.16 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2211284 completed with status 0
% 4.45/1.16 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.45/1.16 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.45/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.45/1.16 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.45/1.16 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.45/1.16 % No SInE strategy applied
% 4.45/1.16 % Search class: FGHSF-FFLS31-MFFFFFNN
% 4.45/1.16 % partial match(1): FGHSM-FFLS31-MFFFFFNN
% 4.45/1.16 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.45/1.16 % Starting SubtermCWHack with 136s (1) cores
% 4.45/1.16 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.45/1.16 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 224s (1) cores
% 4.45/1.16 % Starting new_bool_3 with 216s (1) cores
% 4.45/1.16 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2i with 136s (1) cores
% 4.45/1.16 % SubtermCWHack with pid 2211292 completed with status 0
% 4.45/1.16 % Result found by SubtermCWHack
% 4.45/1.16 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.45/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.45/1.16 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.45/1.16 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.45/1.16 % No SInE strategy applied
% 4.45/1.16 % Search class: FGHSF-FFLS31-MFFFFFNN
% 4.45/1.16 % partial match(1): FGHSM-FFLS31-MFFFFFNN
% 4.45/1.16 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.45/1.16 % Starting SubtermCWHack with 136s (1) cores
% 4.45/1.16 % Preprocessing time : 0.003 s
% 4.45/1.16
% 4.45/1.16 % Proof found!
% 4.45/1.16 % SZS status Unsatisfiable
% 4.45/1.16 % SZS output start CNFRefutation
% See solution above
% 4.45/1.16 % Parsed axioms : 144
% 4.45/1.16 % Removed by relevancy pruning/SinE : 0
% 4.45/1.16 % Initial clauses : 144
% 4.45/1.16 % Removed in clause preprocessing : 6
% 4.45/1.16 % Initial clauses in saturation : 138
% 4.45/1.16 % Processed clauses : 5413
% 4.45/1.16 % ...of these trivial : 93
% 4.45/1.16 % ...subsumed : 3107
% 4.45/1.16 % ...remaining for further processing : 2213
% 4.45/1.16 % Other redundant clauses eliminated : 34
% 4.45/1.16 % Clauses deleted for lack of memory : 0
% 4.45/1.16 % Backward-subsumed : 83
% 4.45/1.16 % Backward-rewritten : 202
% 4.45/1.16 % Generated clauses : 44468
% 4.45/1.16 % ...of the previous two non-redundant : 39792
% 4.45/1.16 % ...aggressively subsumed : 0
% 4.45/1.16 % Contextual simplify-reflections : 43
% 4.45/1.16 % Paramodulations : 44388
% 4.45/1.16 % Factorizations : 46
% 4.45/1.16 % NegExts : 0
% 4.45/1.16 % Equation resolutions : 34
% 4.45/1.16 % Disequality decompositions : 0
% 4.45/1.16 % Total rewrite steps : 11064
% 4.45/1.16 % ...of those cached : 10670
% 4.45/1.16 % Propositional unsat checks : 0
% 4.45/1.16 % Propositional check models : 0
% 4.45/1.16 % Propositional check unsatisfiable : 0
% 4.45/1.16 % Propositional clauses : 0
% 4.45/1.16 % Propositional clauses after purity: 0
% 4.45/1.16 % Propositional unsat core size : 0
% 4.45/1.16 % Propositional preprocessing time : 0.000
% 4.45/1.16 % Propositional encoding time : 0.000
% 4.45/1.16 % Propositional solver time : 0.000
% 4.45/1.16 % Success case prop preproc time : 0.000
% 4.45/1.16 % Success case prop encoding time : 0.000
% 4.45/1.16 % Success case prop solver time : 0.000
% 4.45/1.16 % Current number of processed clauses : 1914
% 4.45/1.16 % Positive orientable unit clauses : 104
% 4.45/1.16 % Positive unorientable unit clauses: 0
% 4.45/1.16 % Negative unit clauses : 11
% 4.45/1.16 % Non-unit-clauses : 1799
% 4.45/1.16 % Current number of unprocessed clauses: 34238
% 4.45/1.16 % ...number of literals in the above : 105427
% 4.45/1.16 % Current number of archived formulas : 0
% 4.45/1.16 % Current number of archived clauses : 291
% 4.45/1.16 % Clause-clause subsumption calls (NU) : 354846
% 4.45/1.16 % Rec. Clause-clause subsumption calls : 268310
% 4.45/1.16 % Non-unit clause-clause subsumptions : 1310
% 4.45/1.16 % Unit Clause-clause subsumption calls : 23931
% 4.45/1.16 % Rewrite failures with RHS unbound : 0
% 4.45/1.16 % BW rewrite match attempts : 144
% 4.45/1.16 % BW rewrite match successes : 44
% 4.45/1.16 % Condensation attempts : 0
% 4.45/1.16 % Condensation successes : 0
% 4.45/1.16 % Termbank termtop insertions : 548572
% 4.45/1.16 % Search garbage collected termcells : 316
% 4.45/1.16
% 4.45/1.16 % -------------------------------------------------
% 4.45/1.16 % User time : 0.692 s
% 4.45/1.16 % System time : 0.039 s
% 4.45/1.16 % Total time : 0.731 s
% 4.45/1.16 % Maximum resident set size: 3768 pages
% 4.45/1.16
% 4.45/1.16 % -------------------------------------------------
% 4.45/1.16 % User time : 3.533 s
% 4.45/1.16 % System time : 0.217 s
% 4.45/1.16 % Total time : 3.750 s
% 4.45/1.16 % Maximum resident set size: 4864 pages
% 4.45/1.16 % E exiting
%------------------------------------------------------------------------------