%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET160-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 : n015.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:46 PM UTC 2026
% Result : Unsatisfiable 5.47s 6.42s
% Output : CNFRefutation 5.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 30 ( 9 unt; 4 nHn; 22 RR)
% Number of literals : 58 ( 10 equ; 28 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 63 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
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(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
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(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(prove_commutativity_of_union_1,negated_conjecture,
union(x,y) != union(y,x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_commutativity_of_union_1) ).
cnf(subclass_implies_equal,axiom,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
cnf(c_0_8,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_9,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_10,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_11,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_8 ).
cnf(c_0_12,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_9 ).
cnf(c_0_13,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_10 ).
cnf(c_0_14,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_15,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_16,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_11,c_0_12]) ).
cnf(c_0_17,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
union(x,y) != union(y,x),
inference(fof_simplification,[status(thm)],[prove_commutativity_of_union_1]) ).
cnf(c_0_20,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_21,plain,
( ~ member(not_subclass_element(intersection(X1,X2),intersection(X3,X1)),X3)
| subclass(intersection(X1,X2),intersection(X3,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_23,negated_conjecture,
union(x,y) != union(y,x),
c_0_19 ).
cnf(c_0_24,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_25,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_20 ).
cnf(c_0_26,plain,
subclass(intersection(X1,X2),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
complement(intersection(complement(y),complement(x))) != complement(intersection(complement(x),complement(y))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_28,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET160-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.14/5.40 % Computer : n015.cluster.edu
% 0.14/5.40 % Model : x86_64 x86_64
% 0.14/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.40 % Memory : 8046.5625MB
% 0.14/5.40 % OS : Linux 6.8.0-71-generic
% 0.14/5.40 % CPULimit : 300
% 0.14/5.40 % WCLimit : 300
% 0.14/5.40 % DateTime : Mon Sep 21 05:00:44 UTC 2026
% 0.14/5.40 % CPUTime :
% 0.14/5.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.46 Running first-order theorem proving
% 0.14/5.46 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
% 5.47/6.42 % Version: 3.5.1
% 5.47/6.42 % Preprocessing class: FSLSSMSMSSSNFFN.
% 5.47/6.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.47/6.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.47/6.42 % Starting new_bool_3 with 300s (1) cores
% 5.47/6.42 % Starting new_bool_1 with 300s (1) cores
% 5.47/6.42 % Starting sh5l with 300s (1) cores
% 5.47/6.42 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 613649 completed with status 0
% 5.47/6.42 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 5.47/6.42 % Preprocessing class: FSLSSMSMSSSNFFN.
% 5.47/6.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.47/6.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.47/6.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.47/6.42 % No SInE strategy applied
% 5.47/6.42 % Search class: FGHSM-FFLM31-DFFFFFNN
% 5.47/6.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.47/6.42 % Starting SubtermCWHack with 136s (1) cores
% 5.47/6.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 5.47/6.42 % Starting new_bool_3 with 311s (1) cores
% 5.47/6.42 % Starting new_bool_1 with 308s (1) cores
% 5.47/6.42 % Starting sh5l with 304s (1) cores
% 5.47/6.42 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 613657 completed with status 0
% 5.47/6.42 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 5.47/6.42 % Preprocessing class: FSLSSMSMSSSNFFN.
% 5.47/6.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.47/6.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.47/6.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.47/6.42 % No SInE strategy applied
% 5.47/6.42 % Search class: FGHSM-FFLM31-DFFFFFNN
% 5.47/6.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.47/6.42 % Starting SubtermCWHack with 136s (1) cores
% 5.47/6.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 5.47/6.42 % Preprocessing time : 0.005 s
% 5.47/6.42 % Presaturation interreduction done
% 5.47/6.42
% 5.47/6.42 % Proof found!
% 5.47/6.42 % SZS status Unsatisfiable
% 5.47/6.42 % SZS output start CNFRefutation
% See solution above
% 5.47/6.42 % Parsed axioms : 113
% 5.47/6.42 % Removed by relevancy pruning/SinE : 0
% 5.47/6.42 % Initial clauses : 113
% 5.47/6.42 % Removed in clause preprocessing : 17
% 5.47/6.42 % Initial clauses in saturation : 96
% 5.47/6.42 % Processed clauses : 4138
% 5.47/6.42 % ...of these trivial : 90
% 5.47/6.42 % ...subsumed : 2768
% 5.47/6.42 % ...remaining for further processing : 1280
% 5.47/6.42 % Other redundant clauses eliminated : 18
% 5.47/6.42 % Clauses deleted for lack of memory : 0
% 5.47/6.42 % Backward-subsumed : 56
% 5.47/6.42 % Backward-rewritten : 395
% 5.47/6.42 % Generated clauses : 17443
% 5.47/6.42 % ...of the previous two non-redundant : 14080
% 5.47/6.42 % ...aggressively subsumed : 0
% 5.47/6.42 % Contextual simplify-reflections : 18
% 5.47/6.42 % Paramodulations : 17411
% 5.47/6.42 % Factorizations : 14
% 5.47/6.42 % NegExts : 0
% 5.47/6.42 % Equation resolutions : 18
% 5.47/6.42 % Disequality decompositions : 0
% 5.47/6.42 % Total rewrite steps : 7325
% 5.47/6.42 % ...of those cached : 6507
% 5.47/6.42 % Propositional unsat checks : 0
% 5.47/6.42 % Propositional check models : 0
% 5.47/6.42 % Propositional check unsatisfiable : 0
% 5.47/6.42 % Propositional clauses : 0
% 5.47/6.42 % Propositional clauses after purity: 0
% 5.47/6.42 % Propositional unsat core size : 0
% 5.47/6.42 % Propositional preprocessing time : 0.000
% 5.47/6.42 % Propositional encoding time : 0.000
% 5.47/6.42 % Propositional solver time : 0.000
% 5.47/6.42 % Success case prop preproc time : 0.000
% 5.47/6.42 % Success case prop encoding time : 0.000
% 5.47/6.42 % Success case prop solver time : 0.000
% 5.47/6.42 % Current number of processed clauses : 730
% 5.47/6.42 % Positive orientable unit clauses : 106
% 5.47/6.42 % Positive unorientable unit clauses: 1
% 5.47/6.42 % Negative unit clauses : 17
% 5.47/6.42 % Non-unit-clauses : 606
% 5.47/6.42 % Current number of unprocessed clauses: 9683
% 5.47/6.42 % ...number of literals in the above : 30276
% 5.47/6.42 % Current number of archived formulas : 0
% 5.47/6.42 % Current number of archived clauses : 563
% 5.47/6.42 % Clause-clause subsumption calls (NU) : 83716
% 5.47/6.42 % Rec. Clause-clause subsumption calls : 54763
% 5.47/6.42 % Non-unit clause-clause subsumptions : 1983
% 5.47/6.42 % Unit Clause-clause subsumption calls : 5450
% 5.47/6.42 % Rewrite failures with RHS unbound : 0
% 5.47/6.42 % BW rewrite match attempts : 606
% 5.47/6.42 % BW rewrite match successes : 465
% 5.47/6.42 % Condensation attempts : 0
% 5.47/6.42 % Condensation successes : 0
% 5.47/6.42 % Termbank termtop insertions : 574052
% 5.47/6.42 % Search garbage collected termcells : 185
% 5.47/6.42
% 5.47/6.42 % -------------------------------------------------
% 5.47/6.42 % User time : 0.855 s
% 5.47/6.42 % System time : 0.028 s
% 5.47/6.42 % Total time : 0.884 s
% 5.47/6.42 % Maximum resident set size: 3488 pages
% 5.47/6.42
% 5.47/6.42 % -------------------------------------------------
% 5.47/6.42 % User time : 3.789 s
% 5.47/6.42 % System time : 0.176 s
% 5.47/6.42 % Total time : 3.965 s
% 5.47/6.42 % Maximum resident set size: 4864 pages
% 5.47/6.42 % E exiting
%------------------------------------------------------------------------------