TSTP Solution File: KRS095+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : KRS095+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n020.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 : Mon May 20 23:20:04 EDT 2024

% Result   : Unsatisfiable 0.78s 0.94s
% Output   : Refutation 0.78s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (   4 unt;   0 def)
%            Number of atoms       :  128 (  34 equ)
%            Maximal formula atoms :   14 (   5 avg)
%            Number of connectives :  168 (  64   ~;  50   |;  46   &)
%                                         (   4 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   75 (  51   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f100,plain,
    $false,
    inference(resolution,[],[f99,f68]) ).

fof(f68,plain,
    cUnsatisfiable(i2003_11_14_17_20_14253),
    inference(cnf_transformation,[],[f14]) ).

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

fof(f99,plain,
    ! [X0] : ~ cUnsatisfiable(X0),
    inference(duplicate_literal_removal,[],[f96]) ).

fof(f96,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f94,f60]) ).

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

fof(f46,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ( sK0(X0) != sK1(X0)
          & rr(X0,sK1(X0))
          & rr(X0,sK0(X0)) )
        | ! [X3,X4] :
            ( X3 = X4
            | ~ rr(X0,X4)
            | ~ rr(X0,X3) ) )
      & ( ( ! [X5,X6] :
              ( X5 = X6
              | ~ rr(X0,X6)
              | ~ rr(X0,X5) )
          & sK2(X0) != sK3(X0)
          & rr(X0,sK3(X0))
          & rr(X0,sK2(X0)) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f43,f45,f44]) ).

