↑ Up

ET---2.0.THM-CRf.s

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

% Computer : n007.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:32:58 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   37 (  16 unt;   0 def)
%            Number of atoms       :  117 (  58 equ)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :  122 (  42   ~;  41   |;  34   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-2 aty)
%            Number of variables   :   31 (   0 sgn  16   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ( xr != xn
    & ( ? [X1] :
          ( aNaturalNumber0(X1)
          & sdtpldt0(xr,X1) = xn )
      | sdtlseqdt0(xr,xn) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

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

fof(m__1883,hypothesis,
    ( aNaturalNumber0(xr)
    & sdtpldt0(xp,xr) = xn
    & xr = sdtmndt0(xn,xp) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1883) ).

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__1870,hypothesis,
    ( ? [X1] :
        ( aNaturalNumber0(X1)
        & sdtpldt0(xp,X1) = xn )
    & sdtlseqdt0(xp,xn) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1870) ).

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

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

fof(mSortsC,axiom,
    aNaturalNumber0(sz00),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsC) ).

fof(m__1860,hypothesis,
    ( xp != sz00
    & xp != sz10
    & ! [X1] :
        ( ( aNaturalNumber0(X1)
          & ( ? [X2] :
                ( aNaturalNumber0(X2)
                & xp = sdtasdt0(X1,X2) )
            | doDivides0(X1,xp) ) )
       => ( X1 = sz10
          | X1 = xp ) )
    & isPrime0(xp)
    & ? [X1] :
        ( aNaturalNumber0(X1)
        & sdtasdt0(xn,xm) = sdtasdt0(xp,X1) )
    & doDivides0(xp,sdtasdt0(xn,xm)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1860) ).

fof(c_0_9,negated_conjecture,
    ~ ( xr != xn
      & ( ? [X1] :
            ( aNaturalNumber0(X1)
            & sdtpldt0(xr,X1) = xn )
        | sdtlseqdt0(xr,xn) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_10,plain,
    ! [X3,X4] :
      ( ~ aNaturalNumber0(X3)
      | ~ aNaturalNumber0(X4)
      | sdtpldt0(X3,X4) = sdtpldt0(X4,X3) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])]) ).

fof(c_0_11,negated_conjecture,
    ! [X2] :
      ( ( ~ aNaturalNumber0(X2)
        | sdtpldt0(xr,X2) != xn
        | xr = xn )
      & ( ~ sdtlseqdt0(xr,xn)
        | xr = xn ) ),
    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)],[c_0_9])])])])])]) ).

cnf(c_0_12,hypothesis,
    sdtpldt0(xp,xr) = xn,
    inference(split_conjunct,[status(thm)],[m__1883]) ).

cnf(c_0_13,plain,
    ( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

cnf(c_0_15,hypothesis,
    aNaturalNumber0(xr),
    inference(split_conjunct,[status(thm)],[m__1883]) ).

cnf(c_0_16,negated_conjecture,
    ( xr = xn
    | sdtpldt0(xr,X1) != xn
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,hypothesis,
    sdtpldt0(xr,xp) = xn,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).

fof(c_0_18,hypothesis,
    ( aNaturalNumber0(esk6_0)
    & sdtpldt0(xp,esk6_0) = xn
    & sdtlseqdt0(xp,xn) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__1870])])])]) ).

fof(c_0_19,plain,
    ! [X4,X5,X6] :
      ( ( sdtpldt0(X4,X5) != sdtpldt0(X4,X6)
        | X5 = X6
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X6) )
      & ( sdtpldt0(X5,X4) != sdtpldt0(X6,X4)
        | X5 = X6
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X6) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddCanc])])]) ).

cnf(c_0_20,negated_conjecture,
    xn = xr,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_14])]) ).

