↑ 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  : SYN951+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n009.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.12s 0.24s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   3 unt;   0 def)
%            Number of atoms       :   60 (   0 equ)
%            Maximal formula atoms :    7 (   4 avg)
%            Number of connectives :   71 (  25   ~;  18   |;  17   &)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   4 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   18 (   8   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ? [X0] : p(X0)
   => ( ? [X0] : p(X0)
      & ( a
       => ( ( b
            | ~ b )
          & ( q
           => q ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ( ? [X0] : p(X0)
     => ( ? [X0] : p(X0)
        & ( a
         => ( ( b
              | ~ b )
            & ( q
             => q ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ~ ( ? [X0] : p(X0)
     => ( ? [X1] : p(X1)
        & ( a
         => ( ( b
              | ~ b )
            & ( q
             => q ) ) ) ) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ~ ( ? [X0] : p(X0)
     => ( ( b
          | ~ b )
        & ( q
         => q )
        & ? [X1] : p(X1) ) ),
    inference(pure_predicate_removal,[],[f3]) ).

fof(f5,plain,
    ( ( ( ~ b
        & b )
      | ( ~ q
        & q )
      | ! [X1] : ~ p(X1) )
    & ? [X0] : p(X0) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f6,plain,
    ( ( ( ~ b
        & b )
      | ( ~ q
        & q )
      | ! [X0] : ~ p(X0) )
    & ? [X1] : p(X1) ),
    inference(rectify,[],[f5]) ).

fof(f7,plain,
    ( ( ( ~ b
        & b )
      | ( ~ q
        & q )
      | ! [X0] : ~ p(X0) )
    & p(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0)],[f6]) ).

fof(f8,plain,
    p(sK0),
    inference(cnf_transformation,[],[f7]) ).

fof(f9,plain,
    ! [X0] :
      ( b
      | q
      | ~ p(X0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f10,plain,
    ! [X0] :
      ( b
      | ~ q
      | ~ p(X0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f11,plain,
    ! [X0] :
      ( ~ b
      | q
      | ~ p(X0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f12,plain,
    ! [X0] :
      ( ~ b
      | ~ q
      | ~ p(X0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f14,plain,
    ! [X0] : ~ p(X0),
    inference(global_subsumption,[],[f12,f11,f10,f9]) ).

fof(f16,plain,
    $false,
    inference(resolution,[],[f14,f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN951+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.18  % Computer : n009.cluster.edu
% 0.12/0.18  % Model    : x86_64 x86_64
% 0.12/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.18  % Memory   : 8046.5625MB
% 0.12/0.18  % OS       : Linux 6.8.0-71-generic
% 0.12/0.18  % CPULimit : 300
% 0.12/0.18  % WCLimit  : 300
% 0.12/0.18  % DateTime : Mon Sep 28 17:16:30 UTC 2026
% 0.12/0.18  % CPUTime  : 
% 0.12/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.20  Running first-order model finding
% 0.12/0.21  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.24  % (3226039)Will run a generic schedule for satisfiability detection.
% 0.12/0.24  % (3226046)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2265731656:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.24  % (3226046) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3226039-3226046"...
% 0.12/0.24  % (3226046)...printing done.
% 0.12/0.24  % (3226046)Refutation found. Thanks to Tanya!
% 0.12/0.24  % SZS status Theorem for theBenchmark
% 0.12/0.24  % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.24  % (3226046)------------------------------
% 0.12/0.24  % (3226046)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.24  % (3226046)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.24  % (3226046)CaDiCaL version: 2.1.3
% 0.12/0.24  % (3226046)Termination reason: Refutation
% 0.12/0.24  % (3226046)Time elapsed: 0.001 s
% 0.12/0.24  % (3226046)Peak memory usage: 11 MB
% 0.12/0.24  % (3226039)Success in time 0.028 s
% 0.12/0.24  % Vampire exiting
%------------------------------------------------------------------------------