%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET254-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:59 PM UTC 2026
% Result : Unsatisfiable 1.56s 0.68s
% Output : CNFRefutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 40 ( 15 unt; 5 nHn; 27 RR)
% Number of literals : 72 ( 5 equ; 31 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 : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 82 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(prove_monotonicity_of_restriction1_1,negated_conjecture,
subclass(x1,x2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_monotonicity_of_restriction1_1) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(not_subclass_members1,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(prove_monotonicity_of_restriction1_2,negated_conjecture,
~ subclass(restrict(x1,y,z),restrict(x2,y,z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_monotonicity_of_restriction1_2) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction2) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction1) ).
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(x1,x2),
prove_monotonicity_of_restriction1_1 ).
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,x1)
| member(X1,x2) ),
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,x2),x1)
| subclass(X1,x2) ),
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(x1,X1),x2),
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,negated_conjecture,
( ~ member(X1,intersection(x1,X2))
| member(X1,x2) ),
inference(spm,[status(thm)],[c_0_12,c_0_22]) ).
cnf(c_0_25,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
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,negated_conjecture,
( subclass(intersection(x1,X1),X2)
| member(not_subclass_element(intersection(x1,X1),X2),x2) ),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_28,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_25 ).
cnf(c_0_29,negated_conjecture,
~ subclass(restrict(x1,y,z),restrict(x2,y,z)),
inference(fof_simplification,[status(thm)],[prove_monotonicity_of_restriction1_2]) ).
cnf(c_0_30,negated_conjecture,
( ~ member(not_subclass_element(intersection(x1,X1),intersection(X2,x2)),X2)
| subclass(intersection(x1,X1),intersection(X2,x2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_32,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_33,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_34,negated_conjecture,
~ subclass(restrict(x1,y,z),restrict(x2,y,z)),
c_0_29 ).
cnf(c_0_35,negated_conjecture,
subclass(intersection(x1,X1),intersection(X1,x2)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
~ subclass(intersection(x1,cross_product(y,z)),intersection(x2,cross_product(y,z))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_33]),c_0_33]) ).
cnf(c_0_38,negated_conjecture,
subclass(intersection(x1,cross_product(X1,X2)),intersection(x2,cross_product(X1,X2))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET254-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n018.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 05:05:00 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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
% 1.56/0.68 % Version: 3.5.1
% 1.56/0.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.56/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.56/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.56/0.68 % Starting new_bool_3 with 300s (1) cores
% 1.56/0.68 % Starting new_bool_1 with 300s (1) cores
% 1.56/0.68 % Starting sh5l with 300s (1) cores
% 1.56/0.68 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1023329 completed with status 0
% 1.56/0.68 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.56/0.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.56/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.56/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.56/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.56/0.68 % No SInE strategy applied
% 1.56/0.68 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.56/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.56/0.68 % Starting SubtermCWHack with 136s (1) cores
% 1.56/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.56/0.68 % Starting new_bool_3 with 311s (1) cores
% 1.56/0.68 % Starting new_bool_1 with 308s (1) cores
% 1.56/0.68 % Starting sh5l with 304s (1) cores
% 1.56/0.68 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1023339 completed with status 0
% 1.56/0.68 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.56/0.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.56/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.56/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.56/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.56/0.68 % No SInE strategy applied
% 1.56/0.68 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.56/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.56/0.68 % Starting SubtermCWHack with 136s (1) cores
% 1.56/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.56/0.68 % Preprocessing time : 0.003 s
% 1.56/0.68 % Presaturation interreduction done
% 1.56/0.68
% 1.56/0.68 % Proof found!
% 1.56/0.68 % SZS status Unsatisfiable
% 1.56/0.68 % SZS output start CNFRefutation
% See solution above
% 1.56/0.68 % Parsed axioms : 114
% 1.56/0.68 % Removed by relevancy pruning/SinE : 0
% 1.56/0.68 % Initial clauses : 114
% 1.56/0.68 % Removed in clause preprocessing : 17
% 1.56/0.68 % Initial clauses in saturation : 97
% 1.56/0.68 % Processed clauses : 1875
% 1.56/0.68 % ...of these trivial : 16
% 1.56/0.68 % ...subsumed : 1028
% 1.56/0.68 % ...remaining for further processing : 831
% 1.56/0.68 % Other redundant clauses eliminated : 8
% 1.56/0.68 % Clauses deleted for lack of memory : 0
% 1.56/0.68 % Backward-subsumed : 30
% 1.56/0.68 % Backward-rewritten : 123
% 1.56/0.68 % Generated clauses : 5529
% 1.56/0.68 % ...of the previous two non-redundant : 4712
% 1.56/0.68 % ...aggressively subsumed : 0
% 1.56/0.68 % Contextual simplify-reflections : 13
% 1.56/0.68 % Paramodulations : 5517
% 1.56/0.68 % Factorizations : 4
% 1.56/0.68 % NegExts : 0
% 1.56/0.68 % Equation resolutions : 8
% 1.56/0.68 % Disequality decompositions : 0
% 1.56/0.68 % Total rewrite steps : 1655
% 1.56/0.68 % ...of those cached : 1338
% 1.56/0.68 % Propositional unsat checks : 0
% 1.56/0.68 % Propositional check models : 0
% 1.56/0.68 % Propositional check unsatisfiable : 0
% 1.56/0.68 % Propositional clauses : 0
% 1.56/0.68 % Propositional clauses after purity: 0
% 1.56/0.68 % Propositional unsat core size : 0
% 1.56/0.68 % Propositional preprocessing time : 0.000
% 1.56/0.68 % Propositional encoding time : 0.000
% 1.56/0.68 % Propositional solver time : 0.000
% 1.56/0.68 % Success case prop preproc time : 0.000
% 1.56/0.68 % Success case prop encoding time : 0.000
% 1.56/0.68 % Success case prop solver time : 0.000
% 1.56/0.68 % Current number of processed clauses : 578
% 1.56/0.68 % Positive orientable unit clauses : 85
% 1.56/0.68 % Positive unorientable unit clauses: 1
% 1.56/0.68 % Negative unit clauses : 5
% 1.56/0.68 % Non-unit-clauses : 487
% 1.56/0.68 % Current number of unprocessed clauses: 2825
% 1.56/0.68 % ...number of literals in the above : 9034
% 1.56/0.68 % Current number of archived formulas : 0
% 1.56/0.68 % Current number of archived clauses : 266
% 1.56/0.68 % Clause-clause subsumption calls (NU) : 54580
% 1.56/0.68 % Rec. Clause-clause subsumption calls : 35442
% 1.56/0.68 % Non-unit clause-clause subsumptions : 928
% 1.56/0.68 % Unit Clause-clause subsumption calls : 2586
% 1.56/0.68 % Rewrite failures with RHS unbound : 0
% 1.56/0.68 % BW rewrite match attempts : 146
% 1.56/0.68 % BW rewrite match successes : 57
% 1.56/0.68 % Condensation attempts : 0
% 1.56/0.68 % Condensation successes : 0
% 1.56/0.68 % Termbank termtop insertions : 209043
% 1.56/0.68 % Search garbage collected termcells : 185
% 1.56/0.68
% 1.56/0.68 % -------------------------------------------------
% 1.56/0.68 % User time : 0.225 s
% 1.56/0.68 % System time : 0.011 s
% 1.56/0.68 % Total time : 0.236 s
% 1.56/0.68 % Maximum resident set size: 4000 pages
% 1.56/0.68
% 1.56/0.68 % -------------------------------------------------
% 1.56/0.68 % User time : 0.975 s
% 1.56/0.68 % System time : 0.067 s
% 1.56/0.68 % Total time : 1.042 s
% 1.56/0.68 % Maximum resident set size: 4608 pages
% 1.56/0.68 % E exiting
%------------------------------------------------------------------------------