↑ 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  : SYN947+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 : n026.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:55 PM UTC 2026

% Result   : Theorem 0.07s 0.28s
% Output   : Refutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   11 (   3 unt;   0 def)
%            Number of atoms       :   26 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   23 (   8   ~;   3   |;   7   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   28 (  15   !;  13   ?)

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

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

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

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

fof(f5,plain,
    ~ ( ! [X0] :
        ? [X1] : p(X0)
     => ? [X2] :
        ! [X3] : p(X3) ),
    inference(pure_predicate_removal,[],[f4]) ).

fof(f6,plain,
    ( ! [X2] :
      ? [X3] : ~ p(X3)
    & ! [X0] :
      ? [X1] : p(X0) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f7,plain,
    ( ? [X1] : ~ p(X1)
    & ! [X2] : p(X2) ),
    inference(rectify,[],[f6]) ).

fof(f8,plain,
    ( ~ p(sK0)
    & ! [X2] : p(X2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0)],[f7]) ).

fof(f9,plain,
    ! [X2] : p(X2),
    inference(cnf_transformation,[],[f8]) ).

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

fof(f11,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f10,f9]) ).

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