%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM042-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 : n010.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:44:18 PM UTC 2026
% Result : Unsatisfiable 0.16s 5.62s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 39 ( 20 unt; 3 nHn; 23 RR)
% Number of literals : 61 ( 11 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 68 ( 5 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(irreflexive2,axiom,
( ~ subclass(restrict(X1,X2,X2),complement(identity_relation))
| irreflexive(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM004-0.ax',irreflexive2) ).
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_irreflexive_class_property4_1,negated_conjecture,
subclass(x,complement(identity_relation)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_irreflexive_class_property4_1) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction2) ).
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(prove_irreflexive_class_property4_2,negated_conjecture,
~ irreflexive(x,domain_of(symmetrization_of(x))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_irreflexive_class_property4_2) ).
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(c_0_12,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_13,plain,
( ~ subclass(restrict(X1,X2,X2),complement(identity_relation))
| irreflexive(X1,X2) ),
inference(fof_simplification,[status(thm)],[irreflexive2]) ).
cnf(c_0_14,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_15,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_12 ).
cnf(c_0_16,negated_conjecture,
subclass(x,complement(identity_relation)),
prove_irreflexive_class_property4_1 ).
cnf(c_0_17,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_18,plain,
( ~ subclass(restrict(X1,X2,X2),complement(identity_relation))
| irreflexive(X1,X2) ),
c_0_13 ).
cnf(c_0_19,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_20,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_21,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_14 ).
cnf(c_0_22,negated_conjecture,
( ~ member(X1,x)
| member(X1,complement(identity_relation)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_17 ).
cnf(c_0_24,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_25,negated_conjecture,
~ irreflexive(x,domain_of(symmetrization_of(x))),
inference(fof_simplification,[status(thm)],[prove_irreflexive_class_property4_2]) ).
cnf(c_0_26,plain,
( ~ subclass(intersection(X1,cross_product(X2,X2)),complement(identity_relation))
| irreflexive(X1,X2) ),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(not_subclass_element(X1,complement(identity_relation)),x)
| subclass(X1,complement(identity_relation)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
~ irreflexive(x,domain_of(symmetrization_of(x))),
c_0_25 ).
cnf(c_0_31,axiom,
union(X1,inverse(X1)) = symmetrization_of(X1),
symmetrization ).
cnf(c_0_32,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
inverse ).
cnf(c_0_33,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_34,plain,
( ~ subclass(intersection(cross_product(X2,X2),X1),complement(identity_relation))
| irreflexive(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
subclass(intersection(X1,x),complement(identity_relation)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
~ irreflexive(x,domain_of(complement(intersection(complement(x),complement(domain_of(flip(cross_product(x,universal_class)))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33]) ).
cnf(c_0_37,negated_conjecture,
irreflexive(x,X1),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM042-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.11/5.39 % Computer : n010.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Mon Sep 21 02:00:05 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.46 Running first-order theorem proving
% 0.16/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
% 0.16/5.62 % Version: 3.5.1
% 0.16/5.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/5.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/5.62 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.62 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.62 % Starting sh5l with 300s (1) cores
% 0.16/5.62 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4008426 completed with status 0
% 0.16/5.62 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/5.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/5.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/5.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.62 % No SInE strategy applied
% 0.16/5.62 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/5.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.62 % Starting SubtermCWHack with 136s (1) cores
% 0.16/5.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/5.62 % Starting new_bool_3 with 311s (1) cores
% 0.16/5.62 % Starting new_bool_1 with 308s (1) cores
% 0.16/5.62 % Starting sh5l with 304s (1) cores
% 0.16/5.62 % SubtermCWHack with pid 4008433 completed with status 0
% 0.16/5.62 % Result found by SubtermCWHack
% 0.16/5.62 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/5.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.62 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/5.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.62 % No SInE strategy applied
% 0.16/5.62 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/5.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.62 % Starting SubtermCWHack with 136s (1) cores
% 0.16/5.62 % Preprocessing time : 0.005 s
% 0.16/5.62
% 0.16/5.62 % Proof found!
% 0.16/5.62 % SZS status Unsatisfiable
% 0.16/5.62 % SZS output start CNFRefutation
% See solution above
% 0.16/5.62 % Parsed axioms : 160
% 0.16/5.62 % Removed by relevancy pruning/SinE : 0
% 0.16/5.62 % Initial clauses : 160
% 0.16/5.62 % Removed in clause preprocessing : 19
% 0.16/5.62 % Initial clauses in saturation : 141
% 0.16/5.62 % Processed clauses : 682
% 0.16/5.62 % ...of these trivial : 1
% 0.16/5.62 % ...subsumed : 326
% 0.16/5.62 % ...remaining for further processing : 354
% 0.16/5.62 % Other redundant clauses eliminated : 6
% 0.16/5.62 % Clauses deleted for lack of memory : 0
% 0.16/5.62 % Backward-subsumed : 15
% 0.16/5.62 % Backward-rewritten : 4
% 0.16/5.62 % Generated clauses : 1693
% 0.16/5.62 % ...of the previous two non-redundant : 1375
% 0.16/5.62 % ...aggressively subsumed : 0
% 0.16/5.62 % Contextual simplify-reflections : 5
% 0.16/5.62 % Paramodulations : 1687
% 0.16/5.62 % Factorizations : 0
% 0.16/5.62 % NegExts : 0
% 0.16/5.62 % Equation resolutions : 6
% 0.16/5.62 % Disequality decompositions : 0
% 0.16/5.62 % Total rewrite steps : 560
% 0.16/5.62 % ...of those cached : 478
% 0.16/5.62 % Propositional unsat checks : 0
% 0.16/5.62 % Propositional check models : 0
% 0.16/5.62 % Propositional check unsatisfiable : 0
% 0.16/5.62 % Propositional clauses : 0
% 0.16/5.62 % Propositional clauses after purity: 0
% 0.16/5.62 % Propositional unsat core size : 0
% 0.16/5.62 % Propositional preprocessing time : 0.000
% 0.16/5.62 % Propositional encoding time : 0.000
% 0.16/5.62 % Propositional solver time : 0.000
% 0.16/5.62 % Success case prop preproc time : 0.000
% 0.16/5.62 % Success case prop encoding time : 0.000
% 0.16/5.62 % Success case prop solver time : 0.000
% 0.16/5.62 % Current number of processed clauses : 329
% 0.16/5.62 % Positive orientable unit clauses : 56
% 0.16/5.62 % Positive unorientable unit clauses: 1
% 0.16/5.62 % Negative unit clauses : 1
% 0.16/5.62 % Non-unit-clauses : 271
% 0.16/5.62 % Current number of unprocessed clauses: 817
% 0.16/5.62 % ...number of literals in the above : 2457
% 0.16/5.62 % Current number of archived formulas : 0
% 0.16/5.62 % Current number of archived clauses : 38
% 0.16/5.62 % Clause-clause subsumption calls (NU) : 7353
% 0.16/5.62 % Rec. Clause-clause subsumption calls : 5392
% 0.16/5.62 % Non-unit clause-clause subsumptions : 282
% 0.16/5.62 % Unit Clause-clause subsumption calls : 325
% 0.16/5.62 % Rewrite failures with RHS unbound : 0
% 0.16/5.62 % BW rewrite match attempts : 23
% 0.16/5.62 % BW rewrite match successes : 6
% 0.16/5.62 % Condensation attempts : 0
% 0.16/5.62 % Condensation successes : 0
% 0.16/5.62 % Termbank termtop insertions : 27703
% 0.16/5.62 % Search garbage collected termcells : 287
% 0.16/5.62
% 0.16/5.62 % -------------------------------------------------
% 0.16/5.62 % User time : 0.084 s
% 0.16/5.62 % System time : 0.012 s
% 0.16/5.62 % Total time : 0.096 s
% 0.16/5.62 % Maximum resident set size: 4036 pages
% 0.16/5.62
% 0.16/5.62 % -------------------------------------------------
% 0.16/5.62 % User time : 0.312 s
% 0.16/5.62 % System time : 0.041 s
% 0.16/5.62 % Total time : 0.353 s
% 0.16/5.62 % Maximum resident set size: 4864 pages
% 0.16/5.62 % E exiting
%------------------------------------------------------------------------------