%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM187^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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 : Wed Sep 30 07:46:30 AM UTC 2026
% Result : Theorem 2.19s 0.61s
% Output : Refutation 2.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM187^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n006.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 17:49:54 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.19/0.61 % (1085466)Will run a generic schedule for satisfiability detection.
% 2.19/0.61 % (1085474)dis+10_1_sil=32000:sp=arity:random_seed=1285631422:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.19/0.61 % (1085472)% WARNING: option uhcvi not known.
% 2.19/0.61 % (1085473)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=235934859:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.19/0.61 % (1085471)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2129296175_2999 on theBenchmark for (2999ds/0Mi)
% 2.19/0.61 % (1085472)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1143827602:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.19/0.61 % (1085477)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=446571771:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.19/0.61 % (1085475)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1514433108:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.19/0.61 % (1085476)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2154354534:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.19/0.61 % (1085474)Instruction limit reached!
% 2.19/0.61 % (1085474)------------------------------
% 2.19/0.61 % (1085474)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.19/0.61 % (1085474)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.19/0.61 % (1085474)CaDiCaL version: 2.1.3
% 2.19/0.61 % (1085474)Termination reason: Instruction limit
% 2.19/0.61 % (1085474)Termination phase: Property scanning
% 2.19/0.61 % (1085474)Time elapsed: 0.024 s
% 2.19/0.61 % (1085474)Peak memory usage: 11 MB
% 2.19/0.61 % (1085474)Instructions burned: 104 (million)
% 2.19/0.61 % (1085472)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.19/0.61 % (1085475)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.19/0.61 % (1085485)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3472190265:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.19/0.61 % (1085475)Instruction limit reached!
% 2.19/0.61 % (1085475)------------------------------
% 2.19/0.61 % (1085475)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.19/0.61 % (1085475)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.19/0.61 % (1085475)CaDiCaL version: 2.1.3
% 2.19/0.61 % (1085475)Termination reason: Instruction limit
% 2.19/0.61 % (1085475)Termination phase: Property scanning
% 2.19/0.61 % (1085475)Time elapsed: 0.051 s
% 2.19/0.61 % (1085475)Peak memory usage: 11 MB
% 2.19/0.61 % (1085475)Instructions burned: 117 (million)
% 2.19/0.61 % Exception at run slice level
% 2.19/0.61 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.19/0.61 % Exception at run slice level
% 2.19/0.61 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.19/0.61 % (1085476)Instruction limit reached!
% 2.19/0.61 % (1085476)------------------------------
% 2.19/0.61 % (1085476)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.19/0.61 % (1085476)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.19/0.61 % (1085476)CaDiCaL version: 2.1.3
% 2.19/0.61 % (1085476)Termination reason: Instruction limit
% 2.19/0.61 % (1085476)Termination phase: Saturation
% 2.19/0.61 % (1085476)Time elapsed: 0.058 s
% 2.19/0.61 % (1085476)Peak memory usage: 12 MB
% 2.19/0.61 % (1085476)Instructions burned: 132 (million)
% 2.19/0.61 % (1085472)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.19/0.61 % (1085477)Instruction limit reached!
% 2.19/0.61 % (1085477)------------------------------
% 2.19/0.61 % (1085477)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.19/0.61 % (1085477)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.19/0.61 % (1085477)CaDiCaL version: 2.1.3
% 2.19/0.61 % (1085477)Termination reason: Instruction limit
% 2.19/0.61 % (1085477)Termination phase: Saturation
% 2.19/0.61 % (1085477)Time elapsed: 0.071 s
% 2.19/0.61 % (1085477)Peak memory usage: 13 MB
% 2.19/0.61 % (1085477)Instructions burned: 160 (million)
% 2.19/0.61 % (1085487)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=605547954:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.19/0.61 % (1085488)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=3281150313:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.19/0.61 % (1085489)ott-21_1_sil=16000:fs=off:random_seed=235801658:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.19/0.61 % (1085490)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1598338272:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.19/0.61 % (1085493)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=580200846:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 2.19/0.61 % (1085488)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.19/0.61 % (1085489)Instruction limit reached!
% 2.19/0.61 % (1085489)------------------------------
% 2.19/0.61 % (1085489)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.19/0.61 % (1085489)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.19/0.61 % (1085489)CaDiCaL version: 2.1.3
% 2.19/0.61 % (1085489)Termination reason: Instruction limit
% 2.19/0.61 % (1085489)Termination phase: Saturation
% 2.19/0.61 % (1085489)Time elapsed: 0.048 s
% 2.19/0.61 % (1085489)Peak memory usage: 13 MB
% 2.19/0.61 % (1085489)Instructions burned: 184 (million)
% 2.19/0.61 % (1085488)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.19/0.61 % (1085487)Instruction limit reached!
% 2.19/0.61 % (1085487)------------------------------
% 2.19/0.61 % (1085487)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.19/0.61 % (1085487)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.19/0.61 % (1085487)CaDiCaL version: 2.1.3
% 2.19/0.61 % (1085487)Termination reason: Instruction limit
% 2.19/0.61 % (1085487)Termination phase: Saturation
% 2.19/0.61 % (1085487)Time elapsed: 0.058 s
% 2.19/0.61 % (1085487)Peak memory usage: 12 MB
% 2.19/0.61 % (1085487)Instructions burned: 132 (million)
% 2.19/0.61 % (1085497)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=191212004:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 2.19/0.61 % Exception at run slice level
% 2.19/0.61 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.19/0.61 % (1085498)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3707595368:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 2.19/0.61 % (1085500)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=3023783818: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)
% 2.19/0.61 % (1085500)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.19/0.61 % Exception at run slice level
% 2.19/0.61 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.19/0.61 % (1085503)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3117007199:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 2.19/0.61 % (1085503)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.19/0.61 % (1085500) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1085466-1085500"...
% 2.19/0.61 % (1085500)...printing done.
% 2.19/0.61 % (1085500)Refutation found. Thanks to Tanya!
% 2.19/0.61 % SZS status Theorem for theBenchmark
% 2.19/0.61 % SZS output start Proof for theBenchmark
% 2.19/0.61 thf(type_def_5, type, product_prod: ($tType * $tType) > $tType).
% 2.19/0.61 thf(type_def_6, type, sum_sum: ($tType * $tType) > $tType).
% 2.19/0.61 thf(type_def_7, type, dtree: $tType).
% 2.19/0.61 thf(type_def_8, type, set: $tType > $tType).
% 2.19/0.61 thf(type_def_9, type, t: $tType).
% 2.19/0.61 thf(type_def_10, type, n: $tType).
% 2.19/0.61 thf(type_def_11, type, itself: $tType > $tType).
% 2.19/0.61 thf(type_def_12, type, sTfun: ($tType * $tType) > $tType).
% 2.19/0.61 thf(func_def_0, type, finite_finite: !>[X0: $tType]:((itself @ X0 > $o))).
% 2.19/0.61 thf(func_def_1, type, node: (n > set @ sum_sum @ t @ dtree > dtree)).
% 2.19/0.61 thf(func_def_2, type, cont: (dtree > set @ sum_sum @ t @ dtree)).
% 2.19/0.61 thf(func_def_3, type, root: (dtree > n)).
% 2.19/0.61 thf(func_def_4, type, unfold: !>[X0: $tType]:(((X0 > n) > (X0 > set @ sum_sum @ t @ X0) > X0 > dtree))).
% 2.19/0.61 thf(func_def_5, type, finite_finite2: !>[X0: $tType]:((set @ X0 > $o))).
% 2.19/0.61 thf(func_def_6, type, comp: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1) > (X2 > X0) > X2 > X1))).
% 2.19/0.61 thf(func_def_7, type, id: !>[X0: $tType]:((X0 > X0))).
% 2.19/0.61 thf(func_def_8, type, inj_on: !>[X0: $tType, X1: $tType]:(((X0 > X1) > set @ X0 > $o))).
% 2.19/0.61 thf(func_def_9, type, gram_L1451583632elle_P: set @ product_prod @ n @ set @ sum_sum @ t @ n).
% 2.19/0.61 thf(func_def_10, type, gram_L1451583635elle_S: (n > set @ sum_sum @ t @ n)).
% 2.19/0.61 thf(func_def_11, type, gram_L1231612515_deftr: (n > dtree)).
% 2.19/0.61 thf(func_def_12, type, gram_L1004374585hsubst: (dtree > dtree > dtree)).
% 2.19/0.61 thf(func_def_13, type, gram_L1905609002ubst_c: (dtree > dtree > set @ sum_sum @ t @ dtree)).
% 2.19/0.61 thf(func_def_14, type, gram_L1905609017ubst_r: (dtree > n)).
% 2.19/0.61 thf(func_def_15, type, gram_L1333338417e_inFr: (set @ n > dtree > t > $o)).
% 2.19/0.61 thf(func_def_16, type, gram_L805317441_inFr2: (set @ n > dtree > t > $o)).
% 2.19/0.61 thf(func_def_17, type, gram_L805317505_inFrr: (set @ n > dtree > t > $o)).
% 2.19/0.61 thf(func_def_18, type, gram_L830233218_inItr: (set @ n > dtree > n > $o)).
% 2.19/0.61 thf(func_def_19, type, gram_L716654942_subtr: (set @ n > dtree > dtree > $o)).
% 2.19/0.61 thf(func_def_20, type, gram_L1283001940subtr2: (set @ n > dtree > dtree > $o)).
% 2.19/0.61 thf(func_def_21, type, gram_L1614515765ubtrOf: (dtree > n > dtree)).
% 2.19/0.61 thf(func_def_22, type, gram_L864798063lle_wf: (dtree > $o)).
% 2.19/0.61 thf(func_def_23, type, if: !>[X0: $tType]:(($o > X0 > X0 > X0))).
% 2.19/0.61 thf(func_def_24, type, bot_bot: !>[X0: $tType]:(X0)).
% 2.19/0.61 thf(func_def_25, type, product_Pair: !>[X0: $tType, X1: $tType]:((X0 > X1 > product_prod @ X0 @ X1))).
% 2.19/0.61 thf(func_def_26, type, type: !>[X0: $tType]:(itself @ X0)).
% 2.19/0.61 thf(func_def_27, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 2.19/0.61 thf(func_def_28, type, image: !>[X0: $tType, X1: $tType]:(((X0 > X1) > set @ X0 > set @ X1))).
% 2.19/0.61 thf(func_def_29, type, insert: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 2.19/0.61 thf(func_def_30, type, vimage: !>[X0: $tType, X1: $tType]:(((X0 > X1) > set @ X1 > set @ X0))).
% 2.19/0.61 thf(func_def_31, type, sum_Inl: !>[X0: $tType, X1: $tType]:((X0 > sum_sum @ X0 @ X1))).
% 2.19/0.61 thf(func_def_32, type, sum_Inr: !>[X0: $tType, X1: $tType]:((X0 > sum_sum @ X1 @ X0))).
% 2.19/0.61 thf(func_def_33, type, sum_map_sum: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((X0 > X1) > (X2 > X3) > sum_sum @ X0 @ X2 > sum_sum @ X1 @ X3))).
% 2.19/0.61 thf(func_def_34, type, sum_rec_sum: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1) > (X2 > X1) > sum_sum @ X0 @ X2 > X1))).
% 2.19/0.61 thf(func_def_35, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 2.19/0.61 thf(func_def_36, type, tr: dtree).
% 2.19/0.61 thf(func_def_37, type, tr0: dtree).
% 2.19/0.61 thf(func_def_41, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 2.19/0.61 thf(func_def_42, type, db0: !>[X0: $tType]:(X0)).
% 2.19/0.61 thf(func_def_43, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 2.19/0.61 thf(func_def_44, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 2.19/0.61 thf(func_def_45, type, vAND: ($o > $o > $o)).
% 2.19/0.61 thf(func_def_46, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 2.19/0.61 thf(func_def_47, type, db1: !>[X0: $tType]:(X0)).
% 2.19/0.61 thf(func_def_48, type, vOR: ($o > $o > $o)).
% 2.19/0.61 thf(func_def_49, type, db5: !>[X0: $tType]:(X0)).
% 2.19/0.61 thf(func_def_50, type, db4: !>[X0: $tType]:(X0)).
% 2.19/0.61 thf(func_def_51, type, db3: !>[X0: $tType]:(X0)).
% 2.19/0.61 thf(func_def_52, type, db2: !>[X0: $tType]:(X0)).
% 2.19/0.61 thf(func_def_53, type, db6: !>[X0: $tType]:(X0)).
% 2.19/0.61 thf(func_def_54, type, vIMP: ($o > $o > $o)).
% 2.19/0.61 thf(func_def_55, type, vNOT: ($o > $o)).
% 2.19/0.61 thf(func_def_56, type, sP0: !>[X0: $tType, X1: $tType, X2: $tType]:(((sum_sum @ X1 @ X0 > X2) > X2 > $o > $o))).
% 2.19/0.61 thf(func_def_57, type, sP1: (dtree > set @ n > t > $o)).
% 2.19/0.61 thf(func_def_58, type, sP2: (set @ n > t > dtree > $o)).
% 2.19/0.61 thf(func_def_59, type, sP3: ((set @ n > dtree > t > $o) > $o)).
% 2.19/0.61 thf(func_def_60, type, sP4: ((set @ n > dtree > t > $o) > $o)).
% 2.19/0.61 thf(func_def_61, type, sP5: (set @ n > dtree > t > $o)).
% 2.19/0.61 thf(func_def_62, type, sP6: ((set @ n > dtree > t > $o) > $o)).
% 2.19/0.61 thf(func_def_63, type, sP7: ((set @ n > dtree > t > $o) > $o)).
% 2.19/0.61 thf(func_def_64, type, sP8: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X1) > X1 > (X1 > X0) > $o))).
% 2.19/0.61 thf(func_def_65, type, sP9: !>[X0: $tType, X1: $tType]:((set @ X1 > X0 > (X1 > X0) > set @ X0 > $o))).
% 2.19/0.61 thf(func_def_66, type, sP10: !>[X0: $tType, X1: $tType]:((set @ X0 > (X0 > X1) > $o))).
% 2.19/0.61 thf(func_def_67, type, sP11: (dtree > $o)).
% 2.19/0.61 thf(func_def_68, type, sP12: (dtree > (dtree > $o) > $o)).
% 2.19/0.61 thf(func_def_69, type, sP13: ((set @ n > dtree > dtree > $o) > $o)).
% 2.19/0.61 thf(func_def_70, type, sP14: ((set @ n > dtree > dtree > $o) > $o)).
% 2.19/0.61 thf(func_def_71, type, sP15: (set @ n > dtree > dtree > $o)).
% 2.19/0.61 thf(func_def_72, type, sP16: (dtree > dtree > set @ n > $o)).
% 2.19/0.61 thf(func_def_73, type, sP17: (dtree > (dtree > $o) > $o)).
% 2.19/0.61 thf(func_def_74, type, sP18: (dtree > (dtree > $o) > $o)).
% 2.19/0.61 thf(func_def_75, type, sP19: ((set @ n > dtree > n > $o) > $o)).
% 2.19/0.61 thf(func_def_76, type, sP20: (dtree > set @ n > n > $o)).
% 2.19/0.61 thf(func_def_77, type, sP21: (n > dtree > set @ n > $o)).
% 2.19/0.61 thf(func_def_78, type, sP22: (dtree > set @ n > dtree > $o)).
% 2.19/0.61 thf(func_def_79, type, sP23: (dtree > dtree > set @ n > $o)).
% 2.19/0.61 thf(func_def_80, type, sP24: ((set @ n > dtree > dtree > $o) > $o)).
% 2.19/0.61 thf(func_def_81, type, sP25: !>[X0: $tType]:(((set @ X0 > $o) > $o))).
% 2.19/0.61 thf(func_def_82, type, sP26: !>[X0: $tType]:(((set @ X0 > $o) > $o))).
% 2.19/0.61 thf(func_def_83, type, sP27: !>[X0: $tType]:(((set @ X0 > $o) > $o))).
% 2.19/0.61 thf(func_def_84, type, sP28: !>[X0: $tType]:(((set @ X0 > $o) > $o))).
% 2.19/0.61 thf(func_def_85, type, sK29: !>[X0: $tType, X1: $tType]:(((X0 > $o) > set @ X1 > (X1 > X0) > X0))).
% 2.19/0.61 thf(func_def_86, type, sK30: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_87, type, sK31: !>[X0: $tType, X1: $tType]:(((X0 > $o) > set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_88, type, sK32: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > X0) > (X0 > $o) > X1))).
% 2.19/0.61 thf(func_def_89, type, sK33: !>[X0: $tType, X1: $tType, X2: $tType]:((X2 > sum_sum @ X1 @ X0 > (X1 > X2) > X1))).
% 2.19/0.61 thf(func_def_90, type, sK34: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 2.19/0.61 thf(func_def_91, type, sK35: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_92, type, sK36: !>[X0: $tType, X1: $tType, X2: $tType]:(((sum_sum @ X1 @ X0 > X2) > X2 > $o > X1))).
% 2.19/0.61 thf(func_def_93, type, sK37: !>[X0: $tType, X1: $tType, X2: $tType]:(($o > (sum_sum @ X0 @ X1 > X2) > X2 > X1))).
% 2.19/0.61 thf(func_def_94, type, sK38: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > X1))).
% 2.19/0.61 thf(func_def_95, type, sK39: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > X0))).
% 2.19/0.61 thf(func_def_96, type, sK40: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > X1))).
% 2.19/0.61 thf(func_def_97, type, sK41: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > X0))).
% 2.19/0.61 thf(func_def_98, type, sK42: !>[X0: $tType, X1: $tType]:(((sum_sum @ X1 @ X0 > $o) > X0))).
% 2.19/0.61 thf(func_def_99, type, sK43: !>[X0: $tType, X1: $tType]:(((sum_sum @ X1 @ X0 > $o) > X1))).
% 2.19/0.61 thf(func_def_100, type, sK44: !>[X0: $tType, X1: $tType, X2: $tType]:((X2 > sum_sum @ X0 @ X1 > (X1 > X2) > X1))).
% 2.19/0.61 thf(func_def_101, type, sK45: !>[X0: $tType, X1: $tType, X2: $tType]:((set @ sum_sum @ X0 @ X1 > (X1 > X2) > X2 > X1))).
% 2.19/0.61 thf(func_def_102, type, sK46: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_103, type, sK47: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_104, type, sK48: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > X1))).
% 2.19/0.61 thf(func_def_105, type, sK49: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > X0))).
% 2.19/0.61 thf(func_def_106, type, sK50: (dtree > set @ n > t > dtree)).
% 2.19/0.61 thf(func_def_107, type, sK51: (dtree > n)).
% 2.19/0.61 thf(func_def_108, type, sK52: (dtree > set @ sum_sum @ t @ dtree)).
% 2.19/0.61 thf(func_def_109, type, sK53: ((set @ n > dtree > t > $o) > dtree)).
% 2.19/0.61 thf(func_def_110, type, sK54: ((set @ n > dtree > t > $o) > set @ n)).
% 2.19/0.61 thf(func_def_111, type, sK55: ((set @ n > dtree > t > $o) > dtree)).
% 2.19/0.61 thf(func_def_112, type, sK56: ((set @ n > dtree > t > $o) > t)).
% 2.19/0.61 thf(func_def_113, type, sK57: ((set @ n > dtree > t > $o) > dtree)).
% 2.19/0.61 thf(func_def_114, type, sK58: ((set @ n > dtree > t > $o) > set @ n)).
% 2.19/0.61 thf(func_def_115, type, sK59: ((set @ n > dtree > t > $o) > t)).
% 2.19/0.61 thf(func_def_116, type, sK60: (dtree > dtree > n)).
% 2.19/0.61 thf(func_def_117, type, sK61: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > set @ X1 > X1 > X0))).
% 2.19/0.61 thf(func_def_118, type, sK62: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_119, type, sK63: (set @ n > dtree > t > dtree)).
% 2.19/0.61 thf(func_def_120, type, sK64: (set @ n > dtree > t > dtree)).
% 2.19/0.61 thf(func_def_121, type, sK65: (set @ n > dtree > t > set @ n)).
% 2.19/0.61 thf(func_def_122, type, sK66: ((set @ n > dtree > t > $o) > dtree)).
% 2.19/0.61 thf(func_def_123, type, sK67: ((set @ n > dtree > t > $o) > dtree)).
% 2.19/0.61 thf(func_def_124, type, sK68: ((set @ n > dtree > t > $o) > set @ n)).
% 2.19/0.61 thf(func_def_125, type, sK69: ((set @ n > dtree > t > $o) > t)).
% 2.19/0.61 thf(func_def_126, type, sK70: ((set @ n > dtree > t > $o) > dtree)).
% 2.19/0.61 thf(func_def_127, type, sK71: ((set @ n > dtree > t > $o) > set @ n)).
% 2.19/0.61 thf(func_def_128, type, sK72: ((set @ n > dtree > t > $o) > t)).
% 2.19/0.61 thf(func_def_129, type, sK73: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X1) > X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_130, type, sK74: !>[X0: $tType, X1: $tType]:(((X1 > X1) > (X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_131, type, sK75: !>[X0: $tType, X1: $tType]:((set @ X1 > X0 > (X1 > X0) > set @ X0 > X1))).
% 2.19/0.61 thf(func_def_132, type, sK76: !>[X0: $tType, X1: $tType]:((set @ X1 > X0 > (X1 > X0) > set @ X0 > set @ X1))).
% 2.19/0.61 thf(func_def_133, type, sK77: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 2.19/0.61 thf(func_def_134, type, sK78: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X0 > X1) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_135, type, sK79: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_136, type, sK80: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 2.19/0.61 thf(func_def_137, type, sK81: !>[X0: $tType, X1: $tType]:((set @ X0 > (X0 > X1) > X0))).
% 2.19/0.61 thf(func_def_138, type, sK82: !>[X0: $tType, X1: $tType]:((set @ X0 > (X0 > X1) > X0))).
% 2.19/0.61 thf(func_def_139, type, sK83: (dtree > (dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_140, type, sK84: ((dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_141, type, sK85: (n > set @ sum_sum @ t @ n)).
% 2.19/0.61 thf(func_def_142, type, sK86: ((set @ n > dtree > dtree > $o) > set @ n)).
% 2.19/0.61 thf(func_def_143, type, sK87: ((set @ n > dtree > dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_144, type, sK88: ((set @ n > dtree > dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_145, type, sK89: ((set @ n > dtree > dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_146, type, sK90: ((set @ n > dtree > dtree > $o) > set @ n)).
% 2.19/0.61 thf(func_def_147, type, sK91: ((set @ n > dtree > dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_148, type, sK92: ((set @ n > dtree > dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_149, type, sK93: ((set @ n > dtree > dtree > $o) > set @ n)).
% 2.19/0.61 thf(func_def_150, type, sK94: ((set @ n > dtree > dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_151, type, sK95: ((set @ n > dtree > dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_152, type, sK96: ((set @ n > dtree > dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_153, type, sK97: ((set @ n > dtree > dtree > $o) > set @ n)).
% 2.19/0.61 thf(func_def_154, type, sK98: (set @ n > dtree > dtree > dtree)).
% 2.19/0.61 thf(func_def_155, type, sK99: (t > dtree > set @ n > dtree)).
% 2.19/0.61 thf(func_def_156, type, sK100: (dtree > (dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_157, type, sK101: ((dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_158, type, sK102: (dtree > (dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_159, type, sK103: ((dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_160, type, sK104: (dtree > dtree)).
% 2.19/0.61 thf(func_def_161, type, sK105: ((set @ n > dtree > n > $o) > dtree)).
% 2.19/0.61 thf(func_def_162, type, sK106: ((set @ n > dtree > n > $o) > set @ n)).
% 2.19/0.61 thf(func_def_163, type, sK107: ((set @ n > dtree > n > $o) > dtree)).
% 2.19/0.61 thf(func_def_164, type, sK108: ((set @ n > dtree > n > $o) > n)).
% 2.19/0.61 thf(func_def_165, type, sK109: ((set @ n > dtree > n > $o) > dtree)).
% 2.19/0.61 thf(func_def_166, type, sK110: ((set @ n > dtree > n > $o) > set @ n)).
% 2.19/0.61 thf(func_def_167, type, sK111: (n > dtree > set @ n > dtree)).
% 2.19/0.61 thf(func_def_168, type, sK112: (dtree > set @ n > n > dtree)).
% 2.19/0.61 thf(func_def_169, type, sK113: (dtree > set @ n > dtree > dtree)).
% 2.19/0.61 thf(func_def_170, type, sK114: ((set @ n > dtree > dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_171, type, sK115: ((set @ n > dtree > dtree > $o) > set @ n)).
% 2.19/0.61 thf(func_def_172, type, sK116: ((set @ n > dtree > dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_173, type, sK117: ((set @ n > dtree > dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_174, type, sK118: ((set @ n > dtree > dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_175, type, sK119: ((set @ n > dtree > dtree > $o) > set @ n)).
% 2.19/0.61 thf(func_def_176, type, sK120: !>[X0: $tType, X1: $tType]:((set @ X0 > (X0 > X1) > X1))).
% 2.19/0.61 thf(func_def_177, type, sK121: !>[X0: $tType]:(((set @ X0 > $o) > X0))).
% 2.19/0.61 thf(func_def_178, type, sK122: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0))).
% 2.19/0.61 thf(func_def_179, type, sK123: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0))).
% 2.19/0.61 thf(func_def_180, type, sK124: !>[X0: $tType]:(((set @ X0 > $o) > X0))).
% 2.19/0.61 thf(func_def_181, type, sK125: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0))).
% 2.19/0.61 thf(func_def_182, type, sK126: !>[X0: $tType]:(((set @ X0 > $o) > X0))).
% 2.19/0.61 thf(func_def_183, type, sK127: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0))).
% 2.19/0.61 thf(func_def_184, type, sK128: !>[X0: $tType]:(((set @ X0 > $o) > X0))).
% 2.19/0.61 thf(func_def_185, type, sK129: !>[X0: $tType]:(((set @ X0 > $o) > X0))).
% 2.19/0.61 thf(func_def_186, type, sK130: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0))).
% 2.19/0.61 thf(func_def_187, type, sK131: !>[X0: $tType]:((set @ X0 > set @ X0))).
% 2.19/0.61 thf(func_def_188, type, sK132: !>[X0: $tType]:((set @ X0 > X0))).
% 2.19/0.61 thf(func_def_189, type, sK133: !>[X0: $tType, X1: $tType, X2: $tType]:(((X1 > X0) > set @ X1 > (X0 > X2) > X0))).
% 2.19/0.61 thf(func_def_190, type, sK134: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_191, type, sK135: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_192, type, sK136: !>[X0: $tType, X1: $tType, X2: $tType]:(((X1 > X0) > set @ X1 > (X0 > X2) > X0))).
% 2.19/0.61 thf(func_def_193, type, sK137: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_194, type, sK138: !>[X0: $tType, X1: $tType, X2: $tType]:((set @ X1 > (X1 > X2) > (X2 > X0) > X1))).
% 2.19/0.61 thf(func_def_195, type, sK139: !>[X0: $tType, X1: $tType, X2: $tType]:((set @ X1 > (X1 > X2) > (X2 > X0) > X1))).
% 2.19/0.61 thf(func_def_196, type, sK140: !>[X0: $tType, X1: $tType, X2: $tType]:(((X1 > X0) > set @ X1 > (X0 > X2) > X0))).
% 2.19/0.61 thf(func_def_197, type, sK141: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_198, type, sK142: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_199, type, sK143: !>[X0: $tType, X1: $tType, X2: $tType]:(((X1 > X0) > set @ X1 > (X0 > X2) > X0))).
% 2.19/0.61 thf(func_def_200, type, sK144: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_201, type, sK145: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_202, type, sK146: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X2) > set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_203, type, sK147: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X2) > set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_204, type, sK148: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_205, type, sK149: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X2) > set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_206, type, sK150: !>[X0: $tType]:((set @ X0 > X0))).
% 2.19/0.61 thf(func_def_207, type, sK151: !>[X0: $tType]:(((X0 > $o) > X0))).
% 2.19/0.61 thf(func_def_208, type, sK152: !>[X0: $tType]:(((X0 > $o) > X0))).
% 2.19/0.61 thf(func_def_209, type, sK153: (dtree > dtree)).
% 2.19/0.61 thf(func_def_210, type, sK154: (dtree > dtree)).
% 2.19/0.61 thf(func_def_211, type, sK155: (dtree > dtree)).
% 2.19/0.61 thf(func_def_212, type, sK156: (dtree > dtree)).
% 2.19/0.61 thf(func_def_213, type, sK157: ((dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_214, type, sK158: ((dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_215, type, sK159: (dtree > dtree)).
% 2.19/0.61 thf(func_def_216, type, sK160: (dtree > dtree)).
% 2.19/0.61 thf(func_def_217, type, sK161: (dtree > dtree)).
% 2.19/0.61 thf(func_def_218, type, sK162: (dtree > dtree)).
% 2.19/0.61 thf(func_def_219, type, sK163: ((dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_220, type, sK164: ((dtree > $o) > dtree)).
% 2.19/0.61 thf(func_def_221, type, sK165: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_222, type, sK166: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_223, type, sK167: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_224, type, sK168: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_225, type, sK169: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_226, type, sK170: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_227, type, sK171: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_228, type, sK172: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_229, type, sK173: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_230, type, sK174: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_231, type, sK175: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_232, type, sK176: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_233, type, sK177: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_234, type, sK178: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_235, type, sK179: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_236, type, sK180: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_237, type, sK181: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_238, type, sK182: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_239, type, sK183: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_240, type, sK184: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_241, type, sK185: !>[X0: $tType]:((X0 > set @ X0 > X0 > set @ X0 > set @ X0))).
% 2.19/0.61 thf(func_def_242, type, sK186: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_243, type, sK187: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_244, type, sK188: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_245, type, sK189: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X1))).
% 2.19/0.61 thf(func_def_246, type, sK190: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X1) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_247, type, sK191: !>[X0: $tType]:(((X0 > X0) > set @ X0 > X0))).
% 2.19/0.61 thf(func_def_248, type, sK192: !>[X0: $tType]:(((X0 > X0) > set @ X0 > X0))).
% 2.19/0.61 thf(func_def_249, type, sK193: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X1) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_250, type, sK194: !>[X0: $tType]:(((X0 > X0) > set @ X0 > X0))).
% 2.19/0.61 thf(func_def_251, type, sK195: !>[X0: $tType]:(((X0 > X0) > set @ X0 > X0))).
% 2.19/0.61 thf(func_def_252, type, sK196: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_253, type, sK197: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_254, type, sK198: !>[X0: $tType]:(((X0 > X0) > set @ X0 > X0))).
% 2.19/0.61 thf(func_def_255, type, sK199: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_256, type, sK200: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X1) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_257, type, sK201: !>[X0: $tType]:(((X0 > X0) > set @ X0 > X0))).
% 2.19/0.61 thf(func_def_258, type, sK202: !>[X0: $tType]:(((X0 > X0) > set @ X0 > X0))).
% 2.19/0.61 thf(func_def_259, type, sK203: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X1) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_260, type, sK204: !>[X0: $tType]:(((X0 > X0) > set @ X0 > X0))).
% 2.19/0.61 thf(func_def_261, type, sK205: !>[X0: $tType]:(((X0 > X0) > set @ X0 > X0))).
% 2.19/0.61 thf(func_def_262, type, sK206: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_263, type, sK207: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_264, type, sK208: !>[X0: $tType]:(((X0 > X0) > set @ X0 > X0))).
% 2.19/0.61 thf(func_def_265, type, sK209: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X1))).
% 2.19/0.61 thf(func_def_266, type, sK210: !>[X0: $tType, X1: $tType, X2: $tType]:((set @ sum_sum @ X2 @ X1 > (X1 > X0) > X0 > X1))).
% 2.19/0.61 thf(func_def_267, type, sK211: !>[X0: $tType]:(((X0 > X0) > X0))).
% 2.19/0.61 thf(func_def_268, type, sK212: !>[X0: $tType, X1: $tType]:(((X1 > X0) > set @ X1 > X0 > X1))).
% 2.19/0.61 thf(f3,axiom,(
% 2.19/0.61 ! [X0 : $tType,X1 : $tType,X2 : $tType,X3 : (X1 > X0),X4 : set @ sum_sum @ X2 @ X1] : (((vimage @ X2 @ sum_sum @ X2 @ X0 @ sum_Inl @ X2 @ X0 @ (image @ sum_sum @ X2 @ X1 @ sum_sum @ X2 @ X0 @ (sum_map_sum @ X2 @ X2 @ X1 @ X0 @ id @ X2 @ X3) @ X4))) = ((vimage @ X2 @ sum_sum @ X2 @ X1 @ sum_Inl @ X2 @ X1 @ X4)))),
% 2.19/0.61 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_Inl__m__oplus)).
% 2.19/0.61 thf(f14,axiom,(
% 2.19/0.61 ! [X0 : $tType] : (id @ X0 = (^[X1 : X0] : (X1)))),
% 2.19/0.61 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_13_id__apply)).
% 2.19/0.61 thf(f85,axiom,(
% 2.19/0.61 (gram_L1905609002ubst_c = (^[X0 : dtree, X1 : dtree] : ((if @ set @ sum_sum @ t @ dtree @ (((root @ X1)) = ((root @ X0))) @ (cont @ X0) @ (cont @ X1)))))),
% 2.19/0.61 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_84_Gram__Lang__Mirabelle__ojxrtuoybn_Ohsubst__c__def)).
% 2.19/0.61 thf(f104,axiom,(
% 2.19/0.61 (gram_L1004374585hsubst = (^[X0 : dtree] : ((unfold @ dtree @ gram_L1905609017ubst_r @ (gram_L1905609002ubst_c @ X0)))))),
% 2.19/0.61 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_103_Gram__Lang__Mirabelle__ojxrtuoybn_Ohsubst__def)).
% 2.19/0.61 thf(f107,axiom,(
% 2.19/0.61 (gram_L1905609017ubst_r = root)),
% 2.19/0.61 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_106_hsubst__r__def)).
% 2.19/0.61 thf(f265,conjecture,(
% 2.19/0.61 (((vimage @ t @ sum_sum @ t @ dtree @ sum_Inl @ t @ dtree @ (image @ sum_sum @ t @ dtree @ sum_sum @ t @ dtree @ (sum_map_sum @ t @ t @ dtree @ dtree @ id @ t @ (gram_L1004374585hsubst @ tr0)) @ (cont @ tr)))) = ((vimage @ t @ sum_sum @ t @ dtree @ sum_Inl @ t @ dtree @ (cont @ tr))))),
% 2.19/0.61 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)).
% 2.19/0.61 thf(f266,negated_conjecture,(
% 2.19/0.61 ~ (((vimage @ t @ sum_sum @ t @ dtree @ sum_Inl @ t @ dtree @ (image @ sum_sum @ t @ dtree @ sum_sum @ t @ dtree @ (sum_map_sum @ t @ t @ dtree @ dtree @ id @ t @ (gram_L1004374585hsubst @ tr0)) @ (cont @ tr)))) = ((vimage @ t @ sum_sum @ t @ dtree @ sum_Inl @ t @ dtree @ (cont @ tr))))),
% 2.19/0.61 inference(negated_conjecture,[status(cth)],[f265])).
% 2.19/0.61 thf(f273,plain,(
% 2.19/0.61 ! [X0 : $tType] : (id @ X0 = (^[Y0 : X0]: (Y0)))),
% 2.19/0.61 inference(fool_elimination,[],[f14])).
% 2.19/0.61 thf(f332,plain,(
% 2.19/0.61 (gram_L1905609002ubst_c = (^[X0 : dtree, X1 : dtree] : ((if @ set @ sum_sum @ t @ dtree @ (((root @ X1)) = ((root @ X0))) @ (cont @ X0) @ (cont @ X1)))))),
% 2.19/0.61 inference(rectify,[],[f85])).
% 2.19/0.61 thf(f333,plain,(
% 2.19/0.61 (gram_L1905609002ubst_c = (^[Y0 : dtree]: ((^[Y1 : dtree]: (if @ set @ sum_sum @ t @ dtree @ ((root @ Y0) = (root @ Y1)) @ (cont @ Y0) @ (cont @ Y1))))))),
% 2.19/0.61 inference(fool_elimination,[],[f332])).
% 2.19/0.61 thf(f358,plain,(
% 2.19/0.61 (gram_L1004374585hsubst = (^[Y0 : dtree]: (unfold @ dtree @ gram_L1905609017ubst_r @ (gram_L1905609002ubst_c @ Y0))))),
% 2.19/0.61 inference(fool_elimination,[],[f104])).
% 2.19/0.61 thf(f615,plain,(
% 2.19/0.61 (((vimage @ t @ sum_sum @ t @ dtree @ sum_Inl @ t @ dtree @ (image @ sum_sum @ t @ dtree @ sum_sum @ t @ dtree @ (sum_map_sum @ t @ t @ dtree @ dtree @ id @ t @ (gram_L1004374585hsubst @ tr0)) @ (cont @ tr)))) != ((vimage @ t @ sum_sum @ t @ dtree @ sum_Inl @ t @ dtree @ (cont @ tr))))),
% 2.19/0.61 inference(flattening,[],[f266])).
% 2.19/0.61 thf(f1022,plain,(
% 2.19/0.61 ( ! [X1 : $tType,X0 : $tType,X2 : $tType,X3 : (X1 > X0),X4 : set @ sum_sum @ X2 @ X1] : ((((vimage @ X2 @ sum_sum @ X2 @ X0 @ sum_Inl @ X2 @ X0 @ (image @ sum_sum @ X2 @ X1 @ sum_sum @ X2 @ X0 @ (sum_map_sum @ X2 @ X2 @ X1 @ X0 @ id @ X2 @ X3) @ X4))) = ((vimage @ X2 @ sum_sum @ X2 @ X1 @ sum_Inl @ X2 @ X1 @ X4)))) )),
% 2.19/0.61 inference(cnf_transformation,[],[f3])).
% 2.19/0.61 thf(f1033,plain,(
% 2.19/0.61 ( ! [X0 : $tType] : ((id @ X0 = (^[Y0 : X0]: (Y0)))) )),
% 2.19/0.61 inference(cnf_transformation,[],[f273])).
% 2.19/0.61 thf(f1120,plain,(
% 2.19/0.61 (gram_L1905609002ubst_c = (^[Y0 : dtree]: ((^[Y1 : dtree]: (if @ set @ sum_sum @ t @ dtree @ ((root @ Y0) = (root @ Y1)) @ (cont @ Y0) @ (cont @ Y1))))))),
% 2.19/0.61 inference(cnf_transformation,[],[f333])).
% 2.19/0.61 thf(f1146,plain,(
% 2.19/0.61 (gram_L1004374585hsubst = (^[Y0 : dtree]: (unfold @ dtree @ gram_L1905609017ubst_r @ (gram_L1905609002ubst_c @ Y0))))),
% 2.19/0.61 inference(cnf_transformation,[],[f358])).
% 2.19/0.61 thf(f1149,plain,(
% 2.19/0.61 (root = gram_L1905609017ubst_r)),
% 2.19/0.61 inference(cnf_transformation,[],[f107])).
% 2.19/0.61 thf(f1419,plain,(
% 2.19/0.61 (((vimage @ t @ sum_sum @ t @ dtree @ sum_Inl @ t @ dtree @ (image @ sum_sum @ t @ dtree @ sum_sum @ t @ dtree @ (sum_map_sum @ t @ t @ dtree @ dtree @ id @ t @ (gram_L1004374585hsubst @ tr0)) @ (cont @ tr)))) != ((vimage @ t @ sum_sum @ t @ dtree @ sum_Inl @ t @ dtree @ (cont @ tr))))),
% 2.19/0.61 inference(cnf_transformation,[],[f615])).
% 2.19/0.61 thf(f1423,plain,(
% 2.19/0.61 (gram_L1905609002ubst_c = (^[Y0 : dtree]: ((^[Y1 : dtree]: (if @ set @ sum_sum @ t @ dtree @ ((gram_L1905609017ubst_r @ Y0) = (gram_L1905609017ubst_r @ Y1)) @ (cont @ Y0) @ (cont @ Y1))))))),
% 2.19/0.61 inference(definition_unfolding,[],[f1120,f1149,f1149])).
% 2.19/0.61 thf(f1424,plain,(
% 2.19/0.61 (gram_L1004374585hsubst = (^[Y0 : dtree]: (unfold @ dtree @ gram_L1905609017ubst_r @ ((^[Y1 : dtree]: ((^[Y2 : dtree]: (if @ set @ sum_sum @ t @ dtree @ ((gram_L1905609017ubst_r @ Y1) = (gram_L1905609017ubst_r @ Y2)) @ (cont @ Y1) @ (cont @ Y2))))) @ Y0))))),
% 2.19/0.61 inference(definition_unfolding,[],[f1146,f1423])).
% 2.19/0.61 thf(f1427,plain,(
% 2.19/0.61 ( ! [X1 : $tType,X0 : $tType,X2 : $tType,X3 : (X1 > X0),X4 : set @ sum_sum @ X2 @ X1] : ((((vimage @ X2 @ sum_sum @ X2 @ X1 @ sum_Inl @ X2 @ X1 @ X4)) = ((vimage @ X2 @ sum_sum @ X2 @ X0 @ sum_Inl @ X2 @ X0 @ (image @ sum_sum @ X2 @ X1 @ sum_sum @ X2 @ X0 @ (sum_map_sum @ X2 @ X2 @ X1 @ X0 @ (^[Y0 : X2]: (Y0)) @ X3) @ X4))))) )),
% 2.19/0.61 inference(definition_unfolding,[],[f1022,f1033])).
% 2.19/0.61 thf(f1602,plain,(
% 2.19/0.61 (((vimage @ t @ sum_sum @ t @ dtree @ sum_Inl @ t @ dtree @ (cont @ tr))) != ((vimage @ t @ sum_sum @ t @ dtree @ sum_Inl @ t @ dtree @ (image @ sum_sum @ t @ dtree @ sum_sum @ t @ dtree @ (sum_map_sum @ t @ t @ dtree @ dtree @ (^[Y0 : t]: (Y0)) @ ((^[Y0 : dtree]: (unfold @ dtree @ gram_L1905609017ubst_r @ ((^[Y1 : dtree]: ((^[Y2 : dtree]: (if @ set @ sum_sum @ t @ dtree @ ((gram_L1905609017ubst_r @ Y1) = (gram_L1905609017ubst_r @ Y2)) @ (cont @ Y1) @ (cont @ Y2))))) @ Y0))) @ tr0)) @ (cont @ tr)))))),
% 2.19/0.61 inference(definition_unfolding,[],[f1419,f1033,f1424])).
% 2.19/0.61 thf(f1627,plain,(
% 2.19/0.61 (((vimage @ t @ sum_sum @ t @ dtree @ sum_Inl @ t @ dtree @ (cont @ tr))) != ((vimage @ t @ sum_sum @ t @ dtree @ sum_Inl @ t @ dtree @ (image @ sum_sum @ t @ dtree @ sum_sum @ t @ dtree @ (sum_map_sum @ t @ t @ dtree @ dtree @ (^[Y0 : t]: (Y0)) @ (unfold @ dtree @ gram_L1905609017ubst_r @ (^[Y0 : dtree]: (if @ set @ sum_sum @ t @ dtree @ ((gram_L1905609017ubst_r @ tr0) = (gram_L1905609017ubst_r @ Y0)) @ (cont @ tr0) @ (cont @ Y0))))) @ (cont @ tr)))))),
% 2.19/0.61 inference(beta-eta_normalization,[],[f1602])).
% 2.19/0.61 thf(f3248,plain,(
% 2.19/0.61 $false),
% 2.19/0.61 inference(backward_subsumption_resolution,[],[f1627,f1427])).
% 2.19/0.61 % SZS output end Proof for theBenchmark
% 2.19/0.61 % (1085500)------------------------------
% 2.19/0.61 % (1085500)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.19/0.61 % (1085500)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.19/0.61 % (1085500)CaDiCaL version: 2.1.3
% 2.19/0.61 % (1085500)Termination reason: Refutation
% 2.19/0.61 % (1085500)Time elapsed: 0.151 s
% 2.19/0.61 % (1085500)Peak memory usage: 16 MB
% 2.19/0.61 % (1085500)Instructions burned: 313 (million)
% 2.19/0.61 % (1085466)Success in time 0.373 s
% 2.19/0.61 % Vampire exiting
%------------------------------------------------------------------------------