↑ 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  : SYN732+1 : TPTP v9.3.1. Released v2.5.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:18:10 PM UTC 2026

% Result   : Theorem 0.19s 0.27s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   6 unt;   0 def)
%            Number of atoms       :   35 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   36 (  14   ~;   7   |;   9   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   0 con; 1-1 aty)
%            Number of variables   :   40 (  30   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ! [X0] :
        ( ! [X1] : p(X1,X0)
       => ! [X2] : q(X2,X0) )
   => ? [X3] :
        ( ? [X4] : p(X4,X3)
       => ? [X5] :
            ( p(X3,X5)
            | q(X5,X3) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x3411) ).

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

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

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

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

fof(f6,plain,
    ! [X3,X4] :
      ( q(X4,X3)
      | ~ p(sK1(X3),X3) ),
    inference(cnf_transformation,[],[f5]) ).

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

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

fof(f9,plain,
    ! [X0,X1] : ~ p(X0,X1),
    inference(cnf_transformation,[],[f5]) ).

fof(f10,plain,
    ! [X0,X1] : p(X0,X1),
    inference(consistent_polarity_flipping,[],[f9]) ).

fof(f11,plain,
    ! [X0] : ~ p(sK0(X0),X0),
    inference(consistent_polarity_flipping,[],[f7]) ).

fof(f12,plain,
    ! [X3,X4] :
      ( q(X4,X3)
      | p(sK1(X3),X3) ),
    inference(consistent_polarity_flipping,[],[f6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN732+1 : TPTP v9.3.1. Released v2.5.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 16:45:21 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.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.19/0.27  % (3701040)Will run a generic schedule for satisfiability detection.
% 0.19/0.27  % (3701045)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2903330127_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.27  % TRYING [1]
% 0.19/0.27  % TRYING [2]
% 0.19/0.27  % (3701045) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3701040-3701045"...
% 0.19/0.27  % (3701045)...printing done.
% 0.19/0.27  % (3701045)Refutation found. Thanks to Tanya!
% 0.19/0.27  % SZS status Theorem for theBenchmark
% 0.19/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27  % (3701045)------------------------------
% 0.19/0.27  % (3701045)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27  % (3701045)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27  % (3701045)CaDiCaL version: 2.1.3
% 0.19/0.27  % (3701045)Termination reason: Refutation
% 0.19/0.27  % (3701045)Time elapsed: 0.001 s
% 0.19/0.27  % (3701045)Peak memory usage: 11 MB
% 0.19/0.27  % (3701045)Instructions burned: 1 (million)
% 0.19/0.27  % (3701040)Success in time 0.033 s
% 0.19/0.27  % Vampire exiting
%------------------------------------------------------------------------------