↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n016.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:40:48 PM UTC 2026

% Result   : Unsatisfiable 8.24s 2.23s
% Output   : Refutation 10.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   38
% Syntax   : Number of formulae    :  148 (  43 unt;  13 def)
%            Number of atoms       :  407 (  51 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  511 ( 252   ~; 252   |;   0   &)
%                                         (   7 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :   11 (   9 usr;   8 prp; 0-2 aty)
%            Number of functors    :   23 (  23 usr;   9 con; 0-3 aty)
%            Number of variables   :  215 (   0 sgn 215   !;   0   ?)

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

fof(f2,axiom,
    ! [X0,X1] :
      ( member(not_subclass_element(X0,X1),X0)
      | subclass(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_subclass_members1) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( ~ member(not_subclass_element(X0,X1),X1)
      | subclass(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_subclass_members2) ).

fof(f4,axiom,
    ! [X0] : subclass(X0,universal_class),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',class_elements_are_sets) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( ~ subclass(X1,X0)
      | ~ subclass(X0,X1)
      | X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subclass_implies_equal) ).

fof(f10,axiom,
    ! [X0,X1] :
      ( member(X0,unordered_pair(X1,X0))
      | ~ member(X0,universal_class) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair3) ).

fof(f11,axiom,
    ! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pairs_in_universal) ).

fof(f12,axiom,
    ! [X0] : unordered_pair(X0,X0) = singleton(X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_set) ).

fof(f13,axiom,
    ! [X0,X1] : unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))) = ordered_pair(X0,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordered_pair) ).

fof(f15,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
      | member(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartesian_product2) ).

