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

% Computer : n010.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:57 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ! [X0,X1] :
      ( ! [X2] : p(X2)
     => ( p(X0)
        & p(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ! [X0,X1] :
        ( ! [X2] : p(X2)
       => ( p(X0)
          & p(X1) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

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

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

fof(f5,plain,
    ! [X2] : p(X2),
    inference(cnf_transformation,[],[f4]) ).

fof(f6,plain,
    ( ~ p(sK0)
    | ~ p(sK1) ),
    inference(cnf_transformation,[],[f4]) ).

fof(f8,definition,
    ( spl2_1
  <=> p(sK1) ),
    introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).

fof(f10,plain,
    ( ~ p(sK1)
    | spl2_1 ),
    inference(avatar_component_clause,[],[f8]) ).

fof(f12,definition,
    ( spl2_2
  <=> p(sK0) ),
    introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).

fof(f14,plain,
    ( ~ p(sK0)
    | spl2_2 ),
    inference(avatar_component_clause,[],[f12]) ).

fof(f15,plain,
    ( ~ spl2_1
    | ~ spl2_2 ),
    inference(avatar_split_clause,[],[f6,f12,f8]) ).

fof(f16,plain,
    ( $false
    | spl2_1 ),
    inference(resolution,[],[f10,f5]) ).

fof(f17,plain,
    spl2_1,
    inference(avatar_contradiction_clause,[],[f16]) ).

fof(f18,plain,
    ( $false
    | spl2_2 ),
    inference(resolution,[],[f14,f5]) ).

fof(f19,plain,
    spl2_2,
    inference(avatar_contradiction_clause,[],[f18]) ).

cnf(s1,plain,
    ( ~ spl2_1
    | ~ spl2_2 ),
    inference(sat_conversion,[],[f15]) ).

cnf(s2,plain,
    spl2_1,
    inference(sat_conversion,[],[f17]) ).

cnf(s3,plain,
    spl2_2,
    inference(sat_conversion,[],[f19]) ).

cnf(s4,plain,
    $false,
    inference(rat,[],[s1,s3,s2]) ).

fof(f20,plain,
    $false,
    inference(avatar_sat_refutation,[],[s4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN961+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.06/0.20  % Computer : n010.cluster.edu
% 0.06/0.20  % Model    : x86_64 x86_64
% 0.06/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.20  % Memory   : 8046.5625MB
% 0.06/0.20  % OS       : Linux 6.8.0-71-generic
% 0.06/0.20  % CPULimit : 300
% 0.06/0.20  % WCLimit  : 300
% 0.06/0.20  % DateTime : Mon Sep 28 17:17:18 UTC 2026
% 0.06/0.20  % CPUTime  : 
% 0.06/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.06/0.23  Running first-order model finding
% 0.06/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.18/0.27  % (2081875)Will run a generic schedule for satisfiability detection.
% 0.18/0.27  % (2081886)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=664248626:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.27  % (2081886) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2081875-2081886"...
% 0.18/0.27  % (2081886)...printing done.
% 0.18/0.27  % (2081886)Refutation found. Thanks to Tanya!
% 0.18/0.27  % SZS status Theorem for theBenchmark
% 0.18/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.27  % (2081886)------------------------------
% 0.18/0.27  % (2081886)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.27  % (2081886)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.27  % (2081886)CaDiCaL version: 2.1.3
% 0.18/0.27  % (2081886)Termination reason: Refutation
% 0.18/0.27  % (2081886)Time elapsed: 0.001 s
% 0.18/0.27  % (2081886)Peak memory usage: 12 MB
% 0.18/0.27  % (2081875)Success in time 0.032 s
% 0.18/0.27  % Vampire exiting
%------------------------------------------------------------------------------