↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : NUM500+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n011.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 : Mon Jul 18 09:33:07 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   37 (  12 unt;   0 def)
%            Number of atoms       :  156 (  59 equ)
%            Maximal formula atoms :   32 (   4 avg)
%            Number of connectives :  189 (  70   ~;  82   |;  29   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   34 (   1 sgn  18   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ? [X1] :
      ( aNaturalNumber0(X1)
      & doDivides0(X1,xk)
      & isPrime0(X1) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

fof(mDefPrime,axiom,
    ! [X1] :
      ( aNaturalNumber0(X1)
     => ( isPrime0(X1)
      <=> ( X1 != sz00
          & X1 != sz10
          & ! [X2] :
              ( ( aNaturalNumber0(X2)
                & doDivides0(X2,X1) )
             => ( X2 = sz10
                | X2 = X1 ) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefPrime) ).

fof(mPrimDiv,axiom,
    ! [X1] :
      ( ( aNaturalNumber0(X1)
        & X1 != sz00
        & X1 != sz10 )
     => ? [X2] :
          ( aNaturalNumber0(X2)
          & doDivides0(X2,X1)
          & isPrime0(X2) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mPrimDiv) ).

fof(mDefQuot,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( ( X1 != sz00
          & doDivides0(X1,X2) )
       => ! [X3] :
            ( X3 = sdtsldt0(X2,X1)
          <=> ( aNaturalNumber0(X3)
              & X2 = sdtasdt0(X1,X3) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefQuot) ).

fof(m__1860,hypothesis,
    ( isPrime0(xp)
    & doDivides0(xp,sdtasdt0(xn,xm)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1860) ).

fof(m__1837,hypothesis,
    ( aNaturalNumber0(xn)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xp) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1837) ).

fof(m__2315,hypothesis,
    ~ ( xk = sz00
      | xk = sz10 ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2315) ).

fof(m__2306,hypothesis,
    xk = sdtsldt0(sdtasdt0(xn,xm),xp),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2306) ).

fof(mSortsB_02,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => aNaturalNumber0(sdtasdt0(X1,X2)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB_02) ).

fof(c_0_9,negated_conjecture,
    ~ ? [X1] :
        ( aNaturalNumber0(X1)
        & doDivides0(X1,xk)
        & isPrime0(X1) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_10,plain,
    ! [X3,X4] :
      ( ( X3 != sz00
        | ~ isPrime0(X3)
        | ~ aNaturalNumber0(X3) )
      & ( X3 != sz10
        | ~ isPrime0(X3)
        | ~ aNaturalNumber0(X3) )
      & ( ~ aNaturalNumber0(X4)
        | ~ doDivides0(X4,X3)
        | X4 = sz10
        | X4 = X3
        | ~ isPrime0(X3)
        | ~ aNaturalNumber0(X3) )
      & ( aNaturalNumber0(esk3_1(X3))
        | X3 = sz00
        | X3 = sz10
        | isPrime0(X3)
        | ~ aNaturalNumber0(X3) )
      & ( doDivides0(esk3_1(X3),X3)
        | X3 = sz00
        | X3 = sz10
        | isPrime0(X3)
        | ~ aNaturalNumber0(X3) )
      & ( esk3_1(X3) != sz10
        | X3 = sz00
        | X3 = sz10
        | isPrime0(X3)
        | ~ aNaturalNumber0(X3) )
      & ( esk3_1(X3) != X3
        | X3 = sz00
        | X3 = sz10
        | isPrime0(X3)
        | ~ aNaturalNumber0(X3) ) ),
    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)],[mDefPrime])])])])])])]) ).

fof(c_0_11,negated_conjecture,
    ! [X2] :
      ( ~ aNaturalNumber0(X2)
      | ~ doDivides0(X2,xk)
      | ~ isPrime0(X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).

fof(c_0_12,plain,
    ! [X3] :
      ( ( aNaturalNumber0(esk4_1(X3))
        | ~ aNaturalNumber0(X3)
        | X3 = sz00
        | X3 = sz10 )
      & ( doDivides0(esk4_1(X3),X3)
        | ~ aNaturalNumber0(X3)
        | X3 = sz00
        | X3 = sz10 )
      & ( isPrime0(esk4_1(X3))
        | ~ aNaturalNumber0(X3)
        | X3 = sz00
        | X3 = sz10 ) ),
    inference(distribute,[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)],[mPrimDiv])])])])])]) ).

fof(c_0_13,plain,
    ! [X4,X5,X6,X6] :
      ( ( aNaturalNumber0(X6)
        | X6 != sdtsldt0(X5,X4)
        | X4 = sz00
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( X5 = sdtasdt0(X4,X6)
        | X6 != sdtsldt0(X5,X4)
        | X4 = sz00
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( ~ aNaturalNumber0(X6)
        | X5 != sdtasdt0(X4,X6)
        | X6 = sdtsldt0(X5,X4)
        | X4 = sz00
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefQuot])])])])])]) ).

