↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SET191-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n019.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:43:24 PM UTC 2026

% Result   : Unsatisfiable 0.17s 0.50s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   45 (  13 unt;   2 def)
%            Number of atoms       :   92 (  10 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   94 (  47   ~;  45   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :   32 (   0 sgn  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] :
      ( ~ subclass(X0,X1)
      | ~ member(X2,X0)
      | member(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( subclass(X0,X1)
      | member(not_subclass_element(X0,X1),X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( subclass(X0,X1)
      | ~ member(not_subclass_element(X0,X1),X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).

fof(f4,axiom,
    ! [X0] : subclass(X0,universal_class),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).

fof(f23,axiom,
    ! [X2,X0,X1] :
      ( member(X0,intersection(X1,X2))
      | ~ member(X0,X2)
      | ~ member(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).

fof(f24,axiom,
    ! [X0,X1] :
      ( ~ member(X0,complement(X1))
      | ~ member(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).

fof(f25,axiom,
    ! [X0,X1] :
      ( member(X0,complement(X1))
      | ~ member(X0,universal_class)
      | member(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).

fof(f26,axiom,
    ! [X0,X1] : complement(intersection(complement(X0),complement(X1))) = union(X0,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).

fof(f67,axiom,
    ! [X0] :
      ( X0 = null_class
      | member(regular(X0),X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).

fof(f68,plain,
    ! [X0] :
      ( member(regular(X0),X0)
      | null_class = X0 ),
    inference(reorient_equations,[],[f67]) ).

fof(f122,negated_conjecture,
    union(complement(x),y) = universal_class,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subclass_property8_1) ).

fof(f123,plain,
    universal_class = union(complement(x),y),
    inference(reorient_equations,[],[f122]) ).

fof(f124,negated_conjecture,
    ~ subclass(x,y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subclass_property8_2) ).

fof(f187,plain,
    universal_class = complement(intersection(complement(complement(x)),complement(y))),
    inference(definition_unfolding,[],[f123,f26]) ).

fof(f194,plain,
    ! [X0] :
      ( ~ member(X0,intersection(complement(complement(x)),complement(y)))
      | ~ member(X0,universal_class) ),
    inference(superposition,[],[f24,f187]) ).

fof(f197,plain,
    ( null_class = intersection(complement(complement(x)),complement(y))
    | ~ member(regular(intersection(complement(complement(x)),complement(y))),universal_class) ),
    inference(resolution,[],[f68,f194]) ).

fof(f199,definition,
    ( spl0_1
  <=> member(regular(intersection(complement(complement(x)),complement(y))),universal_class) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f201,plain,
    ( ~ member(regular(intersection(complement(complement(x)),complement(y))),universal_class)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f199]) ).

fof(f203,definition,
    ( spl0_2
  <=> null_class = intersection(complement(complement(x)),complement(y)) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f205,plain,
    ( null_class = intersection(complement(complement(x)),complement(y))
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f203]) ).

fof(f206,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f197,f203,f199]) ).

fof(f207,plain,
    member(not_subclass_element(x,y),x),
    inference(resolution,[],[f2,f124]) ).

fof(f208,plain,
    ~ member(not_subclass_element(x,y),y),
    inference(resolution,[],[f3,f124]) ).

fof(f211,plain,
    ! [X0,X1] :
      ( ~ member(X0,X1)
      | member(X0,universal_class) ),
    inference(resolution,[],[f1,f4]) ).

fof(f246,plain,
    ( ! [X0] : ~ member(regular(intersection(complement(complement(x)),complement(y))),X0)
    | spl0_1 ),
    inference(resolution,[],[f211,f201]) ).

fof(f251,plain,
    ( null_class = intersection(complement(complement(x)),complement(y))
    | spl0_1 ),
    inference(resolution,[],[f246,f68]) ).

fof(f255,plain,
    ( spl0_2
    | spl0_1 ),
    inference(avatar_split_clause,[],[f251,f199,f203]) ).

fof(f260,plain,
    ( ! [X0] :
        ( ~ member(X0,null_class)
        | ~ member(X0,universal_class) )
    | ~ spl0_2 ),
    inference(superposition,[],[f194,f205]) ).

fof(f264,plain,
    ( ! [X0] : ~ member(X0,null_class)
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f260,f211]) ).

fof(f281,plain,
    ( ! [X0] :
        ( member(X0,null_class)
        | ~ member(X0,complement(y))
        | ~ member(X0,complement(complement(x))) )
    | ~ spl0_2 ),
    inference(superposition,[],[f23,f205]) ).

fof(f283,plain,
    ( ! [X0] :
        ( ~ member(X0,complement(complement(x)))
        | ~ member(X0,complement(y)) )
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f281,f264]) ).

fof(f311,plain,
    ( ! [X0] :
        ( ~ member(X0,complement(y))
        | ~ member(X0,universal_class)
        | member(X0,complement(x)) )
    | ~ spl0_2 ),
    inference(resolution,[],[f283,f25]) ).

fof(f322,plain,
    ( ! [X0] :
        ( ~ member(X0,complement(y))
        | member(X0,complement(x)) )
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f311,f211]) ).

fof(f351,plain,
    ( ! [X0] :
        ( member(X0,complement(x))
        | ~ member(X0,universal_class)
        | member(X0,y) )
    | ~ spl0_2 ),
    inference(resolution,[],[f322,f25]) ).

fof(f405,plain,
    ( ! [X0] :
        ( ~ member(X0,universal_class)
        | member(X0,y)
        | ~ member(X0,x) )
    | ~ spl0_2 ),
    inference(resolution,[],[f351,f24]) ).

fof(f409,plain,
    ( ! [X0] :
        ( member(X0,y)
        | ~ member(X0,x) )
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f405,f211]) ).

fof(f413,plain,
    ( ~ member(not_subclass_element(x,y),x)
    | ~ spl0_2 ),
    inference(resolution,[],[f409,f208]) ).

fof(f416,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f413,f207]) ).

fof(f417,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f416]) ).

cnf(s1,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f206]) ).

cnf(s2,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f255]) ).

cnf(s8,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f417]) ).

