↑ Up

SInE---0.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : NUM492+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : n061.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32218.625MB
% OS       : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan  8 15:21:32 EST 2018

% Result   : Theorem 0.38s
% Output   : CNFRefutation 0.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   53 (  19 unt;   0 def)
%            Number of atoms       :  179 (   3 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  225 (  99   ~; 102   |;  18   &)
%                                         (   1 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   41 (   0 sgn  30   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(2,axiom,
    ( isPrime0(xp)
    & doDivides0(xp,sdtasdt0(xn,xm)) ),
    file('/export/starexec/sandbox/tmp/tmprJun9A/sel_theBenchmark.p_1',m__1860) ).

fof(3,axiom,
    equal(xr,sdtmndt0(xn,xp)),
    file('/export/starexec/sandbox/tmp/tmprJun9A/sel_theBenchmark.p_1',m__1883) ).

fof(11,axiom,
    equal(sdtasdt0(xn,xm),sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm))),
    file('/export/starexec/sandbox/tmp/tmprJun9A/sel_theBenchmark.p_1',m__1951) ).

fof(14,axiom,
    ( doDivides0(xp,sdtasdt0(xn,xm))
    & doDivides0(xp,sdtasdt0(xp,xm)) ),
    file('/export/starexec/sandbox/tmp/tmprJun9A/sel_theBenchmark.p_1',m__2001) ).

fof(16,axiom,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X3) )
     => ( ( doDivides0(X1,X2)
          & doDivides0(X1,sdtpldt0(X2,X3)) )
       => doDivides0(X1,X3) ) ),
    file('/export/starexec/sandbox/tmp/tmprJun9A/sel_theBenchmark.p_1',mDivMin) ).

fof(17,axiom,
    sdtlseqdt0(xp,xn),
    file('/export/starexec/sandbox/tmp/tmprJun9A/sel_theBenchmark.p_1',m__1870) ).

fof(19,axiom,
    ( aNaturalNumber0(xn)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xp) ),
    file('/export/starexec/sandbox/tmp/tmprJun9A/sel_theBenchmark.p_1',m__1837) ).

fof(33,conjecture,
    doDivides0(xp,sdtasdt0(xr,xm)),
    file('/export/starexec/sandbox/tmp/tmprJun9A/sel_theBenchmark.p_1',m__) ).

