↑ 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  : SYN969+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 : n019.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.12s 0.24s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   6 unt;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   36 (  12   ~;   8   |;   8   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   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   :   16 (  14   !;   2   ?)

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

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

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

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

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

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

fof(f7,plain,
    r(sK0),
    inference(cnf_transformation,[],[f4]) ).

fof(f8,plain,
    ~ q(sK0),
    inference(cnf_transformation,[],[f4]) ).

fof(f9,plain,
    ~ r(sK0),
    inference(consistent_polarity_flipping,[],[f7]) ).

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

fof(f11,plain,
    ! [X2] :
      ( ~ p(X2)
      | r(X2) ),
    inference(consistent_polarity_flipping,[],[f5]) ).

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

fof(f13,plain,
    r(sK0),
    inference(resolution,[],[f12,f11]) ).

fof(f14,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f13,f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN969+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.17  % Computer : n019.cluster.edu
% 0.12/0.17  % Model    : x86_64 x86_64
% 0.12/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.17  % Memory   : 8046.5625MB
% 0.12/0.17  % OS       : Linux 6.8.0-71-generic
% 0.12/0.17  % CPULimit : 300
% 0.12/0.17  % WCLimit  : 300
% 0.12/0.17  % DateTime : Mon Sep 28 17:18:03 UTC 2026
% 0.12/0.17  % CPUTime  : 
% 0.12/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.20  Running first-order model finding
% 0.12/0.20  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.12/0.24  % (4169046)Will run a generic schedule for satisfiability detection.
% 0.12/0.24  % (4169052)% WARNING: option uhcvi not known.
% 0.12/0.24  % (4169052)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4279798625:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.24  % (4169052) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4169046-4169052"...
% 0.12/0.24  % (4169052)...printing done.
% 0.12/0.24  % (4169052)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  % (4169052)------------------------------
% 0.12/0.24  % (4169052)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.24  % (4169052)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.24  % (4169052)CaDiCaL version: 2.1.3
% 0.12/0.24  % (4169052)Termination reason: Refutation
% 0.12/0.24  % (4169052)Time elapsed: 0.001 s
% 0.12/0.24  % (4169052)Peak memory usage: 11 MB
% 0.12/0.24  % (4169046)Success in time 0.03 s
% 0.12/0.24  % Vampire exiting
%------------------------------------------------------------------------------