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

% Computer : n009.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:54 PM UTC 2026

% Result   : Theorem 0.09s 0.26s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   34 (   9 unt;   4 def)
%            Number of atoms       :   73 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   70 (  31   ~;  25   |;   0   &)
%                                         (   7 <=>;   6  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   6 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   14 (   0 sgn   9   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ? [X0] :
        ( p(X0)
       => c )
  <=> ( ! [X0] : p(X0)
     => c ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ( ? [X0] :
          ( p(X0)
         => c )
    <=> ( ! [X0] : p(X0)
       => c ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ~ ( ? [X0] :
          ( p(X0)
         => c )
    <=> ( ! [X1] : p(X1)
       => c ) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ( ? [X0] :
        ( c
        | ~ p(X0) )
  <~> ( c
      | ? [X1] : ~ p(X1) ) ),
    inference(ennf_transformation,[],[f3]) ).

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

fof(f7,plain,
    ~ c,
    inference(cnf_transformation,[],[f4]) ).

fof(f8,plain,
    ! [X0,X1] :
      ( p(X1)
      | p(X0) ),
    inference(cnf_transformation,[],[f4]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ~ p(X1)
      | ~ p(X0) ),
    inference(consistent_polarity_flipping,[],[f8]) ).

fof(f12,plain,
    c,
    inference(consistent_polarity_flipping,[],[f7]) ).

fof(f14,plain,
    ( p(sK1)
    | p(sK0)
    | ~ c ),
    inference(consistent_polarity_flipping,[],[f5]) ).

fof(f16,definition,
    ( spl2_1
  <=> c ),
    introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).

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

fof(f22,plain,
    ( p(sK0)
    | ~ spl2_2 ),
    inference(avatar_component_clause,[],[f20]) ).

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

fof(f26,plain,
    ( p(sK1)
    | ~ spl2_3 ),
    inference(avatar_component_clause,[],[f24]) ).

fof(f27,plain,
    ( ~ spl2_1
    | spl2_2
    | spl2_3 ),
    inference(avatar_split_clause,[],[f14,f24,f20,f16]) ).

fof(f29,definition,
    ( spl2_4
  <=> ! [X0] : ~ p(X0) ),
    introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).

fof(f30,plain,
    ( ! [X0] : ~ p(X0)
    | ~ spl2_4 ),
    inference(avatar_component_clause,[],[f29]) ).

fof(f32,plain,
    spl2_1,
    inference(avatar_split_clause,[],[f12,f16]) ).

fof(f33,plain,
    ( spl2_4
    | spl2_4 ),
    inference(avatar_split_clause,[],[f11,f29,f29]) ).

fof(f35,plain,
    ( $false
    | ~ spl2_3
    | ~ spl2_4 ),
    inference(backward_subsumption_resolution,[],[f26,f30]) ).

fof(f36,plain,
    ( ~ spl2_3
    | ~ spl2_4 ),
    inference(avatar_contradiction_clause,[],[f35]) ).

fof(f37,plain,
    ( $false
    | ~ spl2_2
    | ~ spl2_4 ),
    inference(forward_subsumption_resolution,[],[f22,f30]) ).

fof(f38,plain,
    ( ~ spl2_2
    | ~ spl2_4 ),
    inference(avatar_contradiction_clause,[],[f37]) ).

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

cnf(s3,plain,
    spl2_1,
    inference(sat_conversion,[],[f32]) ).

cnf(s4,plain,
    ( spl2_4
    | spl2_4 ),
    inference(sat_conversion,[],[f33]) ).

cnf(s5,plain,
    spl2_4,
    inference(rat,[],[s4]) ).

cnf(s7,plain,
    ( ~ spl2_3
    | ~ spl2_4 ),
    inference(sat_conversion,[],[f36]) ).

cnf(s8,plain,
    ( ~ spl2_2
    | ~ spl2_4 ),
    inference(sat_conversion,[],[f38]) ).

cnf(s9,plain,
    ~ spl2_2,
    inference(rat,[],[s8,s5]) ).

cnf(s10,plain,
    ~ spl2_3,
    inference(rat,[],[s7,s5]) ).

cnf(s11,plain,
    $false,
    inference(rat,[],[s1,s10,s9,s3]) ).

fof(f39,plain,
    $false,
    inference(avatar_sat_refutation,[],[s11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN935+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n009.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Mon Sep 28 17:13:45 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  Running first-order model finding
% 0.09/0.22  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.09/0.26  % (3223443)Will run a generic schedule for satisfiability detection.
% 0.09/0.26  % (3223449)% WARNING: option uhcvi not known.
% 0.09/0.26  % (3223449)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=247769461:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.26  % (3223449) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3223443-3223449"...
% 0.09/0.26  % (3223449)...printing done.
% 0.09/0.26  % (3223449)Refutation found. Thanks to Tanya!
% 0.09/0.26  % SZS status Theorem for theBenchmark
% 0.09/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26  % (3223449)------------------------------
% 0.09/0.26  % (3223449)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26  % (3223449)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26  % (3223449)CaDiCaL version: 2.1.3
% 0.09/0.26  % (3223449)Termination reason: Refutation
% 0.09/0.26  % (3223449)Time elapsed: 0.001 s
% 0.09/0.26  % (3223449)Peak memory usage: 12 MB
% 0.09/0.26  % (3223443)Success in time 0.027 s
% 0.09/0.26  % Vampire exiting
%------------------------------------------------------------------------------