↑ 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  : SYN369+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 : n015.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:30 PM UTC 2026

% Result   : Theorem 0.21s 0.28s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   3 unt;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   19 (   7   ~;   7   |;   3   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :   32 (  28   !;   4   ?)

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

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

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

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

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

fof(f6,plain,
    ! [X2,X3,X4] :
      ( big_p(X2,X3)
      | big_p(X3,X4) ),
    inference(cnf_transformation,[],[f5]) ).

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

fof(f8,plain,
    ! [X0] : big_p(X0,sK0(X0)),
    inference(consistent_polarity_flipping,[],[f7]) ).

fof(f9,plain,
    ! [X2,X3,X4] :
      ( ~ big_p(X2,X3)
      | ~ big_p(X3,X4) ),
    inference(consistent_polarity_flipping,[],[f6]) ).

fof(f13,plain,
    $false,
    inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f8,f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN369+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20  % Computer : n015.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Mon Sep 28 15:53:49 UTC 2026
% 0.09/0.21  % CPUTime  : 
% 0.09/0.21  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24  Running first-order model finding
% 0.09/0.24  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.21/0.28  % (2743370)Will run a generic schedule for satisfiability detection.
% 0.21/0.28  % (2743375)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=31716607_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.28  % TRYING [1]
% 0.21/0.28  % TRYING [2]
% 0.21/0.28  % TRYING [3]
% 0.21/0.28  % (2743375) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2743370-2743375"...
% 0.21/0.28  % (2743375)...printing done.
% 0.21/0.28  % (2743375)Refutation found. Thanks to Tanya!
% 0.21/0.28  % SZS status Theorem for theBenchmark
% 0.21/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28  % (2743375)------------------------------
% 0.21/0.28  % (2743375)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28  % (2743375)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28  % (2743375)CaDiCaL version: 2.1.3
% 0.21/0.28  % (2743375)Termination reason: Refutation
% 0.21/0.28  % (2743375)Time elapsed: 0.001 s
% 0.21/0.28  % (2743375)Peak memory usage: 11 MB
% 0.21/0.28  % (2743375)Instructions burned: 1 (million)
% 0.21/0.28  % (2743370)Success in time 0.032 s
% 0.21/0.28  % Vampire exiting
%------------------------------------------------------------------------------