fof(38,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( sdtlseqdt0(X1,X2)
       => ! [X3] :
            ( equal(X3,sdtmndt0(X2,X1))
          <=> ( aNaturalNumber0(X3)
              & equal(sdtpldt0(X1,X3),X2) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmprJun9A/sel_theBenchmark.p_1',mDefDiff) ).

fof(39,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => aNaturalNumber0(sdtasdt0(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/tmprJun9A/sel_theBenchmark.p_1',mSortsB_02) ).

fof(50,negated_conjecture,
    ~ doDivides0(xp,sdtasdt0(xr,xm)),
    inference(assume_negation,[status(cth)],[33]) ).

fof(51,negated_conjecture,
    ~ doDivides0(xp,sdtasdt0(xr,xm)),
    inference(fof_simplification,[status(thm)],[50,theory(equality)]) ).

cnf(57,plain,
    doDivides0(xp,sdtasdt0(xn,xm)),
    inference(split_conjunct,[status(thm)],[2]) ).

cnf(59,plain,
    xr = sdtmndt0(xn,xp),
    inference(split_conjunct,[status(thm)],[3]) ).

cnf(91,plain,
    sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
    inference(split_conjunct,[status(thm)],[11]) ).

cnf(100,plain,
    doDivides0(xp,sdtasdt0(xp,xm)),
    inference(split_conjunct,[status(thm)],[14]) ).

fof(105,plain,
    ! [X1,X2,X3] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X2)
      | ~ aNaturalNumber0(X3)
      | ~ doDivides0(X1,X2)
      | ~ doDivides0(X1,sdtpldt0(X2,X3))
      | doDivides0(X1,X3) ),
    inference(fof_nnf,[status(thm)],[16]) ).

fof(106,plain,
    ! [X4,X5,X6] :
      ( ~ aNaturalNumber0(X4)
      | ~ aNaturalNumber0(X5)
      | ~ aNaturalNumber0(X6)
      | ~ doDivides0(X4,X5)
      | ~ doDivides0(X4,sdtpldt0(X5,X6))
      | doDivides0(X4,X6) ),
    inference(variable_rename,[status(thm)],[105]) ).

cnf(107,plain,
    ( doDivides0(X1,X2)
    | ~ doDivides0(X1,sdtpldt0(X3,X2))
    | ~ doDivides0(X1,X3)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[106]) ).

cnf(108,plain,
    sdtlseqdt0(xp,xn),
    inference(split_conjunct,[status(thm)],[17]) ).

cnf(112,plain,
    aNaturalNumber0(xp),
    inference(split_conjunct,[status(thm)],[19]) ).

cnf(113,plain,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[19]) ).

cnf(114,plain,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[19]) ).

cnf(170,negated_conjecture,
    ~ doDivides0(xp,sdtasdt0(xr,xm)),
    inference(split_conjunct,[status(thm)],[51]) ).

fof(183,plain,
    ! [X1,X2] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X2)
      | ~ sdtlseqdt0(X1,X2)
      | ! [X3] :
          ( ( ~ equal(X3,sdtmndt0(X2,X1))
            | ( aNaturalNumber0(X3)
              & equal(sdtpldt0(X1,X3),X2) ) )
          & ( ~ aNaturalNumber0(X3)
            | ~ equal(sdtpldt0(X1,X3),X2)
            | equal(X3,sdtmndt0(X2,X1)) ) ) ),
    inference(fof_nnf,[status(thm)],[38]) ).

fof(184,plain,
    ! [X4,X5] :
      ( ~ aNaturalNumber0(X4)
      | ~ aNaturalNumber0(X5)
      | ~ sdtlseqdt0(X4,X5)
      | ! [X6] :
          ( ( ~ equal(X6,sdtmndt0(X5,X4))
            | ( aNaturalNumber0(X6)
              & equal(sdtpldt0(X4,X6),X5) ) )
          & ( ~ aNaturalNumber0(X6)
            | ~ equal(sdtpldt0(X4,X6),X5)
            | equal(X6,sdtmndt0(X5,X4)) ) ) ),
    inference(variable_rename,[status(thm)],[183]) ).

fof(185,plain,
    ! [X4,X5,X6] :
      ( ( ( ~ equal(X6,sdtmndt0(X5,X4))
          | ( aNaturalNumber0(X6)
            & equal(sdtpldt0(X4,X6),X5) ) )
        & ( ~ aNaturalNumber0(X6)
          | ~ equal(sdtpldt0(X4,X6),X5)
          | equal(X6,sdtmndt0(X5,X4)) ) )
      | ~ sdtlseqdt0(X4,X5)
      | ~ aNaturalNumber0(X4)
      | ~ aNaturalNumber0(X5) ),
    inference(shift_quantors,[status(thm)],[184]) ).

fof(186,plain,
    ! [X4,X5,X6] :
      ( ( aNaturalNumber0(X6)
        | ~ equal(X6,sdtmndt0(X5,X4))
        | ~ sdtlseqdt0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( equal(sdtpldt0(X4,X6),X5)
        | ~ equal(X6,sdtmndt0(X5,X4))
        | ~ sdtlseqdt0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( ~ aNaturalNumber0(X6)
        | ~ equal(sdtpldt0(X4,X6),X5)
        | equal(X6,sdtmndt0(X5,X4))
        | ~ sdtlseqdt0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) ) ),
    inference(distribute,[status(thm)],[185]) ).

cnf(189,plain,
    ( aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ sdtlseqdt0(X2,X1)
    | X3 != sdtmndt0(X1,X2) ),
    inference(split_conjunct,[status(thm)],[186]) ).

fof(190,plain,
    ! [X1,X2] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X2)
      | aNaturalNumber0(sdtasdt0(X1,X2)) ),
    inference(fof_nnf,[status(thm)],[39]) ).

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

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

