↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n018.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:35 AM UTC 2026

% Result   : Unsatisfiable 3.65s 1.47s
% Output   : Refutation 3.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   16 (   4 unt;   0 def)
%            Number of atoms       :   92 (   0 equ)
%            Maximal formula atoms :   14 (   5 avg)
%            Number of connectives :  118 (  42   ~;  35   |;  36   &)
%                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   42 (  27   !;  15   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f21,axiom,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( rs(X0,X1)
            & cp(X1)
            & ? [X2] :
                ( rinvS(X1,X2)
                & cp(X2) ) )
        & ! [X1] :
            ( rs(X0,X1)
           => ~ cp(X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(f28,axiom,
    cUnsatisfiable(i2003_11_14_17_18_59896),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).

fof(f31,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( rs(X0,X1)
            & cp(X1)
            & ? [X2] :
                ( rinvS(X1,X2)
                & cp(X2) ) )
        & ! [X3] :
            ( rs(X0,X3)
           => ~ cp(X3) ) ) ),
    inference(rectify,[],[f21]) ).

fof(f68,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( rs(X0,X1)
            & cp(X1)
            & ? [X2] :
                ( rinvS(X1,X2)
                & cp(X2) ) )
        & ! [X3] :
            ( ~ cp(X3)
            | ~ rs(X0,X3) ) ) ),
    inference(ennf_transformation,[],[f31]) ).

