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

% Computer : n020.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:28 PM UTC 2026

% Result   : Theorem 0.20s 0.27s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   5 unt;   0 def)
%            Number of atoms       :   51 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   61 (  24   ~;  10   |;  18   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   54 (  39   !;  15   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ( ? [X0] :
        ! [X1] : big_p(X1,X0)
      & ! [X1] :
          ( big_s(X1)
         => ? [X2] : big_q(X2,X1) )
      & ! [X1,X2] :
          ( big_p(X1,X2)
         => ~ big_q(X1,X2) ) )
   => ? [X3] : ~ big_s(X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2112) ).

fof(f2,negated_conjecture,
    ~ ( ( ? [X0] :
          ! [X1] : big_p(X1,X0)
        & ! [X1] :
            ( big_s(X1)
           => ? [X2] : big_q(X2,X1) )
        & ! [X1,X2] :
            ( big_p(X1,X2)
           => ~ big_q(X1,X2) ) )
     => ? [X3] : ~ big_s(X3) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ~ ( ( ? [X0] :
          ! [X1] : big_p(X1,X0)
        & ! [X2] :
            ( big_s(X2)
           => ? [X3] : big_q(X3,X2) )
        & ! [X4,X5] :
            ( big_p(X4,X5)
           => ~ big_q(X4,X5) ) )
     => ? [X6] : ~ big_s(X6) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ( ! [X6] : big_s(X6)
    & ? [X0] :
      ! [X1] : big_p(X1,X0)
    & ! [X2] :
        ( ? [X3] : big_q(X3,X2)
        | ~ big_s(X2) )
    & ! [X4,X5] :
        ( ~ big_q(X4,X5)
        | ~ big_p(X4,X5) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ! [X6] : big_s(X6)
    & ? [X0] :
      ! [X1] : big_p(X1,X0)
    & ! [X2] :
        ( ? [X3] : big_q(X3,X2)
        | ~ big_s(X2) )
    & ! [X4,X5] :
        ( ~ big_q(X4,X5)
        | ~ big_p(X4,X5) ) ),
    inference(flattening,[],[f4]) ).

fof(f6,plain,
    ( ! [X0] : big_s(X0)
    & ? [X1] :
      ! [X2] : big_p(X2,X1)
    & ! [X3] :
        ( ? [X4] : big_q(X4,X3)
        | ~ big_s(X3) )
    & ! [X5,X6] :
        ( ~ big_q(X5,X6)
        | ~ big_p(X5,X6) ) ),
    inference(rectify,[],[f5]) ).

fof(f7,plain,
    ( ! [X0] : big_s(X0)
    & ! [X2] : big_p(X2,sK0)
    & ! [X3] :
        ( big_q(sK1(X3),X3)
        | ~ big_s(X3) )
    & ! [X5,X6] :
        ( ~ big_q(X5,X6)
        | ~ big_p(X5,X6) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X1,sK0),skolemize(X4,sK1(X3))],[f6]) ).

fof(f8,plain,
    ! [X6,X5] :
      ( ~ big_q(X5,X6)
      | ~ big_p(X5,X6) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f9,plain,
    ! [X3] :
      ( ~ big_s(X3)
      | big_q(sK1(X3),X3) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f10,plain,
    ! [X2] : big_p(X2,sK0),
    inference(cnf_transformation,[],[f7]) ).

fof(f11,plain,
    ! [X0] : big_s(X0),
    inference(cnf_transformation,[],[f7]) ).

fof(f12,plain,
    ! [X0] : big_q(sK1(X0),X0),
    inference(resolution,[],[f9,f11]) ).

fof(f13,plain,
    ! [X0] : ~ big_p(sK1(X0),X0),
    inference(resolution,[],[f12,f8]) ).

fof(f14,plain,
    $false,
    inference(resolution,[],[f13,f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN361+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20  % Computer : n020.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:49:20 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23  Running first-order model finding
% 0.08/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.20/0.27  % (264511)Will run a generic schedule for satisfiability detection.
% 0.20/0.27  % (264521)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1310970470:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.27  % (264521) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-264511-264521"...
% 0.20/0.27  % (264521)...printing done.
% 0.20/0.27  % (264521)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  % (264521)------------------------------
% 0.20/0.27  % (264521)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27  % (264521)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27  % (264521)CaDiCaL version: 2.1.3
% 0.20/0.27  % (264521)Termination reason: Refutation
% 0.20/0.27  % (264521)Time elapsed: 0.001 s
% 0.20/0.27  % (264521)Peak memory usage: 11 MB
% 0.20/0.27  % (264511)Success in time 0.031 s
% 0.20/0.27  % Vampire exiting
%------------------------------------------------------------------------------