↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC282-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n017.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 01:03:16 PM UTC 2026

% Result   : Unsatisfiable 9.17s 2.16s
% Output   : Refutation 11.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   31
%            Number of leaves      :   41
% Syntax   : Number of formulae    :  187 (  39 unt;  17 def)
%            Number of atoms       :  686 (  27 equ)
%            Maximal formula atoms :   11 (   3 avg)
%            Number of connectives : 1004 ( 505   ~; 485   |;   0   &)
%                                         (  14 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   22 (  20 usr;  15 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;  10 con; 0-2 aty)
%            Number of variables   :  218 (   0 sgn 218   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).

fof(f52,axiom,
    ! [X0,X1] : ssList(skaf43(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause52) ).

fof(f53,axiom,
    ! [X0,X1] : ssList(skaf42(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause53) ).

fof(f72,axiom,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | duplicatefreeP(X0)
      | ssItem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause72) ).

fof(f85,axiom,
    ! [X0,X1] :
      ( ssList(app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause85) ).

fof(f86,axiom,
    ! [X0,X1] :
      ( ssList(cons(X0,X1))
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause86) ).

fof(f125,axiom,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) = cons(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause120) ).

fof(f126,plain,
    ! [X0,X1] :
      ( cons(X0,X1) = app(cons(X0,nil),X1)
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    inference(reorient_equations,[],[f125]) ).

fof(f149,axiom,
    ! [X2,X0,X1] :
      ( X0 != X1
      | ~ ssList(X2)
      | ~ ssItem(X1)
      | ~ ssItem(X0)
      | memberP(cons(X1,X2),X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause138) ).

fof(f151,axiom,
    ! [X2,X0,X1] :
      ( memberP(app(X0,X2),X1)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ memberP(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause140) ).

fof(f161,axiom,
    ! [X2,X0,X1] :
      ( app(app(X2,X1),X0) = app(X2,app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause149) ).

fof(f182,axiom,
    ! [X0,X1] :
      ( app(skaf42(X0,X1),cons(X1,skaf43(X1,X0))) = X0
      | ~ ssItem(X1)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause169) ).

fof(f189,axiom,
    ! [X2,X3,X0,X1] :
      ( app(X0,cons(X1,X2)) != X3
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ ssList(X3)
      | memberP(X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause175) ).

fof(f193,axiom,
    ! [X2,X3,X0,X1,X4] :
      ( app(app(X0,cons(X1,X2)),cons(X1,X3)) != X4
      | ~ ssList(X3)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ duplicatefreeP(X4)
      | ~ ssList(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause179) ).

fof(f196,axiom,
    ! [X2,X3,X0,X1,X4,X5] :
      ( app(app(X0,cons(X1,X2)),cons(X3,X4)) != X5
      | ~ ssList(X4)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X3)
      | ~ ssItem(X1)
      | ~ totalorderedP(X5)
      | ~ ssList(X5)
      | leq(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause182) ).

fof(f205,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).

fof(f210,negated_conjecture,
    totalorderedP(sk3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

fof(f215,negated_conjecture,
    ssItem(sk7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

fof(f216,negated_conjecture,
    ssList(sk8),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).

fof(f217,negated_conjecture,
    ssList(sk9),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).

fof(f218,negated_conjecture,
    app(app(sk8,cons(sk7,nil)),sk9) = sk1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).

fof(f219,plain,
    sk1 = app(app(sk8,cons(sk7,nil)),sk9),
    inference(reorient_equations,[],[f218]) ).

fof(f221,negated_conjecture,
    ( memberP(sk8,sk10)
    | memberP(sk9,sk10) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).

fof(f222,negated_conjecture,
    ( memberP(sk8,sk10)
    | ~ leq(sk7,sk10) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).

fof(f223,negated_conjecture,
    ( ~ leq(sk10,sk7)
    | memberP(sk9,sk10) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_20) ).

fof(f224,negated_conjecture,
    ( ~ leq(sk10,sk7)
    | ~ leq(sk7,sk10) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).

fof(f228,plain,
    sk3 = app(app(sk8,cons(sk7,nil)),sk9),
    inference(definition_unfolding,[],[f219,f205]) ).

fof(f238,plain,
    ! [X2,X1] :
      ( ~ ssList(X2)
      | ~ ssItem(X1)
      | ~ ssItem(X1)
      | memberP(cons(X1,X2),X1) ),
    inference(equality_resolution,[],[f149]) ).

fof(f244,plain,
    ! [X2,X0,X1] :
      ( memberP(app(X0,cons(X1,X2)),X1)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ ssList(app(X0,cons(X1,X2)))
      | ~ ssList(X2) ),
    inference(equality_resolution,[],[f189]) ).

fof(f246,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3)))
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
      | ~ ssList(X3) ),
    inference(equality_resolution,[],[f193]) ).

fof(f249,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4)))
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X3)
      | ~ ssItem(X1)
      | ~ totalorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
      | ~ ssList(X4)
      | leq(X1,X3) ),
    inference(equality_resolution,[],[f196]) ).

fof(f258,definition,
    sF2 = cons(sk7,nil),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f259,plain,
    cons(sk7,nil) = sF2,
    inference(reorient_equations,[],[f258]) ).

fof(f260,definition,
    sF3 = app(sk8,sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f261,plain,
    app(sk8,sF2) = sF3,
    inference(reorient_equations,[],[f260]) ).

fof(f262,definition,
    sF4 = app(sF3,sk9),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f263,plain,
    app(sF3,sk9) = sF4,
    inference(reorient_equations,[],[f262]) ).

fof(f264,plain,
    sk3 = sF4,
    inference(definition_folding,[],[f228,f263,f261,f259]) ).

fof(f267,plain,
    ! [X2,X1] :
      ( memberP(cons(X1,X2),X1)
      | ~ ssItem(X1)
      | ~ ssList(X2) ),
    inference(duplicate_literal_removal,[],[f238]) ).

fof(f281,definition,
    ( spl5_3
  <=> leq(sk7,sk10) ),
    introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).

fof(f283,plain,
    ( ~ leq(sk7,sk10)
    | spl5_3 ),
    inference(avatar_component_clause,[],[f281]) ).

fof(f285,definition,
    ( spl5_4
  <=> leq(sk10,sk7) ),
    introduced(definition,[new_symbols(definition,[spl5_4])],[avatar_definition]) ).

fof(f287,plain,
    ( ~ leq(sk10,sk7)
    | spl5_4 ),
    inference(avatar_component_clause,[],[f285]) ).

fof(f288,plain,
    ( ~ spl5_3
    | ~ spl5_4 ),
    inference(avatar_split_clause,[],[f224,f285,f281]) ).

fof(f290,definition,
    ( spl5_5
  <=> memberP(sk9,sk10) ),
    introduced(definition,[new_symbols(definition,[spl5_5])],[avatar_definition]) ).

fof(f292,plain,
    ( memberP(sk9,sk10)
    | ~ spl5_5 ),
    inference(avatar_component_clause,[],[f290]) ).

fof(f293,plain,
    ( spl5_5
    | ~ spl5_4 ),
    inference(avatar_split_clause,[],[f223,f285,f290]) ).

fof(f295,definition,
    ( spl5_6
  <=> memberP(sk8,sk10) ),
    introduced(definition,[new_symbols(definition,[spl5_6])],[avatar_definition]) ).

fof(f297,plain,
    ( memberP(sk8,sk10)
    | ~ spl5_6 ),
    inference(avatar_component_clause,[],[f295]) ).

fof(f298,plain,
    ( ~ spl5_3
    | spl5_6 ),
    inference(avatar_split_clause,[],[f222,f295,f281]) ).

fof(f299,plain,
    ( spl5_5
    | spl5_6 ),
    inference(avatar_split_clause,[],[f221,f295,f290]) ).

fof(f305,definition,
    ( spl5_8
  <=> ssList(nil) ),
    introduced(definition,[new_symbols(definition,[spl5_8])],[avatar_definition]) ).

fof(f306,plain,
    ( ssList(nil)
    | ~ spl5_8 ),
    inference(avatar_component_clause,[],[f305]) ).

fof(f333,definition,
    ( spl5_14
  <=> ! [X1] : ssItem(X1) ),
    introduced(definition,[new_symbols(definition,[spl5_14])],[avatar_definition]) ).

fof(f334,plain,
    ( ! [X1] : ssItem(X1)
    | ~ spl5_14 ),
    inference(avatar_component_clause,[],[f333]) ).

fof(f336,definition,
    ( spl5_15
  <=> ! [X0] :
        ( ~ ssList(X0)
        | duplicatefreeP(X0) ) ),
    introduced(definition,[new_symbols(definition,[spl5_15])],[avatar_definition]) ).

fof(f337,plain,
    ( ! [X0] :
        ( ~ ssList(X0)
        | duplicatefreeP(X0) )
    | ~ spl5_15 ),
    inference(avatar_component_clause,[],[f336]) ).

fof(f338,plain,
    ( spl5_14
    | spl5_15 ),
    inference(avatar_split_clause,[],[f72,f336,f333]) ).

fof(f341,plain,
    spl5_8,
    inference(avatar_split_clause,[],[f8,f305]) ).

fof(f343,plain,
    sk3 = app(sF3,sk9),
    inference(forward_demodulation,[],[f263,f264]) ).

fof(f354,plain,
    ( ssList(sF3)
    | ~ ssList(sk8)
    | ~ ssList(sF2) ),
    inference(superposition,[],[f85,f261]) ).

fof(f357,plain,
    ( ssList(sF3)
    | ~ ssList(sF2) ),
    inference(forward_subsumption_resolution,[],[f354,f216]) ).

fof(f361,definition,
    ( spl5_16
  <=> ssList(sF2) ),
    introduced(definition,[new_symbols(definition,[spl5_16])],[avatar_definition]) ).

fof(f362,plain,
    ( ssList(sF2)
    | ~ spl5_16 ),
    inference(avatar_component_clause,[],[f361]) ).

fof(f363,plain,
    ( ~ ssList(sF2)
    | spl5_16 ),
    inference(avatar_component_clause,[],[f361]) ).

fof(f365,definition,
    ( spl5_17
  <=> ssList(sF3) ),
    introduced(definition,[new_symbols(definition,[spl5_17])],[avatar_definition]) ).

fof(f367,plain,
    ( ssList(sF3)
    | ~ spl5_17 ),
    inference(avatar_component_clause,[],[f365]) ).

fof(f368,plain,
    ( ~ spl5_16
    | spl5_17 ),
    inference(avatar_split_clause,[],[f357,f365,f361]) ).

fof(f374,plain,
    ! [X0] :
      ( app(sk8,app(sF2,X0)) = app(sF3,X0)
      | ~ ssList(sF2)
      | ~ ssList(sk8)
      | ~ ssList(X0) ),
    inference(superposition,[],[f161,f261]) ).

fof(f379,plain,
    ! [X2,X0,X1] :
      ( ssList(app(X0,app(X1,X2)))
      | ~ ssList(app(X0,X1))
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(X2) ),
    inference(superposition,[],[f85,f161]) ).

fof(f380,plain,
    ! [X2,X0,X1] :
      ( ssList(app(X0,app(X1,X2)))
      | ~ ssList(app(X0,X1))
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(duplicate_literal_removal,[],[f379]) ).

fof(f383,plain,
    ! [X2,X0,X1] :
      ( ssList(app(X0,app(X1,X2)))
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f380,f85]) ).

fof(f402,plain,
    ( ssList(sF2)
    | ~ ssList(nil)
    | ~ ssItem(sk7) ),
    inference(superposition,[],[f86,f259]) ).

fof(f403,plain,
    ( ~ ssList(nil)
    | ~ ssItem(sk7)
    | spl5_16 ),
    inference(forward_subsumption_resolution,[],[f402,f363]) ).

fof(f404,plain,
    ( ~ ssItem(sk7)
    | ~ spl5_8
    | spl5_16 ),
    inference(forward_subsumption_resolution,[],[f403,f306]) ).

fof(f405,plain,
    ( $false
    | ~ spl5_8
    | spl5_16 ),
    inference(forward_subsumption_resolution,[],[f404,f215]) ).

fof(f406,plain,
    ( ~ spl5_8
    | spl5_16 ),
    inference(avatar_contradiction_clause,[],[f405]) ).

fof(f407,plain,
    ( ! [X0] :
        ( app(sk8,app(sF2,X0)) = app(sF3,X0)
        | ~ ssList(sk8)
        | ~ ssList(X0) )
    | ~ spl5_16 ),
    inference(forward_subsumption_resolution,[],[f374,f362]) ).

fof(f408,plain,
    ( ! [X0] :
        ( app(sk8,app(sF2,X0)) = app(sF3,X0)
        | ~ ssList(X0) )
    | ~ spl5_16 ),
    inference(forward_subsumption_resolution,[],[f407,f216]) ).

fof(f419,plain,
    ! [X0] :
      ( app(sF2,X0) = cons(sk7,X0)
      | ~ ssList(X0)
      | ~ ssItem(sk7) ),
    inference(superposition,[],[f126,f259]) ).

fof(f427,plain,
    ! [X0] :
      ( app(sF2,X0) = cons(sk7,X0)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f419,f215]) ).

fof(f458,plain,
    ( ! [X0] :
        ( app(sF3,X0) = app(sk8,cons(sk7,X0))
        | ~ ssList(X0)
        | ~ ssList(X0) )
    | ~ spl5_16 ),
    inference(superposition,[],[f408,f427]) ).

fof(f462,plain,
    ( ! [X0] :
        ( app(sF3,X0) = app(sk8,cons(sk7,X0))
        | ~ ssList(X0) )
    | ~ spl5_16 ),
    inference(duplicate_literal_removal,[],[f458]) ).

fof(f468,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(app(X0,cons(X2,X3)))
      | ~ ssList(skaf43(X1,X0))
      | ~ ssList(skaf42(X0,X1))
      | ~ ssItem(X2)
      | ~ ssItem(X1)
      | ~ totalorderedP(app(X0,cons(X2,X3)))
      | ~ ssList(X3)
      | leq(X1,X2)
      | ~ ssItem(X1)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(superposition,[],[f249,f182]) ).

fof(f471,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(app(X0,cons(X2,X3)))
      | ~ ssList(skaf43(X1,X0))
      | ~ ssList(skaf42(X0,X1))
      | ~ ssItem(X2)
      | ~ ssItem(X1)
      | ~ totalorderedP(app(X0,cons(X2,X3)))
      | ~ ssList(X3)
      | leq(X1,X2)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(duplicate_literal_removal,[],[f468]) ).

fof(f473,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(app(X0,cons(X2,X3)))
      | ~ ssList(skaf42(X0,X1))
      | ~ ssItem(X2)
      | ~ ssItem(X1)
      | ~ totalorderedP(app(X0,cons(X2,X3)))
      | ~ ssList(X3)
      | leq(X1,X2)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(forward_subsumption_resolution,[],[f471,f52]) ).

fof(f475,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(app(X0,cons(X2,X3)))
      | ~ ssItem(X2)
      | ~ ssItem(X1)
      | ~ totalorderedP(app(X0,cons(X2,X3)))
      | ~ ssList(X3)
      | leq(X1,X2)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(forward_subsumption_resolution,[],[f473,f53]) ).

fof(f478,plain,
    ! [X0] :
      ( memberP(app(X0,sF2),sk7)
      | ~ ssList(X0)
      | ~ ssItem(sk7)
      | ~ ssList(app(X0,sF2))
      | ~ ssList(nil) ),
    inference(superposition,[],[f244,f259]) ).

fof(f489,plain,
    ! [X0] :
      ( memberP(app(X0,sF2),sk7)
      | ~ ssList(X0)
      | ~ ssList(app(X0,sF2))
      | ~ ssList(nil) ),
    inference(forward_subsumption_resolution,[],[f478,f215]) ).

fof(f493,plain,
    ( ! [X0] :
        ( memberP(app(X0,sF2),sk7)
        | ~ ssList(X0)
        | ~ ssList(app(X0,sF2)) )
    | ~ spl5_8 ),
    inference(forward_subsumption_resolution,[],[f489,f306]) ).

fof(f765,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssItem(X1)
      | ~ totalorderedP(app(X2,cons(X0,X3)))
      | ~ ssList(X3)
      | leq(X1,X0)
      | ~ ssList(X2)
      | ~ memberP(X2,X1)
      | ~ ssList(X2)
      | ~ ssList(cons(X0,X3)) ),
    inference(resolution,[],[f475,f85]) ).

fof(f767,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssList(app(X0,app(X1,cons(X2,X3))))
      | ~ ssItem(X2)
      | ~ ssItem(X4)
      | ~ totalorderedP(app(X0,app(X1,cons(X2,X3))))
      | ~ ssList(X3)
      | leq(X4,X2)
      | ~ ssList(app(X0,X1))
      | ~ memberP(app(X0,X1),X4)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(cons(X2,X3)) ),
    inference(superposition,[],[f475,f161]) ).

fof(f772,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssItem(X1)
      | ~ totalorderedP(app(X2,cons(X0,X3)))
      | ~ ssList(X3)
      | leq(X1,X0)
      | ~ ssList(X2)
      | ~ memberP(X2,X1)
      | ~ ssList(cons(X0,X3)) ),
    inference(duplicate_literal_removal,[],[f765]) ).

fof(f775,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssList(app(X0,app(X1,cons(X2,X3))))
      | ~ ssItem(X2)
      | ~ ssItem(X4)
      | ~ totalorderedP(app(X0,app(X1,cons(X2,X3))))
      | ~ ssList(X3)
      | leq(X4,X2)
      | ~ memberP(app(X0,X1),X4)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(cons(X2,X3)) ),
    inference(forward_subsumption_resolution,[],[f767,f85]) ).

fof(f777,plain,
    ! [X2,X3,X0,X1] :
      ( ~ totalorderedP(app(X2,cons(X0,X3)))
      | ~ ssItem(X1)
      | ~ ssItem(X0)
      | ~ ssList(X3)
      | leq(X1,X0)
      | ~ ssList(X2)
      | ~ memberP(X2,X1) ),
    inference(forward_subsumption_resolution,[],[f772,f86]) ).

fof(f779,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ ssItem(X2)
      | ~ ssItem(X4)
      | ~ totalorderedP(app(X0,app(X1,cons(X2,X3))))
      | ~ ssList(X3)
      | leq(X4,X2)
      | ~ memberP(app(X0,X1),X4)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(cons(X2,X3)) ),
    inference(forward_subsumption_resolution,[],[f775,f383]) ).

fof(f781,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ totalorderedP(app(X0,app(X1,cons(X2,X3))))
      | ~ ssItem(X4)
      | ~ ssItem(X2)
      | ~ ssList(X3)
      | leq(X4,X2)
      | ~ memberP(app(X0,X1),X4)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f779,f86]) ).

