↑ 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  : SYN411+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 : n018.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.09s 0.24s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   11 (   1 unt;   0 def)
%            Number of atoms       :   27 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   31 (  15   ~;  10   |;   3   &)
%                                         (   2 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    9 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   60 (  42   !;  18   ?)

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

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

fof(f3,plain,
    ( ! [X0,X1,X2] : f(X0,X1,X2)
  <~> ! [X3,X4,X5] : f(X3,X4,X5) ),
    inference(ennf_transformation,[],[f2]) ).

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

fof(f5,plain,
    ( ( ? [X0,X1,X2] : ~ f(X0,X1,X2)
      | ? [X3,X4,X5] : ~ f(X3,X4,X5) )
    & ( ! [X6,X7,X8] : f(X6,X7,X8)
      | ! [X9,X10,X11] : f(X9,X10,X11) ) ),
    inference(rectify,[],[f4]) ).

fof(f6,plain,
    ( ( ~ f(sK0,sK1,sK2)
      | ~ f(sK3,sK4,sK5) )
    & ( ! [X6,X7,X8] : f(X6,X7,X8)
      | ! [X9,X10,X11] : f(X9,X10,X11) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f5]) ).

fof(f7,plain,
    ! [X10,X11,X8,X6,X9,X7] :
      ( f(X6,X7,X8)
      | f(X9,X10,X11) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f8,plain,
    ( ~ f(sK0,sK1,sK2)
    | ~ f(sK3,sK4,sK5) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f9,plain,
    ( f(sK0,sK1,sK2)
    | f(sK3,sK4,sK5) ),
    inference(consistent_polarity_flipping,[],[f8]) ).

fof(f10,plain,
    ! [X10,X11,X8,X6,X9,X7] :
      ( ~ f(X6,X7,X8)
      | ~ f(X9,X10,X11) ),
    inference(consistent_polarity_flipping,[],[f7]) ).

fof(f24,plain,
    $false,
    inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f9,f10]) ).

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