%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM030-1 : 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 : n011.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 01:51:14 PM UTC 2026
% Result : Unsatisfiable 11.25s 2.06s
% Output : CNFRefutation 11.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 50 ( 21 unt; 9 nHn; 29 RR)
% Number of literals : 88 ( 15 equ; 36 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 2 con; 0-2 aty)
% Number of variables : 79 ( 7 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(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
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(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
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(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
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(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(prove_symmetrization_property3_1,negated_conjecture,
symmetrization_of(x) = x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_symmetrization_property3_1) ).
cnf(symmetrization,axiom,
union(X1,inverse(X1)) = symmetrization_of(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM004-0.ax',symmetrization) ).
cnf(inverse,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',inverse) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
cnf(prove_symmetrization_property3_2,negated_conjecture,
~ subclass(inverse(x),x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_symmetrization_property3_2) ).
cnf(c_0_13,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_14,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_13 ).
cnf(c_0_15,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_16,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_17,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_18,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_20,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_21,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_16 ).
cnf(c_0_22,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_17 ).
cnf(c_0_23,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_20 ).
cnf(c_0_25,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_27,plain,
( ~ member(not_subclass_element(X1,complement(complement(X2))),X2)
| subclass(X1,complement(complement(X2))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( ~ member(not_subclass_element(complement(X1),X2),X1)
| subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
cnf(c_0_29,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_26 ).
cnf(c_0_30,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_31,plain,
( subclass(complement(complement(X1)),X2)
| member(not_subclass_element(complement(complement(X1)),X2),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_22]),c_0_23]) ).
cnf(c_0_32,plain,
( ~ subclass(complement(complement(X1)),X1)
| complement(complement(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_21,c_0_31]) ).
cnf(c_0_34,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_35,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_36,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_34 ).
cnf(c_0_37,negated_conjecture,
symmetrization_of(x) = x,
prove_symmetrization_property3_1 ).
cnf(c_0_38,axiom,
union(X1,inverse(X1)) = symmetrization_of(X1),
symmetrization ).
cnf(c_0_39,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
inverse ).
cnf(c_0_40,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_41,negated_conjecture,
~ subclass(inverse(x),x),
inference(fof_simplification,[status(thm)],[prove_symmetrization_property3_2]) ).
cnf(c_0_42,plain,
( ~ member(not_subclass_element(X1,X2),complement(X1))
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_35]) ).
cnf(c_0_43,plain,
( subclass(X1,complement(intersection(X2,X3)))
| member(not_subclass_element(X1,complement(intersection(X2,X3))),X3) ),
inference(spm,[status(thm)],[c_0_36,c_0_25]) ).
cnf(c_0_44,negated_conjecture,
complement(intersection(complement(x),complement(domain_of(flip(cross_product(x,universal_class)))))) = x,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40]) ).
cnf(c_0_45,negated_conjecture,
~ subclass(inverse(x),x),
c_0_41 ).
cnf(c_0_46,plain,
subclass(X1,complement(intersection(X2,complement(X1)))),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
intersection(complement(x),complement(domain_of(flip(cross_product(x,universal_class))))) = complement(x),
inference(spm,[status(thm)],[c_0_35,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
~ subclass(domain_of(flip(cross_product(x,universal_class))),x),
inference(rw,[status(thm)],[c_0_45,c_0_39]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_35]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM030-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 01:59:26 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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
% 11.25/2.06 % Version: 3.5.1
% 11.25/2.06 % Preprocessing class: FSLSSMSMSSSNFFN.
% 11.25/2.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.25/2.06 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.25/2.06 % Starting new_bool_3 with 300s (1) cores
% 11.25/2.06 % Starting new_bool_1 with 300s (1) cores
% 11.25/2.06 % Starting sh5l with 300s (1) cores
% 11.25/2.06 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 735824 completed with status 0
% 11.25/2.06 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 11.25/2.06 % Preprocessing class: FSLSSMSMSSSNFFN.
% 11.25/2.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.25/2.06 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.25/2.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.25/2.06 % No SInE strategy applied
% 11.25/2.06 % Search class: FGHSM-FFLM31-DFFFFFNN
% 11.25/2.06 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 11.25/2.06 % Starting SubtermCWHack with 136s (1) cores
% 11.25/2.06 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 11.25/2.06 % Starting new_bool_3 with 311s (1) cores
% 11.25/2.06 % Starting new_bool_1 with 308s (1) cores
% 11.25/2.06 % Starting sh5l with 304s (1) cores
% 11.25/2.06 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 735832 completed with status 0
% 11.25/2.06 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 11.25/2.06 % Preprocessing class: FSLSSMSMSSSNFFN.
% 11.25/2.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.25/2.06 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.25/2.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.25/2.06 % No SInE strategy applied
% 11.25/2.06 % Search class: FGHSM-FFLM31-DFFFFFNN
% 11.25/2.06 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 11.25/2.06 % Starting SubtermCWHack with 136s (1) cores
% 11.25/2.06 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 11.25/2.06 % Preprocessing time : 0.003 s
% 11.25/2.06 % Presaturation interreduction done
% 11.25/2.06
% 11.25/2.06 % Proof found!
% 11.25/2.06 % SZS status Unsatisfiable
% 11.25/2.06 % SZS output start CNFRefutation
% See solution above
% 11.25/2.07 % Parsed axioms : 160
% 11.25/2.07 % Removed by relevancy pruning/SinE : 0
% 11.25/2.07 % Initial clauses : 160
% 11.25/2.07 % Removed in clause preprocessing : 19
% 11.25/2.07 % Initial clauses in saturation : 141
% 11.25/2.07 % Processed clauses : 13234
% 11.25/2.07 % ...of these trivial : 87
% 11.25/2.07 % ...subsumed : 10282
% 11.25/2.07 % ...remaining for further processing : 2865
% 11.25/2.07 % Other redundant clauses eliminated : 22
% 11.25/2.07 % Clauses deleted for lack of memory : 0
% 11.25/2.07 % Backward-subsumed : 199
% 11.25/2.07 % Backward-rewritten : 357
% 11.25/2.07 % Generated clauses : 83326
% 11.25/2.07 % ...of the previous two non-redundant : 68186
% 11.25/2.07 % ...aggressively subsumed : 0
% 11.25/2.07 % Contextual simplify-reflections : 58
% 11.25/2.07 % Paramodulations : 83288
% 11.25/2.07 % Factorizations : 16
% 11.25/2.07 % NegExts : 0
% 11.25/2.07 % Equation resolutions : 22
% 11.25/2.07 % Disequality decompositions : 0
% 11.25/2.07 % Total rewrite steps : 37914
% 11.25/2.07 % ...of those cached : 35281
% 11.25/2.07 % Propositional unsat checks : 0
% 11.25/2.07 % Propositional check models : 0
% 11.25/2.07 % Propositional check unsatisfiable : 0
% 11.25/2.07 % Propositional clauses : 0
% 11.25/2.07 % Propositional clauses after purity: 0
% 11.25/2.07 % Propositional unsat core size : 0
% 11.25/2.07 % Propositional preprocessing time : 0.000
% 11.25/2.07 % Propositional encoding time : 0.000
% 11.25/2.07 % Propositional solver time : 0.000
% 11.25/2.07 % Success case prop preproc time : 0.000
% 11.25/2.07 % Success case prop encoding time : 0.000
% 11.25/2.07 % Success case prop solver time : 0.000
% 11.25/2.07 % Current number of processed clauses : 2163
% 11.25/2.07 % Positive orientable unit clauses : 249
% 11.25/2.07 % Positive unorientable unit clauses: 4
% 11.25/2.07 % Negative unit clauses : 5
% 11.25/2.07 % Non-unit-clauses : 1905
% 11.25/2.07 % Current number of unprocessed clauses: 54331
% 11.25/2.07 % ...number of literals in the above : 197115
% 11.25/2.07 % Current number of archived formulas : 0
% 11.25/2.07 % Current number of archived clauses : 715
% 11.25/2.07 % Clause-clause subsumption calls (NU) : 999065
% 11.25/2.07 % Rec. Clause-clause subsumption calls : 560928
% 11.25/2.07 % Non-unit clause-clause subsumptions : 7412
% 11.25/2.07 % Unit Clause-clause subsumption calls : 30653
% 11.25/2.07 % Rewrite failures with RHS unbound : 16
% 11.25/2.07 % BW rewrite match attempts : 1215
% 11.25/2.07 % BW rewrite match successes : 916
% 11.25/2.07 % Condensation attempts : 0
% 11.25/2.07 % Condensation successes : 0
% 11.25/2.07 % Termbank termtop insertions : 3155563
% 11.25/2.07 % Search garbage collected termcells : 287
% 11.25/2.07
% 11.25/2.07 % -------------------------------------------------
% 11.25/2.07 % User time : 1.546 s
% 11.25/2.07 % System time : 0.056 s
% 11.25/2.07 % Total time : 1.602 s
% 11.25/2.07 % Maximum resident set size: 4036 pages
% 11.25/2.07
% 11.25/2.07 % -------------------------------------------------
% 11.25/2.07 % User time : 7.625 s
% 11.25/2.07 % System time : 0.266 s
% 11.25/2.07 % Total time : 7.891 s
% 11.25/2.07 % Maximum resident set size: 4864 pages
% 11.25/2.07 % E exiting
%------------------------------------------------------------------------------