TSTP Solution File: NUN062+2 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : NUN062+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n013.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  : 300s
% DateTime : Wed Aug 31 18:07:37 EDT 2022

% Result   : Theorem 0.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   38 (   7 unt;   0 def)
%            Number of atoms       :  147 (  41 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  145 (  36   ~;  26   |;  73   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   1 con; 0-2 aty)
%            Number of variables   :  143 (  82   !;  61   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f128,plain,
    $false,
    inference(resolution,[],[f124,f121]) ).

fof(f121,plain,
    ! [X3,X4] : ~ r1(sK19(X3,X4)),
    inference(resolution,[],[f107,f96]) ).

fof(f96,plain,
    ! [X0,X1] : r2(X0,sK19(X0,X1)),
    inference(cnf_transformation,[],[f58]) ).

fof(f58,plain,
    ! [X0,X1] :
      ( r4(X1,sK19(X0,X1),sK18(X0,X1))
      & r2(X0,sK19(X0,X1))
      & sK17(X0,X1) = sK18(X0,X1)
      & r4(X1,X0,sK20(X0,X1))
      & r3(sK20(X0,X1),X1,sK17(X0,X1)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK17,sK18,sK19,sK20])],[f53,f57,f56,f55,f54]) ).

fof(f54,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ? [X3] :
              ( ? [X4] :
                  ( r4(X1,X4,X3)
                  & r2(X0,X4) )
              & X2 = X3 )
          & ? [X5] :
              ( r4(X1,X0,X5)
              & r3(X5,X1,X2) ) )
     => ( ? [X3] :
            ( ? [X4] :
                ( r4(X1,X4,X3)
                & r2(X0,X4) )
            & sK17(X0,X1) = X3 )
        & ? [X5] :
            ( r4(X1,X0,X5)
            & r3(X5,X1,sK17(X0,X1)) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f55,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( ? [X4] :
              ( r4(X1,X4,X3)
              & r2(X0,X4) )
          & sK17(X0,X1) = X3 )
     => ( ? [X4] :
            ( r4(X1,X4,sK18(X0,X1))
            & r2(X0,X4) )
        & sK17(X0,X1) = sK18(X0,X1) ) ),
    introduced(choice_axiom,[]) ).

