↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : KRS087+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 : n011.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:37 AM UTC 2026

% Result   : Unsatisfiable 2.62s 1.33s
% Output   : Refutation 2.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   36 (  12 unt;   1 def)
%            Number of atoms       :  127 (   0 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  152 (  61   ~;  51   |;  34   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   2 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   62 (   0 sgn  49   !;  13   ?)

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

fof(f20,axiom,
    ! [X0,X1] :
      ( rinvR(X0,X1)
    <=> rr(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).

fof(f21,axiom,
    ! [X0,X1,X2] :
      ( ( rr(X0,X1)
        & rr(X1,X2) )
     => rr(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).

fof(f22,axiom,
    cUnsatisfiable(i2003_11_14_17_19_46763),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).

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

fof(f54,plain,
    ! [X0,X1,X2] :
      ( rr(X0,X2)
      | ~ rr(X0,X1)
      | ~ rr(X1,X2) ),
    inference(ennf_transformation,[],[f21]) ).

fof(f55,plain,
    ! [X0,X1,X2] :
      ( rr(X0,X2)
      | ~ rr(X0,X1)
      | ~ rr(X1,X2) ),
    inference(flattening,[],[f54]) ).

fof(f57,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ~ cp1(X0)
        | ! [X1] :
            ( ~ rr(X0,X1)
            | ! [X2] :
                ( ~ rr(X1,X2)
                | ? [X3] :
                    ( cp1(X3)
                    & rinvR(X2,X3) )
                | ~ cp1(X2) ) ) )
      & ( ( cp1(X0)
          & ? [X1] :
              ( rr(X0,X1)
              & ? [X2] :
                  ( rr(X1,X2)
                  & ! [X3] :
                      ( ~ cp1(X3)
                      | ~ rinvR(X2,X3) )
                  & cp1(X2) ) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(nnf_transformation,[],[f51]) ).

fof(f58,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ~ cp1(X0)
        | ! [X1] :
            ( ~ rr(X0,X1)
            | ! [X2] :
                ( ~ rr(X1,X2)
                | ? [X3] :
                    ( cp1(X3)
                    & rinvR(X2,X3) )
                | ~ cp1(X2) ) ) )
      & ( ( cp1(X0)
          & ? [X1] :
              ( rr(X0,X1)
              & ? [X2] :
                  ( rr(X1,X2)
                  & ! [X3] :
                      ( ~ cp1(X3)
                      | ~ rinvR(X2,X3) )
                  & cp1(X2) ) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(flattening,[],[f57]) ).

fof(f59,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ~ cp1(X0)
        | ! [X1] :
            ( ~ rr(X0,X1)
            | ! [X2] :
                ( ~ rr(X1,X2)
                | ? [X3] :
                    ( cp1(X3)
                    & rinvR(X2,X3) )
                | ~ cp1(X2) ) ) )
      & ( ( cp1(X0)
          & ? [X4] :
              ( rr(X0,X4)
              & ? [X5] :
                  ( rr(X4,X5)
                  & ! [X6] :
                      ( ~ cp1(X6)
                      | ~ rinvR(X5,X6) )
                  & cp1(X5) ) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(rectify,[],[f58]) ).

fof(f60,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ~ cp1(X0)
        | ! [X1] :
            ( ~ rr(X0,X1)
            | ! [X2] :
                ( ~ rr(X1,X2)
                | ( cp1(sK0(X2))
                  & rinvR(X2,sK0(X2)) )
                | ~ cp1(X2) ) ) )
      & ( ( cp1(X0)
          & rr(X0,sK1(X0))
          & rr(sK1(X0),sK2(X0))
          & ! [X6] :
              ( ~ cp1(X6)
              | ~ rinvR(sK2(X0),X6) )
          & cp1(sK2(X0)) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X3,sK0(X2)),skolemize(X4,sK1(X0)),skolemize(X5,sK2(X0))],[f59]) ).

fof(f62,plain,
    ! [X0,X1] :
      ( ( rinvR(X0,X1)
        | ~ rr(X1,X0) )
      & ( rr(X1,X0)
        | ~ rinvR(X0,X1) ) ),
    inference(nnf_transformation,[],[f20]) ).

fof(f82,plain,
    ! [X0,X6] :
      ( ~ rinvR(sK2(X0),X6)
      | ~ cp1(X6)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f60]) ).

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

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

fof(f85,plain,
    ! [X0] :
      ( cp1(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f60]) ).

fof(f92,plain,
    ! [X0,X1] :
      ( rinvR(X0,X1)
      | ~ rr(X1,X0) ),
    inference(cnf_transformation,[],[f62]) ).

fof(f93,plain,
    ! [X2,X0,X1] :
      ( rr(X0,X2)
      | ~ rr(X0,X1)
      | ~ rr(X1,X2) ),
    inference(cnf_transformation,[],[f55]) ).

fof(f94,plain,
    cUnsatisfiable(i2003_11_14_17_19_46763),
    inference(cnf_transformation,[],[f22]) ).

fof(f114,plain,
    rr(i2003_11_14_17_19_46763,sK1(i2003_11_14_17_19_46763)),
    inference(resolution,[],[f84,f94]) ).

fof(f117,plain,
    rr(sK1(i2003_11_14_17_19_46763),sK2(i2003_11_14_17_19_46763)),
    inference(resolution,[],[f83,f94]) ).

fof(f118,plain,
    ! [X0,X1] :
      ( ~ cp1(X0)
      | ~ cUnsatisfiable(X1)
      | ~ rr(X0,sK2(X1)) ),
    inference(resolution,[],[f82,f92]) ).

fof(f119,plain,
    ! [X0,X1] :
      ( ~ cUnsatisfiable(X0)
      | ~ cUnsatisfiable(X1)
      | ~ rr(X1,sK2(X0)) ),
    inference(resolution,[],[f118,f85]) ).

fof(f121,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | ~ rr(X0,sK2(i2003_11_14_17_19_46763)) ),
    inference(resolution,[],[f119,f94]) ).

fof(f124,plain,
    ~ rr(i2003_11_14_17_19_46763,sK2(i2003_11_14_17_19_46763)),
    inference(resolution,[],[f121,f94]) ).

fof(f126,plain,
    ! [X0] :
      ( ~ rr(X0,sK2(i2003_11_14_17_19_46763))
      | ~ rr(i2003_11_14_17_19_46763,X0) ),
    inference(resolution,[],[f124,f93]) ).

fof(f140,plain,
    ~ rr(i2003_11_14_17_19_46763,sK1(i2003_11_14_17_19_46763)),
    inference(resolution,[],[f126,f117]) ).

fof(f225,definition,
    ( spl4_9
  <=> rr(i2003_11_14_17_19_46763,sK1(i2003_11_14_17_19_46763)) ),
    introduced(definition,[new_symbols(definition,[spl4_9])],[avatar_definition]) ).

fof(f226,plain,
    ( ~ rr(i2003_11_14_17_19_46763,sK1(i2003_11_14_17_19_46763))
    | spl4_9 ),
    inference(avatar_component_clause,[],[f225]) ).

fof(f242,plain,
    ( $false
    | spl4_9 ),
    inference(resolution,[],[f226,f114]) ).

fof(f244,plain,
    spl4_9,
    inference(avatar_contradiction_clause,[],[f242]) ).

fof(f277,plain,
    ~ spl4_9,
    inference(avatar_split_clause,[],[f140,f225]) ).

cnf(s8,plain,
    spl4_9,
    inference(sat_conversion,[],[f244]) ).

cnf(s13,plain,
    ~ spl4_9,
    inference(sat_conversion,[],[f277]) ).

cnf(s14,plain,
    $false,
    inference(rat,[],[s8,s13]) ).

fof(f278,plain,
    $false,
    inference(avatar_sat_refutation,[],[s14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KRS087+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.37  % Computer : n011.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 13:22:00 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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
% 2.62/1.33  % (2407832)Detected formulas, will run a generic FOF schedule.
% 2.62/1.33  % (2407843)dis-21_1_sil=8000:lcm=predicate:random_seed=48933939: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)
% 2.62/1.33  % (2407843)First to succeed.
% 2.62/1.33  % (2407843)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2407832"
% 2.62/1.33  % (2407842)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=193597284:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.62/1.33  % (2407838)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=2089616349:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.62/1.33  % (2407840)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2606181953:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.62/1.33  % (2407841)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=846135540:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.62/1.33  % (2407837)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=2942158499:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.62/1.33  % (2407839)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=2335538768:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.62/1.33  % (2407841)Refutation not found, incomplete strategy
% 2.62/1.33  % (2407841)------------------------------
% 2.62/1.33  % (2407841)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.62/1.33  % (2407841)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/1.33  % (2407841)CaDiCaL version: 2.1.3
% 2.62/1.33  % (2407841)Termination reason: Refutation not found, incomplete strategy
% 2.62/1.33  % (2407841)Time elapsed: 0.0000 s
% 2.62/1.33  % (2407841)Peak memory usage: 86 MB
% 2.62/1.33  % (2407840)Refutation not found, incomplete strategy
% 2.62/1.33  % (2407840)------------------------------
% 2.62/1.33  % (2407840)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.62/1.33  % (2407840)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/1.33  % (2407840)CaDiCaL version: 2.1.3
% 2.62/1.33  % (2407840)Termination reason: Refutation not found, incomplete strategy
% 2.62/1.33  % (2407840)Time elapsed: 0.0000 s
% 2.62/1.33  % (2407840)Peak memory usage: 86 MB
% 2.62/1.33  % (2407842)Also succeeded, but the first one will report.
% 2.62/1.33  % (2407843)Refutation found. Thanks to Tanya!
% 2.62/1.33  % SZS status Unsatisfiable for theBenchmark
% 2.62/1.33  % SZS output start Proof for theBenchmark
% See solution above
% 2.62/1.33  % (2407843)------------------------------
% 2.62/1.33  % (2407843)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.62/1.33  % (2407843)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/1.33  % (2407843)CaDiCaL version: 2.1.3
% 2.62/1.33  % (2407843)Termination reason: Refutation
% 2.62/1.33  % (2407843)Time elapsed: 0.003 s
% 2.62/1.33  % (2407843)Peak memory usage: 89 MB
% 2.62/1.33  % (2407843)Instructions burned: 6 (million)
% 2.62/1.33  % (2407843)------------------------------
% 2.62/1.33  % (2407843)------------------------------
% 2.62/1.33  % (2407832)Success in time 0.28 s
% 2.62/1.33  % Vampire exiting
%------------------------------------------------------------------------------