%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ITP031^2 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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 08:10:26 AM UTC 2026
% Result : Theorem 2.90s 0.68s
% Output : Refutation 2.90s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP031^2 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n004.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % 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 19:38:59 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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
% 2.90/0.68 % (1738503)Will run a generic schedule for satisfiability detection.
% 2.90/0.68 % (1738513)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=427409317:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.90/0.68 % (1738509)% WARNING: option uhcvi not known.
% 2.90/0.68 % (1738509)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=858152243:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.90/0.68 % (1738510)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3939345161:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.90/0.68 % (1738511)dis+10_1_sil=32000:sp=arity:random_seed=1080583135:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.90/0.68 % (1738512)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2659149127:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.90/0.68 % (1738508)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2258206800_2999 on theBenchmark for (2999ds/0Mi)
% 2.90/0.68 % (1738514)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4144312140:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.90/0.68 % (1738509)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.90/0.68 % (1738512)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.90/0.68 % (1738513)Instruction limit reached!
% 2.90/0.68 % (1738513)------------------------------
% 2.90/0.68 % (1738513)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.68 % (1738513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.68 % (1738513)CaDiCaL version: 2.1.3
% 2.90/0.68 % (1738513)Termination reason: Instruction limit
% 2.90/0.68 % (1738513)Termination phase: Saturation
% 2.90/0.68 % (1738513)Time elapsed: 0.032 s
% 2.90/0.68 % (1738513)Peak memory usage: 13 MB
% 2.90/0.68 % (1738513)Instructions burned: 134 (million)
% 2.90/0.68 % (1738509)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.90/0.68 % Exception at run slice level
% 2.90/0.68 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.90/0.68 % (1738522)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4073919899:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.90/0.68 % (1738511)Instruction limit reached!
% 2.90/0.68 % (1738511)------------------------------
% 2.90/0.68 % (1738511)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.68 % (1738511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.68 % (1738511)CaDiCaL version: 2.1.3
% 2.90/0.68 % (1738511)Termination reason: Instruction limit
% 2.90/0.68 % (1738511)Termination phase: Saturation
% 2.90/0.68 % (1738511)Time elapsed: 0.045 s
% 2.90/0.68 % (1738511)Peak memory usage: 12 MB
% 2.90/0.68 % (1738511)Instructions burned: 103 (million)
% 2.90/0.68 % (1738512)Instruction limit reached!
% 2.90/0.68 % (1738512)------------------------------
% 2.90/0.68 % (1738512)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.68 % (1738512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.68 % (1738512)CaDiCaL version: 2.1.3
% 2.90/0.68 % (1738512)Termination reason: Instruction limit
% 2.90/0.68 % (1738512)Termination phase: Saturation
% 2.90/0.68 % (1738512)Time elapsed: 0.053 s
% 2.90/0.68 % (1738512)Peak memory usage: 12 MB
% 2.90/0.68 % (1738512)Instructions burned: 118 (million)
% 2.90/0.68 % Exception at run slice level
% 2.90/0.68 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.90/0.68 % (1738524)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=591493056:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.90/0.68 % (1738525)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=1192853472:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 2.90/0.68 % (1738526)ott-21_1_sil=16000:fs=off:random_seed=3565495846:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 2.90/0.68 % (1738527)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3361324550:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 2.90/0.68 % (1738525)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.90/0.68 % (1738525)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.90/0.68 % (1738524)Instruction limit reached!
% 2.90/0.68 % (1738524)------------------------------
% 2.90/0.68 % (1738524)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.68 % (1738524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.68 % (1738524)CaDiCaL version: 2.1.3
% 2.90/0.68 % (1738524)Termination reason: Instruction limit
% 2.90/0.68 % (1738524)Termination phase: Saturation
% 2.90/0.68 % (1738524)Time elapsed: 0.081 s
% 2.90/0.68 % (1738524)Peak memory usage: 13 MB
% 2.90/0.68 % (1738524)Instructions burned: 135 (million)
% 2.90/0.68 % (1738514)Instruction limit reached!
% 2.90/0.68 % (1738514)------------------------------
% 2.90/0.68 % (1738514)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.68 % (1738514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.68 % (1738514)CaDiCaL version: 2.1.3
% 2.90/0.68 % (1738514)Termination reason: Instruction limit
% 2.90/0.68 % (1738514)Termination phase: Saturation
% 2.90/0.68 % (1738514)Time elapsed: 0.125 s
% 2.90/0.68 % (1738514)Peak memory usage: 13 MB
% 2.90/0.68 % (1738514)Instructions burned: 159 (million)
% 2.90/0.68 % (1738526)Instruction limit reached!
% 2.90/0.68 % (1738526)------------------------------
% 2.90/0.68 % (1738526)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.68 % (1738526)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.68 % (1738526)CaDiCaL version: 2.1.3
% 2.90/0.68 % (1738526)Termination reason: Instruction limit
% 2.90/0.68 % (1738526)Termination phase: Saturation
% 2.90/0.68 % (1738526)Time elapsed: 0.082 s
% 2.90/0.68 % (1738526)Peak memory usage: 13 MB
% 2.90/0.68 % (1738526)Instructions burned: 180 (million)
% 2.90/0.68 % (1738532)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3361265916:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 2.90/0.68 % (1738533)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3788417741:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 2.90/0.68 % (1738534)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=530221059:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 2.90/0.68 % Exception at run slice level
% 2.90/0.68 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.90/0.68 % (1738538)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=110292958:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2997 on theBenchmark for (2997ds/692Mi)
% 2.90/0.68 % (1738538)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.90/0.68 % Exception at run slice level
% 2.90/0.68 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.90/0.68 % (1738540)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=678346501:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 2.90/0.68 % (1738540)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.90/0.68 % (1738527)Instruction limit reached!
% 2.90/0.68 % (1738527)------------------------------
% 2.90/0.68 % (1738527)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.68 % (1738527)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.68 % (1738527)CaDiCaL version: 2.1.3
% 2.90/0.68 % (1738527)Termination reason: Instruction limit
% 2.90/0.68 % (1738527)Termination phase: Saturation
% 2.90/0.68 % (1738527)Time elapsed: 0.268 s
% 2.90/0.68 % (1738527)Peak memory usage: 15 MB
% 2.90/0.68 % (1738527)Instructions burned: 477 (million)
% 2.90/0.68 % (1738542)fmb+10_1_sil=64000:random_seed=918567874:i=22061:nm=2:gsp=on_2996 on theBenchmark for (2996ds/22061Mi)
% 2.90/0.68 % (1738525)Instruction limit reached!
% 2.90/0.68 % (1738525)------------------------------
% 2.90/0.68 % (1738525)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.68 % (1738525)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.68 % (1738525)CaDiCaL version: 2.1.3
% 2.90/0.68 % (1738525)Termination reason: Instruction limit
% 2.90/0.68 % (1738525)Termination phase: Saturation
% 2.90/0.68 % (1738525)Time elapsed: 0.314 s
% 2.90/0.68 % (1738525)Peak memory usage: 15 MB
% 2.90/0.68 % (1738525)Instructions burned: 685 (million)
% 2.90/0.68 % (1738542)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.90/0.68 % Exception at run slice level
% 2.90/0.68 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.90/0.68 % (1738544)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=800313520:i=9515:nm=5_2995 on theBenchmark for (2995ds/9515Mi)
% 2.90/0.68 % (1738509) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1738503-1738509"...
% 2.90/0.68 % (1738509)...printing done.
% 2.90/0.68 % (1738509)Refutation found. Thanks to Tanya!
% 2.90/0.68 % SZS status Theorem for theBenchmark
% 2.90/0.68 % SZS output start Proof for theBenchmark
% 2.90/0.68 thf(type_def_5, type, binary1291135688e_Tree: $tType > $tType).
% 2.90/0.68 thf(type_def_6, type, set: $tType > $tType).
% 2.90/0.68 thf(type_def_7, type, int: $tType).
% 2.90/0.68 thf(type_def_8, type, a: $tType).
% 2.90/0.68 thf(type_def_9, type, sTfun: ($tType * $tType) > $tType).
% 2.90/0.68 thf(func_def_0, type, bounded_lattice: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_1, type, type: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_2, type, minus: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_3, type, bot: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_4, type, ord: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_5, type, order: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_6, type, group_add: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_7, type, lattice: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_8, type, no_bot: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_9, type, no_top: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_10, type, linorder: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_11, type, preorder: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_12, type, order_bot: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_13, type, wellorder: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_14, type, dense_order: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_15, type, semilattice_sup: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_16, type, ordered_ab_group_add: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_17, type, cancel146912293up_add: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_18, type, bounde1808546759up_bot: !>[X0: $tType]:($o)).
% 2.90/0.68 thf(func_def_19, type, binary210054475elle_T: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 2.90/0.68 thf(func_def_20, type, binary1746293266le_Tip: !>[X0: $tType]:(binary1291135688e_Tree @ X0)).
% 2.90/0.68 thf(func_def_21, type, binary2130109271t_Tree: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > set @ X0))).
% 2.90/0.68 thf(func_def_22, type, binary1830089824insert: !>[X0: $tType]:(((X0 > int) > X0 > binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 2.90/0.68 thf(func_def_23, type, binary64540844le_eqs: !>[X0: $tType]:(((X0 > int) > X0 > set @ X0))).
% 2.90/0.68 thf(func_def_24, type, binary827270440e_memb: !>[X0: $tType]:(((X0 > int) > X0 > binary1291135688e_Tree @ X0 > $o))).
% 2.90/0.68 thf(func_def_25, type, binary1653327646_setOf: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > set @ X0))).
% 2.90/0.68 thf(func_def_26, type, binary1610619414edTree: !>[X0: $tType]:(((X0 > int) > binary1291135688e_Tree @ X0 > $o))).
% 2.90/0.68 thf(func_def_27, type, binary231205461t_pred: !>[X0: $tType]:(((X0 > int) > X0 > X0 > binary1291135688e_Tree @ X0 > $o))).
% 2.90/0.68 thf(func_def_28, type, minus_minus: !>[X0: $tType]:((X0 > X0 > X0))).
% 2.90/0.68 thf(func_def_29, type, the: !>[X0: $tType]:(((X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_30, type, if: !>[X0: $tType]:(($o > X0 > X0 > X0))).
% 2.90/0.68 thf(func_def_31, type, sup_sup: !>[X0: $tType]:((X0 > X0 > X0))).
% 2.90/0.68 thf(func_def_32, type, bot_bot: !>[X0: $tType]:(X0)).
% 2.90/0.68 thf(func_def_33, type, ord_less: !>[X0: $tType]:((X0 > X0 > $o))).
% 2.90/0.68 thf(func_def_34, type, ord_less_eq: !>[X0: $tType]:((X0 > X0 > $o))).
% 2.90/0.68 thf(func_def_35, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 2.90/0.68 thf(func_def_36, type, insert: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 2.90/0.68 thf(func_def_37, type, is_empty: !>[X0: $tType]:((set @ X0 > $o))).
% 2.90/0.68 thf(func_def_38, type, is_singleton: !>[X0: $tType]:((set @ X0 > $o))).
% 2.90/0.68 thf(func_def_39, type, pairwise: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > $o))).
% 2.90/0.68 thf(func_def_40, type, remove: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 2.90/0.68 thf(func_def_41, type, the_elem: !>[X0: $tType]:((set @ X0 > X0))).
% 2.90/0.68 thf(func_def_42, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 2.90/0.68 thf(func_def_43, type, e: a).
% 2.90/0.68 thf(func_def_44, type, h: (a > int)).
% 2.90/0.68 thf(func_def_45, type, t1: binary1291135688e_Tree @ a).
% 2.90/0.68 thf(func_def_46, type, t2: binary1291135688e_Tree @ a).
% 2.90/0.68 thf(func_def_47, type, x: a).
% 2.90/0.68 thf(func_def_51, type, db2: !>[X0: $tType]:(X0)).
% 2.90/0.68 thf(func_def_52, type, db0: !>[X0: $tType]:(X0)).
% 2.90/0.68 thf(func_def_53, type, db1: !>[X0: $tType]:(X0)).
% 2.90/0.68 thf(func_def_54, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 2.90/0.68 thf(func_def_55, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 2.90/0.68 thf(func_def_56, type, vAND: ($o > $o > $o)).
% 2.90/0.68 thf(func_def_57, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 2.90/0.68 thf(func_def_58, type, vIMP: ($o > $o > $o)).
% 2.90/0.68 thf(func_def_59, type, db3: !>[X0: $tType]:(X0)).
% 2.90/0.68 thf(func_def_60, type, vNOT: ($o > $o)).
% 2.90/0.68 thf(func_def_61, type, vOR: ($o > $o > $o)).
% 2.90/0.68 thf(func_def_62, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 2.90/0.68 thf(func_def_63, type, sK0: !>[X0: $tType]:(((binary1291135688e_Tree @ X0 > $o) > binary1291135688e_Tree @ X0))).
% 2.90/0.68 thf(func_def_64, type, sK1: !>[X0: $tType]:(((binary1291135688e_Tree @ X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_65, type, sK2: !>[X0: $tType]:(((binary1291135688e_Tree @ X0 > $o) > binary1291135688e_Tree @ X0))).
% 2.90/0.68 thf(func_def_66, type, sK3: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 2.90/0.68 thf(func_def_67, type, sK4: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0))).
% 2.90/0.68 thf(func_def_68, type, sK5: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 2.90/0.68 thf(func_def_69, type, sK6: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_70, type, sK7: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 2.90/0.68 thf(func_def_71, type, sK8: !>[X0: $tType]:((set @ X0 > X0))).
% 2.90/0.68 thf(func_def_72, type, sK9: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 2.90/0.68 thf(func_def_73, type, sK10: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 2.90/0.68 thf(func_def_74, type, sK11: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 2.90/0.68 thf(func_def_75, type, sK12: !>[X0: $tType]:((set @ X0 > X0))).
% 2.90/0.68 thf(func_def_76, type, sK13: !>[X0: $tType]:((set @ X0 > X0))).
% 2.90/0.68 thf(func_def_77, type, sK14: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_78, type, sK15: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_79, type, sK16: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_80, type, sK17: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_81, type, sK18: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_82, type, sK19: !>[X0: $tType]:(((X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_83, type, sK20: !>[X0: $tType]:((X0 > X0 > X0))).
% 2.90/0.68 thf(func_def_84, type, sK21: !>[X0: $tType]:((X0 > X0))).
% 2.90/0.68 thf(func_def_85, type, sK22: !>[X0: $tType]:((X0 > X0))).
% 2.90/0.68 thf(func_def_86, type, sK23: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 2.90/0.68 thf(func_def_87, type, sK24: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 2.90/0.68 thf(func_def_88, type, sK25: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 2.90/0.68 thf(func_def_89, type, sK26: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 2.90/0.68 thf(func_def_90, type, sK27: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 2.90/0.68 thf(func_def_91, type, sK28: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 2.90/0.68 thf(func_def_92, type, sK29: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 2.90/0.68 thf(func_def_93, type, sK30: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 2.90/0.68 thf(func_def_94, type, sK31: !>[X0: $tType]:((set @ X0 > X0))).
% 2.90/0.68 thf(func_def_95, type, sK32: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 2.90/0.68 thf(func_def_96, type, sK33: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > X0))).
% 2.90/0.68 thf(func_def_97, type, sK34: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 2.90/0.68 thf(func_def_98, type, sK35: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 2.90/0.68 thf(func_def_99, type, sK36: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 2.90/0.68 thf(func_def_100, type, sK37: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 2.90/0.68 thf(func_def_101, type, sK38: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > X0))).
% 2.90/0.68 thf(func_def_102, type, sK39: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 2.90/0.68 thf(func_def_103, type, sK40: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_104, type, sK41: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_105, type, sK42: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_106, type, sK43: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_107, type, sK44: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_108, type, sK45: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_109, type, sK46: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_110, type, sK47: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_111, type, sK48: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 2.90/0.68 thf(func_def_112, type, sK49: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 2.90/0.68 thf(func_def_113, type, sK50: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 2.90/0.68 thf(func_def_114, type, sK51: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 2.90/0.68 thf(func_def_115, type, sK52: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 2.90/0.68 thf(func_def_116, type, sK53: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 2.90/0.68 thf(func_def_117, type, sK54: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 2.90/0.68 thf(func_def_118, type, sK55: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 2.90/0.68 thf(func_def_119, type, sK56: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 2.90/0.68 thf(func_def_120, type, sK57: a).
% 2.90/0.68 thf(func_def_121, type, sK58: !>[X0: $tType]:(((X0 > $o) > set @ X0 > X0))).
% 2.90/0.68 thf(func_def_122, type, sK59: !>[X0: $tType]:(((X0 > $o) > set @ X0 > X0))).
% 2.90/0.68 thf(func_def_123, type, sK60: !>[X0: $tType]:((set @ X0 > set @ X0 > (X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_124, type, sK61: !>[X0: $tType]:((set @ X0 > (X0 > $o) > set @ X0 > X0))).
% 2.90/0.68 thf(func_def_125, type, sK62: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_126, type, sK63: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_127, type, sK64: !>[X0: $tType]:((X0 > set @ X0 > X0 > set @ X0 > set @ X0))).
% 2.90/0.68 thf(func_def_128, type, sK65: !>[X0: $tType]:((set @ X0 > X0))).
% 2.90/0.68 thf(func_def_129, type, sK66: !>[X0: $tType]:((set @ X0 > X0))).
% 2.90/0.68 thf(func_def_130, type, sK67: !>[X0: $tType]:(((X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_131, type, sK68: !>[X0: $tType]:(((X0 > $o) > X0))).
% 2.90/0.68 thf(func_def_132, type, sK69: !>[X0: $tType]:(((X0 > int) > X0 > binary1291135688e_Tree @ X0 > X0))).
% 2.90/0.68 thf(func_def_133, type, sK70: !>[X0: $tType]:(((X0 > int) > binary1291135688e_Tree @ X0 > X0 > X0))).
% 2.90/0.68 thf(f1,axiom,(
% 2.90/0.68 ! [X1 : a] : ((member @ a @ X1 @ (binary64540844le_eqs @ a @ h @ e)) => (ord_less @ int @ (h @ X1) @ (h @ x)))),
% 2.90/0.68 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_eqsLessX)).
% 2.90/0.68 thf(f10,axiom,(
% 2.90/0.68 ! [X0 : $tType] : (binary64540844le_eqs @ X0 = (^[X1 : (X0 > int), X2 : X0] : ((collect @ X0 @ (^[X3 : X0] : ((((X1 @ X3)) = ((X1 @ X2)))))))))),
% 2.90/0.68 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_9_eqs__def)).
% 2.90/0.68 thf(f175,axiom,(
% 2.90/0.68 ! [X0 : $tType] : (order @ X0 => ! [X1 : X0,X2 : X0] : ((ord_less @ X0 @ X1 @ X2) => ~(ord_less @ X0 @ X2 @ X1)))),
% 2.90/0.68 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_174_dual__order_Oasym)).
% 2.90/0.68 thf(f278,axiom,(
% 2.90/0.68 order @ int),
% 2.90/0.68 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tcon_Int_Oint___Orderings_Oorder_6)).
% 2.90/0.68 thf(f303,conjecture,(
% 2.90/0.68 ! [X0 : a] : ((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e)) => (((h @ X0)) != ((h @ x))))),
% 2.90/0.68 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0)).
% 2.90/0.68 thf(f304,negated_conjecture,(
% 2.90/0.68 ~ ! [X0 : a] : ((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e)) => (((h @ X0)) != ((h @ x))))),
% 2.90/0.68 inference(negated_conjecture,[status(cth)],[f303])).
% 2.90/0.68 thf(f305,plain,(
% 2.90/0.68 ! [X0 : a] : ((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e)) => (ord_less @ int @ (h @ X0) @ (h @ x)))),
% 2.90/0.68 inference(rectify,[],[f1])).
% 2.90/0.68 thf(f306,plain,(
% 2.90/0.68 ! [X0 : a] : ((((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e))) = $true) => (((ord_less @ int @ (h @ X0) @ (h @ x))) = $true))),
% 2.90/0.68 inference(fool_elimination,[],[f305])).
% 2.90/0.68 thf(f317,plain,(
% 2.90/0.68 ! [X0 : $tType] : (binary64540844le_eqs @ X0 = (^[X1 : (X0 > int), X2 : X0] : ((collect @ X0 @ (^[X3 : X0] : ((((X1 @ X3)) = ((X1 @ X2)))))))))),
% 2.90/0.68 inference(rectify,[],[f10])).
% 2.90/0.68 thf(f318,plain,(
% 2.90/0.68 ! [X0 : $tType] : (binary64540844le_eqs @ X0 = (^[Y0 : X0 > int]: ((^[Y1 : X0]: (collect @ X0 @ (^[Y2 : X0]: ((Y0 @ Y2) = (Y0 @ Y1))))))))),
% 2.90/0.68 inference(fool_elimination,[],[f317])).
% 2.90/0.68 thf(f574,plain,(
% 2.90/0.68 ! [X0 : $tType] : (order @ X0 => ! [X1 : X0,X2 : X0] : ((ord_less @ X0 @ X1 @ X2) => ~(ord_less @ X0 @ X2 @ X1)))),
% 2.90/0.68 inference(rectify,[],[f175])).
% 2.90/0.68 thf(f575,plain,(
% 2.90/0.68 ! [X0 : $tType] : ((order @ X0 = $true) => ! [X1 : X0,X2 : X0] : ((((ord_less @ X0 @ X1 @ X2)) = $true) => ~ (((ord_less @ X0 @ X2 @ X1)) = $true)))),
% 2.90/0.68 inference(fool_elimination,[],[f574])).
% 2.90/0.68 thf(f769,plain,(
% 2.90/0.68 order @ int),
% 2.90/0.68 inference(rectify,[],[f278])).
% 2.90/0.68 thf(f770,plain,(
% 2.90/0.68 (order @ int = $true)),
% 2.90/0.68 inference(fool_elimination,[],[f769])).
% 2.90/0.68 thf(f818,plain,(
% 2.90/0.68 ~ ! [X0 : a] : ((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e)) => (((h @ X0)) != ((h @ x))))),
% 2.90/0.68 inference(rectify,[],[f304])).
% 2.90/0.68 thf(f819,plain,(
% 2.90/0.68 ~ ! [X0 : a] : ((((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e))) = $true) => (((h @ x)) != ((h @ X0))))),
% 2.90/0.68 inference(fool_elimination,[],[f818])).
% 2.90/0.68 thf(f847,plain,(
% 2.90/0.68 ! [X0 : $tType] : ((order @ X0 = $true) => ! [X1 : X0,X2 : X0] : ((((ord_less @ X0 @ X1 @ X2)) = $true) => (((ord_less @ X0 @ X2 @ X1)) != $true)))),
% 2.90/0.68 inference(flattening,[],[f575])).
% 2.90/0.68 thf(f858,plain,(
% 2.90/0.68 ! [X0 : a] : ((((ord_less @ int @ (h @ X0) @ (h @ x))) = $true) | (((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e))) != $true))),
% 2.90/0.68 inference(ennf_transformation,[],[f306])).
% 2.90/0.68 thf(f970,plain,(
% 2.90/0.68 ! [X0 : $tType] : (! [X1 : X0,X2 : X0] : ((((ord_less @ X0 @ X2 @ X1)) != $true) | (((ord_less @ X0 @ X1 @ X2)) != $true)) | (order @ X0 != $true))),
% 2.90/0.68 inference(ennf_transformation,[],[f847])).
% 2.90/0.68 thf(f1061,plain,(
% 2.90/0.68 ? [X0 : a] : ((((h @ x)) = ((h @ X0))) & (((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e))) = $true))),
% 2.90/0.68 inference(ennf_transformation,[],[f819])).
% 2.90/0.68 thf(f1097,plain,(
% 2.90/0.68 (((h @ x)) = ((h @ sK57))) & ($true = ((member @ a @ sK57 @ (binary64540844le_eqs @ a @ h @ e))))),
% 2.90/0.68 inference(skolemize,[status(esa),new_symbols(skolem,[sK57]),skolemize(X0,sK57)],[f1061])).
% 2.90/0.68 thf(f1098,plain,(
% 2.90/0.68 ( ! [X0 : a] : ((((ord_less @ int @ (h @ X0) @ (h @ x))) = $true) | (((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e))) != $true)) )),
% 2.90/0.68 inference(cnf_transformation,[],[f858])).
% 2.90/0.68 thf(f1107,plain,(
% 2.90/0.68 ( ! [X0 : $tType] : ((binary64540844le_eqs @ X0 = (^[Y0 : X0 > int]: ((^[Y1 : X0]: (collect @ X0 @ (^[Y2 : X0]: ((Y0 @ Y2) = (Y0 @ Y1))))))))) )),
% 2.90/0.68 inference(cnf_transformation,[],[f318])).
% 2.90/0.68 thf(f1292,plain,(
% 2.90/0.68 ( ! [X0 : $tType,X2 : X0,X1 : X0] : ((((ord_less @ X0 @ X2 @ X1)) != $true) | (((ord_less @ X0 @ X1 @ X2)) != $true) | (order @ X0 != $true)) )),
% 2.90/0.68 inference(cnf_transformation,[],[f970])).
% 2.90/0.68 thf(f1418,plain,(
% 2.90/0.68 (order @ int = $true)),
% 2.90/0.68 inference(cnf_transformation,[],[f770])).
% 2.90/0.68 thf(f1443,plain,(
% 2.90/0.68 ($true = ((member @ a @ sK57 @ (binary64540844le_eqs @ a @ h @ e))))),
% 2.90/0.68 inference(cnf_transformation,[],[f1097])).
% 2.90/0.68 thf(f1444,plain,(
% 2.90/0.68 (((h @ x)) = ((h @ sK57)))),
% 2.90/0.68 inference(cnf_transformation,[],[f1097])).
% 2.90/0.69 thf(f1451,plain,(
% 2.90/0.69 ( ! [X0 : a] : ((((ord_less @ int @ (h @ X0) @ (h @ x))) = $true) | ($true != ((member @ a @ X0 @ ((^[Y0 : a > int]: ((^[Y1 : a]: (collect @ a @ (^[Y2 : a]: ((Y0 @ Y2) = (Y0 @ Y1))))))) @ h @ e))))) )),
% 2.90/0.69 inference(definition_unfolding,[],[f1098,f1107])).
% 2.90/0.69 thf(f1513,plain,(
% 2.90/0.69 ($true = ((member @ a @ sK57 @ ((^[Y0 : a > int]: ((^[Y1 : a]: (collect @ a @ (^[Y2 : a]: ((Y0 @ Y2) = (Y0 @ Y1))))))) @ h @ e))))),
% 2.90/0.69 inference(definition_unfolding,[],[f1443,f1107])).
% 2.90/0.69 thf(f1529,plain,(
% 2.90/0.69 ($true = ((member @ a @ sK57 @ (collect @ a @ (^[Y0 : a]: ((h @ Y0) = (h @ e)))))))),
% 2.90/0.69 inference(beta-eta_normalization,[],[f1513])).
% 2.90/0.69 thf(f2231,plain,(
% 2.90/0.69 ( ! [X0 : a] : (($true != ((member @ a @ X0 @ (collect @ a @ (^[Y0 : a]: ((h @ Y0) = (h @ e))))))) | (((ord_less @ int @ (h @ X0) @ (h @ x))) = $true)) )),
% 2.90/0.69 inference(beta-eta_normalization,[],[f1451])).
% 2.90/0.69 thf(f10092,plain,(
% 2.90/0.69 ($true != $true) | ($true = ((ord_less @ int @ (h @ sK57) @ (h @ x))))),
% 2.90/0.69 inference(constrained_superposition,[],[f2231,f1529])).
% 2.90/0.69 thf(f10097,plain,(
% 2.90/0.69 ($true = ((ord_less @ int @ (h @ sK57) @ (h @ x))))),
% 2.90/0.69 inference(trivial_inequality_removal,[],[f10092])).
% 2.90/0.69 thf(f10108,plain,(
% 2.90/0.69 ($true = ((ord_less @ int @ (h @ x) @ (h @ x))))),
% 2.90/0.69 inference(forward_demodulation,[],[f10097,f1444])).
% 2.90/0.69 thf(f10115,plain,(
% 2.90/0.69 ($true != $true) | ($true != $true) | (order @ int != $true)),
% 2.90/0.69 inference(constrained_superposition,[],[f1292,f10108])).
% 2.90/0.69 thf(f10173,plain,(
% 2.90/0.69 ($true != $true) | (order @ int != $true)),
% 2.90/0.69 inference(duplicate_literal_removal,[],[f10115])).
% 2.90/0.69 thf(f10174,plain,(
% 2.90/0.69 (order @ int != $true)),
% 2.90/0.69 inference(trivial_inequality_removal,[],[f10173])).
% 2.90/0.69 thf(f10184,plain,(
% 2.90/0.69 $false),
% 2.90/0.69 inference(forward_subsumption_resolution,[],[f10174,f1418])).
% 2.90/0.69 % SZS output end Proof for theBenchmark
% 2.90/0.69 % (1738509)------------------------------
% 2.90/0.69 % (1738509)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.69 % (1738509)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.69 % (1738509)CaDiCaL version: 2.1.3
% 2.90/0.69 % (1738509)Termination reason: Refutation
% 2.90/0.69 % (1738509)Time elapsed: 0.411 s
% 2.90/0.69 % (1738509)Peak memory usage: 17 MB
% 2.90/0.69 % (1738509)Instructions burned: 826 (million)
% 2.90/0.69 % (1738503)Success in time 0.457 s
% 2.90/0.69 % Vampire exiting
%------------------------------------------------------------------------------