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

% Computer : n013.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:30:45 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    :   35 (   5 unt;   0 typ;   4 def)
%            Number of atoms       :   89 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   65 (  27   ~;  22   |;   6   &)
%                                         (   8 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of FOOLs       :   16 (  16 fml;   0 var)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   7 usr;   8 prp; 0-1 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(pred_def_2,type,
    cP: $o > $o ).

tff(f1,conjecture,
    ( ( ( a
      <=> b )
      & cP(a) )
   => cP(b) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTRIVEXT1) ).

tff(f2,negated_conjecture,
    ~ ( ( ( a
        <=> b )
        & cP(a) )
     => cP(b) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

tff(f3,plain,
    ( ~ cP(b)
    & ( a
    <=> b )
    & cP(a) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f4,plain,
    ( ~ cP(b)
    & ( a
    <=> b )
    & cP(a) ),
    inference(flattening,[],[f3]) ).

tff(f5,plain,
    ( ~ b
    | ~ cP($true) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f6,plain,
    ( b
    | ~ cP($false) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f7,plain,
    ( ~ b
    | a ),
    inference(cnf_transformation,[],[f4]) ).

tff(f8,plain,
    ( b
    | ~ a ),
    inference(cnf_transformation,[],[f4]) ).

tff(f9,plain,
    ( ~ a
    | cP($true) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f10,plain,
    ( a
    | cP($false) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f13,plain,
    ( ~ b
    | ~ a ),
    inference(consistent_polarity_flipping,[],[f8]) ).

tff(f14,plain,
    ( b
    | a ),
    inference(consistent_polarity_flipping,[],[f7]) ).

tff(f15,plain,
    ( ~ b
    | ~ cP($false) ),
    inference(consistent_polarity_flipping,[],[f6]) ).

tff(f16,plain,
    ( b
    | ~ cP($true) ),
    inference(consistent_polarity_flipping,[],[f5]) ).

tff(f18,definition,
    ( spl0_1
  <=> cP($true) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

tff(f22,definition,
    ( spl0_2
  <=> b ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

tff(f25,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f16,f22,f18]) ).

tff(f27,definition,
    ( spl0_3
  <=> cP($false) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

tff(f30,plain,
    ( ~ spl0_3
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f15,f22,f27]) ).

tff(f32,definition,
    ( spl0_4
  <=> a ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

tff(f35,plain,
    ( spl0_4
    | spl0_2 ),
    inference(avatar_split_clause,[],[f14,f22,f32]) ).

tff(f36,plain,
    ( ~ spl0_4
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f13,f22,f32]) ).

tff(f37,plain,
    ( spl0_1
    | ~ spl0_4 ),
    inference(avatar_split_clause,[],[f9,f32,f18]) ).

tff(f38,plain,
    ( spl0_3
    | spl0_4 ),
    inference(avatar_split_clause,[],[f10,f32,f27]) ).

cnf(s1,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f25]) ).

cnf(s2,plain,
    ( ~ spl0_2
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f30]) ).

cnf(s3,plain,
    ( spl0_2
    | spl0_4 ),
    inference(sat_conversion,[],[f35]) ).

cnf(s4,plain,
    ( ~ spl0_2
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f36]) ).

cnf(s5,plain,
    ( spl0_1
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f37]) ).

cnf(s6,plain,
    ( spl0_3
    | spl0_4 ),
    inference(sat_conversion,[],[f38]) ).

cnf(s7,plain,
    spl0_4,
    inference(rat,[],[s2,s3,s6]) ).

cnf(s8,plain,
    spl0_1,
    inference(rat,[],[s5,s7]) ).

cnf(s9,plain,
    ~ spl0_2,
    inference(rat,[],[s4,s7]) ).

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

tff(f39,plain,
    $false,
    inference(avatar_sat_refutation,[],[s10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO368_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n013.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:36:06 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  Running first-order model finding
% 0.09/0.22  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.26  % (1365846)Will run a generic schedule for satisfiability detection.
% 0.09/0.26  % (1365858)% WARNING: option uhcvi not known.
% 0.09/0.26  % (1365858)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2620094220:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.26  % (1365858) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1365846-1365858"...
% 0.09/0.26  % (1365858)...printing done.
% 0.09/0.26  % (1365858)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  % (1365858)------------------------------
% 0.09/0.26  % (1365858)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26  % (1365858)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26  % (1365858)CaDiCaL version: 2.1.3
% 0.09/0.26  % (1365858)Termination reason: Refutation
% 0.09/0.26  % (1365858)Time elapsed: 0.001 s
% 0.09/0.26  % (1365858)Peak memory usage: 12 MB
% 0.09/0.26  % (1365846)Success in time 0.029 s
% 0.09/0.26  % Vampire exiting
%------------------------------------------------------------------------------