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

% Computer : n007.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:55 PM UTC 2026

% Result   : Theorem 0.09s 0.26s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   6 unt;   0 def)
%            Number of atoms       :   75 (   0 equ)
%            Maximal formula atoms :    9 (   4 avg)
%            Number of connectives :   82 (  23   ~;  15   |;  35   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   59 (  44   !;  15   ?)

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

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

fof(f3,plain,
    ~ ! [X0,X1,X2] :
        ( ( s(X0)
          & s(X1)
          & r(X1,X2)
          & ! [X3] :
              ( s(X3)
             => p(X3) )
          & ! [X4,X5] :
              ( r(X4,X5)
             => q(X4,X5) ) )
       => ? [X6,X7] :
            ( p(X6)
            & q(X6,X7) ) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ? [X0,X1,X2] :
      ( ! [X6,X7] :
          ( ~ p(X6)
          | ~ q(X6,X7) )
      & s(X0)
      & s(X1)
      & r(X1,X2)
      & ! [X3] :
          ( p(X3)
          | ~ s(X3) )
      & ! [X4,X5] :
          ( q(X4,X5)
          | ~ r(X4,X5) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ? [X0,X1,X2] :
      ( ! [X6,X7] :
          ( ~ p(X6)
          | ~ q(X6,X7) )
      & s(X0)
      & s(X1)
      & r(X1,X2)
      & ! [X3] :
          ( p(X3)
          | ~ s(X3) )
      & ! [X4,X5] :
          ( q(X4,X5)
          | ~ r(X4,X5) ) ),
    inference(flattening,[],[f4]) ).

fof(f6,plain,
    ? [X0,X1,X2] :
      ( ! [X3,X4] :
          ( ~ p(X3)
          | ~ q(X3,X4) )
      & s(X0)
      & s(X1)
      & r(X1,X2)
      & ! [X5] :
          ( p(X5)
          | ~ s(X5) )
      & ! [X6,X7] :
          ( q(X6,X7)
          | ~ r(X6,X7) ) ),
    inference(rectify,[],[f5]) ).

fof(f7,plain,
    ( ! [X3,X4] :
        ( ~ p(X3)
        | ~ q(X3,X4) )
    & s(sK0)
    & s(sK1)
    & r(sK1,sK2)
    & ! [X5] :
        ( p(X5)
        | ~ s(X5) )
    & ! [X6,X7] :
        ( q(X6,X7)
        | ~ r(X6,X7) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f6]) ).

fof(f8,plain,
    ! [X6,X7] :
      ( ~ r(X6,X7)
      | q(X6,X7) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f9,plain,
    ! [X5] :
      ( ~ s(X5)
      | p(X5) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f10,plain,
    r(sK1,sK2),
    inference(cnf_transformation,[],[f7]) ).

fof(f11,plain,
    s(sK1),
    inference(cnf_transformation,[],[f7]) ).

fof(f13,plain,
    ! [X3,X4] :
      ( ~ p(X3)
      | ~ q(X3,X4) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f14,plain,
    p(sK1),
    inference(resolution,[],[f9,f11]) ).

fof(f16,plain,
    ! [X0] : ~ q(sK1,X0),
    inference(resolution,[],[f13,f14]) ).

fof(f18,plain,
    q(sK1,sK2),
    inference(resolution,[],[f8,f10]) ).

fof(f19,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f18,f16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN944+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n007.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 17:13:31 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.22  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.26  % (2571078)Will run a generic schedule for satisfiability detection.
% 0.09/0.26  % (2571088)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=425999322:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.26  % (2571088) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2571078-2571088"...
% 0.09/0.26  % (2571088)...printing done.
% 0.09/0.26  % (2571084)% WARNING: option uhcvi not known.
% 0.09/0.26  % (2571088)Refutation found. Thanks to Tanya!
% 0.09/0.26  % SZS status Theorem for theBenchmark
% 0.09/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26  % (2571088)------------------------------
% 0.09/0.26  % (2571088)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26  % (2571088)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26  % (2571088)CaDiCaL version: 2.1.3
% 0.09/0.26  % (2571088)Termination reason: Refutation
% 0.09/0.26  % (2571088)Time elapsed: 0.001 s
% 0.09/0.26  % (2571088)Peak memory usage: 11 MB
% 0.09/0.26  % (2571078)Success in time 0.027 s
% 0.09/0.26  % Vampire exiting
%------------------------------------------------------------------------------