↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

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

% Computer : n010.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:42:12 AM UTC 2026

% Result   : Unsatisfiable 0.13s 0.42s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   45 (   7 unt;   1 def)
%            Number of atoms       :  178 (   8 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  211 (  78   ~;  72   |;  48   &)
%                                         (   7 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :  100 (  80   !;  20   ?)

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

fof(f22,axiom,
    ! [X0,X1,X2] :
      ( ( rf(X0,X1)
        & rf(X0,X2) )
     => X1 = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

fof(f24,axiom,
    ! [X0,X1] :
      ( rinvF(X0,X1)
    <=> rf(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

fof(f26,axiom,
    ! [X0,X1] :
      ( rinvS(X0,X1)
    <=> rs(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).

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

fof(f30,axiom,
    ! [X0,X1] :
      ( rs(X0,X1)
     => rf(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).

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

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

fof(f69,plain,
    ! [X0,X1,X2] :
      ( X1 = X2
      | ~ rf(X0,X1)
      | ~ rf(X0,X2) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f70,plain,
    ! [X0,X1,X2] :
      ( X1 = X2
      | ~ rf(X0,X1)
      | ~ rf(X0,X2) ),
    inference(flattening,[],[f69]) ).

fof(f76,plain,
    ! [X0,X1] :
      ( rf(X0,X1)
      | ~ rs(X0,X1) ),
    inference(ennf_transformation,[],[f30]) ).

fof(f77,definition,
    ! [X0] :
      ( sP0(X0)
    <=> ( ? [X1] :
            ( rf(X0,X1)
            & ! [X2] :
                ( cp(X2)
                | ~ rinvS(X1,X2) )
            & ! [X3] :
                ( ? [X4] :
                    ( rs(X3,X4)
                    & cp(X4) )
                | ~ rinvF(X1,X3) ) )
        & ~ cp(X0) ) ),
    introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).

fof(f78,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> sP0(X0) ),
    inference(definition_folding,[],[f68,f77]) ).

fof(f80,plain,
    ! [X0] :
      ( ( sP0(X0)
        | ! [X1] :
            ( ~ rf(X0,X1)
            | ? [X2] :
                ( ~ cp(X2)
                & rinvS(X1,X2) )
            | ? [X3] :
                ( ! [X4] :
                    ( ~ rs(X3,X4)
                    | ~ cp(X4) )
                & rinvF(X1,X3) ) )
        | cp(X0) )
      & ( ( ? [X1] :
              ( rf(X0,X1)
              & ! [X2] :
                  ( cp(X2)
                  | ~ rinvS(X1,X2) )
              & ! [X3] :
                  ( ? [X4] :
                      ( rs(X3,X4)
                      & cp(X4) )
                  | ~ rinvF(X1,X3) ) )
          & ~ cp(X0) )
        | ~ sP0(X0) ) ),
    inference(nnf_transformation,[],[f77]) ).

fof(f81,plain,
    ! [X0] :
      ( ( sP0(X0)
        | ! [X1] :
            ( ~ rf(X0,X1)
            | ? [X2] :
                ( ~ cp(X2)
                & rinvS(X1,X2) )
            | ? [X3] :
                ( ! [X4] :
                    ( ~ rs(X3,X4)
                    | ~ cp(X4) )
                & rinvF(X1,X3) ) )
        | cp(X0) )
      & ( ( ? [X1] :
              ( rf(X0,X1)
              & ! [X2] :
                  ( cp(X2)
                  | ~ rinvS(X1,X2) )
              & ! [X3] :
                  ( ? [X4] :
                      ( rs(X3,X4)
                      & cp(X4) )
                  | ~ rinvF(X1,X3) ) )
          & ~ cp(X0) )
        | ~ sP0(X0) ) ),
    inference(flattening,[],[f80]) ).

fof(f82,plain,
    ! [X0] :
      ( ( sP0(X0)
        | ! [X1] :
            ( ~ rf(X0,X1)
            | ? [X2] :
                ( ~ cp(X2)
                & rinvS(X1,X2) )
            | ? [X3] :
                ( ! [X4] :
                    ( ~ rs(X3,X4)
                    | ~ cp(X4) )
                & rinvF(X1,X3) ) )
        | cp(X0) )
      & ( ( ? [X5] :
              ( rf(X0,X5)
              & ! [X6] :
                  ( cp(X6)
                  | ~ rinvS(X5,X6) )
              & ! [X7] :
                  ( ? [X8] :
                      ( rs(X7,X8)
                      & cp(X8) )
                  | ~ rinvF(X5,X7) ) )
          & ~ cp(X0) )
        | ~ sP0(X0) ) ),
    inference(rectify,[],[f81]) ).

fof(f83,plain,
    ! [X0] :
      ( ( sP0(X0)
        | ! [X1] :
            ( ~ rf(X0,X1)
            | ( ~ cp(sK1(X1))
              & rinvS(X1,sK1(X1)) )
            | ( ! [X4] :
                  ( ~ rs(sK2(X1),X4)
                  | ~ cp(X4) )
              & rinvF(X1,sK2(X1)) ) )
        | cp(X0) )
      & ( ( rf(X0,sK3(X0))
          & ! [X6] :
              ( cp(X6)
              | ~ rinvS(sK3(X0),X6) )
          & ! [X7] :
              ( ( rs(X7,sK4(X7))
                & cp(sK4(X7)) )
              | ~ rinvF(sK3(X0),X7) )
          & ~ cp(X0) )
        | ~ sP0(X0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4]),skolemize(X2,sK1(X1)),skolemize(X3,sK2(X1)),skolemize(X5,sK3(X0)),skolemize(X8,sK4(X7))],[f82]) ).

fof(f84,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ~ sP0(X0) )
      & ( sP0(X0)
        | ~ cUnsatisfiable(X0) ) ),
    inference(nnf_transformation,[],[f78]) ).

fof(f85,plain,
    ! [X0,X1] :
      ( ( rinvF(X0,X1)
        | ~ rf(X1,X0) )
      & ( rf(X1,X0)
        | ~ rinvF(X0,X1) ) ),
    inference(nnf_transformation,[],[f24]) ).

fof(f87,plain,
    ! [X0,X1] :
      ( ( rinvS(X0,X1)
        | ~ rs(X1,X0) )
      & ( rs(X1,X0)
        | ~ rinvS(X0,X1) ) ),
    inference(nnf_transformation,[],[f26]) ).

fof(f110,plain,
    ! [X0] :
      ( ~ sP0(X0)
      | ~ cp(X0) ),
    inference(cnf_transformation,[],[f83]) ).

fof(f112,plain,
    ! [X0,X7] :
      ( ~ rinvF(sK3(X0),X7)
      | rs(X7,sK4(X7))
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f83]) ).

fof(f113,plain,
    ! [X0,X6] :
      ( ~ rinvS(sK3(X0),X6)
      | cp(X6)
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f83]) ).

fof(f114,plain,
    ! [X0] :
      ( rf(X0,sK3(X0))
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f83]) ).

fof(f119,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | sP0(X0) ),
    inference(cnf_transformation,[],[f84]) ).

fof(f121,plain,
    ! [X2,X0,X1] :
      ( ~ rf(X0,X2)
      | ~ rf(X0,X1)
      | X1 = X2 ),
    inference(cnf_transformation,[],[f70]) ).

fof(f124,plain,
    ! [X0,X1] :
      ( ~ rf(X1,X0)
      | rinvF(X0,X1) ),
    inference(cnf_transformation,[],[f85]) ).

fof(f128,plain,
    ! [X0,X1] :
      ( ~ rs(X1,X0)
      | rinvS(X0,X1) ),
    inference(cnf_transformation,[],[f87]) ).

fof(f130,plain,
    cUnsatisfiable(i2003_11_14_17_18_54369),
    inference(cnf_transformation,[],[f28]) ).

fof(f132,plain,
    ! [X0,X1] :
      ( ~ rs(X0,X1)
      | rf(X0,X1) ),
    inference(cnf_transformation,[],[f76]) ).

fof(f177,plain,
    sP0(i2003_11_14_17_18_54369),
    inference(resolution,[],[f119,f130]) ).

fof(f244,plain,
    ! [X0] :
      ( rinvF(sK3(X0),X0)
      | ~ sP0(X0) ),
    inference(resolution,[],[f114,f124]) ).

fof(f259,plain,
    ! [X0,X1] :
      ( ~ rf(X0,X1)
      | sK3(X0) = X1
      | ~ sP0(X0) ),
    inference(resolution,[],[f121,f114]) ).

fof(f364,plain,
    ! [X0] :
      ( rs(X0,sK4(X0))
      | ~ sP0(X0)
      | ~ sP0(X0) ),
    inference(resolution,[],[f112,f244]) ).

fof(f365,plain,
    ! [X0] :
      ( rs(X0,sK4(X0))
      | ~ sP0(X0) ),
    inference(duplicate_literal_removal,[],[f364]) ).

fof(f487,plain,
    ! [X0] :
      ( rf(X0,sK4(X0))
      | ~ sP0(X0) ),
    inference(resolution,[],[f365,f132]) ).

fof(f489,plain,
    ! [X0] :
      ( rinvS(sK4(X0),X0)
      | ~ sP0(X0) ),
    inference(resolution,[],[f365,f128]) ).

fof(f587,plain,
    ! [X0] :
      ( sK3(X0) = sK4(X0)
      | ~ sP0(X0)
      | ~ sP0(X0) ),
    inference(resolution,[],[f259,f487]) ).

fof(f588,plain,
    ! [X0] :
      ( ~ sP0(X0)
      | sK3(X0) = sK4(X0) ),
    inference(duplicate_literal_removal,[],[f587]) ).

fof(f590,plain,
    sK3(i2003_11_14_17_18_54369) = sK4(i2003_11_14_17_18_54369),
    inference(resolution,[],[f588,f177]) ).

fof(f595,plain,
    ( rinvS(sK3(i2003_11_14_17_18_54369),i2003_11_14_17_18_54369)
    | ~ sP0(i2003_11_14_17_18_54369) ),
    inference(superposition,[],[f489,f590]) ).

fof(f599,plain,
    rinvS(sK3(i2003_11_14_17_18_54369),i2003_11_14_17_18_54369),
    inference(forward_subsumption_resolution,[],[f595,f177]) ).

fof(f606,plain,
    ( cp(i2003_11_14_17_18_54369)
    | ~ sP0(i2003_11_14_17_18_54369) ),
    inference(resolution,[],[f599,f113]) ).

fof(f608,plain,
    ~ sP0(i2003_11_14_17_18_54369),
    inference(forward_subsumption_resolution,[],[f606,f110]) ).

fof(f609,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f608,f177]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS073+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.35  % Computer : n010.cluster.edu
% 0.11/0.35  % Model    : x86_64 x86_64
% 0.11/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35  % Memory   : 8046.5625MB
% 0.11/0.35  % OS       : Linux 6.8.0-71-generic
% 0.11/0.35  % CPULimit : 300
% 0.11/0.35  % WCLimit  : 300
% 0.11/0.35  % DateTime : Sun Sep 27 13:19:31 UTC 2026
% 0.11/0.35  % CPUTime  : 
% 0.11/0.35  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38  Running first-order model finding
% 0.13/0.38  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.42  % (965934)Will run a generic schedule for satisfiability detection.
% 0.13/0.42  % (965941)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1714375796:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.13/0.42  % (965940)% WARNING: option uhcvi not known.
% 0.13/0.42  % (965944)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2165965082:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.13/0.42  % (965939)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=908630086_2999 on theBenchmark for (2999ds/0Mi)
% 0.13/0.42  % (965940)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=573987098:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.13/0.42  % (965942)dis+10_1_sil=32000:sp=arity:random_seed=1575497479:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.13/0.42  % (965943)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2445355200:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/0.42  % (965941) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-965934-965941"...
% 0.13/0.42  % (965945)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4140952184:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.13/0.42  % (965941)...printing done.
% 0.13/0.42  % (965941)Refutation found. Thanks to Tanya!
% 0.13/0.42  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.42  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.42  % (965941)------------------------------
% 0.13/0.42  % (965941)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.42  % (965941)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.42  % (965941)CaDiCaL version: 2.1.3
% 0.13/0.42  % (965941)Termination reason: Refutation
% 0.13/0.42  % (965941)Time elapsed: 0.008 s
% 0.13/0.42  % (965941)Peak memory usage: 12 MB
% 0.13/0.42  % (965941)Instructions burned: 15 (million)
% 0.13/0.42  % (965934)Success in time 0.033 s
% 0.13/0.42  % Vampire exiting
%------------------------------------------------------------------------------