↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : LCL767_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n014.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:00:31 PM UTC 2026

% Result   : Theorem 3.11s 1.02s
% Output   : Refutation 3.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   44 (  21 unt;   0 typ;   2 def)
%            Number of atoms       :   77 (   5 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   61 (  28   ~;  23   |;   4   &)
%                                         (   5 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   6 usr;   3 prp; 0-3 aty)
%            Number of functors    :   63 (  63 usr;  10 con; 0-5 aty)
%            Number of variables   :   53 (   0 sgn  51   !;   2   ?;  53   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    bool: $tType ).

tff(type_def_6,type,
    dB: $tType ).

tff(type_def_7,type,
    list: $tType > $tType ).

tff(type_def_8,type,
    nat: $tType ).

tff(type_def_9,type,
    fun: ( $tType * $tType ) > $tType ).

tff(func_def_0,type,
    combb: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).

tff(func_def_1,type,
    combc: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( fun(X0,fun(X1,X2)) > fun(X1,fun(X0,X2)) ) ).

tff(func_def_2,type,
    combs: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).

tff(func_def_3,type,
    it: fun(dB,bool) ).

tff(func_def_4,type,
    abs: dB > dB ).

tff(func_def_5,type,
    app: fun(dB,fun(dB,dB)) ).

tff(func_def_6,type,
    var: nat > dB ).

tff(func_def_7,type,
    dB_case: 
      !>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).

tff(func_def_8,type,
    append: 
      !>[X0: $tType] : fun(list(X0),fun(list(X0),list(X0))) ).

tff(func_def_9,type,
    butlast: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

tff(func_def_10,type,
    foldl: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).

tff(func_def_11,type,
    insert: 
      !>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).

tff(func_def_12,type,
    last: 
      !>[X0: $tType] : ( list(X0) > X0 ) ).

tff(func_def_13,type,
    cons: 
      !>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).

tff(func_def_14,type,
    nil: 
      !>[X0: $tType] : list(X0) ).

tff(func_def_15,type,
    list_case: 
      !>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).

tff(func_def_16,type,
    maps: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,list(X1)) * list(X0) ) > list(X1) ) ).

tff(func_def_17,type,
    rev: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

tff(func_def_18,type,
    rotate1: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

tff(func_def_19,type,
    splice: 
      !>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).

tff(func_def_20,type,
    aa: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).

tff(func_def_21,type,
    fFalse: bool ).

tff(func_def_22,type,
    fNot: fun(bool,bool) ).

tff(func_def_23,type,
    fTrue: bool ).

tff(func_def_24,type,
    fconj: fun(bool,fun(bool,bool)) ).

tff(func_def_25,type,
    fdisj: fun(bool,fun(bool,bool)) ).

tff(func_def_26,type,
    fequal: 
      !>[X0: $tType] : ( X0 > fun(X0,bool) ) ).

tff(func_def_27,type,
    i: nat ).

tff(func_def_28,type,
    n: nat ).

tff(func_def_29,type,
    rs: list(dB) ).

tff(func_def_30,type,
    sK0: ( list(dB) * dB * dB * dB ) > list(dB) ).

tff(func_def_31,type,
    sK1: 
      !>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > list(X0) ) ).

tff(func_def_32,type,
    sK2: 
      !>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).

tff(func_def_33,type,
    sK3: 
      !>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * list(X0) ) > list(X0) ) ).

tff(func_def_34,type,
    sK4: 
      !>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).

tff(func_def_35,type,
    sK5: 
      !>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > list(X0) ) ).

