%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ITP029^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 : n020.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:25 AM UTC 2026
% Result : ContradictoryAxioms 0.21s 0.35s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP029^2 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n020.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 19:39:35 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/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
% 0.21/0.35 % (1491117)Will run a generic schedule for satisfiability detection.
% 0.21/0.35 % (1491125)dis+10_1_sil=32000:sp=arity:random_seed=4261405861:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.35 % (1491123)% WARNING: option uhcvi not known.
% 0.21/0.35 % (1491122)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2103162812_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.35 % (1491123)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3134979928:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.35 % (1491124)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=81206439:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.35 % (1491126)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4226205599:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.35 % (1491127)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3980109208:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.35 % (1491128)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2117370254:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.35 % (1491123)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.35 % (1491126)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.35 % (1491125)Instruction limit reached!
% 0.21/0.35 % (1491125)------------------------------
% 0.21/0.35 % (1491125)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.35 % (1491125)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.35 % (1491125)CaDiCaL version: 2.1.3
% 0.21/0.35 % (1491125)Termination reason: Instruction limit
% 0.21/0.35 % (1491125)Termination phase: Saturation
% 0.21/0.35 % (1491125)Time elapsed: 0.025 s
% 0.21/0.35 % (1491125)Peak memory usage: 12 MB
% 0.21/0.35 % (1491125)Instructions burned: 104 (million)
% 0.21/0.35 % (1491136)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2145502346:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.21/0.35 % Exception at run slice level
% 0.21/0.35 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.35 % (1491123)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.21/0.35 % Exception at run slice level
% 0.21/0.35 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.35 % (1491126)Instruction limit reached!
% 0.21/0.35 % (1491126)------------------------------
% 0.21/0.35 % (1491126)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.35 % (1491126)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.35 % (1491126)CaDiCaL version: 2.1.3
% 0.21/0.35 % (1491126)Termination reason: Instruction limit
% 0.21/0.35 % (1491126)Termination phase: Saturation
% 0.21/0.35 % (1491126)Time elapsed: 0.050 s
% 0.21/0.35 % (1491126)Peak memory usage: 12 MB
% 0.21/0.35 % (1491126)Instructions burned: 117 (million)
% 0.21/0.35 % (1491138)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4071702056:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.35 % (1491139)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=4192331318:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.21/0.35 % (1491127)Instruction limit reached!
% 0.21/0.35 % (1491127)------------------------------
% 0.21/0.35 % (1491127)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.35 % (1491127)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.35 % (1491127)CaDiCaL version: 2.1.3
% 0.21/0.35 % (1491127)Termination reason: Instruction limit
% 0.21/0.35 % (1491127)Termination phase: Saturation
% 0.21/0.35 % (1491127)Time elapsed: 0.058 s
% 0.21/0.35 % (1491127)Peak memory usage: 13 MB
% 0.21/0.35 % (1491127)Instructions burned: 133 (million)
% 0.21/0.35 % (1491139)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.35 % (1491140)ott-21_1_sil=16000:fs=off:random_seed=3528684191:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.21/0.35 % (1491123) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1491117-1491123"...
% 0.21/0.35 % (1491123)...printing done.
% 0.21/0.35 % (1491123)Refutation found. Thanks to Tanya!
% 0.21/0.35 % SZS status ContradictoryAxioms for theBenchmark
% 0.21/0.35 % SZS output start Proof for theBenchmark
% 0.21/0.35 thf(type_def_5, type, binary1291135688e_Tree: $tType > $tType).
% 0.21/0.35 thf(type_def_6, type, set: $tType > $tType).
% 0.21/0.35 thf(type_def_7, type, int: $tType).
% 0.21/0.35 thf(type_def_8, type, a: $tType).
% 0.21/0.35 thf(type_def_9, type, sTfun: ($tType * $tType) > $tType).
% 0.21/0.35 thf(func_def_0, type, bounded_lattice: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_1, type, type: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_2, type, bot: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_3, type, ord: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_4, type, order: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_5, type, no_bot: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_6, type, no_top: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_7, type, linorder: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_8, type, preorder: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_9, type, order_bot: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_10, type, wellorder: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_11, type, dense_order: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_12, type, linordered_idom: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_13, type, linordered_field: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_14, type, semilattice_sup: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_15, type, bounde1808546759up_bot: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_16, type, condit1656338222tinuum: !>[X0: $tType]:($o)).
% 0.21/0.35 thf(func_def_17, type, binary210054475elle_T: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.21/0.35 thf(func_def_18, type, binary1746293266le_Tip: !>[X0: $tType]:(binary1291135688e_Tree @ X0)).
% 0.21/0.35 thf(func_def_19, type, binary536355927e_Tree: !>[X0: $tType, X1: $tType]:((X0 > (binary1291135688e_Tree @ X1 > X1 > binary1291135688e_Tree @ X1 > X0) > binary1291135688e_Tree @ X1 > X0))).
% 0.21/0.35 thf(func_def_20, type, binary1929596613c_Tree: !>[X0: $tType, X1: $tType]:((X0 > (binary1291135688e_Tree @ X1 > X1 > binary1291135688e_Tree @ X1 > X0 > X0 > X0) > binary1291135688e_Tree @ X1 > X0))).
% 0.21/0.35 thf(func_def_21, type, binary2130109271t_Tree: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > set @ X0))).
% 0.21/0.35 thf(func_def_22, type, binary64540844le_eqs: !>[X0: $tType]:(((X0 > int) > X0 > set @ X0))).
% 0.21/0.35 thf(func_def_23, type, binary1653327646_setOf: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > set @ X0))).
% 0.21/0.35 thf(func_def_24, type, binary1610619414edTree: !>[X0: $tType]:(((X0 > int) > binary1291135688e_Tree @ X0 > $o))).
% 0.21/0.35 thf(func_def_25, type, binary231205461t_pred: !>[X0: $tType]:(((X0 > int) > X0 > X0 > binary1291135688e_Tree @ X0 > $o))).
% 0.21/0.35 thf(func_def_26, type, the: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_27, type, if: !>[X0: $tType]:(($o > X0 > X0 > X0))).
% 0.21/0.35 thf(func_def_28, type, semilattice_neutr: !>[X0: $tType]:(((X0 > X0 > X0) > X0 > $o))).
% 0.21/0.35 thf(func_def_29, type, sup_sup: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.21/0.35 thf(func_def_30, type, bot_bot: !>[X0: $tType]:(X0)).
% 0.21/0.35 thf(func_def_31, type, ord_less: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.21/0.35 thf(func_def_32, type, ord_less_eq: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.21/0.35 thf(func_def_33, type, powp: !>[X0: $tType]:(((X0 > $o) > set @ X0 > $o))).
% 0.21/0.35 thf(func_def_34, type, inv_imagep: !>[X0: $tType, X1: $tType]:(((X0 > X0 > $o) > (X1 > X0) > X1 > X1 > $o))).
% 0.21/0.35 thf(func_def_35, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 0.21/0.35 thf(func_def_36, type, pow: !>[X0: $tType]:((set @ X0 > set @ set @ X0))).
% 0.21/0.35 thf(func_def_37, type, insert: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 0.21/0.35 thf(func_def_38, type, is_empty: !>[X0: $tType]:((set @ X0 > $o))).
% 0.21/0.35 thf(func_def_39, type, is_singleton: !>[X0: $tType]:((set @ X0 > $o))).
% 0.21/0.35 thf(func_def_40, type, the_elem: !>[X0: $tType]:((set @ X0 > X0))).
% 0.21/0.35 thf(func_def_41, type, chains: !>[X0: $tType]:((set @ set @ X0 > set @ set @ set @ X0))).
% 0.21/0.35 thf(func_def_42, type, pred_chain: !>[X0: $tType]:((set @ X0 > (X0 > X0 > $o) > set @ X0 > $o))).
% 0.21/0.35 thf(func_def_43, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 0.21/0.35 thf(func_def_44, type, a2: a).
% 0.21/0.35 thf(func_def_45, type, b: a).
% 0.21/0.35 thf(func_def_46, type, h: (a > int)).
% 0.21/0.35 thf(func_def_47, type, t1: binary1291135688e_Tree @ a).
% 0.21/0.35 thf(func_def_48, type, t2: binary1291135688e_Tree @ a).
% 0.21/0.35 thf(func_def_49, type, x: a).
% 0.21/0.35 thf(func_def_53, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.21/0.35 thf(func_def_54, type, vAND: ($o > $o > $o)).
% 0.21/0.35 thf(func_def_55, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.21/0.35 thf(func_def_56, type, vIMP: ($o > $o > $o)).
% 0.21/0.35 thf(func_def_57, type, db0: !>[X0: $tType]:(X0)).
% 0.21/0.35 thf(func_def_58, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.21/0.35 thf(func_def_59, type, db3: !>[X0: $tType]:(X0)).
% 0.21/0.35 thf(func_def_60, type, db2: !>[X0: $tType]:(X0)).
% 0.21/0.35 thf(func_def_61, type, db1: !>[X0: $tType]:(X0)).
% 0.21/0.35 thf(func_def_62, type, vOR: ($o > $o > $o)).
% 0.21/0.35 thf(func_def_63, type, vNOT: ($o > $o)).
% 0.21/0.35 thf(func_def_64, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.21/0.35 thf(func_def_65, type, sP0: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 0.21/0.35 thf(func_def_66, type, sP1: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 0.21/0.35 thf(func_def_67, type, sP2: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 0.21/0.35 thf(func_def_68, type, sK3: !>[X0: $tType]:(((binary1291135688e_Tree @ X0 > $o) > binary1291135688e_Tree @ X0))).
% 0.21/0.35 thf(func_def_69, type, sK4: !>[X0: $tType]:(((binary1291135688e_Tree @ X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_70, type, sK5: !>[X0: $tType]:(((binary1291135688e_Tree @ X0 > $o) > binary1291135688e_Tree @ X0))).
% 0.21/0.35 thf(func_def_71, type, sK6: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.21/0.35 thf(func_def_72, type, sK7: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0))).
% 0.21/0.35 thf(func_def_73, type, sK8: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.21/0.35 thf(func_def_74, type, sK9: !>[X0: $tType, X1: $tType]:((X1 > X0))).
% 0.21/0.35 thf(func_def_75, type, sK10: !>[X0: $tType]:((X0 > X0))).
% 0.21/0.35 thf(func_def_76, type, sK11: !>[X0: $tType]:((X0 > X0))).
% 0.21/0.35 thf(func_def_77, type, sK12: !>[X0: $tType]:((X0 > X0))).
% 0.21/0.35 thf(func_def_78, type, sK13: !>[X0: $tType]:((X0 > X0))).
% 0.21/0.35 thf(func_def_79, type, sK14: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > (X0 > $o) > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_80, type, sK15: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_81, type, sK16: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_82, type, sK17: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > (X0 > $o) > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_83, type, sK18: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_84, type, sK19: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_85, type, sK20: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > (X0 > $o) > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_86, type, sK21: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_87, type, sK22: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_88, type, sK23: !>[X0: $tType]:((X0 > X0))).
% 0.21/0.35 thf(func_def_89, type, sK24: !>[X0: $tType]:((X0 > X0))).
% 0.21/0.35 thf(func_def_90, type, sK25: !>[X0: $tType]:((X0 > X0))).
% 0.21/0.35 thf(func_def_91, type, sK26: !>[X0: $tType]:((X0 > X0))).
% 0.21/0.35 thf(func_def_92, type, sK27: !>[X0: $tType, X1: $tType]:((X1 > X0))).
% 0.21/0.35 thf(func_def_93, type, sK28: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > (X0 > $o) > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_94, type, sK29: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_95, type, sK30: !>[X0: $tType]:((X0 > (X0 > $o) > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_96, type, sK31: !>[X0: $tType]:((X0 > X0))).
% 0.21/0.35 thf(func_def_97, type, sK32: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_98, type, sK33: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 0.21/0.35 thf(func_def_99, type, sK34: !>[X0: $tType]:((X0 > X0))).
% 0.21/0.35 thf(func_def_100, type, sK35: !>[X0: $tType]:((X0 > X0))).
% 0.21/0.35 thf(func_def_101, type, sK36: !>[X0: $tType, X1: $tType]:((((X1 > X0) > X1 > X0 > $o) > X1 > X0))).
% 0.21/0.35 thf(func_def_102, type, sK37: !>[X0: $tType, X1: $tType]:((((X1 > X0) > X1 > X0 > $o) > X1))).
% 0.21/0.35 thf(func_def_103, type, sK38: !>[X0: $tType, X1: $tType]:((((X1 > X0) > X1 > X0 > $o) > X1 > X0))).
% 0.21/0.35 thf(func_def_104, type, sK39: !>[X0: $tType, X1: $tType]:((((X1 > X0) > X1 > X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_105, type, sK40: !>[X0: $tType, X1: $tType]:((((X1 > X0) > X1 > X0 > $o) > X1 > X0))).
% 0.21/0.35 thf(func_def_106, type, sK41: !>[X0: $tType, X1: $tType]:((((X1 > X0) > X1 > X0 > $o) > X1 > X0))).
% 0.21/0.35 thf(func_def_107, type, sK42: !>[X0: $tType, X1: $tType]:((((X1 > X0) > X1 > X0 > $o) > X1))).
% 0.21/0.35 thf(func_def_108, type, sK43: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.21/0.35 thf(func_def_109, type, sK44: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.21/0.35 thf(func_def_110, type, sK45: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.21/0.35 thf(func_def_111, type, sK46: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.21/0.35 thf(func_def_112, type, sK47: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.21/0.35 thf(func_def_113, type, sK48: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.21/0.35 thf(func_def_114, type, sK49: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.21/0.35 thf(func_def_115, type, sK50: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.21/0.35 thf(func_def_116, type, sK51: !>[X0: $tType]:((X0 > X0))).
% 0.21/0.35 thf(func_def_117, type, sK52: !>[X0: $tType]:((X0 > X0))).
% 0.21/0.35 thf(func_def_118, type, sK53: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.21/0.35 thf(func_def_119, type, sK54: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_120, type, sK55: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_121, type, sK56: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_122, type, sK57: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_123, type, sK58: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_124, type, sK59: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_125, type, sK60: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > X0) > X1))).
% 0.21/0.35 thf(func_def_126, type, sK61: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > X0) > X1))).
% 0.21/0.35 thf(func_def_127, type, sK62: !>[X0: $tType]:((set @ X0 > X0))).
% 0.21/0.35 thf(func_def_128, type, sK63: !>[X0: $tType]:((set @ X0 > X0))).
% 0.21/0.35 thf(func_def_129, type, sK64: !>[X0: $tType]:((set @ X0 > X0))).
% 0.21/0.35 thf(func_def_130, type, sK65: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 0.21/0.35 thf(func_def_131, type, sK66: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > X0))).
% 0.21/0.35 thf(func_def_132, type, sK67: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 0.21/0.35 thf(func_def_133, type, sK68: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 0.21/0.35 thf(func_def_134, type, sK69: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 0.21/0.35 thf(func_def_135, type, sK70: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 0.21/0.35 thf(func_def_136, type, sK71: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > X0))).
% 0.21/0.35 thf(func_def_137, type, sK72: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 0.21/0.35 thf(func_def_138, type, sK73: !>[X0: $tType]:((set @ X0 > X0))).
% 0.21/0.35 thf(func_def_139, type, sK74: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 0.21/0.35 thf(func_def_140, type, sK75: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 0.21/0.35 thf(func_def_141, type, sK76: !>[X0: $tType]:((X0 > set @ X0 > (X0 > X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_142, type, sK77: !>[X0: $tType]:((set @ X0 > set @ set @ X0 > set @ X0))).
% 0.21/0.35 thf(func_def_143, type, sK78: !>[X0: $tType]:(((X0 > X0 > $o) > (X0 > X0 > $o) > set @ X0 > X0))).
% 0.21/0.35 thf(func_def_144, type, sK79: !>[X0: $tType]:(((X0 > X0 > $o) > (X0 > X0 > $o) > set @ X0 > X0))).
% 0.21/0.35 thf(func_def_145, type, sK80: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_146, type, sK81: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_147, type, sK82: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_148, type, sK83: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_149, type, sK84: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_150, type, sK85: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_151, type, sK86: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_152, type, sK87: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_153, type, sK88: !>[X0: $tType]:((set @ X0 > set @ set @ X0 > set @ X0))).
% 0.21/0.35 thf(func_def_154, type, sK89: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 0.21/0.35 thf(func_def_155, type, sK90: !>[X0: $tType]:((set @ set @ X0 > set @ X0))).
% 0.21/0.35 thf(func_def_156, type, sK91: !>[X0: $tType]:((set @ set @ X0 > set @ set @ X0))).
% 0.21/0.35 thf(func_def_157, type, sK92: !>[X0: $tType]:((set @ X0 > set @ set @ X0 > set @ X0))).
% 0.21/0.35 thf(func_def_158, type, sK93: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_159, type, sK94: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_160, type, sK95: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_161, type, sK96: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_162, type, sK97: !>[X0: $tType]:((set @ X0 > set @ X0 > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_163, type, sK98: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_164, type, sK99: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_165, type, sK100: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_166, type, sK101: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_167, type, sK102: !>[X0: $tType]:((set @ X0 > (X0 > $o) > set @ X0 > X0))).
% 0.21/0.35 thf(func_def_168, type, sK103: !>[X0: $tType]:((X0 > set @ X0 > X0 > set @ X0 > set @ X0))).
% 0.21/0.35 thf(func_def_169, type, sK104: !>[X0: $tType]:((X0 > X0))).
% 0.21/0.35 thf(func_def_170, type, sK105: !>[X0: $tType]:((set @ X0 > X0))).
% 0.21/0.35 thf(func_def_171, type, sK106: !>[X0: $tType]:((set @ X0 > X0))).
% 0.21/0.35 thf(func_def_172, type, sK107: !>[X0: $tType]:((set @ X0 > X0))).
% 0.21/0.35 thf(func_def_173, type, sK108: !>[X0: $tType]:((set @ X0 > X0))).
% 0.21/0.35 thf(func_def_174, type, sK109: !>[X0: $tType]:((set @ X0 > X0))).
% 0.21/0.35 thf(func_def_175, type, sK110: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_176, type, sK111: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.21/0.35 thf(func_def_177, type, sK112: !>[X0: $tType]:(((X0 > int) > X0 > binary1291135688e_Tree @ X0 > X0))).
% 0.21/0.35 thf(func_def_178, type, sK113: !>[X0: $tType]:(((X0 > int) > binary1291135688e_Tree @ X0 > X0 > X0))).
% 0.21/0.35 thf(f1,axiom,(
% 0.21/0.35 (((h @ a2)) = ((h @ b)))),
% 0.21/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_hahb)).
% 0.21/0.35 thf(f2,axiom,(
% 0.21/0.35 (ord_less @ int @ (h @ b) @ (h @ a2))),
% 0.21/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__092_060open_062h_Ab_A_060_Ah_Aa_092_060close_062)).
% 0.21/0.35 thf(f82,axiom,(
% 0.21/0.35 ! [X0 : $tType] : (order @ X0 => ! [X1 : X0] : ~(ord_less @ X0 @ X1 @ X1))),
% 0.21/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_81_dual__order_Oirrefl)).
% 0.21/0.35 thf(f273,axiom,(
% 0.21/0.35 order @ int),
% 0.21/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tcon_Int_Oint___Orderings_Oorder_5)).
% 0.21/0.35 thf(f295,plain,(
% 0.21/0.35 (ord_less @ int @ (h @ b) @ (h @ a2))),
% 0.21/0.35 inference(rectify,[],[f2])).
% 0.21/0.35 thf(f296,plain,(
% 0.21/0.35 (((ord_less @ int @ (h @ b) @ (h @ a2))) = $true)),
% 0.21/0.35 inference(fool_elimination,[],[f295])).
% 0.21/0.35 thf(f442,plain,(
% 0.21/0.35 ! [X0 : $tType] : (order @ X0 => ! [X1 : X0] : ~(ord_less @ X0 @ X1 @ X1))),
% 0.21/0.35 inference(rectify,[],[f82])).
% 0.21/0.35 thf(f443,plain,(
% 0.21/0.35 ! [X0 : $tType] : ((order @ X0 = $true) => ! [X1 : X0] : ~ (((ord_less @ X0 @ X1 @ X1)) = $true))),
% 0.21/0.35 inference(fool_elimination,[],[f442])).
% 0.21/0.35 thf(f756,plain,(
% 0.21/0.35 order @ int),
% 0.21/0.35 inference(rectify,[],[f273])).
% 0.21/0.35 thf(f757,plain,(
% 0.21/0.35 (order @ int = $true)),
% 0.21/0.35 inference(fool_elimination,[],[f756])).
% 0.21/0.35 thf(f807,plain,(
% 0.21/0.35 ! [X0 : $tType] : ((order @ X0 = $true) => ! [X1 : X0] : (((ord_less @ X0 @ X1 @ X1)) != $true))),
% 0.21/0.35 inference(flattening,[],[f443])).
% 0.21/0.35 thf(f905,plain,(
% 0.21/0.35 ! [X0 : $tType] : (! [X1 : X0] : (((ord_less @ X0 @ X1 @ X1)) != $true) | (order @ X0 != $true))),
% 0.21/0.35 inference(ennf_transformation,[],[f807])).
% 0.21/0.35 thf(f1113,plain,(
% 0.21/0.35 (((h @ a2)) = ((h @ b)))),
% 0.21/0.35 inference(cnf_transformation,[],[f1])).
% 0.21/0.35 thf(f1114,plain,(
% 0.21/0.35 (((ord_less @ int @ (h @ b) @ (h @ a2))) = $true)),
% 0.21/0.35 inference(cnf_transformation,[],[f296])).
% 0.21/0.35 thf(f1217,plain,(
% 0.21/0.35 ( ! [X0 : $tType,X1 : X0] : ((((ord_less @ X0 @ X1 @ X1)) != $true) | (order @ X0 != $true)) )),
% 0.21/0.35 inference(cnf_transformation,[],[f905])).
% 0.21/0.35 thf(f1463,plain,(
% 0.21/0.35 (order @ int = $true)),
% 0.21/0.35 inference(cnf_transformation,[],[f757])).
% 0.21/0.35 thf(f2624,definition,(
% 0.21/0.35 spl114_13 <=> (((h @ a2)) = ((h @ b)))),
% 0.21/0.35 introduced(definition,[new_symbols(definition,[spl114_13])],[avatar_definition])).
% 0.21/0.35 thf(f2625,plain,(
% 0.21/0.35 (((h @ a2)) = ((h @ b))) | ~spl114_13),
% 0.21/0.35 inference(avatar_component_clause,[],[f2624])).
% 0.21/0.35 thf(f2658,plain,(
% 0.21/0.35 spl114_13),
% 0.21/0.35 inference(avatar_split_clause,[],[f1113,f2624])).
% 0.21/0.35 thf(f2903,plain,(
% 0.21/0.35 ($true = ((ord_less @ int @ (h @ a2) @ (h @ a2)))) | ~spl114_13),
% 0.21/0.35 inference(forward_demodulation,[],[f1114,f2625])).
% 0.21/0.35 thf(f2905,plain,(
% 0.21/0.35 ($true != $true) | (order @ int != $true) | ~spl114_13),
% 0.21/0.35 inference(constrained_superposition,[],[f1217,f2903])).
% 0.21/0.35 thf(f2908,plain,(
% 0.21/0.35 (order @ int != $true) | ~spl114_13),
% 0.21/0.35 inference(trivial_inequality_removal,[],[f2905])).
% 0.21/0.35 thf(f2911,plain,(
% 0.21/0.35 $false | ~spl114_13),
% 0.21/0.35 inference(forward_subsumption_resolution,[],[f2908,f1463])).
% 0.21/0.35 thf(f2912,plain,(
% 0.21/0.35 ~spl114_13),
% 0.21/0.35 inference(avatar_contradiction_clause,[],[f2911])).
% 0.21/0.35 cnf(s14, plain, spl114_13, inference(sat_conversion,[],[f2658])).
% 0.21/0.35 cnf(s24, plain, ~spl114_13, inference(sat_conversion,[],[f2912])).
% 0.21/0.35 cnf(s25, plain, $false, inference(rat,[],[s14,s24])).
% 0.21/0.35 thf(f2913,plain,(
% 0.21/0.35 $false),
% 0.21/0.35 inference(avatar_sat_refutation,[],[s25])).
% 0.21/0.35 % SZS output end Proof for theBenchmark
% 0.21/0.35 % (1491123)------------------------------
% 0.21/0.35 % (1491123)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.35 % (1491123)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.35 % (1491123)CaDiCaL version: 2.1.3
% 0.21/0.35 % (1491123)Termination reason: Refutation
% 0.21/0.35 % (1491123)Time elapsed: 0.076 s
% 0.21/0.35 % (1491123)Peak memory usage: 14 MB
% 0.21/0.35 % (1491123)Instructions burned: 161 (million)
% 0.21/0.35 % (1491117)Success in time 0.126 s
% 0.21/0.35 % Vampire exiting
%------------------------------------------------------------------------------