↑ 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  : SEU158+2 : 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 : n006.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:09 PM UTC 2026

% Result   : Theorem 0.19s 0.46s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   39 (   6 unt;   2 def)
%            Number of atoms       :   80 (   2 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   72 (  31   ~;  32   |;   3   &)
%                                         (   5 <=>;   0  =>;   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-2 aty)
%            Number of variables   :   22 (   0 sgn  18   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f41,axiom,
    ! [X0,X1] :
      ( subset(singleton(X0),X1)
    <=> in(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).

fof(f67,conjecture,
    ! [X0,X1] :
      ( subset(singleton(X0),X1)
    <=> in(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_zfmisc_1) ).

fof(f68,negated_conjecture,
    ~ ! [X0,X1] :
        ( subset(singleton(X0),X1)
      <=> in(X0,X1) ),
    inference(negated_conjecture,[status(cth)],[f67]) ).

fof(f80,axiom,
    ! [X0] : unordered_pair(X0,X0) = singleton(X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).

fof(f122,plain,
    ? [X0,X1] :
      ( subset(singleton(X0),X1)
    <~> in(X0,X1) ),
    inference(ennf_transformation,[],[f68]) ).

fof(f175,plain,
    ! [X0,X1] :
      ( ( subset(singleton(X0),X1)
        | ~ in(X0,X1) )
      & ( in(X0,X1)
        | ~ subset(singleton(X0),X1) ) ),
    inference(nnf_transformation,[],[f41]) ).

fof(f186,plain,
    ? [X0,X1] :
      ( ( ~ in(X0,X1)
        | ~ subset(singleton(X0),X1) )
      & ( in(X0,X1)
        | subset(singleton(X0),X1) ) ),
    inference(nnf_transformation,[],[f122]) ).

fof(f187,plain,
    ( ( ~ in(sK19,sK20)
      | ~ subset(singleton(sK19),sK20) )
    & ( in(sK19,sK20)
      | subset(singleton(sK19),sK20) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20]),skolemize(X0,sK19),skolemize(X1,sK20)],[f186]) ).

fof(f265,plain,
    ! [X0,X1] :
      ( in(X0,X1)
      | ~ subset(singleton(X0),X1) ),
    inference(cnf_transformation,[],[f175]) ).

fof(f266,plain,
    ! [X0,X1] :
      ( subset(singleton(X0),X1)
      | ~ in(X0,X1) ),
    inference(cnf_transformation,[],[f175]) ).

fof(f300,plain,
    ( in(sK19,sK20)
    | subset(singleton(sK19),sK20) ),
    inference(cnf_transformation,[],[f187]) ).

fof(f301,plain,
    ( ~ in(sK19,sK20)
    | ~ subset(singleton(sK19),sK20) ),
    inference(cnf_transformation,[],[f187]) ).

fof(f316,plain,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    inference(cnf_transformation,[],[f80]) ).

fof(f351,plain,
    ! [X0,X1] :
      ( subset(unordered_pair(X0,X0),X1)
      | ~ in(X0,X1) ),
    inference(definition_unfolding,[],[f266,f316]) ).

fof(f352,plain,
    ! [X0,X1] :
      ( ~ subset(unordered_pair(X0,X0),X1)
      | in(X0,X1) ),
    inference(definition_unfolding,[],[f265,f316]) ).

fof(f368,plain,
    ( ~ in(sK19,sK20)
    | ~ subset(unordered_pair(sK19,sK19),sK20) ),
    inference(definition_unfolding,[],[f301,f316]) ).

fof(f369,plain,
    ( in(sK19,sK20)
    | subset(unordered_pair(sK19,sK19),sK20) ),
    inference(definition_unfolding,[],[f300,f316]) ).

fof(f408,definition,
    ( spl23_1
  <=> subset(unordered_pair(sK19,sK19),sK20) ),
    introduced(definition,[new_symbols(definition,[spl23_1])],[avatar_definition]) ).

fof(f409,plain,
    ( ~ subset(unordered_pair(sK19,sK19),sK20)
    | spl23_1 ),
    inference(avatar_component_clause,[],[f408]) ).

fof(f410,plain,
    ( subset(unordered_pair(sK19,sK19),sK20)
    | ~ spl23_1 ),
    inference(avatar_component_clause,[],[f408]) ).

fof(f412,definition,
    ( spl23_2
  <=> in(sK19,sK20) ),
    introduced(definition,[new_symbols(definition,[spl23_2])],[avatar_definition]) ).

fof(f413,plain,
    ( ~ in(sK19,sK20)
    | spl23_2 ),
    inference(avatar_component_clause,[],[f412]) ).

fof(f414,plain,
    ( in(sK19,sK20)
    | ~ spl23_2 ),
    inference(avatar_component_clause,[],[f412]) ).

fof(f415,plain,
    ( spl23_1
    | spl23_2 ),
    inference(avatar_split_clause,[],[f369,f412,f408]) ).

fof(f416,plain,
    ( ~ spl23_1
    | ~ spl23_2 ),
    inference(avatar_split_clause,[],[f368,f412,f408]) ).

fof(f574,plain,
    ( ~ in(sK19,sK20)
    | spl23_1 ),
    inference(resolution,[],[f351,f409]) ).

fof(f580,plain,
    ( $false
    | spl23_1
    | ~ spl23_2 ),
    inference(forward_subsumption_resolution,[],[f574,f414]) ).

fof(f581,plain,
    ( spl23_1
    | ~ spl23_2 ),
    inference(avatar_contradiction_clause,[],[f580]) ).

fof(f591,plain,
    ( in(sK19,sK20)
    | ~ spl23_1 ),
    inference(resolution,[],[f352,f410]) ).

fof(f593,plain,
    ( $false
    | ~ spl23_1
    | spl23_2 ),
    inference(forward_subsumption_resolution,[],[f591,f413]) ).

fof(f594,plain,
    ( ~ spl23_1
    | spl23_2 ),
    inference(avatar_contradiction_clause,[],[f593]) ).

cnf(s1,plain,
    ( spl23_1
    | spl23_2 ),
    inference(sat_conversion,[],[f415]) ).

cnf(s2,plain,
    ( ~ spl23_1
    | ~ spl23_2 ),
    inference(sat_conversion,[],[f416]) ).

cnf(s3,plain,
    ( spl23_1
    | ~ spl23_2 ),
    inference(sat_conversion,[],[f581]) ).

cnf(s4,plain,
    ( ~ spl23_1
    | spl23_2 ),
    inference(sat_conversion,[],[f594]) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU158+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n006.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.39  % CPULimit : 300
% 0.11/0.39  % WCLimit  : 300
% 0.11/0.39  % DateTime : Mon Sep 28 03:47:40 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/0.42  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.19/0.46  % (3560280)Will run a generic schedule for satisfiability detection.
% 0.19/0.46  % (3560288)dis+10_1_sil=32000:sp=arity:random_seed=3171256168:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.46  % (3560286)% WARNING: option uhcvi not known.
% 0.19/0.46  % (3560288) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3560280-3560288"...
% 0.19/0.46  % (3560288)...printing done.
% 0.19/0.46  % (3560285)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=620093671_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.46  % (3560286)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=519595530:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.46  % (3560290)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2131333795:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.46  % (3560287)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=17499945:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.46  % (3560289)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3437534849:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.46  % (3560288)Refutation found. Thanks to Tanya!
% 0.19/0.46  % SZS status Theorem for theBenchmark
% 0.19/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.46  % (3560288)------------------------------
% 0.19/0.46  % (3560288)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.46  % (3560288)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.46  % (3560288)CaDiCaL version: 2.1.3
% 0.19/0.46  % (3560288)Termination reason: Refutation
% 0.19/0.46  % (3560288)Time elapsed: 0.005 s
% 0.19/0.46  % (3560288)Peak memory usage: 12 MB
% 0.19/0.46  % (3560288)Instructions burned: 12 (million)
% 0.19/0.46  % (3560280)Success in time 0.035 s
% 0.19/0.46  % Vampire exiting
%------------------------------------------------------------------------------