↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NUM049-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n003.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 16.96s 2.94s
% Output   : CNFRefutation 16.96s
% 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/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).

cnf(class_elements_are_sets,axiom,
    subclass(X1,universal_class),
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).

cnf(not_subclass_members1,axiom,
    ( subclass(X1,X2)
    | member(not_subclass_element(X1,X2),X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).

cnf(complement1,axiom,
    ( ~ member(X1,X2)
    | ~ member(X1,complement(X2)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).

cnf(prove_connect_class_property4_1,negated_conjecture,
    subclass(cross_product(y,y),identity_relation),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_connect_class_property4_1) ).

cnf(intersection1,axiom,
    ( ~ member(X1,intersection(X2,X3))
    | member(X1,X2) ),
    file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/NUM004-0.ax',connected2) ).

cnf(symmetrization,axiom,
    union(X1,inverse(X1)) = symmetrization_of(X1),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM004-0.ax',symmetrization) ).

cnf(inverse,axiom,
    domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',inverse) ).

cnf(union,axiom,
    complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).

cnf(prove_connect_class_property4_2,negated_conjecture,
    ~ connected(x,y),
    file('/export/starexec/sandbox/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.03  % Problem  : NUM049-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n003.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 21 02:02:46 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 16.96/2.94  % Version: 3.5.1
% 16.96/2.94  % Preprocessing class: FSLSSMSMSSSNFFN.
% 16.96/2.94  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.96/2.94  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 16.96/2.94  % Starting new_bool_3 with 300s (1) cores
% 16.96/2.94  % Starting new_bool_1 with 300s (1) cores
% 16.96/2.94  % Starting sh5l with 300s (1) cores
% 16.96/2.94  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3174527 completed with status 0
% 16.96/2.94  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 16.96/2.94  % Preprocessing class: FSLSSMSMSSSNFFN.
% 16.96/2.94  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.96/2.94  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 16.96/2.94  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 16.96/2.94  % No SInE strategy applied
% 16.96/2.94  % Search class: FGHSM-FFLM31-DFFFFFNN
% 16.96/2.94  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 16.96/2.94  % Starting SubtermCWHack with 136s (1) cores
% 16.96/2.94  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 16.96/2.94  % Starting new_bool_3 with 311s (1) cores
% 16.96/2.94  % Starting new_bool_1 with 308s (1) cores
% 16.96/2.94  % Starting sh5l with 304s (1) cores
% 16.96/2.94  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3174535 completed with status 0
% 16.96/2.94  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 16.96/2.94  % Preprocessing class: FSLSSMSMSSSNFFN.
% 16.96/2.94  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.96/2.94  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 16.96/2.94  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 16.96/2.94  % No SInE strategy applied
% 16.96/2.94  % Search class: FGHSM-FFLM31-DFFFFFNN
% 16.96/2.94  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 16.96/2.94  % Starting SubtermCWHack with 136s (1) cores
% 16.96/2.94  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 16.96/2.94  % Preprocessing time       : 0.004 s
% 16.96/2.94  % Presaturation interreduction done
% 16.96/2.94  
% 16.96/2.94  % Proof found!
% 16.96/2.94  % SZS status Unsatisfiable
% 16.96/2.94  % SZS output start CNFRefutation
% See solution above
% 16.96/2.94  % Parsed axioms                        : 160
% 16.96/2.94  % Removed by relevancy pruning/SinE    : 0
% 16.96/2.94  % Initial clauses                      : 160
% 16.96/2.94  % Removed in clause preprocessing      : 19
% 16.96/2.94  % Initial clauses in saturation        : 141
% 16.96/2.94  % Processed clauses                    : 9968
% 16.96/2.94  % ...of these trivial                  : 64
% 16.96/2.94  % ...subsumed                          : 7127
% 16.96/2.94  % ...remaining for further processing  : 2777
% 16.96/2.94  % Other redundant clauses eliminated   : 22
% 16.96/2.94  % Clauses deleted for lack of memory   : 0
% 16.96/2.94  % Backward-subsumed                    : 228
% 16.96/2.94  % Backward-rewritten                   : 299
% 16.96/2.94  % Generated clauses                    : 53401
% 16.96/2.94  % ...of the previous two non-redundant : 45601
% 16.96/2.94  % ...aggressively subsumed             : 0
% 16.96/2.94  % Contextual simplify-reflections      : 62
% 16.96/2.94  % Paramodulations                      : 53363
% 16.96/2.94  % Factorizations                       : 16
% 16.96/2.94  % NegExts                              : 0
% 16.96/2.94  % Equation resolutions                 : 22
% 16.96/2.94  % Disequality decompositions           : 0
% 16.96/2.94  % Total rewrite steps                  : 16411
% 16.96/2.94  % ...of those cached                   : 15193
% 16.96/2.94  % Propositional unsat checks           : 0
% 16.96/2.94  %    Propositional check models        : 0
% 16.96/2.94  %    Propositional check unsatisfiable : 0
% 16.96/2.94  %    Propositional clauses             : 0
% 16.96/2.94  %    Propositional clauses after purity: 0
% 16.96/2.94  %    Propositional unsat core size     : 0
% 16.96/2.94  %    Propositional preprocessing time  : 0.000
% 16.96/2.94  %    Propositional encoding time       : 0.000
% 16.96/2.94  %    Propositional solver time         : 0.000
% 16.96/2.94  %    Success case prop preproc time    : 0.000
% 16.96/2.94  %    Success case prop encoding time   : 0.000
% 16.96/2.94  %    Success case prop solver time     : 0.000
% 16.96/2.94  % Current number of processed clauses  : 2104
% 16.96/2.94  %    Positive orientable unit clauses  : 223
% 16.96/2.94  %    Positive unorientable unit clauses: 4
% 16.96/2.94  %    Negative unit clauses             : 8
% 16.96/2.94  %    Non-unit-clauses                  : 1869
% 16.96/2.94  % Current number of unprocessed clauses: 35215
% 16.96/2.94  % ...number of literals in the above   : 121466
% 16.96/2.94  % Current number of archived formulas  : 0
% 16.96/2.94  % Current number of archived clauses   : 686
% 16.96/2.94  % Clause-clause subsumption calls (NU) : 374261
% 16.96/2.94  % Rec. Clause-clause subsumption calls : 262943
% 16.96/2.94  % Non-unit clause-clause subsumptions  : 6173
% 16.96/2.94  % Unit Clause-clause subsumption calls : 14361
% 16.96/2.94  % Rewrite failures with RHS unbound    : 16
% 16.96/2.94  % BW rewrite match attempts            : 885
% 16.96/2.94  % BW rewrite match successes           : 636
% 16.96/2.94  % Condensation attempts                : 0
% 16.96/2.94  % Condensation successes               : 0
% 16.96/2.94  % Termbank termtop insertions          : 1508317
% 16.96/2.94  % Search garbage collected termcells   : 287
% 16.96/2.94  
% 16.96/2.94  % -------------------------------------------------
% 16.96/2.94  % User time                : 2.378 s
% 16.96/2.94  % System time              : 0.060 s
% 16.96/2.94  % Total time               : 2.438 s
% 16.96/2.94  % Maximum resident set size: 4036 pages
% 16.96/2.94  
% 16.96/2.94  % -------------------------------------------------
% 16.96/2.94  % User time                : 11.594 s
% 16.96/2.94  % System time              : 0.344 s
% 16.96/2.94  % Total time               : 11.938 s
% 16.96/2.94  % Maximum resident set size: 4864 pages
% 16.96/2.94  % E exiting
%------------------------------------------------------------------------------