tff(func_def_36,type,
    sK6: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

tff(func_def_37,type,
    sK7: 
      !>[X0: $tType] : ( list(X0) > X0 ) ).

tff(func_def_38,type,
    sK8: 
      !>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).

tff(func_def_39,type,
    sK9: 
      !>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).

tff(func_def_40,type,
    sK10: 
      !>[X0: $tType] : ( list(X0) > X0 ) ).

tff(func_def_41,type,
    sK11: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

tff(func_def_42,type,
    sK12: 
      !>[X0: $tType] : ( list(X0) > X0 ) ).

tff(func_def_43,type,
    sK13: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

tff(func_def_44,type,
    sK14: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

tff(func_def_45,type,
    sK15: 
      !>[X0: $tType] : ( list(X0) > X0 ) ).

tff(func_def_46,type,
    sK16: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).

tff(func_def_47,type,
    sK17: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).

tff(func_def_48,type,
    sK18: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).

tff(func_def_49,type,
    sK19: dB > nat ).

tff(func_def_50,type,
    sK20: dB > dB ).

tff(func_def_51,type,
    sK21: dB > dB ).

tff(func_def_52,type,
    sK22: dB > dB ).

tff(func_def_53,type,
    sK23: dB > list(dB) ).

tff(func_def_54,type,
    sK24: dB > dB ).

tff(func_def_55,type,
    sK25: dB > dB ).

tff(func_def_56,type,
    sK26: dB > nat ).

tff(func_def_57,type,
    sK27: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).

tff(func_def_58,type,
    sK28: 
      !>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).

tff(func_def_59,type,
    sK29: 
      !>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).

tff(func_def_60,type,
    sK30: 
      !>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).

tff(pred_def_1,type,
    list_all: 
      !>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).

tff(pred_def_2,type,
    list_ex1: 
      !>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).

tff(pred_def_3,type,
    listsp: 
      !>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).

tff(pred_def_4,type,
    pp: bool > $o ).

tff(f1,axiom,
    ! [X4: nat] : pp(aa(dB,bool,it,var(X4))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_Var__IT) ).

tff(f2,axiom,
    ! [X0: nat,X1: list(dB)] :
      ( listsp(dB,it,X1)
     => pp(aa(dB,bool,it,foldl(dB,dB,app,var(X0),X1))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_IT_OVar) ).

tff(f8,axiom,
    ! [X0: $tType,X1: list(X0),X2: list(X0),X3: fun(X0,bool)] :
      ( listsp(X0,X3,aa(list(X0),list(X0),aa(list(X0),fun(list(X0),list(X0)),append(X0),X2),X1))
    <=> ( listsp(X0,X3,X2)
        & listsp(X0,X3,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_7_append__in__listsp__conv) ).

tff(f9,axiom,
    ! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_8_listsp_ONil) ).

tff(f18,axiom,
    ! [X0: $tType,X1: fun(X0,bool),X2: fun(X0,bool),X3: list(X0)] :
      ( listsp(X0,combs(X0,bool,bool,combb(bool,fun(bool,bool),X0,fconj,X2),X1),X3)
    <=> ( listsp(X0,X2,X3)
        & listsp(X0,X1,X3) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_17_listsp__conj__eq) ).

tff(f38,axiom,
    ! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
      ( listsp(X0,X2,X1)
    <=> ( ( X1 = nil(X0) )
        | ? [X3: X0,X4: list(X0)] :
            ( ( X1 = aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) )
            & pp(aa(X0,bool,X2,X3))
            & listsp(X0,X2,X4) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_37_listsp_Osimps) ).

tff(f47,axiom,
    ! [X0: $tType,X1: X0] : ( insert(X0,X1,nil(X0)) = aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X1),nil(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_46_insert__Nil) ).

tff(f116,axiom,
    listsp(dB,combs(dB,bool,bool,combb(bool,fun(bool,bool),dB,fconj,it),combb(dB,bool,dB,it,aa(dB,fun(dB,dB),combc(dB,dB,dB,app),var(i)))),rs),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(f117,conjecture,
    pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),aa(list(dB),list(dB),aa(list(dB),fun(list(dB),list(dB)),append(dB),rs),aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB)))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

tff(f118,negated_conjecture,
    ~ pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),aa(list(dB),list(dB),aa(list(dB),fun(list(dB),list(dB)),append(dB),rs),aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB)))))),
    inference(negated_conjecture,[status(cth)],[f117]) ).

tff(f119,plain,
    ! [X0: nat] : pp(aa(dB,bool,it,var(X0))),
    inference(rectify,[],[f1]) ).

tff(f121,plain,
    ~ pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),aa(list(dB),list(dB),aa(list(dB),fun(list(dB),list(dB)),append(dB),rs),aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB)))))),
    inference(flattening,[],[f118]) ).