fof(f16,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ member(X0,X1)
      | ~ member(X2,X3)
      | member(ordered_pair(X0,X2),cross_product(X1,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartesian_product3) ).

fof(f21,axiom,
    ! [X2,X0,X1] :
      ( ~ member(X0,intersection(X1,X2))
      | member(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection1) ).

fof(f22,axiom,
    ! [X2,X0,X1] :
      ( ~ member(X0,intersection(X1,X2))
      | member(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection2) ).

fof(f23,axiom,
    ! [X2,X0,X1] :
      ( member(X0,intersection(X1,X2))
      | ~ member(X0,X2)
      | ~ member(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection3) ).

fof(f24,axiom,
    ! [X0,X1] :
      ( ~ member(X0,complement(X1))
      | ~ member(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement1) ).

fof(f28,axiom,
    ! [X2,X0,X1] : intersection(X0,cross_product(X1,X2)) = restrict(X0,X1,X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',restriction1) ).

fof(f31,axiom,
    ! [X0,X1] :
      ( ~ member(X0,universal_class)
      | restrict(X1,singleton(X0),universal_class) = null_class
      | member(X0,domain_of(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain2) ).

fof(f32,plain,
    ! [X0,X1] :
      ( ~ member(X0,universal_class)
      | null_class = restrict(X1,singleton(X0),universal_class)
      | member(X0,domain_of(X1)) ),
    inference(reorient_equations,[],[f31]) ).

fof(f38,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ member(ordered_pair(ordered_pair(X0,X1),X2),X3)
      | ~ member(ordered_pair(ordered_pair(X1,X0),X2),cross_product(cross_product(universal_class,universal_class),universal_class))
      | member(ordered_pair(ordered_pair(X1,X0),X2),flip(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',flip3) ).

fof(f39,axiom,
    ! [X0] : domain_of(flip(cross_product(X0,universal_class))) = inverse(X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).

fof(f40,axiom,
    ! [X0] : domain_of(inverse(X0)) = range_of(X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',range_of) ).

fof(f43,axiom,
    ! [X0,X1] : range_of(restrict(X0,X1,universal_class)) = image(X0,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',image) ).

fof(f67,axiom,
    ! [X0] :
      ( X0 = null_class
      | member(regular(X0),X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',regularity1) ).

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

fof(f69,axiom,
    ! [X0] :
      ( X0 = null_class
      | intersection(X0,regular(X0)) = null_class ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',regularity2) ).

fof(f70,plain,
    ! [X0] :
      ( null_class = intersection(X0,regular(X0))
      | null_class = X0 ),
    inference(reorient_equations,[],[f69]) ).

fof(f122,negated_conjecture,
    image(universal_class,x) != universal_class,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_image_under_universal_class_1) ).

fof(f123,plain,
    universal_class != image(universal_class,x),
    inference(reorient_equations,[],[f122]) ).

fof(f124,negated_conjecture,
    x != null_class,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_image_under_universal_class_2) ).

fof(f125,plain,
    null_class != x,
    inference(reorient_equations,[],[f124]) ).

fof(f127,plain,
    ! [X0] : range_of(X0) = domain_of(domain_of(flip(cross_product(X0,universal_class)))),
    inference(definition_unfolding,[],[f40,f39]) ).

fof(f128,plain,
    ! [X0,X1] : image(X0,X1) = domain_of(domain_of(flip(cross_product(intersection(X0,cross_product(X1,universal_class)),universal_class)))),
    inference(definition_unfolding,[],[f43,f127,f28]) ).

fof(f130,plain,
    ! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
    inference(definition_unfolding,[],[f13,f12,f12]) ).

fof(f140,plain,
    ! [X2,X3,X0,X1] :
      ( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),cross_product(X2,X3))
      | member(X1,X3) ),
    inference(definition_unfolding,[],[f15,f130]) ).

fof(f141,plain,
    ! [X2,X3,X0,X1] :
      ( member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X2,X2))),cross_product(X1,X3))
      | ~ member(X2,X3)
      | ~ member(X0,X1) ),
    inference(definition_unfolding,[],[f16,f130]) ).

fof(f147,plain,
    ! [X0,X1] :
      ( null_class = intersection(X1,cross_product(unordered_pair(X0,X0),universal_class))
      | ~ member(X0,universal_class)
      | member(X0,domain_of(X1)) ),
    inference(definition_unfolding,[],[f32,f28,f12]) ).

fof(f151,plain,
    ! [X2,X3,X0,X1] :
      ( ~ member(unordered_pair(unordered_pair(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0)))),unordered_pair(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),unordered_pair(X2,X2))),cross_product(cross_product(universal_class,universal_class),universal_class))
      | ~ member(unordered_pair(unordered_pair(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1)))),unordered_pair(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),unordered_pair(X2,X2))),X3)
      | member(unordered_pair(unordered_pair(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0)))),unordered_pair(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),unordered_pair(X2,X2))),flip(X3)) ),
    inference(definition_unfolding,[],[f38,f130,f130,f130,f130,f130,f130]) ).

fof(f188,plain,
    universal_class != domain_of(domain_of(flip(cross_product(intersection(universal_class,cross_product(x,universal_class)),universal_class)))),
    inference(definition_unfolding,[],[f123,f128]) ).

fof(f193,definition,
    sF0 = cross_product(x,universal_class),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f194,plain,
    cross_product(x,universal_class) = sF0,
    inference(reorient_equations,[],[f193]) ).

fof(f195,definition,
    sF1 = intersection(universal_class,sF0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f196,plain,
    intersection(universal_class,sF0) = sF1,
    inference(reorient_equations,[],[f195]) ).

fof(f197,definition,
    sF2 = cross_product(sF1,universal_class),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f198,plain,
    cross_product(sF1,universal_class) = sF2,
    inference(reorient_equations,[],[f197]) ).

fof(f199,definition,
    sF3 = flip(sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f200,plain,
    flip(sF2) = sF3,
    inference(reorient_equations,[],[f199]) ).

fof(f201,definition,
    sF4 = domain_of(sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f202,plain,
    domain_of(sF3) = sF4,
    inference(reorient_equations,[],[f201]) ).

fof(f203,definition,
    sF5 = domain_of(sF4),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f204,plain,
    domain_of(sF4) = sF5,
    inference(reorient_equations,[],[f203]) ).

fof(f205,plain,
    universal_class != sF5,
    inference(definition_folding,[],[f188,f204,f202,f200,f198,f196,f194]) ).

fof(f208,plain,
    ! [X2,X0,X1] :
      ( member(not_subclass_element(intersection(X0,X1),X2),X0)
      | subclass(intersection(X0,X1),X2) ),
    inference(resolution,[],[f21,f2]) ).

fof(f212,plain,
    ! [X0] :
      ( member(X0,sF0)
      | ~ member(X0,sF1) ),
    inference(superposition,[],[f22,f196]) ).

fof(f216,plain,
    ! [X0,X1] :
      ( member(X0,X1)
      | ~ member(X0,null_class)
      | null_class = X1 ),
    inference(superposition,[],[f21,f70]) ).

fof(f225,plain,
    ! [X0,X1] :
      ( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),sF0)
      | member(X1,universal_class) ),
    inference(superposition,[],[f140,f194]) ).

fof(f252,plain,
    ! [X0] :
      ( member(X0,sF1)
      | ~ member(X0,sF0)
      | ~ member(X0,universal_class) ),
    inference(superposition,[],[f23,f196]) ).

fof(f280,plain,
    ! [X2,X0,X1] :
      ( ~ member(X0,cross_product(unordered_pair(X2,X2),universal_class))
      | member(X0,null_class)
      | ~ member(X0,X1)
      | ~ member(X2,universal_class)
      | member(X2,domain_of(X1)) ),
    inference(superposition,[],[f23,f147]) ).

fof(f295,plain,
    ! [X0,X1] :
      ( ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),sF1)
      | member(X0,universal_class) ),
    inference(resolution,[],[f225,f212]) ).

fof(f332,plain,
    ! [X0,X1] :
      ( member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),sF0)
      | ~ member(X1,universal_class)
      | ~ member(X0,x) ),
    inference(superposition,[],[f141,f194]) ).

fof(f333,plain,
    ! [X0,X1] :
      ( member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),sF2)
      | ~ member(X1,universal_class)
      | ~ member(X0,sF1) ),
    inference(superposition,[],[f141,f198]) ).

fof(f374,plain,
    ! [X0,X1] :
      ( ~ member(not_subclass_element(X0,X1),null_class)
      | null_class = X1
      | subclass(X0,X1) ),
    inference(resolution,[],[f216,f3]) ).

fof(f600,definition,
    ( spl6_13
  <=> ! [X0] : ~ member(X0,universal_class) ),
    introduced(definition,[new_symbols(definition,[spl6_13])],[avatar_definition]) ).

fof(f601,plain,
    ( ! [X0] : ~ member(X0,universal_class)
    | ~ spl6_13 ),
    inference(avatar_component_clause,[],[f600]) ).

fof(f787,plain,
    ! [X0] :
      ( null_class = X0
      | subclass(null_class,X0)
      | subclass(null_class,X0) ),
    inference(resolution,[],[f374,f2]) ).

