TSTP Solution File: SET814+4 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SET814+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Tue Jul 19 00:54:32 EDT 2022

% Result   : Theorem 0.20s 1.40s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (   3 unt;   0 def)
%            Number of atoms       :   77 (   0 equ)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :   88 (  34   ~;  35   |;  12   &)
%                                         (   3 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   45 (   5 sgn  22   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(subset,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
    <=> ! [X3] :
          ( member(X3,X1)
         => member(X3,X2) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).

fof(ordinal_number,axiom,
    ! [X1] :
      ( member(X1,on)
    <=> ( set(X1)
        & strict_well_order(member_predicate,X1)
        & ! [X3] :
            ( member(X3,X1)
           => subset(X3,X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET006+4.ax',ordinal_number) ).

fof(thV14,conjecture,
    ! [X1] :
      ( member(X1,on)
     => subset(sum(X1),X1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thV14) ).

fof(sum,axiom,
    ! [X3,X1] :
      ( member(X3,sum(X1))
    <=> ? [X5] :
          ( member(X5,X1)
          & member(X3,X5) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',sum) ).

fof(c_0_4,plain,
    ! [X4,X5,X6,X4,X5] :
      ( ( ~ subset(X4,X5)
        | ~ member(X6,X4)
        | member(X6,X5) )
      & ( member(esk2_2(X4,X5),X4)
        | subset(X4,X5) )
      & ( ~ member(esk2_2(X4,X5),X5)
        | subset(X4,X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subset])])])])])])]) ).

fof(c_0_5,plain,
    ! [X4,X5,X4] :
      ( ( set(X4)
        | ~ member(X4,on) )
      & ( strict_well_order(member_predicate,X4)
        | ~ member(X4,on) )
      & ( ~ member(X5,X4)
        | subset(X5,X4)
        | ~ member(X4,on) )
      & ( member(esk4_1(X4),X4)
        | ~ set(X4)
        | ~ strict_well_order(member_predicate,X4)
        | member(X4,on) )
      & ( ~ subset(esk4_1(X4),X4)
        | ~ set(X4)
        | ~ strict_well_order(member_predicate,X4)
        | member(X4,on) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ordinal_number])])])])])])]) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X1] :
        ( member(X1,on)
       => subset(sum(X1),X1) ),
    inference(assume_negation,[status(cth)],[thV14]) ).

cnf(c_0_7,plain,
    ( member(X1,X2)
    | ~ member(X1,X3)
    | ~ subset(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ( subset(X2,X1)
    | ~ member(X1,on)
    | ~ member(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_9,negated_conjecture,
    ( member(esk1_0,on)
    & ~ subset(sum(esk1_0),esk1_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

cnf(c_0_10,plain,
    ( member(X1,X2)
    | ~ member(X2,on)
    | ~ member(X1,X3)
    | ~ member(X3,X2) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    member(esk1_0,on),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_12,plain,
    ! [X6,X7,X6,X7,X9] :
      ( ( member(esk3_2(X6,X7),X7)
        | ~ member(X6,sum(X7)) )
      & ( member(X6,esk3_2(X6,X7))
        | ~ member(X6,sum(X7)) )
      & ( ~ member(X9,X7)
        | ~ member(X6,X9)
        | member(X6,sum(X7)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum])])])])])])]) ).