fof(f782,plain,
    ! [X2,X3,X0,X1] :
      ( ~ totalorderedP(app(X1,X0))
      | ~ ssItem(X3)
      | ~ ssItem(X2)
      | ~ ssList(skaf43(X2,X0))
      | leq(X3,X2)
      | ~ memberP(app(X1,skaf42(X0,X2)),X3)
      | ~ ssList(skaf42(X0,X2))
      | ~ ssList(X1)
      | ~ ssItem(X2)
      | ~ ssList(X0)
      | ~ memberP(X0,X2) ),
    inference(superposition,[],[f781,f182]) ).

fof(f790,plain,
    ! [X2,X3,X0,X1] :
      ( ~ totalorderedP(app(X1,X0))
      | ~ ssItem(X3)
      | ~ ssItem(X2)
      | ~ ssList(skaf43(X2,X0))
      | leq(X3,X2)
      | ~ memberP(app(X1,skaf42(X0,X2)),X3)
      | ~ ssList(skaf42(X0,X2))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ memberP(X0,X2) ),
    inference(duplicate_literal_removal,[],[f782]) ).

fof(f797,plain,
    ! [X2,X3,X0,X1] :
      ( ~ totalorderedP(app(X1,X0))
      | ~ ssItem(X3)
      | ~ ssItem(X2)
      | leq(X3,X2)
      | ~ memberP(app(X1,skaf42(X0,X2)),X3)
      | ~ ssList(skaf42(X0,X2))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ memberP(X0,X2) ),
    inference(forward_subsumption_resolution,[],[f790,f52]) ).