fof(f790,plain,
    ! [X0] :
      ( subclass(null_class,X0)
      | null_class = X0 ),
    inference(duplicate_literal_removal,[],[f787]) ).

fof(f791,plain,
    ! [X0] :
      ( null_class = X0
      | ~ subclass(X0,null_class)
      | null_class = X0 ),
    inference(resolution,[],[f790,f7]) ).

fof(f792,plain,
    ! [X0] :
      ( ~ subclass(X0,null_class)
      | null_class = X0 ),
    inference(duplicate_literal_removal,[],[f791]) ).

fof(f826,plain,
    ! [X0,X1] :
      ( subclass(intersection(X0,X1),X0)
      | subclass(intersection(X0,X1),X0) ),
    inference(resolution,[],[f208,f3]) ).

fof(f840,plain,
    ! [X0,X1] : subclass(intersection(X0,X1),X0),
    inference(duplicate_literal_removal,[],[f826]) ).

fof(f1212,plain,
    ( universal_class = null_class
    | ~ spl6_13 ),
    inference(resolution,[],[f601,f68]) ).

fof(f1220,definition,
    ( spl6_22
  <=> universal_class = null_class ),
    introduced(definition,[new_symbols(definition,[spl6_22])],[avatar_definition]) ).

fof(f1222,plain,
    ( universal_class = null_class
    | ~ spl6_22 ),
    inference(avatar_component_clause,[],[f1220]) ).

fof(f1224,definition,
    ( spl6_23
  <=> ! [X0] : ~ member(X0,null_class) ),
    introduced(definition,[new_symbols(definition,[spl6_23])],[avatar_definition]) ).

fof(f1225,plain,
    ( ! [X0] : ~ member(X0,null_class)
    | ~ spl6_23 ),
    inference(avatar_component_clause,[],[f1224]) ).

fof(f1227,plain,
    ( spl6_22
    | ~ spl6_13 ),
    inference(avatar_split_clause,[],[f1212,f600,f1220]) ).

fof(f1275,plain,
    ! [X0] : null_class = intersection(null_class,X0),
    inference(resolution,[],[f840,f792]) ).

fof(f1570,definition,
    ( spl6_29
  <=> ! [X0,X1] :
        ( ~ member(X0,null_class)
        | member(X0,X1) ) ),
    introduced(definition,[new_symbols(definition,[spl6_29])],[avatar_definition]) ).

fof(f1571,plain,
    ( ! [X0,X1] :
        ( member(X0,X1)
        | ~ member(X0,null_class) )
    | ~ spl6_29 ),
    inference(avatar_component_clause,[],[f1570]) ).

fof(f1914,plain,
    ! [X0,X1] :
      ( ~ member(X0,null_class)
      | member(X0,X1) ),
    inference(superposition,[],[f22,f1275]) ).

fof(f1922,plain,
    spl6_29,
    inference(avatar_split_clause,[],[f1914,f1570]) ).

fof(f1932,plain,
    ( ! [X0,X1] :
        ( ~ member(X0,null_class)
        | ~ member(X0,X1) )
    | ~ spl6_29 ),
    inference(resolution,[],[f1571,f24]) ).

fof(f1944,plain,
    ( ! [X0] : ~ member(X0,null_class)
    | ~ spl6_29 ),
    inference(forward_subsumption_resolution,[],[f1932,f1571]) ).

fof(f1951,plain,
    ( spl6_23
    | ~ spl6_29 ),
    inference(avatar_split_clause,[],[f1944,f1570,f1224]) ).

fof(f2124,plain,
    ! [X2,X3,X0,X1] :
      ( member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),null_class)
      | ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),X2)
      | ~ member(X3,universal_class)
      | member(X3,domain_of(X2))
      | ~ member(X1,universal_class)
      | ~ member(X0,unordered_pair(X3,X3)) ),
    inference(resolution,[],[f280,f141]) ).

fof(f2144,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),X2)
        | ~ member(X3,universal_class)
        | member(X3,domain_of(X2))
        | ~ member(X1,universal_class)
        | ~ member(X0,unordered_pair(X3,X3)) )
    | ~ spl6_23 ),
    inference(forward_subsumption_resolution,[],[f2124,f1225]) ).

fof(f2185,plain,
    ( ! [X0,X1] : member(unordered_pair(X0,X1),null_class)
    | ~ spl6_22 ),
    inference(backward_demodulation,[],[f11,f1222]) ).

fof(f2324,plain,
    ( $false
    | ~ spl6_22
    | ~ spl6_23 ),
    inference(forward_subsumption_resolution,[],[f2185,f1225]) ).

fof(f2325,plain,
    ( ~ spl6_22
    | ~ spl6_23 ),
    inference(avatar_contradiction_clause,[],[f2324]) ).

fof(f2505,plain,
    ! [X2,X3,X0,X1] :
      ( member(unordered_pair(unordered_pair(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0)))),unordered_pair(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),unordered_pair(X2,X2))),flip(X3))
      | ~ member(unordered_pair(unordered_pair(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1)))),unordered_pair(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),unordered_pair(X2,X2))),X3)
      | ~ member(X2,universal_class)
      | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),cross_product(universal_class,universal_class)) ),
    inference(resolution,[],[f151,f141]) ).

