%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET013-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:03 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.63s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 34 ( 12 unt; 5 nHn; 29 RR)
% Number of literals : 69 ( 15 equ; 29 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 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 : 47 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection1) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection2) ).
cnf(extensionality2,axiom,
( X1 = X2
| member(f1(X1,X2),X2)
| member(f1(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',extensionality2) ).
cnf(intersection_of_a_and_b_is_c,hypothesis,
intersection(as,bs) = cs,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_of_a_and_b_is_c) ).
cnf(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection3) ).
cnf(intersection_of_b_and_a_is_d,hypothesis,
intersection(bs,as) = ds,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_of_b_and_a_is_d) ).
cnf(prove_c_equals_d,negated_conjecture,
cs != ds,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c_equals_d) ).
cnf(extensionality3,axiom,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',extensionality3) ).
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,intersection(X2,X3))
| member(X1,X2) ),
c_0_8 ).
cnf(c_0_11,axiom,
( X1 = X2
| member(f1(X1,X2),X2)
| member(f1(X1,X2),X1) ),
extensionality2 ).
cnf(c_0_12,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_9 ).
cnf(c_0_13,hypothesis,
intersection(as,bs) = cs,
intersection_of_a_and_b_is_c ).
cnf(c_0_14,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_15,hypothesis,
intersection(bs,as) = ds,
intersection_of_b_and_a_is_d ).
cnf(c_0_16,plain,
( member(f1(X1,intersection(X2,X3)),X2)
| member(f1(X1,intersection(X2,X3)),X1)
| X1 = intersection(X2,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
cs != ds,
inference(fof_simplification,[status(thm)],[prove_c_equals_d]) ).
cnf(c_0_18,hypothesis,
( ~ member(X1,cs)
| member(X1,bs) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_14 ).
cnf(c_0_20,hypothesis,
( ~ member(X1,ds)
| member(X1,as) ),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_21,hypothesis,
( member(f1(X1,cs),X1)
| member(f1(X1,cs),as)
| X1 = cs ),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_22,negated_conjecture,
cs != ds,
c_0_17 ).
cnf(c_0_23,hypothesis,
( ~ member(X1,ds)
| member(X1,bs) ),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_24,hypothesis,
( member(f1(X1,cs),X1)
| member(f1(X1,cs),bs)
| X1 = cs ),
inference(spm,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_25,plain,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[extensionality3]) ).
cnf(c_0_26,hypothesis,
( ~ member(X1,as)
| ~ member(X1,bs)
| member(X1,cs) ),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_27,hypothesis,
member(f1(ds,cs),as),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_28,hypothesis,
member(f1(ds,cs),bs),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22]) ).
cnf(c_0_29,plain,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
c_0_25 ).
cnf(c_0_30,hypothesis,
member(f1(ds,cs),cs),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_31,hypothesis,
~ member(f1(ds,cs),ds),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_22]) ).
cnf(c_0_32,hypothesis,
( ~ member(X1,bs)
| ~ member(X1,as)
| member(X1,ds) ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
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_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET013-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.56 % Computer : n010.cluster.edu
% 0.10/0.56 % Model : x86_64 x86_64
% 0.10/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.56 % Memory : 8046.5625MB
% 0.10/0.56 % OS : Linux 6.8.0-71-generic
% 0.10/0.56 % CPULimit : 300
% 0.10/0.56 % WCLimit : 300
% 0.10/0.56 % DateTime : Mon Sep 21 04:41:42 UTC 2026
% 0.10/0.56 % CPUTime :
% 0.10/0.56 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.61 Running first-order theorem proving
% 0.10/0.61 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.63 % Version: 3.5.1
% 0.15/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.63 % Starting sh5l with 300s (1) cores
% 0.15/0.63 % sh5l with pid 40593 completed with status 0
% 0.15/0.63 % Result found by sh5l
% 0.15/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.63 % Starting sh5l with 300s (1) cores
% 0.15/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.63 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.63 % Search class: FGUSF-FFSF22-SFFFFFNN
% 0.15/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.63 % SubtermCWHack with pid 40600 completed with status 0
% 0.15/0.63 % Result found by SubtermCWHack
% 0.15/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.63 % Starting sh5l with 300s (1) cores
% 0.15/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.63 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.63 % Search class: FGUSF-FFSF22-SFFFFFNN
% 0.15/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.63 % Preprocessing time : 0.001 s
% 0.15/0.63
% 0.15/0.63 % Proof found!
% 0.15/0.63 % SZS status Unsatisfiable
% 0.15/0.63 % SZS output start CNFRefutation
% See solution above
% 0.15/0.64 % Parsed axioms : 12
% 0.15/0.64 % Removed by relevancy pruning/SinE : 1
% 0.15/0.64 % Initial clauses : 11
% 0.15/0.64 % Removed in clause preprocessing : 0
% 0.15/0.64 % Initial clauses in saturation : 11
% 0.15/0.64 % Processed clauses : 138
% 0.15/0.64 % ...of these trivial : 2
% 0.15/0.64 % ...subsumed : 64
% 0.15/0.64 % ...remaining for further processing : 72
% 0.15/0.64 % Other redundant clauses eliminated : 0
% 0.15/0.64 % Clauses deleted for lack of memory : 0
% 0.15/0.64 % Backward-subsumed : 0
% 0.15/0.64 % Backward-rewritten : 0
% 0.15/0.64 % Generated clauses : 276
% 0.15/0.64 % ...of the previous two non-redundant : 251
% 0.15/0.64 % ...aggressively subsumed : 0
% 0.15/0.64 % Contextual simplify-reflections : 0
% 0.15/0.64 % Paramodulations : 252
% 0.15/0.64 % Factorizations : 24
% 0.15/0.64 % NegExts : 0
% 0.15/0.64 % Equation resolutions : 0
% 0.15/0.64 % Disequality decompositions : 0
% 0.15/0.64 % Total rewrite steps : 13
% 0.15/0.64 % ...of those cached : 8
% 0.15/0.64 % Propositional unsat checks : 0
% 0.15/0.64 % Propositional check models : 0
% 0.15/0.64 % Propositional check unsatisfiable : 0
% 0.15/0.64 % Propositional clauses : 0
% 0.15/0.64 % Propositional clauses after purity: 0
% 0.15/0.64 % Propositional unsat core size : 0
% 0.15/0.64 % Propositional preprocessing time : 0.000
% 0.15/0.64 % Propositional encoding time : 0.000
% 0.15/0.64 % Propositional solver time : 0.000
% 0.15/0.64 % Success case prop preproc time : 0.000
% 0.15/0.64 % Success case prop encoding time : 0.000
% 0.15/0.64 % Success case prop solver time : 0.000
% 0.15/0.64 % Current number of processed clauses : 72
% 0.15/0.64 % Positive orientable unit clauses : 10
% 0.15/0.64 % Positive unorientable unit clauses: 0
% 0.15/0.64 % Negative unit clauses : 2
% 0.15/0.64 % Non-unit-clauses : 60
% 0.15/0.64 % Current number of unprocessed clauses: 124
% 0.15/0.64 % ...number of literals in the above : 374
% 0.15/0.64 % Current number of archived formulas : 0
% 0.15/0.64 % Current number of archived clauses : 0
% 0.15/0.64 % Clause-clause subsumption calls (NU) : 339
% 0.15/0.64 % Rec. Clause-clause subsumption calls : 281
% 0.15/0.64 % Non-unit clause-clause subsumptions : 64
% 0.15/0.64 % Unit Clause-clause subsumption calls : 12
% 0.15/0.64 % Rewrite failures with RHS unbound : 0
% 0.15/0.64 % BW rewrite match attempts : 0
% 0.15/0.64 % BW rewrite match successes : 0
% 0.15/0.64 % Condensation attempts : 0
% 0.15/0.64 % Condensation successes : 0
% 0.15/0.64 % Termbank termtop insertions : 3555
% 0.15/0.64 % Search garbage collected termcells : 19
% 0.15/0.64
% 0.15/0.64 % -------------------------------------------------
% 0.15/0.64 % User time : 0.006 s
% 0.15/0.64 % System time : 0.005 s
% 0.15/0.64 % Total time : 0.011 s
% 0.15/0.64 % Maximum resident set size: 3636 pages
% 0.15/0.64
% 0.15/0.64 % -------------------------------------------------
% 0.15/0.64 % User time : 0.009 s
% 0.15/0.64 % System time : 0.008 s
% 0.15/0.64 % Total time : 0.017 s
% 0.15/0.64 % Maximum resident set size: 4864 pages
% 0.15/0.64 % E exiting
%------------------------------------------------------------------------------