fof(f44,plain,
    ! [X0] :
      ( ? [X1,X2] :
          ( X1 != X2
          & rr(X0,X2)
          & rr(X0,X1) )
     => ( sK0(X0) != sK1(X0)
        & rr(X0,sK1(X0))
        & rr(X0,sK0(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f45,plain,
    ! [X0] :
      ( ? [X7,X8] :
          ( X7 != X8
          & rr(X0,X8)
          & rr(X0,X7) )
     => ( sK2(X0) != sK3(X0)
        & rr(X0,sK3(X0))
        & rr(X0,sK2(X0)) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

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

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

fof(f94,plain,
    ! [X0] :
      ( ~ rr(X0,sK2(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(equality_resolution,[],[f87]) ).

fof(f87,plain,
    ! [X0,X1] :
      ( sK2(X0) != X1
      | ~ cUnsatisfiable(X0)
      | ~ rr(X0,X1) ),
    inference(duplicate_literal_removal,[],[f84]) ).

fof(f84,plain,
    ! [X0,X1] :
      ( sK2(X0) != X1
      | ~ cUnsatisfiable(X0)
      | ~ rr(X0,X1)
      | ~ cUnsatisfiable(X0) ),
    inference(superposition,[],[f62,f81]) ).

fof(f81,plain,
    ! [X0,X1] :
      ( sK3(X1) = X0
      | ~ rr(X1,X0)
      | ~ cUnsatisfiable(X1) ),
    inference(duplicate_literal_removal,[],[f80]) ).

fof(f80,plain,
    ! [X0,X1] :
      ( sK3(X1) = X0
      | ~ rr(X1,X0)
      | ~ cUnsatisfiable(X1)
      | ~ cUnsatisfiable(X1) ),
    inference(resolution,[],[f63,f61]) ).

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

fof(f63,plain,
    ! [X0,X6,X5] :
      ( ~ rr(X0,X6)
      | X5 = X6
      | ~ rr(X0,X5)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f46]) ).

fof(f62,plain,
    ! [X0] :
      ( sK2(X0) != sK3(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f46]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : KRS095+1 : TPTP v8.2.0. Released v3.1.0.
% 0.07/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36  % Computer : n020.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Sat May 18 21:58:53 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a FOF_UNS_RFO_SEQ problem
% 0.15/0.36  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.78/0.93  % (29903)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.78/0.93  % (29904)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.78/0.93  % (29901)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2994ds/34Mi)
% 0.78/0.93  % (29905)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2994ds/34Mi)
% 0.78/0.93  % (29902)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2994ds/51Mi)
% 0.78/0.93  % (29906)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.78/0.93  % (29907)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2994ds/83Mi)
% 0.78/0.93  % (29903)Refutation not found, incomplete strategy% (29903)------------------------------
% 0.78/0.93  % (29903)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.78/0.93  % (29903)Termination reason: Refutation not found, incomplete strategy
% 0.78/0.93  
% 0.78/0.93  % (29903)Memory used [KB]: 944
% 0.78/0.93  % (29903)Time elapsed: 0.002 s
% 0.78/0.93  % (29904)Refutation not found, incomplete strategy% (29904)------------------------------
% 0.78/0.93  % (29904)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.78/0.93  % (29903)Instructions burned: 2 (million)
% 0.78/0.93  % (29906)Refutation not found, incomplete strategy% (29906)------------------------------
% 0.78/0.93  % (29906)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.78/0.93  % (29904)Termination reason: Refutation not found, incomplete strategy
% 0.78/0.93  % (29906)Termination reason: Refutation not found, incomplete strategy
% 0.78/0.93  
% 0.78/0.93  
% 0.78/0.93  % (29904)Memory used [KB]: 944
% 0.78/0.93  % (29906)Memory used [KB]: 944
% 0.78/0.93  % (29904)Time elapsed: 0.002 s
% 0.78/0.93  % (29906)Time elapsed: 0.002 s
% 0.78/0.93  % (29904)Instructions burned: 2 (million)
% 0.78/0.93  % (29906)Instructions burned: 2 (million)
% 0.78/0.93  % (29901)Refutation not found, incomplete strategy% (29901)------------------------------
% 0.78/0.93  % (29901)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.78/0.93  % (29901)Termination reason: Refutation not found, incomplete strategy
% 0.78/0.93  
% 0.78/0.93  % (29901)Memory used [KB]: 945
% 0.78/0.94  % (29901)Time elapsed: 0.003 s
% 0.78/0.94  % (29901)Instructions burned: 2 (million)
% 0.78/0.94  % (29907)Refutation not found, incomplete strategy% (29907)------------------------------
% 0.78/0.94  % (29907)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.78/0.94  % (29907)Termination reason: Refutation not found, incomplete strategy
% 0.78/0.94  
% 0.78/0.94  % (29907)Memory used [KB]: 945
% 0.78/0.94  % (29907)Time elapsed: 0.002 s
% 0.78/0.94  % (29907)Instructions burned: 2 (million)
% 0.78/0.94  % (29908)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2994ds/56Mi)
% 0.78/0.94  % (29906)------------------------------
% 0.78/0.94  % (29906)------------------------------
% 0.78/0.94  % (29901)------------------------------
% 0.78/0.94  % (29901)------------------------------
% 0.78/0.94  % (29903)------------------------------
% 0.78/0.94  % (29903)------------------------------
% 0.78/0.94  % (29905)Refutation not found, incomplete strategy% (29905)------------------------------
% 0.78/0.94  % (29905)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.78/0.94  % (29907)------------------------------
% 0.78/0.94  % (29907)------------------------------
% 0.78/0.94  % (29905)Termination reason: Refutation not found, incomplete strategy
% 0.78/0.94  
% 0.78/0.94  % (29905)Memory used [KB]: 957
% 0.78/0.94  % (29905)Time elapsed: 0.003 s
% 0.78/0.94  % (29905)Instructions burned: 2 (million)
% 0.78/0.94  % (29908)Refutation not found, incomplete strategy% (29908)------------------------------
% 0.78/0.94  % (29908)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.78/0.94  % (29908)Termination reason: Refutation not found, incomplete strategy
% 0.78/0.94  
% 0.78/0.94  % (29908)Memory used [KB]: 944
% 0.78/0.94  % (29908)Time elapsed: 0.002 s
% 0.78/0.94  % (29908)Instructions burned: 2 (million)
% 0.78/0.94  % (29905)------------------------------
% 0.78/0.94  % (29905)------------------------------
% 0.78/0.94  % (29904)------------------------------
% 0.78/0.94  % (29904)------------------------------
% 0.78/0.94  % (29908)------------------------------
% 0.78/0.94  % (29908)------------------------------
% 0.78/0.94  % (29902)First to succeed.
% 0.78/0.94  % (29902)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-29892"
% 0.78/0.94  % (29902)Refutation found. Thanks to Tanya!
% 0.78/0.94  % SZS status Unsatisfiable for theBenchmark
% 0.78/0.94  % SZS output start Proof for theBenchmark
% See solution above
% 0.78/0.94  % (29902)------------------------------
% 0.78/0.94  % (29902)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.78/0.94  % (29902)Termination reason: Refutation
% 0.78/0.94  
% 0.78/0.94  % (29902)Memory used [KB]: 985
% 0.78/0.94  % (29902)Time elapsed: 0.004 s
% 0.78/0.94  % (29902)Instructions burned: 4 (million)
% 0.78/0.94  % (29892)Success in time 0.571 s
% 0.78/0.94  % Vampire---4.8 exiting
%------------------------------------------------------------------------------