cnf(c_0_13,negated_conjecture,
    ( member(X1,esk1_0)
    | ~ member(X2,esk1_0)
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,plain,
    ( member(esk3_2(X1,X2),X2)
    | ~ member(X1,sum(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ( member(X1,esk1_0)
    | ~ member(X1,esk3_2(X2,esk1_0))
    | ~ member(X2,sum(esk1_0)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,plain,
    ( member(X1,esk3_2(X1,X2))
    | ~ member(X1,sum(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    ( member(X1,esk1_0)
    | ~ member(X1,sum(esk1_0)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_18,plain,
    ( subset(X1,X2)
    | member(esk2_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_19,plain,
    ( subset(X1,X2)
    | ~ member(esk2_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_20,negated_conjecture,
    ( member(esk2_2(sum(esk1_0),X1),esk1_0)
    | subset(sum(esk1_0),X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,negated_conjecture,
    ~ subset(sum(esk1_0),esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SET814+4 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : run_ET %s %d
% 0.11/0.32  % Computer : n014.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Sun Jul 10 14:25:05 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.20/1.40  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.40  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.40  # Preprocessing time       : 0.019 s
% 0.20/1.40  
% 0.20/1.40  # Proof found!
% 0.20/1.40  # SZS status Theorem
% 0.20/1.40  # SZS output start CNFRefutation
% See solution above
% 0.20/1.40  # Proof object total steps             : 23
% 0.20/1.40  # Proof object clause steps            : 14
% 0.20/1.40  # Proof object formula steps           : 9
% 0.20/1.40  # Proof object conjectures             : 10
% 0.20/1.40  # Proof object clause conjectures      : 7
% 0.20/1.40  # Proof object formula conjectures     : 3
% 0.20/1.40  # Proof object initial clauses used    : 8
% 0.20/1.40  # Proof object initial formulas used   : 4
% 0.20/1.40  # Proof object generating inferences   : 6
% 0.20/1.40  # Proof object simplifying inferences  : 1
% 0.20/1.40  # Training examples: 0 positive, 0 negative
% 0.20/1.40  # Parsed axioms                        : 21
% 0.20/1.40  # Removed by relevancy pruning/SinE    : 11
% 0.20/1.40  # Initial clauses                      : 53
% 0.20/1.40  # Removed in clause preprocessing      : 0
% 0.20/1.40  # Initial clauses in saturation        : 53
% 0.20/1.40  # Processed clauses                    : 138
% 0.20/1.40  # ...of these trivial                  : 0
% 0.20/1.40  # ...subsumed                          : 21
% 0.20/1.40  # ...remaining for further processing  : 117
% 0.20/1.40  # Other redundant clauses eliminated   : 0
% 0.20/1.40  # Clauses deleted for lack of memory   : 0
% 0.20/1.40  # Backward-subsumed                    : 1
% 0.20/1.40  # Backward-rewritten                   : 0
% 0.20/1.40  # Generated clauses                    : 576
% 0.20/1.40  # ...of the previous two non-trivial   : 560
% 0.20/1.40  # Contextual simplify-reflections      : 16
% 0.20/1.40  # Paramodulations                      : 576
% 0.20/1.40  # Factorizations                       : 0
% 0.20/1.40  # Equation resolutions                 : 0
% 0.20/1.40  # Current number of processed clauses  : 116
% 0.20/1.40  #    Positive orientable unit clauses  : 3
% 0.20/1.40  #    Positive unorientable unit clauses: 0
% 0.20/1.40  #    Negative unit clauses             : 2
% 0.20/1.40  #    Non-unit-clauses                  : 111
% 0.20/1.40  # Current number of unprocessed clauses: 475
% 0.20/1.40  # ...number of literals in the above   : 2127
% 0.20/1.40  # Current number of archived formulas  : 0
% 0.20/1.40  # Current number of archived clauses   : 1
% 0.20/1.40  # Clause-clause subsumption calls (NU) : 1480
% 0.20/1.40  # Rec. Clause-clause subsumption calls : 1127
% 0.20/1.40  # Non-unit clause-clause subsumptions  : 38
% 0.20/1.40  # Unit Clause-clause subsumption calls : 10
% 0.20/1.40  # Rewrite failures with RHS unbound    : 0
% 0.20/1.40  # BW rewrite match attempts            : 6
% 0.20/1.40  # BW rewrite match successes           : 0
% 0.20/1.40  # Condensation attempts                : 0
% 0.20/1.40  # Condensation successes               : 0
% 0.20/1.40  # Termbank termtop insertions          : 12579
% 0.20/1.40  
% 0.20/1.40  # -------------------------------------------------
% 0.20/1.40  # User time                : 0.033 s
% 0.20/1.40  # System time              : 0.002 s
% 0.20/1.40  # Total time               : 0.035 s
% 0.20/1.40  # Maximum resident set size: 3616 pages
% 0.20/23.40  eprover: CPU time limit exceeded, terminating
% 0.20/23.41  eprover: CPU time limit exceeded, terminating
% 0.20/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.42  eprover: No such file or directory
% 0.20/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.42  eprover: No such file or directory
% 0.20/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.42  eprover: No such file or directory
% 0.20/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.42  eprover: No such file or directory
% 0.20/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43  eprover: No such file or directory
% 0.20/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.43  eprover: No such file or directory
% 0.20/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43  eprover: No such file or directory
% 0.20/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.43  eprover: No such file or directory
% 0.20/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44  eprover: No such file or directory
% 0.20/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.44  eprover: No such file or directory
% 0.20/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44  eprover: No such file or directory
% 0.20/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.44  eprover: No such file or directory
% 0.20/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44  eprover: No such file or directory
% 0.20/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.45  eprover: No such file or directory
% 0.20/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.45  eprover: No such file or directory
% 0.20/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.45  eprover: No such file or directory
% 0.20/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.45  eprover: No such file or directory
% 0.20/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.46  eprover: No such file or directory
% 0.20/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.46  eprover: No such file or directory
% 0.20/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.46  eprover: No such file or directory
% 0.20/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.46  eprover: No such file or directory
% 0.20/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.46  eprover: No such file or directory
%------------------------------------------------------------------------------