↑ 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  : SET014+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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:42:35 PM UTC 2026

% Result   : Theorem 0.13s 0.44s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   35 (  11 unt;   2 def)
%            Number of atoms       :   68 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   55 (  22   ~;  19   |;   6   &)
%                                         (   5 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   33 (   0 sgn  27   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1,X2] :
      ( member(X2,union(X0,X1))
    <=> ( member(X2,X0)
        | member(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( member(X2,X0)
         => member(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).

fof(f6,conjecture,
    ! [X0,X1,X2] :
      ( ( subset(X0,X1)
        & subset(X2,X1) )
     => subset(union(X0,X2),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_union_subset) ).

fof(f7,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( subset(X0,X1)
          & subset(X2,X1) )
       => subset(union(X0,X2),X1) ),
    inference(negated_conjecture,[status(cth)],[f6]) ).

fof(f8,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( member(X2,X1)
          | ~ member(X2,X0) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f9,plain,
    ? [X0,X1,X2] :
      ( ~ subset(union(X0,X2),X1)
      & subset(X0,X1)
      & subset(X2,X1) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f10,plain,
    ? [X0,X1,X2] :
      ( ~ subset(union(X0,X2),X1)
      & subset(X0,X1)
      & subset(X2,X1) ),
    inference(flattening,[],[f9]) ).

fof(f11,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,union(X0,X1))
      | member(X2,X0)
      | member(X2,X1) ),
    inference(cnf_transformation,[],[f1]) ).

fof(f14,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X0,X1)
      | member(X2,X1)
      | ~ member(X2,X0) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | member(sK0(X0,X1),X0) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | ~ member(sK0(X0,X1),X1) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f23,plain,
    subset(sK4,sK3),
    inference(cnf_transformation,[],[f10]) ).

fof(f24,plain,
    subset(sK2,sK3),
    inference(cnf_transformation,[],[f10]) ).

fof(f25,plain,
    ~ subset(union(sK2,sK4),sK3),
    inference(cnf_transformation,[],[f10]) ).

fof(f32,plain,
    member(sK0(union(sK2,sK4),sK3),union(sK2,sK4)),
    inference(resolution,[],[f15,f25]) ).

fof(f33,plain,
    ~ member(sK0(union(sK2,sK4),sK3),sK3),
    inference(resolution,[],[f16,f25]) ).

fof(f34,plain,
    ! [X0] :
      ( ~ member(X0,sK4)
      | member(X0,sK3) ),
    inference(resolution,[],[f14,f23]) ).

fof(f35,plain,
    ! [X0] :
      ( ~ member(X0,sK2)
      | member(X0,sK3) ),
    inference(resolution,[],[f14,f24]) ).

fof(f41,plain,
    ( member(sK0(union(sK2,sK4),sK3),sK2)
    | member(sK0(union(sK2,sK4),sK3),sK4) ),
    inference(resolution,[],[f11,f32]) ).

fof(f45,definition,
    ( spl5_1
  <=> member(sK0(union(sK2,sK4),sK3),sK4) ),
    introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).

fof(f47,plain,
    ( member(sK0(union(sK2,sK4),sK3),sK4)
    | ~ spl5_1 ),
    inference(avatar_component_clause,[],[f45]) ).

fof(f49,definition,
    ( spl5_2
  <=> member(sK0(union(sK2,sK4),sK3),sK2) ),
    introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).

fof(f51,plain,
    ( member(sK0(union(sK2,sK4),sK3),sK2)
    | ~ spl5_2 ),
    inference(avatar_component_clause,[],[f49]) ).

fof(f52,plain,
    ( spl5_1
    | spl5_2 ),
    inference(avatar_split_clause,[],[f41,f49,f45]) ).

fof(f60,plain,
    ( member(sK0(union(sK2,sK4),sK3),sK3)
    | ~ spl5_2 ),
    inference(resolution,[],[f51,f35]) ).

fof(f61,plain,
    ( $false
    | ~ spl5_2 ),
    inference(forward_subsumption_resolution,[],[f60,f33]) ).

fof(f62,plain,
    ~ spl5_2,
    inference(avatar_contradiction_clause,[],[f61]) ).

fof(f71,plain,
    ( member(sK0(union(sK2,sK4),sK3),sK3)
    | ~ spl5_1 ),
    inference(resolution,[],[f47,f34]) ).

fof(f72,plain,
    ( $false
    | ~ spl5_1 ),
    inference(forward_subsumption_resolution,[],[f71,f33]) ).

fof(f73,plain,
    ~ spl5_1,
    inference(avatar_contradiction_clause,[],[f72]) ).

cnf(s1,plain,
    ( spl5_1
    | spl5_2 ),
    inference(sat_conversion,[],[f52]) ).

cnf(s2,plain,
    ~ spl5_2,
    inference(sat_conversion,[],[f62]) ).

cnf(s3,plain,
    ~ spl5_1,
    inference(sat_conversion,[],[f73]) ).

cnf(s4,plain,
    $false,
    inference(rat,[],[s1,s2,s3]) ).

fof(f74,plain,
    $false,
    inference(avatar_sat_refutation,[],[s4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET014+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.35  % Computer : n003.cluster.edu
% 0.11/0.35  % Model    : x86_64 x86_64
% 0.11/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35  % Memory   : 8046.5625MB
% 0.11/0.35  % OS       : Linux 6.8.0-71-generic
% 0.11/0.35  % CPULimit : 300
% 0.11/0.35  % WCLimit  : 300
% 0.11/0.35  % DateTime : Mon Sep 28 00:05:41 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39  Running first-order model finding
% 0.13/0.39  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.13/0.44  % (1066986)Will run a generic schedule for satisfiability detection.
% 0.13/0.44  % (1066994)dis+10_1_sil=32000:sp=arity:random_seed=3819931120:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.13/0.44  % (1066992)% WARNING: option uhcvi not known.
% 0.13/0.44  % (1066991)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=813111649_2999 on theBenchmark for (2999ds/0Mi)
% 0.13/0.44  % (1066993)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1733819340:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.13/0.44  % (1066995)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=606694959:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/0.44  % (1066996)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2528352619:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.13/0.44  % (1066997)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=830409056:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.13/0.44  % TRYING [1]
% 0.13/0.44  % (1066992)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3518221797:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.13/0.44  % TRYING [2]
% 0.13/0.44  % TRYING [3]
% 0.13/0.44  % TRYING [4]
% 0.13/0.44  % (1066997) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1066986-1066997"...
% 0.13/0.44  % (1066995) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1066986-1066995"...
% 0.13/0.44  % (1066996) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1066986-1066996"...
% 0.13/0.44  % (1066995)...printing done.
% 0.13/0.44  % (1066997)...printing done.
% 0.13/0.44  % (1066996)...printing done.
% 0.13/0.44  % TRYING [5]
% 0.13/0.44  % (1066995)Refutation found. Thanks to Tanya!
% 0.13/0.44  % SZS status Theorem for theBenchmark
% 0.13/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.45  % (1066995)------------------------------
% 0.13/0.45  % (1066995)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.45  % (1066995)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.45  % (1066995)CaDiCaL version: 2.1.3
% 0.13/0.45  % (1066995)Termination reason: Refutation
% 0.13/0.45  % (1066995)Time elapsed: 0.003 s
% 0.13/0.45  % (1066995)Peak memory usage: 12 MB
% 0.13/0.45  % (1066995)Instructions burned: 3 (million)
% 0.13/0.45  % (1066986)Success in time 0.045 s
% 0.13/0.45  % Vampire exiting
%------------------------------------------------------------------------------