fof(f802,plain,
    ! [X2,X3,X0,X1] :
      ( ~ memberP(app(X1,skaf42(X0,X2)),X3)
      | ~ ssItem(X3)
      | ~ ssItem(X2)
      | leq(X3,X2)
      | ~ totalorderedP(app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ memberP(X0,X2) ),
    inference(forward_subsumption_resolution,[],[f797,f53]) ).

fof(f807,plain,
    ( ! [X0,X1] :
        ( ~ totalorderedP(app(sF3,X0))
        | ~ ssItem(X1)
        | ~ ssItem(sk7)
        | ~ ssList(X0)
        | leq(X1,sk7)
        | ~ ssList(sk8)
        | ~ memberP(sk8,X1)
        | ~ ssList(X0) )
    | ~ spl5_16 ),
    inference(superposition,[],[f777,f462]) ).

fof(f809,plain,
    ( ! [X0,X1] :
        ( ~ totalorderedP(app(sF3,X0))
        | ~ ssItem(X1)
        | ~ ssItem(sk7)
        | ~ ssList(X0)
        | leq(X1,sk7)
        | ~ ssList(sk8)
        | ~ memberP(sk8,X1) )
    | ~ spl5_16 ),
    inference(duplicate_literal_removal,[],[f807]) ).

fof(f861,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(skaf42(X0,X1))
      | ~ ssList(X2)
      | ~ ssItem(X3)
      | ~ memberP(X2,X3)
      | ~ ssItem(X3)
      | ~ ssItem(X1)
      | leq(X3,X1)
      | ~ totalorderedP(app(X2,X0))
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(resolution,[],[f151,f802]) ).

fof(f877,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(skaf42(X0,X1))
      | ~ ssList(X2)
      | ~ ssItem(X3)
      | ~ memberP(X2,X3)
      | ~ ssItem(X1)
      | leq(X3,X1)
      | ~ totalorderedP(app(X2,X0))
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(duplicate_literal_removal,[],[f861]) ).

fof(f886,plain,
    ! [X2,X3,X0,X1] :
      ( ~ totalorderedP(app(X2,X0))
      | ~ ssItem(X3)
      | ~ memberP(X2,X3)
      | ~ ssItem(X1)
      | leq(X3,X1)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(forward_subsumption_resolution,[],[f877,f53]) ).

fof(f901,plain,
    ! [X0,X1] :
      ( ~ totalorderedP(sk3)
      | ~ ssItem(X0)
      | ~ memberP(sF3,X0)
      | ~ ssItem(X1)
      | leq(X0,X1)
      | ~ ssList(sF3)
      | ~ ssList(sk9)
      | ~ memberP(sk9,X1) ),
    inference(superposition,[],[f886,f343]) ).

fof(f905,plain,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ memberP(sF3,X0)
      | ~ ssItem(X1)
      | leq(X0,X1)
      | ~ ssList(sF3)
      | ~ ssList(sk9)
      | ~ memberP(sk9,X1) ),
    inference(forward_subsumption_resolution,[],[f901,f210]) ).

fof(f913,plain,
    ( ! [X0,X1] :
        ( ~ ssItem(X0)
        | ~ memberP(sF3,X0)
        | ~ ssItem(X1)
        | leq(X0,X1)
        | ~ ssList(sk9)
        | ~ memberP(sk9,X1) )
    | ~ spl5_17 ),
    inference(forward_subsumption_resolution,[],[f905,f367]) ).

fof(f916,plain,
    ( ! [X0,X1] :
        ( ~ memberP(sF3,X0)
        | ~ ssItem(X0)
        | ~ ssItem(X1)
        | leq(X0,X1)
        | ~ memberP(sk9,X1) )
    | ~ spl5_17 ),
    inference(forward_subsumption_resolution,[],[f913,f217]) ).

fof(f1363,plain,
    ! [X2,X0,X1] :
      ( ~ ssList(app(X0,cons(X1,X2)))
      | ~ ssList(skaf43(X1,X0))
      | ~ ssList(skaf42(X0,X1))
      | ~ ssItem(X1)
      | ~ duplicatefreeP(app(X0,cons(X1,X2)))
      | ~ ssList(X2)
      | ~ ssItem(X1)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(superposition,[],[f246,f182]) ).

fof(f1373,plain,
    ! [X2,X0,X1] :
      ( ~ ssList(app(X0,cons(X1,X2)))
      | ~ ssList(skaf43(X1,X0))
      | ~ ssList(skaf42(X0,X1))
      | ~ ssItem(X1)
      | ~ duplicatefreeP(app(X0,cons(X1,X2)))
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ memberP(X0,X1) ),
    inference(duplicate_literal_removal,[],[f1363]) ).

fof(f1382,plain,
    ( ! [X2,X0,X1] :
        ( ~ ssList(app(X0,cons(X1,X2)))
        | ~ ssList(skaf43(X1,X0))
        | ~ ssList(skaf42(X0,X1))
        | ~ ssItem(X1)
        | ~ ssList(X2)
        | ~ ssList(X0)
        | ~ memberP(X0,X1) )
    | ~ spl5_15 ),
    inference(forward_subsumption_resolution,[],[f1373,f337]) ).

fof(f1394,plain,
    ( ! [X2,X0,X1] :
        ( ~ ssList(app(X0,cons(X1,X2)))
        | ~ ssList(skaf42(X0,X1))
        | ~ ssItem(X1)
        | ~ ssList(X2)
        | ~ ssList(X0)
        | ~ memberP(X0,X1) )
    | ~ spl5_15 ),
    inference(forward_subsumption_resolution,[],[f1382,f52]) ).

fof(f1404,plain,
    ( ! [X2,X0,X1] :
        ( ~ ssList(app(X0,cons(X1,X2)))
        | ~ ssItem(X1)
        | ~ ssList(X2)
        | ~ ssList(X0)
        | ~ memberP(X0,X1) )
    | ~ spl5_15 ),
    inference(forward_subsumption_resolution,[],[f1394,f53]) ).

fof(f1407,plain,
    ( ! [X2,X0,X1] :
        ( ~ ssItem(X0)
        | ~ ssList(X1)
        | ~ ssList(X2)
        | ~ memberP(X2,X0)
        | ~ ssList(X2)
        | ~ ssList(cons(X0,X1)) )
    | ~ spl5_15 ),
    inference(resolution,[],[f1404,f85]) ).

fof(f1418,plain,
    ( ! [X2,X0,X1] :
        ( ~ ssItem(X0)
        | ~ ssList(X1)
        | ~ ssList(X2)
        | ~ memberP(X2,X0)
        | ~ ssList(cons(X0,X1)) )
    | ~ spl5_15 ),
    inference(duplicate_literal_removal,[],[f1407]) ).

fof(f1426,plain,
    ( ! [X2,X0,X1] :
        ( ~ ssItem(X0)
        | ~ ssList(X1)
        | ~ ssList(X2)
        | ~ memberP(X2,X0) )
    | ~ spl5_15 ),
    inference(forward_subsumption_resolution,[],[f1418,f86]) ).

fof(f1433,definition,
    ( spl5_31
  <=> ! [X1] : ~ ssList(X1) ),
    introduced(definition,[new_symbols(definition,[spl5_31])],[avatar_definition]) ).

fof(f1434,plain,
    ( ! [X1] : ~ ssList(X1)
    | ~ spl5_31 ),
    inference(avatar_component_clause,[],[f1433]) ).

fof(f1436,definition,
    ( spl5_32
  <=> ! [X2,X0] :
        ( ~ ssItem(X0)
        | ~ ssList(X2)
        | ~ memberP(X2,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl5_32])],[avatar_definition]) ).

fof(f1437,plain,
    ( ! [X2,X0] :
        ( ~ memberP(X2,X0)
        | ~ ssList(X2)
        | ~ ssItem(X0) )
    | ~ spl5_32 ),
    inference(avatar_component_clause,[],[f1436]) ).

fof(f1438,plain,
    ( spl5_31
    | spl5_32
    | ~ spl5_15 ),
    inference(avatar_split_clause,[],[f1426,f336,f1436,f1433]) ).

fof(f1714,definition,
    ( spl5_38
  <=> ! [X1] :
        ( ~ memberP(sk8,X1)
        | leq(X1,sk7) ) ),
    introduced(definition,[new_symbols(definition,[spl5_38])],[avatar_definition]) ).

fof(f1715,plain,
    ( ! [X1] :
        ( ~ memberP(sk8,X1)
        | leq(X1,sk7) )
    | ~ spl5_38 ),
    inference(avatar_component_clause,[],[f1714]) ).

fof(f1717,plain,
    ( $false
    | ~ spl5_31 ),
    inference(resolution,[],[f1434,f52]) ).

fof(f1740,plain,
    ~ spl5_31,
    inference(avatar_contradiction_clause,[],[f1717]) ).

fof(f1793,plain,
    ( ! [X0,X1] :
        ( ~ totalorderedP(app(sF3,X0))
        | ~ ssItem(X1)
        | ~ ssList(X0)
        | leq(X1,sk7)
        | ~ ssList(sk8)
        | ~ memberP(sk8,X1) )
    | ~ spl5_16 ),
    inference(forward_subsumption_resolution,[],[f809,f215]) ).

fof(f1836,plain,
    ( ! [X0,X1] :
        ( ~ totalorderedP(app(sF3,X0))
        | ~ ssItem(X1)
        | ~ ssList(X0)
        | leq(X1,sk7)
        | ~ memberP(sk8,X1) )
    | ~ spl5_16 ),
    inference(forward_subsumption_resolution,[],[f1793,f216]) ).

fof(f1852,plain,
    ( ! [X0,X1] :
        ( ~ totalorderedP(app(sF3,X0))
        | ~ ssList(X0)
        | leq(X1,sk7)
        | ~ memberP(sk8,X1) )
    | ~ spl5_14
    | ~ spl5_16 ),
    inference(forward_subsumption_resolution,[],[f1836,f334]) ).

fof(f1864,definition,
    ( spl5_40
  <=> ! [X0] :
        ( ~ totalorderedP(app(sF3,X0))
        | ~ ssList(X0) ) ),
    introduced(definition,[new_symbols(definition,[spl5_40])],[avatar_definition]) ).

fof(f1865,plain,
    ( ! [X0] :
        ( ~ totalorderedP(app(sF3,X0))
        | ~ ssList(X0) )
    | ~ spl5_40 ),
    inference(avatar_component_clause,[],[f1864]) ).

fof(f1867,plain,
    ( spl5_38
    | spl5_40
    | ~ spl5_14
    | ~ spl5_16 ),
    inference(avatar_split_clause,[],[f1852,f361,f333,f1864,f1714]) ).

fof(f1960,plain,
    ( ! [X0,X1] :
        ( ~ ssList(cons(X0,X1))
        | ~ ssItem(X0)
        | ~ ssItem(X0)
        | ~ ssList(X1) )
    | ~ spl5_32 ),
    inference(resolution,[],[f1437,f267]) ).

fof(f1972,plain,
    ( ! [X0,X1] :
        ( ~ ssList(cons(X0,X1))
        | ~ ssItem(X0)
        | ~ ssList(X1) )
    | ~ spl5_32 ),
    inference(duplicate_literal_removal,[],[f1960]) ).

fof(f1978,plain,
    ( ! [X0,X1] :
        ( ~ ssItem(X0)
        | ~ ssList(X1) )
    | ~ spl5_32 ),
    inference(forward_subsumption_resolution,[],[f1972,f86]) ).

fof(f1982,definition,
    ( spl5_45
  <=> ! [X0] : ~ ssItem(X0) ),
    introduced(definition,[new_symbols(definition,[spl5_45])],[avatar_definition]) ).

fof(f1983,plain,
    ( ! [X0] : ~ ssItem(X0)
    | ~ spl5_45 ),
    inference(avatar_component_clause,[],[f1982]) ).

fof(f1984,plain,
    ( spl5_31
    | spl5_45
    | ~ spl5_32 ),
    inference(avatar_split_clause,[],[f1978,f1436,f1982,f1433]) ).

fof(f2360,plain,
    ( ~ totalorderedP(sk3)
    | ~ ssList(sk9)
    | ~ spl5_40 ),
    inference(superposition,[],[f1865,f343]) ).

fof(f2362,plain,
    ( ~ ssList(sk9)
    | ~ spl5_40 ),
    inference(forward_subsumption_resolution,[],[f2360,f210]) ).

fof(f2363,plain,
    ( $false
    | ~ spl5_40 ),
    inference(forward_subsumption_resolution,[],[f2362,f217]) ).

fof(f2364,plain,
    ~ spl5_40,
    inference(avatar_contradiction_clause,[],[f2363]) ).

fof(f2460,plain,
    ( $false
    | ~ spl5_45 ),
    inference(resolution,[],[f1983,f215]) ).

fof(f2463,plain,
    ~ spl5_45,
    inference(avatar_contradiction_clause,[],[f2460]) ).

fof(f2976,plain,
    ( leq(sk10,sk7)
    | ~ spl5_6
    | ~ spl5_38 ),
    inference(resolution,[],[f1715,f297]) ).

fof(f2977,plain,
    ( $false
    | spl5_4
    | ~ spl5_6
    | ~ spl5_38 ),
    inference(forward_subsumption_resolution,[],[f2976,f287]) ).

fof(f2978,plain,
    ( spl5_4
    | ~ spl5_6
    | ~ spl5_38 ),
    inference(avatar_contradiction_clause,[],[f2977]) ).

fof(f3501,plain,
    ( memberP(sF3,sk7)
    | ~ ssList(sk8)
    | ~ ssList(sF3)
    | ~ spl5_8 ),
    inference(superposition,[],[f493,f261]) ).

fof(f3937,plain,
    ( memberP(sF3,sk7)
    | ~ ssList(sF3)
    | ~ spl5_8 ),
    inference(forward_subsumption_resolution,[],[f3501,f216]) ).

fof(f3949,plain,
    ( memberP(sF3,sk7)
    | ~ spl5_8
    | ~ spl5_17 ),
    inference(forward_subsumption_resolution,[],[f3937,f367]) ).

fof(f4296,plain,
    ( ! [X0] :
        ( ~ ssItem(sk7)
        | ~ ssItem(X0)
        | leq(sk7,X0)
        | ~ memberP(sk9,X0) )
    | ~ spl5_8
    | ~ spl5_17 ),
    inference(resolution,[],[f3949,f916]) ).

fof(f4297,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | leq(sk7,X0)
        | ~ memberP(sk9,X0) )
    | ~ spl5_8
    | ~ spl5_17 ),
    inference(forward_subsumption_resolution,[],[f4296,f215]) ).

