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

% Computer : n003.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:18:11 PM UTC 2026

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

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

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

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

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

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

fof(f6,plain,
    ! [X1] :
      ( q(sK0(X1))
      | q(X1) ),
    inference(cnf_transformation,[],[f5]) ).

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

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

fof(f9,plain,
    ! [X0] : ~ q(X0),
    inference(forward_subsumption_resolution,[],[f8,f7]) ).

fof(f10,plain,
    ! [X1] : q(X1),
    inference(forward_subsumption_resolution,[],[f6,f9]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN733+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n003.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Mon Sep 28 16:52:13 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  Running first-order model finding
% 0.09/0.23  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.09/0.25  % (1746792)Will run a generic schedule for satisfiability detection.
% 0.09/0.25  % (1746800)dis+10_1_sil=32000:sp=arity:random_seed=3836412124:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.09/0.25  % (1746800) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1746792-1746800"...
% 0.09/0.25  % (1746800)...printing done.
% 0.09/0.25  % (1746800)Refutation found. Thanks to Tanya!
% 0.09/0.25  % SZS status Theorem for theBenchmark
% 0.09/0.25  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25  % (1746800)------------------------------
% 0.09/0.25  % (1746800)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25  % (1746800)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25  % (1746800)CaDiCaL version: 2.1.3
% 0.09/0.25  % (1746800)Termination reason: Refutation
% 0.09/0.25  % (1746800)Time elapsed: 0.0000 s
% 0.09/0.25  % (1746800)Peak memory usage: 11 MB
% 0.09/0.25  % (1746792)Success in time 0.014 s
% 0.09/0.25  % Vampire exiting
%------------------------------------------------------------------------------