↑ 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  : KRS100+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 : n004.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:16 AM UTC 2026

% Result   : Unsatisfiable 0.11s 0.45s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   47 (  10 unt;   4 def)
%            Number of atoms       :  133 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  138 (  52   ~;  55   |;  18   &)
%                                         (   6 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   5 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   39 (   0 sgn  34   !;   5   ?)

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

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

fof(f6,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ! [X1] :
            ( rr(X0,X1)
           => ( ce(X1)
              | ~ cd(X1) ) )
        & ! [X2] :
            ( rr(X0,X2)
           => cd(X2) )
        & ? [X3] :
            ( rr(X0,X3)
            & ~ ce(X3) ) ) ),
    inference(rectify,[],[f3]) ).

fof(f7,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
     => ( ! [X1] :
            ( rr(X0,X1)
           => ( ce(X1)
              | ~ cd(X1) ) )
        & ! [X2] :
            ( rr(X0,X2)
           => cd(X2) )
        & ? [X3] :
            ( rr(X0,X3)
            & ~ ce(X3) ) ) ),
    inference(unused_predicate_definition_removal,[],[f6]) ).

fof(f11,plain,
    ! [X0] :
      ( ( ! [X1] :
            ( ce(X1)
            | ~ cd(X1)
            | ~ rr(X0,X1) )
        & ! [X2] :
            ( cd(X2)
            | ~ rr(X0,X2) )
        & ? [X3] :
            ( rr(X0,X3)
            & ~ ce(X3) ) )
      | ~ cUnsatisfiable(X0) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f12,plain,
    ! [X0] :
      ( ( ! [X1] :
            ( ce(X1)
            | ~ cd(X1)
            | ~ rr(X0,X1) )
        & ! [X2] :
            ( cd(X2)
            | ~ rr(X0,X2) )
        & ? [X3] :
            ( rr(X0,X3)
            & ~ ce(X3) ) )
      | ~ cUnsatisfiable(X0) ),
    inference(flattening,[],[f11]) ).

fof(f13,plain,
    ! [X0] :
      ( ( ! [X1] :
            ( ce(X1)
            | ~ cd(X1)
            | ~ rr(X0,X1) )
        & ! [X2] :
            ( cd(X2)
            | ~ rr(X0,X2) )
        & rr(X0,sK0(X0))
        & ~ ce(sK0(X0)) )
      | ~ cUnsatisfiable(X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0))],[f12]) ).

