↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET451-6 : 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 : 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 02:14:13 PM UTC 2026

% Result   : Unsatisfiable 0.22s 0.57s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   19 (   9 unt;   2 nHn;  15 RR)
%            Number of literals    :   29 (   5 equ;  11 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   3 con; 0-2 aty)
%            Number of variables   :   23 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(intersection1,axiom,
    ( ~ member(X1,intersection(X2,X3))
    | member(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).

cnf(subset_relation,axiom,
    intersection(cross_product(universal_class,universal_class),intersection(cross_product(universal_class,universal_class),complement(compose(complement(element_relation),inverse(element_relation))))) = subset_relation,
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subset_relation) ).

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

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(prove_subset_relation_alternate_defn1_1,negated_conjecture,
    ~ subclass(subset_relation,cross_product(universal_class,universal_class)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subset_relation_alternate_defn1_1) ).

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(c_0_6,plain,
    ( ~ member(X1,intersection(X2,X3))
    | member(X1,X2) ),
    inference(fof_simplification,[status(thm)],[intersection1]) ).

cnf(c_0_7,axiom,
    intersection(cross_product(universal_class,universal_class),intersection(cross_product(universal_class,universal_class),complement(compose(complement(element_relation),inverse(element_relation))))) = subset_relation,
    subset_relation ).

cnf(c_0_8,axiom,
    domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
    inverse ).

cnf(c_0_9,plain,
    ( ~ member(not_subclass_element(X1,X2),X2)
    | subclass(X1,X2) ),
    inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).

cnf(c_0_10,plain,
    ( ~ member(X1,intersection(X2,X3))
    | member(X1,X2) ),
    c_0_6 ).

cnf(c_0_11,plain,
    intersection(cross_product(universal_class,universal_class),intersection(cross_product(universal_class,universal_class),complement(compose(complement(element_relation),domain_of(flip(cross_product(element_relation,universal_class))))))) = subset_relation,
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    ( ~ member(not_subclass_element(X1,X2),X2)
    | subclass(X1,X2) ),
    c_0_9 ).

cnf(c_0_13,plain,
    ( ~ member(X1,subset_relation)
    | member(X1,cross_product(universal_class,universal_class)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    ~ subclass(subset_relation,cross_product(universal_class,universal_class)),
    inference(fof_simplification,[status(thm)],[prove_subset_relation_alternate_defn1_1]) ).

cnf(c_0_15,plain,
    ( ~ member(not_subclass_element(X1,cross_product(universal_class,universal_class)),subset_relation)
    | subclass(X1,cross_product(universal_class,universal_class)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,axiom,
    ( subclass(X1,X2)
    | member(not_subclass_element(X1,X2),X1) ),
    not_subclass_members1 ).

cnf(c_0_17,negated_conjecture,
    ~ subclass(subset_relation,cross_product(universal_class,universal_class)),
    c_0_14 ).

cnf(c_0_18,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SET451-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43  % Computer : n010.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Mon Sep 21 05:18:39 UTC 2026
% 0.17/0.44  % CPUTime  : 
% 0.17/0.44  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.51  Running first-order theorem proving
% 0.22/0.51  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
% 0.22/0.57  % Version: 3.5.1
% 0.22/0.57  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.57  % Starting new_bool_3 with 300s (1) cores
% 0.22/0.57  % Starting new_bool_1 with 300s (1) cores
% 0.22/0.57  % Starting sh5l with 300s (1) cores
% 0.22/0.57  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 93998 completed with status 0
% 0.22/0.57  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/0.57  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.57  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.57  % No SInE strategy applied
% 0.22/0.57  % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.22/0.57  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.57  % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.57  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.57  % Starting new_bool_3 with 311s (1) cores
% 0.22/0.57  % Starting new_bool_1 with 308s (1) cores
% 0.22/0.57  % Starting sh5l with 304s (1) cores
% 0.22/0.57  % sh5l with pid 94009 completed with status 0
% 0.22/0.57  % Result found by sh5l
% 0.22/0.57  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.57  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.57  % No SInE strategy applied
% 0.22/0.57  % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.22/0.57  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.57  % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.57  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.57  % Starting new_bool_3 with 311s (1) cores
% 0.22/0.57  % Starting new_bool_1 with 308s (1) cores
% 0.22/0.57  % Starting sh5l with 304s (1) cores
% 0.22/0.57  % Preprocessing time       : 0.005 s
% 0.22/0.57  % Presaturation interreduction done
% 0.22/0.57  
% 0.22/0.57  % Proof found!
% 0.22/0.57  % SZS status Unsatisfiable
% 0.22/0.57  % SZS output start CNFRefutation
% See solution above
% 0.22/0.57  % Parsed axioms                        : 113
% 0.22/0.57  % Removed by relevancy pruning/SinE    : 0
% 0.22/0.57  % Initial clauses                      : 113
% 0.22/0.57  % Removed in clause preprocessing      : 17
% 0.22/0.57  % Initial clauses in saturation        : 96
% 0.22/0.57  % Processed clauses                    : 158
% 0.22/0.57  % ...of these trivial                  : 0
% 0.22/0.57  % ...subsumed                          : 1
% 0.22/0.57  % ...remaining for further processing  : 157
% 0.22/0.57  % Other redundant clauses eliminated   : 4
% 0.22/0.57  % Clauses deleted for lack of memory   : 0
% 0.22/0.57  % Backward-subsumed                    : 0
% 0.22/0.57  % Backward-rewritten                   : 0
% 0.22/0.57  % Generated clauses                    : 44
% 0.22/0.57  % ...of the previous two non-redundant : 39
% 0.22/0.57  % ...aggressively subsumed             : 0
% 0.22/0.57  % Contextual simplify-reflections      : 0
% 0.22/0.57  % Paramodulations                      : 40
% 0.22/0.57  % Factorizations                       : 0
% 0.22/0.57  % NegExts                              : 0
% 0.22/0.57  % Equation resolutions                 : 4
% 0.22/0.57  % Disequality decompositions           : 0
% 0.22/0.57  % Total rewrite steps                  : 3
% 0.22/0.57  % ...of those cached                   : 1
% 0.22/0.57  % Propositional unsat checks           : 0
% 0.22/0.57  %    Propositional check models        : 0
% 0.22/0.57  %    Propositional check unsatisfiable : 0
% 0.22/0.57  %    Propositional clauses             : 0
% 0.22/0.57  %    Propositional clauses after purity: 0
% 0.22/0.57  %    Propositional unsat core size     : 0
% 0.22/0.57  %    Propositional preprocessing time  : 0.000
% 0.22/0.57  %    Propositional encoding time       : 0.000
% 0.22/0.57  %    Propositional solver time         : 0.000
% 0.22/0.57  %    Success case prop preproc time    : 0.000
% 0.22/0.57  %    Success case prop encoding time   : 0.000
% 0.22/0.57  %    Success case prop solver time     : 0.000
% 0.22/0.57  % Current number of processed clauses  : 58
% 0.22/0.57  %    Positive orientable unit clauses  : 19
% 0.22/0.57  %    Positive unorientable unit clauses: 0
% 0.22/0.57  %    Negative unit clauses             : 2
% 0.22/0.57  %    Non-unit-clauses                  : 37
% 0.22/0.57  % Current number of unprocessed clauses: 71
% 0.22/0.57  % ...number of literals in the above   : 169
% 0.22/0.57  % Current number of archived formulas  : 0
% 0.22/0.57  % Current number of archived clauses   : 112
% 0.22/0.57  % Clause-clause subsumption calls (NU) : 1230
% 0.22/0.57  % Rec. Clause-clause subsumption calls : 697
% 0.22/0.57  % Non-unit clause-clause subsumptions  : 1
% 0.22/0.57  % Unit Clause-clause subsumption calls : 10
% 0.22/0.57  % Rewrite failures with RHS unbound    : 0
% 0.22/0.57  % BW rewrite match attempts            : 15
% 0.22/0.57  % BW rewrite match successes           : 1
% 0.22/0.57  % Condensation attempts                : 158
% 0.22/0.57  % Condensation successes               : 0
% 0.22/0.57  % Termbank termtop insertions          : 8585
% 0.22/0.57  % Search garbage collected termcells   : 185
% 0.22/0.57  
% 0.22/0.57  % -------------------------------------------------
% 0.22/0.57  % User time                : 0.030 s
% 0.22/0.57  % System time              : 0.007 s
% 0.22/0.57  % Total time               : 0.036 s
% 0.22/0.57  % Maximum resident set size: 3940 pages
% 0.22/0.57  
% 0.22/0.57  % -------------------------------------------------
% 0.22/0.57  % User time                : 0.139 s
% 0.22/0.57  % System time              : 0.025 s
% 0.22/0.57  % Total time               : 0.164 s
% 0.22/0.57  % Maximum resident set size: 4864 pages
% 0.22/0.57  % E exiting
%------------------------------------------------------------------------------