fof(f4298,plain,
    ( ! [X0] :
        ( ~ memberP(sk9,X0)
        | leq(sk7,X0) )
    | ~ spl5_8
    | ~ spl5_14
    | ~ spl5_17 ),
    inference(forward_subsumption_resolution,[],[f4297,f334]) ).

fof(f4299,plain,
    ( leq(sk7,sk10)
    | ~ spl5_5
    | ~ spl5_8
    | ~ spl5_14
    | ~ spl5_17 ),
    inference(resolution,[],[f4298,f292]) ).

fof(f4300,plain,
    ( $false
    | spl5_3
    | ~ spl5_5
    | ~ spl5_8
    | ~ spl5_14
    | ~ spl5_17 ),
    inference(forward_subsumption_resolution,[],[f4299,f283]) ).

fof(f4301,plain,
    ( spl5_3
    | ~ spl5_5
    | ~ spl5_8
    | ~ spl5_14
    | ~ spl5_17 ),
    inference(avatar_contradiction_clause,[],[f4300]) ).

cnf(s2,plain,
    ( ~ spl5_3
    | ~ spl5_4 ),
    inference(sat_conversion,[],[f288]) ).

cnf(s3,plain,
    ( ~ spl5_4
    | spl5_5 ),
    inference(sat_conversion,[],[f293]) ).