fof(f2515,plain,
    ( ! [X2,X3,X0,X1,X4] :
        ( ~ member(unordered_pair(unordered_pair(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1)))),unordered_pair(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),unordered_pair(X2,X2))),X3)
        | ~ member(X2,universal_class)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),cross_product(universal_class,universal_class))
        | ~ member(X4,universal_class)
        | member(X4,domain_of(flip(X3)))
        | ~ member(X2,universal_class)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),unordered_pair(X4,X4)) )
    | ~ spl6_23 ),
    inference(resolution,[],[f2505,f2144]) ).

fof(f2518,plain,
    ( ! [X2,X3,X0,X1,X4] :
        ( ~ member(unordered_pair(unordered_pair(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1)))),unordered_pair(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),unordered_pair(X2,X2))),X3)
        | ~ member(X2,universal_class)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),cross_product(universal_class,universal_class))
        | ~ member(X4,universal_class)
        | member(X4,domain_of(flip(X3)))
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),unordered_pair(X4,X4)) )
    | ~ spl6_23 ),
    inference(duplicate_literal_removal,[],[f2515]) ).

fof(f2535,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ member(X0,universal_class)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(universal_class,universal_class))
        | ~ member(X3,universal_class)
        | member(X3,domain_of(flip(sF2)))
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),unordered_pair(X3,X3))
        | ~ member(X0,universal_class)
        | ~ member(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(X1,X1))),sF1) )
    | ~ spl6_23 ),
    inference(resolution,[],[f2518,f333]) ).

fof(f2537,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ member(X0,universal_class)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(universal_class,universal_class))
        | ~ member(X3,universal_class)
        | member(X3,domain_of(flip(sF2)))
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),unordered_pair(X3,X3))
        | ~ member(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(X1,X1))),sF1) )
    | ~ spl6_23 ),
    inference(duplicate_literal_removal,[],[f2535]) ).

fof(f2540,plain,
    ( ! [X2,X3,X0,X1] :
        ( member(X3,domain_of(sF3))
        | ~ member(X0,universal_class)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(universal_class,universal_class))
        | ~ member(X3,universal_class)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),unordered_pair(X3,X3))
        | ~ member(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(X1,X1))),sF1) )
    | ~ spl6_23 ),
    inference(forward_demodulation,[],[f2537,f200]) ).

fof(f2553,plain,
    ( ! [X2,X3,X0,X1] :
        ( member(X3,sF4)
        | ~ member(X0,universal_class)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(universal_class,universal_class))
        | ~ member(X3,universal_class)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),unordered_pair(X3,X3))
        | ~ member(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(X1,X1))),sF1) )
    | ~ spl6_23 ),
    inference(forward_demodulation,[],[f2540,f202]) ).

fof(f2557,definition,
    ( spl6_36
  <=> ! [X2,X1,X3] :
        ( member(X3,sF4)
        | ~ member(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(X1,X1))),sF1)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),unordered_pair(X3,X3))
        | ~ member(X3,universal_class)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(universal_class,universal_class)) ) ),
    introduced(definition,[new_symbols(definition,[spl6_36])],[avatar_definition]) ).

fof(f2558,plain,
    ( ! [X2,X3,X1] :
        ( ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(universal_class,universal_class))
        | ~ member(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(X1,X1))),sF1)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),unordered_pair(X3,X3))
        | ~ member(X3,universal_class)
        | member(X3,sF4) )
    | ~ spl6_36 ),
    inference(avatar_component_clause,[],[f2557]) ).

fof(f2559,plain,
    ( spl6_13
    | spl6_36
    | ~ spl6_23 ),
    inference(avatar_split_clause,[],[f2553,f1224,f2557,f600]) ).

fof(f2561,plain,
    ( ! [X2,X0,X1] :
        ( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),sF1)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),unordered_pair(X2,X2))
        | ~ member(X2,universal_class)
        | member(X2,sF4)
        | ~ member(X0,universal_class)
        | ~ member(X1,universal_class) )
    | ~ spl6_36 ),
    inference(resolution,[],[f2558,f141]) ).

fof(f2570,plain,
    ( ! [X2,X0,X1] :
        ( ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),unordered_pair(X2,X2))
        | ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),sF1)
        | ~ member(X2,universal_class)
        | member(X2,sF4)
        | ~ member(X0,universal_class) )
    | ~ spl6_36 ),
    inference(forward_subsumption_resolution,[],[f2561,f295]) ).

fof(f2572,plain,
    ( ! [X0,X1] :
        ( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),sF1)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),universal_class)
        | member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),sF4)
        | ~ member(X0,universal_class)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),universal_class) )
    | ~ spl6_36 ),
    inference(resolution,[],[f2570,f10]) ).

fof(f2578,plain,
    ( ! [X0,X1] :
        ( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),sF1)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),universal_class)
        | member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),sF4)
        | ~ member(X0,universal_class) )
    | ~ spl6_36 ),
    inference(duplicate_literal_removal,[],[f2572]) ).

fof(f2582,plain,
    ( ! [X0,X1] :
        ( member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))),sF4)
        | ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),sF1)
        | ~ member(X0,universal_class) )
    | ~ spl6_36 ),
    inference(forward_subsumption_resolution,[],[f2578,f11]) ).