cnf(s9,plain,
    spl0_1,
    inference(rat,[],[s2,s8]) ).

cnf(s10,plain,
    $false,
    inference(rat,[],[s1,s8,s9]) ).

fof(f418,plain,
    $false,
    inference(avatar_sat_refutation,[],[s10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET191-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39  % Computer : n019.cluster.edu
% 0.11/0.39  % Model    : x86_64 x86_64
% 0.11/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39  % Memory   : 8046.5625MB
% 0.11/0.39  % 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 01:03:34 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/0.42  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.17/0.50  % (3565545)Will run a generic schedule for satisfiability detection.
% 0.17/0.50  % (3565550)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1997609119_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.50  % (3565551)% WARNING: option uhcvi not known.
% 0.17/0.50  % (3565551)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3506655795:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.50  % (3565552)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=278518452:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.50  % (3565553)dis+10_1_sil=32000:sp=arity:random_seed=3926830886:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.50  % (3565554)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2458703079:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.50  % (3565555)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4192158321:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.50  % (3565556)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=884916980:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.50  % (3565554) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3565545-3565554"...
% 0.17/0.50  % (3565554)...printing done.
% 0.17/0.50  % (3565554)Refutation found. Thanks to Tanya!
% 0.17/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.17/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.50  % (3565554)------------------------------
% 0.17/0.50  % (3565554)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.50  % (3565554)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.50  % (3565554)CaDiCaL version: 2.1.3
% 0.17/0.50  % (3565554)Termination reason: Refutation
% 0.17/0.50  % (3565554)Time elapsed: 0.013 s
% 0.17/0.50  % (3565554)Peak memory usage: 12 MB
% 0.17/0.50  % (3565554)Instructions burned: 20 (million)
% 0.17/0.50  % (3565545)Success in time 0.069 s
% 0.17/0.50  % Vampire exiting
%------------------------------------------------------------------------------