tff(f122,plain,
    ! [X0: nat,X1: list(dB)] :
      ( pp(aa(dB,bool,it,foldl(dB,dB,app,var(X0),X1)))
      | ~ listsp(dB,it,X1) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f151,plain,
    ! [X0: nat] : pp(aa(dB,bool,it,var(X0))),
    inference(cnf_transformation,[],[f119]) ).

tff(f152,plain,
    ! [X0: nat,X1: list(dB)] :
      ( pp(aa(dB,bool,it,foldl(dB,dB,app,var(X0),X1)))
      | ~ listsp(dB,it,X1) ),
    inference(cnf_transformation,[],[f122]) ).

tff(f171,plain,
    ! [X0: $tType,X2: list(X0),X3: fun(X0,bool),X1: list(X0)] :
      ( listsp(X0,X3,aa(list(X0),list(X0),aa(list(X0),fun(list(X0),list(X0)),append(X0),X2),X1))
      | ~ listsp(X0,X3,X2)
      | ~ listsp(X0,X3,X1) ),
    inference(cnf_transformation,[],[f8]) ).

tff(f172,plain,
    ! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
    inference(cnf_transformation,[],[f9]) ).

tff(f190,plain,
    ! [X0: $tType,X2: fun(X0,bool),X3: list(X0),X1: fun(X0,bool)] :
      ( ~ listsp(X0,combs(X0,bool,bool,combb(bool,fun(bool,bool),X0,fconj,X2),X1),X3)
      | listsp(X0,X2,X3) ),
    inference(cnf_transformation,[],[f18]) ).

tff(f231,plain,
    ! [X0: $tType,X2: fun(X0,bool),X3: X0,X1: list(X0),X4: list(X0)] :
      ( ~ listsp(X0,X2,X4)
      | ~ pp(aa(X0,bool,X2,X3))
      | ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 )
      | listsp(X0,X2,X1) ),
    inference(cnf_transformation,[],[f38]) ).

tff(f249,plain,
    ! [X0: $tType,X1: X0] : ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X1),nil(X0)) = insert(X0,X1,nil(X0)) ),
    inference(cnf_transformation,[],[f47]) ).

tff(f347,plain,
    listsp(dB,combs(dB,bool,bool,combb(bool,fun(bool,bool),dB,fconj,it),combb(dB,bool,dB,it,aa(dB,fun(dB,dB),combc(dB,dB,dB,app),var(i)))),rs),
    inference(cnf_transformation,[],[f116]) ).

tff(f348,plain,
    ~ pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),aa(list(dB),list(dB),aa(list(dB),fun(list(dB),list(dB)),append(dB),rs),aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB)))))),
    inference(cnf_transformation,[],[f121]) ).

tff(f397,plain,
    ! [X0: $tType,X2: fun(X0,bool),X3: X0,X4: list(X0)] :
      ( listsp(X0,X2,aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4))
      | ~ pp(aa(X0,bool,X2,X3))
      | ~ listsp(X0,X2,X4) ),
    inference(equality_resolution,[],[f231]) ).

tff(f496,plain,
    ~ listsp(dB,it,aa(list(dB),list(dB),aa(list(dB),fun(list(dB),list(dB)),append(dB),rs),aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB)))),
    inference(resolution,[],[f152,f348]) ).

tff(f856,plain,
    ( ~ listsp(dB,it,rs)
    | ~ listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),var(i)),nil(dB))) ),
    inference(resolution,[],[f171,f496]) ).

tff(f865,plain,
    ( ~ listsp(dB,it,insert(dB,var(i),nil(dB)))
    | ~ listsp(dB,it,rs) ),
    inference(forward_demodulation,[],[f856,f249]) ).

tff(f867,definition,
    ( spl31_1
  <=> listsp(dB,it,rs) ),
    introduced(definition,[new_symbols(definition,[spl31_1])],[avatar_definition]) ).

tff(f869,plain,
    ( ~ listsp(dB,it,rs)
    | spl31_1 ),
    inference(avatar_component_clause,[],[f867]) ).

tff(f871,definition,
    ( spl31_2
  <=> listsp(dB,it,insert(dB,var(i),nil(dB))) ),
    introduced(definition,[new_symbols(definition,[spl31_2])],[avatar_definition]) ).

