↑ 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  : SYN953+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 : n017.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.07s 0.24s
% Output   : Refutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   5 unt;   0 def)
%            Number of atoms       :   37 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   36 (  13   ~;   6   |;   8   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   24 (  21   !;   3   ?)

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

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

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

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

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

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

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

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

fof(f9,plain,
    ! [X1] : p(X1),
    inference(cnf_transformation,[],[f7]) ).

fof(f10,plain,
    ~ q(sK0),
    inference(cnf_transformation,[],[f7]) ).

fof(f11,plain,
    ! [X1] : ~ p(X1),
    inference(consistent_polarity_flipping,[],[f9]) ).

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

fof(f13,plain,
    p(sK0),
    inference(resolution,[],[f12,f10]) ).

fof(f14,plain,
    $false,
    inference(resolution,[],[f13,f11]) ).

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