fof(f2585,plain,
    ( ! [X2,X0,X1] :
        ( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),sF1)
        | ~ member(X0,universal_class)
        | ~ member(X2,universal_class)
        | member(X2,domain_of(sF4))
        | ~ member(X0,universal_class)
        | ~ member(X1,unordered_pair(X2,X2)) )
    | ~ spl6_23
    | ~ spl6_36 ),
    inference(resolution,[],[f2582,f2144]) ).

fof(f2587,plain,
    ( ! [X2,X0,X1] :
        ( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),sF1)
        | ~ member(X0,universal_class)
        | ~ member(X2,universal_class)
        | member(X2,domain_of(sF4))
        | ~ member(X1,unordered_pair(X2,X2)) )
    | ~ spl6_23
    | ~ spl6_36 ),
    inference(duplicate_literal_removal,[],[f2585]) ).

fof(f2589,plain,
    ( ! [X2,X0,X1] :
        ( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),sF1)
        | member(X2,sF5)
        | ~ member(X0,universal_class)
        | ~ member(X2,universal_class)
        | ~ member(X1,unordered_pair(X2,X2)) )
    | ~ spl6_23
    | ~ spl6_36 ),
    inference(forward_demodulation,[],[f2587,f204]) ).

fof(f2590,plain,
    ( ! [X2,X0,X1] :
        ( member(X0,sF5)
        | ~ member(X1,universal_class)
        | ~ member(X0,universal_class)
        | ~ member(X2,unordered_pair(X0,X0))
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),sF0)
        | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),universal_class) )
    | ~ spl6_23
    | ~ spl6_36 ),
    inference(resolution,[],[f2589,f252]) ).

fof(f2599,plain,
    ( ! [X2,X0,X1] :
        ( ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),sF0)
        | ~ member(X1,universal_class)
        | ~ member(X0,universal_class)
        | ~ member(X2,unordered_pair(X0,X0))
        | member(X0,sF5) )
    | ~ spl6_23
    | ~ spl6_36 ),
    inference(forward_subsumption_resolution,[],[f2590,f11]) ).

fof(f2611,plain,
    ( ! [X2,X0,X1] :
        ( ~ member(X0,universal_class)
        | ~ member(X1,universal_class)
        | ~ member(X2,unordered_pair(X1,X1))
        | member(X1,sF5)
        | ~ member(X2,universal_class)
        | ~ member(X0,x) )
    | ~ spl6_23
    | ~ spl6_36 ),
    inference(resolution,[],[f2599,f332]) ).

fof(f2622,definition,
    ( spl6_37
  <=> ! [X2,X1] :
        ( ~ member(X1,universal_class)
        | ~ member(X2,universal_class)
        | member(X1,sF5)
        | ~ member(X2,unordered_pair(X1,X1)) ) ),
    introduced(definition,[new_symbols(definition,[spl6_37])],[avatar_definition]) ).

fof(f2623,plain,
    ( ! [X2,X1] :
        ( ~ member(X2,unordered_pair(X1,X1))
        | ~ member(X2,universal_class)
        | member(X1,sF5)
        | ~ member(X1,universal_class) )
    | ~ spl6_37 ),
    inference(avatar_component_clause,[],[f2622]) ).

fof(f2625,definition,
    ( spl6_38
  <=> ! [X0] :
        ( ~ member(X0,universal_class)
        | ~ member(X0,x) ) ),
    introduced(definition,[new_symbols(definition,[spl6_38])],[avatar_definition]) ).

fof(f2626,plain,
    ( ! [X0] :
        ( ~ member(X0,x)
        | ~ member(X0,universal_class) )
    | ~ spl6_38 ),
    inference(avatar_component_clause,[],[f2625]) ).

fof(f2627,plain,
    ( spl6_37
    | spl6_38
    | ~ spl6_23
    | ~ spl6_36 ),
    inference(avatar_split_clause,[],[f2611,f2557,f1224,f2625,f2622]) ).

fof(f2663,plain,
    ( ! [X0] :
        ( ~ member(not_subclass_element(x,X0),universal_class)
        | subclass(x,X0) )
    | ~ spl6_38 ),
    inference(resolution,[],[f2626,f2]) ).

fof(f2679,plain,
    ( ! [X0,X1] :
        ( subclass(x,X0)
        | ~ member(not_subclass_element(x,X0),X1)
        | ~ subclass(X1,universal_class) )
    | ~ spl6_38 ),
    inference(resolution,[],[f2663,f1]) ).

fof(f2680,plain,
    ( ! [X0,X1] :
        ( ~ member(not_subclass_element(x,X0),X1)
        | subclass(x,X0) )
    | ~ spl6_38 ),
    inference(forward_subsumption_resolution,[],[f2679,f4]) ).

fof(f2681,plain,
    ( ! [X0] :
        ( subclass(x,X0)
        | subclass(x,X0) )
    | ~ spl6_38 ),
    inference(resolution,[],[f2680,f2]) ).

fof(f2692,plain,
    ( ! [X0] : subclass(x,X0)
    | ~ spl6_38 ),
    inference(duplicate_literal_removal,[],[f2681]) ).

fof(f2694,plain,
    ( null_class = x
    | ~ spl6_38 ),
    inference(resolution,[],[f2692,f792]) ).

fof(f2695,plain,
    ( $false
    | ~ spl6_38 ),
    inference(forward_subsumption_resolution,[],[f2694,f125]) ).

fof(f2696,plain,
    ~ spl6_38,
    inference(avatar_contradiction_clause,[],[f2695]) ).

