↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : KRS095+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 11:41:38 AM UTC 2026

% Result   : Unsatisfiable 3.48s 1.42s
% Output   : Refutation 3.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   20 (   4 unt;   0 def)
%            Number of atoms       :  108 (  30 equ)
%            Maximal formula atoms :   14 (   5 avg)
%            Number of connectives :  138 (  50   ~;  44   |;  38   &)
%                                         (   4 <=>;   2  =>;   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   :   62 (  42   !;  20   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f12,axiom,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1,X2] :
            ( rr(X0,X1)
            & rr(X0,X2)
            & X1 != X2 )
        & ! [X1,X2] :
            ( ( rr(X0,X1)
              & rr(X0,X2) )
           => X1 = X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

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

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

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

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

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

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

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

fof(f41,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ! [X1,X2] :
            ( ~ rr(X0,X1)
            | ~ rr(X0,X2)
            | X1 = X2 )
        | ( sK0(X0) != sK1(X0)
          & rr(X0,sK0(X0))
          & rr(X0,sK1(X0)) ) )
      & ( ( rr(X0,sK2(X0))
          & rr(X0,sK3(X0))
          & sK2(X0) != sK3(X0)
          & ! [X7,X8] :
              ( X7 = X8
              | ~ rr(X0,X7)
              | ~ rr(X0,X8) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X3,sK0(X0)),skolemize(X4,sK1(X0)),skolemize(X5,sK2(X0)),skolemize(X6,sK3(X0))],[f40]) ).

fof(f55,plain,
    ! [X0,X8,X7] :
      ( ~ cUnsatisfiable(X0)
      | ~ rr(X0,X7)
      | ~ rr(X0,X8)
      | X7 = X8 ),
    inference(cnf_transformation,[],[f41]) ).

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

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

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

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

fof(f73,plain,
    ! [X0,X1] :
      ( ~ rr(i2003_11_14_17_20_14253,X0)
      | ~ rr(i2003_11_14_17_20_14253,X1)
      | X0 = X1 ),
    inference(resolution,[],[f55,f63]) ).

fof(f75,plain,
    ! [X0] :
      ( ~ rr(i2003_11_14_17_20_14253,X0)
      | sK2(i2003_11_14_17_20_14253) = X0
      | ~ cUnsatisfiable(i2003_11_14_17_20_14253) ),
    inference(resolution,[],[f73,f58]) ).

fof(f77,plain,
    ! [X0] :
      ( ~ rr(i2003_11_14_17_20_14253,X0)
      | sK2(i2003_11_14_17_20_14253) = X0 ),
    inference(forward_subsumption_resolution,[],[f75,f63]) ).

fof(f80,plain,
    ( sK3(i2003_11_14_17_20_14253) = sK2(i2003_11_14_17_20_14253)
    | ~ cUnsatisfiable(i2003_11_14_17_20_14253) ),
    inference(resolution,[],[f77,f57]) ).

fof(f82,plain,
    ~ cUnsatisfiable(i2003_11_14_17_20_14253),
    inference(forward_subsumption_resolution,[],[f80,f56]) ).

fof(f83,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f82,f63]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS095+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35  % Computer : n016.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sun Sep 27 13:28:02 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.39  Running first-order theorem proving
% 0.15/0.39  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.48/1.42  % (2649769)Detected formulas, will run a generic FOF schedule.
% 3.48/1.42  % (2649774)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3200541062:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.48/1.42  % (2649779)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3798830887:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.48/1.42  % (2649780)dis-21_1_sil=8000:lcm=predicate:random_seed=3207445986:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.48/1.42  % (2649777)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3989634699:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.48/1.42  % (2649778)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2851792749:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.48/1.42  % (2649775)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=759301598:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.48/1.42  % (2649776)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=983606543:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.48/1.42  % (2649778)Refutation not found, incomplete strategy
% 3.48/1.42  % (2649778)------------------------------
% 3.48/1.42  % (2649778)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.42  % (2649778)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.42  % (2649778)CaDiCaL version: 2.1.3
% 3.48/1.42  % (2649778)Termination reason: Refutation not found, incomplete strategy
% 3.48/1.42  % (2649778)Time elapsed: 0.0000 s
% 3.48/1.42  % (2649778)Peak memory usage: 86 MB
% 3.48/1.42  % (2649777)Refutation not found, incomplete strategy
% 3.48/1.42  % (2649777)------------------------------
% 3.48/1.42  % (2649777)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.42  % (2649777)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.42  % (2649777)CaDiCaL version: 2.1.3
% 3.48/1.42  % (2649777)Termination reason: Refutation not found, incomplete strategy
% 3.48/1.42  % (2649777)Time elapsed: 0.0000 s
% 3.48/1.42  % (2649777)Peak memory usage: 86 MB
% 3.48/1.42  % (2649779)First to succeed.
% 3.48/1.42  % (2649780)Also succeeded, but the first one will report.
% 3.48/1.42  % (2649779)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2649769"
% 3.48/1.42  % (2649777)------------------------------
% 3.48/1.42  % (2649777)------------------------------
% 3.48/1.42  % (2649778)------------------------------
% 3.48/1.42  % (2649778)------------------------------
% 3.48/1.42  % (2649779)Refutation found. Thanks to Tanya!
% 3.48/1.42  % SZS status Unsatisfiable for theBenchmark
% 3.48/1.42  % SZS output start Proof for theBenchmark
% See solution above
% 3.48/1.42  % (2649779)------------------------------
% 3.48/1.42  % (2649779)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.42  % (2649779)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.42  % (2649779)CaDiCaL version: 2.1.3
% 3.48/1.42  % (2649779)Termination reason: Refutation
% 3.48/1.42  % (2649779)Time elapsed: 0.002 s
% 3.48/1.42  % (2649779)Peak memory usage: 88 MB
% 3.48/1.42  % (2649779)Instructions burned: 2 (million)
% 3.48/1.42  % (2649779)------------------------------
% 3.48/1.42  % (2649779)------------------------------
% 3.48/1.42  % (2649769)Success in time 0.404 s
% 3.48/1.42  % Vampire exiting
%------------------------------------------------------------------------------