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

% Computer : n003.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:18 PM UTC 2026

% Result   : Theorem 0.04s 0.44s
% Output   : Refutation 0.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   57 (   7 unt;   2 def)
%            Number of atoms       :  138 (  38 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  141 (  60   ~;  57   |;  13   &)
%                                         (   4 <=>;   6  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   20 (   0 sgn  17   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f9,axiom,
    ! [X0] :
      ( ( ~ empty(X0)
        & relation(X0) )
     => ~ empty(relation_dom(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc5_relat_1) ).

fof(f10,axiom,
    ! [X0] :
      ( ( ~ empty(X0)
        & relation(X0) )
     => ~ empty(relation_rng(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc6_relat_1) ).

fof(f11,axiom,
    ! [X0] :
      ( empty(X0)
     => ( empty(relation_dom(X0))
        & relation(relation_dom(X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc7_relat_1) ).

fof(f20,axiom,
    ( empty(empty_set)
    & relation(empty_set) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_relat_1) ).

fof(f22,axiom,
    ! [X0] :
      ( empty(X0)
     => X0 = empty_set ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).

fof(f23,conjecture,
    ! [X0] :
      ( relation(X0)
     => ( relation_dom(X0) = empty_set
      <=> relation_rng(X0) = empty_set ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t65_relat_1) ).

fof(f24,negated_conjecture,
    ~ ! [X0] :
        ( relation(X0)
       => ( relation_dom(X0) = empty_set
        <=> relation_rng(X0) = empty_set ) ),
    inference(negated_conjecture,[status(cth)],[f23]) ).

fof(f25,axiom,
    ( relation_dom(empty_set) = empty_set
    & relation_rng(empty_set) = empty_set ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_relat_1) ).

fof(f32,plain,
    ! [X0] :
      ( ~ empty(relation_dom(X0))
      | empty(X0)
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f33,plain,
    ! [X0] :
      ( ~ empty(relation_dom(X0))
      | empty(X0)
      | ~ relation(X0) ),
    inference(flattening,[],[f32]) ).

fof(f34,plain,
    ! [X0] :
      ( ~ empty(relation_rng(X0))
      | empty(X0)
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f35,plain,
    ! [X0] :
      ( ~ empty(relation_rng(X0))
      | empty(X0)
      | ~ relation(X0) ),
    inference(flattening,[],[f34]) ).

fof(f36,plain,
    ! [X0] :
      ( ( empty(relation_dom(X0))
        & relation(relation_dom(X0)) )
      | ~ empty(X0) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f40,plain,
    ! [X0] :
      ( X0 = empty_set
      | ~ empty(X0) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f41,plain,
    ? [X0] :
      ( ( relation_dom(X0) = empty_set
      <~> relation_rng(X0) = empty_set )
      & relation(X0) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f49,plain,
    ? [X0] :
      ( ( relation_rng(X0) != empty_set
        | relation_dom(X0) != empty_set )
      & ( relation_rng(X0) = empty_set
        | relation_dom(X0) = empty_set )
      & relation(X0) ),
    inference(nnf_transformation,[],[f41]) ).

fof(f50,plain,
    ? [X0] :
      ( ( relation_rng(X0) != empty_set
        | relation_dom(X0) != empty_set )
      & ( relation_rng(X0) = empty_set
        | relation_dom(X0) = empty_set )
      & relation(X0) ),
    inference(flattening,[],[f49]) ).

fof(f51,plain,
    ( ( empty_set != relation_rng(sK5)
      | empty_set != relation_dom(sK5) )
    & ( empty_set = relation_rng(sK5)
      | empty_set = relation_dom(sK5) )
    & relation(sK5) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X0,sK5)],[f50]) ).

fof(f61,plain,
    ! [X0] :
      ( ~ empty(relation_dom(X0))
      | empty(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f62,plain,
    ! [X0] :
      ( ~ empty(relation_rng(X0))
      | empty(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f35]) ).

fof(f64,plain,
    ! [X0] :
      ( empty(relation_dom(X0))
      | ~ empty(X0) ),
    inference(cnf_transformation,[],[f36]) ).

fof(f72,plain,
    empty(empty_set),
    inference(cnf_transformation,[],[f20]) ).

fof(f74,plain,
    ! [X0] :
      ( ~ empty(X0)
      | empty_set = X0 ),
    inference(cnf_transformation,[],[f40]) ).

fof(f75,plain,
    relation(sK5),
    inference(cnf_transformation,[],[f51]) ).

fof(f76,plain,
    ( empty_set = relation_rng(sK5)
    | empty_set = relation_dom(sK5) ),
    inference(cnf_transformation,[],[f51]) ).

fof(f77,plain,
    ( empty_set != relation_rng(sK5)
    | empty_set != relation_dom(sK5) ),
    inference(cnf_transformation,[],[f51]) ).

fof(f78,plain,
    empty_set = relation_rng(empty_set),
    inference(cnf_transformation,[],[f25]) ).

fof(f83,definition,
    ( spl6_1
  <=> empty_set = relation_dom(sK5) ),
    introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).

fof(f84,plain,
    ( empty_set != relation_dom(sK5)
    | spl6_1 ),
    inference(avatar_component_clause,[],[f83]) ).

fof(f85,plain,
    ( empty_set = relation_dom(sK5)
    | ~ spl6_1 ),
    inference(avatar_component_clause,[],[f83]) ).

fof(f87,definition,
    ( spl6_2
  <=> empty_set = relation_rng(sK5) ),
    introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).

fof(f88,plain,
    ( empty_set != relation_rng(sK5)
    | spl6_2 ),
    inference(avatar_component_clause,[],[f87]) ).

fof(f89,plain,
    ( empty_set = relation_rng(sK5)
    | ~ spl6_2 ),
    inference(avatar_component_clause,[],[f87]) ).

fof(f90,plain,
    ( spl6_1
    | spl6_2 ),
    inference(avatar_split_clause,[],[f76,f87,f83]) ).

fof(f91,plain,
    ( ~ spl6_1
    | ~ spl6_2 ),
    inference(avatar_split_clause,[],[f77,f87,f83]) ).

fof(f103,plain,
    ! [X0] :
      ( ~ empty(X0)
      | relation_dom(X0) = empty_set ),
    inference(resolution,[],[f74,f64]) ).

fof(f122,plain,
    ( ~ empty(empty_set)
    | empty(sK5)
    | ~ relation(sK5)
    | ~ spl6_2 ),
    inference(superposition,[],[f62,f89]) ).

fof(f124,plain,
    ( empty(sK5)
    | ~ relation(sK5)
    | ~ spl6_2 ),
    inference(forward_subsumption_resolution,[],[f122,f72]) ).

fof(f125,plain,
    ( empty(sK5)
    | ~ spl6_2 ),
    inference(forward_subsumption_resolution,[],[f124,f75]) ).

fof(f126,plain,
    ( empty_set = relation_dom(sK5)
    | ~ spl6_2 ),
    inference(resolution,[],[f125,f103]) ).

fof(f129,plain,
    ( $false
    | spl6_1
    | ~ spl6_2 ),
    inference(forward_subsumption_resolution,[],[f126,f84]) ).

fof(f130,plain,
    ( spl6_1
    | ~ spl6_2 ),
    inference(avatar_contradiction_clause,[],[f129]) ).

fof(f131,plain,
    ( ~ empty(empty_set)
    | empty(sK5)
    | ~ relation(sK5)
    | ~ spl6_1 ),
    inference(superposition,[],[f61,f85]) ).

fof(f134,plain,
    ( empty(sK5)
    | ~ relation(sK5)
    | ~ spl6_1 ),
    inference(forward_subsumption_resolution,[],[f131,f72]) ).

fof(f135,plain,
    ( empty(sK5)
    | ~ spl6_1 ),
    inference(forward_subsumption_resolution,[],[f134,f75]) ).

fof(f137,plain,
    ( empty_set = sK5
    | ~ spl6_1 ),
    inference(resolution,[],[f135,f74]) ).

fof(f139,plain,
    ( empty_set != relation_rng(empty_set)
    | ~ spl6_1
    | spl6_2 ),
    inference(superposition,[],[f88,f137]) ).

fof(f143,plain,
    ( $false
    | ~ spl6_1
    | spl6_2 ),
    inference(forward_subsumption_resolution,[],[f139,f78]) ).

fof(f144,plain,
    ( ~ spl6_1
    | spl6_2 ),
    inference(avatar_contradiction_clause,[],[f143]) ).

cnf(s1,plain,
    ( spl6_1
    | spl6_2 ),
    inference(sat_conversion,[],[f90]) ).

cnf(s2,plain,
    ( ~ spl6_1
    | ~ spl6_2 ),
    inference(sat_conversion,[],[f91]) ).

cnf(s3,plain,
    ( spl6_1
    | ~ spl6_2 ),
    inference(sat_conversion,[],[f130]) ).

cnf(s4,plain,
    ( ~ spl6_1
    | spl6_2 ),
    inference(sat_conversion,[],[f144]) ).

cnf(s5,plain,
    spl6_1,
    inference(rat,[],[s1,s3]) ).

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

cnf(s7,plain,
    $false,
    inference(rat,[],[s2,s6,s5]) ).

fof(f145,plain,
    $false,
    inference(avatar_sat_refutation,[],[s7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU189+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.36  % Computer : n003.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 28 03:59:42 UTC 2026
% 0.04/0.36  % CPUTime  : 
% 0.04/0.36  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.04/0.39  Running first-order model finding
% 0.04/0.39  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.04/0.44  % (1171771)Will run a generic schedule for satisfiability detection.
% 0.04/0.44  % (1171776)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1386455843_2999 on theBenchmark for (2999ds/0Mi)
% 0.04/0.44  % TRYING [1]
% 0.04/0.44  % TRYING [2]
% 0.04/0.44  % TRYING [3]
% 0.04/0.44  % TRYING [4]
% 0.04/0.44  % TRYING [5]
% 0.04/0.44  % TRYING [6]
% 0.04/0.44  % (1171777)% WARNING: option uhcvi not known.
% 0.04/0.44  % TRYING [7]
% 0.04/0.44  % TRYING [8]
% 0.04/0.44  % TRYING [9]
% 0.04/0.44  % (1171778)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3620997628:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.04/0.44  % (1171779)dis+10_1_sil=32000:sp=arity:random_seed=4057858500:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.04/0.44  % (1171782)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3883797933:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.04/0.44  % (1171780)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3595112674:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.04/0.44  % (1171781)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1007615966:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.04/0.44  % (1171777)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1513574445:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.04/0.44  % TRYING [10]
% 0.04/0.44  % (1171779) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1171771-1171779"...
% 0.04/0.44  % (1171782) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1171771-1171782"...
% 0.04/0.44  % (1171780) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1171771-1171780"...
% 0.04/0.44  % TRYING [11]
% 0.04/0.44  % (1171781) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1171771-1171781"...
% 0.04/0.44  % (1171777) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1171771-1171777"...
% 0.04/0.44  % (1171779)...printing done.
% 0.04/0.44  % (1171782)...printing done.
% 0.04/0.44  % (1171780)...printing done.
% 0.04/0.44  % (1171781)...printing done.
% 0.04/0.44  % (1171778) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1171771-1171778"...
% 0.04/0.44  % (1171777)...printing done.
% 0.04/0.44  % TRYING [12]
% 0.04/0.44  % (1171779)Refutation found. Thanks to Tanya!
% 0.04/0.44  % SZS status Theorem for theBenchmark
% 0.04/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.04/0.44  % (1171779)------------------------------
% 0.04/0.44  % (1171779)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.04/0.44  % (1171779)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.04/0.44  % (1171779)CaDiCaL version: 2.1.3
% 0.04/0.44  % (1171779)Termination reason: Refutation
% 0.04/0.44  % (1171779)Time elapsed: 0.004 s
% 0.04/0.44  % (1171779)Peak memory usage: 12 MB
% 0.04/0.44  % (1171779)Instructions burned: 3 (million)
% 0.04/0.44  % (1171771)Success in time 0.037 s
% 0.04/0.44  % Vampire exiting
%------------------------------------------------------------------------------