fof(f2698,plain,
    ( ! [X0] :
        ( ~ member(X0,universal_class)
        | member(X0,sF5)
        | ~ member(X0,universal_class)
        | ~ member(X0,universal_class) )
    | ~ spl6_37 ),
    inference(resolution,[],[f2623,f10]) ).

fof(f2710,plain,
    ( ! [X0] :
        ( member(X0,sF5)
        | ~ member(X0,universal_class) )
    | ~ spl6_37 ),
    inference(duplicate_literal_removal,[],[f2698]) ).

fof(f2715,plain,
    ( ! [X0] :
        ( ~ member(not_subclass_element(X0,sF5),universal_class)
        | subclass(X0,sF5) )
    | ~ spl6_37 ),
    inference(resolution,[],[f2710,f3]) ).

fof(f2725,plain,
    ( ! [X0,X1] :
        ( subclass(X0,sF5)
        | ~ member(not_subclass_element(X0,sF5),X1)
        | ~ subclass(X1,universal_class) )
    | ~ spl6_37 ),
    inference(resolution,[],[f2715,f1]) ).

fof(f2730,plain,
    ( ! [X0,X1] :
        ( ~ member(not_subclass_element(X0,sF5),X1)
        | subclass(X0,sF5) )
    | ~ spl6_37 ),
    inference(forward_subsumption_resolution,[],[f2725,f4]) ).

fof(f2731,plain,
    ( ! [X0] :
        ( subclass(X0,sF5)
        | subclass(X0,sF5) )
    | ~ spl6_37 ),
    inference(resolution,[],[f2730,f2]) ).

fof(f2749,plain,
    ( ! [X0] : subclass(X0,sF5)
    | ~ spl6_37 ),
    inference(duplicate_literal_removal,[],[f2731]) ).

fof(f2762,plain,
    ( ! [X0] :
        ( ~ subclass(sF5,X0)
        | sF5 = X0 )
    | ~ spl6_37 ),
    inference(resolution,[],[f2749,f7]) ).

fof(f2764,plain,
    ( universal_class = sF5
    | ~ spl6_37 ),
    inference(resolution,[],[f2762,f4]) ).

fof(f2766,plain,
    ( $false
    | ~ spl6_37 ),
    inference(forward_subsumption_resolution,[],[f2764,f205]) ).

fof(f2767,plain,
    ~ spl6_37,
    inference(avatar_contradiction_clause,[],[f2766]) ).

cnf(s20,plain,
    ( ~ spl6_13
    | spl6_22 ),
    inference(sat_conversion,[],[f1227]) ).

cnf(s32,plain,
    spl6_29,
    inference(sat_conversion,[],[f1922]) ).

cnf(s33,plain,
    ( spl6_23
    | ~ spl6_29 ),
    inference(sat_conversion,[],[f1951]) ).

cnf(s42,plain,
    ( ~ spl6_22
    | ~ spl6_23 ),
    inference(sat_conversion,[],[f2325]) ).

cnf(s45,plain,
    ( spl6_13
    | ~ spl6_23
    | spl6_36 ),
    inference(sat_conversion,[],[f2559]) ).

cnf(s46,plain,
    ( ~ spl6_23
    | ~ spl6_36
    | spl6_37
    | spl6_38 ),
    inference(sat_conversion,[],[f2627]) ).

cnf(s49,plain,
    ~ spl6_38,
    inference(sat_conversion,[],[f2696]) ).

cnf(s50,plain,
    ~ spl6_37,
    inference(sat_conversion,[],[f2767]) ).

cnf(s51,plain,
    ( ~ spl6_23
    | ~ spl6_36 ),
    inference(rat,[],[s46,s49,s50]) ).

cnf(s52,plain,
    spl6_23,
    inference(rat,[],[s33,s32]) ).

cnf(s53,plain,
    ~ spl6_36,
    inference(rat,[],[s51,s52]) ).

cnf(s54,plain,
    spl6_13,
    inference(rat,[],[s45,s53,s52]) ).

cnf(s55,plain,
    ~ spl6_22,
    inference(rat,[],[s42,s52]) ).

cnf(s56,plain,
    $false,
    inference(rat,[],[s20,s55,s54]) ).

