↑ Up

SInE---0.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : NUN070+2 : TPTP v7.3.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sine.py -e eprover -t %d %s

% Computer : n186.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32218.5MB
% OS       : Linux 3.10.0-862.11.6.el7.x86_64
% CPULimit : 300s
% DateTime : Wed Feb 27 14:27:06 EST 2019

% Result   : Theorem 0.08s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   37 (  11 unt;   0 def)
%            Number of atoms       :  137 (   5 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  178 (  78   ~;  60   |;  40   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   91 (   3 sgn  36   !;  22   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1] :
    ? [X2] :
    ! [X3] :
      ( ( ~ r2(X1,X3)
        & ~ equal(X3,X2) )
      | ( r2(X1,X3)
        & equal(X3,X2) ) ),
    file('/export/starexec/sandbox/tmp/tmp79Uj96/sel_theBenchmark.p_1',axiom_2) ).

fof(5,axiom,
    ? [X16] :
    ! [X17] :
      ( ( ~ r1(X17)
        & ~ equal(X17,X16) )
      | ( r1(X17)
        & equal(X17,X16) ) ),
    file('/export/starexec/sandbox/tmp/tmp79Uj96/sel_theBenchmark.p_1',axiom_1) ).

fof(7,axiom,
    ! [X24] :
    ? [X25] :
      ( ? [X26] :
          ( r1(X26)
          & r3(X24,X26,X25) )
      & equal(X25,X24) ),
    file('/export/starexec/sandbox/tmp/tmp79Uj96/sel_theBenchmark.p_1',axiom_4a) ).

fof(9,conjecture,
    ? [X10] :
      ( ? [X30] :
          ( ? [X20] :
              ( r1(X20)
              & r3(X30,X20,X10) )
          & ? [X21] :
              ( r1(X21)
              & r2(X21,X30) ) )
      & ? [X31] :
          ( equal(X10,X31)
          & ? [X32] :
              ( r1(X32)
              & r2(X32,X31) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp79Uj96/sel_theBenchmark.p_1',onepluszeroeqone) ).

fof(10,negated_conjecture,
    ~ ? [X10] :
        ( ? [X30] :
            ( ? [X20] :
                ( r1(X20)
                & r3(X30,X20,X10) )
            & ? [X21] :
                ( r1(X21)
                & r2(X21,X30) ) )
        & ? [X31] :
            ( equal(X10,X31)
            & ? [X32] :
                ( r1(X32)
                & r2(X32,X31) ) ) ),
    inference(assume_negation,[status(cth)],[9]) ).

fof(11,plain,
    ! [X1] :
    ? [X2] :
    ! [X3] :
      ( ( ~ r2(X1,X3)
        & ~ equal(X3,X2) )
      | ( r2(X1,X3)
        & equal(X3,X2) ) ),
    inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).

fof(14,plain,
    ? [X16] :
    ! [X17] :
      ( ( ~ r1(X17)
        & ~ equal(X17,X16) )
      | ( r1(X17)
        & equal(X17,X16) ) ),
    inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).

fof(16,plain,
    ! [X4] :
    ? [X5] :
    ! [X6] :
      ( ( ~ r2(X4,X6)
        & ~ equal(X6,X5) )
      | ( r2(X4,X6)
        & equal(X6,X5) ) ),
    inference(variable_rename,[status(thm)],[11]) ).

fof(17,plain,
    ! [X4,X6] :
      ( ( ~ r2(X4,X6)
        & ~ equal(X6,esk1_1(X4)) )
      | ( r2(X4,X6)
        & equal(X6,esk1_1(X4)) ) ),
    inference(skolemize,[status(esa)],[16]) ).

fof(18,plain,
    ! [X4,X6] :
      ( ( r2(X4,X6)
        | ~ r2(X4,X6) )
      & ( equal(X6,esk1_1(X4))
        | ~ r2(X4,X6) )
      & ( r2(X4,X6)
        | ~ equal(X6,esk1_1(X4)) )
      & ( equal(X6,esk1_1(X4))
        | ~ equal(X6,esk1_1(X4)) ) ),
    inference(distribute,[status(thm)],[17]) ).

cnf(20,plain,
    ( r2(X2,X1)
    | X1 != esk1_1(X2) ),
    inference(split_conjunct,[status(thm)],[18]) ).

fof(40,plain,
    ? [X18] :
    ! [X19] :
      ( ( ~ r1(X19)
        & ~ equal(X19,X18) )
      | ( r1(X19)
        & equal(X19,X18) ) ),
    inference(variable_rename,[status(thm)],[14]) ).

fof(41,plain,
    ! [X19] :
      ( ( ~ r1(X19)
        & ~ equal(X19,esk6_0) )
      | ( r1(X19)
        & equal(X19,esk6_0) ) ),
    inference(skolemize,[status(esa)],[40]) ).

fof(42,plain,
    ! [X19] :
      ( ( r1(X19)
        | ~ r1(X19) )
      & ( equal(X19,esk6_0)
        | ~ r1(X19) )
      & ( r1(X19)
        | ~ equal(X19,esk6_0) )
      & ( equal(X19,esk6_0)
        | ~ equal(X19,esk6_0) ) ),
    inference(distribute,[status(thm)],[41]) ).

cnf(45,plain,
    ( X1 = esk6_0
    | ~ r1(X1) ),
    inference(split_conjunct,[status(thm)],[42]) ).

fof(54,plain,
    ! [X27] :
    ? [X28] :
      ( ? [X29] :
          ( r1(X29)
          & r3(X27,X29,X28) )
      & equal(X28,X27) ),
    inference(variable_rename,[status(thm)],[7]) ).

fof(55,plain,
    ! [X27] :
      ( r1(esk12_1(X27))
      & r3(X27,esk12_1(X27),esk11_1(X27))
      & equal(esk11_1(X27),X27) ),
    inference(skolemize,[status(esa)],[54]) ).

cnf(56,plain,
    esk11_1(X1) = X1,
    inference(split_conjunct,[status(thm)],[55]) ).

cnf(57,plain,
    r3(X1,esk12_1(X1),esk11_1(X1)),
    inference(split_conjunct,[status(thm)],[55]) ).

cnf(58,plain,
    r1(esk12_1(X1)),
    inference(split_conjunct,[status(thm)],[55]) ).

fof(62,negated_conjecture,
    ! [X10] :
      ( ! [X30] :
          ( ! [X20] :
              ( ~ r1(X20)
              | ~ r3(X30,X20,X10) )
          | ! [X21] :
              ( ~ r1(X21)
              | ~ r2(X21,X30) ) )
      | ! [X31] :
          ( ~ equal(X10,X31)
          | ! [X32] :
              ( ~ r1(X32)
              | ~ r2(X32,X31) ) ) ),
    inference(fof_nnf,[status(thm)],[10]) ).

fof(63,negated_conjecture,
    ! [X33] :
      ( ! [X34] :
          ( ! [X35] :
              ( ~ r1(X35)
              | ~ r3(X34,X35,X33) )
          | ! [X36] :
              ( ~ r1(X36)
              | ~ r2(X36,X34) ) )
      | ! [X37] :
          ( ~ equal(X33,X37)
          | ! [X38] :
              ( ~ r1(X38)
              | ~ r2(X38,X37) ) ) ),
    inference(variable_rename,[status(thm)],[62]) ).

fof(64,negated_conjecture,
    ! [X33,X34,X35,X36,X37,X38] :
      ( ~ r1(X38)
      | ~ r2(X38,X37)
      | ~ equal(X33,X37)
      | ~ r1(X36)
      | ~ r2(X36,X34)
      | ~ r1(X35)
      | ~ r3(X34,X35,X33) ),
    inference(shift_quantors,[status(thm)],[63]) ).

cnf(65,negated_conjecture,
    ( ~ r3(X1,X2,X3)
    | ~ r1(X2)
    | ~ r2(X4,X1)
    | ~ r1(X4)
    | X3 != X5
    | ~ r2(X6,X5)
    | ~ r1(X6) ),
    inference(split_conjunct,[status(thm)],[64]) ).

cnf(66,plain,
    r3(X1,esk12_1(X1),X1),
    inference(rw,[status(thm)],[57,56,theory(equality)]),
    [unfolding] ).

cnf(68,plain,
    esk6_0 = esk12_1(X1),
    inference(spm,[status(thm)],[45,58,theory(equality)]) ).

cnf(70,plain,
    r2(X1,esk1_1(X1)),
    inference(er,[status(thm)],[20,theory(equality)]) ).

cnf(84,negated_conjecture,
    ( ~ r3(X1,X2,X3)
    | ~ r1(X4)
    | ~ r1(X5)
    | ~ r1(X2)
    | ~ r2(X4,X3)
    | ~ r2(X5,X1) ),
    inference(er,[status(thm)],[65,theory(equality)]) ).

cnf(91,plain,
    r3(X1,esk6_0,X1),
    inference(rw,[status(thm)],[66,68,theory(equality)]) ).

cnf(92,plain,
    r1(esk6_0),
    inference(rw,[status(thm)],[58,68,theory(equality)]) ).

cnf(244,negated_conjecture,
    ( ~ r1(X2)
    | ~ r1(X3)
    | ~ r1(esk6_0)
    | ~ r2(X2,X1)
    | ~ r2(X3,X1) ),
    inference(spm,[status(thm)],[84,91,theory(equality)]) ).

cnf(248,negated_conjecture,
    ( ~ r1(X2)
    | ~ r1(X3)
    | $false
    | ~ r2(X2,X1)
    | ~ r2(X3,X1) ),
    inference(rw,[status(thm)],[244,92,theory(equality)]) ).

cnf(249,negated_conjecture,
    ( ~ r1(X2)
    | ~ r1(X3)
    | ~ r2(X2,X1)
    | ~ r2(X3,X1) ),
    inference(cn,[status(thm)],[248,theory(equality)]) ).

cnf(265,negated_conjecture,
    ( ~ r1(X1)
    | ~ r1(X2)
    | ~ r2(X2,esk1_1(X1)) ),
    inference(spm,[status(thm)],[249,70,theory(equality)]) ).

cnf(271,negated_conjecture,
    ~ r1(X1),
    inference(spm,[status(thm)],[265,70,theory(equality)]) ).

cnf(307,plain,
    $false,
    inference(sr,[status(thm)],[92,271,theory(equality)]) ).

cnf(308,plain,
    $false,
    307,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NUN070+2 : TPTP v7.3.0. Released v7.3.0.
% 0.00/0.05  % Command  : sine.py -e eprover -t %d %s
% 0.03/0.25  % Computer : n186.star.cs.uiowa.edu
% 0.03/0.25  % Model    : x86_64 x86_64
% 0.03/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.25  % Memory   : 32218.5MB
% 0.03/0.25  % OS       : Linux 3.10.0-862.11.6.el7.x86_64
% 0.03/0.25  % CPULimit : 300
% 0.03/0.25  % DateTime : Sat Feb 23 19:59:42 CST 2019
% 0.03/0.25  % CPUTime  : 
% 0.03/0.29  % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.29  --creating new selector for [NUM008+0.ax]
% 0.08/0.38  -running prover on /export/starexec/sandbox/tmp/tmp79Uj96/sel_theBenchmark.p_1 with time limit 29
% 0.08/0.38  -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/tmp79Uj96/sel_theBenchmark.p_1']
% 0.08/0.38  -prover status Theorem
% 0.08/0.38  Problem theBenchmark.p solved in phase 0.
% 0.08/0.38  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.38  % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.38  Solved 1 out of 1.
% 0.08/0.38  # Problem is unsatisfiable (or provable), constructing proof object
% 0.08/0.38  # SZS status Theorem
% 0.08/0.38  # SZS output start CNFRefutation.
% See solution above
% 0.08/0.39  # SZS output end CNFRefutation
%------------------------------------------------------------------------------