TSTP Solution File: NUN066+2 by SInE---0.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : NUN066+2 : TPTP v7.3.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sine.py -e eprover -t %d %s

% Computer : n183.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:05 EST 2019

% Result   : Theorem 0.08s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   80 (   9 unt;   0 def)
%            Number of atoms       :  242 (  42 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  257 (  95   ~; 118   |;  44   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-1 aty)
%            Number of variables   :  143 (   9 sgn  59   !;  17   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(2,axiom,
    ! [X5,X6] :
      ( ! [X7] :
          ( ! [X8] :
              ( ~ r2(X5,X8)
              | ~ equal(X8,X7) )
          | ~ r2(X6,X7) )
      | equal(X5,X6) ),
    file('/export/starexec/sandbox/tmp/tmp3Iwy0b/sel_theBenchmark.p_1',axiom_3a) ).

fof(3,axiom,
    ! [X9] :
    ? [X10] :
    ! [X11] :
      ( ( ~ r2(X9,X11)
        & ~ equal(X11,X10) )
      | ( r2(X9,X11)
        & equal(X11,X10) ) ),
    file('/export/starexec/sandbox/tmp/tmp3Iwy0b/sel_theBenchmark.p_1',axiom_2) ).

fof(4,axiom,
    ? [X12] :
    ! [X13] :
      ( ( ~ r1(X13)
        & ~ equal(X13,X12) )
      | ( r1(X13)
        & equal(X13,X12) ) ),
    file('/export/starexec/sandbox/tmp/tmp3Iwy0b/sel_theBenchmark.p_1',axiom_1) ).

fof(5,axiom,
    ! [X14,X15] :
      ( ! [X16] :
          ( ~ r1(X16)
          | ~ equal(X16,X15) )
      | ~ r2(X14,X15) ),
    file('/export/starexec/sandbox/tmp/tmp3Iwy0b/sel_theBenchmark.p_1',axiom_7a) ).

fof(6,conjecture,
    ? [X3] :
      ( ! [X17] :
          ( ! [X18] :
              ( ! [X19] :
                  ( ~ r1(X19)
                  | ~ r2(X19,X18) )
              | ~ r2(X18,X17) )
          | ~ equal(X3,X17) )
      & ! [X20] :
          ( ~ r1(X20)
          | ~ equal(X3,X20) ) ),
    file('/export/starexec/sandbox/tmp/tmp3Iwy0b/sel_theBenchmark.p_1',nonzerononetwoexist) ).

fof(7,negated_conjecture,
    ~ ? [X3] :
        ( ! [X17] :
            ( ! [X18] :
                ( ! [X19] :
                    ( ~ r1(X19)
                    | ~ r2(X19,X18) )
                | ~ r2(X18,X17) )
            | ~ equal(X3,X17) )
        & ! [X20] :
            ( ~ r1(X20)
            | ~ equal(X3,X20) ) ),
    inference(assume_negation,[status(cth)],[6]) ).

fof(8,plain,
    ! [X5,X6] :
      ( ! [X7] :
          ( ! [X8] :
              ( ~ r2(X5,X8)
              | ~ equal(X8,X7) )
          | ~ r2(X6,X7) )
      | equal(X5,X6) ),
    inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).

fof(9,plain,
    ! [X9] :
    ? [X10] :
    ! [X11] :
      ( ( ~ r2(X9,X11)
        & ~ equal(X11,X10) )
      | ( r2(X9,X11)
        & equal(X11,X10) ) ),
    inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).

fof(10,plain,
    ? [X12] :
    ! [X13] :
      ( ( ~ r1(X13)
        & ~ equal(X13,X12) )
      | ( r1(X13)
        & equal(X13,X12) ) ),
    inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).

fof(11,plain,
    ! [X14,X15] :
      ( ! [X16] :
          ( ~ r1(X16)
          | ~ equal(X16,X15) )
      | ~ r2(X14,X15) ),
    inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).

fof(12,negated_conjecture,
    ~ ? [X3] :
        ( ! [X17] :
            ( ! [X18] :
                ( ! [X19] :
                    ( ~ r1(X19)
                    | ~ r2(X19,X18) )
                | ~ r2(X18,X17) )
            | ~ equal(X3,X17) )
        & ! [X20] :
            ( ~ r1(X20)
            | ~ equal(X3,X20) ) ),
    inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).

fof(20,plain,
    ! [X9,X10] :
      ( ! [X11] :
          ( ! [X12] :
              ( ~ r2(X9,X12)
              | ~ equal(X12,X11) )
          | ~ r2(X10,X11) )
      | equal(X9,X10) ),
    inference(variable_rename,[status(thm)],[8]) ).

fof(21,plain,
    ! [X9,X10,X11,X12] :
      ( ~ r2(X9,X12)
      | ~ equal(X12,X11)
      | ~ r2(X10,X11)
      | equal(X9,X10) ),
    inference(shift_quantors,[status(thm)],[20]) ).

cnf(22,plain,
    ( X1 = X2
    | ~ r2(X2,X3)
    | X4 != X3
    | ~ r2(X1,X4) ),
    inference(split_conjunct,[status(thm)],[21]) ).

fof(23,plain,
    ! [X12] :
    ? [X13] :
    ! [X14] :
      ( ( ~ r2(X12,X14)
        & ~ equal(X14,X13) )
      | ( r2(X12,X14)
        & equal(X14,X13) ) ),
    inference(variable_rename,[status(thm)],[9]) ).

fof(24,plain,
    ! [X12,X14] :
      ( ( ~ r2(X12,X14)
        & ~ equal(X14,esk4_1(X12)) )
      | ( r2(X12,X14)
        & equal(X14,esk4_1(X12)) ) ),
    inference(skolemize,[status(esa)],[23]) ).

fof(25,plain,
    ! [X12,X14] :
      ( ( r2(X12,X14)
        | ~ r2(X12,X14) )
      & ( equal(X14,esk4_1(X12))
        | ~ r2(X12,X14) )
      & ( r2(X12,X14)
        | ~ equal(X14,esk4_1(X12)) )
      & ( equal(X14,esk4_1(X12))
        | ~ equal(X14,esk4_1(X12)) ) ),
    inference(distribute,[status(thm)],[24]) ).

cnf(27,plain,
    ( r2(X2,X1)
    | X1 != esk4_1(X2) ),
    inference(split_conjunct,[status(thm)],[25]) ).

cnf(28,plain,
    ( X2 = esk4_1(X1)
    | ~ r2(X1,X2) ),
    inference(split_conjunct,[status(thm)],[25]) ).

fof(30,plain,
    ? [X14] :
    ! [X15] :
      ( ( ~ r1(X15)
        & ~ equal(X15,X14) )
      | ( r1(X15)
        & equal(X15,X14) ) ),
    inference(variable_rename,[status(thm)],[10]) ).

fof(31,plain,
    ! [X15] :
      ( ( ~ r1(X15)
        & ~ equal(X15,esk5_0) )
      | ( r1(X15)
        & equal(X15,esk5_0) ) ),
    inference(skolemize,[status(esa)],[30]) ).

fof(32,plain,
    ! [X15] :
      ( ( r1(X15)
        | ~ r1(X15) )
      & ( equal(X15,esk5_0)
        | ~ r1(X15) )
      & ( r1(X15)
        | ~ equal(X15,esk5_0) )
      & ( equal(X15,esk5_0)
        | ~ equal(X15,esk5_0) ) ),
    inference(distribute,[status(thm)],[31]) ).

cnf(34,plain,
    ( r1(X1)
    | X1 != esk5_0 ),
    inference(split_conjunct,[status(thm)],[32]) ).

cnf(35,plain,
    ( X1 = esk5_0
    | ~ r1(X1) ),
    inference(split_conjunct,[status(thm)],[32]) ).

fof(37,plain,
    ! [X17,X18] :
      ( ! [X19] :
          ( ~ r1(X19)
          | ~ equal(X19,X18) )
      | ~ r2(X17,X18) ),
    inference(variable_rename,[status(thm)],[11]) ).

fof(38,plain,
    ! [X17,X18,X19] :
      ( ~ r1(X19)
      | ~ equal(X19,X18)
      | ~ r2(X17,X18) ),
    inference(shift_quantors,[status(thm)],[37]) ).

cnf(39,plain,
    ( ~ r2(X1,X2)
    | X3 != X2
    | ~ r1(X3) ),
    inference(split_conjunct,[status(thm)],[38]) ).

fof(40,negated_conjecture,
    ! [X3] :
      ( ? [X17] :
          ( ? [X18] :
              ( ? [X19] :
                  ( r1(X19)
                  & r2(X19,X18) )
              & r2(X18,X17) )
          & equal(X3,X17) )
      | ? [X20] :
          ( r1(X20)
          & equal(X3,X20) ) ),
    inference(fof_nnf,[status(thm)],[12]) ).

fof(41,negated_conjecture,
    ! [X21] :
      ( ? [X22] :
          ( ? [X23] :
              ( ? [X24] :
                  ( r1(X24)
                  & r2(X24,X23) )
              & r2(X23,X22) )
          & equal(X21,X22) )
      | ? [X25] :
          ( r1(X25)
          & equal(X21,X25) ) ),
    inference(variable_rename,[status(thm)],[40]) ).

fof(42,negated_conjecture,
    ! [X21] :
      ( ( r1(esk8_1(X21))
        & r2(esk8_1(X21),esk7_1(X21))
        & r2(esk7_1(X21),esk6_1(X21))
        & equal(X21,esk6_1(X21)) )
      | ( r1(esk9_1(X21))
        & equal(X21,esk9_1(X21)) ) ),
    inference(skolemize,[status(esa)],[41]) ).

fof(43,negated_conjecture,
    ! [X21] :
      ( ( r1(esk9_1(X21))
        | r1(esk8_1(X21)) )
      & ( equal(X21,esk9_1(X21))
        | r1(esk8_1(X21)) )
      & ( r1(esk9_1(X21))
        | r2(esk8_1(X21),esk7_1(X21)) )
      & ( equal(X21,esk9_1(X21))
        | r2(esk8_1(X21),esk7_1(X21)) )
      & ( r1(esk9_1(X21))
        | r2(esk7_1(X21),esk6_1(X21)) )
      & ( equal(X21,esk9_1(X21))
        | r2(esk7_1(X21),esk6_1(X21)) )
      & ( r1(esk9_1(X21))
        | equal(X21,esk6_1(X21)) )
      & ( equal(X21,esk9_1(X21))
        | equal(X21,esk6_1(X21)) ) ),
    inference(distribute,[status(thm)],[42]) ).

cnf(44,negated_conjecture,
    ( X1 = esk6_1(X1)
    | X1 = esk9_1(X1) ),
    inference(split_conjunct,[status(thm)],[43]) ).

cnf(45,negated_conjecture,
    ( X1 = esk6_1(X1)
    | r1(esk9_1(X1)) ),
    inference(split_conjunct,[status(thm)],[43]) ).

cnf(46,negated_conjecture,
    ( r2(esk7_1(X1),esk6_1(X1))
    | X1 = esk9_1(X1) ),
    inference(split_conjunct,[status(thm)],[43]) ).

cnf(47,negated_conjecture,
    ( r2(esk7_1(X1),esk6_1(X1))
    | r1(esk9_1(X1)) ),
    inference(split_conjunct,[status(thm)],[43]) ).

cnf(48,negated_conjecture,
    ( r2(esk8_1(X1),esk7_1(X1))
    | X1 = esk9_1(X1) ),
    inference(split_conjunct,[status(thm)],[43]) ).

cnf(49,negated_conjecture,
    ( r2(esk8_1(X1),esk7_1(X1))
    | r1(esk9_1(X1)) ),
    inference(split_conjunct,[status(thm)],[43]) ).

cnf(50,negated_conjecture,
    ( r1(esk8_1(X1))
    | X1 = esk9_1(X1) ),
    inference(split_conjunct,[status(thm)],[43]) ).

cnf(51,negated_conjecture,
    ( r1(esk8_1(X1))
    | r1(esk9_1(X1)) ),
    inference(split_conjunct,[status(thm)],[43]) ).

cnf(52,plain,
    r1(esk5_0),
    inference(er,[status(thm)],[34,theory(equality)]) ).

cnf(53,negated_conjecture,
    ( esk5_0 = esk8_1(X1)
    | r1(esk9_1(X1)) ),
    inference(spm,[status(thm)],[35,51,theory(equality)]) ).

cnf(54,negated_conjecture,
    ( esk5_0 = esk8_1(X1)
    | esk9_1(X1) = X1 ),
    inference(spm,[status(thm)],[35,50,theory(equality)]) ).

cnf(55,negated_conjecture,
    ( r2(esk7_1(X1),X1)
    | r1(esk9_1(X1)) ),
    inference(spm,[status(thm)],[47,45,theory(equality)]) ).

cnf(58,plain,
    ( ~ r2(X1,X2)
    | ~ r1(X2) ),
    inference(er,[status(thm)],[39,theory(equality)]) ).

cnf(60,plain,
    r2(X1,esk4_1(X1)),
    inference(er,[status(thm)],[27,theory(equality)]) ).

cnf(64,negated_conjecture,
    ( esk9_1(X1) = X1
    | r2(esk7_1(X1),X1) ),
    inference(spm,[status(thm)],[46,44,theory(equality)]) ).

cnf(67,plain,
    ( X1 = X2
    | ~ r2(X2,X3)
    | ~ r2(X1,X3) ),
    inference(er,[status(thm)],[22,theory(equality)]) ).

cnf(71,negated_conjecture,
    ( r1(esk9_1(X1))
    | ~ r1(esk7_1(X1)) ),
    inference(spm,[status(thm)],[58,49,theory(equality)]) ).

cnf(73,negated_conjecture,
    ( esk9_1(X1) = X1
    | ~ r1(esk7_1(X1)) ),
    inference(spm,[status(thm)],[58,48,theory(equality)]) ).

cnf(81,negated_conjecture,
    ( r2(esk5_0,esk7_1(X1))
    | r1(esk9_1(X1)) ),
    inference(spm,[status(thm)],[49,53,theory(equality)]) ).

cnf(85,plain,
    ~ r1(esk4_1(X1)),
    inference(spm,[status(thm)],[58,60,theory(equality)]) ).

cnf(89,negated_conjecture,
    ( esk9_1(X1) = X1
    | r2(esk5_0,esk7_1(X1)) ),
    inference(spm,[status(thm)],[48,54,theory(equality)]) ).

cnf(109,negated_conjecture,
    ( esk4_1(esk5_0) = esk7_1(X1)
    | r1(esk9_1(X1)) ),
    inference(spm,[status(thm)],[28,81,theory(equality)]) ).

cnf(138,negated_conjecture,
    ( esk4_1(esk5_0) = esk7_1(X1)
    | esk9_1(X1) = X1 ),
    inference(spm,[status(thm)],[28,89,theory(equality)]) ).

cnf(175,negated_conjecture,
    ( r2(esk5_0,X1)
    | esk9_1(X2) = X2
    | esk7_1(X2) != X1 ),
    inference(spm,[status(thm)],[27,138,theory(equality)]) ).

cnf(196,plain,
    ( X1 = X2
    | ~ r2(X1,esk4_1(X2)) ),
    inference(spm,[status(thm)],[67,60,theory(equality)]) ).

cnf(204,negated_conjecture,
    ( X1 = esk5_0
    | r1(esk9_1(X2))
    | ~ r2(X1,esk7_1(X2)) ),
    inference(spm,[status(thm)],[67,81,theory(equality)]) ).

cnf(208,negated_conjecture,
    ( esk7_1(esk4_1(X1)) = X1
    | r1(esk9_1(esk4_1(X1))) ),
    inference(spm,[status(thm)],[196,55,theory(equality)]) ).

cnf(235,negated_conjecture,
    ( esk7_1(esk7_1(X1)) = esk5_0
    | r1(esk9_1(X1))
    | esk9_1(esk7_1(X1)) = esk7_1(X1) ),
    inference(spm,[status(thm)],[204,64,theory(equality)]) ).

cnf(256,negated_conjecture,
    ( r1(esk9_1(esk4_1(X1)))
    | ~ r1(X1) ),
    inference(spm,[status(thm)],[71,208,theory(equality)]) ).

cnf(286,negated_conjecture,
    ( r1(esk9_1(esk7_1(X1)))
    | r1(esk9_1(X1))
    | ~ r1(esk5_0) ),
    inference(spm,[status(thm)],[256,109,theory(equality)]) ).

cnf(292,negated_conjecture,
    ( r1(esk9_1(esk7_1(X1)))
    | r1(esk9_1(X1))
    | $false ),
    inference(rw,[status(thm)],[286,52,theory(equality)]) ).

cnf(293,negated_conjecture,
    ( r1(esk9_1(esk7_1(X1)))
    | r1(esk9_1(X1)) ),
    inference(cn,[status(thm)],[292,theory(equality)]) ).

cnf(1778,negated_conjecture,
    ( esk9_1(esk7_1(X1)) = esk7_1(X1)
    | r1(esk9_1(X1))
    | ~ r1(esk5_0) ),
    inference(spm,[status(thm)],[73,235,theory(equality)]) ).

cnf(1819,negated_conjecture,
    ( esk9_1(esk7_1(X1)) = esk7_1(X1)
    | r1(esk9_1(X1))
    | $false ),
    inference(rw,[status(thm)],[1778,52,theory(equality)]) ).

cnf(1820,negated_conjecture,
    ( esk9_1(esk7_1(X1)) = esk7_1(X1)
    | r1(esk9_1(X1)) ),
    inference(cn,[status(thm)],[1819,theory(equality)]) ).

cnf(1844,negated_conjecture,
    ( r1(esk7_1(X1))
    | r1(esk9_1(X1)) ),
    inference(spm,[status(thm)],[293,1820,theory(equality)]) ).

cnf(1866,negated_conjecture,
    r1(esk9_1(X1)),
    inference(csr,[status(thm)],[1844,71]) ).

cnf(1869,negated_conjecture,
    esk5_0 = esk9_1(X1),
    inference(spm,[status(thm)],[35,1866,theory(equality)]) ).

cnf(1978,negated_conjecture,
    ( esk5_0 = X1
    | r2(esk5_0,X2)
    | esk7_1(X1) != X2 ),
    inference(rw,[status(thm)],[175,1869,theory(equality)]) ).

cnf(2014,negated_conjecture,
    ( esk5_0 = X1
    | r2(esk7_1(X1),X1) ),
    inference(rw,[status(thm)],[64,1869,theory(equality)]) ).

cnf(2039,negated_conjecture,
    ( esk7_1(esk4_1(X1)) = X1
    | esk5_0 = esk4_1(X1) ),
    inference(spm,[status(thm)],[196,2014,theory(equality)]) ).

cnf(2098,negated_conjecture,
    ( esk5_0 = esk4_1(X1)
    | r2(esk5_0,X2)
    | X1 != X2 ),
    inference(spm,[status(thm)],[1978,2039,theory(equality)]) ).

cnf(2109,negated_conjecture,
    ( esk4_1(X1) = esk5_0
    | r2(esk5_0,X1) ),
    inference(er,[status(thm)],[2098,theory(equality)]) ).

cnf(2113,negated_conjecture,
    ( r2(esk5_0,X1)
    | ~ r1(esk5_0) ),
    inference(spm,[status(thm)],[85,2109,theory(equality)]) ).

cnf(2124,negated_conjecture,
    ( r2(esk5_0,X1)
    | $false ),
    inference(rw,[status(thm)],[2113,52,theory(equality)]) ).

cnf(2125,negated_conjecture,
    r2(esk5_0,X1),
    inference(cn,[status(thm)],[2124,theory(equality)]) ).

cnf(2127,negated_conjecture,
    ~ r1(X1),
    inference(spm,[status(thm)],[58,2125,theory(equality)]) ).

cnf(2144,plain,
    $false,
    inference(sr,[status(thm)],[52,2127,theory(equality)]) ).

cnf(2145,plain,
    $false,
    2144,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NUN066+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 : n183.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:32:12 CST 2019
% 0.03/0.25  % CPUTime  : 
% 0.08/0.30  % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.30  --creating new selector for [NUM008+0.ax]
% 0.08/0.41  -running prover on /export/starexec/sandbox/tmp/tmp3Iwy0b/sel_theBenchmark.p_1 with time limit 29
% 0.08/0.41  -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/tmp3Iwy0b/sel_theBenchmark.p_1']
% 0.08/0.41  -prover status Theorem
% 0.08/0.41  Problem theBenchmark.p solved in phase 0.
% 0.08/0.41  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.41  % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.41  Solved 1 out of 1.
% 0.08/0.41  # Problem is unsatisfiable (or provable), constructing proof object
% 0.08/0.41  # SZS status Theorem
% 0.08/0.41  # SZS output start CNFRefutation.
% See solution above
% 0.08/0.41  # SZS output end CNFRefutation
%------------------------------------------------------------------------------