cnf(c_0_14,plain,
    ( ~ aNaturalNumber0(X1)
    | ~ isPrime0(X1)
    | X1 != sz00 ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,hypothesis,
    isPrime0(xp),
    inference(split_conjunct,[status(thm)],[m__1860]) ).

cnf(c_0_16,hypothesis,
    aNaturalNumber0(xp),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ isPrime0(X1)
    | ~ doDivides0(X1,xk)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,plain,
    ( X1 = sz10
    | X1 = sz00
    | isPrime0(esk4_1(X1))
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_19,plain,
    ( X1 = sz10
    | X1 = sz00
    | aNaturalNumber0(esk4_1(X1))
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_20,hypothesis,
    ( xk != sz00
    & xk != sz10 ),
    inference(fof_nnf,[status(thm)],[m__2315]) ).

cnf(c_0_21,plain,
    ( X2 = sz00
    | aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ doDivides0(X2,X1)
    | X3 != sdtsldt0(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_22,hypothesis,
    xk = sdtsldt0(sdtasdt0(xn,xm),xp),
    inference(split_conjunct,[status(thm)],[m__2306]) ).

cnf(c_0_23,hypothesis,
    doDivides0(xp,sdtasdt0(xn,xm)),
    inference(split_conjunct,[status(thm)],[m__1860]) ).

cnf(c_0_24,hypothesis,
    sz00 != xp,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).

fof(c_0_25,plain,
    ! [X3,X4] :
      ( ~ aNaturalNumber0(X3)
      | ~ aNaturalNumber0(X4)
      | aNaturalNumber0(sdtasdt0(X3,X4)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).

cnf(c_0_26,negated_conjecture,
    ( X1 = sz00
    | X1 = sz10
    | ~ doDivides0(esk4_1(X1),xk)
    | ~ aNaturalNumber0(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_27,plain,
    ( X1 = sz10
    | X1 = sz00
    | doDivides0(esk4_1(X1),X1)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_28,hypothesis,
    xk != sz00,
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_29,hypothesis,
    xk != sz10,
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_30,hypothesis,
    ( aNaturalNumber0(X1)
    | X1 != xk
    | ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_16])]),c_0_24]) ).

cnf(c_0_31,plain,
    ( aNaturalNumber0(sdtasdt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_32,hypothesis,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

cnf(c_0_33,hypothesis,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

cnf(c_0_34,negated_conjecture,
    ~ aNaturalNumber0(xk),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]) ).

cnf(c_0_35,hypothesis,
    ( aNaturalNumber0(X1)
    | X1 != xk ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).

cnf(c_0_36,hypothesis,
    $false,
    inference(spm,[status(thm)],[c_0_34,c_0_35]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM500+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n011.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jul  7 13:51:24 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42  # Preprocessing time       : 0.020 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.42  # Proof object total steps             : 37
% 0.24/1.42  # Proof object clause steps            : 21
% 0.24/1.42  # Proof object formula steps           : 16
% 0.24/1.42  # Proof object conjectures             : 6
% 0.24/1.42  # Proof object clause conjectures      : 3
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 15
% 0.24/1.42  # Proof object initial formulas used   : 9
% 0.24/1.42  # Proof object generating inferences   : 6
% 0.24/1.42  # Proof object simplifying inferences  : 12
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 48
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 1
% 0.24/1.42  # Initial clauses                      : 85
% 0.24/1.42  # Removed in clause preprocessing      : 3
% 0.24/1.42  # Initial clauses in saturation        : 82
% 0.24/1.42  # Processed clauses                    : 136
% 0.24/1.42  # ...of these trivial                  : 0
% 0.24/1.42  # ...subsumed                          : 27
% 0.24/1.42  # ...remaining for further processing  : 109
% 0.24/1.42  # Other redundant clauses eliminated   : 10
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 3
% 0.24/1.42  # Backward-rewritten                   : 2
% 0.24/1.42  # Generated clauses                    : 484
% 0.24/1.42  # ...of the previous two non-trivial   : 443
% 0.24/1.42  # Contextual simplify-reflections      : 14
% 0.24/1.42  # Paramodulations                      : 465
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 19
% 0.24/1.42  # Current number of processed clauses  : 103
% 0.24/1.42  #    Positive orientable unit clauses  : 12
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 11
% 0.24/1.42  #    Non-unit-clauses                  : 80
% 0.24/1.42  # Current number of unprocessed clauses: 353
% 0.24/1.42  # ...number of literals in the above   : 2075
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 5
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 1405
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 280
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 36
% 0.24/1.42  # Unit Clause-clause subsumption calls : 239
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 2
% 0.24/1.42  # BW rewrite match successes           : 2
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 13048
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.034 s
% 0.24/1.42  # System time              : 0.002 s
% 0.24/1.42  # Total time               : 0.036 s
% 0.24/1.42  # Maximum resident set size: 3420 pages
% 0.24/23.42  eprover: CPU time limit exceeded, terminating
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49  eprover: No such file or directory
%------------------------------------------------------------------------------