%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET201-6 : TPTP v9.3.1. Bugfixed v2.1.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:54 PM UTC 2026
% Result : Unsatisfiable 1.61s 0.74s
% Output : CNFRefutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 44 ( 12 unt; 5 nHn; 35 RR)
% Number of literals : 86 ( 4 equ; 40 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 81 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(not_subclass_members2,axiom,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(prove_intersection_is_monotonic_2,negated_conjecture,
subclass(z,w),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_is_monotonic_2) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(not_subclass_members1,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(prove_intersection_is_monotonic_1,negated_conjecture,
subclass(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_is_monotonic_1) ).
cnf(subclass_implies_equal,axiom,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(prove_intersection_is_monotonic_3,negated_conjecture,
~ subclass(intersection(x,z),intersection(y,w)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_is_monotonic_3) ).
cnf(c_0_10,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_11,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_12,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_10 ).
cnf(c_0_13,negated_conjecture,
subclass(z,w),
prove_intersection_is_monotonic_2 ).
cnf(c_0_14,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_15,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
( ~ member(X1,z)
| member(X1,w) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_14 ).
cnf(c_0_18,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_19,negated_conjecture,
( ~ member(not_subclass_element(X1,w),z)
| subclass(X1,w) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_22,negated_conjecture,
subclass(intersection(z,X1),w),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_21 ).
cnf(c_0_24,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_25,negated_conjecture,
( ~ member(X1,intersection(z,X2))
| member(X1,w) ),
inference(spm,[status(thm)],[c_0_12,c_0_22]) ).
cnf(c_0_26,plain,
( ~ member(not_subclass_element(X1,intersection(X2,X3)),X2)
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
| subclass(X1,intersection(X2,X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_27,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_24 ).
cnf(c_0_28,negated_conjecture,
( subclass(intersection(z,X1),X2)
| member(not_subclass_element(intersection(z,X1),X2),w) ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_29,negated_conjecture,
subclass(x,y),
prove_intersection_is_monotonic_1 ).
cnf(c_0_30,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_31,plain,
( ~ member(not_subclass_element(X1,intersection(X2,X1)),X2)
| subclass(X1,intersection(X2,X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_32,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_33,negated_conjecture,
( ~ member(not_subclass_element(intersection(z,X1),intersection(X2,w)),X2)
| subclass(intersection(z,X1),intersection(X2,w)) ),
inference(spm,[status(thm)],[c_0_26,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(X1,x)
| member(X1,y) ),
inference(spm,[status(thm)],[c_0_12,c_0_29]) ).
cnf(c_0_35,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_30 ).
cnf(c_0_36,plain,
subclass(intersection(X1,X2),intersection(X2,intersection(X1,X2))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_15,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( ~ member(not_subclass_element(intersection(z,X1),intersection(y,w)),x)
| subclass(intersection(z,X1),intersection(y,w)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
intersection(X1,intersection(X2,X1)) = intersection(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_40,negated_conjecture,
~ subclass(intersection(x,z),intersection(y,w)),
inference(fof_simplification,[status(thm)],[prove_intersection_is_monotonic_3]) ).
cnf(c_0_41,negated_conjecture,
( ~ member(not_subclass_element(intersection(X1,z),intersection(y,w)),x)
| subclass(intersection(X1,z),intersection(y,w)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
~ subclass(intersection(x,z),intersection(y,w)),
c_0_40 ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_20]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET201-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n001.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 05:05:59 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/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
% 1.61/0.74 % Version: 3.5.1
% 1.61/0.74 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.61/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.61/0.74 % Starting new_bool_3 with 300s (1) cores
% 1.61/0.74 % Starting new_bool_1 with 300s (1) cores
% 1.61/0.74 % Starting sh5l with 300s (1) cores
% 1.61/0.74 % new_bool_1 with pid 2250949 completed with status 9
% 1.61/0.74 % new_bool_3 with pid 2250948 completed with status 9
% 1.61/0.74 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2250947 completed with status 0
% 1.61/0.74 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.61/0.74 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.61/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.61/0.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.61/0.74 % No SInE strategy applied
% 1.61/0.74 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.61/0.74 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.61/0.74 % Starting SubtermCWHack with 136s (1) cores
% 1.61/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.61/0.74 % Starting new_bool_3 with 311s (1) cores
% 1.61/0.74 % Starting new_bool_1 with 308s (1) cores
% 1.61/0.74 % Starting sh5l with 304s (1) cores
% 1.61/0.74 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2250959 completed with status 0
% 1.61/0.74 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.61/0.74 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.61/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.61/0.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.61/0.74 % No SInE strategy applied
% 1.61/0.74 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.61/0.74 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.61/0.74 % Starting SubtermCWHack with 136s (1) cores
% 1.61/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.61/0.74 % Preprocessing time : 0.002 s
% 1.61/0.74 % Presaturation interreduction done
% 1.61/0.74
% 1.61/0.74 % Proof found!
% 1.61/0.74 % SZS status Unsatisfiable
% 1.61/0.74 % SZS output start CNFRefutation
% See solution above
% 1.61/0.74 % Parsed axioms : 115
% 1.61/0.74 % Removed by relevancy pruning/SinE : 0
% 1.61/0.74 % Initial clauses : 115
% 1.61/0.74 % Removed in clause preprocessing : 17
% 1.61/0.74 % Initial clauses in saturation : 98
% 1.61/0.74 % Processed clauses : 2413
% 1.61/0.74 % ...of these trivial : 21
% 1.61/0.74 % ...subsumed : 1423
% 1.61/0.74 % ...remaining for further processing : 969
% 1.61/0.74 % Other redundant clauses eliminated : 10
% 1.61/0.74 % Clauses deleted for lack of memory : 0
% 1.61/0.74 % Backward-subsumed : 31
% 1.61/0.74 % Backward-rewritten : 131
% 1.61/0.74 % Generated clauses : 8485
% 1.61/0.74 % ...of the previous two non-redundant : 7412
% 1.61/0.74 % ...aggressively subsumed : 0
% 1.61/0.74 % Contextual simplify-reflections : 18
% 1.61/0.74 % Paramodulations : 8469
% 1.61/0.74 % Factorizations : 6
% 1.61/0.74 % NegExts : 0
% 1.61/0.74 % Equation resolutions : 10
% 1.61/0.74 % Disequality decompositions : 0
% 1.61/0.74 % Total rewrite steps : 2354
% 1.61/0.74 % ...of those cached : 1975
% 1.61/0.74 % Propositional unsat checks : 0
% 1.61/0.74 % Propositional check models : 0
% 1.61/0.74 % Propositional check unsatisfiable : 0
% 1.61/0.74 % Propositional clauses : 0
% 1.61/0.74 % Propositional clauses after purity: 0
% 1.61/0.74 % Propositional unsat core size : 0
% 1.61/0.74 % Propositional preprocessing time : 0.000
% 1.61/0.74 % Propositional encoding time : 0.000
% 1.61/0.74 % Propositional solver time : 0.000
% 1.61/0.74 % Success case prop preproc time : 0.000
% 1.61/0.74 % Success case prop encoding time : 0.000
% 1.61/0.74 % Success case prop solver time : 0.000
% 1.61/0.74 % Current number of processed clauses : 706
% 1.61/0.74 % Positive orientable unit clauses : 99
% 1.61/0.74 % Positive unorientable unit clauses: 1
% 1.61/0.74 % Negative unit clauses : 5
% 1.61/0.74 % Non-unit-clauses : 601
% 1.61/0.74 % Current number of unprocessed clauses: 4991
% 1.61/0.74 % ...number of literals in the above : 18843
% 1.61/0.74 % Current number of archived formulas : 0
% 1.61/0.74 % Current number of archived clauses : 276
% 1.61/0.74 % Clause-clause subsumption calls (NU) : 87638
% 1.61/0.74 % Rec. Clause-clause subsumption calls : 50717
% 1.61/0.74 % Non-unit clause-clause subsumptions : 1273
% 1.61/0.74 % Unit Clause-clause subsumption calls : 3830
% 1.61/0.74 % Rewrite failures with RHS unbound : 0
% 1.61/0.74 % BW rewrite match attempts : 172
% 1.61/0.74 % BW rewrite match successes : 54
% 1.61/0.74 % Condensation attempts : 0
% 1.61/0.74 % Condensation successes : 0
% 1.61/0.74 % Termbank termtop insertions : 393559
% 1.61/0.74 % Search garbage collected termcells : 185
% 1.61/0.74
% 1.61/0.74 % -------------------------------------------------
% 1.61/0.74 % User time : 0.298 s
% 1.61/0.74 % System time : 0.013 s
% 1.61/0.74 % Total time : 0.311 s
% 1.61/0.74 % Maximum resident set size: 4000 pages
% 1.61/0.74
% 1.61/0.74 % -------------------------------------------------
% 1.61/0.74 % User time : 1.547 s
% 1.61/0.74 % System time : 0.115 s
% 1.61/0.74 % Total time : 1.662 s
% 1.61/0.74 % Maximum resident set size: 4864 pages
% 1.61/0.74 % E exiting
%------------------------------------------------------------------------------