↑ 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  : SEU097+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/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:51:55 PM UTC 2026

% Result   : Theorem 0.09s 0.44s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   35 (  12 unt;   2 def)
%            Number of atoms       :   67 (   2 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   56 (  24   ~;  17   |;   9   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn  22   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    ! [X0,X1] : symmetric_difference(X0,X1) = set_union2(set_difference(X0,X1),set_difference(X1,X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d6_xboole_0) ).

fof(f17,axiom,
    ! [X0,X1] :
      ( finite(X0)
     => finite(set_difference(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc12_finset_1) ).

fof(f28,axiom,
    ! [X0,X1] :
      ( ( finite(X0)
        & finite(X1) )
     => finite(set_union2(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc9_finset_1) ).

fof(f60,conjecture,
    ! [X0,X1] :
      ( ( finite(X0)
        & finite(X1) )
     => finite(symmetric_difference(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_finset_1) ).

fof(f61,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( finite(X0)
          & finite(X1) )
       => finite(symmetric_difference(X0,X1)) ),
    inference(negated_conjecture,[status(cth)],[f60]) ).

fof(f111,plain,
    ! [X0,X1] :
      ( finite(set_difference(X0,X1))
      | ~ finite(X0) ),
    inference(ennf_transformation,[],[f17]) ).

fof(f118,plain,
    ! [X0,X1] :
      ( finite(set_union2(X0,X1))
      | ~ finite(X0)
      | ~ finite(X1) ),
    inference(ennf_transformation,[],[f28]) ).

fof(f119,plain,
    ! [X0,X1] :
      ( finite(set_union2(X0,X1))
      | ~ finite(X0)
      | ~ finite(X1) ),
    inference(flattening,[],[f118]) ).

fof(f126,plain,
    ? [X0,X1] :
      ( ~ finite(symmetric_difference(X0,X1))
      & finite(X0)
      & finite(X1) ),
    inference(ennf_transformation,[],[f61]) ).

fof(f127,plain,
    ? [X0,X1] :
      ( ~ finite(symmetric_difference(X0,X1))
      & finite(X0)
      & finite(X1) ),
    inference(flattening,[],[f126]) ).

fof(f163,plain,
    ( ~ finite(symmetric_difference(sK26,sK27))
    & finite(sK26)
    & finite(sK27) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK26,sK27]),skolemize(X0,sK26),skolemize(X1,sK27)],[f127]) ).

fof(f188,plain,
    ! [X0,X1] : symmetric_difference(X0,X1) = set_union2(set_difference(X0,X1),set_difference(X1,X0)),
    inference(cnf_transformation,[],[f15]) ).

fof(f190,plain,
    ! [X0,X1] :
      ( finite(set_difference(X0,X1))
      | ~ finite(X0) ),
    inference(cnf_transformation,[],[f111]) ).

fof(f208,plain,
    ! [X0,X1] :
      ( finite(set_union2(X0,X1))
      | ~ finite(X0)
      | ~ finite(X1) ),
    inference(cnf_transformation,[],[f119]) ).

fof(f286,plain,
    finite(sK27),
    inference(cnf_transformation,[],[f163]) ).

fof(f287,plain,
    finite(sK26),
    inference(cnf_transformation,[],[f163]) ).

fof(f288,plain,
    ~ finite(symmetric_difference(sK26,sK27)),
    inference(cnf_transformation,[],[f163]) ).

fof(f300,plain,
    ~ finite(set_union2(set_difference(sK26,sK27),set_difference(sK27,sK26))),
    inference(definition_unfolding,[],[f288,f188]) ).

fof(f1179,plain,
    ( ~ finite(set_difference(sK26,sK27))
    | ~ finite(set_difference(sK27,sK26)) ),
    inference(resolution,[],[f208,f300]) ).

fof(f1187,definition,
    ( spl28_26
  <=> finite(set_difference(sK27,sK26)) ),
    introduced(definition,[new_symbols(definition,[spl28_26])],[avatar_definition]) ).

fof(f1189,plain,
    ( ~ finite(set_difference(sK27,sK26))
    | spl28_26 ),
    inference(avatar_component_clause,[],[f1187]) ).

fof(f1191,definition,
    ( spl28_27
  <=> finite(set_difference(sK26,sK27)) ),
    introduced(definition,[new_symbols(definition,[spl28_27])],[avatar_definition]) ).

fof(f1193,plain,
    ( ~ finite(set_difference(sK26,sK27))
    | spl28_27 ),
    inference(avatar_component_clause,[],[f1191]) ).

fof(f1194,plain,
    ( ~ spl28_26
    | ~ spl28_27 ),
    inference(avatar_split_clause,[],[f1179,f1191,f1187]) ).

fof(f1195,plain,
    ( ~ finite(sK27)
    | spl28_26 ),
    inference(resolution,[],[f1189,f190]) ).

fof(f1196,plain,
    ( $false
    | spl28_26 ),
    inference(forward_subsumption_resolution,[],[f1195,f286]) ).

fof(f1197,plain,
    spl28_26,
    inference(avatar_contradiction_clause,[],[f1196]) ).

fof(f1198,plain,
    ( ~ finite(sK26)
    | spl28_27 ),
    inference(resolution,[],[f1193,f190]) ).

fof(f1199,plain,
    ( $false
    | spl28_27 ),
    inference(forward_subsumption_resolution,[],[f1198,f287]) ).

fof(f1200,plain,
    spl28_27,
    inference(avatar_contradiction_clause,[],[f1199]) ).

cnf(s628,plain,
    ( ~ spl28_26
    | ~ spl28_27 ),
    inference(sat_conversion,[],[f1194]) ).

cnf(s631,plain,
    spl28_26,
    inference(sat_conversion,[],[f1197]) ).

cnf(s635,plain,
    spl28_27,
    inference(sat_conversion,[],[f1200]) ).

cnf(s636,plain,
    $false,
    inference(rat,[],[s628,s635,s631]) ).

fof(f1201,plain,
    $false,
    inference(avatar_sat_refutation,[],[s636]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU097+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.36  % Computer : n002.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:36:22 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.39  Running first-order model finding
% 0.09/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.09/0.44  % (4124123)Will run a generic schedule for satisfiability detection.
% 0.09/0.44  % (4124130)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2176364730:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.44  % (4124129)% WARNING: option uhcvi not known.
% 0.09/0.44  % (4124128)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=645068044_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.44  % (4124133)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2796657379:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.44  % (4124134)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4121393746:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.44  % (4124131)dis+10_1_sil=32000:sp=arity:random_seed=292553073:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.44  % (4124132)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2350949917:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.44  % (4124129)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=826754587:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.44  % (4124130) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4124123-4124130"...
% 0.09/0.44  % TRYING [1]
% 0.09/0.44  % (4124130)...printing done.
% 0.09/0.44  % TRYING [2]
% 0.09/0.44  % TRYING [3]
% 0.09/0.44  % (4124130)Refutation found. Thanks to Tanya!
% 0.09/0.44  % SZS status Theorem for theBenchmark
% 0.09/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.44  % (4124130)------------------------------
% 0.09/0.44  % (4124130)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.44  % (4124130)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.44  % (4124130)CaDiCaL version: 2.1.3
% 0.09/0.44  % (4124130)Termination reason: Refutation
% 0.09/0.44  % (4124130)Time elapsed: 0.012 s
% 0.09/0.44  % (4124130)Peak memory usage: 13 MB
% 0.09/0.44  % (4124130)Instructions burned: 31 (million)
% 0.09/0.44  % (4124123)Success in time 0.042 s
% 0.09/0.44  % Vampire exiting
%------------------------------------------------------------------------------