%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM049-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 : n004.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:15 PM UTC 2026
% Result : Unsatisfiable 7.36s 6.46s
% Output : CNFRefutation 7.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of clauses : 48 ( 17 unt; 9 nHn; 29 RR)
% Number of literals : 85 ( 6 equ; 35 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-2 aty)
% Number of variables : 76 ( 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(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(prove_connect_class_property4_1,negated_conjecture,
subclass(cross_product(y,y),identity_relation),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_connect_class_property4_1) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(connected2,axiom,
( ~ subclass(cross_product(X1,X1),union(identity_relation,symmetrization_of(X2)))
| connected(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM004-0.ax',connected2) ).
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_connect_class_property4_2,negated_conjecture,
~ connected(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_connect_class_property4_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,negated_conjecture,
subclass(cross_product(y,y),identity_relation),
prove_connect_class_property4_1 ).
cnf(c_0_22,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_16 ).
cnf(c_0_23,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_17 ).
cnf(c_0_24,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_25,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
( ~ member(X1,cross_product(y,y))
| member(X1,identity_relation) ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_27,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_28,plain,
( ~ member(not_subclass_element(complement(X1),X2),X1)
| subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_29,negated_conjecture,
( subclass(X1,complement(cross_product(y,y)))
| member(not_subclass_element(X1,complement(cross_product(y,y))),identity_relation) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
subclass(complement(identity_relation),complement(cross_product(y,y))),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
( ~ member(X1,complement(identity_relation))
| member(X1,complement(cross_product(y,y))) ),
inference(spm,[status(thm)],[c_0_14,c_0_30]) ).
cnf(c_0_32,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_33,plain,
( ~ subclass(cross_product(X1,X1),union(identity_relation,symmetrization_of(X2)))
| connected(X2,X1) ),
inference(fof_simplification,[status(thm)],[connected2]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(X1,complement(identity_relation))
| ~ member(X1,cross_product(y,y)) ),
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_35,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_32 ).
cnf(c_0_36,plain,
( ~ subclass(cross_product(X1,X1),union(identity_relation,symmetrization_of(X2)))
| connected(X2,X1) ),
c_0_33 ).
cnf(c_0_37,axiom,
union(X1,inverse(X1)) = symmetrization_of(X1),
symmetrization ).
cnf(c_0_38,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
inverse ).
cnf(c_0_39,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_40,negated_conjecture,
( ~ member(not_subclass_element(cross_product(y,y),X1),complement(identity_relation))
| subclass(cross_product(y,y),X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_19]) ).
cnf(c_0_41,plain,
( subclass(X1,complement(intersection(X2,X3)))
| member(not_subclass_element(X1,complement(intersection(X2,X3))),X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_27]) ).
cnf(c_0_42,negated_conjecture,
~ connected(x,y),
inference(fof_simplification,[status(thm)],[prove_connect_class_property4_2]) ).
cnf(c_0_43,plain,
( ~ subclass(cross_product(X1,X1),complement(intersection(complement(identity_relation),complement(complement(intersection(complement(X2),complement(domain_of(flip(cross_product(X2,universal_class))))))))))
| connected(X2,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39]),c_0_39]) ).
cnf(c_0_44,negated_conjecture,
subclass(cross_product(y,y),complement(intersection(complement(identity_relation),X1))),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
~ connected(x,y),
c_0_42 ).
cnf(c_0_46,negated_conjecture,
connected(X1,y),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM049-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.43 % Computer : n004.cluster.edu
% 0.14/5.43 % Model : x86_64 x86_64
% 0.14/5.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.43 % Memory : 8046.5625MB
% 0.14/5.43 % OS : Linux 6.8.0-71-generic
% 0.14/5.43 % CPULimit : 300
% 0.14/5.43 % WCLimit : 300
% 0.14/5.43 % DateTime : Mon Sep 21 02:01:11 UTC 2026
% 0.14/5.43 % CPUTime :
% 0.14/5.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.47 Running first-order theorem proving
% 0.14/5.47 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
% 7.36/6.46 % Version: 3.5.1
% 7.36/6.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.36/6.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.36/6.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.36/6.46 % Starting new_bool_3 with 300s (1) cores
% 7.36/6.46 % Starting new_bool_1 with 300s (1) cores
% 7.36/6.46 % Starting sh5l with 300s (1) cores
% 7.36/6.46 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2023212 completed with status 0
% 7.36/6.46 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 7.36/6.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.36/6.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.36/6.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.36/6.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.36/6.46 % No SInE strategy applied
% 7.36/6.46 % Search class: FGHSM-FFLM31-DFFFFFNN
% 7.36/6.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.36/6.46 % Starting SubtermCWHack with 136s (1) cores
% 7.36/6.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 7.36/6.46 % Starting new_bool_3 with 311s (1) cores
% 7.36/6.46 % Starting new_bool_1 with 308s (1) cores
% 7.36/6.46 % Starting sh5l with 304s (1) cores
% 7.36/6.46 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2023220 completed with status 0
% 7.36/6.46 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 7.36/6.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.36/6.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.36/6.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.36/6.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.36/6.46 % No SInE strategy applied
% 7.36/6.46 % Search class: FGHSM-FFLM31-DFFFFFNN
% 7.36/6.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.36/6.46 % Starting SubtermCWHack with 136s (1) cores
% 7.36/6.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 7.36/6.46 % Preprocessing time : 0.002 s
% 7.36/6.46 % Presaturation interreduction done
% 7.36/6.46
% 7.36/6.46 % Proof found!
% 7.36/6.46 % SZS status Unsatisfiable
% 7.36/6.46 % SZS output start CNFRefutation
% See solution above
% 7.36/6.46 % Parsed axioms : 160
% 7.36/6.46 % Removed by relevancy pruning/SinE : 0
% 7.36/6.46 % Initial clauses : 160
% 7.36/6.46 % Removed in clause preprocessing : 19
% 7.36/6.46 % Initial clauses in saturation : 141
% 7.36/6.46 % Processed clauses : 9880
% 7.36/6.46 % ...of these trivial : 64
% 7.36/6.46 % ...subsumed : 7048
% 7.36/6.46 % ...remaining for further processing : 2768
% 7.36/6.46 % Other redundant clauses eliminated : 22
% 7.36/6.46 % Clauses deleted for lack of memory : 0
% 7.36/6.46 % Backward-subsumed : 229
% 7.36/6.46 % Backward-rewritten : 304
% 7.36/6.46 % Generated clauses : 52823
% 7.36/6.46 % ...of the previous two non-redundant : 45369
% 7.36/6.46 % ...aggressively subsumed : 0
% 7.36/6.46 % Contextual simplify-reflections : 62
% 7.36/6.46 % Paramodulations : 52785
% 7.36/6.46 % Factorizations : 16
% 7.36/6.46 % NegExts : 0
% 7.36/6.46 % Equation resolutions : 22
% 7.36/6.46 % Disequality decompositions : 0
% 7.36/6.46 % Total rewrite steps : 15924
% 7.36/6.46 % ...of those cached : 14716
% 7.36/6.46 % Propositional unsat checks : 0
% 7.36/6.46 % Propositional check models : 0
% 7.36/6.46 % Propositional check unsatisfiable : 0
% 7.36/6.46 % Propositional clauses : 0
% 7.36/6.46 % Propositional clauses after purity: 0
% 7.36/6.46 % Propositional unsat core size : 0
% 7.36/6.46 % Propositional preprocessing time : 0.000
% 7.36/6.46 % Propositional encoding time : 0.000
% 7.36/6.46 % Propositional solver time : 0.000
% 7.36/6.46 % Success case prop preproc time : 0.000
% 7.36/6.46 % Success case prop encoding time : 0.000
% 7.36/6.46 % Success case prop solver time : 0.000
% 7.36/6.46 % Current number of processed clauses : 2089
% 7.36/6.46 % Positive orientable unit clauses : 223
% 7.36/6.46 % Positive unorientable unit clauses: 4
% 7.36/6.46 % Negative unit clauses : 8
% 7.36/6.46 % Non-unit-clauses : 1854
% 7.36/6.46 % Current number of unprocessed clauses: 35110
% 7.36/6.46 % ...number of literals in the above : 120743
% 7.36/6.46 % Current number of archived formulas : 0
% 7.36/6.46 % Current number of archived clauses : 692
% 7.36/6.46 % Clause-clause subsumption calls (NU) : 371706
% 7.36/6.46 % Rec. Clause-clause subsumption calls : 259498
% 7.36/6.46 % Non-unit clause-clause subsumptions : 6138
% 7.36/6.46 % Unit Clause-clause subsumption calls : 14338
% 7.36/6.46 % Rewrite failures with RHS unbound : 16
% 7.36/6.46 % BW rewrite match attempts : 884
% 7.36/6.46 % BW rewrite match successes : 631
% 7.36/6.46 % Condensation attempts : 0
% 7.36/6.46 % Condensation successes : 0
% 7.36/6.46 % Termbank termtop insertions : 1500456
% 7.36/6.46 % Search garbage collected termcells : 287
% 7.36/6.46
% 7.36/6.46 % -------------------------------------------------
% 7.36/6.46 % User time : 0.907 s
% 7.36/6.46 % System time : 0.040 s
% 7.36/6.46 % Total time : 0.947 s
% 7.36/6.46 % Maximum resident set size: 3780 pages
% 7.36/6.46
% 7.36/6.46 % -------------------------------------------------
% 7.36/6.46 % User time : 4.526 s
% 7.36/6.46 % System time : 0.178 s
% 7.36/6.46 % Total time : 4.704 s
% 7.36/6.46 % Maximum resident set size: 4864 pages
% 7.36/6.46 % E exiting
%------------------------------------------------------------------------------