cnf(s4,plain,
    ( ~ spl5_3
    | spl5_6 ),
    inference(sat_conversion,[],[f298]) ).

cnf(s5,plain,
    ( spl5_5
    | spl5_6 ),
    inference(sat_conversion,[],[f299]) ).

cnf(s12,plain,
    ( spl5_14
    | spl5_15 ),
    inference(sat_conversion,[],[f338]) ).

cnf(s15,plain,
    spl5_8,
    inference(sat_conversion,[],[f341]) ).

cnf(s16,plain,
    ( ~ spl5_16
    | spl5_17 ),
    inference(sat_conversion,[],[f368]) ).

cnf(s18,plain,
    ( ~ spl5_8
    | spl5_16 ),
    inference(sat_conversion,[],[f406]) ).

cnf(s26,plain,
    ( ~ spl5_15
    | spl5_31
    | spl5_32 ),
    inference(sat_conversion,[],[f1438]) ).

cnf(s40,plain,
    ~ spl5_31,
    inference(sat_conversion,[],[f1740]) ).

cnf(s43,plain,
    ( ~ spl5_14
    | ~ spl5_16
    | spl5_38
    | spl5_40 ),
    inference(sat_conversion,[],[f1867]) ).

cnf(s50,plain,
    ( spl5_31
    | ~ spl5_32
    | spl5_45 ),
    inference(sat_conversion,[],[f1984]) ).

