TSTP Solution File: KRS077+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : KRS077+1 : TPTP v8.1.0. Released v3.1.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 : n029.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 17:29:37 EDT 2022

% Result   : Unsatisfiable 0.21s 0.58s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   45 (   5 unt;   0 def)
%            Number of atoms       :  224 (  18 equ)
%            Maximal formula atoms :   20 (   4 avg)
%            Number of connectives :  277 (  98   ~;  86   |;  75   &)
%                                         (   8 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-1 aty)
%            Number of variables   :  125 (  95   !;  30   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f203,plain,
    $false,
    inference(resolution,[],[f202,f111]) ).

fof(f111,plain,
    cUnsatisfiable(i2003_11_14_17_19_09372),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,axiom,
    cUnsatisfiable(i2003_11_14_17_19_09372),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

fof(f202,plain,
    ! [X0] : ~ cUnsatisfiable(X0),
    inference(resolution,[],[f201,f106]) ).

fof(f106,plain,
    ! [X0] :
      ( sP0(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f75]) ).

fof(f75,plain,
    ! [X0] :
      ( ( sP0(X0)
        | ~ cUnsatisfiable(X0) )
      & ( cUnsatisfiable(X0)
        | ~ sP0(X0) ) ),
    inference(nnf_transformation,[],[f58]) ).

fof(f58,plain,
    ! [X0] :
      ( sP0(X0)
    <=> cUnsatisfiable(X0) ),
    inference(definition_folding,[],[f31,f57]) ).

fof(f57,plain,
    ! [X0] :
      ( sP0(X0)
    <=> ( ? [X3] :
            ( cp(X3)
            & rs(X0,X3) )
        & ~ cp(X0)
        & ! [X5,X4] :
            ( X4 = X5
            | ~ rr(X0,X4)
            | ~ rr(X0,X5) )
        & ? [X1] :
            ( ! [X2] :
                ( ~ rinvS(X1,X2)
                | cp(X2) )
            & rr(X0,X1) ) ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f31,plain,
    ! [X0] :
      ( ( ? [X3] :
            ( cp(X3)
            & rs(X0,X3) )
        & ~ cp(X0)
        & ! [X5,X4] :
            ( X4 = X5
            | ~ rr(X0,X4)
            | ~ rr(X0,X5) )
        & ? [X1] :
            ( ! [X2] :
                ( ~ rinvS(X1,X2)
                | cp(X2) )
            & rr(X0,X1) ) )
    <=> cUnsatisfiable(X0) ),
    inference(flattening,[],[f30]) ).

fof(f30,plain,
    ! [X0] :
      ( ( ~ cp(X0)
        & ! [X4,X5] :
            ( X4 = X5
            | ~ rr(X0,X4)
            | ~ rr(X0,X5) )
        & ? [X1] :
            ( ! [X2] :
                ( ~ rinvS(X1,X2)
                | cp(X2) )
            & rr(X0,X1) )
        & ? [X3] :
            ( cp(X3)
            & rs(X0,X3) ) )
    <=> cUnsatisfiable(X0) ),
    inference(ennf_transformation,[],[f28]) ).

fof(f28,plain,
    ! [X0] :
      ( ( ~ cp(X0)
        & ! [X4,X5] :
            ( ( rr(X0,X4)
              & rr(X0,X5) )
           => X4 = X5 )
        & ? [X1] :
            ( ! [X2] :
                ( rinvS(X1,X2)
               => cp(X2) )
            & rr(X0,X1) )
        & ? [X3] :
            ( cp(X3)
            & rs(X0,X3) ) )
    <=> cUnsatisfiable(X0) ),
    inference(rectify,[],[f15]) ).

fof(f15,axiom,
    ! [X3] :
      ( cUnsatisfiable(X3)
    <=> ( ? [X6] :
            ( ! [X7] :
                ( rinvS(X6,X7)
               => cp(X7) )
            & rr(X3,X6) )
        & ? [X6] :
            ( rs(X3,X6)
            & cp(X6) )
        & ! [X5,X4] :
            ( ( rr(X3,X5)
              & rr(X3,X4) )
           => X4 = X5 )
        & ~ cp(X3) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(f201,plain,
    ! [X0] : ~ sP0(X0),
    inference(subsumption_resolution,[],[f199,f96]) ).

fof(f96,plain,
    ! [X0] :
      ( ~ sP0(X0)
      | ~ cp(X0) ),
    inference(cnf_transformation,[],[f74]) ).

fof(f74,plain,
    ! [X0] :
      ( ( sP0(X0)
        | ! [X1] :
            ( ~ cp(X1)
            | ~ rs(X0,X1) )
        | cp(X0)
        | ( sK2(X0) != sK1(X0)
          & rr(X0,sK2(X0))
          & rr(X0,sK1(X0)) )
        | ! [X4] :
            ( ( rinvS(X4,sK3(X4))
              & ~ cp(sK3(X4)) )
            | ~ rr(X0,X4) ) )
      & ( ( cp(sK4(X0))
          & rs(X0,sK4(X0))
          & ~ cp(X0)
          & ! [X7,X8] :
              ( X7 = X8
              | ~ rr(X0,X8)
              | ~ rr(X0,X7) )
          & ! [X10] :
              ( ~ rinvS(sK5(X0),X10)
              | cp(X10) )
          & rr(X0,sK5(X0)) )
        | ~ sP0(X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5])],[f69,f73,f72,f71,f70]) ).

fof(f70,plain,
    ! [X0] :
      ( ? [X2,X3] :
          ( X2 != X3
          & rr(X0,X3)
          & rr(X0,X2) )
     => ( sK2(X0) != sK1(X0)
        & rr(X0,sK2(X0))
        & rr(X0,sK1(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f71,plain,
    ! [X4] :
      ( ? [X5] :
          ( rinvS(X4,X5)
          & ~ cp(X5) )
     => ( rinvS(X4,sK3(X4))
        & ~ cp(sK3(X4)) ) ),
    introduced(choice_axiom,[]) ).

fof(f72,plain,
    ! [X0] :
      ( ? [X6] :
          ( cp(X6)
          & rs(X0,X6) )
     => ( cp(sK4(X0))
        & rs(X0,sK4(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f73,plain,
    ! [X0] :
      ( ? [X9] :
          ( ! [X10] :
              ( ~ rinvS(X9,X10)
              | cp(X10) )
          & rr(X0,X9) )
     => ( ! [X10] :
            ( ~ rinvS(sK5(X0),X10)
            | cp(X10) )
        & rr(X0,sK5(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f69,plain,
    ! [X0] :
      ( ( sP0(X0)
        | ! [X1] :
            ( ~ cp(X1)
            | ~ rs(X0,X1) )
        | cp(X0)
        | ? [X2,X3] :
            ( X2 != X3
            & rr(X0,X3)
            & rr(X0,X2) )
        | ! [X4] :
            ( ? [X5] :
                ( rinvS(X4,X5)
                & ~ cp(X5) )
            | ~ rr(X0,X4) ) )
      & ( ( ? [X6] :
              ( cp(X6)
              & rs(X0,X6) )
          & ~ cp(X0)
          & ! [X7,X8] :
              ( X7 = X8
              | ~ rr(X0,X8)
              | ~ rr(X0,X7) )
          & ? [X9] :
              ( ! [X10] :
                  ( ~ rinvS(X9,X10)
                  | cp(X10) )
              & rr(X0,X9) ) )
        | ~ sP0(X0) ) ),
    inference(rectify,[],[f68]) ).

fof(f68,plain,
    ! [X0] :
      ( ( sP0(X0)
        | ! [X3] :
            ( ~ cp(X3)
            | ~ rs(X0,X3) )
        | cp(X0)
        | ? [X5,X4] :
            ( X4 != X5
            & rr(X0,X4)
            & rr(X0,X5) )
        | ! [X1] :
            ( ? [X2] :
                ( rinvS(X1,X2)
                & ~ cp(X2) )
            | ~ rr(X0,X1) ) )
      & ( ( ? [X3] :
              ( cp(X3)
              & rs(X0,X3) )
          & ~ cp(X0)
          & ! [X5,X4] :
              ( X4 = X5
              | ~ rr(X0,X4)
              | ~ rr(X0,X5) )
          & ? [X1] :
              ( ! [X2] :
                  ( ~ rinvS(X1,X2)
                  | cp(X2) )
              & rr(X0,X1) ) )
        | ~ sP0(X0) ) ),
    inference(flattening,[],[f67]) ).

fof(f67,plain,
    ! [X0] :
      ( ( sP0(X0)
        | ! [X3] :
            ( ~ cp(X3)
            | ~ rs(X0,X3) )
        | cp(X0)
        | ? [X5,X4] :
            ( X4 != X5
            & rr(X0,X4)
            & rr(X0,X5) )
        | ! [X1] :
            ( ? [X2] :
                ( rinvS(X1,X2)
                & ~ cp(X2) )
            | ~ rr(X0,X1) ) )
      & ( ( ? [X3] :
              ( cp(X3)
              & rs(X0,X3) )
          & ~ cp(X0)
          & ! [X5,X4] :
              ( X4 = X5
              | ~ rr(X0,X4)
              | ~ rr(X0,X5) )
          & ? [X1] :
              ( ! [X2] :
                  ( ~ rinvS(X1,X2)
                  | cp(X2) )
              & rr(X0,X1) ) )
        | ~ sP0(X0) ) ),
    inference(nnf_transformation,[],[f57]) ).

fof(f199,plain,
    ! [X0] :
      ( cp(X0)
      | ~ sP0(X0) ),
    inference(duplicate_literal_removal,[],[f193]) ).

fof(f193,plain,
    ! [X0] :
      ( ~ sP0(X0)
      | cp(X0)
      | ~ sP0(X0) ),
    inference(resolution,[],[f184,f94]) ).

fof(f94,plain,
    ! [X10,X0] :
      ( ~ rinvS(sK5(X0),X10)
      | ~ sP0(X0)
      | cp(X10) ),
    inference(cnf_transformation,[],[f74]) ).

fof(f184,plain,
    ! [X6] :
      ( rinvS(sK5(X6),X6)
      | ~ sP0(X6) ),
    inference(duplicate_literal_removal,[],[f182]) ).

fof(f182,plain,
    ! [X6] :
      ( rinvS(sK5(X6),X6)
      | ~ sP0(X6)
      | ~ sP0(X6) ),
    inference(resolution,[],[f153,f93]) ).

fof(f93,plain,
    ! [X0] :
      ( rr(X0,sK5(X0))
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f74]) ).

fof(f153,plain,
    ! [X0,X1] :
      ( ~ rr(X0,X1)
      | rinvS(X1,X0)
      | ~ sP0(X0) ),
    inference(duplicate_literal_removal,[],[f144]) ).

fof(f144,plain,
    ! [X0,X1] :
      ( ~ sP0(X0)
      | ~ rr(X0,X1)
      | ~ sP0(X0)
      | rinvS(X1,X0) ),
    inference(superposition,[],[f129,f135]) ).

fof(f135,plain,
    ! [X2,X3] :
      ( sK4(X2) = X3
      | ~ sP0(X2)
      | ~ rr(X2,X3) ),
    inference(duplicate_literal_removal,[],[f133]) ).

fof(f133,plain,
    ! [X2,X3] :
      ( ~ rr(X2,X3)
      | sK4(X2) = X3
      | ~ sP0(X2)
      | ~ sP0(X2) ),
    inference(resolution,[],[f95,f128]) ).

fof(f128,plain,
    ! [X0] :
      ( rr(X0,sK4(X0))
      | ~ sP0(X0) ),
    inference(resolution,[],[f97,f78]) ).

fof(f78,plain,
    ! [X0,X1] :
      ( ~ rs(X1,X0)
      | rr(X1,X0) ),
    inference(cnf_transformation,[],[f59]) ).

fof(f59,plain,
    ! [X0,X1] :
      ( ~ rs(X1,X0)
      | rr(X1,X0) ),
    inference(rectify,[],[f50]) ).

fof(f50,plain,
    ! [X1,X0] :
      ( ~ rs(X0,X1)
      | rr(X0,X1) ),
    inference(ennf_transformation,[],[f29]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( rs(X0,X1)
     => rr(X0,X1) ),
    inference(rectify,[],[f18]) ).

fof(f18,axiom,
    ! [X3,X6] :
      ( rs(X3,X6)
     => rr(X3,X6) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

fof(f97,plain,
    ! [X0] :
      ( rs(X0,sK4(X0))
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f74]) ).

fof(f95,plain,
    ! [X0,X8,X7] :
      ( ~ rr(X0,X8)
      | ~ rr(X0,X7)
      | ~ sP0(X0)
      | X7 = X8 ),
    inference(cnf_transformation,[],[f74]) ).

fof(f129,plain,
    ! [X0] :
      ( rinvS(sK4(X0),X0)
      | ~ sP0(X0) ),
    inference(resolution,[],[f107,f97]) ).

fof(f107,plain,
    ! [X0,X1] :
      ( ~ rs(X0,X1)
      | rinvS(X1,X0) ),
    inference(cnf_transformation,[],[f76]) ).

fof(f76,plain,
    ! [X0,X1] :
      ( ( rs(X0,X1)
        | ~ rinvS(X1,X0) )
      & ( rinvS(X1,X0)
        | ~ rs(X0,X1) ) ),
    inference(nnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( rs(X0,X1)
    <=> rinvS(X1,X0) ),
    inference(rectify,[],[f16]) ).

fof(f16,axiom,
    ! [X6,X3] :
      ( rs(X6,X3)
    <=> rinvS(X3,X6) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : KRS077+1 : TPTP v8.1.0. Released v3.1.0.
% 0.14/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35  % Computer : n029.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 00:42:11 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.21/0.56  % (26174)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.21/0.56  % (26174)Refutation not found, incomplete strategy% (26174)------------------------------
% 0.21/0.56  % (26174)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.56  % (26174)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.56  % (26174)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.56  
% 0.21/0.56  % (26174)Memory used [KB]: 5884
% 0.21/0.56  % (26174)Time elapsed: 0.004 s
% 0.21/0.56  % (26174)Instructions burned: 1 (million)
% 0.21/0.56  % (26174)------------------------------
% 0.21/0.56  % (26174)------------------------------
% 0.21/0.57  % (26167)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.57  % (26175)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.21/0.57  % (26175)Refutation not found, incomplete strategy% (26175)------------------------------
% 0.21/0.57  % (26175)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57  % (26175)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.57  % (26175)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.57  
% 0.21/0.57  % (26175)Memory used [KB]: 5884
% 0.21/0.57  % (26175)Time elapsed: 0.002 s
% 0.21/0.57  % (26175)Instructions burned: 2 (million)
% 0.21/0.57  % (26175)------------------------------
% 0.21/0.57  % (26175)------------------------------
% 0.21/0.57  % (26167)Refutation not found, incomplete strategy% (26167)------------------------------
% 0.21/0.57  % (26167)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57  % (26167)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.57  % (26167)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.57  
% 0.21/0.57  % (26167)Memory used [KB]: 5884
% 0.21/0.57  % (26167)Time elapsed: 0.004 s
% 0.21/0.57  % (26167)Instructions burned: 1 (million)
% 0.21/0.57  % (26167)------------------------------
% 0.21/0.57  % (26167)------------------------------
% 0.21/0.57  % (26166)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.21/0.58  % (26172)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.21/0.58  % (26172)Refutation not found, incomplete strategy% (26172)------------------------------
% 0.21/0.58  % (26172)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.58  % (26172)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.58  % (26172)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.58  
% 0.21/0.58  % (26172)Memory used [KB]: 5884
% 0.21/0.58  % (26172)Time elapsed: 0.002 s
% 0.21/0.58  % (26172)------------------------------
% 0.21/0.58  % (26172)------------------------------
% 0.21/0.58  % (26166)First to succeed.
% 0.21/0.58  % (26183)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.58  % (26166)Refutation found. Thanks to Tanya!
% 0.21/0.58  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.58  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.58  % (26166)------------------------------
% 0.21/0.58  % (26166)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.58  % (26166)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.58  % (26166)Termination reason: Refutation
% 0.21/0.58  
% 0.21/0.58  % (26166)Memory used [KB]: 6012
% 0.21/0.58  % (26166)Time elapsed: 0.143 s
% 0.21/0.58  % (26166)Instructions burned: 5 (million)
% 0.21/0.58  % (26166)------------------------------
% 0.21/0.58  % (26166)------------------------------
% 0.21/0.58  % (26165)Success in time 0.225 s
%------------------------------------------------------------------------------