%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP030^2 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:08:02 AM UTC 2026
% Result : ContradictoryAxioms 0.47s 0.40s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP030^2 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n003.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 19:40:14 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.22/0.28 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.40 % (2967006)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.47/0.40 % (2967024)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2408457362:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.47/0.40 % (2967030)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.47/0.40 % (2967030)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.47/0.40 % (2967025)lrs+10_16_si=on:nwc=1.5:random_seed=4063187789:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.47/0.40 % (2967027)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=1815130991:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.47/0.40 % (2967028)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1343743854:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.47/0.40 % (2967030)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=2435905060:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.47/0.40 % (2967029)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2240303497:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.47/0.40 % (2967026)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3023031331:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.47/0.40 % (2967026)Instruction limit reached!
% 0.47/0.40 % (2967026)------------------------------
% 0.47/0.40 % (2967026)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.47/0.40 % (2967026)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.47/0.40 % (2967026)CaDiCaL version: 2.1.3
% 0.47/0.40 % (2967026)Termination reason: Instruction limit
% 0.47/0.40 % (2967026)Termination phase: shuffling
% 0.47/0.40 % (2967026)Time elapsed: 0.003 s
% 0.47/0.40 % (2967026)Peak memory usage: 10 MB
% 0.47/0.40 % (2967026)Instructions burned: 4 (million)
% 0.47/0.40 % (2967025)Instruction limit reached!
% 0.47/0.40 % (2967025)------------------------------
% 0.47/0.40 % (2967025)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.47/0.40 % (2967025)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.47/0.40 % (2967025)CaDiCaL version: 2.1.3
% 0.47/0.40 % (2967025)Termination reason: Instruction limit
% 0.47/0.40 % (2967025)Termination phase: Property scanning
% 0.47/0.40 % (2967025)Time elapsed: 0.010 s
% 0.47/0.40 % (2967025)Peak memory usage: 10 MB
% 0.47/0.40 % (2967025)Instructions burned: 20 (million)
% 0.47/0.40 % (2967028)Instruction limit reached!
% 0.47/0.40 % (2967028)------------------------------
% 0.47/0.40 % (2967028)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.47/0.40 % (2967028)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.47/0.40 % (2967028)CaDiCaL version: 2.1.3
% 0.47/0.40 % (2967028)Termination reason: Instruction limit
% 0.47/0.40 % (2967028)Termination phase: Preprocessing 1
% 0.47/0.40 % (2967028)Time elapsed: 0.013 s
% 0.47/0.40 % (2967028)Peak memory usage: 10 MB
% 0.47/0.40 % (2967028)Instructions burned: 26 (million)
% 0.47/0.40 % (2967024)Instruction limit reached!
% 0.47/0.40 % (2967024)------------------------------
% 0.47/0.40 % (2967024)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.47/0.40 % (2967024)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.47/0.40 % (2967024)CaDiCaL version: 2.1.3
% 0.47/0.40 % (2967024)Termination reason: Instruction limit
% 0.47/0.40 % (2967024)Termination phase: Property scanning
% 0.47/0.40 % (2967024)Time elapsed: 0.023 s
% 0.47/0.40 % (2967024)Peak memory usage: 12 MB
% 0.47/0.40 % (2967024)Instructions burned: 88 (million)
% 0.47/0.40 % (2967053)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=4143674352:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.47/0.40 % (2967050)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=546739897:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.47/0.40 % (2967052)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.47/0.40 % (2967051)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=904101690:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.47/0.40 % (2967050)Instruction limit reached!
% 0.47/0.40 % (2967050)------------------------------
% 0.47/0.40 % (2967050)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.47/0.40 % (2967050)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.47/0.40 % (2967050)CaDiCaL version: 2.1.3
% 0.47/0.40 % (2967050)Termination reason: Instruction limit
% 0.47/0.40 % (2967050)Termination phase: shuffling
% 0.47/0.40 % (2967050)Time elapsed: 0.002 s
% 0.47/0.40 % (2967050)Peak memory usage: 10 MB
% 0.47/0.40 % (2967050)Instructions burned: 3 (million)
% 0.47/0.40 % (2967053)Instruction limit reached!
% 0.47/0.40 % (2967053)------------------------------
% 0.47/0.40 % (2967053)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.47/0.40 % (2967053)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.47/0.40 % (2967053)CaDiCaL version: 2.1.3
% 0.47/0.40 % (2967053)Termination reason: Instruction limit
% 0.47/0.40 % (2967053)Termination phase: shuffling
% 0.47/0.40 % (2967053)Time elapsed: 0.004 s
% 0.47/0.40 % (2967053)Peak memory usage: 10 MB
% 0.47/0.40 % (2967053)Instructions burned: 15 (million)
% 0.47/0.40 % (2967052)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=80321597:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.47/0.40 % (2967051)Instruction limit reached!
% 0.47/0.40 % (2967051)------------------------------
% 0.47/0.40 % (2967051)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.47/0.40 % (2967051)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.47/0.40 % (2967051)CaDiCaL version: 2.1.3
% 0.47/0.40 % (2967051)Termination reason: Instruction limit
% 0.47/0.40 % (2967051)Termination phase: shuffling
% 0.47/0.40 % (2967051)Time elapsed: 0.003 s
% 0.47/0.40 % (2967051)Peak memory usage: 10 MB
% 0.47/0.40 % (2967051)Instructions burned: 5 (million)
% 0.47/0.40 % (2967052)Instruction limit reached!
% 0.47/0.40 % (2967052)------------------------------
% 0.47/0.40 % (2967052)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.47/0.40 % (2967052)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.47/0.40 % (2967052)CaDiCaL version: 2.1.3
% 0.47/0.40 % (2967052)Termination reason: Instruction limit
% 0.47/0.40 % (2967052)Termination phase: shuffling
% 0.47/0.40 % (2967052)Time elapsed: 0.004 s
% 0.47/0.40 % (2967052)Peak memory usage: 10 MB
% 0.47/0.40 % (2967052)Instructions burned: 8 (million)
% 0.47/0.40 % (2967029)Instruction limit reached!
% 0.47/0.40 % (2967029)------------------------------
% 0.47/0.40 % (2967029)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.47/0.40 % (2967029)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.47/0.40 % (2967029)CaDiCaL version: 2.1.3
% 0.47/0.40 % (2967029)Termination reason: Instruction limit
% 0.47/0.40 % (2967029)Termination phase: shuffling
% 0.47/0.40 % (2967029)Time elapsed: 0.037 s
% 0.47/0.40 % (2967029)Peak memory usage: 12 MB
% 0.47/0.40 % (2967029)Instructions burned: 75 (million)
% 0.47/0.40 % (2967061)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.47/0.40 % (2967061)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.47/0.40 % (2967061)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=204838328:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 0.47/0.40 % (2967027) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2967006-2967027"...
% 0.47/0.40 % (2967063)lrs+1002_64_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:sp=occurrence:lma=off:plsqr=32,1:uwa=interpreted_only:random_seed=411456303:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.47/0.40 % (2967030) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2967006-2967030"...
% 0.47/0.40 % (2967027)...printing done.
% 0.47/0.40 % (2967065)lrs+10_1_si=on:cs=on:random_seed=1768321796:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.47/0.40 % (2967067)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 0.47/0.40 % (2967027)Refutation found. Thanks to Tanya!
% 0.47/0.40 % SZS status ContradictoryAxioms for theBenchmark
% 0.47/0.40 % SZS output start Proof for theBenchmark
% 0.47/0.40 thf(type_def_5, type, binary1291135688e_Tree: $tType > $tType).
% 0.47/0.40 thf(type_def_6, type, option: $tType > $tType).
% 0.47/0.40 thf(type_def_7, type, set: $tType > $tType).
% 0.47/0.40 thf(type_def_8, type, int: $tType).
% 0.47/0.40 thf(type_def_9, type, a: $tType).
% 0.47/0.40 thf(type_def_10, type, sTfun: ($tType * $tType) > $tType).
% 0.47/0.40 thf(func_def_0, type, bounded_lattice: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_1, type, type: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_2, type, bot: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_3, type, ord: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_4, type, top: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_5, type, order: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_6, type, no_bot: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_7, type, no_top: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_8, type, linorder: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_9, type, preorder: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_10, type, order_bot: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_11, type, wellorder: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_12, type, complete_Inf: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_13, type, dense_order: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_14, type, linordered_idom: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_15, type, linordered_field: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_16, type, semilattice_sup: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_17, type, comple187826305attice: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_18, type, comple1035589618norder: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_19, type, bounde1808546759up_bot: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_20, type, condit1656338222tinuum: !>[X0: $tType]:($o)).
% 0.47/0.40 thf(func_def_21, type, binary210054475elle_T: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.47/0.40 thf(func_def_22, type, binary1746293266le_Tip: !>[X0: $tType]:(binary1291135688e_Tree @ X0)).
% 0.47/0.40 thf(func_def_23, type, binary2130109271t_Tree: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > set @ X0))).
% 0.47/0.40 thf(func_def_24, type, binary64540844le_eqs: !>[X0: $tType]:(((X0 > int) > X0 > set @ X0))).
% 0.47/0.40 thf(func_def_25, type, binary827270440e_memb: !>[X0: $tType]:(((X0 > int) > X0 > binary1291135688e_Tree @ X0 > $o))).
% 0.47/0.40 thf(func_def_26, type, binary1653327646_setOf: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > set @ X0))).
% 0.47/0.40 thf(func_def_27, type, binary1610619414edTree: !>[X0: $tType]:(((X0 > int) > binary1291135688e_Tree @ X0 > $o))).
% 0.47/0.40 thf(func_def_28, type, binary231205461t_pred: !>[X0: $tType]:(((X0 > int) > X0 > X0 > binary1291135688e_Tree @ X0 > $o))).
% 0.47/0.40 thf(func_def_29, type, binary1265063667lookup: !>[X0: $tType]:(((X0 > int) > int > binary1291135688e_Tree @ X0 > option @ X0))).
% 0.47/0.40 thf(func_def_30, type, complete_Inf_Inf: !>[X0: $tType]:((set @ X0 > X0))).
% 0.47/0.40 thf(func_def_31, type, the: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_32, type, undefined: !>[X0: $tType]:(X0)).
% 0.47/0.40 thf(func_def_33, type, if: !>[X0: $tType]:(($o > X0 > X0 > X0))).
% 0.47/0.40 thf(func_def_34, type, sup_sup: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.47/0.40 thf(func_def_35, type, none: !>[X0: $tType]:(option @ X0)).
% 0.47/0.40 thf(func_def_36, type, some: !>[X0: $tType]:((X0 > option @ X0))).
% 0.47/0.40 thf(func_def_37, type, case_option: !>[X0: $tType, X1: $tType]:((X0 > (X1 > X0) > option @ X1 > X0))).
% 0.47/0.40 thf(func_def_38, type, set_option: !>[X0: $tType]:((option @ X0 > set @ X0))).
% 0.47/0.40 thf(func_def_39, type, the2: !>[X0: $tType]:((option @ X0 > X0))).
% 0.47/0.40 thf(func_def_40, type, these: !>[X0: $tType]:((set @ option @ X0 > set @ X0))).
% 0.47/0.40 thf(func_def_41, type, bot_bot: !>[X0: $tType]:(X0)).
% 0.47/0.40 thf(func_def_42, type, ord_less: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.47/0.40 thf(func_def_43, type, top_top: !>[X0: $tType]:(X0)).
% 0.47/0.40 thf(func_def_44, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 0.47/0.40 thf(func_def_45, type, bind: !>[X0: $tType, X1: $tType]:((set @ X0 > (X0 > set @ X1) > set @ X1))).
% 0.47/0.40 thf(func_def_46, type, image: !>[X0: $tType, X1: $tType]:(((X0 > X1) > set @ X0 > set @ X1))).
% 0.47/0.40 thf(func_def_47, type, insert: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 0.47/0.40 thf(func_def_48, type, is_empty: !>[X0: $tType]:((set @ X0 > $o))).
% 0.47/0.40 thf(func_def_49, type, is_singleton: !>[X0: $tType]:((set @ X0 > $o))).
% 0.47/0.40 thf(func_def_50, type, the_elem: !>[X0: $tType]:((set @ X0 > X0))).
% 0.47/0.40 thf(func_def_51, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 0.47/0.40 thf(func_def_52, type, h: (a > int)).
% 0.47/0.40 thf(func_def_53, type, t: binary1291135688e_Tree @ a).
% 0.47/0.40 thf(func_def_54, type, x: a).
% 0.47/0.40 thf(func_def_56, type, db0: !>[X0: $tType]:(X0)).
% 0.47/0.40 thf(func_def_57, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.47/0.40 thf(func_def_58, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.47/0.40 thf(func_def_61, type, db1: !>[X0: $tType]:(X0)).
% 0.47/0.40 thf(func_def_62, type, db2: !>[X0: $tType]:(X0)).
% 0.47/0.40 thf(func_def_63, type, vIMP: ($o > $o > $o)).
% 0.47/0.40 thf(func_def_64, type, vNOT: ($o > $o)).
% 0.47/0.40 thf(func_def_65, type, vOR: ($o > $o > $o)).
% 0.47/0.40 thf(func_def_66, type, vAND: ($o > $o > $o)).
% 0.47/0.40 thf(func_def_67, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.47/0.40 thf(func_def_68, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.47/0.40 thf(func_def_69, type, db3: !>[X0: $tType]:(X0)).
% 0.47/0.40 thf(func_def_70, type, sK0: !>[X0: $tType]:((option @ X0 > X0))).
% 0.47/0.40 thf(func_def_71, type, sK1: !>[X0: $tType, X1: $tType]:((option @ X1 > option @ X0 > (option @ X0 > option @ X1 > $o) > X0))).
% 0.47/0.40 thf(func_def_72, type, sK2: !>[X0: $tType, X1: $tType]:((option @ X1 > option @ X0 > (option @ X0 > option @ X1 > $o) > X1))).
% 0.47/0.40 thf(func_def_73, type, sK3: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 0.47/0.40 thf(func_def_74, type, sK4: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_75, type, sK5: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_76, type, sK6: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_77, type, sK7: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_78, type, sK8: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_79, type, sK9: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_80, type, sK10: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_81, type, sK11: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_82, type, sK12: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > (X1 > X0) > X1))).
% 0.47/0.40 thf(func_def_83, type, sK13: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_84, type, sK14: !>[X0: $tType]:(((X0 > $o) > X0 > X0))).
% 0.47/0.40 thf(func_def_85, type, sK15: !>[X0: $tType]:((X0 > X0))).
% 0.47/0.40 thf(func_def_86, type, sK16: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_87, type, sK17: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_88, type, sK18: !>[X0: $tType]:((X0 > (X0 > int) > binary1291135688e_Tree @ X0 > X0))).
% 0.47/0.40 thf(func_def_89, type, sK19: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > (X0 > int) > X0))).
% 0.47/0.40 thf(func_def_90, type, sK20: !>[X0: $tType, X1: $tType]:(((X0 > X1) > set @ X0 > X0 > X0))).
% 0.47/0.40 thf(func_def_91, type, sK21: !>[X0: $tType]:((set @ X0 > X0))).
% 0.47/0.40 thf(func_def_92, type, sK22: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_93, type, sK23: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_94, type, sK24: !>[X0: $tType]:((option @ X0 > X0))).
% 0.47/0.40 thf(func_def_95, type, sK25: !>[X0: $tType]:(((X0 > $o) > option @ X0 > X0))).
% 0.47/0.40 thf(func_def_96, type, sK26: !>[X0: $tType]:((set @ X0 > X0))).
% 0.47/0.40 thf(func_def_97, type, sK27: !>[X0: $tType]:((X0 > X0))).
% 0.47/0.40 thf(func_def_98, type, sK28: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.47/0.40 thf(func_def_99, type, sK29: !>[X0: $tType]:((X0 > binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.47/0.40 thf(func_def_100, type, sK30: !>[X0: $tType]:((X0 > binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.47/0.40 thf(func_def_101, type, sK31: !>[X0: $tType]:((X0 > binary1291135688e_Tree @ X0 > X0))).
% 0.47/0.40 thf(func_def_102, type, sK32: !>[X0: $tType]:((X0 > binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.47/0.40 thf(func_def_103, type, sK33: !>[X0: $tType]:((X0 > binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.47/0.40 thf(func_def_104, type, sK34: !>[X0: $tType]:((X0 > binary1291135688e_Tree @ X0 > X0))).
% 0.47/0.40 thf(func_def_105, type, sK35: !>[X0: $tType]:((X0 > binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.47/0.40 thf(func_def_106, type, sK36: !>[X0: $tType]:((X0 > binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.47/0.40 thf(func_def_107, type, sK37: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 0.47/0.40 thf(func_def_108, type, sK38: !>[X0: $tType, X1: $tType]:((set @ X1 > (X1 > X0) > X0 > X1))).
% 0.47/0.40 thf(func_def_109, type, sK39: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0))).
% 0.47/0.40 thf(func_def_110, type, sK40: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.47/0.40 thf(func_def_111, type, sK41: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.47/0.40 thf(func_def_112, type, sK42: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.47/0.40 thf(func_def_113, type, sK43: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.47/0.40 thf(func_def_114, type, sK44: !>[X0: $tType]:((set @ X0 > (X0 > $o) > set @ X0 > X0))).
% 0.47/0.40 thf(func_def_115, type, sK45: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_116, type, sK46: !>[X0: $tType]:(((X0 > $o) > set @ X0 > X0))).
% 0.47/0.40 thf(func_def_117, type, sK47: !>[X0: $tType]:((option @ X0 > X0))).
% 0.47/0.40 thf(func_def_118, type, sK48: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.47/0.40 thf(func_def_119, type, sK49: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.47/0.40 thf(func_def_120, type, sK50: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.47/0.40 thf(func_def_121, type, sK51: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.47/0.40 thf(func_def_122, type, sK52: !>[X0: $tType]:((X0 > X0))).
% 0.47/0.40 thf(func_def_123, type, sK53: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X1 > X0) > set @ X1 > X1))).
% 0.47/0.40 thf(func_def_124, type, sK54: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_125, type, sK55: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_126, type, sK56: !>[X0: $tType]:(((option @ X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_127, type, sK57: !>[X0: $tType]:((option @ X0 > (X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_128, type, sK58: !>[X0: $tType]:((X0 > X0 > set @ X0 > set @ X0 > set @ X0))).
% 0.47/0.40 thf(func_def_129, type, sK59: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X0 > X1) > (X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_130, type, sK60: !>[X0: $tType]:((set @ X0 > X0))).
% 0.47/0.40 thf(func_def_131, type, sK61: !>[X0: $tType]:((set @ X0 > X0))).
% 0.47/0.40 thf(func_def_132, type, sK62: !>[X0: $tType]:((X0 > X0))).
% 0.47/0.40 thf(func_def_133, type, sK63: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_134, type, sK64: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_135, type, sK65: !>[X0: $tType]:((set @ X0 > set @ X0 > (X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_136, type, sK66: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_137, type, sK67: !>[X0: $tType, X1: $tType]:((set @ X0 > X1 > (X0 > X1) > X0))).
% 0.47/0.40 thf(func_def_138, type, sK68: !>[X0: $tType]:(((binary1291135688e_Tree @ X0 > $o) > binary1291135688e_Tree @ X0))).
% 0.47/0.40 thf(func_def_139, type, sK69: !>[X0: $tType]:(((binary1291135688e_Tree @ X0 > $o) > X0))).
% 0.47/0.40 thf(func_def_140, type, sK70: !>[X0: $tType]:(((binary1291135688e_Tree @ X0 > $o) > binary1291135688e_Tree @ X0))).
% 0.47/0.40 thf(func_def_141, type, sK71: !>[X0: $tType]:((set @ X0 > X0))).
% 0.47/0.40 thf(func_def_142, type, sK72: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 0.47/0.40 thf(func_def_143, type, sK73: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.47/0.40 thf(func_def_144, type, sK74: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.47/0.40 thf(func_def_145, type, sK75: !>[X0: $tType]:((X0 > X0))).
% 0.47/0.40 thf(func_def_146, type, sK76: !>[X0: $tType, X1: $tType]:(((X0 > X1) > set @ X0 > X1))).
% 0.47/0.40 thf(func_def_147, type, sK77: !>[X0: $tType, X1: $tType]:((X1 > (X0 > X1) > set @ X0 > X0))).
% 0.47/0.40 thf(func_def_148, type, sK78: !>[X0: $tType, X1: $tType]:(((X0 > X1) > (X1 > $o) > set @ X0 > X1))).
% 0.47/0.40 thf(func_def_149, type, sK79: !>[X0: $tType]:((set @ X0 > X0))).
% 0.47/0.40 thf(func_def_150, type, sK80: !>[X0: $tType]:((X0 > set @ X0 > X0))).
% 0.47/0.40 thf(func_def_151, type, sK81: !>[X0: $tType]:((set @ X0 > X0))).
% 0.47/0.40 thf(f5,axiom,(
% 0.47/0.40 (((h @ x)) != ((h @ x)))),
% 0.47/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4__092_060open_062h_Ax_A_092_060noteq_062_Ah_Ax_092_060close_062)).
% 0.47/0.40 thf(f1433,plain,(
% 0.47/0.40 (((h @ x)) != ((h @ x)))),
% 0.47/0.40 inference(cnf_transformation,[],[f5])).
% 0.47/0.40 thf(f1901,plain,(
% 0.47/0.40 $false),
% 0.47/0.40 inference(trivial_inequality_removal,[],[f1433])).
% 0.47/0.40 % SZS output end Proof for theBenchmark
% 0.47/0.40 % (2967027)------------------------------
% 0.47/0.40 % (2967027)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.47/0.40 % (2967027)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.47/0.40 % (2967027)CaDiCaL version: 2.1.3
% 0.47/0.40 % (2967027)Termination reason: Refutation
% 0.47/0.40 % (2967027)Time elapsed: 0.050 s
% 0.47/0.40 % (2967027)Peak memory usage: 13 MB
% 0.47/0.40 % (2967027)Instructions burned: 101 (million)
% 0.47/0.40 % (2967006)Success in time 0.107 s
% 0.47/0.40 % Vampire exiting
%------------------------------------------------------------------------------