cnf(s55,plain,
    ~ spl5_40,
    inference(sat_conversion,[],[f2364]) ).

cnf(s59,plain,
    ~ spl5_45,
    inference(sat_conversion,[],[f2463]) ).

cnf(s62,plain,
    ( spl5_4
    | ~ spl5_6
    | ~ spl5_38 ),
    inference(sat_conversion,[],[f2978]) ).

cnf(s76,plain,
    ( spl5_3
    | ~ spl5_5
    | ~ spl5_8
    | ~ spl5_14
    | ~ spl5_17 ),
    inference(sat_conversion,[],[f4301]) ).

cnf(s77,plain,
    ( spl5_31
    | ~ spl5_32 ),
    inference(rat,[],[s50,s59]) ).

cnf(s80,plain,
    ( ~ spl5_14
    | ~ spl5_16
    | spl5_38 ),
    inference(rat,[],[s43,s55]) ).

cnf(s82,plain,
    ~ spl5_32,
    inference(rat,[],[s77,s40]) ).

cnf(s84,plain,
    ~ spl5_15,
    inference(rat,[],[s26,s82,s40]) ).

cnf(s85,plain,
    spl5_16,
    inference(rat,[],[s18,s15]) ).

cnf(s87,plain,
    spl5_17,
    inference(rat,[],[s16,s85]) ).

cnf(s89,plain,
    spl5_14,
    inference(rat,[],[s12,s84]) ).

cnf(s92,plain,
    spl5_38,
    inference(rat,[],[s80,s85,s89]) ).

cnf(s97,plain,
    spl5_5,
    inference(rat,[],[s62,s3,s5,s92]) ).

cnf(s98,plain,
    spl5_3,
    inference(rat,[],[s76,s87,s89,s15,s97]) ).

cnf(s99,plain,
    spl5_6,
    inference(rat,[],[s4,s98]) ).

cnf(s100,plain,
    ~ spl5_4,
    inference(rat,[],[s2,s98]) ).

cnf(s101,plain,
    $false,
    inference(rat,[],[s62,s92,s99,s100]) ).