cnf(c_0_21,hypothesis,
    sdtpldt0(xp,esk6_0) = xn,
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_22,plain,
    ( X2 = X1
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | sdtpldt0(X3,X2) != sdtpldt0(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_23,hypothesis,
    sdtpldt0(xp,xr) = xr,
    inference(rw,[status(thm)],[c_0_12,c_0_20]) ).

fof(c_0_24,plain,
    ! [X2] :
      ( ( sdtpldt0(X2,sz00) = X2
        | ~ aNaturalNumber0(X2) )
      & ( X2 = sdtpldt0(sz00,X2)
        | ~ aNaturalNumber0(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])]) ).

cnf(c_0_25,hypothesis,
    sdtpldt0(xp,esk6_0) = xr,
    inference(rw,[status(thm)],[c_0_21,c_0_20]) ).

cnf(c_0_26,hypothesis,
    aNaturalNumber0(esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_27,hypothesis,
    ( xr = X1
    | sdtpldt0(xp,X1) != xr
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_14]),c_0_15])]) ).

cnf(c_0_28,plain,
    ( sdtpldt0(X1,sz00) = X1
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_29,plain,
    aNaturalNumber0(sz00),
    inference(split_conjunct,[status(thm)],[mSortsC]) ).

cnf(c_0_30,hypothesis,
    sdtpldt0(esk6_0,xp) = xr,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_25]),c_0_26]),c_0_14])]) ).

cnf(c_0_31,hypothesis,
    xr = esk6_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_26])]) ).

fof(c_0_32,hypothesis,
    ! [X3,X4] :
      ( xp != sz00
      & xp != sz10
      & ( ~ aNaturalNumber0(X4)
        | xp != sdtasdt0(X3,X4)
        | ~ aNaturalNumber0(X3)
        | X3 = sz10
        | X3 = xp )
      & ( ~ doDivides0(X3,xp)
        | ~ aNaturalNumber0(X3)
        | X3 = sz10
        | X3 = xp )
      & isPrime0(xp)
      & aNaturalNumber0(esk5_0)
      & sdtasdt0(xn,xm) = sdtasdt0(xp,esk5_0)
      & doDivides0(xp,sdtasdt0(xn,xm)) ),
    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)],[m__1860])])])])])])]) ).

cnf(c_0_33,plain,
    ( X1 = sz00
    | sdtpldt0(X2,X1) != X2
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_28]),c_0_29])]) ).

cnf(c_0_34,hypothesis,
    sdtpldt0(esk6_0,xp) = esk6_0,
    inference(rw,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,hypothesis,
    xp != sz00,
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_36,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_26]),c_0_14])]),c_0_35]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM487+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jul  6 09:08:43 EDT 2022
% 0.13/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.027 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             : 5
% 0.24/1.42  # Proof object clause conjectures      : 2
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 11
% 0.24/1.42  # Proof object initial formulas used   : 9
% 0.24/1.42  # Proof object generating inferences   : 7
% 0.24/1.42  # Proof object simplifying inferences  : 22
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 44
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 2
% 0.24/1.42  # Initial clauses                      : 211
% 0.24/1.42  # Removed in clause preprocessing      : 3
% 0.24/1.42  # Initial clauses in saturation        : 208
% 0.24/1.42  # Processed clauses                    : 315
% 0.24/1.42  # ...of these trivial                  : 2
% 0.24/1.42  # ...subsumed                          : 32
% 0.24/1.42  # ...remaining for further processing  : 281
% 0.24/1.42  # Other redundant clauses eliminated   : 36
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 1
% 0.24/1.42  # Backward-rewritten                   : 157
% 0.24/1.42  # Generated clauses                    : 5067
% 0.24/1.42  # ...of the previous two non-trivial   : 5057
% 0.24/1.42  # Contextual simplify-reflections      : 12
% 0.24/1.42  # Paramodulations                      : 4968
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 98
% 0.24/1.42  # Current number of processed clauses  : 121
% 0.24/1.42  #    Positive orientable unit clauses  : 23
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 7
% 0.24/1.42  #    Non-unit-clauses                  : 91
% 0.24/1.42  # Current number of unprocessed clauses: 630
% 0.24/1.42  # ...number of literals in the above   : 3827
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 159
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 29520
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 812
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 31
% 0.24/1.42  # Unit Clause-clause subsumption calls : 488
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 4
% 0.24/1.42  # BW rewrite match successes           : 4
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 202488
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.249 s
% 0.24/1.42  # System time              : 0.007 s
% 0.24/1.42  # Total time               : 0.256 s
% 0.24/1.42  # Maximum resident set size: 9208 pages
% 0.24/23.41  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.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49  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
%------------------------------------------------------------------------------