↑ 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  : SYN407+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 : 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:07:47 PM UTC 2026

% Result   : Theorem 0.08s 0.26s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   4 unt;   0 def)
%            Number of atoms       :   56 (   0 equ)
%            Maximal formula atoms :    7 (   4 avg)
%            Number of connectives :   65 (  23   ~;  22   |;  14   &)
%                                         (   0 <=>;   6  =>;   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   :   21 (  16   !;   5   ?)

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

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

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

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

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

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

fof(f7,plain,
    ! [X2] :
      ( g(X2)
      | h(X2)
      | ~ f(X2) ),
    inference(cnf_transformation,[],[f6]) ).

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

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

fof(f10,plain,
    ~ g(sK0),
    inference(cnf_transformation,[],[f6]) ).

fof(f11,plain,
    ~ f(sK0),
    inference(consistent_polarity_flipping,[],[f9]) ).

fof(f12,plain,
    ! [X0] :
      ( f(X0)
      | ~ h(X0) ),
    inference(consistent_polarity_flipping,[],[f8]) ).

fof(f13,plain,
    ! [X0] :
      ( g(X0)
      | h(X0)
      | f(X0) ),
    inference(consistent_polarity_flipping,[],[f7]) ).

fof(f16,plain,
    $false,
    inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f10,f11,f12,f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN407+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.19  % Computer : n017.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Mon Sep 28 15:49:51 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22  Running first-order model finding
% 0.08/0.22  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.08/0.26  % (3668182)Will run a generic schedule for satisfiability detection.
% 0.08/0.26  % (3668187)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=840332309_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.26  % Detected minimum model sizes of [1]
% 0.08/0.26  % Detected maximum model sizes of [1]
% 0.08/0.26  % TRYING [1]
% 0.08/0.26  % (3668187) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3668182-3668187"...
% 0.08/0.26  % (3668187)...printing done.
% 0.08/0.26  % (3668187)Refutation found. Thanks to Tanya!
% 0.08/0.26  % SZS status Theorem for theBenchmark
% 0.08/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26  % (3668187)------------------------------
% 0.08/0.26  % (3668187)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26  % (3668187)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26  % (3668187)CaDiCaL version: 2.1.3
% 0.08/0.26  % (3668187)Termination reason: Refutation
% 0.08/0.26  % (3668187)Time elapsed: 0.001 s
% 0.08/0.26  % (3668187)Peak memory usage: 11 MB
% 0.08/0.26  % (3668182)Success in time 0.025 s
% 0.08/0.26  % Vampire exiting
%------------------------------------------------------------------------------