↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SYN950+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 : 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 02:22:56 PM UTC 2026

% Result   : Theorem 0.09s 0.27s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   33 (   6 unt;   3 def)
%            Number of atoms       :   81 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   78 (  30   ~;  26   |;  11   &)
%                                         (   3 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   4 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   25 (   0 sgn  19   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ! [X0,X1] :
      ( ! [X2] :
          ( q(X2)
         => p(X2) )
     => ? [X3] :
          ( ( p(X3)
           => p(X0) )
          & ( q(X3)
           => p(X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ! [X0,X1] :
        ( ! [X2] :
            ( q(X2)
           => p(X2) )
       => ? [X3] :
            ( ( p(X3)
             => p(X0) )
            & ( q(X3)
             => p(X1) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ? [X0,X1] :
      ( ! [X3] :
          ( ( ~ p(X0)
            & p(X3) )
          | ( ~ p(X1)
            & q(X3) ) )
      & ! [X2] :
          ( p(X2)
          | ~ q(X2) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ? [X0,X1] :
      ( ! [X2] :
          ( ( ~ p(X0)
            & p(X2) )
          | ( ~ p(X1)
            & q(X2) ) )
      & ! [X3] :
          ( p(X3)
          | ~ q(X3) ) ),
    inference(rectify,[],[f3]) ).

fof(f5,plain,
    ( ! [X2] :
        ( ( ~ p(sK0)
          & p(X2) )
        | ( ~ p(sK1)
          & q(X2) ) )
    & ! [X3] :
        ( p(X3)
        | ~ q(X3) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f4]) ).

fof(f6,plain,
    ! [X3] :
      ( p(X3)
      | ~ q(X3) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f7,plain,
    ! [X2] :
      ( p(X2)
      | q(X2) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f8,plain,
    ! [X2] :
      ( p(X2)
      | ~ p(sK1) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f10,plain,
    ( ~ p(sK0)
    | ~ p(sK1) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f12,plain,
    ! [X2] :
      ( p(X2)
      | ~ q(X2) ),
    inference(consistent_polarity_flipping,[],[f7]) ).

fof(f13,plain,
    ! [X3] :
      ( p(X3)
      | q(X3) ),
    inference(consistent_polarity_flipping,[],[f6]) ).

fof(f15,definition,
    ( spl2_1
  <=> p(sK1) ),
    introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).

fof(f17,plain,
    ( ~ p(sK1)
    | spl2_1 ),
    inference(avatar_component_clause,[],[f15]) ).

fof(f19,definition,
    ( spl2_2
  <=> ! [X2] : p(X2) ),
    introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).

fof(f20,plain,
    ( ! [X2] : p(X2)
    | ~ spl2_2 ),
    inference(avatar_component_clause,[],[f19]) ).

fof(f21,plain,
    ( ~ spl2_1
    | spl2_2 ),
    inference(avatar_split_clause,[],[f8,f19,f15]) ).

fof(f26,definition,
    ( spl2_4
  <=> p(sK0) ),
    introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).

fof(f28,plain,
    ( ~ p(sK0)
    | spl2_4 ),
    inference(avatar_component_clause,[],[f26]) ).

fof(f30,plain,
    ( ~ spl2_1
    | ~ spl2_4 ),
    inference(avatar_split_clause,[],[f10,f26,f15]) ).

fof(f31,plain,
    ( ~ q(sK1)
    | spl2_1 ),
    inference(resolution,[],[f12,f17]) ).

fof(f33,plain,
    ( q(sK1)
    | spl2_1 ),
    inference(resolution,[],[f13,f17]) ).

fof(f35,plain,
    ( $false
    | spl2_1 ),
    inference(resolution,[],[f33,f31]) ).

fof(f36,plain,
    spl2_1,
    inference(avatar_contradiction_clause,[],[f35]) ).

fof(f37,plain,
    ( $false
    | ~ spl2_2
    | spl2_4 ),
    inference(resolution,[],[f20,f28]) ).

fof(f38,plain,
    ( ~ spl2_2
    | spl2_4 ),
    inference(avatar_contradiction_clause,[],[f37]) ).

cnf(s1,plain,
    ( ~ spl2_1
    | spl2_2 ),
    inference(sat_conversion,[],[f21]) ).

cnf(s3,plain,
    ( ~ spl2_1
    | ~ spl2_4 ),
    inference(sat_conversion,[],[f30]) ).

cnf(s4,plain,
    spl2_1,
    inference(sat_conversion,[],[f36]) ).

cnf(s5,plain,
    ( ~ spl2_2
    | spl2_4 ),
    inference(sat_conversion,[],[f38]) ).

cnf(s6,plain,
    ~ spl2_4,
    inference(rat,[],[s3,s4]) ).

cnf(s7,plain,
    ~ spl2_2,
    inference(rat,[],[s5,s6]) ).

cnf(s8,plain,
    $false,
    inference(rat,[],[s1,s7,s4]) ).

fof(f39,plain,
    $false,
    inference(avatar_sat_refutation,[],[s8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN950+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20  % Computer : n018.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Mon Sep 28 17:18:25 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23  Running first-order model finding
% 0.09/0.23  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.09/0.27  % (3551093)Will run a generic schedule for satisfiability detection.
% 0.09/0.27  % (3551104)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3502159832:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.27  % (3551104) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3551093-3551104"...
% 0.09/0.27  % (3551104)...printing done.
% 0.09/0.27  % (3551104)Refutation found. Thanks to Tanya!
% 0.09/0.27  % SZS status Theorem for theBenchmark
% 0.09/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.27  % (3551104)------------------------------
% 0.09/0.27  % (3551104)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.27  % (3551104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.27  % (3551104)CaDiCaL version: 2.1.3
% 0.09/0.27  % (3551104)Termination reason: Refutation
% 0.09/0.27  % (3551104)Time elapsed: 0.001 s
% 0.09/0.27  % (3551104)Peak memory usage: 12 MB
% 0.09/0.27  % (3551104)Instructions burned: 1 (million)
% 0.09/0.27  % (3551093)Success in time 0.031 s
% 0.09/0.27  % Vampire exiting
%------------------------------------------------------------------------------