tff(f873,plain,
    ( ~ listsp(dB,it,insert(dB,var(i),nil(dB)))
    | spl31_2 ),
    inference(avatar_component_clause,[],[f871]) ).

tff(f874,plain,
    ( ~ spl31_1
    | ~ spl31_2 ),
    inference(avatar_split_clause,[],[f865,f871,f867]) ).

tff(f953,plain,
    ! [X0: $tType,X2: fun(X0,bool),X1: X0] :
      ( listsp(X0,X2,insert(X0,X1,nil(X0)))
      | ~ pp(aa(X0,bool,X2,X1))
      | ~ listsp(X0,X2,nil(X0)) ),
    inference(superposition,[],[f397,f249]) ).

tff(f957,plain,
    ! [X0: $tType,X2: fun(X0,bool),X1: X0] :
      ( listsp(X0,X2,insert(X0,X1,nil(X0)))
      | ~ pp(aa(X0,bool,X2,X1)) ),
    inference(forward_subsumption_resolution,[],[f953,f172]) ).

tff(f958,plain,
    listsp(dB,it,rs),
    inference(resolution,[],[f347,f190]) ).

tff(f960,plain,
    ( $false
    | spl31_1 ),
    inference(forward_subsumption_resolution,[],[f958,f869]) ).

tff(f961,plain,
    spl31_1,
    inference(avatar_contradiction_clause,[],[f960]) ).

tff(f2413,plain,
    ( ~ pp(aa(dB,bool,it,var(i)))
    | spl31_2 ),
    inference(resolution,[],[f957,f873]) ).

tff(f2418,plain,
    ( $false
    | spl31_2 ),
    inference(forward_subsumption_resolution,[],[f2413,f151]) ).

tff(f2419,plain,
    spl31_2,
    inference(avatar_contradiction_clause,[],[f2418]) ).

cnf(s1,plain,
    ( ~ spl31_1
    | ~ spl31_2 ),
    inference(sat_conversion,[],[f874]) ).

cnf(s2,plain,
    spl31_1,
    inference(sat_conversion,[],[f961]) ).

cnf(s11,plain,
    spl31_2,
    inference(sat_conversion,[],[f2419]) ).

cnf(s12,plain,
    $false,
    inference(rat,[],[s1,s11,s2]) ).

