↑ 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  : SYN406+1 : TPTP v9.3.1. Released v2.0.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:07:46 PM UTC 2026

% Result   : Theorem 0.20s 0.27s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   5 unt;   0 def)
%            Number of atoms       :   45 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   49 (  17   ~;  10   |;  18   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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   :   19 (  12   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ( ! [X0] :
          ( f(X0)
         => g(X0) )
      & ? [X1] :
          ( f(X1)
          & h(X1) ) )
   => ? [X2] :
        ( g(X2)
        & h(X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish240) ).

fof(f2,negated_conjecture,
    ~ ( ( ! [X0] :
            ( f(X0)
           => g(X0) )
        & ? [X1] :
            ( f(X1)
            & h(X1) ) )
     => ? [X2] :
          ( g(X2)
          & h(X2) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

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

fof(f4,plain,
    ( ! [X2] :
        ( ~ g(X2)
        | ~ h(X2) )
    & ! [X0] :
        ( g(X0)
        | ~ f(X0) )
    & ? [X1] :
        ( f(X1)
        & h(X1) ) ),
    inference(flattening,[],[f3]) ).

fof(f5,plain,
    ( ! [X0] :
        ( ~ g(X0)
        | ~ h(X0) )
    & ! [X1] :
        ( g(X1)
        | ~ f(X1) )
    & ? [X2] :
        ( f(X2)
        & h(X2) ) ),
    inference(rectify,[],[f4]) ).

fof(f6,plain,
    ( ! [X0] :
        ( ~ g(X0)
        | ~ h(X0) )
    & ! [X1] :
        ( g(X1)
        | ~ f(X1) )
    & f(sK0)
    & h(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0)],[f5]) ).

fof(f7,plain,
    h(sK0),
    inference(cnf_transformation,[],[f6]) ).

fof(f8,plain,
    f(sK0),
    inference(cnf_transformation,[],[f6]) ).

fof(f9,plain,
    ! [X1] :
      ( ~ f(X1)
      | g(X1) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f10,plain,
    ! [X0] :
      ( ~ h(X0)
      | ~ g(X0) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f19,plain,
    ~ g(sK0),
    inference(resolution,[],[f7,f10]) ).

fof(f29,plain,
    g(sK0),
    inference(resolution,[],[f9,f8]) ).

fof(f30,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f29,f19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN406+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20  % Computer : n026.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Mon Sep 28 15:57:27 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23  Running first-order model finding
% 0.08/0.23  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.20/0.27  % (3975778)Will run a generic schedule for satisfiability detection.
% 0.20/0.27  % (3975785)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1244328461:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27  % (3975785) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3975778-3975785"...
% 0.20/0.27  % (3975785)...printing done.
% 0.20/0.27  % (3975785)Refutation found. Thanks to Tanya!
% 0.20/0.27  % SZS status Theorem for theBenchmark
% 0.20/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27  % (3975785)------------------------------
% 0.20/0.27  % (3975785)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27  % (3975785)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27  % (3975785)CaDiCaL version: 2.1.3
% 0.20/0.27  % (3975785)Termination reason: Refutation
% 0.20/0.27  % (3975785)Time elapsed: 0.001 s
% 0.20/0.27  % (3975785)Peak memory usage: 11 MB
% 0.20/0.27  % (3975778)Success in time 0.034 s
% 0.20/0.27  % Vampire exiting
%------------------------------------------------------------------------------