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

% Computer : n002.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:52:56 PM UTC 2026

% Result   : Theorem 0.15s 0.47s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   64 (  12 unt;   2 def)
%            Number of atoms       :  171 (  28 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  182 (  75   ~;  79   |;   9   &)
%                                         (   7 <=>;  11  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   3 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-3 aty)
%            Number of variables   :   52 (   0 sgn  49   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f10,axiom,
    ! [X0] :
      ( ( ~ empty_carrier(X0)
        & join_semilatt_str(X0) )
     => ! [X1] :
          ( element(X1,the_carrier(X0))
         => ! [X2] :
              ( element(X2,the_carrier(X0))
             => ( below(X0,X1,X2)
              <=> join(X0,X1,X2) = X2 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_lattices) ).

fof(f15,axiom,
    ! [X0] :
      ( strict_latt_str(boole_lattice(X0))
      & latt_str(boole_lattice(X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_lattice3) ).

fof(f30,axiom,
    ! [X0] :
      ( latt_str(X0)
     => ( meet_semilatt_str(X0)
        & join_semilatt_str(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l3_lattices) ).

fof(f44,axiom,
    ! [X0] :
      ( ~ empty_carrier(boole_lattice(X0))
      & strict_latt_str(boole_lattice(X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_lattice3) ).

fof(f68,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
     => set_union2(X0,X1) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).

fof(f70,axiom,
    ! [X0,X1] :
      ( element(X1,the_carrier(boole_lattice(X0)))
     => ! [X2] :
          ( element(X2,the_carrier(boole_lattice(X0)))
         => ( join(boole_lattice(X0),X1,X2) = set_union2(X1,X2)
            & meet(boole_lattice(X0),X1,X2) = set_intersection2(X1,X2) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_lattice3) ).

fof(f73,conjecture,
    ! [X0,X1] :
      ( element(X1,the_carrier(boole_lattice(X0)))
     => ! [X2] :
          ( element(X2,the_carrier(boole_lattice(X0)))
         => ( below(boole_lattice(X0),X1,X2)
          <=> subset(X1,X2) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_lattice3) ).

fof(f74,negated_conjecture,
    ~ ! [X0,X1] :
        ( element(X1,the_carrier(boole_lattice(X0)))
       => ! [X2] :
            ( element(X2,the_carrier(boole_lattice(X0)))
           => ( below(boole_lattice(X0),X1,X2)
            <=> subset(X1,X2) ) ) ),
    inference(negated_conjecture,[status(cth)],[f73]) ).

fof(f81,axiom,
    ! [X0,X1] : subset(X0,set_union2(X0,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).

fof(f96,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( below(X0,X1,X2)
              <=> join(X0,X1,X2) = X2 )
              | ~ element(X2,the_carrier(X0)) )
          | ~ element(X1,the_carrier(X0)) )
      | empty_carrier(X0)
      | ~ join_semilatt_str(X0) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f97,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( below(X0,X1,X2)
              <=> join(X0,X1,X2) = X2 )
              | ~ element(X2,the_carrier(X0)) )
          | ~ element(X1,the_carrier(X0)) )
      | empty_carrier(X0)
      | ~ join_semilatt_str(X0) ),
    inference(flattening,[],[f96]) ).

fof(f108,plain,
    ! [X0] :
      ( ( meet_semilatt_str(X0)
        & join_semilatt_str(X0) )
      | ~ latt_str(X0) ),
    inference(ennf_transformation,[],[f30]) ).

fof(f127,plain,
    ! [X0,X1] :
      ( set_union2(X0,X1) = X1
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f68]) ).

fof(f128,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( join(boole_lattice(X0),X1,X2) = set_union2(X1,X2)
            & meet(boole_lattice(X0),X1,X2) = set_intersection2(X1,X2) )
          | ~ element(X2,the_carrier(boole_lattice(X0))) )
      | ~ element(X1,the_carrier(boole_lattice(X0))) ),
    inference(ennf_transformation,[],[f70]) ).

fof(f130,plain,
    ? [X0,X1] :
      ( ? [X2] :
          ( ( below(boole_lattice(X0),X1,X2)
          <~> subset(X1,X2) )
          & element(X2,the_carrier(boole_lattice(X0))) )
      & element(X1,the_carrier(boole_lattice(X0))) ),
    inference(ennf_transformation,[],[f74]) ).

fof(f148,plain,
    ! [X2,X0,X1] :
      ( below(X0,X1,X2)
      | empty_carrier(X0)
      | ~ element(X1,the_carrier(X0))
      | ~ element(X2,the_carrier(X0))
      | join(X0,X1,X2) != X2
      | ~ join_semilatt_str(X0) ),
    inference(cnf_transformation,[],[f97]) ).

fof(f149,plain,
    ! [X2,X0,X1] :
      ( ~ below(X0,X1,X2)
      | empty_carrier(X0)
      | ~ element(X1,the_carrier(X0))
      | ~ element(X2,the_carrier(X0))
      | join(X0,X1,X2) = X2
      | ~ join_semilatt_str(X0) ),
    inference(cnf_transformation,[],[f97]) ).

fof(f153,plain,
    ! [X0] : latt_str(boole_lattice(X0)),
    inference(cnf_transformation,[],[f15]) ).

fof(f160,plain,
    ! [X0] :
      ( ~ latt_str(X0)
      | join_semilatt_str(X0) ),
    inference(cnf_transformation,[],[f108]) ).

fof(f177,plain,
    ! [X0] : ~ empty_carrier(boole_lattice(X0)),
    inference(cnf_transformation,[],[f44]) ).

fof(f212,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | set_union2(X0,X1) = X1 ),
    inference(cnf_transformation,[],[f127]) ).

fof(f215,plain,
    ! [X2,X0,X1] :
      ( ~ element(X1,the_carrier(boole_lattice(X0)))
      | ~ element(X2,the_carrier(boole_lattice(X0)))
      | join(boole_lattice(X0),X1,X2) = set_union2(X1,X2) ),
    inference(cnf_transformation,[],[f128]) ).

fof(f218,plain,
    ( subset(sK16,sK17)
    | below(boole_lattice(sK15),sK16,sK17) ),
    inference(cnf_transformation,[],[f130]) ).

fof(f219,plain,
    ( ~ subset(sK16,sK17)
    | ~ below(boole_lattice(sK15),sK16,sK17) ),
    inference(cnf_transformation,[],[f130]) ).

fof(f220,plain,
    element(sK17,the_carrier(boole_lattice(sK15))),
    inference(cnf_transformation,[],[f130]) ).

fof(f221,plain,
    element(sK16,the_carrier(boole_lattice(sK15))),
    inference(cnf_transformation,[],[f130]) ).

fof(f229,plain,
    ! [X0,X1] : subset(X0,set_union2(X0,X1)),
    inference(cnf_transformation,[],[f81]) ).

fof(f233,definition,
    ( spl18_1
  <=> below(boole_lattice(sK15),sK16,sK17) ),
    introduced(definition,[new_symbols(definition,[spl18_1])],[avatar_definition]) ).

fof(f234,plain,
    ( ~ below(boole_lattice(sK15),sK16,sK17)
    | spl18_1 ),
    inference(avatar_component_clause,[],[f233]) ).

fof(f235,plain,
    ( below(boole_lattice(sK15),sK16,sK17)
    | ~ spl18_1 ),
    inference(avatar_component_clause,[],[f233]) ).

fof(f237,definition,
    ( spl18_2
  <=> subset(sK16,sK17) ),
    introduced(definition,[new_symbols(definition,[spl18_2])],[avatar_definition]) ).

fof(f238,plain,
    ( ~ subset(sK16,sK17)
    | spl18_2 ),
    inference(avatar_component_clause,[],[f237]) ).

fof(f239,plain,
    ( subset(sK16,sK17)
    | ~ spl18_2 ),
    inference(avatar_component_clause,[],[f237]) ).

fof(f240,plain,
    ( spl18_1
    | spl18_2 ),
    inference(avatar_split_clause,[],[f218,f237,f233]) ).

fof(f241,plain,
    ( ~ spl18_1
    | ~ spl18_2 ),
    inference(avatar_split_clause,[],[f219,f237,f233]) ).

fof(f242,plain,
    ! [X0] : join_semilatt_str(boole_lattice(X0)),
    inference(resolution,[],[f160,f153]) ).

fof(f363,plain,
    ( sK17 = set_union2(sK16,sK17)
    | ~ spl18_2 ),
    inference(resolution,[],[f212,f239]) ).

fof(f504,plain,
    ! [X0] :
      ( ~ element(X0,the_carrier(boole_lattice(sK15)))
      | join(boole_lattice(sK15),sK16,X0) = set_union2(sK16,X0) ),
    inference(resolution,[],[f215,f221]) ).

fof(f509,plain,
    ( empty_carrier(boole_lattice(sK15))
    | ~ element(sK16,the_carrier(boole_lattice(sK15)))
    | ~ element(sK17,the_carrier(boole_lattice(sK15)))
    | sK17 != join(boole_lattice(sK15),sK16,sK17)
    | ~ join_semilatt_str(boole_lattice(sK15))
    | spl18_1 ),
    inference(resolution,[],[f148,f234]) ).

fof(f510,plain,
    ( ~ element(sK16,the_carrier(boole_lattice(sK15)))
    | ~ element(sK17,the_carrier(boole_lattice(sK15)))
    | sK17 != join(boole_lattice(sK15),sK16,sK17)
    | ~ join_semilatt_str(boole_lattice(sK15))
    | spl18_1 ),
    inference(forward_subsumption_resolution,[],[f509,f177]) ).

fof(f511,plain,
    ( ~ element(sK17,the_carrier(boole_lattice(sK15)))
    | sK17 != join(boole_lattice(sK15),sK16,sK17)
    | ~ join_semilatt_str(boole_lattice(sK15))
    | spl18_1 ),
    inference(forward_subsumption_resolution,[],[f510,f221]) ).

fof(f512,plain,
    ( sK17 != join(boole_lattice(sK15),sK16,sK17)
    | ~ join_semilatt_str(boole_lattice(sK15))
    | spl18_1 ),
    inference(forward_subsumption_resolution,[],[f511,f220]) ).

fof(f513,plain,
    ( sK17 != join(boole_lattice(sK15),sK16,sK17)
    | spl18_1 ),
    inference(forward_subsumption_resolution,[],[f512,f242]) ).

fof(f551,plain,
    join(boole_lattice(sK15),sK16,sK17) = set_union2(sK16,sK17),
    inference(resolution,[],[f504,f220]) ).

fof(f555,plain,
    ( sK17 = join(boole_lattice(sK15),sK16,sK17)
    | ~ spl18_2 ),
    inference(forward_demodulation,[],[f551,f363]) ).

fof(f556,plain,
    ( $false
    | spl18_1
    | ~ spl18_2 ),
    inference(forward_subsumption_resolution,[],[f555,f513]) ).

fof(f557,plain,
    ( spl18_1
    | ~ spl18_2 ),
    inference(avatar_contradiction_clause,[],[f556]) ).

fof(f559,plain,
    ( empty_carrier(boole_lattice(sK15))
    | ~ element(sK16,the_carrier(boole_lattice(sK15)))
    | ~ element(sK17,the_carrier(boole_lattice(sK15)))
    | sK17 = join(boole_lattice(sK15),sK16,sK17)
    | ~ join_semilatt_str(boole_lattice(sK15))
    | ~ spl18_1 ),
    inference(resolution,[],[f235,f149]) ).

fof(f560,plain,
    ( ~ element(sK16,the_carrier(boole_lattice(sK15)))
    | ~ element(sK17,the_carrier(boole_lattice(sK15)))
    | sK17 = join(boole_lattice(sK15),sK16,sK17)
    | ~ join_semilatt_str(boole_lattice(sK15))
    | ~ spl18_1 ),
    inference(forward_subsumption_resolution,[],[f559,f177]) ).

fof(f561,plain,
    ( ~ element(sK17,the_carrier(boole_lattice(sK15)))
    | sK17 = join(boole_lattice(sK15),sK16,sK17)
    | ~ join_semilatt_str(boole_lattice(sK15))
    | ~ spl18_1 ),
    inference(forward_subsumption_resolution,[],[f560,f221]) ).

fof(f562,plain,
    ( sK17 = join(boole_lattice(sK15),sK16,sK17)
    | ~ join_semilatt_str(boole_lattice(sK15))
    | ~ spl18_1 ),
    inference(forward_subsumption_resolution,[],[f561,f220]) ).

fof(f563,plain,
    ( sK17 = join(boole_lattice(sK15),sK16,sK17)
    | ~ spl18_1 ),
    inference(forward_subsumption_resolution,[],[f562,f242]) ).

fof(f570,plain,
    ( sK17 = set_union2(sK16,sK17)
    | ~ spl18_1 ),
    inference(superposition,[],[f563,f551]) ).

fof(f579,plain,
    ( subset(sK16,sK17)
    | ~ spl18_1 ),
    inference(superposition,[],[f229,f570]) ).

fof(f585,plain,
    ( $false
    | ~ spl18_1
    | spl18_2 ),
    inference(forward_subsumption_resolution,[],[f579,f238]) ).

fof(f586,plain,
    ( ~ spl18_1
    | spl18_2 ),
    inference(avatar_contradiction_clause,[],[f585]) ).

cnf(s1,plain,
    ( spl18_1
    | spl18_2 ),
    inference(sat_conversion,[],[f240]) ).

cnf(s2,plain,
    ( ~ spl18_1
    | ~ spl18_2 ),
    inference(sat_conversion,[],[f241]) ).

cnf(s14,plain,
    ( spl18_1
    | ~ spl18_2 ),
    inference(sat_conversion,[],[f557]) ).

cnf(s16,plain,
    ( ~ spl18_1
    | spl18_2 ),
    inference(sat_conversion,[],[f586]) ).

cnf(s17,plain,
    spl18_1,
    inference(rat,[],[s1,s14]) ).

cnf(s18,plain,
    spl18_2,
    inference(rat,[],[s16,s17]) ).

cnf(s19,plain,
    $false,
    inference(rat,[],[s2,s18,s17]) ).

fof(f587,plain,
    $false,
    inference(avatar_sat_refutation,[],[s19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU344+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n002.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 28 04:51:52 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41  Running first-order model finding
% 0.11/0.41  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.15/0.47  % (4154153)Will run a generic schedule for satisfiability detection.
% 0.15/0.47  % (4154158)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3885888895_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.47  % (4154159)% WARNING: option uhcvi not known.
% 0.15/0.47  % TRYING [1]
% 0.15/0.47  % TRYING [2]
% 0.15/0.47  % (4154159)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1549765916:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.47  % TRYING [3]
% 0.15/0.47  % (4154160)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3551515485:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.47  % (4154161)dis+10_1_sil=32000:sp=arity:random_seed=3550231368:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.47  % (4154162)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3910494747:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.47  % (4154164)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4027864172:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.47  % (4154163)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1789260319:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.47  % (4154162) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4154153-4154162"...
% 0.15/0.47  % (4154162)...printing done.
% 0.15/0.47  % (4154162)Refutation found. Thanks to Tanya!
% 0.15/0.47  % SZS status Theorem for theBenchmark
% 0.15/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.47  % (4154162)------------------------------
% 0.15/0.47  % (4154162)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.47  % (4154162)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.47  % (4154162)CaDiCaL version: 2.1.3
% 0.15/0.47  % (4154162)Termination reason: Refutation
% 0.15/0.47  % (4154162)Time elapsed: 0.015 s
% 0.15/0.47  % (4154162)Peak memory usage: 13 MB
% 0.15/0.47  % (4154162)Instructions burned: 20 (million)
% 0.15/0.47  % (4154153)Success in time 0.058 s
% 0.15/0.47  % Vampire exiting
%------------------------------------------------------------------------------