tff(f2420,plain,
    $false,
    inference(avatar_sat_refutation,[],[s12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL767_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n014.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 16:44:46 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.40  Running first-order model finding
% 0.14/0.40  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.11/1.02  % (1004032)Will run a generic schedule for satisfiability detection.
% 3.11/1.02  % (1004040)dis+10_1_sil=32000:sp=arity:random_seed=2163666621:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.11/1.02  % (1004038)% WARNING: option uhcvi not known.
% 3.11/1.02  % (1004041)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3499936163:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.11/1.02  % (1004038)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=18498695:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.11/1.02  % (1004039)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=188982355:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.11/1.02  % (1004042)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1282199155:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.11/1.02  % (1004037)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3287563743_2999 on theBenchmark for (2999ds/0Mi)
% 3.11/1.02  % (1004043)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=200364683:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.11/1.02  % Exception at run slice level
% 3.11/1.02  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.11/1.02  % (1004040)Instruction limit reached! 
% 3.11/1.02  % (1004040)------------------------------
% 3.11/1.02  % (1004040)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.11/1.02  % (1004040)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.02  % (1004040)CaDiCaL version: 2.1.3
% 3.11/1.02  % (1004040)Termination reason: Instruction limit
% 3.11/1.02  % (1004040)Termination phase: Saturation
% 3.11/1.02  % (1004040)Time elapsed: 0.034 s
% 3.11/1.02  % (1004040)Peak memory usage: 12 MB
% 3.11/1.02  % (1004040)Instructions burned: 103 (million)
% 3.11/1.02  % (1004051)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=514399118:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.11/1.02  % (1004052)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3092503305:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 3.11/1.02  % Exception at run slice level
% 3.11/1.02  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.11/1.02  % (1004055)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3929157652:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 3.11/1.02  % (1004041)Instruction limit reached! 
% 3.11/1.02  % (1004041)------------------------------
% 3.11/1.02  % (1004041)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.11/1.02  % (1004041)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.02  % (1004041)CaDiCaL version: 2.1.3
% 3.11/1.02  % (1004041)Termination reason: Instruction limit
% 3.11/1.02  % (1004041)Termination phase: Saturation
% 3.11/1.02  % (1004041)Time elapsed: 0.068 s
% 3.11/1.02  % (1004041)Peak memory usage: 12 MB
% 3.11/1.02  % (1004041)Instructions burned: 118 (million)
% 3.11/1.02  % (1004042)Instruction limit reached! 
% 3.11/1.02  % (1004042)------------------------------
% 3.11/1.02  % (1004042)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.11/1.02  % (1004042)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.02  % (1004042)CaDiCaL version: 2.1.3
% 3.11/1.02  % (1004042)Termination reason: Instruction limit
% 3.11/1.02  % (1004042)Termination phase: Saturation
% 3.11/1.02  % (1004042)Time elapsed: 0.079 s
% 3.11/1.02  % (1004042)Peak memory usage: 13 MB
% 3.11/1.02  % (1004042)Instructions burned: 132 (million)
% 3.11/1.02  % (1004052)Instruction limit reached! 
% 3.11/1.02  % (1004052)------------------------------
% 3.11/1.02  % (1004052)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.11/1.02  % (1004052)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.02  % (1004052)CaDiCaL version: 2.1.3
% 3.11/1.02  % (1004052)Termination reason: Instruction limit
% 3.11/1.02  % (1004052)Termination phase: Saturation
% 3.11/1.02  % (1004052)Time elapsed: 0.045 s
% 3.11/1.02  % (1004052)Peak memory usage: 13 MB
% 3.11/1.02  % (1004052)Instructions burned: 134 (million)
% 3.11/1.02  % (1004057)ott-21_1_sil=16000:fs=off:random_seed=1277022510:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 3.11/1.02  % (1004043)Instruction limit reached! 
% 3.11/1.02  % (1004043)------------------------------
% 3.11/1.02  % (1004043)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.11/1.02  % (1004043)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.02  % (1004043)CaDiCaL version: 2.1.3
% 3.11/1.02  % (1004043)Termination reason: Instruction limit
% 3.11/1.02  % (1004043)Termination phase: Saturation
% 3.11/1.02  % (1004043)Time elapsed: 0.090 s
% 3.11/1.02  % (1004043)Peak memory usage: 12 MB
% 3.11/1.02  % (1004043)Instructions burned: 160 (million)
% 3.11/1.02  % (1004059)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1417373256:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 3.11/1.02  % Exception at run slice level
% 3.11/1.02  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.11/1.02  % (1004058)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2223721977:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 3.11/1.02  % (1004063)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=501276446:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 3.11/1.02  % (1004061)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2021688957:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 3.11/1.02  % Exception at run slice level
% 3.11/1.02  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.11/1.02  % (1004067)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=905961465:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2998 on theBenchmark for (2998ds/692Mi)
% 3.11/1.02  % (1004057)Instruction limit reached! 
% 3.11/1.02  % (1004057)------------------------------
% 3.11/1.02  % (1004057)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.11/1.02  % (1004057)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.02  % (1004057)CaDiCaL version: 2.1.3
% 3.11/1.02  % (1004057)Termination reason: Instruction limit
% 3.11/1.02  % (1004057)Termination phase: Saturation
% 3.11/1.02  % (1004057)Time elapsed: 0.118 s
% 3.11/1.02  % (1004057)Peak memory usage: 12 MB
% 3.11/1.02  % (1004057)Instructions burned: 181 (million)
% 3.11/1.02  % (1004082)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=257685494:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 3.11/1.02  % (1004067)Instruction limit reached! 
% 3.11/1.02  % (1004067)------------------------------
% 3.11/1.02  % (1004067)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.11/1.02  % (1004067)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.02  % (1004067)CaDiCaL version: 2.1.3
% 3.11/1.02  % (1004067)Termination reason: Instruction limit
% 3.11/1.02  % (1004067)Termination phase: Saturation
% 3.11/1.02  % (1004067)Time elapsed: 0.252 s
% 3.11/1.02  % (1004067)Peak memory usage: 19 MB
% 3.11/1.02  % (1004067)Instructions burned: 695 (million)
% 3.11/1.02  % (1004084)fmb+10_1_sil=64000:random_seed=3460640491:i=22061:nm=2:gsp=on_2995 on theBenchmark for (2995ds/22061Mi)
% 3.11/1.02  % (1004058)Instruction limit reached! 
% 3.11/1.02  % (1004058)------------------------------
% 3.11/1.02  % (1004058)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.11/1.02  % (1004058)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.02  % (1004058)CaDiCaL version: 2.1.3
% 3.11/1.02  % (1004058)Termination reason: Instruction limit
% 3.11/1.02  % (1004058)Termination phase: Saturation
% 3.11/1.02  % (1004058)Time elapsed: 0.287 s
% 3.11/1.02  % (1004058)Peak memory usage: 14 MB
% 3.11/1.02  % (1004058)Instructions burned: 477 (million)
% 3.11/1.02  % (1004084)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.11/1.02  % Exception at run slice level
% 3.11/1.02  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.11/1.02  % (1004055)Instruction limit reached! 
% 3.11/1.02  % (1004055)------------------------------
% 3.11/1.02  % (1004055)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.11/1.02  % (1004055)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.02  % (1004055)CaDiCaL version: 2.1.3
% 3.11/1.02  % (1004055)Termination reason: Instruction limit
% 3.11/1.02  % (1004055)Termination phase: Saturation
% 3.11/1.02  % (1004055)Time elapsed: 0.344 s
% 3.11/1.02  % (1004055)Peak memory usage: 14 MB
% 3.11/1.02  % (1004055)Instructions burned: 685 (million)
% 3.11/1.02  % (1004086)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2618400506:i=9515:nm=5_2995 on theBenchmark for (2995ds/9515Mi)
% 3.11/1.02  % (1004087)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3972551930:fmbsr=1.7:i=920_2995 on theBenchmark for (2995ds/920Mi)
% 3.11/1.02  % Exception at run slice level
% 3.11/1.02  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.11/1.02  % Exception at run slice level
% 3.11/1.02  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.11/1.02  % (1004088)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3753810209:i=5131_2995 on theBenchmark for (2995ds/5131Mi)
% 3.11/1.02  % (1004091)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=902316523:i=1472:ins=7:fdi=8:gsp=on_2995 on theBenchmark for (2995ds/1472Mi)
% 3.11/1.02  % (1004092)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=2499844132:i=6324_2995 on theBenchmark for (2995ds/6324Mi)
% 3.11/1.02  % (1004091)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.11/1.02  % Exception at run slice level
% 3.11/1.02  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.11/1.02  % (1004096)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=10412078:fmbsr=2.30978:i=2174_2995 on theBenchmark for (2995ds/2174Mi)
% 3.11/1.02  % Exception at run slice level
% 3.11/1.02  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.11/1.02  % (1004098)ott-2_1_sil=16000:newcnf=on:random_seed=2395196722:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2995 on theBenchmark for (2995ds/869Mi)
% 3.11/1.02  % (1004088) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1004032-1004088"...
% 3.11/1.02  % (1004088)...printing done.
% 3.11/1.02  % (1004088)Refutation found. Thanks to Tanya!
% 3.11/1.02  % SZS status Theorem for theBenchmark
% 3.11/1.02  % SZS output start Proof for theBenchmark
% See solution above
% 3.11/1.02  % (1004088)------------------------------
% 3.11/1.02  % (1004088)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.11/1.02  % (1004088)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.02  % (1004088)CaDiCaL version: 2.1.3
% 3.11/1.02  % (1004088)Termination reason: Refutation
% 3.11/1.02  % (1004088)Time elapsed: 0.140 s
% 3.11/1.02  % (1004088)Peak memory usage: 14 MB
% 3.11/1.02  % (1004088)Instructions burned: 238 (million)
% 3.11/1.02  % (1004032)Success in time 0.605 s
% 3.11/1.02  % Vampire exiting
%------------------------------------------------------------------------------