↑ 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  : SYN967+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 : n014.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:58 PM UTC 2026

% Result   : Theorem 0.19s 0.30s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   29 (   7 unt;   3 def)
%            Number of atoms       :   73 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   70 (  26   ~;  22   |;  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   :   23 (   0 sgn  17   !;   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(f10,plain,
    ( ~ p(sK0)
    | ~ p(sK1) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f11,plain,
    ! [X2] : p(X2),
    inference(forward_subsumption_resolution,[],[f7,f6]) ).

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

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

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

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

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

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

fof(f28,plain,
    ( ~ spl2_1
    | ~ spl2_4 ),
    inference(avatar_split_clause,[],[f10,f24,f13]) ).

fof(f29,plain,
    spl2_2,
    inference(avatar_split_clause,[],[f11,f17]) ).

fof(f30,plain,
    ( $false
    | ~ spl2_2
    | spl2_4 ),
    inference(forward_subsumption_resolution,[],[f26,f18]) ).

fof(f31,plain,
    ( ~ spl2_2
    | spl2_4 ),
    inference(avatar_contradiction_clause,[],[f30]) ).

fof(f32,plain,
    ( $false
    | spl2_1
    | ~ spl2_2 ),
    inference(forward_subsumption_resolution,[],[f15,f18]) ).

fof(f33,plain,
    ( spl2_1
    | ~ spl2_2 ),
    inference(avatar_contradiction_clause,[],[f32]) ).

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

cnf(s4,plain,
    spl2_2,
    inference(sat_conversion,[],[f29]) ).

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

cnf(s6,plain,
    ( spl2_1
    | ~ spl2_2 ),
    inference(sat_conversion,[],[f33]) ).

cnf(s7,plain,
    spl2_1,
    inference(rat,[],[s6,s4]) ).

cnf(s8,plain,
    spl2_4,
    inference(rat,[],[s5,s4]) ).

cnf(s9,plain,
    $false,
    inference(rat,[],[s3,s8,s7]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN967+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.22  % Computer : n014.cluster.edu
% 0.09/0.22  % Model    : x86_64 x86_64
% 0.09/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22  % Memory   : 8046.5625MB
% 0.09/0.22  % OS       : Linux 6.8.0-71-generic
% 0.09/0.22  % CPULimit : 300
% 0.09/0.22  % WCLimit  : 300
% 0.09/0.22  % DateTime : Mon Sep 28 17:16:46 UTC 2026
% 0.09/0.23  % CPUTime  : 
% 0.09/0.23  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.26  Running first-order model finding
% 0.09/0.26  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.19/0.30  % (1927345)Will run a generic schedule for satisfiability detection.
% 0.19/0.30  % (1927355)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=756233183:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.30  % (1927355) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1927345-1927355"...
% 0.19/0.30  % (1927355)...printing done.
% 0.19/0.30  % (1927355)Refutation found. Thanks to Tanya!
% 0.19/0.30  % SZS status Theorem for theBenchmark
% 0.19/0.30  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.30  % (1927355)------------------------------
% 0.19/0.30  % (1927355)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.30  % (1927355)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.30  % (1927355)CaDiCaL version: 2.1.3
% 0.19/0.30  % (1927355)Termination reason: Refutation
% 0.19/0.30  % (1927355)Time elapsed: 0.001 s
% 0.19/0.30  % (1927355)Peak memory usage: 12 MB
% 0.19/0.30  % (1927345)Success in time 0.034 s
% 0.19/0.30  % Vampire exiting
%------------------------------------------------------------------------------