fof(f56,plain,
    ! [X0,X1] :
      ( ? [X4] :
          ( r4(X1,X4,sK18(X0,X1))
          & r2(X0,X4) )
     => ( r4(X1,sK19(X0,X1),sK18(X0,X1))
        & r2(X0,sK19(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f57,plain,
    ! [X0,X1] :
      ( ? [X5] :
          ( r4(X1,X0,X5)
          & r3(X5,X1,sK17(X0,X1)) )
     => ( r4(X1,X0,sK20(X0,X1))
        & r3(sK20(X0,X1),X1,sK17(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f53,plain,
    ! [X0,X1] :
    ? [X2] :
      ( ? [X3] :
          ( ? [X4] :
              ( r4(X1,X4,X3)
              & r2(X0,X4) )
          & X2 = X3 )
      & ? [X5] :
          ( r4(X1,X0,X5)
          & r3(X5,X1,X2) ) ),
    inference(rectify,[],[f19]) ).

fof(f19,plain,
    ! [X1,X0] :
    ? [X2] :
      ( ? [X4] :
          ( ? [X5] :
              ( r4(X0,X5,X4)
              & r2(X1,X5) )
          & X2 = X4 )
      & ? [X3] :
          ( r4(X0,X1,X3)
          & r3(X3,X0,X2) ) ),
    inference(rectify,[],[f6]) ).

fof(f6,axiom,
    ! [X19,X20] :
    ? [X21] :
      ( ? [X24] :
          ( r4(X19,X20,X24)
          & r3(X24,X19,X21) )
      & ? [X22] :
          ( ? [X23] :
              ( r2(X20,X23)
              & r4(X19,X23,X22) )
          & X21 = X22 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2a) ).

fof(f107,plain,
    ! [X2,X1] :
      ( ~ r2(X1,X2)
      | ~ r1(X2) ),
    inference(equality_resolution,[],[f65]) ).

fof(f65,plain,
    ! [X2,X0,X1] :
      ( ~ r2(X1,X0)
      | ~ r1(X2)
      | X0 != X2 ),
    inference(cnf_transformation,[],[f24]) ).

fof(f24,plain,
    ! [X0,X1] :
      ( ~ r2(X1,X0)
      | ! [X2] :
          ( ~ r1(X2)
          | X0 != X2 ) ),
    inference(rectify,[],[f11]) ).

fof(f11,axiom,
    ! [X41,X40] :
      ( ! [X42] :
          ( X41 != X42
          | ~ r1(X42) )
      | ~ r2(X40,X41) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7a) ).

fof(f124,plain,
    ! [X1] : r1(X1),
    inference(backward_demodulation,[],[f123,f122]) ).

fof(f122,plain,
    ! [X0] : sK2(X0) = X0,
    inference(resolution,[],[f84,f108]) ).

fof(f108,plain,
    ! [X2,X3] :
      ( ~ r3(sK1,X2,X3)
      | sK2(X2) = X2 ),
    inference(equality_resolution,[],[f67]) ).

fof(f67,plain,
    ! [X2,X3,X1] :
      ( X1 != X3
      | ~ r3(sK1,X2,X3)
      | sK2(X2) = X2 ),
    inference(cnf_transformation,[],[f32]) ).

fof(f32,plain,
    ! [X1,X2] :
      ( ! [X3] :
          ( X1 != X3
          | ~ r3(sK1,X2,X3) )
      | ( sK2(X2) = X2
        & r1(sK2(X2)) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f29,f31,f30]) ).

fof(f30,plain,
    ( ? [X0] :
      ! [X1,X2] :
        ( ! [X3] :
            ( X1 != X3
            | ~ r3(X0,X2,X3) )
        | ? [X4] :
            ( X2 = X4
            & r1(X4) ) )
   => ! [X2,X1] :
        ( ! [X3] :
            ( X1 != X3
            | ~ r3(sK1,X2,X3) )
        | ? [X4] :
            ( X2 = X4
            & r1(X4) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f31,plain,
    ! [X2] :
      ( ? [X4] :
          ( X2 = X4
          & r1(X4) )
     => ( sK2(X2) = X2
        & r1(sK2(X2)) ) ),
    introduced(choice_axiom,[]) ).

fof(f29,plain,
    ? [X0] :
    ! [X1,X2] :
      ( ! [X3] :
          ( X1 != X3
          | ~ r3(X0,X2,X3) )
      | ? [X4] :
          ( X2 = X4
          & r1(X4) ) ),
    inference(rectify,[],[f25]) ).

fof(f25,plain,
    ? [X0] :
    ! [X1,X2] :
      ( ! [X4] :
          ( X1 != X4
          | ~ r3(X0,X2,X4) )
      | ? [X3] :
          ( X2 = X3
          & r1(X3) ) ),
    inference(ennf_transformation,[],[f14]) ).

fof(f14,plain,
    ~ ! [X0] :
      ? [X2,X1] :
        ( ! [X3] :
            ( ~ r1(X3)
            | X2 != X3 )
        & ? [X4] :
            ( r3(X0,X2,X4)
            & X1 = X4 ) ),
    inference(rectify,[],[f13]) ).

fof(f13,negated_conjecture,
    ~ ! [X13] :
      ? [X21,X38] :
        ( ! [X15] :
            ( ~ r1(X15)
            | X15 != X38 )
        & ? [X22] :
            ( r3(X13,X38,X22)
            & X21 = X22 ) ),
    inference(negated_conjecture,[],[f12]) ).

fof(f12,conjecture,
    ! [X13] :
    ? [X21,X38] :
      ( ! [X15] :
          ( ~ r1(X15)
          | X15 != X38 )
      & ? [X22] :
          ( r3(X13,X38,X22)
          & X21 = X22 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infiniteNumbers) ).

fof(f84,plain,
    ! [X0,X1] : r3(X1,X0,sK11(X0,X1)),
    inference(cnf_transformation,[],[f46]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( r3(X1,X0,sK11(X0,X1))
      & r2(sK11(X0,X1),sK10(X0,X1))
      & r3(X1,sK13(X0,X1),sK12(X0,X1))
      & r2(X0,sK13(X0,X1))
      & sK12(X0,X1) = sK10(X0,X1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13])],[f15,f45,f44,f43,f42]) ).

fof(f42,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ? [X3] :
              ( r3(X1,X0,X3)
              & r2(X3,X2) )
          & ? [X4] :
              ( ? [X5] :
                  ( r3(X1,X5,X4)
                  & r2(X0,X5) )
              & X2 = X4 ) )
     => ( ? [X3] :
            ( r3(X1,X0,X3)
            & r2(X3,sK10(X0,X1)) )
        & ? [X4] :
            ( ? [X5] :
                ( r3(X1,X5,X4)
                & r2(X0,X5) )
            & sK10(X0,X1) = X4 ) ) ),
    introduced(choice_axiom,[]) ).

fof(f43,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( r3(X1,X0,X3)
          & r2(X3,sK10(X0,X1)) )
     => ( r3(X1,X0,sK11(X0,X1))
        & r2(sK11(X0,X1),sK10(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f44,plain,
    ! [X0,X1] :
      ( ? [X4] :
          ( ? [X5] :
              ( r3(X1,X5,X4)
              & r2(X0,X5) )
          & sK10(X0,X1) = X4 )
     => ( ? [X5] :
            ( r3(X1,X5,sK12(X0,X1))
            & r2(X0,X5) )
        & sK12(X0,X1) = sK10(X0,X1) ) ),
    introduced(choice_axiom,[]) ).

fof(f45,plain,
    ! [X0,X1] :
      ( ? [X5] :
          ( r3(X1,X5,sK12(X0,X1))
          & r2(X0,X5) )
     => ( r3(X1,sK13(X0,X1),sK12(X0,X1))
        & r2(X0,sK13(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f15,plain,
    ! [X0,X1] :
    ? [X2] :
      ( ? [X3] :
          ( r3(X1,X0,X3)
          & r2(X3,X2) )
      & ? [X4] :
          ( ? [X5] :
              ( r3(X1,X5,X4)
              & r2(X0,X5) )
          & X2 = X4 ) ),
    inference(rectify,[],[f5]) ).

fof(f5,axiom,
    ! [X14,X13] :
    ? [X15] :
      ( ? [X18] :
          ( r3(X13,X14,X18)
          & r2(X18,X15) )
      & ? [X16] :
          ( ? [X17] :
              ( r2(X14,X17)
              & r3(X13,X17,X16) )
          & X15 = X16 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1a) ).

fof(f123,plain,
    ! [X1] : r1(sK2(X1)),
    inference(resolution,[],[f84,f109]) ).

fof(f109,plain,
    ! [X2,X3] :
      ( ~ r3(sK1,X2,X3)
      | r1(sK2(X2)) ),
    inference(equality_resolution,[],[f66]) ).

fof(f66,plain,
    ! [X2,X3,X1] :
      ( X1 != X3
      | ~ r3(sK1,X2,X3)
      | r1(sK2(X2)) ),
    inference(cnf_transformation,[],[f32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : NUN062+2 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34  % Computer : n013.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    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 09:39:47 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.49  % (10907)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.19/0.49  % (10899)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.49  % (10907)First to succeed.
% 0.19/0.49  % (10899)Instruction limit reached!
% 0.19/0.49  % (10899)------------------------------
% 0.19/0.49  % (10899)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49  % (10899)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49  % (10899)Termination reason: Unknown
% 0.19/0.49  % (10899)Termination phase: Saturation
% 0.19/0.49  
% 0.19/0.49  % (10899)Memory used [KB]: 6012
% 0.19/0.49  % (10899)Time elapsed: 0.005 s
% 0.19/0.49  % (10899)Instructions burned: 3 (million)
% 0.19/0.49  % (10899)------------------------------
% 0.19/0.49  % (10899)------------------------------
% 0.19/0.49  % (10891)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.50  % (10907)Refutation found. Thanks to Tanya!
% 0.19/0.50  % SZS status Theorem for theBenchmark
% 0.19/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50  % (10907)------------------------------
% 0.19/0.50  % (10907)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (10907)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (10907)Termination reason: Refutation
% 0.19/0.50  
% 0.19/0.50  % (10907)Memory used [KB]: 6012
% 0.19/0.50  % (10907)Time elapsed: 0.048 s
% 0.19/0.50  % (10907)Instructions burned: 3 (million)
% 0.19/0.50  % (10907)------------------------------
% 0.19/0.50  % (10907)------------------------------
% 0.19/0.50  % (10884)Success in time 0.147 s
%------------------------------------------------------------------------------