fof(f4302,plain,
    $false,
    inference(avatar_sat_refutation,[],[s101]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC282-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.18  % Computer : n017.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Mon Sep 28 08:47:21 UTC 2026
% 0.09/0.18  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.21  Running first-order theorem proving
% 0.09/0.21  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.59/1.91  % (3406270)Input is clausal, will run a generic CNF schedule.
% 7.59/1.91  % (3406281)dis-21_1_sil=8000:lcm=predicate:random_seed=4086238991: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)
% 7.59/1.91  % (3406281)Instruction limit reached! 
% 7.59/1.91  % (3406281)------------------------------
% 7.59/1.91  % (3406281)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.59/1.91  % (3406281)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.59/1.91  % (3406281)CaDiCaL version: 2.1.3
% 7.59/1.91  % (3406281)Termination reason: Instruction limit
% 7.59/1.91  % (3406281)Termination phase: Saturation
% 7.59/1.91  % (3406281)Time elapsed: 0.031 s
% 7.59/1.91  % (3406281)Peak memory usage: 89 MB
% 7.59/1.91  % (3406281)Instructions burned: 120 (million)
% 7.59/1.91  % (3406275)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=2281930990:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 7.59/1.91  % (3406278)lrs+10_1_sil=8000:sp=occurrence:random_seed=3288088031:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 7.59/1.91  % (3406280)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1397277326:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 7.59/1.91  % (3406276)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=805289730:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 7.59/1.91  % (3406277)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1993694837:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 7.59/1.91  % (3406279)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2170750735:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 7.59/1.91  % (3406279)Instruction limit reached! 
% 7.59/1.91  % (3406279)------------------------------
% 7.59/1.91  % (3406279)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.59/1.91  % (3406279)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.59/1.91  % (3406279)CaDiCaL version: 2.1.3
% 7.59/1.91  % (3406279)Termination reason: Instruction limit
% 7.59/1.91  % (3406279)Termination phase: Saturation
% 7.59/1.91  % (3406279)Time elapsed: 0.067 s
% 7.59/1.91  % (3406279)Peak memory usage: 89 MB
% 7.59/1.91  % (3406279)Instructions burned: 115 (million)
% 7.59/1.91  % (3406278)Instruction limit reached! 
% 7.59/1.91  % (3406278)------------------------------
% 7.59/1.91  % (3406278)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.59/1.91  % (3406278)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.59/1.91  % (3406278)CaDiCaL version: 2.1.3
% 7.59/1.91  % (3406278)Termination reason: Instruction limit
% 7.59/1.91  % (3406278)Termination phase: Saturation
% 7.59/1.91  % (3406278)Time elapsed: 0.068 s
% 7.59/1.91  % (3406278)Peak memory usage: 89 MB
% 7.59/1.91  % (3406278)Instructions burned: 108 (million)
% 7.59/1.91  % (3406283)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=3284814829:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 7.59/1.91  % (3406280)Instruction limit reached! 
% 7.59/1.91  % (3406280)------------------------------
% 7.59/1.91  % (3406280)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.59/1.91  % (3406280)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.59/1.91  % (3406280)CaDiCaL version: 2.1.3
% 7.59/1.91  % (3406280)Termination reason: Instruction limit
% 7.59/1.91  % (3406280)Termination phase: Saturation
% 7.59/1.91  % (3406280)Time elapsed: 0.123 s
% 7.59/1.91  % (3406280)Peak memory usage: 90 MB
% 7.59/1.91  % (3406280)Instructions burned: 181 (million)
% 7.59/1.91  % (3406283)Instruction limit reached! 
% 7.59/1.91  % (3406283)------------------------------
% 7.59/1.91  % (3406283)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.59/1.91  % (3406283)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.59/1.91  % (3406283)CaDiCaL version: 2.1.3
% 7.59/1.91  % (3406283)Termination reason: Instruction limit
% 7.59/1.91  % (3406283)Termination phase: Saturation
% 7.59/1.91  % (3406283)Time elapsed: 0.051 s
% 7.59/1.91  % (3406283)Peak memory usage: 90 MB
% 7.59/1.91  % (3406283)Instructions burned: 144 (million)
% 7.59/1.91  % (3406290)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3194426911: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)
% 9.17/2.15  % (3406291)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2990670774:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 9.17/2.15  % (3406294)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=3292464740:avsq=on:i=194:fgj=on:bd=preordered_2997 on theBenchmark for (2997ds/194Mi)
% 9.17/2.15  % (3406293)lrs+10_64_to=lpo:sil=8000:random_seed=1986800101:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 9.17/2.15  % (3406294)Instruction limit reached! 
% 9.17/2.15  % (3406294)------------------------------
% 9.17/2.15  % (3406294)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.15  % (3406294)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.15  % (3406294)CaDiCaL version: 2.1.3
% 9.17/2.15  % (3406294)Termination reason: Instruction limit
% 9.17/2.15  % (3406294)Termination phase: Saturation
% 9.17/2.15  % (3406294)Time elapsed: 0.063 s
% 9.17/2.15  % (3406294)Peak memory usage: 90 MB
% 9.17/2.15  % (3406294)Instructions burned: 195 (million)
% 9.17/2.15  % (3406290)Instruction limit reached! 
% 9.17/2.15  % (3406290)------------------------------
% 9.17/2.15  % (3406290)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.15  % (3406290)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.15  % (3406290)CaDiCaL version: 2.1.3
% 9.17/2.15  % (3406290)Termination reason: Instruction limit
% 9.17/2.15  % (3406290)Termination phase: Saturation
% 9.17/2.15  % (3406290)Time elapsed: 0.099 s
% 9.17/2.15  % (3406290)Peak memory usage: 92 MB
% 9.17/2.15  % (3406290)Instructions burned: 190 (million)
% 9.17/2.15  % (3406293)Instruction limit reached! 
% 9.17/2.15  % (3406293)------------------------------
% 9.17/2.15  % (3406293)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.15  % (3406293)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.15  % (3406293)CaDiCaL version: 2.1.3
% 9.17/2.15  % (3406293)Termination reason: Instruction limit
% 9.17/2.15  % (3406293)Termination phase: Saturation
% 9.17/2.15  % (3406293)Time elapsed: 0.067 s
% 9.17/2.15  % (3406293)Peak memory usage: 90 MB
% 9.17/2.15  % (3406293)Instructions burned: 127 (million)
% 9.17/2.15  % (3406291)Instruction limit reached! 
% 9.17/2.15  % (3406291)------------------------------
% 9.17/2.15  % (3406291)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.15  % (3406291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.15  % (3406291)CaDiCaL version: 2.1.3
% 9.17/2.15  % (3406291)Termination reason: Instruction limit
% 9.17/2.15  % (3406291)Termination phase: Saturation
% 9.17/2.15  % (3406291)Time elapsed: 0.134 s
% 9.17/2.15  % (3406291)Peak memory usage: 90 MB
% 9.17/2.15  % (3406291)Instructions burned: 219 (million)
% 9.17/2.15  % (3406299)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=3531296755:i=157:gtg=all_2995 on theBenchmark for (2995ds/157Mi)
% 9.17/2.15  % (3406299)Instruction limit reached! 
% 9.17/2.15  % (3406299)------------------------------
% 9.17/2.15  % (3406299)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.15  % (3406299)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.15  % (3406299)CaDiCaL version: 2.1.3
% 9.17/2.15  % (3406299)Termination reason: Instruction limit
% 9.17/2.15  % (3406299)Termination phase: Saturation
% 9.17/2.15  % (3406299)Time elapsed: 0.053 s
% 9.17/2.15  % (3406299)Peak memory usage: 92 MB
% 9.17/2.15  % (3406299)Instructions burned: 160 (million)
% 9.17/2.15  % (3406300)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=2465901221:i=3394:sd=4:ss=included:sgt=64_2995 on theBenchmark for (2995ds/3394Mi)
% 9.17/2.15  % (3406302)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=1492439479:i=107_2995 on theBenchmark for (2995ds/107Mi)
% 9.17/2.15  % (3406301)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=3553145066:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2995 on theBenchmark for (2995ds/106Mi)
% 9.17/2.15  % (3406304)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=564857221:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2994 on theBenchmark for (2994ds/242Mi)
% 9.17/2.16  % (3406301)Instruction limit reached! 
% 9.17/2.16  % (3406301)------------------------------
% 9.17/2.16  % (3406301)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.16  % (3406301)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.16  % (3406301)CaDiCaL version: 2.1.3
% 9.17/2.16  % (3406301)Termination reason: Instruction limit
% 9.17/2.16  % (3406301)Termination phase: Saturation
% 9.17/2.16  % (3406301)Time elapsed: 0.057 s
% 9.17/2.16  % (3406301)Peak memory usage: 90 MB
% 9.17/2.16  % (3406301)Instructions burned: 107 (million)
% 9.17/2.16  % (3406302)Instruction limit reached! 
% 9.17/2.16  % (3406302)------------------------------
% 9.17/2.16  % (3406302)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.16  % (3406302)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.16  % (3406302)CaDiCaL version: 2.1.3
% 9.17/2.16  % (3406302)Termination reason: Instruction limit
% 9.17/2.16  % (3406302)Termination phase: Saturation
% 9.17/2.16  % (3406302)Time elapsed: 0.063 s
% 9.17/2.16  % (3406302)Peak memory usage: 90 MB
% 9.17/2.16  % (3406302)Instructions burned: 107 (million)
% 9.17/2.16  % (3406304)Instruction limit reached! 
% 9.17/2.16  % (3406304)------------------------------
% 9.17/2.16  % (3406304)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.16  % (3406304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.16  % (3406304)CaDiCaL version: 2.1.3
% 9.17/2.16  % (3406304)Termination reason: Instruction limit
% 9.17/2.16  % (3406304)Termination phase: Saturation
% 9.17/2.16  % (3406304)Time elapsed: 0.083 s
% 9.17/2.16  % (3406304)Peak memory usage: 90 MB
% 9.17/2.16  % (3406304)Instructions burned: 245 (million)
% 9.17/2.16  % (3406309)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=1275079977:cond=fast:i=5208:av=off_2993 on theBenchmark for (2993ds/5208Mi)
% 9.17/2.16  % (3406310)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=656691874:i=134:sd=2:doe=on:ss=axioms:sgt=14_2993 on theBenchmark for (2993ds/134Mi)
% 9.17/2.16  % (3406311)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=281385509:i=499:bd=all_2992 on theBenchmark for (2992ds/499Mi)
% 9.17/2.16  % (3406310)Instruction limit reached! 
% 9.17/2.16  % (3406310)------------------------------
% 9.17/2.16  % (3406310)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.16  % (3406310)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.16  % (3406310)CaDiCaL version: 2.1.3
% 9.17/2.16  % (3406310)Termination reason: Instruction limit
% 9.17/2.16  % (3406310)Termination phase: Saturation
% 9.17/2.16  % (3406310)Time elapsed: 0.094 s
% 9.17/2.16  % (3406310)Peak memory usage: 90 MB
% 9.17/2.16  % (3406310)Instructions burned: 134 (million)
% 9.17/2.16  % (3406315)lrs+10_64_to=lpo:sil=8000:prc=on:sp=reverse_frequency:nwc=5:alpa=false:flr=on:random_seed=752100881:i=191:fgj=on:bd=all_2990 on theBenchmark for (2990ds/191Mi)
% 9.17/2.16  % (3406315)Instruction limit reached! 
% 9.17/2.16  % (3406315)------------------------------
% 9.17/2.16  % (3406315)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.16  % (3406315)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.16  % (3406315)CaDiCaL version: 2.1.3
% 9.17/2.16  % (3406315)Termination reason: Instruction limit
% 9.17/2.16  % (3406315)Termination phase: Saturation
% 9.17/2.16  % (3406315)Time elapsed: 0.109 s
% 9.17/2.16  % (3406315)Peak memory usage: 93 MB
% 9.17/2.16  % (3406315)Instructions burned: 192 (million)
% 9.17/2.16  % (3406311)Instruction limit reached! 
% 9.17/2.16  % (3406311)------------------------------
% 9.17/2.16  % (3406311)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.16  % (3406311)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.16  % (3406311)CaDiCaL version: 2.1.3
% 9.17/2.16  % (3406311)Termination reason: Instruction limit
% 9.17/2.16  % (3406311)Termination phase: Saturation
% 9.17/2.16  % (3406311)Time elapsed: 0.254 s
% 9.17/2.16  % (3406311)Peak memory usage: 97 MB
% 9.17/2.16  % (3406311)Instructions burned: 499 (million)
% 9.17/2.16  % (3406277)First to succeed.
% 9.17/2.16  % (3406277)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3406270"
% 9.17/2.16  % (3406317)lrs-11_32_anc=all:sil=8000:spb=goal_then_units:sac=on:random_seed=3892167216:i=264:kws=precedence:fsr=off_2988 on theBenchmark for (2988ds/264Mi)
% 9.17/2.16  % (3406318)lrs-22_64_to=lpo:sil=8000:sp=const_frequency:urr=ec_only:nwc=4:flr=on:random_seed=2530148701:cond=on:i=156:bs=on:gtg=exists_all:er=known_2988 on theBenchmark for (2988ds/156Mi)
% 9.17/2.16  % (3406318)Instruction limit reached! 
% 9.17/2.16  % (3406318)------------------------------
% 9.17/2.16  % (3406318)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.16  % (3406318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.16  % (3406318)CaDiCaL version: 2.1.3
% 9.17/2.16  % (3406318)Termination reason: Instruction limit
% 9.17/2.16  % (3406318)Termination phase: Saturation
% 9.17/2.16  % (3406318)Time elapsed: 0.093 s
% 9.17/2.16  % (3406318)Peak memory usage: 90 MB
% 9.17/2.16  % (3406318)Instructions burned: 157 (million)
% 9.17/2.16  % (3406317)Instruction limit reached! 
% 9.17/2.16  % (3406317)------------------------------
% 9.17/2.16  % (3406317)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.17/2.16  % (3406317)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.17/2.16  % (3406317)CaDiCaL version: 2.1.3
% 9.17/2.16  % (3406317)Termination reason: Instruction limit
% 9.17/2.16  % (3406317)Termination phase: Saturation
% 9.17/2.16  % (3406317)Time elapsed: 0.136 s
% 9.17/2.16  % (3406317)Peak memory usage: 92 MB
% 9.17/2.16  % (3406317)Instructions burned: 265 (million)
% 9.17/2.16  % (3406309)Also succeeded, but the first one will report.
% 9.17/2.16  % (3406277)Refutation found. Thanks to Tanya!
% 9.17/2.16  % SZS status Unsatisfiable for theBenchmark
% 9.17/2.16  % SZS output start Proof for theBenchmark
% See solution above
% 11.12/2.36  % (3406277)------------------------------
% 11.12/2.36  % (3406277)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.12/2.36  % (3406277)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.12/2.36  % (3406277)CaDiCaL version: 2.1.3
% 11.12/2.36  % (3406277)Termination reason: Refutation
% 11.12/2.36  % (3406277)Time elapsed: 1.076 s
% 11.12/2.36  % (3406277)Peak memory usage: 135 MB
% 11.12/2.36  % (3406277)Instructions burned: 1652 (million)
% 11.12/2.36  % (3406277)------------------------------
% 11.12/2.36  % (3406277)------------------------------
% 11.12/2.36  % (3406270)Success in time 1.497 s
% 11.12/2.36  % Vampire exiting
%------------------------------------------------------------------------------