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

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

% Result   : Theorem 0.12s 0.47s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   39 (  11 unt;   0 typ;   3 def)
%            Number of atoms       :  151 (   2 equ)
%            Maximal formula atoms :    4 (   3 avg)
%            Number of connectives :  113 (  42   ~;  38   |;   8   &)
%                                         (   4 <=>;  21  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of FOOLs       :   65 (  53 fml;  12 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   8 usr;   7 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 3-3 aty)
%            Number of variables   :   52 (   0 sgn  46   !;   6   ?;  52   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_1,type,
    sK0: ( $i * $i * $o ) > $i ).

tff(f1,axiom,
    ( setunionE
    = ( ! [X0: $i,X1: $i] :
          ( in(X1,setunion(X0))
         => ! [X2: $o] :
              ( ! [X3: $i] :
                  ( in(X1,X3)
                 => ( in(X3,X0)
                   => (X2) ) )
             => (X2) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setunionE) ).

tff(f2,conjecture,
    ( setunionE
   => ! [X0: $i,X1: $i] :
        ( in(X1,setunion(X0))
       => ? [X2: $i] :
            ( in(X2,X0)
            & in(X1,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setunionE2) ).

tff(f3,negated_conjecture,
    ~ ( setunionE
     => ! [X0: $i,X1: $i] :
          ( in(X1,setunion(X0))
         => ? [X2: $i] :
              ( in(X2,X0)
              & in(X1,X2) ) ) ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

tff(f4,plain,
    ( setunionE
    = ( ! [X0: $i,X1: $i] :
          ( in(X1,setunion(X0))
         => ! [X2: $o] :
              ( ! [X3: $i] :
                  ( in(X1,X3)
                 => ( in(X3,X0)
                   => (X2) ) )
             => (X2) ) ) ) ),
    inference(rectify,[],[f1]) ).

tff(f5,plain,
    ( setunionE
  <=> ! [X0: $i,X1: $i] :
        ( in(X1,setunion(X0))
       => ! [X2: $o] :
            ( ! [X3: $i] :
                ( in(X1,X3)
               => ( in(X3,X0)
                 => (X2) ) )
           => (X2) ) ) ),
    inference(flattening,[],[f4]) ).

tff(f6,plain,
    ( setunionE
   => ! [X0: $i,X1: $i] :
        ( in(X1,setunion(X0))
       => ! [X2: $o] :
            ( ! [X3: $i] :
                ( in(X1,X3)
               => ( in(X3,X0)
                 => (X2) ) )
           => (X2) ) ) ),
    inference(unused_predicate_definition_removal,[],[f5]) ).

tff(f7,plain,
    ( ! [X0: $i,X1: $i] :
        ( ! [X2: $o] :
            ( (X2)
            | ? [X3: $i] :
                ( ~ (X2)
                & in(X3,X0)
                & in(X1,X3) ) )
        | ~ in(X1,setunion(X0)) )
    | ~ setunionE ),
    inference(ennf_transformation,[],[f6]) ).

tff(f8,plain,
    ( ! [X0: $i,X1: $i] :
        ( ! [X2: $o] :
            ( (X2)
            | ? [X3: $i] :
                ( ~ (X2)
                & in(X3,X0)
                & in(X1,X3) ) )
        | ~ in(X1,setunion(X0)) )
    | ~ setunionE ),
    inference(flattening,[],[f7]) ).

tff(f9,plain,
    ( ? [X0: $i,X1: $i] :
        ( ! [X2: $i] :
            ( ~ in(X2,X0)
            | ~ in(X1,X2) )
        & in(X1,setunion(X0)) )
    & setunionE ),
    inference(ennf_transformation,[],[f3]) ).

tff(f10,plain,
    ! [X0: $i,X1: $i] :
      ( ~ setunionE
      | ~ in(X1,setunion(X0))
      | in(X1,sK0(X0,X1,$false)) ),
    inference(cnf_transformation,[],[f8]) ).

tff(f11,plain,
    ! [X0: $i,X1: $i] :
      ( ~ setunionE
      | ~ in(X1,setunion(X0))
      | in(sK0(X0,X1,$false),X0) ),
    inference(cnf_transformation,[],[f8]) ).

tff(f12,plain,
    ! [X2: $i] :
      ( ~ in(sK2,X2)
      | ~ in(X2,sK1) ),
    inference(cnf_transformation,[],[f9]) ).

tff(f13,plain,
    in(sK2,setunion(sK1)),
    inference(cnf_transformation,[],[f9]) ).

tff(f14,plain,
    setunionE,
    inference(cnf_transformation,[],[f9]) ).

tff(f17,plain,
    ! [X0: $i,X1: $i] :
      ( ~ setunionE
      | in(X1,setunion(X0))
      | ~ in(sK0(X0,X1,$false),X0) ),
    inference(consistent_polarity_flipping,[],[f11]) ).

tff(f18,plain,
    ! [X0: $i,X1: $i] :
      ( ~ setunionE
      | in(X1,setunion(X0))
      | ~ in(X1,sK0(X0,X1,$false)) ),
    inference(consistent_polarity_flipping,[],[f10]) ).

tff(f19,plain,
    ~ in(sK2,setunion(sK1)),
    inference(consistent_polarity_flipping,[],[f13]) ).

tff(f20,plain,
    ! [X2: $i] :
      ( in(sK2,X2)
      | in(X2,sK1) ),
    inference(consistent_polarity_flipping,[],[f12]) ).

tff(f22,definition,
    ( spl3_1
  <=> ! [X0: $i,X1: $i] :
        ( in(X1,setunion(X0))
        | ~ in(X1,sK0(X0,X1,$false)) ) ),
    introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).

tff(f23,plain,
    ( ! [X0: $i,X1: $i] :
        ( ~ in(X1,sK0(X0,X1,$false))
        | in(X1,setunion(X0)) )
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f22]) ).

tff(f25,definition,
    ( spl3_2
  <=> setunionE ),
    introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).

tff(f28,plain,
    ( spl3_1
    | ~ spl3_2 ),
    inference(avatar_split_clause,[],[f18,f25,f22]) ).

tff(f30,definition,
    ( spl3_3
  <=> ! [X0: $i,X1: $i] :
        ( in(X1,setunion(X0))
        | ~ in(sK0(X0,X1,$false),X0) ) ),
    introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).

tff(f31,plain,
    ( ! [X0: $i,X1: $i] :
        ( ~ in(sK0(X0,X1,$false),X0)
        | in(X1,setunion(X0)) )
    | ~ spl3_3 ),
    inference(avatar_component_clause,[],[f30]) ).

tff(f32,plain,
    ( spl3_3
    | ~ spl3_2 ),
    inference(avatar_split_clause,[],[f17,f25,f30]) ).

tff(f33,plain,
    spl3_2,
    inference(avatar_split_clause,[],[f14,f25]) ).

tff(f34,plain,
    ( ! [X0: $i] :
        ( in(sK2,sK0(sK1,X0,$false))
        | in(X0,setunion(sK1)) )
    | ~ spl3_3 ),
    inference(resolution,[],[f31,f20]) ).

tff(f35,plain,
    ( in(sK2,setunion(sK1))
    | in(sK2,setunion(sK1))
    | ~ spl3_1
    | ~ spl3_3 ),
    inference(resolution,[],[f34,f23]) ).

tff(f36,plain,
    ( in(sK2,setunion(sK1))
    | ~ spl3_1
    | ~ spl3_3 ),
    inference(duplicate_literal_removal,[],[f35]) ).

tff(f37,plain,
    ( $false
    | ~ spl3_1
    | ~ spl3_3 ),
    inference(forward_subsumption_resolution,[],[f36,f19]) ).

tff(f38,plain,
    ( ~ spl3_1
    | ~ spl3_3 ),
    inference(avatar_contradiction_clause,[],[f37]) ).

cnf(s1,plain,
    ( spl3_1
    | ~ spl3_2 ),
    inference(sat_conversion,[],[f28]) ).

cnf(s2,plain,
    ( ~ spl3_2
    | spl3_3 ),
    inference(sat_conversion,[],[f32]) ).

cnf(s3,plain,
    spl3_2,
    inference(sat_conversion,[],[f33]) ).

cnf(s4,plain,
    ( ~ spl3_1
    | ~ spl3_3 ),
    inference(sat_conversion,[],[f38]) ).

cnf(s5,plain,
    spl3_3,
    inference(rat,[],[s2,s3]) ).

cnf(s6,plain,
    ~ spl3_1,
    inference(rat,[],[s4,s5]) ).

cnf(s7,plain,
    $false,
    inference(rat,[],[s1,s3,s6]) ).

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

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