cnf(480,plain,
    ( aNaturalNumber0(sdtmndt0(X1,X2))
    | ~ sdtlseqdt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(er,[status(thm)],[189,theory(equality)]) ).

cnf(659,plain,
    ( doDivides0(X1,sdtasdt0(xr,xm))
    | ~ doDivides0(X1,sdtasdt0(xn,xm))
    | ~ doDivides0(X1,sdtasdt0(xp,xm))
    | ~ aNaturalNumber0(sdtasdt0(xp,xm))
    | ~ aNaturalNumber0(sdtasdt0(xr,xm))
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[107,91,theory(equality)]) ).

cnf(4964,plain,
    ( aNaturalNumber0(xr)
    | ~ sdtlseqdt0(xp,xn)
    | ~ aNaturalNumber0(xp)
    | ~ aNaturalNumber0(xn) ),
    inference(spm,[status(thm)],[480,59,theory(equality)]) ).

cnf(4979,plain,
    ( aNaturalNumber0(xr)
    | $false
    | ~ aNaturalNumber0(xp)
    | ~ aNaturalNumber0(xn) ),
    inference(rw,[status(thm)],[4964,108,theory(equality)]) ).

cnf(4980,plain,
    ( aNaturalNumber0(xr)
    | $false
    | $false
    | ~ aNaturalNumber0(xn) ),
    inference(rw,[status(thm)],[4979,112,theory(equality)]) ).

cnf(4981,plain,
    ( aNaturalNumber0(xr)
    | $false
    | $false
    | $false ),
    inference(rw,[status(thm)],[4980,114,theory(equality)]) ).

cnf(4982,plain,
    aNaturalNumber0(xr),
    inference(cn,[status(thm)],[4981,theory(equality)]) ).

cnf(16454,plain,
    ( ~ doDivides0(xp,sdtasdt0(xn,xm))
    | ~ doDivides0(xp,sdtasdt0(xp,xm))
    | ~ aNaturalNumber0(sdtasdt0(xp,xm))
    | ~ aNaturalNumber0(sdtasdt0(xr,xm))
    | ~ aNaturalNumber0(xp) ),
    inference(spm,[status(thm)],[170,659,theory(equality)]) ).

cnf(16465,plain,
    ( $false
    | ~ doDivides0(xp,sdtasdt0(xp,xm))
    | ~ aNaturalNumber0(sdtasdt0(xp,xm))
    | ~ aNaturalNumber0(sdtasdt0(xr,xm))
    | ~ aNaturalNumber0(xp) ),
    inference(rw,[status(thm)],[16454,57,theory(equality)]) ).

cnf(16466,plain,
    ( $false
    | $false
    | ~ aNaturalNumber0(sdtasdt0(xp,xm))
    | ~ aNaturalNumber0(sdtasdt0(xr,xm))
    | ~ aNaturalNumber0(xp) ),
    inference(rw,[status(thm)],[16465,100,theory(equality)]) ).

cnf(16467,plain,
    ( $false
    | $false
    | ~ aNaturalNumber0(sdtasdt0(xp,xm))
    | ~ aNaturalNumber0(sdtasdt0(xr,xm))
    | $false ),
    inference(rw,[status(thm)],[16466,112,theory(equality)]) ).

cnf(16468,plain,
    ( ~ aNaturalNumber0(sdtasdt0(xp,xm))
    | ~ aNaturalNumber0(sdtasdt0(xr,xm)) ),
    inference(cn,[status(thm)],[16467,theory(equality)]) ).

cnf(16479,plain,
    ( ~ aNaturalNumber0(sdtasdt0(xp,xm))
    | ~ aNaturalNumber0(xm)
    | ~ aNaturalNumber0(xr) ),
    inference(spm,[status(thm)],[16468,192,theory(equality)]) ).

cnf(16484,plain,
    ( ~ aNaturalNumber0(sdtasdt0(xp,xm))
    | $false
    | ~ aNaturalNumber0(xr) ),
    inference(rw,[status(thm)],[16479,113,theory(equality)]) ).

cnf(16485,plain,
    ( ~ aNaturalNumber0(sdtasdt0(xp,xm))
    | $false
    | $false ),
    inference(rw,[status(thm)],[16484,4982,theory(equality)]) ).

cnf(16486,plain,
    ~ aNaturalNumber0(sdtasdt0(xp,xm)),
    inference(cn,[status(thm)],[16485,theory(equality)]) ).

cnf(16493,plain,
    ( ~ aNaturalNumber0(xm)
    | ~ aNaturalNumber0(xp) ),
    inference(spm,[status(thm)],[16486,192,theory(equality)]) ).

cnf(16495,plain,
    ( $false
    | ~ aNaturalNumber0(xp) ),
    inference(rw,[status(thm)],[16493,113,theory(equality)]) ).

cnf(16496,plain,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[16495,112,theory(equality)]) ).

cnf(16497,plain,
    $false,
    inference(cn,[status(thm)],[16496,theory(equality)]) ).

cnf(16498,plain,
    $false,
    16497,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM492+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04  % Command  : Source/sine.py -e eprover -t %d %s
% 0.02/0.23  % Computer : n061.star.cs.uiowa.edu
% 0.02/0.23  % Model    : x86_64 x86_64
% 0.02/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23  % Memory   : 32218.625MB
% 0.02/0.23  % OS       : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23  % CPULimit : 300
% 0.02/0.23  % DateTime : Fri Jan  5 06:46:45 CST 2018
% 0.02/0.23  % CPUTime  : 
% 0.06/0.27  % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.27  --creating new selector for []
% 0.38/0.61  -running prover on /export/starexec/sandbox/tmp/tmprJun9A/sel_theBenchmark.p_1 with time limit 29
% 0.38/0.61  -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmprJun9A/sel_theBenchmark.p_1']
% 0.38/0.61  -prover status Theorem
% 0.38/0.61  Problem theBenchmark.p solved in phase 0.
% 0.38/0.61  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.61  % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.61  Solved 1 out of 1.
% 0.38/0.61  # Problem is unsatisfiable (or provable), constructing proof object
% 0.38/0.61  # SZS status Theorem
% 0.38/0.61  # SZS output start CNFRefutation.
% See solution above
% 0.43/0.61  # SZS output end CNFRefutation
%------------------------------------------------------------------------------