fof(f2768,plain,
    $false,
    inference(avatar_sat_refutation,[],[s56]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET341-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n016.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 28 01:34:33 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.24/2.22  % (3172502)Input is clausal, will run a generic CNF schedule.
% 8.24/2.22  % (3172507)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3066329793:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 8.24/2.22  % (3172509)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2698648102:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 8.24/2.22  % (3172508)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=4109262610:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 8.24/2.22  % (3172510)lrs+10_1_sil=8000:sp=occurrence:random_seed=1261611104:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 8.24/2.22  % (3172512)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4074561371:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 8.24/2.22  % (3172513)dis-21_1_sil=8000:lcm=predicate:random_seed=3976943841:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 8.24/2.22  % (3172511)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2717331465:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 8.24/2.22  % (3172510)Instruction limit reached! 
% 8.24/2.22  % (3172510)------------------------------
% 8.24/2.22  % (3172510)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.24/2.22  % (3172510)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.24/2.22  % (3172510)CaDiCaL version: 2.1.3
% 8.24/2.22  % (3172510)Termination reason: Instruction limit
% 8.24/2.22  % (3172510)Termination phase: Saturation
% 8.24/2.22  % (3172510)Time elapsed: 0.040 s
% 8.24/2.22  % (3172510)Peak memory usage: 88 MB
% 8.24/2.22  % (3172510)Instructions burned: 110 (million)
% 8.24/2.22  % (3172511)Instruction limit reached! 
% 8.24/2.22  % (3172511)------------------------------
% 8.24/2.22  % (3172511)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.24/2.22  % (3172511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.24/2.22  % (3172511)CaDiCaL version: 2.1.3
% 8.24/2.22  % (3172511)Termination reason: Instruction limit
% 8.24/2.22  % (3172511)Termination phase: Saturation
% 8.24/2.22  % (3172511)Time elapsed: 0.067 s
% 8.24/2.22  % (3172511)Peak memory usage: 89 MB
% 8.24/2.22  % (3172511)Instructions burned: 116 (million)
% 8.24/2.22  % (3172513)Instruction limit reached! 
% 8.24/2.22  % (3172513)------------------------------
% 8.24/2.22  % (3172513)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.24/2.22  % (3172513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.24/2.22  % (3172513)CaDiCaL version: 2.1.3
% 8.24/2.22  % (3172513)Termination reason: Instruction limit
% 8.24/2.22  % (3172513)Termination phase: Saturation
% 8.24/2.22  % (3172513)Time elapsed: 0.071 s
% 8.24/2.22  % (3172513)Peak memory usage: 89 MB
% 8.24/2.22  % (3172513)Instructions burned: 117 (million)
% 8.24/2.22  % (3172512)Instruction limit reached! 
% 8.24/2.22  % (3172512)------------------------------
% 8.24/2.22  % (3172512)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.24/2.22  % (3172512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.24/2.22  % (3172512)CaDiCaL version: 2.1.3
% 8.24/2.22  % (3172512)Termination reason: Instruction limit
% 8.24/2.22  % (3172512)Termination phase: Saturation
% 8.24/2.22  % (3172512)Time elapsed: 0.136 s
% 8.24/2.22  % (3172512)Peak memory usage: 90 MB
% 8.24/2.22  % (3172512)Instructions burned: 181 (million)
% 8.24/2.22  % (3172521)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=1747863892:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 8.24/2.22  % (3172521)Refutation not found, incomplete strategy
% 8.24/2.22  % (3172521)------------------------------
% 8.24/2.22  % (3172521)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.24/2.22  % (3172521)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.24/2.22  % (3172521)CaDiCaL version: 2.1.3
% 8.24/2.22  % (3172521)Termination reason: Refutation not found, incomplete strategy
% 8.24/2.22  % (3172521)Time elapsed: 0.004 s
% 8.24/2.22  % (3172521)Peak memory usage: 88 MB
% 8.24/2.22  % (3172521)Instructions burned: 4 (million)
% 8.24/2.22  % (3172523)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2325963559:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 8.24/2.22  % (3172522)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=4126390787:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 8.24/2.22  % (3172523)Refutation not found, incomplete strategy
% 8.24/2.22  % (3172523)------------------------------
% 8.24/2.22  % (3172523)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.24/2.22  % (3172523)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.24/2.22  % (3172523)CaDiCaL version: 2.1.3
% 8.24/2.22  % (3172523)Termination reason: Refutation not found, incomplete strategy
% 8.24/2.22  % (3172523)Time elapsed: 0.003 s
% 8.24/2.22  % (3172523)Peak memory usage: 87 MB
% 8.24/2.22  % (3172523)Instructions burned: 3 (million)
% 8.24/2.22  % (3172524)lrs+10_64_to=lpo:sil=8000:random_seed=4240562076:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 8.24/2.22  % (3172522)Instruction limit reached! 
% 8.24/2.22  % (3172522)------------------------------
% 8.24/2.22  % (3172522)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.24/2.22  % (3172522)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.24/2.22  % (3172522)CaDiCaL version: 2.1.3
% 8.24/2.22  % (3172522)Termination reason: Instruction limit
% 8.24/2.22  % (3172522)Termination phase: Saturation
% 8.24/2.22  % (3172522)Time elapsed: 0.102 s
% 8.24/2.22  % (3172522)Peak memory usage: 90 MB
% 8.24/2.22  % (3172522)Instructions burned: 189 (million)
% 8.24/2.22  % (3172524)Instruction limit reached! 
% 8.24/2.22  % (3172524)------------------------------
% 8.24/2.22  % (3172524)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.24/2.22  % (3172524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.24/2.22  % (3172524)CaDiCaL version: 2.1.3
% 8.24/2.22  % (3172524)Termination reason: Instruction limit
% 8.24/2.22  % (3172524)Termination phase: Saturation
% 8.24/2.22  % (3172524)Time elapsed: 0.079 s
% 8.24/2.22  % (3172524)Peak memory usage: 89 MB
% 8.24/2.22  % (3172524)Instructions burned: 126 (million)
% 8.24/2.22  % (3172521)------------------------------
% 8.24/2.22  % (3172521)------------------------------
% 8.24/2.22  % (3172523)------------------------------
% 8.24/2.22  % (3172523)------------------------------
% 8.24/2.22  % (3172529)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=1459630897:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 8.24/2.22  % (3172530)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=3654209287:i=157:gtg=all_2994 on theBenchmark for (2994ds/157Mi)
% 8.24/2.22  % (3172531)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=2974361393:i=3394:sd=4:ss=included:sgt=64_2993 on theBenchmark for (2993ds/3394Mi)
% 8.24/2.22  % (3172532)lrs+1011_5_to=lpo:sil=8000:tgt=full:plsq=on:prc=on:drc=off:plsqr=31,4:sp=occurrence:urr=on:nwc=0.8:s2agt=16:br=off:random_seed=665872341:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2993 on theBenchmark for (2993ds/106Mi)
% 8.24/2.22  % (3172529)Instruction limit reached! 
% 8.24/2.22  % (3172529)------------------------------
% 8.24/2.22  % (3172529)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.24/2.23  % (3172529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.24/2.23  % (3172529)CaDiCaL version: 2.1.3
% 8.24/2.23  % (3172529)Termination reason: Instruction limit
% 8.24/2.23  % (3172529)Termination phase: Saturation
% 8.24/2.23  % (3172529)Time elapsed: 0.121 s
% 8.24/2.23  % (3172529)Peak memory usage: 89 MB
% 8.24/2.23  % (3172529)Instructions burned: 194 (million)
% 8.24/2.23  % (3172530)Instruction limit reached! 
% 8.24/2.23  % (3172530)------------------------------
% 8.24/2.23  % (3172530)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.24/2.23  % (3172530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.24/2.23  % (3172530)CaDiCaL version: 2.1.3
% 8.24/2.23  % (3172530)Termination reason: Instruction limit
% 8.24/2.23  % (3172530)Termination phase: Saturation
% 8.24/2.23  % (3172530)Time elapsed: 0.108 s
% 8.24/2.23  % (3172530)Peak memory usage: 91 MB
% 8.24/2.23  % (3172530)Instructions burned: 158 (million)
% 8.24/2.23  % (3172532)Instruction limit reached! 
% 8.24/2.23  % (3172532)------------------------------
% 8.24/2.23  % (3172532)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.24/2.23  % (3172532)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.24/2.23  % (3172532)CaDiCaL version: 2.1.3
% 8.24/2.23  % (3172532)Termination reason: Instruction limit
% 8.24/2.23  % (3172532)Termination phase: Saturation
% 8.24/2.23  % (3172532)Time elapsed: 0.070 s
% 8.24/2.23  % (3172532)Peak memory usage: 89 MB
% 8.24/2.23  % (3172532)Instructions burned: 108 (million)
% 8.24/2.23  % (3172537)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=2718135933:i=107_2992 on theBenchmark for (2992ds/107Mi)
% 8.24/2.23  % (3172537)Refutation not found, incomplete strategy
% 8.24/2.23  % (3172537)------------------------------
% 8.24/2.23  % (3172537)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.24/2.23  % (3172537)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.24/2.23  % (3172537)CaDiCaL version: 2.1.3
% 8.24/2.23  % (3172537)Termination reason: Refutation not found, incomplete strategy
% 8.24/2.23  % (3172537)Time elapsed: 0.005 s
% 8.24/2.23  % (3172537)Peak memory usage: 88 MB
% 8.24/2.23  % (3172537)Instructions burned: 8 (million)
% 8.24/2.23  % (3172538)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=1111700971:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2991 on theBenchmark for (2991ds/242Mi)
% 8.24/2.23  % (3172539)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=3267707131:cond=fast:i=5208:av=off_2991 on theBenchmark for (2991ds/5208Mi)
% 8.24/2.23  % (3172509)First to succeed.
% 8.24/2.23  % (3172509)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3172502"
% 8.24/2.23  % (3172538)Instruction limit reached! 
% 8.24/2.23  % (3172538)------------------------------
% 8.24/2.23  % (3172538)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.24/2.23  % (3172538)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.24/2.23  % (3172538)CaDiCaL version: 2.1.3
% 8.24/2.23  % (3172538)Termination reason: Instruction limit
% 8.24/2.23  % (3172538)Termination phase: Saturation
% 8.24/2.23  % (3172538)Time elapsed: 0.160 s
% 8.24/2.23  % (3172538)Peak memory usage: 91 MB
% 8.24/2.23  % (3172538)Instructions burned: 243 (million)
% 8.24/2.23  % (3172537)------------------------------
% 8.24/2.23  % (3172537)------------------------------
% 8.24/2.23  % (3172543)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=56403006:i=134:sd=2:doe=on:ss=axioms:sgt=14_2988 on theBenchmark for (2988ds/134Mi)
% 8.24/2.23  % (3172544)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=3351419623:i=499:bd=all_2988 on theBenchmark for (2988ds/499Mi)
% 8.24/2.23  % (3172509)Refutation found. Thanks to Tanya!
% 8.24/2.23  % SZS status Unsatisfiable for theBenchmark
% 8.24/2.23  % SZS output start Proof for theBenchmark
% See solution above
% 10.25/2.42  % (3172509)------------------------------
% 10.25/2.42  % (3172509)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.25/2.42  % (3172509)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.25/2.42  % (3172509)CaDiCaL version: 2.1.3
% 10.25/2.42  % (3172509)Termination reason: Refutation
% 10.25/2.42  % (3172509)Time elapsed: 0.926 s
% 10.25/2.42  % (3172509)Peak memory usage: 132 MB
% 10.25/2.42  % (3172509)Instructions burned: 1434 (million)
% 10.25/2.42  % (3172509)------------------------------
% 10.25/2.42  % (3172509)------------------------------
% 10.25/2.42  % (3172502)Success in time 1.366 s
% 10.25/2.42  % Vampire exiting
%------------------------------------------------------------------------------