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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : KRS127+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 : n017.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:46 EDT 2022

% Result   : Unsatisfiable 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   48 (   4 unt;   0 def)
%            Number of atoms       :  201 (  17 equ)
%            Maximal formula atoms :   16 (   4 avg)
%            Number of connectives :  238 (  85   ~;  75   |;  60   &)
%                                         (   9 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   1 con; 0-1 aty)
%            Number of variables   :  117 (  83   !;  34   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f152,plain,
    $false,
    inference(resolution,[],[f151,f92]) ).

fof(f92,plain,
    cUnsatisfiable(i2003_11_14_17_22_27794),
    inference(cnf_transformation,[],[f19]) ).

fof(f19,axiom,
    cUnsatisfiable(i2003_11_14_17_22_27794),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).

fof(f151,plain,
    ! [X0] : ~ cUnsatisfiable(X0),
    inference(subsumption_resolution,[],[f150,f136]) ).

fof(f136,plain,
    ! [X0] :
      ( ~ cc(sK3(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f135,f109]) ).

fof(f109,plain,
    ! [X0] :
      ( cd(sK3(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f85]) ).

fof(f85,plain,
    ! [X0] :
      ( ( ( ! [X1,X2] :
              ( ~ rr(X0,X1)
              | X1 = X2
              | ~ rr(X0,X2) )
          & rr(X0,sK2(X0))
          & cc(sK2(X0))
          & rr(X0,sK3(X0))
          & cd(sK3(X0)) )
        | ~ cUnsatisfiable(X0) )
      & ( cUnsatisfiable(X0)
        | ( rr(X0,sK4(X0))
          & sK5(X0) != sK4(X0)
          & rr(X0,sK5(X0)) )
        | ! [X7] :
            ( ~ rr(X0,X7)
            | ~ cc(X7) )
        | ! [X8] :
            ( ~ rr(X0,X8)
            | ~ cd(X8) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f81,f84,f83,f82]) ).

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

fof(f83,plain,
    ! [X0] :
      ( ? [X4] :
          ( rr(X0,X4)
          & cd(X4) )
     => ( rr(X0,sK3(X0))
        & cd(sK3(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f84,plain,
    ! [X0] :
      ( ? [X5,X6] :
          ( rr(X0,X5)
          & X5 != X6
          & rr(X0,X6) )
     => ( rr(X0,sK4(X0))
        & sK5(X0) != sK4(X0)
        & rr(X0,sK5(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f81,plain,
    ! [X0] :
      ( ( ( ! [X1,X2] :
              ( ~ rr(X0,X1)
              | X1 = X2
              | ~ rr(X0,X2) )
          & ? [X3] :
              ( rr(X0,X3)
              & cc(X3) )
          & ? [X4] :
              ( rr(X0,X4)
              & cd(X4) ) )
        | ~ cUnsatisfiable(X0) )
      & ( cUnsatisfiable(X0)
        | ? [X5,X6] :
            ( rr(X0,X5)
            & X5 != X6
            & rr(X0,X6) )
        | ! [X7] :
            ( ~ rr(X0,X7)
            | ~ cc(X7) )
        | ! [X8] :
            ( ~ rr(X0,X8)
            | ~ cd(X8) ) ) ),
    inference(rectify,[],[f80]) ).

fof(f80,plain,
    ! [X0] :
      ( ( ( ! [X1,X2] :
              ( ~ rr(X0,X1)
              | X1 = X2
              | ~ rr(X0,X2) )
          & ? [X4] :
              ( rr(X0,X4)
              & cc(X4) )
          & ? [X3] :
              ( rr(X0,X3)
              & cd(X3) ) )
        | ~ cUnsatisfiable(X0) )
      & ( cUnsatisfiable(X0)
        | ? [X1,X2] :
            ( rr(X0,X1)
            & X1 != X2
            & rr(X0,X2) )
        | ! [X4] :
            ( ~ rr(X0,X4)
            | ~ cc(X4) )
        | ! [X3] :
            ( ~ rr(X0,X3)
            | ~ cd(X3) ) ) ),
    inference(flattening,[],[f79]) ).

fof(f79,plain,
    ! [X0] :
      ( ( ( ! [X1,X2] :
              ( ~ rr(X0,X1)
              | X1 = X2
              | ~ rr(X0,X2) )
          & ? [X4] :
              ( rr(X0,X4)
              & cc(X4) )
          & ? [X3] :
              ( rr(X0,X3)
              & cd(X3) ) )
        | ~ cUnsatisfiable(X0) )
      & ( cUnsatisfiable(X0)
        | ? [X1,X2] :
            ( rr(X0,X1)
            & X1 != X2
            & rr(X0,X2) )
        | ! [X4] :
            ( ~ rr(X0,X4)
            | ~ cc(X4) )
        | ! [X3] :
            ( ~ rr(X0,X3)
            | ~ cd(X3) ) ) ),
    inference(nnf_transformation,[],[f57]) ).

fof(f57,plain,
    ! [X0] :
      ( ( ! [X1,X2] :
            ( ~ rr(X0,X1)
            | X1 = X2
            | ~ rr(X0,X2) )
        & ? [X4] :
            ( rr(X0,X4)
            & cc(X4) )
        & ? [X3] :
            ( rr(X0,X3)
            & cd(X3) ) )
    <=> cUnsatisfiable(X0) ),
    inference(flattening,[],[f56]) ).

fof(f56,plain,
    ! [X0] :
      ( ( ? [X4] :
            ( rr(X0,X4)
            & cc(X4) )
        & ? [X3] :
            ( rr(X0,X3)
            & cd(X3) )
        & ! [X1,X2] :
            ( X1 = X2
            | ~ rr(X0,X1)
            | ~ rr(X0,X2) ) )
    <=> cUnsatisfiable(X0) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f24,plain,
    ! [X0] :
      ( ( ? [X4] :
            ( rr(X0,X4)
            & cc(X4) )
        & ? [X3] :
            ( rr(X0,X3)
            & cd(X3) )
        & ! [X1,X2] :
            ( ( rr(X0,X1)
              & rr(X0,X2) )
           => X1 = X2 ) )
    <=> cUnsatisfiable(X0) ),
    inference(rectify,[],[f15]) ).

fof(f15,axiom,
    ! [X3] :
      ( cUnsatisfiable(X3)
    <=> ( ! [X5,X6] :
            ( ( rr(X3,X5)
              & rr(X3,X6) )
           => X5 = X6 )
        & ? [X4] :
            ( cd(X4)
            & rr(X3,X4) )
        & ? [X4] :
            ( cc(X4)
            & rr(X3,X4) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(f135,plain,
    ! [X1] :
      ( ~ cd(X1)
      | ~ cc(X1) ),
    inference(resolution,[],[f133,f89]) ).

fof(f89,plain,
    ! [X0] :
      ( cdxcomp(X0)
      | ~ cc(X0) ),
    inference(cnf_transformation,[],[f60]) ).

fof(f60,plain,
    ! [X0] :
      ( cdxcomp(X0)
      | ~ cc(X0) ),
    inference(ennf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0] :
      ( cc(X0)
     => cdxcomp(X0) ),
    inference(rectify,[],[f16]) ).

fof(f16,axiom,
    ! [X3] :
      ( cc(X3)
     => cdxcomp(X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

fof(f133,plain,
    ! [X1] :
      ( ~ cdxcomp(X1)
      | ~ cd(X1) ),
    inference(resolution,[],[f97,f91]) ).

fof(f91,plain,
    ! [X0,X1] :
      ( ~ ra_Px1(X0,X1)
      | ~ cd(X0) ),
    inference(cnf_transformation,[],[f67]) ).

fof(f67,plain,
    ! [X0] :
      ( ( ! [X1] : ~ ra_Px1(X0,X1)
        | ~ cd(X0) )
      & ( cd(X0)
        | ra_Px1(X0,sK0(X0)) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f65,f66]) ).

fof(f66,plain,
    ! [X0] :
      ( ? [X2] : ra_Px1(X0,X2)
     => ra_Px1(X0,sK0(X0)) ),
    introduced(choice_axiom,[]) ).

fof(f65,plain,
    ! [X0] :
      ( ( ! [X1] : ~ ra_Px1(X0,X1)
        | ~ cd(X0) )
      & ( cd(X0)
        | ? [X2] : ra_Px1(X0,X2) ) ),
    inference(rectify,[],[f64]) ).

fof(f64,plain,
    ! [X0] :
      ( ( ! [X1] : ~ ra_Px1(X0,X1)
        | ~ cd(X0) )
      & ( cd(X0)
        | ? [X1] : ra_Px1(X0,X1) ) ),
    inference(nnf_transformation,[],[f37]) ).

fof(f37,plain,
    ! [X0] :
      ( ! [X1] : ~ ra_Px1(X0,X1)
    <=> cd(X0) ),
    inference(ennf_transformation,[],[f31]) ).

fof(f31,plain,
    ! [X0] :
      ( cd(X0)
    <=> ~ ? [X1] : ra_Px1(X0,X1) ),
    inference(rectify,[],[f17]) ).

fof(f17,axiom,
    ! [X3] :
      ( cd(X3)
    <=> ~ ? [X4] : ra_Px1(X3,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).

fof(f97,plain,
    ! [X0] :
      ( ra_Px1(X0,sK1(X0))
      | ~ cdxcomp(X0) ),
    inference(cnf_transformation,[],[f74]) ).

fof(f74,plain,
    ! [X0] :
      ( ( ra_Px1(X0,sK1(X0))
        | ~ cdxcomp(X0) )
      & ( cdxcomp(X0)
        | ! [X2] : ~ ra_Px1(X0,X2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f72,f73]) ).

fof(f73,plain,
    ! [X0] :
      ( ? [X1] : ra_Px1(X0,X1)
     => ra_Px1(X0,sK1(X0)) ),
    introduced(choice_axiom,[]) ).

fof(f72,plain,
    ! [X0] :
      ( ( ? [X1] : ra_Px1(X0,X1)
        | ~ cdxcomp(X0) )
      & ( cdxcomp(X0)
        | ! [X2] : ~ ra_Px1(X0,X2) ) ),
    inference(rectify,[],[f71]) ).

fof(f71,plain,
    ! [X0] :
      ( ( ? [X1] : ra_Px1(X0,X1)
        | ~ cdxcomp(X0) )
      & ( cdxcomp(X0)
        | ! [X1] : ~ ra_Px1(X0,X1) ) ),
    inference(nnf_transformation,[],[f34]) ).

fof(f34,plain,
    ! [X0] :
      ( ? [X1] : ra_Px1(X0,X1)
    <=> cdxcomp(X0) ),
    inference(rectify,[],[f18]) ).

fof(f18,axiom,
    ! [X3] :
      ( ? [X5] : ra_Px1(X3,X5)
    <=> cdxcomp(X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).

fof(f150,plain,
    ! [X0] :
      ( cc(sK3(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(duplicate_literal_removal,[],[f147]) ).

fof(f147,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | ~ cUnsatisfiable(X0)
      | cc(sK3(X0)) ),
    inference(resolution,[],[f144,f110]) ).

fof(f110,plain,
    ! [X0] :
      ( rr(X0,sK3(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f85]) ).

fof(f144,plain,
    ! [X2,X3] :
      ( ~ rr(X2,X3)
      | cc(X3)
      | ~ cUnsatisfiable(X2) ),
    inference(duplicate_literal_removal,[],[f143]) ).

fof(f143,plain,
    ! [X2,X3] :
      ( cc(X3)
      | ~ cUnsatisfiable(X2)
      | ~ rr(X2,X3)
      | ~ cUnsatisfiable(X2) ),
    inference(superposition,[],[f111,f139]) ).

fof(f139,plain,
    ! [X2,X3] :
      ( sK2(X2) = X3
      | ~ cUnsatisfiable(X2)
      | ~ rr(X2,X3) ),
    inference(duplicate_literal_removal,[],[f138]) ).

fof(f138,plain,
    ! [X2,X3] :
      ( ~ cUnsatisfiable(X2)
      | ~ cUnsatisfiable(X2)
      | ~ rr(X2,X3)
      | sK2(X2) = X3 ),
    inference(resolution,[],[f113,f112]) ).

fof(f112,plain,
    ! [X0] :
      ( rr(X0,sK2(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f85]) ).

fof(f113,plain,
    ! [X2,X0,X1] :
      ( ~ rr(X0,X2)
      | ~ rr(X0,X1)
      | ~ cUnsatisfiable(X0)
      | X1 = X2 ),
    inference(cnf_transformation,[],[f85]) ).

fof(f111,plain,
    ! [X0] :
      ( cc(sK2(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f85]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : KRS127+1 : TPTP v8.1.0. Released v3.1.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 : n017.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   : Mon Aug 29 23:58:20 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.51  % (8828)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.19/0.51  % (8828)Refutation not found, incomplete strategy% (8828)------------------------------
% 0.19/0.51  % (8828)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (8825)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.51  % (8826)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.51  % (8828)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (8828)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.51  
% 0.19/0.51  % (8828)Memory used [KB]: 5884
% 0.19/0.51  % (8828)Time elapsed: 0.002 s
% 0.19/0.51  % (8828)------------------------------
% 0.19/0.51  % (8828)------------------------------
% 0.19/0.51  % (8826)Refutation not found, incomplete strategy% (8826)------------------------------
% 0.19/0.51  % (8826)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (8826)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (8826)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.51  
% 0.19/0.51  % (8826)Memory used [KB]: 5884
% 0.19/0.51  % (8826)Time elapsed: 0.002 s
% 0.19/0.51  % (8826)Instructions burned: 2 (million)
% 0.19/0.51  % (8826)------------------------------
% 0.19/0.51  % (8826)------------------------------
% 0.19/0.51  % (8820)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.19/0.51  % (8820)First to succeed.
% 0.19/0.52  % (8820)Refutation found. Thanks to Tanya!
% 0.19/0.52  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52  % (8820)------------------------------
% 0.19/0.52  % (8820)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (8820)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (8820)Termination reason: Refutation
% 0.19/0.52  
% 0.19/0.52  % (8820)Memory used [KB]: 6012
% 0.19/0.52  % (8820)Time elapsed: 0.119 s
% 0.19/0.52  % (8820)Instructions burned: 2 (million)
% 0.19/0.52  % (8820)------------------------------
% 0.19/0.52  % (8820)------------------------------
% 0.19/0.52  % (8819)Success in time 0.167 s
%------------------------------------------------------------------------------