%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP068^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 : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:08:12 AM UTC 2026
% Result : Theorem 2.08s 0.67s
% Output : Refutation 2.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP068^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.08/0.19 % Computer : n014.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.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 19:46:15 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.19/0.30 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.29/0.44 % (3121449)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.29/0.44 % (3121454)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=332376407:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.29/0.44 % (3121460)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.29/0.44 % (3121460)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.29/0.44 % (3121455)lrs+10_16_si=on:nwc=1.5:random_seed=2890563583:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.29/0.44 % (3121456)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2872745269:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.29/0.44 % (3121457)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=1387804604: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.29/0.44 % (3121458)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2542739162:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.29/0.44 % (3121459)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2633724330:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.29/0.44 % (3121460)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=293099490:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.29/0.44 % (3121456)Instruction limit reached!
% 0.29/0.44 % (3121456)------------------------------
% 0.29/0.44 % (3121456)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.44 % (3121456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.44 % (3121456)CaDiCaL version: 2.1.3
% 0.29/0.44 % (3121456)Termination reason: Instruction limit
% 0.29/0.44 % (3121456)Termination phase: shuffling
% 0.29/0.44 % (3121456)Time elapsed: 0.003 s
% 0.29/0.44 % (3121456)Peak memory usage: 10 MB
% 0.29/0.44 % (3121456)Instructions burned: 5 (million)
% 0.29/0.44 % (3121455)Instruction limit reached!
% 0.29/0.44 % (3121455)------------------------------
% 0.29/0.44 % (3121455)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.44 % (3121455)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.44 % (3121455)CaDiCaL version: 2.1.3
% 0.29/0.44 % (3121455)Termination reason: Instruction limit
% 0.29/0.44 % (3121455)Termination phase: shuffling
% 0.29/0.44 % (3121455)Time elapsed: 0.010 s
% 0.29/0.44 % (3121455)Peak memory usage: 10 MB
% 0.29/0.44 % (3121455)Instructions burned: 19 (million)
% 0.29/0.44 % (3121458)Instruction limit reached!
% 0.29/0.44 % (3121458)------------------------------
% 0.29/0.44 % (3121458)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.44 % (3121458)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.44 % (3121458)CaDiCaL version: 2.1.3
% 0.29/0.44 % (3121458)Termination reason: Instruction limit
% 0.29/0.44 % (3121458)Termination phase: shuffling
% 0.29/0.44 % (3121458)Time elapsed: 0.011 s
% 0.29/0.44 % (3121458)Peak memory usage: 10 MB
% 0.29/0.44 % (3121458)Instructions burned: 24 (million)
% 0.29/0.44 % (3121454)Instruction limit reached!
% 0.29/0.44 % (3121454)------------------------------
% 0.29/0.44 % (3121454)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.44 % (3121454)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.44 % (3121454)CaDiCaL version: 2.1.3
% 0.29/0.44 % (3121454)Termination reason: Instruction limit
% 0.29/0.44 % (3121454)Termination phase: Preprocessing 3
% 0.29/0.44 % (3121454)Time elapsed: 0.024 s
% 0.29/0.44 % (3121454)Peak memory usage: 12 MB
% 0.29/0.44 % (3121454)Instructions burned: 90 (million)
% 0.29/0.44 % (3121468)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=1436521123:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.29/0.44 % (3121468)Instruction limit reached!
% 0.29/0.44 % (3121468)------------------------------
% 0.29/0.44 % (3121468)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.01/0.48 % (3121468)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.01/0.48 % (3121468)CaDiCaL version: 2.1.3
% 1.01/0.48 % (3121468)Termination reason: Instruction limit
% 1.01/0.48 % (3121468)Termination phase: shuffling
% 1.01/0.48 % (3121468)Time elapsed: 0.002 s
% 1.01/0.48 % (3121468)Peak memory usage: 10 MB
% 1.01/0.48 % (3121468)Instructions burned: 3 (million)
% 1.01/0.48 % (3121471)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=3211544163:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 1.01/0.48 % (3121470)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 1.01/0.48 % (3121469)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=3625259504:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 1.01/0.48 % (3121471)Instruction limit reached!
% 1.01/0.48 % (3121471)------------------------------
% 1.01/0.48 % (3121471)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.01/0.48 % (3121471)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.01/0.48 % (3121471)CaDiCaL version: 2.1.3
% 1.01/0.48 % (3121471)Termination reason: Instruction limit
% 1.01/0.48 % (3121471)Termination phase: shuffling
% 1.01/0.48 % (3121471)Time elapsed: 0.004 s
% 1.01/0.48 % (3121471)Peak memory usage: 10 MB
% 1.01/0.48 % (3121471)Instructions burned: 16 (million)
% 1.01/0.48 % (3121470)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=1162521101:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 1.01/0.48 % (3121469)Instruction limit reached!
% 1.01/0.48 % (3121469)------------------------------
% 1.01/0.48 % (3121469)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.01/0.48 % (3121469)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.01/0.48 % (3121469)CaDiCaL version: 2.1.3
% 1.01/0.48 % (3121469)Termination reason: Instruction limit
% 1.01/0.48 % (3121469)Termination phase: shuffling
% 1.01/0.48 % (3121469)Time elapsed: 0.003 s
% 1.01/0.48 % (3121469)Peak memory usage: 10 MB
% 1.01/0.48 % (3121469)Instructions burned: 6 (million)
% 1.01/0.48 % (3121470)Instruction limit reached!
% 1.01/0.48 % (3121470)------------------------------
% 1.01/0.48 % (3121470)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.01/0.48 % (3121470)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.01/0.48 % (3121470)CaDiCaL version: 2.1.3
% 1.01/0.48 % (3121470)Termination reason: Instruction limit
% 1.01/0.48 % (3121470)Termination phase: shuffling
% 1.01/0.48 % (3121470)Time elapsed: 0.004 s
% 1.01/0.48 % (3121470)Peak memory usage: 10 MB
% 1.01/0.48 % (3121470)Instructions burned: 8 (million)
% 1.01/0.48 % (3121459)Instruction limit reached!
% 1.01/0.48 % (3121459)------------------------------
% 1.01/0.48 % (3121459)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.01/0.48 % (3121459)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.01/0.48 % (3121459)CaDiCaL version: 2.1.3
% 1.01/0.48 % (3121459)Termination reason: Instruction limit
% 1.01/0.48 % (3121459)Termination phase: Preprocessing 3
% 1.01/0.48 % (3121459)Time elapsed: 0.036 s
% 1.01/0.48 % (3121459)Peak memory usage: 12 MB
% 1.01/0.48 % (3121459)Instructions burned: 75 (million)
% 1.01/0.48 % (3121473)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
% 1.01/0.48 % (3121473)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 1.01/0.48 % (3121477)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=4244933303:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 1.01/0.48 % (3121473)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=689522471:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 1.01/0.48 % (3121479)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 1.01/0.52 % (3121478)lrs+10_1_si=on:cs=on:random_seed=1618169632:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 1.01/0.52 % (3121479)ott+1002_20_sil=128000:cnfonf=lazy_not_gen_be_off:si=on:sp=unary_frequency:plsqr=1,32:bce=on:uwa=interpreted_only:foolp=on:random_seed=2631315486:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 1.01/0.52 % (3121480)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=2164653302:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/38Mi)
% 1.01/0.52 % (3121478)Instruction limit reached!
% 1.01/0.52 % (3121478)------------------------------
% 1.01/0.52 % (3121478)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.01/0.52 % (3121478)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.01/0.52 % (3121478)CaDiCaL version: 2.1.3
% 1.01/0.52 % (3121478)Termination reason: Instruction limit
% 1.01/0.52 % (3121478)Termination phase: shuffling
% 1.01/0.52 % (3121478)Time elapsed: 0.004 s
% 1.01/0.52 % (3121478)Peak memory usage: 10 MB
% 1.01/0.52 % (3121478)Instructions burned: 8 (million)
% 1.01/0.52 % (3121479)Instruction limit reached!
% 1.01/0.52 % (3121479)------------------------------
% 1.01/0.52 % (3121479)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.01/0.52 % (3121479)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.01/0.52 % (3121479)CaDiCaL version: 2.1.3
% 1.01/0.52 % (3121479)Termination reason: Instruction limit
% 1.01/0.52 % (3121479)Termination phase: shuffling
% 1.01/0.52 % (3121479)Time elapsed: 0.002 s
% 1.01/0.52 % (3121479)Peak memory usage: 10 MB
% 1.01/0.52 % (3121479)Instructions burned: 3 (million)
% 1.01/0.52 % (3121473)Instruction limit reached!
% 1.01/0.52 % (3121473)------------------------------
% 1.01/0.52 % (3121473)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.01/0.52 % (3121473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.01/0.52 % (3121473)CaDiCaL version: 2.1.3
% 1.01/0.52 % (3121473)Termination reason: Instruction limit
% 1.01/0.52 % (3121473)Termination phase: shuffling
% 1.01/0.52 % (3121473)Time elapsed: 0.014 s
% 1.01/0.52 % (3121473)Peak memory usage: 10 MB
% 1.01/0.52 % (3121473)Instructions burned: 30 (million)
% 1.01/0.52 % (3121477)Instruction limit reached!
% 1.01/0.52 % (3121477)------------------------------
% 1.01/0.52 % (3121477)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.01/0.52 % (3121477)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.01/0.52 % (3121477)CaDiCaL version: 2.1.3
% 1.01/0.52 % (3121477)Termination reason: Instruction limit
% 1.01/0.52 % (3121477)Termination phase: Preprocessing 1
% 1.01/0.52 % (3121477)Time elapsed: 0.021 s
% 1.01/0.52 % (3121477)Peak memory usage: 11 MB
% 1.01/0.52 % (3121477)Instructions burned: 89 (million)
% 1.01/0.52 % (3121480)Instruction limit reached!
% 1.01/0.52 % (3121480)------------------------------
% 1.01/0.52 % (3121480)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.01/0.52 % (3121480)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.01/0.52 % (3121480)CaDiCaL version: 2.1.3
% 1.01/0.52 % (3121480)Termination reason: Instruction limit
% 1.01/0.52 % (3121480)Termination phase: Property scanning
% 1.01/0.52 % (3121480)Time elapsed: 0.018 s
% 1.01/0.52 % (3121480)Peak memory usage: 11 MB
% 1.01/0.52 % (3121480)Instructions burned: 38 (million)
% 1.01/0.52 % (3121460)Instruction limit reached!
% 1.01/0.52 % (3121460)------------------------------
% 1.01/0.52 % (3121460)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.01/0.52 % (3121460)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.01/0.52 % (3121460)CaDiCaL version: 2.1.3
% 1.01/0.52 % (3121460)Termination reason: Instruction limit
% 1.01/0.52 % (3121460)Termination phase: Saturation
% 1.01/0.52 % (3121460)Time elapsed: 0.074 s
% 1.01/0.52 % (3121460)Peak memory usage: 14 MB
% 1.01/0.52 % (3121460)Instructions burned: 158 (million)
% 1.01/0.52 % (3121489)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=703958751:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/327Mi)
% 1.01/0.52 % (3121486)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=2009680563:st=2:i=249:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/249Mi)
% 1.01/0.52 % (3121488)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=3358469784:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2998 on theBenchmark for (2998ds/14Mi)
% 1.76/0.57 % (3121487)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=4034870507:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/25Mi)
% 1.76/0.57 % (3121488)Instruction limit reached!
% 1.76/0.57 % (3121488)------------------------------
% 1.76/0.57 % (3121488)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.57 % (3121488)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.57 % (3121488)CaDiCaL version: 2.1.3
% 1.76/0.57 % (3121488)Termination reason: Instruction limit
% 1.76/0.57 % (3121488)Termination phase: shuffling
% 1.76/0.57 % (3121488)Time elapsed: 0.007 s
% 1.76/0.57 % (3121488)Peak memory usage: 10 MB
% 1.76/0.57 % (3121488)Instructions burned: 15 (million)
% 1.76/0.57 % (3121487)Instruction limit reached!
% 1.76/0.57 % (3121487)------------------------------
% 1.76/0.57 % (3121487)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.57 % (3121487)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.57 % (3121487)CaDiCaL version: 2.1.3
% 1.76/0.57 % (3121487)Termination reason: Instruction limit
% 1.76/0.57 % (3121487)Termination phase: shuffling
% 1.76/0.57 % (3121487)Time elapsed: 0.013 s
% 1.76/0.57 % (3121487)Peak memory usage: 10 MB
% 1.76/0.57 % (3121487)Instructions burned: 25 (million)
% 1.76/0.57 % (3121492)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=2553801993:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/14Mi)
% 1.76/0.57 % (3121493)ott+21_20_to=lpo:sil=128000:tgt=ground:si=on:sp=arity:lma=off:uwa=off:foolp=on:random_seed=3422232526:st=4:i=2:add=off:sd=3:nm=16:fsr=off:rtra=on:ss=axioms:sgt=8:ntd=on_2998 on theBenchmark for (2998ds/2Mi)
% 1.76/0.57 % (3121493)Instruction limit reached!
% 1.76/0.57 % (3121493)------------------------------
% 1.76/0.57 % (3121493)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.57 % (3121493)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.57 % (3121493)CaDiCaL version: 2.1.3
% 1.76/0.57 % (3121493)Termination reason: Instruction limit
% 1.76/0.57 % (3121493)Termination phase: shuffling
% 1.76/0.57 % (3121493)Time elapsed: 0.002 s
% 1.76/0.57 % (3121493)Peak memory usage: 10 MB
% 1.76/0.57 % (3121493)Instructions burned: 2 (million)
% 1.76/0.57 % (3121492)Instruction limit reached!
% 1.76/0.57 % (3121492)------------------------------
% 1.76/0.57 % (3121492)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.57 % (3121492)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.57 % (3121492)CaDiCaL version: 2.1.3
% 1.76/0.57 % (3121492)Termination reason: Instruction limit
% 1.76/0.57 % (3121492)Termination phase: shuffling
% 1.76/0.57 % (3121492)Time elapsed: 0.007 s
% 1.76/0.57 % (3121492)Peak memory usage: 10 MB
% 1.76/0.57 % (3121492)Instructions burned: 15 (million)
% 1.76/0.57 % (3121496)ott+1004_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=unary_frequency:cbe=off:uwa=off:nwc=1:random_seed=3568739761:i=26:ep=R:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/26Mi)
% 1.76/0.57 % (3121497)dis+1002_16_sil=128000:si=on:sp=occurrence:random_seed=1970842998:cond=fast:i=23:hud=1:av=off:rtra=on:fe=abstraction:ntd=on_2998 on theBenchmark for (2998ds/23Mi)
% 1.76/0.57 % (3121500)lrs+1002_1024_sil=128000:tgt=ground:fde=none:e2e=on:si=on:uwa=off:nwc=1:random_seed=3822194629:cond=on:i=60:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/60Mi)
% 1.76/0.57 % (3121501)WARNING Broken Constraint: if sine_to_age_generality_threshold(10) 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
% 1.76/0.57 % (3121501)WARNING Broken Constraint: if lrs_weight_limit_only(on) has been set then saturation_algorithm(otter) is equal to lrs
% 1.76/0.57 % (3121496)Instruction limit reached!
% 1.76/0.57 % (3121496)------------------------------
% 1.76/0.57 % (3121496)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.57 % (3121496)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.57 % (3121496)CaDiCaL version: 2.1.3
% 1.76/0.57 % (3121496)Termination reason: Instruction limit
% 1.76/0.57 % (3121496)Termination phase: shuffling
% 1.76/0.57 % (3121496)Time elapsed: 0.013 s
% 1.76/0.57 % (3121496)Peak memory usage: 10 MB
% 1.76/0.57 % (3121496)Instructions burned: 28 (million)
% 1.76/0.63 % (3121501)ott+21_1_to=kbo:sil=128000:cnfonf=lazy_gen:bsd=on:si=on:sp=const_frequency:lma=off:uwa=off:foolp=on:s2agt=10:lwlo=on:random_seed=2792898466:i=14:add=off:nm=40:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 1.76/0.63 % (3121497)Instruction limit reached!
% 1.76/0.63 % (3121497)------------------------------
% 1.76/0.63 % (3121497)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.63 % (3121497)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.63 % (3121497)CaDiCaL version: 2.1.3
% 1.76/0.63 % (3121497)Termination reason: Instruction limit
% 1.76/0.63 % (3121497)Termination phase: shuffling
% 1.76/0.63 % (3121497)Time elapsed: 0.012 s
% 1.76/0.63 % (3121497)Peak memory usage: 11 MB
% 1.76/0.63 % (3121497)Instructions burned: 25 (million)
% 1.76/0.63 % (3121501)Instruction limit reached!
% 1.76/0.63 % (3121501)------------------------------
% 1.76/0.63 % (3121501)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.63 % (3121501)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.63 % (3121501)CaDiCaL version: 2.1.3
% 1.76/0.63 % (3121501)Termination reason: Instruction limit
% 1.76/0.63 % (3121501)Termination phase: shuffling
% 1.76/0.63 % (3121501)Time elapsed: 0.007 s
% 1.76/0.63 % (3121501)Peak memory usage: 10 MB
% 1.76/0.63 % (3121501)Instructions burned: 16 (million)
% 1.76/0.63 % (3121505)WARNING Broken Constraint: if choice_reasoning(on) has been set then choice_ax(on) is equal to off
% 1.76/0.63 % (3121505)lrs+1010_4:1_slsqr=8,1:to=kbo:cha=on:drc=off:si=on:sp=arity:lcm=predicate:uwa=off:fd=preordered:gs=on:nwc=5:s2agt=32:slsqc=1:kmz=on:updr=off:chr=on:pe=on:slsq=on:random_seed=600281882:i=8:nm=2:rtra=on:fe=abstraction:inj=on_2998 on theBenchmark for (2998ds/8Mi)
% 1.76/0.63 % (3121505)Instruction limit reached!
% 1.76/0.63 % (3121505)------------------------------
% 1.76/0.63 % (3121505)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.63 % (3121505)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.63 % (3121505)CaDiCaL version: 2.1.3
% 1.76/0.63 % (3121505)Termination reason: Instruction limit
% 1.76/0.63 % (3121505)Termination phase: shuffling
% 1.76/0.63 % (3121505)Time elapsed: 0.004 s
% 1.76/0.63 % (3121505)Peak memory usage: 10 MB
% 1.76/0.63 % (3121505)Instructions burned: 8 (million)
% 1.76/0.63 % (3121507)dis+1004_50_to=lpo:drc=off:fde=unused:cnfonf=lazy_not_gen_be_off:si=on:sp=reverse_arity:spb=units:cbe=off:foolp=on:random_seed=1433659920:uwa_fpi=on:i=31:doe=on:bd=preordered:rtra=on:fsd=on_2998 on theBenchmark for (2998ds/31Mi)
% 1.76/0.63 % (3121500)Instruction limit reached!
% 1.76/0.63 % (3121500)------------------------------
% 1.76/0.63 % (3121500)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.63 % (3121500)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.63 % (3121500)CaDiCaL version: 2.1.3
% 1.76/0.63 % (3121500)Termination reason: Instruction limit
% 1.76/0.63 % (3121500)Termination phase: Preprocessing 3
% 1.76/0.63 % (3121500)Time elapsed: 0.028 s
% 1.76/0.63 % (3121500)Peak memory usage: 11 MB
% 1.76/0.63 % (3121500)Instructions burned: 61 (million)
% 1.76/0.63 % (3121508)dis+10_1024_sil=128000:cnfonf=off:si=on:fd=off:random_seed=1267530197:i=7:hud=5:bd=preordered:rtra=on:bet=on_2998 on theBenchmark for (2998ds/7Mi)
% 1.76/0.63 % (3121508)Instruction limit reached!
% 1.76/0.63 % (3121508)------------------------------
% 1.76/0.63 % (3121508)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.63 % (3121508)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.63 % (3121508)CaDiCaL version: 2.1.3
% 1.76/0.63 % (3121508)Termination reason: Instruction limit
% 1.76/0.63 % (3121508)Termination phase: shuffling
% 1.76/0.63 % (3121508)Time elapsed: 0.004 s
% 1.76/0.63 % (3121508)Peak memory usage: 10 MB
% 1.76/0.63 % (3121508)Instructions burned: 8 (million)
% 1.76/0.63 % (3121507)Instruction limit reached!
% 1.76/0.63 % (3121507)------------------------------
% 1.76/0.63 % (3121507)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.76/0.63 % (3121507)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.76/0.63 % (3121507)CaDiCaL version: 2.1.3
% 1.76/0.63 % (3121507)Termination reason: Instruction limit
% 1.76/0.63 % (3121507)Termination phase: shuffling
% 1.76/0.63 % (3121507)Time elapsed: 0.015 s
% 1.76/0.63 % (3121507)Peak memory usage: 10 MB
% 1.76/0.63 % (3121507)Instructions burned: 33 (million)
% 2.08/0.67 % (3121511)lrs+10_1_plsq=on:drc=ordering:cnfonf=lazy_not_gen_be_off:bsd=on:si=on:plsqr=32,1:cs=on:random_seed=2910853005:i=23:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/23Mi)
% 2.08/0.67 % (3121489)Instruction limit reached!
% 2.08/0.67 % (3121489)------------------------------
% 2.08/0.67 % (3121489)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.67 % (3121489)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3121489)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3121489)Termination reason: Instruction limit
% 2.08/0.67 % (3121489)Termination phase: Saturation
% 2.08/0.67 % (3121489)Time elapsed: 0.088 s
% 2.08/0.67 % (3121489)Peak memory usage: 15 MB
% 2.08/0.67 % (3121489)Instructions burned: 328 (million)
% 2.08/0.67 % (3121512)lrs+10_1_sil=128000:fde=unused:si=on:random_seed=3187703088:s2a=on:i=20:kws=inv_frequency:bd=all:rtra=on_2997 on theBenchmark for (2997ds/20Mi)
% 2.08/0.67 % (3121514)dis+1010_2:1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:uwa=off:slsq=on:random_seed=3525047068:i=1240:rtra=on:ixr=off_2997 on theBenchmark for (2997ds/1240Mi)
% 2.08/0.67 % (3121517)lrs+1002_1_sil=128000:si=on:acc=on:uwa=off:random_seed=1273034673:st=5:s2a=on:i=193:sd=1:rtra=on:ss=axioms_2997 on theBenchmark for (2997ds/193Mi)
% 2.08/0.67 % (3121512)Instruction limit reached!
% 2.08/0.67 % (3121512)------------------------------
% 2.08/0.67 % (3121512)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.67 % (3121512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3121512)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3121512)Termination reason: Instruction limit
% 2.08/0.67 % (3121512)Termination phase: shuffling
% 2.08/0.67 % (3121512)Time elapsed: 0.010 s
% 2.08/0.67 % (3121512)Peak memory usage: 10 MB
% 2.08/0.67 % (3121512)Instructions burned: 21 (million)
% 2.08/0.67 % (3121511)Instruction limit reached!
% 2.08/0.67 % (3121511)------------------------------
% 2.08/0.67 % (3121511)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.67 % (3121511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3121511)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3121511)Termination reason: Instruction limit
% 2.08/0.67 % (3121511)Termination phase: shuffling
% 2.08/0.67 % (3121511)Time elapsed: 0.012 s
% 2.08/0.67 % (3121511)Peak memory usage: 10 MB
% 2.08/0.67 % (3121511)Instructions burned: 24 (million)
% 2.08/0.67 % (3121515)ott+1002_32_tgt=ground:si=on:sp=const_max:acc=on:nwc=0.5:random_seed=1073230126:i=143:fgj=on:piset=pi_sigma:rtra=on:fe=abstraction_2997 on theBenchmark for (2997ds/143Mi)
% 2.08/0.67 % (3121522)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 2.08/0.67 % (3121486)Instruction limit reached!
% 2.08/0.67 % (3121486)------------------------------
% 2.08/0.67 % (3121486)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.67 % (3121486)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3121486)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3121486)Termination reason: Instruction limit
% 2.08/0.67 % (3121486)Termination phase: Saturation
% 2.08/0.67 % (3121486)Time elapsed: 0.115 s
% 2.08/0.67 % (3121486)Peak memory usage: 14 MB
% 2.08/0.67 % (3121486)Instructions burned: 249 (million)
% 2.08/0.67 % (3121521)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=2267019636:i=42:hud=10:rtra=on_2997 on theBenchmark for (2997ds/42Mi)
% 2.08/0.67 % (3121522)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=791361223:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2997 on theBenchmark for (2997ds/7Mi)
% 2.08/0.67 % (3121522)Instruction limit reached!
% 2.08/0.67 % (3121522)------------------------------
% 2.08/0.67 % (3121522)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.67 % (3121522)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3121522)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3121522)Termination reason: Instruction limit
% 2.08/0.67 % (3121522)Termination phase: shuffling
% 2.08/0.67 % (3121522)Time elapsed: 0.004 s
% 2.08/0.67 % (3121522)Peak memory usage: 10 MB
% 2.08/0.67 % (3121522)Instructions burned: 7 (million)
% 2.08/0.67 % (3121524)lrs+10_1_to=lpo:sil=128000:si=on:sp=arity:urr=on:random_seed=1492213998:i=181:sd=2:bd=preordered:rtra=on:ss=axioms_2997 on theBenchmark for (2997ds/181Mi)
% 2.08/0.67 % (3121521)Instruction limit reached!
% 2.08/0.67 % (3121521)------------------------------
% 2.08/0.67 % (3121521)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.67 % (3121521)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3121521)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3121521)Termination reason: Instruction limit
% 2.08/0.67 % (3121521)Termination phase: Property scanning
% 2.08/0.67 % (3121521)Time elapsed: 0.019 s
% 2.08/0.67 % (3121521)Peak memory usage: 11 MB
% 2.08/0.67 % (3121521)Instructions burned: 42 (million)
% 2.08/0.67 % (3121527)dis+10_8_sil=128000:plsq=on:plsqc=1:si=on:sp=unary_first:sos=on:lma=off:plsqr=64,1:uwa=interpreted_only:foolp=on:random_seed=1371748012:st=3:avsq=on:i=169:avsqr=8,1:sd=2:kws=precedence:bd=preordered:rtra=on:ss=axioms:ntd=on_2997 on theBenchmark for (2997ds/169Mi)
% 2.08/0.67 % (3121517)Instruction limit reached!
% 2.08/0.67 % (3121517)------------------------------
% 2.08/0.67 % (3121517)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.67 % (3121517)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3121517)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3121517)Termination reason: Instruction limit
% 2.08/0.67 % (3121517)Termination phase: Saturation
% 2.08/0.67 % (3121517)Time elapsed: 0.052 s
% 2.08/0.67 % (3121517)Peak memory usage: 14 MB
% 2.08/0.67 % (3121517)Instructions burned: 196 (million)
% 2.08/0.67 % (3121529)WARNING Broken Constraint: if sine_level_split_queue_cutoffs(5) has been set then sine_level_split_queue(off) is equal to on
% 2.08/0.67 % (3121529)lrs+1002_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=arity:cbe=off:uwa=all:slsqc=5:random_seed=2483144336:st=4:s2a=on:i=6:add=on:doe=on:hud=10:rtra=on:bet=on:ss=axioms_2997 on theBenchmark for (2997ds/6Mi)
% 2.08/0.67 % (3121529)Instruction limit reached!
% 2.08/0.67 % (3121529)------------------------------
% 2.08/0.67 % (3121529)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.67 % (3121529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3121529)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3121529)Termination reason: Instruction limit
% 2.08/0.67 % (3121529)Termination phase: shuffling
% 2.08/0.67 % (3121529)Time elapsed: 0.004 s
% 2.08/0.67 % (3121529)Peak memory usage: 10 MB
% 2.08/0.67 % (3121529)Instructions burned: 8 (million)
% 2.08/0.67 % (3121531)ott+2_5:4_anc=none:to=lpo:si=on:lma=off:cbe=off:uwa=ground:nwc=3:random_seed=450195511:uwa_fpi=on:i=22:add=on:doe=on:ins=1:rtra=on_2997 on theBenchmark for (2997ds/22Mi)
% 2.08/0.67 % (3121531)Instruction limit reached!
% 2.08/0.67 % (3121531)------------------------------
% 2.08/0.67 % (3121531)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.67 % (3121531)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3121531)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3121531)Termination reason: Instruction limit
% 2.08/0.67 % (3121531)Termination phase: shuffling
% 2.08/0.67 % (3121531)Time elapsed: 0.006 s
% 2.08/0.67 % (3121531)Peak memory usage: 10 MB
% 2.08/0.67 % (3121531)Instructions burned: 26 (million)
% 2.08/0.67 % (3121515)Instruction limit reached!
% 2.08/0.67 % (3121515)------------------------------
% 2.08/0.67 % (3121515)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.67 % (3121515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3121515)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3121515)Termination reason: Instruction limit
% 2.08/0.67 % (3121515)Termination phase: Saturation
% 2.08/0.67 % (3121515)Time elapsed: 0.066 s
% 2.08/0.67 % (3121515)Peak memory usage: 13 MB
% 2.08/0.67 % (3121515)Instructions burned: 144 (million)
% 2.08/0.67 % (3121535)ott+10_1_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:lma=off:plsqr=128,1:urr=ec_only:uwa=off:rp=on:nwc=20:br=off:random_seed=4178751018:i=316:bs=unit_only:ins=25:rtra=on:ntd=on_2997 on theBenchmark for (2997ds/316Mi)
% 2.08/0.67 % (3121534)dis+1010_1_to=lpo:sil=128000:cnfonf=lazy_pi_sigma_gen:sas=cadical:si=on:sos=all:uwa=off:sac=on:random_seed=1071838801:i=19:add=on:rtra=on_2997 on theBenchmark for (2997ds/19Mi)
% 2.08/0.67 % (3121536)dis+1004_4:1_slsqr=1,2:to=lpo:plsq=on:fde=unused:e2e=on:si=on:spb=goal_then_units:acc=on:urr=on:uwa=off:fd=preordered:s2agt=16:slsqc=1:slsq=on:random_seed=2354355411:hsq=on:hsqr=16,1:s2a=on:i=853:add=off:bd=all:nm=64:rtra=on:gtg=position:c=on:ntd=on_2996 on theBenchmark for (2996ds/853Mi)
% 2.08/0.67 % (3121534)Instruction limit reached!
% 2.08/0.67 % (3121534)------------------------------
% 2.08/0.67 % (3121534)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.67 % (3121534)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3121534)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3121534)Termination reason: Instruction limit
% 2.08/0.67 % (3121534)Termination phase: shuffling
% 2.08/0.67 % (3121534)Time elapsed: 0.009 s
% 2.08/0.67 % (3121534)Peak memory usage: 10 MB
% 2.08/0.67 % (3121534)Instructions burned: 20 (million)
% 2.08/0.67 % (3121540)dis+1003_3:4_to=kbo:plsq=on:prc=on:sims=off:e2e=on:si=on:spb=intro:acc=on:urr=on:uwa=off:foolp=on:s2agt=32:slsqc=3:slsq=on:random_seed=12637758:hsq=on:hsqr=16,1:s2a=on:i=45:erml=3:slsql=off:rtra=on:gtg=exists_top:er=filter:ntd=on_2996 on theBenchmark for (2996ds/45Mi)
% 2.08/0.67 % (3121457) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3121449-3121457"...
% 2.08/0.67 % (3121527)Instruction limit reached!
% 2.08/0.67 % (3121527)------------------------------
% 2.08/0.67 % (3121527)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.67 % (3121527)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3121527)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3121527)Termination reason: Instruction limit
% 2.08/0.67 % (3121527)Termination phase: Saturation
% 2.08/0.67 % (3121527)Time elapsed: 0.083 s
% 2.08/0.67 % (3121527)Peak memory usage: 15 MB
% 2.08/0.67 % (3121527)Instructions burned: 170 (million)
% 2.08/0.67 % (3121524)Instruction limit reached!
% 2.08/0.67 % (3121524)------------------------------
% 2.08/0.67 % (3121524)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.67 % (3121524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3121524)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3121524)Termination reason: Instruction limit
% 2.08/0.67 % (3121524)Termination phase: Saturation
% 2.08/0.67 % (3121524)Time elapsed: 0.092 s
% 2.08/0.67 % (3121524)Peak memory usage: 14 MB
% 2.08/0.67 % (3121524)Instructions burned: 182 (million)
% 2.08/0.67 % (3121540)Instruction limit reached!
% 2.08/0.67 % (3121540)------------------------------
% 2.08/0.67 % (3121540)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.67 % (3121540)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.67 % (3121540)CaDiCaL version: 2.1.3
% 2.08/0.67 % (3121540)Termination reason: Instruction limit
% 2.08/0.67 % (3121540)Termination phase: shuffling
% 2.08/0.67 % (3121540)Time elapsed: 0.021 s
% 2.08/0.67 % (3121540)Peak memory usage: 11 MB
% 2.08/0.67 % (3121540)Instructions burned: 46 (million)
% 2.08/0.67 % (3121457)...printing done.
% 2.08/0.67 % (3121457)Refutation found. Thanks to Tanya!
% 2.08/0.67 % SZS status Theorem for theBenchmark
% 2.08/0.67 % SZS output start Proof for theBenchmark
% 2.08/0.67 thf(type_def_5, type, product_prod: ($tType * $tType) > $tType).
% 2.08/0.67 thf(type_def_6, type, multiset: $tType > $tType).
% 2.08/0.67 thf(type_def_7, type, list: $tType > $tType).
% 2.08/0.67 thf(type_def_8, type, tree: $tType > $tType).
% 2.08/0.67 thf(type_def_9, type, set: $tType > $tType).
% 2.08/0.67 thf(type_def_10, type, a: $tType).
% 2.08/0.67 thf(type_def_11, type, sTfun: ($tType * $tType) > $tType).
% 2.08/0.67 thf(func_def_0, type, type: !>[X0: $tType]:($o)).
% 2.08/0.67 thf(func_def_1, type, ord: !>[X0: $tType]:($o)).
% 2.08/0.67 thf(func_def_2, type, order: !>[X0: $tType]:($o)).
% 2.08/0.67 thf(func_def_3, type, linorder: !>[X0: $tType]:($o)).
% 2.08/0.67 thf(func_def_4, type, preorder: !>[X0: $tType]:($o)).
% 2.08/0.67 thf(func_def_5, type, cancel1352612707id_add: !>[X0: $tType]:($o)).
% 2.08/0.67 thf(func_def_6, type, linord219039673up_add: !>[X0: $tType]:($o)).
% 2.08/0.67 thf(func_def_7, type, ordere216010020id_add: !>[X0: $tType]:($o)).
% 2.08/0.67 thf(func_def_8, type, ordere779506340up_add: !>[X0: $tType]:($o)).
% 2.08/0.67 thf(func_def_9, type, linord1659791738miring: !>[X0: $tType]:($o)).
% 2.08/0.67 thf(func_def_10, type, canoni770627133id_add: !>[X0: $tType]:($o)).
% 2.08/0.67 thf(func_def_11, type, ordere236663937imp_le: !>[X0: $tType]:($o)).
% 2.08/0.67 thf(func_def_12, type, unique1598680935umeral: !>[X0: $tType]:($o)).
% 2.08/0.67 thf(func_def_13, type, ordere516151231imp_le: !>[X0: $tType]:($o)).
% 2.08/0.67 thf(func_def_14, type, bNF_Ca1785829860lChain: !>[X0: $tType, X1: $tType]:((set @ product_prod @ X0 @ X0 > (X0 > X1) > $o))).
% 2.08/0.67 thf(func_def_15, type, unique455577585es_aux: !>[X0: $tType]:((product_prod @ X0 @ X0 > $o))).
% 2.08/0.67 thf(func_def_16, type, plus_plus: !>[X0: $tType]:((X0 > X0 > X0))).
% 2.08/0.67 thf(func_def_17, type, zero_zero: !>[X0: $tType]:(X0)).
% 2.08/0.67 thf(func_def_18, type, nO_MATCH: !>[X0: $tType, X1: $tType]:((X0 > X1 > $o))).
% 2.08/0.67 thf(func_def_19, type, heapIm1271749598e_left: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_20, type, heapIm1434396069_right: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_21, type, heapIm748920189ftDown: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_22, type, heap: !>[X0: $tType, X1: $tType]:((X0 > (X0 > $o) > (list @ X1 > X0) > (X0 > multiset @ X1) > (X0 > tree @ X1) > (X0 > product_prod @ X1 @ X0) > $o))).
% 2.08/0.67 thf(func_def_23, type, heap_axioms: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (list @ X1 > X0) > (X0 > multiset @ X1) > (X0 > tree @ X1) > (X0 > product_prod @ X1 @ X0) > $o))).
% 2.08/0.67 thf(func_def_24, type, e: !>[X0: $tType]:(tree @ X0)).
% 2.08/0.67 thf(func_def_25, type, t: !>[X0: $tType]:((X0 > tree @ X0 > tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_26, type, case_Tree: !>[X0: $tType, X1: $tType]:((X0 > (X1 > tree @ X1 > tree @ X1 > X0) > tree @ X1 > X0))).
% 2.08/0.67 thf(func_def_27, type, rec_Tree: !>[X0: $tType, X1: $tType]:((X0 > (X1 > tree @ X1 > tree @ X1 > X0 > X0 > X0) > tree @ X1 > X0))).
% 2.08/0.67 thf(func_def_28, type, rel_Tree: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > tree @ X0 > tree @ X1 > $o))).
% 2.08/0.67 thf(func_def_29, type, in_tree: !>[X0: $tType]:((X0 > tree @ X0 > $o))).
% 2.08/0.67 thf(func_def_30, type, is_heap: !>[X0: $tType]:((tree @ X0 > $o))).
% 2.08/0.67 thf(func_def_31, type, multiset2: !>[X0: $tType]:((tree @ X0 > multiset @ X0))).
% 2.08/0.67 thf(func_def_32, type, val: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.67 thf(func_def_33, type, lattic929149872er_Max: !>[X0: $tType]:((set @ X0 > X0))).
% 2.08/0.67 thf(func_def_34, type, add_mset: !>[X0: $tType]:((X0 > multiset @ X0 > multiset @ X0))).
% 2.08/0.67 thf(func_def_35, type, comm_monoid_sum_mset: !>[X0: $tType]:(((X0 > X0 > X0) > X0 > multiset @ X0 > X0))).
% 2.08/0.67 thf(func_def_36, type, fold_mset: !>[X0: $tType, X1: $tType]:(((X0 > X1 > X1) > X1 > multiset @ X0 > X1))).
% 2.08/0.67 thf(func_def_37, type, image_mset: !>[X0: $tType, X1: $tType]:(((X0 > X1) > multiset @ X0 > multiset @ X1))).
% 2.08/0.67 thf(func_def_38, type, mult: !>[X0: $tType]:((set @ product_prod @ X0 @ X0 > set @ product_prod @ multiset @ X0 @ multiset @ X0))).
% 2.08/0.67 thf(func_def_39, type, mult1: !>[X0: $tType]:((set @ product_prod @ X0 @ X0 > set @ product_prod @ multiset @ X0 @ multiset @ X0))).
% 2.08/0.67 thf(func_def_40, type, multp: !>[X0: $tType]:(((X0 > X0 > $o) > multiset @ X0 > multiset @ X0 > $o))).
% 2.08/0.67 thf(func_def_41, type, set_mset: !>[X0: $tType]:((multiset @ X0 > set @ X0))).
% 2.08/0.67 thf(func_def_42, type, subseteq_mset: !>[X0: $tType]:((multiset @ X0 > multiset @ X0 > $o))).
% 2.08/0.67 thf(func_def_43, type, ord_less_eq: !>[X0: $tType]:((X0 > X0 > $o))).
% 2.08/0.67 thf(func_def_44, type, antimono: !>[X0: $tType, X1: $tType]:(((X0 > X0 > $o) > (X0 > X1) > $o))).
% 2.08/0.67 thf(func_def_45, type, order_Greatest: !>[X0: $tType]:(((X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_46, type, product_Pair: !>[X0: $tType, X1: $tType]:((X0 > X1 > product_prod @ X0 @ X1))).
% 2.08/0.67 thf(func_def_47, type, produc2004651681e_prod: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1 > X2) > product_prod @ X0 @ X1 > X2))).
% 2.08/0.67 thf(func_def_48, type, product_rec_prod: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1 > X2) > product_prod @ X0 @ X1 > X2))).
% 2.08/0.67 thf(func_def_49, type, irrefl: !>[X0: $tType]:((set @ product_prod @ X0 @ X0 > $o))).
% 2.08/0.67 thf(func_def_50, type, trans: !>[X0: $tType]:((set @ product_prod @ X0 @ X0 > $o))).
% 2.08/0.67 thf(func_def_51, type, collection: !>[X0: $tType, X1: $tType]:((X0 > (X0 > $o) > (list @ X1 > X0) > (X0 > multiset @ X1) > $o))).
% 2.08/0.67 thf(func_def_52, type, set2: !>[X0: $tType, X1: $tType]:(((X0 > multiset @ X1) > X0 > set @ X1))).
% 2.08/0.67 thf(func_def_53, type, removeMax: !>[X0: $tType, X1: $tType]:((X0 > (X0 > $o) > (list @ X1 > X0) > (X0 > multiset @ X1) > (X0 > product_prod @ X1 @ X0) > (X0 > $o) > $o))).
% 2.08/0.67 thf(func_def_54, type, removeMax_axioms: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (list @ X1 > X0) > (X0 > multiset @ X1) > (X0 > product_prod @ X1 @ X0) > (X0 > $o) > $o))).
% 2.08/0.67 thf(func_def_55, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 2.08/0.67 thf(func_def_56, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 2.08/0.67 thf(func_def_57, type, l: tree @ a).
% 2.08/0.67 thf(func_def_58, type, l1: tree @ a).
% 2.08/0.67 thf(func_def_59, type, la: tree @ a).
% 2.08/0.67 thf(func_def_60, type, r: tree @ a).
% 2.08/0.67 thf(func_def_61, type, r1: tree @ a).
% 2.08/0.67 thf(func_def_62, type, ra: tree @ a).
% 2.08/0.67 thf(func_def_63, type, t2: tree @ a).
% 2.08/0.67 thf(func_def_64, type, v: a).
% 2.08/0.67 thf(func_def_65, type, v1: a).
% 2.08/0.67 thf(func_def_66, type, v2: a).
% 2.08/0.67 thf(func_def_67, type, va: a).
% 2.08/0.67 thf(func_def_71, type, db1: !>[X0: $tType]:(X0)).
% 2.08/0.67 thf(func_def_72, type, db0: !>[X0: $tType]:(X0)).
% 2.08/0.67 thf(func_def_73, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 2.08/0.67 thf(func_def_74, type, vAND: ($o > $o > $o)).
% 2.08/0.67 thf(func_def_75, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 2.08/0.67 thf(func_def_76, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 2.08/0.67 thf(func_def_77, type, vIMP: ($o > $o > $o)).
% 2.08/0.67 thf(func_def_78, type, db3: !>[X0: $tType]:(X0)).
% 2.08/0.67 thf(func_def_79, type, db2: !>[X0: $tType]:(X0)).
% 2.08/0.67 thf(func_def_80, type, vNOT: ($o > $o)).
% 2.08/0.67 thf(func_def_81, type, db7: !>[X0: $tType]:(X0)).
% 2.08/0.67 thf(func_def_82, type, db4: !>[X0: $tType]:(X0)).
% 2.08/0.67 thf(func_def_83, type, db5: !>[X0: $tType]:(X0)).
% 2.08/0.67 thf(func_def_84, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 2.08/0.67 thf(func_def_85, type, sP0: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > product_prod @ X0 @ X1) > (X1 > tree @ X0) > $o))).
% 2.08/0.67 thf(func_def_86, type, sP1: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > product_prod @ X0 @ X1) > (X1 > tree @ X0) > $o))).
% 2.08/0.67 thf(func_def_87, type, sP2: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > product_prod @ X1 @ X0) > (X0 > $o) > $o))).
% 2.08/0.67 thf(func_def_88, type, sP3: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 2.08/0.67 thf(func_def_89, type, sP4: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 2.08/0.67 thf(func_def_90, type, sK5: !>[X0: $tType]:((multiset @ X0 > X0 > multiset @ X0))).
% 2.08/0.67 thf(func_def_91, type, sK6: !>[X0: $tType]:((X0 > X0 > X0))).
% 2.08/0.67 thf(func_def_92, type, sK7: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.67 thf(func_def_93, type, sK8: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_94, type, sK9: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.67 thf(func_def_95, type, sK10: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_96, type, sK11: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_97, type, sK12: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_98, type, sK13: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.67 thf(func_def_99, type, sK14: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_100, type, sK15: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_101, type, sK16: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.67 thf(func_def_102, type, sK17: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.67 thf(func_def_103, type, sK18: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.67 thf(func_def_104, type, sK19: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_105, type, sK20: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.67 thf(func_def_106, type, sK21: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_107, type, sK22: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.67 thf(func_def_108, type, sK23: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType]:((product_prod @ X3 @ product_prod @ X1 @ product_prod @ X4 @ product_prod @ X2 @ X0 > X3))).
% 2.08/0.67 thf(func_def_109, type, sK24: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType]:((product_prod @ X3 @ product_prod @ X1 @ product_prod @ X4 @ product_prod @ X2 @ X0 > X4))).
% 2.08/0.67 thf(func_def_110, type, sK25: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType]:((product_prod @ X3 @ product_prod @ X1 @ product_prod @ X4 @ product_prod @ X2 @ X0 > X2))).
% 2.08/0.67 thf(func_def_111, type, sK26: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType]:((product_prod @ X3 @ product_prod @ X1 @ product_prod @ X4 @ product_prod @ X2 @ X0 > X0))).
% 2.08/0.67 thf(func_def_112, type, sK27: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType]:((product_prod @ X3 @ product_prod @ X1 @ product_prod @ X4 @ product_prod @ X2 @ X0 > X1))).
% 2.08/0.67 thf(func_def_113, type, sK28: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType, X6: $tType]:(((product_prod @ X0 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X5 @ product_prod @ X3 @ product_prod @ X1 @ X6 > $o) > X6))).
% 2.08/0.67 thf(func_def_114, type, sK29: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType, X6: $tType]:(((product_prod @ X0 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X5 @ product_prod @ X3 @ product_prod @ X1 @ X6 > $o) > X5))).
% 2.08/0.67 thf(func_def_115, type, sK30: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType, X6: $tType]:(((product_prod @ X0 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X5 @ product_prod @ X3 @ product_prod @ X1 @ X6 > $o) > X1))).
% 2.08/0.67 thf(func_def_116, type, sK31: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType, X6: $tType]:(((product_prod @ X0 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X5 @ product_prod @ X3 @ product_prod @ X1 @ X6 > $o) > X2))).
% 2.08/0.67 thf(func_def_117, type, sK32: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType, X6: $tType]:(((product_prod @ X0 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X5 @ product_prod @ X3 @ product_prod @ X1 @ X6 > $o) > X3))).
% 2.08/0.67 thf(func_def_118, type, sK33: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType, X6: $tType]:(((product_prod @ X0 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X5 @ product_prod @ X3 @ product_prod @ X1 @ X6 > $o) > X0))).
% 2.08/0.67 thf(func_def_119, type, sK34: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType, X6: $tType]:(((product_prod @ X0 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X5 @ product_prod @ X3 @ product_prod @ X1 @ X6 > $o) > X4))).
% 2.08/0.67 thf(func_def_120, type, sK35: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_121, type, sK36: !>[X0: $tType, X1: $tType]:(((product_prod @ X0 @ X1 > $o) > X0))).
% 2.08/0.67 thf(func_def_122, type, sK37: !>[X0: $tType, X1: $tType]:(((product_prod @ X0 @ X1 > $o) > X1))).
% 2.08/0.67 thf(func_def_123, type, sK38: !>[X0: $tType, X1: $tType]:((multiset @ X1 > (X1 > X0) > (X1 > X0) > X1))).
% 2.08/0.67 thf(func_def_124, type, sK39: !>[X0: $tType, X1: $tType]:((multiset @ X0 > multiset @ X1 > (X1 > X0) > X0 > X1))).
% 2.08/0.67 thf(func_def_125, type, sK40: !>[X0: $tType, X1: $tType]:((multiset @ X0 > multiset @ X1 > (X1 > X0) > X0 > multiset @ X1))).
% 2.08/0.67 thf(func_def_126, type, sK41: !>[X0: $tType]:((set @ product_prod @ X0 @ X0 > X0))).
% 2.08/0.67 thf(func_def_127, type, sK42: !>[X0: $tType, X1: $tType]:(((tree @ X1 > tree @ X0 > $o) > (X1 > X0 > $o) > tree @ X1))).
% 2.08/0.67 thf(func_def_128, type, sK43: !>[X0: $tType, X1: $tType]:(((tree @ X1 > tree @ X0 > $o) > (X1 > X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_129, type, sK44: !>[X0: $tType, X1: $tType]:(((tree @ X1 > tree @ X0 > $o) > (X1 > X0 > $o) > tree @ X1))).
% 2.08/0.67 thf(func_def_130, type, sK45: !>[X0: $tType, X1: $tType]:(((tree @ X1 > tree @ X0 > $o) > (X1 > X0 > $o) > X1))).
% 2.08/0.67 thf(func_def_131, type, sK46: !>[X0: $tType, X1: $tType]:(((tree @ X1 > tree @ X0 > $o) > (X1 > X0 > $o) > tree @ X0))).
% 2.08/0.67 thf(func_def_132, type, sK47: !>[X0: $tType, X1: $tType]:(((tree @ X1 > tree @ X0 > $o) > (X1 > X0 > $o) > tree @ X0))).
% 2.08/0.67 thf(func_def_133, type, sK48: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_134, type, sK49: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType]:((product_prod @ X3 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X5 @ product_prod @ X1 @ X0 > X5))).
% 2.08/0.67 thf(func_def_135, type, sK50: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType]:((product_prod @ X3 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X5 @ product_prod @ X1 @ X0 > X4))).
% 2.08/0.67 thf(func_def_136, type, sK51: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType]:((product_prod @ X3 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X5 @ product_prod @ X1 @ X0 > X3))).
% 2.08/0.67 thf(func_def_137, type, sK52: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType]:((product_prod @ X3 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X5 @ product_prod @ X1 @ X0 > X1))).
% 2.08/0.67 thf(func_def_138, type, sK53: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType]:((product_prod @ X3 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X5 @ product_prod @ X1 @ X0 > X0))).
% 2.08/0.67 thf(func_def_139, type, sK54: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType]:((product_prod @ X3 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X5 @ product_prod @ X1 @ X0 > X2))).
% 2.08/0.67 thf(func_def_140, type, sK55: !>[X0: $tType, X1: $tType]:((multiset @ X1 > (X1 > X0) > (X1 > X0) > multiset @ X1 > X1))).
% 2.08/0.67 thf(func_def_141, type, sK56: !>[X0: $tType, X1: $tType]:((multiset @ X1 > (X1 > X0) > (X1 > X0) > multiset @ X1 > X1))).
% 2.08/0.67 thf(func_def_142, type, sK57: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_143, type, sK58: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.67 thf(func_def_144, type, sK59: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_145, type, sK60: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_146, type, sK61: !>[X0: $tType]:((X0 > tree @ X0 > X0))).
% 2.08/0.67 thf(func_def_147, type, sK62: !>[X0: $tType]:((X0 > tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_148, type, sK63: !>[X0: $tType]:((X0 > tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_149, type, sK64: !>[X0: $tType]:((set @ product_prod @ X0 @ X0 > X0))).
% 2.08/0.67 thf(func_def_150, type, sK65: !>[X0: $tType]:((set @ product_prod @ X0 @ X0 > X0))).
% 2.08/0.67 thf(func_def_151, type, sK66: !>[X0: $tType]:((set @ product_prod @ X0 @ X0 > X0))).
% 2.08/0.67 thf(func_def_152, type, sK67: !>[X0: $tType]:((multiset @ X0 > multiset @ X0))).
% 2.08/0.67 thf(func_def_153, type, sK68: !>[X0: $tType]:((multiset @ X0 > X0))).
% 2.08/0.67 thf(func_def_154, type, sK69: !>[X0: $tType]:((multiset @ X0 > multiset @ X0 > X0 > set @ product_prod @ X0 @ X0 > multiset @ X0))).
% 2.08/0.67 thf(func_def_155, type, sK70: !>[X0: $tType]:((multiset @ X0 > multiset @ X0 > X0 > set @ product_prod @ X0 @ X0 > multiset @ X0))).
% 2.08/0.67 thf(func_def_156, type, sK71: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 2.08/0.67 thf(func_def_157, type, sK72: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 2.08/0.67 thf(func_def_158, type, sK73: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > product_prod @ X0 @ X1) > (X1 > tree @ X0) > X1))).
% 2.08/0.67 thf(func_def_159, type, sK74: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > product_prod @ X0 @ X1) > (X1 > tree @ X0) > X0))).
% 2.08/0.67 thf(func_def_160, type, sK75: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > product_prod @ X0 @ X1) > (X1 > tree @ X0) > X1))).
% 2.08/0.67 thf(func_def_161, type, sK76: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > product_prod @ X0 @ X1) > (X1 > tree @ X0) > X1))).
% 2.08/0.67 thf(func_def_162, type, sK77: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > product_prod @ X0 @ X1) > (X1 > tree @ X0) > X0))).
% 2.08/0.67 thf(func_def_163, type, sK78: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > product_prod @ X0 @ X1) > (X1 > tree @ X0) > X1))).
% 2.08/0.67 thf(func_def_164, type, sK79: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > tree @ X1) > X0))).
% 2.08/0.67 thf(func_def_165, type, sK80: !>[X0: $tType, X1: $tType]:(((list @ X1 > X0) > (X0 > tree @ X1) > list @ X1))).
% 2.08/0.67 thf(func_def_166, type, sK81: !>[X0: $tType, X1: $tType]:(((X0 > multiset @ X1) > (X0 > tree @ X1) > X0))).
% 2.08/0.67 thf(func_def_167, type, sK82: !>[X0: $tType, X1: $tType]:(((X0 > multiset @ X1) > (X0 > $o) > (X0 > product_prod @ X1 @ X0) > X0))).
% 2.08/0.67 thf(func_def_168, type, sK83: !>[X0: $tType, X1: $tType]:(((X0 > multiset @ X1) > (X0 > $o) > (X0 > product_prod @ X1 @ X0) > X1))).
% 2.08/0.67 thf(func_def_169, type, sK84: !>[X0: $tType, X1: $tType]:(((X0 > multiset @ X1) > (X0 > $o) > (X0 > product_prod @ X1 @ X0) > X0))).
% 2.08/0.67 thf(func_def_170, type, sK85: !>[X0: $tType]:(((multiset @ X0 > $o) > multiset @ X0))).
% 2.08/0.67 thf(func_def_171, type, sK86: !>[X0: $tType]:(((multiset @ X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_172, type, sK87: !>[X0: $tType, X1: $tType]:(((multiset @ X1 > X0) > multiset @ X1))).
% 2.08/0.67 thf(func_def_173, type, sK88: !>[X0: $tType, X1: $tType]:(((multiset @ X1 > X0) > multiset @ X1))).
% 2.08/0.67 thf(func_def_174, type, sK89: !>[X0: $tType]:(((multiset @ X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_175, type, sK90: !>[X0: $tType]:(((multiset @ X0 > $o) > multiset @ X0))).
% 2.08/0.67 thf(func_def_176, type, sK91: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType]:(((product_prod @ X0 @ product_prod @ X1 @ product_prod @ X3 @ product_prod @ X2 @ X4 > $o) > X1))).
% 2.08/0.67 thf(func_def_177, type, sK92: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType]:(((product_prod @ X0 @ product_prod @ X1 @ product_prod @ X3 @ product_prod @ X2 @ X4 > $o) > X2))).
% 2.08/0.67 thf(func_def_178, type, sK93: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType]:(((product_prod @ X0 @ product_prod @ X1 @ product_prod @ X3 @ product_prod @ X2 @ X4 > $o) > X4))).
% 2.08/0.67 thf(func_def_179, type, sK94: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType]:(((product_prod @ X0 @ product_prod @ X1 @ product_prod @ X3 @ product_prod @ X2 @ X4 > $o) > X0))).
% 2.08/0.67 thf(func_def_180, type, sK95: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType]:(((product_prod @ X0 @ product_prod @ X1 @ product_prod @ X3 @ product_prod @ X2 @ X4 > $o) > X3))).
% 2.08/0.67 thf(func_def_181, type, sK96: !>[X0: $tType]:(((X0 > X0 > $o) > set @ product_prod @ X0 @ X0 > X0))).
% 2.08/0.67 thf(func_def_182, type, sK97: !>[X0: $tType]:(((X0 > X0 > $o) > set @ product_prod @ X0 @ X0 > X0))).
% 2.08/0.67 thf(func_def_183, type, sK98: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType, X6: $tType]:((product_prod @ X0 @ product_prod @ X6 @ product_prod @ X5 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X3 @ X1 > X6))).
% 2.08/0.67 thf(func_def_184, type, sK99: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType, X6: $tType]:((product_prod @ X0 @ product_prod @ X6 @ product_prod @ X5 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X3 @ X1 > X2))).
% 2.08/0.67 thf(func_def_185, type, sK100: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType, X6: $tType]:((product_prod @ X0 @ product_prod @ X6 @ product_prod @ X5 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X3 @ X1 > X1))).
% 2.08/0.67 thf(func_def_186, type, sK101: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType, X6: $tType]:((product_prod @ X0 @ product_prod @ X6 @ product_prod @ X5 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X3 @ X1 > X0))).
% 2.08/0.67 thf(func_def_187, type, sK102: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType, X6: $tType]:((product_prod @ X0 @ product_prod @ X6 @ product_prod @ X5 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X3 @ X1 > X4))).
% 2.08/0.67 thf(func_def_188, type, sK103: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType, X6: $tType]:((product_prod @ X0 @ product_prod @ X6 @ product_prod @ X5 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X3 @ X1 > X3))).
% 2.08/0.67 thf(func_def_189, type, sK104: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType, X6: $tType]:((product_prod @ X0 @ product_prod @ X6 @ product_prod @ X5 @ product_prod @ X4 @ product_prod @ X2 @ product_prod @ X3 @ X1 > X5))).
% 2.08/0.67 thf(func_def_190, type, sK105: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_191, type, sK106: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > tree @ X1 > tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_192, type, sK107: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > tree @ X1 > tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_193, type, sK108: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > tree @ X1 > tree @ X0 > X0))).
% 2.08/0.67 thf(func_def_194, type, sK109: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > tree @ X1 > tree @ X0 > tree @ X1))).
% 2.08/0.67 thf(func_def_195, type, sK110: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > tree @ X1 > tree @ X0 > tree @ X1))).
% 2.08/0.67 thf(func_def_196, type, sK111: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > tree @ X1 > tree @ X0 > X1))).
% 2.08/0.67 thf(func_def_197, type, sK112: !>[X0: $tType, X1: $tType]:((multiset @ X1 > (X1 > multiset @ X0) > (X1 > multiset @ X0) > X1))).
% 2.08/0.67 thf(func_def_198, type, sK113: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 2.08/0.67 thf(func_def_199, type, sK114: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 2.08/0.67 thf(func_def_200, type, sK115: !>[X0: $tType]:(((multiset @ X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_201, type, sK116: !>[X0: $tType]:(((multiset @ X0 > $o) > multiset @ X0))).
% 2.08/0.67 thf(func_def_202, type, sK117: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType]:(((product_prod @ X2 @ product_prod @ X0 @ product_prod @ X4 @ product_prod @ X1 @ product_prod @ X3 @ X5 > $o) > X3))).
% 2.08/0.67 thf(func_def_203, type, sK118: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType]:(((product_prod @ X2 @ product_prod @ X0 @ product_prod @ X4 @ product_prod @ X1 @ product_prod @ X3 @ X5 > $o) > X2))).
% 2.08/0.67 thf(func_def_204, type, sK119: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType]:(((product_prod @ X2 @ product_prod @ X0 @ product_prod @ X4 @ product_prod @ X1 @ product_prod @ X3 @ X5 > $o) > X5))).
% 2.08/0.67 thf(func_def_205, type, sK120: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType]:(((product_prod @ X2 @ product_prod @ X0 @ product_prod @ X4 @ product_prod @ X1 @ product_prod @ X3 @ X5 > $o) > X1))).
% 2.08/0.67 thf(func_def_206, type, sK121: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType]:(((product_prod @ X2 @ product_prod @ X0 @ product_prod @ X4 @ product_prod @ X1 @ product_prod @ X3 @ X5 > $o) > X0))).
% 2.08/0.67 thf(func_def_207, type, sK122: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType, X4: $tType, X5: $tType]:(((product_prod @ X2 @ product_prod @ X0 @ product_prod @ X4 @ product_prod @ X1 @ product_prod @ X3 @ X5 > $o) > X4))).
% 2.08/0.67 thf(func_def_208, type, sK123: !>[X0: $tType, X1: $tType]:(((X0 > X1) > multiset @ X1 > multiset @ X0 > X0 > multiset @ X1))).
% 2.08/0.67 thf(func_def_209, type, sK124: !>[X0: $tType]:(((X0 > $o) > X0 > X0))).
% 2.08/0.67 thf(func_def_210, type, sK125: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_211, type, sK126: !>[X0: $tType]:(((tree @ X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_212, type, sK127: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 2.08/0.67 thf(func_def_213, type, sK128: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 2.08/0.67 thf(func_def_214, type, sK129: !>[X0: $tType]:((multiset @ X0 > set @ product_prod @ X0 @ X0 > multiset @ X0 > X0))).
% 2.08/0.67 thf(func_def_215, type, sK130: !>[X0: $tType]:((multiset @ X0 > set @ product_prod @ X0 @ X0 > multiset @ X0 > multiset @ X0))).
% 2.08/0.67 thf(func_def_216, type, sK131: !>[X0: $tType]:((multiset @ X0 > set @ product_prod @ X0 @ X0 > multiset @ X0 > X0))).
% 2.08/0.67 thf(func_def_217, type, sK132: !>[X0: $tType]:((multiset @ X0 > set @ product_prod @ X0 @ X0 > multiset @ X0 > multiset @ X0))).
% 2.08/0.67 thf(func_def_218, type, sK133: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((product_prod @ X3 @ product_prod @ X1 @ product_prod @ X0 @ X2 > $o) > X2))).
% 2.08/0.67 thf(func_def_219, type, sK134: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((product_prod @ X3 @ product_prod @ X1 @ product_prod @ X0 @ X2 > $o) > X3))).
% 2.08/0.67 thf(func_def_220, type, sK135: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((product_prod @ X3 @ product_prod @ X1 @ product_prod @ X0 @ X2 > $o) > X0))).
% 2.08/0.67 thf(func_def_221, type, sK136: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((product_prod @ X3 @ product_prod @ X1 @ product_prod @ X0 @ X2 > $o) > X1))).
% 2.08/0.67 thf(func_def_222, type, sK137: !>[X0: $tType, X1: $tType]:(((X0 > X1) > (X0 > X1) > X0))).
% 2.08/0.67 thf(func_def_223, type, sK138: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_224, type, sK139: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > product_prod @ X1 @ X0) > (X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_225, type, sK140: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > product_prod @ X1 @ X0) > (X0 > $o) > X1))).
% 2.08/0.67 thf(func_def_226, type, sK141: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > product_prod @ X1 @ X0) > (X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_227, type, sK142: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > product_prod @ X1 @ X0) > (X0 > multiset @ X1) > (X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_228, type, sK143: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > product_prod @ X1 @ X0) > (X0 > multiset @ X1) > (X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_229, type, sK144: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > product_prod @ X1 @ X0) > (X0 > multiset @ X1) > (X0 > $o) > X1))).
% 2.08/0.67 thf(func_def_230, type, sK145: !>[X0: $tType, X1: $tType]:(((list @ X1 > X0) > (X0 > $o) > list @ X1))).
% 2.08/0.67 thf(func_def_231, type, sK146: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > product_prod @ X1 @ X0) > (X0 > multiset @ X1) > (X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_232, type, sK147: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > product_prod @ X1 @ X0) > (X0 > multiset @ X1) > (X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_233, type, sK148: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > product_prod @ X1 @ X0) > (X0 > multiset @ X1) > (X0 > $o) > X1))).
% 2.08/0.67 thf(func_def_234, type, sK149: !>[X0: $tType]:((multiset @ X0 > multiset @ X0 > set @ product_prod @ X0 @ X0 > multiset @ X0))).
% 2.08/0.67 thf(func_def_235, type, sK150: !>[X0: $tType]:((multiset @ X0 > multiset @ X0 > set @ product_prod @ X0 @ X0 > multiset @ X0))).
% 2.08/0.67 thf(func_def_236, type, sK151: !>[X0: $tType]:((multiset @ X0 > multiset @ X0 > set @ product_prod @ X0 @ X0 > multiset @ X0))).
% 2.08/0.67 thf(func_def_237, type, sK152: !>[X0: $tType]:((X0 > multiset @ X0 > multiset @ X0 > set @ product_prod @ X0 @ X0 > X0))).
% 2.08/0.67 thf(func_def_238, type, sK153: !>[X0: $tType, X1: $tType, X2: $tType]:((product_prod @ X1 @ product_prod @ X0 @ X2 > X0))).
% 2.08/0.67 thf(func_def_239, type, sK154: !>[X0: $tType, X1: $tType, X2: $tType]:((product_prod @ X1 @ product_prod @ X0 @ X2 > X2))).
% 2.08/0.67 thf(func_def_240, type, sK155: !>[X0: $tType, X1: $tType, X2: $tType]:((product_prod @ X1 @ product_prod @ X0 @ X2 > X1))).
% 2.08/0.67 thf(func_def_241, type, sK156: !>[X0: $tType, X1: $tType]:((product_prod @ X0 @ X1 > X1))).
% 2.08/0.67 thf(func_def_242, type, sK157: !>[X0: $tType, X1: $tType]:((product_prod @ X0 @ X1 > X0))).
% 2.08/0.67 thf(func_def_243, type, sK158: !>[X0: $tType]:((multiset @ X0 > X0))).
% 2.08/0.67 thf(func_def_244, type, sK159: !>[X0: $tType]:((X0 > multiset @ multiset @ X0 > multiset @ X0))).
% 2.08/0.67 thf(func_def_245, type, sK160: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > (X1 > X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_246, type, sK161: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > (X1 > X0 > $o) > X1))).
% 2.08/0.67 thf(func_def_247, type, sK162: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 2.08/0.67 thf(func_def_248, type, sK163: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 2.08/0.67 thf(func_def_249, type, sK164: !>[X0: $tType, X1: $tType]:(((multiset @ X0 > X1) > multiset @ X0))).
% 2.08/0.67 thf(func_def_250, type, sK165: !>[X0: $tType, X1: $tType]:(((multiset @ X0 > X1) > multiset @ X0))).
% 2.08/0.67 thf(func_def_251, type, sK166: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:((product_prod @ X2 @ product_prod @ X3 @ product_prod @ X1 @ X0 > X1))).
% 2.08/0.67 thf(func_def_252, type, sK167: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:((product_prod @ X2 @ product_prod @ X3 @ product_prod @ X1 @ X0 > X2))).
% 2.08/0.67 thf(func_def_253, type, sK168: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:((product_prod @ X2 @ product_prod @ X3 @ product_prod @ X1 @ X0 > X0))).
% 2.08/0.67 thf(func_def_254, type, sK169: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:((product_prod @ X2 @ product_prod @ X3 @ product_prod @ X1 @ X0 > X3))).
% 2.08/0.67 thf(func_def_255, type, sK170: !>[X0: $tType, X1: $tType]:(((X1 > X0) > multiset @ X1 > (X1 > X0) > X1))).
% 2.08/0.67 thf(func_def_256, type, sK171: !>[X0: $tType, X1: $tType]:(((product_prod @ X1 @ X0 > $o) > X0))).
% 2.08/0.67 thf(func_def_257, type, sK172: !>[X0: $tType, X1: $tType]:(((product_prod @ X1 @ X0 > $o) > X1))).
% 2.08/0.67 thf(func_def_258, type, sK173: !>[X0: $tType, X1: $tType, X2: $tType]:(((product_prod @ X0 @ product_prod @ X1 @ X2 > $o) > X0))).
% 2.08/0.67 thf(func_def_259, type, sK174: !>[X0: $tType, X1: $tType, X2: $tType]:(((product_prod @ X0 @ product_prod @ X1 @ X2 > $o) > X1))).
% 2.08/0.67 thf(func_def_260, type, sK175: !>[X0: $tType, X1: $tType, X2: $tType]:(((product_prod @ X0 @ product_prod @ X1 @ X2 > $o) > X2))).
% 2.08/0.67 thf(func_def_261, type, sK176: !>[X0: $tType, X1: $tType]:(((multiset @ X0 > multiset @ X1 > $o) > multiset @ X0))).
% 2.08/0.67 thf(func_def_262, type, sK177: !>[X0: $tType, X1: $tType]:(((multiset @ X0 > multiset @ X1 > $o) > multiset @ X1))).
% 2.08/0.67 thf(func_def_263, type, sK178: !>[X0: $tType, X1: $tType]:(((multiset @ X0 > multiset @ X1 > $o) > X1))).
% 2.08/0.67 thf(func_def_264, type, sK179: !>[X0: $tType, X1: $tType]:(((multiset @ X0 > multiset @ X1 > $o) > multiset @ X1))).
% 2.08/0.67 thf(func_def_265, type, sK180: !>[X0: $tType, X1: $tType]:(((multiset @ X0 > multiset @ X1 > $o) > X0))).
% 2.08/0.67 thf(func_def_266, type, sK181: !>[X0: $tType, X1: $tType]:(((multiset @ X0 > multiset @ X1 > $o) > multiset @ X0))).
% 2.08/0.67 thf(func_def_267, type, sK182: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 2.08/0.67 thf(func_def_268, type, sK183: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 2.08/0.67 thf(func_def_269, type, sK184: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 2.08/0.67 thf(func_def_270, type, sK185: !>[X0: $tType, X1: $tType]:((product_prod @ X1 @ X0 > X0))).
% 2.08/0.67 thf(func_def_271, type, sK186: !>[X0: $tType, X1: $tType]:((product_prod @ X1 @ X0 > X1))).
% 2.08/0.67 thf(func_def_272, type, sK187: !>[X0: $tType]:((multiset @ X0 > multiset @ X0))).
% 2.08/0.67 thf(func_def_273, type, sK188: !>[X0: $tType]:((multiset @ X0 > X0))).
% 2.08/0.67 thf(func_def_274, type, sK189: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_275, type, sK190: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.67 thf(func_def_276, type, sK191: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.67 thf(func_def_277, type, sK192: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.67 thf(func_def_278, type, sK193: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.67 thf(func_def_279, type, sK194: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.68 thf(func_def_280, type, sK195: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.68 thf(func_def_281, type, sK196: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.68 thf(func_def_282, type, sK197: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.68 thf(func_def_283, type, sK198: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.68 thf(func_def_284, type, sK199: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.68 thf(func_def_285, type, sK200: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.68 thf(func_def_286, type, sK201: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.68 thf(func_def_287, type, sK202: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 2.08/0.68 thf(func_def_288, type, sK203: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.68 thf(func_def_289, type, sK204: !>[X0: $tType]:((tree @ X0 > X0))).
% 2.08/0.68 thf(func_def_290, type, sK205: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 2.08/0.68 thf(func_def_291, type, sK206: !>[X0: $tType]:((multiset @ multiset @ X0 > multiset @ X0))).
% 2.08/0.68 thf(func_def_292, type, sK207: !>[X0: $tType]:((multiset @ X0 > X0 > multiset @ X0 > X0 > multiset @ X0))).
% 2.08/0.68 thf(func_def_293, type, sK208: !>[X0: $tType]:((X0 > set @ product_prod @ X0 @ X0 > multiset @ X0 > X0))).
% 2.08/0.68 thf(func_def_294, type, sK209: !>[X0: $tType]:((X0 > multiset @ X0 > multiset @ X0))).
% 2.08/0.68 thf(func_def_295, type, sK210: !>[X0: $tType, X1: $tType]:((set @ product_prod @ X0 @ X1 > set @ product_prod @ X0 @ X1 > X0))).
% 2.08/0.68 thf(func_def_296, type, sK211: !>[X0: $tType, X1: $tType]:((set @ product_prod @ X0 @ X1 > set @ product_prod @ X0 @ X1 > X1))).
% 2.08/0.68 thf(func_def_297, type, sK212: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 2.08/0.68 thf(func_def_298, type, sK213: !>[X0: $tType]:((multiset @ X0 > (multiset @ X0 > $o) > X0))).
% 2.08/0.68 thf(func_def_299, type, sK214: !>[X0: $tType]:((multiset @ X0 > (multiset @ X0 > $o) > multiset @ X0))).
% 2.08/0.68 thf(func_def_300, type, sK215: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 2.08/0.68 thf(func_def_301, type, sK216: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 2.08/0.68 thf(func_def_302, type, sK217: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 2.08/0.68 thf(func_def_303, type, sK218: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 2.08/0.68 thf(f1,axiom,(
% 2.08/0.68 (is_heap @ a @ ra)),
% 2.08/0.68 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0__C4_Oprems_C_I2_J)).
% 2.08/0.68 thf(f5,axiom,(
% 2.08/0.68 (ord_less_eq @ a @ v1 @ v2)),
% 2.08/0.68 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4_True)).
% 2.08/0.68 thf(f6,axiom,(
% 2.08/0.68 (((t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1))) = ((t @ a @ va @ la @ ra)))),
% 2.08/0.68 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_5__C4_Oprems_C_I3_J)).
% 2.08/0.68 thf(f23,axiom,(
% 2.08/0.68 ! [X0 : $tType,X3 : tree @ X0,X2 : tree @ X0,X1 : X0] : (((val @ X0 @ (t @ X0 @ X1 @ X2 @ X3))) = X1)),
% 2.08/0.68 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_22_val_Osimps)).
% 2.08/0.68 thf(f31,axiom,(
% 2.08/0.68 ! [X0 : $tType] : (linorder @ X0 => ! [X2 : tree @ X0,X1 : X0,X3 : tree @ X0,X4 : X0] : (((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X1 @ X2 @ X3)) @ X4) => (((heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X1 @ X2 @ X3)))) = ((t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X1 @ X2 @ X3))))) & (~(ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X1 @ X2 @ X3)) @ X4) => (((heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X1 @ X2 @ X3)))) = ((t @ X0 @ (val @ X0 @ (t @ X0 @ X1 @ X2 @ X3)) @ e @ X0 @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X1 @ X2 @ X3)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X1 @ X2 @ X3))))))))))),
% 2.08/0.68 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_30_siftDown_Osimps_I4_J)).
% 2.08/0.68 thf(f33,axiom,(
% 2.08/0.68 ! [X0 : $tType] : (linorder @ X0 => ! [X3 : tree @ X0,X2 : X0,X1 : X0,X4 : tree @ X0] : (((is_heap @ X0 @ (t @ X0 @ X1 @ e @ X0 @ (t @ X0 @ X2 @ X3 @ X4)))) = (ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X3 @ X4)) @ X1) & (is_heap @ X0 @ (t @ X0 @ X2 @ X3 @ X4))))),
% 2.08/0.68 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_32_is__heap_Osimps_I3_J)).
% 2.08/0.68 thf(f35,axiom,(
% 2.08/0.68 ! [X0 : $tType,X1 : X0,X3 : tree @ X0,X2 : tree @ X0] : (((heapIm1434396069_right @ X0 @ (t @ X0 @ X1 @ X2 @ X3))) = X3)),
% 2.08/0.68 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_34_right_Osimps)).
% 2.08/0.68 thf(f276,axiom,(
% 2.08/0.68 linorder @ a),
% 2.08/0.68 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tfree_0)).
% 2.08/0.68 thf(f277,conjecture,(
% 2.08/0.68 (is_heap @ a @ (heapIm748920189ftDown @ a @ (t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1))))),
% 2.08/0.68 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0)).
% 2.08/0.68 thf(f278,negated_conjecture,(
% 2.08/0.68 ~(is_heap @ a @ (heapIm748920189ftDown @ a @ (t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1))))),
% 2.08/0.68 inference(negated_conjecture,[status(cth)],[f277])).
% 2.08/0.68 thf(f386,plain,(
% 2.08/0.68 ~(is_heap @ a @ (heapIm748920189ftDown @ a @ (t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1))))),
% 2.08/0.68 inference(rectify,[],[f278])).
% 2.08/0.68 thf(f387,plain,(
% 2.08/0.68 ~ (((is_heap @ a @ (heapIm748920189ftDown @ a @ (t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1))))) = $true)),
% 2.08/0.68 inference(fool_elimination,[],[f386])).
% 2.08/0.68 thf(f443,plain,(
% 2.08/0.68 ! [X0 : $tType] : (linorder @ X0 => ! [X1 : tree @ X0,X2 : X0,X3 : X0,X4 : tree @ X0] : (((is_heap @ X0 @ (t @ X0 @ X3 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X4)))) = (ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X4)) @ X3) & (is_heap @ X0 @ (t @ X0 @ X2 @ X1 @ X4))))),
% 2.08/0.68 inference(rectify,[],[f33])).
% 2.08/0.68 thf(f444,plain,(
% 2.08/0.68 ! [X0 : $tType] : ((linorder @ X0 = $true) => ! [X4 : tree @ X0,X2 : X0,X1 : tree @ X0,X3 : X0] : ((((is_heap @ X0 @ (t @ X0 @ X3 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X4)))) = $true) <=> ((((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X4)) @ X3)) = $true) & (((is_heap @ X0 @ (t @ X0 @ X2 @ X1 @ X4))) = $true))))),
% 2.08/0.68 inference(fool_elimination,[],[f443])).
% 2.08/0.68 thf(f555,plain,(
% 2.08/0.68 (ord_less_eq @ a @ v1 @ v2)),
% 2.08/0.68 inference(rectify,[],[f5])).
% 2.08/0.68 thf(f556,plain,(
% 2.08/0.68 (((ord_less_eq @ a @ v1 @ v2)) = $true)),
% 2.08/0.68 inference(fool_elimination,[],[f555])).
% 2.08/0.68 thf(f575,plain,(
% 2.08/0.68 linorder @ a),
% 2.08/0.68 inference(rectify,[],[f276])).
% 2.08/0.68 thf(f576,plain,(
% 2.08/0.68 (linorder @ a = $true)),
% 2.08/0.68 inference(fool_elimination,[],[f575])).
% 2.08/0.68 thf(f622,plain,(
% 2.08/0.68 ! [X0 : $tType] : (linorder @ X0 => ! [X1 : tree @ X0,X2 : X0,X3 : tree @ X0,X4 : X0] : (((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ X4) => (((heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X3)))) = ((t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X3))))) & (~(ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ X4) => (((heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X3)))) = ((t @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ e @ X0 @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X2 @ X1 @ X3))))))))))),
% 2.08/0.68 inference(rectify,[],[f31])).
% 2.08/0.68 thf(f623,plain,(
% 2.08/0.68 ! [X0 : $tType] : ((linorder @ X0 = $true) => ! [X1 : tree @ X0,X2 : X0,X3 : tree @ X0,X4 : X0] : ((($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ X4))) => (((heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X3)))) = ((t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X3))))) & (~ ($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ X4))) => (((heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X3)))) = ((t @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ e @ X0 @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X2 @ X1 @ X3))))))))))),
% 2.08/0.68 inference(fool_elimination,[],[f622])).
% 2.08/0.68 thf(f726,plain,(
% 2.08/0.68 (is_heap @ a @ ra)),
% 2.08/0.68 inference(rectify,[],[f1])).
% 2.08/0.68 thf(f727,plain,(
% 2.08/0.68 (((is_heap @ a @ ra)) = $true)),
% 2.08/0.68 inference(fool_elimination,[],[f726])).
% 2.08/0.68 thf(f757,plain,(
% 2.08/0.68 (((is_heap @ a @ (heapIm748920189ftDown @ a @ (t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1))))) != $true)),
% 2.08/0.68 inference(flattening,[],[f387])).
% 2.08/0.68 thf(f761,plain,(
% 2.08/0.68 ! [X0 : $tType,X3 : tree @ X0,X1 : X0,X2 : tree @ X0] : (((heapIm1434396069_right @ X0 @ (t @ X0 @ X1 @ X3 @ X2))) = X2)),
% 2.08/0.68 inference(rectify,[],[f35])).
% 2.08/0.68 thf(f794,plain,(
% 2.08/0.68 ! [X0 : $tType,X3 : X0,X2 : tree @ X0,X1 : tree @ X0] : (((val @ X0 @ (t @ X0 @ X3 @ X2 @ X1))) = X3)),
% 2.08/0.68 inference(rectify,[],[f23])).
% 2.08/0.68 thf(f795,plain,(
% 2.08/0.68 ! [X0 : $tType] : ((linorder @ X0 = $true) => ! [X1 : tree @ X0,X4 : X0,X3 : tree @ X0,X2 : X0] : ((($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ X4))) => (((heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X3)))) = ((t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X3))))) & (($true != ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ X4))) => (((heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X3)))) = ((t @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ e @ X0 @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X2 @ X1 @ X3))))))))))),
% 2.08/0.68 inference(flattening,[],[f623])).
% 2.08/0.68 thf(f885,plain,(
% 2.08/0.68 ! [X0 : $tType] : ((linorder @ X0 != $true) | ! [X3 : tree @ X0,X2 : X0,X1 : tree @ X0,X4 : X0] : ((($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ X4))) | (((heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X3)))) = ((t @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ e @ X0 @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X2 @ X1 @ X3)))))))) & ((((heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X3)))) = ((t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X3)))) | ($true != ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X3)) @ X4))))))),
% 2.08/0.68 inference(ennf_transformation,[],[f795])).
% 2.08/0.68 thf(f1064,plain,(
% 2.08/0.68 ! [X0 : $tType] : ((linorder @ X0 != $true) | ! [X4 : tree @ X0,X2 : X0,X1 : tree @ X0,X3 : X0] : ((((is_heap @ X0 @ (t @ X0 @ X3 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X4)))) = $true) <=> ((((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X4)) @ X3)) = $true) & (((is_heap @ X0 @ (t @ X0 @ X2 @ X1 @ X4))) = $true))))),
% 2.08/0.68 inference(ennf_transformation,[],[f444])).
% 2.08/0.68 thf(f1094,plain,(
% 2.08/0.68 ! [X0 : $tType,X1 : X0,X2 : tree @ X0,X3 : tree @ X0] : (((val @ X0 @ (t @ X0 @ X1 @ X2 @ X3))) = X1)),
% 2.08/0.68 inference(rectify,[],[f794])).
% 2.08/0.68 thf(f1246,plain,(
% 2.08/0.68 ! [X0 : $tType] : ((linorder @ X0 != $true) | ! [X4 : tree @ X0,X2 : X0,X1 : tree @ X0,X3 : X0] : (((((is_heap @ X0 @ (t @ X0 @ X3 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X4)))) = $true) | ((((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X4)) @ X3)) != $true) | (((is_heap @ X0 @ (t @ X0 @ X2 @ X1 @ X4))) != $true))) & (((((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X4)) @ X3)) = $true) & (((is_heap @ X0 @ (t @ X0 @ X2 @ X1 @ X4))) = $true)) | (((is_heap @ X0 @ (t @ X0 @ X3 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X4)))) != $true))))),
% 2.08/0.68 inference(nnf_transformation,[],[f1064])).
% 2.08/0.68 thf(f1247,plain,(
% 2.08/0.68 ! [X0 : $tType] : ((linorder @ X0 != $true) | ! [X4 : tree @ X0,X2 : X0,X1 : tree @ X0,X3 : X0] : (((((is_heap @ X0 @ (t @ X0 @ X3 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X4)))) = $true) | (((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X4)) @ X3)) != $true) | (((is_heap @ X0 @ (t @ X0 @ X2 @ X1 @ X4))) != $true)) & (((((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X1 @ X4)) @ X3)) = $true) & (((is_heap @ X0 @ (t @ X0 @ X2 @ X1 @ X4))) = $true)) | (((is_heap @ X0 @ (t @ X0 @ X3 @ e @ X0 @ (t @ X0 @ X2 @ X1 @ X4)))) != $true))))),
% 2.08/0.68 inference(flattening,[],[f1246])).
% 2.08/0.68 thf(f1248,plain,(
% 2.08/0.68 ! [X0 : $tType] : ((linorder @ X0 != $true) | ! [X1 : tree @ X0,X2 : X0,X3 : tree @ X0,X4 : X0] : ((($true = ((is_heap @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X3 @ X1))))) | (((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X3 @ X1)) @ X4)) != $true) | (((is_heap @ X0 @ (t @ X0 @ X2 @ X3 @ X1))) != $true)) & (((((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X3 @ X1)) @ X4)) = $true) & (((is_heap @ X0 @ (t @ X0 @ X2 @ X3 @ X1))) = $true)) | ($true != ((is_heap @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X3 @ X1))))))))),
% 2.08/0.68 inference(rectify,[],[f1247])).
% 2.08/0.68 thf(f1249,plain,(
% 2.08/0.68 ! [X0 : $tType] : ((linorder @ X0 != $true) | ! [X1 : tree @ X0,X2 : X0,X3 : tree @ X0,X4 : X0] : (((((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X3 @ X1)) @ X4)) = $true) | (((heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X3 @ X1)))) = ((t @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X3 @ X1)) @ e @ X0 @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X2 @ X3 @ X1)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X2 @ X3 @ X1)))))))) & ((((t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X3 @ X1))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X3 @ X1))))) | (((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X3 @ X1)) @ X4)) != $true))))),
% 2.08/0.68 inference(rectify,[],[f885])).
% 2.08/0.68 thf(f1289,plain,(
% 2.08/0.68 ! [X0 : $tType,X1 : tree @ X0,X2 : X0,X3 : tree @ X0] : (((heapIm1434396069_right @ X0 @ (t @ X0 @ X2 @ X1 @ X3))) = X3)),
% 2.08/0.68 inference(rectify,[],[f761])).
% 2.08/0.68 thf(f1406,plain,(
% 2.08/0.68 ( ! [X0 : $tType,X2 : tree @ X0,X3 : tree @ X0,X1 : X0] : ((((val @ X0 @ (t @ X0 @ X1 @ X2 @ X3))) = X1)) )),
% 2.08/0.68 inference(cnf_transformation,[],[f1094])).
% 2.08/0.68 thf(f1421,plain,(
% 2.08/0.68 (((is_heap @ a @ (heapIm748920189ftDown @ a @ (t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1))))) != $true)),
% 2.08/0.68 inference(cnf_transformation,[],[f757])).
% 2.08/0.68 thf(f1424,plain,(
% 2.08/0.68 (((ord_less_eq @ a @ v1 @ v2)) = $true)),
% 2.08/0.68 inference(cnf_transformation,[],[f556])).
% 2.08/0.68 thf(f1620,plain,(
% 2.08/0.68 ( ! [X0 : $tType,X2 : X0,X3 : tree @ X0,X1 : tree @ X0,X4 : X0] : (($true != ((is_heap @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X3 @ X1))))) | (linorder @ X0 != $true) | (((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X3 @ X1)) @ X4)) = $true)) )),
% 2.08/0.68 inference(cnf_transformation,[],[f1248])).
% 2.08/0.68 thf(f1621,plain,(
% 2.08/0.68 ( ! [X0 : $tType,X2 : X0,X3 : tree @ X0,X1 : tree @ X0,X4 : X0] : (($true = ((is_heap @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X3 @ X1))))) | (linorder @ X0 != $true) | (((is_heap @ X0 @ (t @ X0 @ X2 @ X3 @ X1))) != $true) | (((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X3 @ X1)) @ X4)) != $true)) )),
% 2.08/0.68 inference(cnf_transformation,[],[f1248])).
% 2.08/0.68 thf(f1622,plain,(
% 2.08/0.68 ( ! [X0 : $tType,X2 : X0,X3 : tree @ X0,X1 : tree @ X0,X4 : X0] : ((((t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X3 @ X1))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X4 @ e @ X0 @ (t @ X0 @ X2 @ X3 @ X1))))) | (linorder @ X0 != $true) | (((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X2 @ X3 @ X1)) @ X4)) != $true)) )),
% 2.08/0.68 inference(cnf_transformation,[],[f1249])).
% 2.08/0.68 thf(f1681,plain,(
% 2.08/0.68 ( ! [X0 : $tType,X2 : X0,X3 : tree @ X0,X1 : tree @ X0] : ((((heapIm1434396069_right @ X0 @ (t @ X0 @ X2 @ X1 @ X3))) = X3)) )),
% 2.08/0.68 inference(cnf_transformation,[],[f1289])).
% 2.08/0.68 thf(f1779,plain,(
% 2.08/0.68 (((t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1))) = ((t @ a @ va @ la @ ra)))),
% 2.08/0.68 inference(cnf_transformation,[],[f6])).
% 2.08/0.68 thf(f1852,plain,(
% 2.08/0.68 (((is_heap @ a @ ra)) = $true)),
% 2.08/0.68 inference(cnf_transformation,[],[f727])).
% 2.08/0.68 thf(f1868,plain,(
% 2.08/0.68 (linorder @ a = $true)),
% 2.08/0.68 inference(cnf_transformation,[],[f576])).
% 2.08/0.68 thf(f2001,definition,(
% 2.08/0.68 spl219_3 <=> (((t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1))) = ((t @ a @ va @ la @ ra)))),
% 2.08/0.68 introduced(definition,[new_symbols(definition,[spl219_3])],[avatar_definition])).
% 2.08/0.68 thf(f2003,plain,(
% 2.08/0.68 (((t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1))) = ((t @ a @ va @ la @ ra))) | ~spl219_3),
% 2.08/0.68 inference(avatar_component_clause,[],[f2001])).
% 2.08/0.68 thf(f2004,plain,(
% 2.08/0.68 spl219_3),
% 2.08/0.68 inference(avatar_split_clause,[],[f1779,f2001])).
% 2.08/0.68 thf(f2011,definition,(
% 2.08/0.68 spl219_5 <=> (((ord_less_eq @ a @ v1 @ v2)) = $true)),
% 2.08/0.68 introduced(definition,[new_symbols(definition,[spl219_5])],[avatar_definition])).
% 2.08/0.68 thf(f2013,plain,(
% 2.08/0.68 (((ord_less_eq @ a @ v1 @ v2)) = $true) | ~spl219_5),
% 2.08/0.68 inference(avatar_component_clause,[],[f2011])).
% 2.08/0.68 thf(f2014,plain,(
% 2.08/0.68 spl219_5),
% 2.08/0.68 inference(avatar_split_clause,[],[f1424,f2011])).
% 2.08/0.68 thf(f2033,definition,(
% 2.08/0.68 spl219_10 <=> (((is_heap @ a @ ra)) = $true)),
% 2.08/0.68 introduced(definition,[new_symbols(definition,[spl219_10])],[avatar_definition])).
% 2.08/0.68 thf(f2036,plain,(
% 2.08/0.68 spl219_10),
% 2.08/0.68 inference(avatar_split_clause,[],[f1852,f2033])).
% 2.08/0.68 thf(f2048,definition,(
% 2.08/0.68 spl219_13 <=> (linorder @ a = $true)),
% 2.08/0.68 introduced(definition,[new_symbols(definition,[spl219_13])],[avatar_definition])).
% 2.08/0.68 thf(f2050,plain,(
% 2.08/0.68 (linorder @ a = $true) | ~spl219_13),
% 2.08/0.68 inference(avatar_component_clause,[],[f2048])).
% 2.08/0.68 thf(f2051,plain,(
% 2.08/0.68 spl219_13),
% 2.08/0.68 inference(avatar_split_clause,[],[f1868,f2048])).
% 2.08/0.68 thf(f2058,definition,(
% 2.08/0.68 spl219_15 <=> (((is_heap @ a @ (heapIm748920189ftDown @ a @ (t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1))))) = $true)),
% 2.08/0.68 introduced(definition,[new_symbols(definition,[spl219_15])],[avatar_definition])).
% 2.08/0.68 thf(f2060,plain,(
% 2.08/0.68 (((is_heap @ a @ (heapIm748920189ftDown @ a @ (t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1))))) != $true) | spl219_15),
% 2.08/0.68 inference(avatar_component_clause,[],[f2058])).
% 2.08/0.68 thf(f2061,plain,(
% 2.08/0.68 ~spl219_15),
% 2.08/0.68 inference(avatar_split_clause,[],[f1421,f2058])).
% 2.08/0.68 thf(f2285,plain,(
% 2.08/0.68 (((is_heap @ a @ (t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1)))) != $true) | (((ord_less_eq @ a @ (val @ a @ (t @ a @ v1 @ l1 @ r1)) @ v2)) != $true) | (linorder @ a != $true) | spl219_15),
% 2.08/0.68 inference(superposition,[],[f2060,f1622])).
% 2.08/0.68 thf(f2288,plain,(
% 2.08/0.68 (linorder @ a != $true) | (((is_heap @ a @ (t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1)))) != $true) | spl219_15),
% 2.08/0.68 inference(forward_subsumption_resolution,[],[f2285,f1620])).
% 2.08/0.68 thf(f2290,plain,(
% 2.08/0.68 (((is_heap @ a @ (t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1)))) != $true) | (~spl219_13 | spl219_15)),
% 2.08/0.68 inference(forward_subsumption_resolution,[],[f2288,f2050])).
% 2.08/0.68 thf(f2292,definition,(
% 2.08/0.68 spl219_18 <=> (((is_heap @ a @ (t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1)))) = $true)),
% 2.08/0.68 introduced(definition,[new_symbols(definition,[spl219_18])],[avatar_definition])).
% 2.08/0.68 thf(f2294,plain,(
% 2.08/0.68 (((is_heap @ a @ (t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1)))) != $true) | spl219_18),
% 2.08/0.68 inference(avatar_component_clause,[],[f2292])).
% 2.08/0.68 thf(f2295,plain,(
% 2.08/0.68 ~spl219_18 | ~spl219_13 | spl219_15),
% 2.08/0.68 inference(avatar_split_clause,[],[f2290,f2058,f2048,f2292])).
% 2.08/0.68 thf(f2462,plain,(
% 2.08/0.68 (linorder @ a != $true) | (((ord_less_eq @ a @ (val @ a @ (t @ a @ v1 @ l1 @ r1)) @ v2)) != $true) | (((is_heap @ a @ (t @ a @ v1 @ l1 @ r1))) != $true) | ($true != $true) | spl219_18),
% 2.08/0.68 inference(superposition,[],[f2294,f1621])).
% 2.08/0.68 thf(f2463,plain,(
% 2.08/0.68 (linorder @ a != $true) | (((ord_less_eq @ a @ (val @ a @ (t @ a @ v1 @ l1 @ r1)) @ v2)) != $true) | (((is_heap @ a @ (t @ a @ v1 @ l1 @ r1))) != $true) | spl219_18),
% 2.08/0.68 inference(trivial_inequality_removal,[],[f2462])).
% 2.08/0.68 thf(f2464,plain,(
% 2.08/0.68 (((ord_less_eq @ a @ (val @ a @ (t @ a @ v1 @ l1 @ r1)) @ v2)) != $true) | (((is_heap @ a @ (t @ a @ v1 @ l1 @ r1))) != $true) | (~spl219_13 | spl219_18)),
% 2.08/0.68 inference(forward_subsumption_resolution,[],[f2463,f2050])).
% 2.08/0.68 thf(f2467,definition,(
% 2.08/0.68 spl219_20 <=> (((is_heap @ a @ (t @ a @ v1 @ l1 @ r1))) = $true)),
% 2.08/0.68 introduced(definition,[new_symbols(definition,[spl219_20])],[avatar_definition])).
% 2.08/0.68 thf(f3718,plain,(
% 2.08/0.68 (ra = ((heapIm1434396069_right @ a @ (t @ a @ v2 @ e @ a @ (t @ a @ v1 @ l1 @ r1))))) | ~spl219_3),
% 2.08/0.68 inference(superposition,[],[f1681,f2003])).
% 2.08/0.68 thf(f3730,plain,(
% 2.08/0.68 (ra = ((t @ a @ v1 @ l1 @ r1))) | ~spl219_3),
% 2.08/0.68 inference(forward_demodulation,[],[f3718,f1681])).
% 2.08/0.68 thf(f3739,definition,(
% 2.08/0.68 spl219_77 <=> (ra = ((t @ a @ v1 @ l1 @ r1)))),
% 2.08/0.68 introduced(definition,[new_symbols(definition,[spl219_77])],[avatar_definition])).
% 2.08/0.68 thf(f3742,plain,(
% 2.08/0.68 spl219_77 | ~spl219_3),
% 2.08/0.68 inference(avatar_split_clause,[],[f3730,f2001,f3739])).
% 2.08/0.68 thf(f3757,definition,(
% 2.08/0.68 (ra != ((t @ a @ v1 @ l1 @ r1))) | (((is_heap @ a @ ra)) != $true) | (((is_heap @ a @ (t @ a @ v1 @ l1 @ r1))) = $true)),
% 2.08/0.68 introduced(theory,[theory_tautology_sat_conflict])).
% 2.08/0.68 thf(f3759,plain,(
% 2.08/0.68 (((is_heap @ a @ (t @ a @ v1 @ l1 @ r1))) != $true) | (((ord_less_eq @ a @ v1 @ v2)) != $true) | (~spl219_13 | spl219_18)),
% 2.08/0.68 inference(forward_demodulation,[],[f2464,f1406])).
% 2.08/0.68 thf(f3763,plain,(
% 2.08/0.68 (((is_heap @ a @ (t @ a @ v1 @ l1 @ r1))) != $true) | (~spl219_5 | ~spl219_13 | spl219_18)),
% 2.08/0.68 inference(forward_subsumption_resolution,[],[f3759,f2013])).
% 2.08/0.68 thf(f3765,plain,(
% 2.08/0.68 ~spl219_20 | ~spl219_5 | ~spl219_13 | spl219_18),
% 2.08/0.68 inference(avatar_split_clause,[],[f3763,f2292,f2048,f2011,f2467])).
% 2.08/0.68 cnf(s3, plain, spl219_3, inference(sat_conversion,[],[f2004])).
% 2.08/0.68 cnf(s5, plain, spl219_5, inference(sat_conversion,[],[f2014])).
% 2.08/0.68 cnf(s8, plain, spl219_10, inference(sat_conversion,[],[f2036])).
% 2.08/0.68 cnf(s11, plain, spl219_13, inference(sat_conversion,[],[f2051])).
% 2.08/0.68 cnf(s13, plain, ~spl219_15, inference(sat_conversion,[],[f2061])).
% 2.08/0.68 cnf(s16, plain, ~spl219_13 | spl219_15 | ~spl219_18, inference(sat_conversion,[],[f2295])).
% 2.08/0.68 cnf(s31, plain, ~spl219_3 | spl219_77, inference(sat_conversion,[],[f3742])).
% 2.08/0.68 cnf(s32, plain, ~spl219_10 | spl219_20 | ~spl219_77, inference(sat_conversion,[],[f3757])).
% 2.08/0.68 cnf(s34, plain, ~spl219_5 | ~spl219_13 | spl219_18 | ~spl219_20, inference(sat_conversion,[],[f3765])).
% 2.08/0.68 cnf(s35, plain, ~spl219_18, inference(rat,[],[s16,s13,s11])).
% 2.08/0.68 cnf(s36, plain, ~spl219_20, inference(rat,[],[s34,s35,s11,s5])).
% 2.08/0.68 cnf(s38, plain, ~spl219_77, inference(rat,[],[s32,s8,s36])).
% 2.08/0.68 cnf(s39, plain, ~spl219_3, inference(rat,[],[s31,s38])).
% 2.08/0.68 cnf(s40, plain, $false, inference(rat,[],[s3,s39])).
% 2.08/0.68 thf(f3766,plain,(
% 2.08/0.68 $false),
% 2.08/0.68 inference(avatar_sat_refutation,[],[s40])).
% 2.08/0.68 % SZS output end Proof for theBenchmark
% 2.08/0.68 % (3121457)------------------------------
% 2.08/0.68 % (3121457)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.68 % (3121457)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.68 % (3121457)CaDiCaL version: 2.1.3
% 2.08/0.68 % (3121457)Termination reason: Refutation
% 2.08/0.68 % (3121457)Time elapsed: 0.306 s
% 2.08/0.68 % (3121457)Peak memory usage: 16 MB
% 2.08/0.68 % (3121457)Instructions burned: 605 (million)
% 2.08/0.68 % (3121449)Success in time 0.367 s
% 2.08/0.68 % Vampire exiting
%------------------------------------------------------------------------------