fof(f14,plain,
    ! [X0] :
      ( ~ ce(sK0(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f15,plain,
    ! [X0] :
      ( rr(X0,sK0(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f16,plain,
    ! [X2,X0] :
      ( cd(X2)
      | ~ rr(X0,X2)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( ce(X1)
      | ~ cd(X1)
      | ~ rr(X0,X1)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f18,plain,
    cUnsatisfiable(i2003_11_14_17_20_32704),
    inference(cnf_transformation,[],[f5]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( cd(X1)
      | ~ ce(X1)
      | rr(X0,X1)
      | cUnsatisfiable(X0) ),
    inference(consistent_polarity_flipping,[],[f17]) ).

fof(f20,plain,
    ! [X2,X0] :
      ( cUnsatisfiable(X0)
      | rr(X0,X2)
      | ~ cd(X2) ),
    inference(consistent_polarity_flipping,[],[f16]) ).

fof(f21,plain,
    ! [X0] :
      ( ~ rr(X0,sK0(X0))
      | cUnsatisfiable(X0) ),
    inference(consistent_polarity_flipping,[],[f15]) ).

fof(f22,plain,
    ! [X0] :
      ( ce(sK0(X0))
      | cUnsatisfiable(X0) ),
    inference(consistent_polarity_flipping,[],[f14]) ).

fof(f23,plain,
    ~ cUnsatisfiable(i2003_11_14_17_20_32704),
    inference(consistent_polarity_flipping,[],[f18]) ).

fof(f24,plain,
    ! [X0] :
      ( rr(i2003_11_14_17_20_32704,X0)
      | ~ cd(X0) ),
    inference(resolution,[],[f20,f23]) ).

fof(f25,plain,
    ( ~ cd(sK0(i2003_11_14_17_20_32704))
    | cUnsatisfiable(i2003_11_14_17_20_32704) ),
    inference(resolution,[],[f24,f21]) ).

fof(f27,definition,
    ( spl1_1
  <=> cUnsatisfiable(i2003_11_14_17_20_32704) ),
    introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).

fof(f29,plain,
    ( cUnsatisfiable(i2003_11_14_17_20_32704)
    | ~ spl1_1 ),
    inference(avatar_component_clause,[],[f27]) ).

fof(f31,definition,
    ( spl1_2
  <=> cd(sK0(i2003_11_14_17_20_32704)) ),
    introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).

fof(f33,plain,
    ( ~ cd(sK0(i2003_11_14_17_20_32704))
    | spl1_2 ),
    inference(avatar_component_clause,[],[f31]) ).

fof(f34,plain,
    ( spl1_1
    | ~ spl1_2 ),
    inference(avatar_split_clause,[],[f25,f31,f27]) ).

fof(f35,plain,
    ( ! [X0] :
        ( ~ ce(sK0(i2003_11_14_17_20_32704))
        | rr(X0,sK0(i2003_11_14_17_20_32704))
        | cUnsatisfiable(X0) )
    | spl1_2 ),
    inference(resolution,[],[f19,f33]) ).

fof(f37,definition,
    ( spl1_3
  <=> ! [X0] :
        ( rr(X0,sK0(i2003_11_14_17_20_32704))
        | cUnsatisfiable(X0) ) ),
    introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).

fof(f38,plain,
    ( ! [X0] :
        ( rr(X0,sK0(i2003_11_14_17_20_32704))
        | cUnsatisfiable(X0) )
    | ~ spl1_3 ),
    inference(avatar_component_clause,[],[f37]) ).

fof(f40,definition,
    ( spl1_4
  <=> ce(sK0(i2003_11_14_17_20_32704)) ),
    introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).

fof(f42,plain,
    ( ~ ce(sK0(i2003_11_14_17_20_32704))
    | spl1_4 ),
    inference(avatar_component_clause,[],[f40]) ).

fof(f43,plain,
    ( spl1_3
    | ~ spl1_4
    | spl1_2 ),
    inference(avatar_split_clause,[],[f35,f31,f40,f37]) ).

fof(f44,plain,
    ( cUnsatisfiable(i2003_11_14_17_20_32704)
    | spl1_4 ),
    inference(resolution,[],[f42,f22]) ).

fof(f45,plain,
    ( spl1_1
    | spl1_4 ),
    inference(avatar_split_clause,[],[f44,f40,f27]) ).

fof(f46,plain,
    ( cUnsatisfiable(i2003_11_14_17_20_32704)
    | cUnsatisfiable(i2003_11_14_17_20_32704)
    | ~ spl1_3 ),
    inference(resolution,[],[f38,f21]) ).

fof(f47,plain,
    ( cUnsatisfiable(i2003_11_14_17_20_32704)
    | ~ spl1_3 ),
    inference(duplicate_literal_removal,[],[f46]) ).

fof(f48,plain,
    ( spl1_1
    | ~ spl1_3 ),
    inference(avatar_split_clause,[],[f47,f37,f27]) ).

fof(f49,plain,
    ( $false
    | ~ spl1_1 ),
    inference(resolution,[],[f29,f23]) ).

fof(f50,plain,
    ~ spl1_1,
    inference(avatar_contradiction_clause,[],[f49]) ).

cnf(s1,plain,
    ( spl1_1
    | ~ spl1_2 ),
    inference(sat_conversion,[],[f34]) ).

cnf(s2,plain,
    ( spl1_2
    | spl1_3
    | ~ spl1_4 ),
    inference(sat_conversion,[],[f43]) ).

cnf(s3,plain,
    ( spl1_1
    | spl1_4 ),
    inference(sat_conversion,[],[f45]) ).

cnf(s4,plain,
    ( spl1_1
    | ~ spl1_3 ),
    inference(sat_conversion,[],[f48]) ).

cnf(s5,plain,
    ~ spl1_1,
    inference(sat_conversion,[],[f50]) ).

cnf(s6,plain,
    ~ spl1_3,
    inference(rat,[],[s4,s5]) ).

cnf(s7,plain,
    spl1_4,
    inference(rat,[],[s3,s5]) ).

cnf(s8,plain,
    spl1_2,
    inference(rat,[],[s2,s7,s6]) ).

cnf(s9,plain,
    $false,
    inference(rat,[],[s1,s8,s5]) ).

fof(f51,plain,
    $false,
    inference(avatar_sat_refutation,[],[s9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS100+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.38  % Computer : n004.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 13:22:37 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41  Running first-order model finding
% 0.11/0.41  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.11/0.45  % (3525974)Will run a generic schedule for satisfiability detection.
% 0.11/0.45  % (3525985)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=980638314:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45  % (3525985) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3525974-3525985"...
% 0.11/0.45  % (3525985)...printing done.
% 0.11/0.45  % (3525980)% WARNING: option uhcvi not known.
% 0.11/0.45  % (3525985)Refutation found. Thanks to Tanya!
% 0.11/0.45  % SZS status Unsatisfiable for theBenchmark
% 0.11/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45  % (3525985)------------------------------
% 0.11/0.45  % (3525985)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45  % (3525985)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45  % (3525985)CaDiCaL version: 2.1.3
% 0.11/0.45  % (3525985)Termination reason: Refutation
% 0.11/0.45  % (3525985)Time elapsed: 0.001 s
% 0.11/0.45  % (3525985)Peak memory usage: 12 MB
% 0.11/0.45  % (3525985)Instructions burned: 1 (million)
% 0.11/0.45  % (3525974)Success in time 0.031 s
% 0.11/0.45  % Vampire exiting
%------------------------------------------------------------------------------