fof(f78,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ! [X1] :
            ( ~ rs(X0,X1)
            | ~ cp(X1)
            | ! [X2] :
                ( ~ rinvS(X1,X2)
                | ~ cp(X2) ) )
        | ? [X3] :
            ( cp(X3)
            & rs(X0,X3) ) )
      & ( ( ? [X1] :
              ( rs(X0,X1)
              & cp(X1)
              & ? [X2] :
                  ( rinvS(X1,X2)
                  & cp(X2) ) )
          & ! [X3] :
              ( ~ cp(X3)
              | ~ rs(X0,X3) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(nnf_transformation,[],[f68]) ).

fof(f79,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ! [X1] :
            ( ~ rs(X0,X1)
            | ~ cp(X1)
            | ! [X2] :
                ( ~ rinvS(X1,X2)
                | ~ cp(X2) ) )
        | ? [X3] :
            ( cp(X3)
            & rs(X0,X3) ) )
      & ( ( ? [X1] :
              ( rs(X0,X1)
              & cp(X1)
              & ? [X2] :
                  ( rinvS(X1,X2)
                  & cp(X2) ) )
          & ! [X3] :
              ( ~ cp(X3)
              | ~ rs(X0,X3) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(flattening,[],[f78]) ).

fof(f80,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ! [X1] :
            ( ~ rs(X0,X1)
            | ~ cp(X1)
            | ! [X2] :
                ( ~ rinvS(X1,X2)
                | ~ cp(X2) ) )
        | ? [X3] :
            ( cp(X3)
            & rs(X0,X3) ) )
      & ( ( ? [X4] :
              ( rs(X0,X4)
              & cp(X4)
              & ? [X5] :
                  ( rinvS(X4,X5)
                  & cp(X5) ) )
          & ! [X6] :
              ( ~ cp(X6)
              | ~ rs(X0,X6) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(rectify,[],[f79]) ).

fof(f81,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ! [X1] :
            ( ~ rs(X0,X1)
            | ~ cp(X1)
            | ! [X2] :
                ( ~ rinvS(X1,X2)
                | ~ cp(X2) ) )
        | ( cp(sK0(X0))
          & rs(X0,sK0(X0)) ) )
      & ( ( rs(X0,sK1(X0))
          & cp(sK1(X0))
          & rinvS(sK1(X0),sK2(X0))
          & cp(sK2(X0))
          & ! [X6] :
              ( ~ cp(X6)
              | ~ rs(X0,X6) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X3,sK0(X0)),skolemize(X4,sK1(X0)),skolemize(X5,sK2(X0))],[f80]) ).

fof(f107,plain,
    ! [X0,X6] :
      ( ~ cUnsatisfiable(X0)
      | ~ rs(X0,X6)
      | ~ cp(X6) ),
    inference(cnf_transformation,[],[f81]) ).

fof(f110,plain,
    ! [X0] :
      ( cp(sK1(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f81]) ).

fof(f111,plain,
    ! [X0] :
      ( rs(X0,sK1(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f81]) ).

fof(f123,plain,
    cUnsatisfiable(i2003_11_14_17_18_59896),
    inference(cnf_transformation,[],[f28]) ).

fof(f147,plain,
    ! [X0] :
      ( ~ rs(i2003_11_14_17_18_59896,X0)
      | ~ cp(X0) ),
    inference(resolution,[],[f107,f123]) ).

fof(f148,plain,
    ( ~ cp(sK1(i2003_11_14_17_18_59896))
    | ~ cUnsatisfiable(i2003_11_14_17_18_59896) ),
    inference(resolution,[],[f147,f111]) ).

fof(f150,plain,
    ~ cUnsatisfiable(i2003_11_14_17_18_59896),
    inference(forward_subsumption_resolution,[],[f148,f110]) ).

fof(f151,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f150,f123]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS074+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n018.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 27 13:21:23 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.39  Running first-order theorem proving
% 0.10/0.40  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.65/1.47  % (2352279)Detected formulas, will run a generic FOF schedule.
% 3.65/1.47  % (2352287)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1866376836:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.65/1.47  % (2352287)Refutation not found, incomplete strategy
% 3.65/1.47  % (2352287)------------------------------
% 3.65/1.47  % (2352287)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.65/1.47  % (2352287)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.65/1.47  % (2352287)CaDiCaL version: 2.1.3
% 3.65/1.47  % (2352287)Termination reason: Refutation not found, incomplete strategy
% 3.65/1.47  % (2352287)Time elapsed: 0.0000 s
% 3.65/1.47  % (2352287)Peak memory usage: 86 MB
% 3.65/1.47  % (2352288)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3862084651:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.65/1.47  % (2352285)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=2887106046:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.65/1.47  % (2352290)dis-21_1_sil=8000:lcm=predicate:random_seed=3177528502: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.65/1.47  % (2352286)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=137351716:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.65/1.47  % (2352284)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=3960967240:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.65/1.47  % (2352289)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2719210804:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.65/1.47  % (2352288)Refutation not found, incomplete strategy
% 3.65/1.47  % (2352288)------------------------------
% 3.65/1.47  % (2352288)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.65/1.47  % (2352288)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.65/1.47  % (2352288)CaDiCaL version: 2.1.3
% 3.65/1.47  % (2352288)Termination reason: Refutation not found, incomplete strategy
% 3.65/1.47  % (2352288)Time elapsed: 0.0000 s
% 3.65/1.47  % (2352288)Peak memory usage: 86 MB
% 3.65/1.47  % (2352289)First to succeed.
% 3.65/1.47  % (2352290)Also succeeded, but the first one will report.
% 3.65/1.47  % (2352289)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2352279"
% 3.65/1.47  % (2352287)------------------------------
% 3.65/1.47  % (2352287)------------------------------
% 3.65/1.47  % (2352298)lrs+10_1_sil=8000:sp=occurrence:random_seed=3998969941:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.65/1.47  % (2352298)Refutation not found, incomplete strategy
% 3.65/1.47  % (2352298)------------------------------
% 3.65/1.47  % (2352298)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.65/1.47  % (2352298)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.65/1.47  % (2352298)CaDiCaL version: 2.1.3
% 3.65/1.47  % (2352298)Termination reason: Refutation not found, incomplete strategy
% 3.65/1.47  % (2352298)Time elapsed: 0.0000 s
% 3.65/1.47  % (2352298)Peak memory usage: 86 MB
% 3.65/1.47  % (2352288)------------------------------
% 3.65/1.47  % (2352288)------------------------------
% 3.65/1.47  % (2352289)Refutation found. Thanks to Tanya!
% 3.65/1.47  % SZS status Unsatisfiable for theBenchmark
% 3.65/1.47  % SZS output start Proof for theBenchmark
% See solution above
% 3.65/1.47  % (2352289)------------------------------
% 3.65/1.47  % (2352289)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.65/1.47  % (2352289)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.65/1.47  % (2352289)CaDiCaL version: 2.1.3
% 3.65/1.47  % (2352289)Termination reason: Refutation
% 3.65/1.47  % (2352289)Time elapsed: 0.003 s
% 3.65/1.47  % (2352289)Peak memory usage: 88 MB
% 3.65/1.47  % (2352289)Instructions burned: 2 (million)
% 3.65/1.47  % (2352289)------------------------------
% 3.65/1.47  % (2352289)------------------------------
% 3.65/1.47  % (2352279)Success in time 0.434 s
% 3.65/1.47  % Vampire exiting
%------------------------------------------------------------------------------