%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP070^2 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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 0.36s 0.27s
% Output : Refutation 0.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : ITP070^2 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 19:46:18 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.13 Running higher-order theorem proving
% 0.08/0.16 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.36/0.25 % (596114)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.36/0.25 % (596133)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.36/0.25 % (596133)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.36/0.25 % (596128)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=4241467192:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.36/0.25 % (596127)lrs+10_16_si=on:nwc=1.5:random_seed=3611351291:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.36/0.25 % (596126)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2605660975:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.36/0.25 % (596133)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=3696524287:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.36/0.25 % (596131)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2171514080:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.36/0.25 % (596132)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=372277004:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.36/0.25 % (596130)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=3627567260: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.36/0.25 % (596128)Instruction limit reached!
% 0.36/0.25 % (596128)------------------------------
% 0.36/0.25 % (596128)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.25 % (596128)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.25 % (596128)CaDiCaL version: 2.1.3
% 0.36/0.25 % (596128)Termination reason: Instruction limit
% 0.36/0.25 % (596128)Termination phase: shuffling
% 0.36/0.25 % (596128)Time elapsed: 0.002 s
% 0.36/0.25 % (596128)Peak memory usage: 10 MB
% 0.36/0.25 % (596128)Instructions burned: 7 (million)
% 0.36/0.25 % (596127)Instruction limit reached!
% 0.36/0.25 % (596127)------------------------------
% 0.36/0.25 % (596127)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.25 % (596127)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.25 % (596127)CaDiCaL version: 2.1.3
% 0.36/0.25 % (596127)Termination reason: Instruction limit
% 0.36/0.25 % (596127)Termination phase: shuffling
% 0.36/0.25 % (596127)Time elapsed: 0.005 s
% 0.36/0.25 % (596127)Peak memory usage: 10 MB
% 0.36/0.25 % (596127)Instructions burned: 21 (million)
% 0.36/0.25 % (596131)Instruction limit reached!
% 0.36/0.25 % (596131)------------------------------
% 0.36/0.25 % (596131)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.25 % (596131)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.25 % (596131)CaDiCaL version: 2.1.3
% 0.36/0.25 % (596131)Termination reason: Instruction limit
% 0.36/0.25 % (596131)Termination phase: shuffling
% 0.36/0.25 % (596131)Time elapsed: 0.007 s
% 0.36/0.25 % (596131)Peak memory usage: 10 MB
% 0.36/0.25 % (596131)Instructions burned: 24 (million)
% 0.36/0.25 % (596145)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=699428469:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.36/0.25 % (596147)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=2327084805:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.36/0.25 % (596145)Instruction limit reached!
% 0.36/0.25 % (596145)------------------------------
% 0.36/0.25 % (596145)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.25 % (596145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.25 % (596145)CaDiCaL version: 2.1.3
% 0.36/0.25 % (596145)Termination reason: Instruction limit
% 0.36/0.25 % (596145)Termination phase: shuffling
% 0.36/0.25 % (596145)Time elapsed: 0.003 s
% 0.36/0.25 % (596145)Peak memory usage: 10 MB
% 0.36/0.25 % (596145)Instructions burned: 11 (million)
% 0.36/0.25 % (596149)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.36/0.27 % (596147)Instruction limit reached!
% 0.36/0.27 % (596147)------------------------------
% 0.36/0.27 % (596147)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596147)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596147)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596147)Termination reason: Instruction limit
% 0.36/0.27 % (596147)Termination phase: shuffling
% 0.36/0.27 % (596147)Time elapsed: 0.002 s
% 0.36/0.27 % (596147)Peak memory usage: 10 MB
% 0.36/0.27 % (596147)Instructions burned: 8 (million)
% 0.36/0.27 % (596149)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=2718673249:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.36/0.27 % (596132)Instruction limit reached!
% 0.36/0.27 % (596132)------------------------------
% 0.36/0.27 % (596132)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596132)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596132)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596132)Termination reason: Instruction limit
% 0.36/0.27 % (596132)Termination phase: Preprocessing 3
% 0.36/0.27 % (596132)Time elapsed: 0.021 s
% 0.36/0.27 % (596132)Peak memory usage: 12 MB
% 0.36/0.27 % (596132)Instructions burned: 82 (million)
% 0.36/0.27 % (596126)Instruction limit reached!
% 0.36/0.27 % (596126)------------------------------
% 0.36/0.27 % (596126)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596126)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596126)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596126)Termination reason: Instruction limit
% 0.36/0.27 % (596126)Termination phase: Preprocessing 3
% 0.36/0.27 % (596126)Time elapsed: 0.022 s
% 0.36/0.27 % (596126)Peak memory usage: 12 MB
% 0.36/0.27 % (596126)Instructions burned: 89 (million)
% 0.36/0.27 % (596149)Instruction limit reached!
% 0.36/0.27 % (596149)------------------------------
% 0.36/0.27 % (596149)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596149)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596149)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596149)Termination reason: Instruction limit
% 0.36/0.27 % (596149)Termination phase: shuffling
% 0.36/0.27 % (596149)Time elapsed: 0.005 s
% 0.36/0.27 % (596149)Peak memory usage: 10 MB
% 0.36/0.27 % (596149)Instructions burned: 21 (million)
% 0.36/0.27 % (596160)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.36/0.27 % (596160)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.36/0.27 % (596157)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=2276406630:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.36/0.27 % (596160)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=2875257631:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 0.36/0.27 % (596161)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=2886519507:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.36/0.27 % (596162)lrs+10_1_si=on:cs=on:random_seed=1125649140:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.36/0.27 % (596165)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 0.36/0.27 % (596157)Instruction limit reached!
% 0.36/0.27 % (596157)------------------------------
% 0.36/0.27 % (596157)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596157)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596157)Termination reason: Instruction limit
% 0.36/0.27 % (596157)Termination phase: shuffling
% 0.36/0.27 % (596157)Time elapsed: 0.004 s
% 0.36/0.27 % (596157)Peak memory usage: 10 MB
% 0.36/0.27 % (596157)Instructions burned: 15 (million)
% 0.36/0.27 % (596165)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=1660179267:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.36/0.27 % (596162)Instruction limit reached!
% 0.36/0.27 % (596162)------------------------------
% 0.36/0.27 % (596162)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596162)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596162)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596162)Termination reason: Instruction limit
% 0.36/0.27 % (596162)Termination phase: shuffling
% 0.36/0.27 % (596162)Time elapsed: 0.003 s
% 0.36/0.27 % (596162)Peak memory usage: 10 MB
% 0.36/0.27 % (596162)Instructions burned: 12 (million)
% 0.36/0.27 % (596165)Instruction limit reached!
% 0.36/0.27 % (596165)------------------------------
% 0.36/0.27 % (596165)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596165)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596165)Termination reason: Instruction limit
% 0.36/0.27 % (596165)Termination phase: shuffling
% 0.36/0.27 % (596165)Time elapsed: 0.001 s
% 0.36/0.27 % (596165)Peak memory usage: 10 MB
% 0.36/0.27 % (596165)Instructions burned: 3 (million)
% 0.36/0.27 % (596160)Instruction limit reached!
% 0.36/0.27 % (596160)------------------------------
% 0.36/0.27 % (596160)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596160)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596160)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596160)Termination reason: Instruction limit
% 0.36/0.27 % (596160)Termination phase: shuffling
% 0.36/0.27 % (596160)Time elapsed: 0.007 s
% 0.36/0.27 % (596160)Peak memory usage: 11 MB
% 0.36/0.27 % (596160)Instructions burned: 28 (million)
% 0.36/0.27 % (596170)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=2071571310:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/38Mi)
% 0.36/0.27 % (596172)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=844552857:st=2:i=249:sd=1:rtra=on:ss=axioms_2999 on theBenchmark for (2999ds/249Mi)
% 0.36/0.27 % (596133)Instruction limit reached!
% 0.36/0.27 % (596133)------------------------------
% 0.36/0.27 % (596133)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596133)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596133)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596133)Termination reason: Instruction limit
% 0.36/0.27 % (596133)Termination phase: Saturation
% 0.36/0.27 % (596133)Time elapsed: 0.046 s
% 0.36/0.27 % (596133)Peak memory usage: 14 MB
% 0.36/0.27 % (596133)Instructions burned: 157 (million)
% 0.36/0.27 % (596174)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=1119988404:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/25Mi)
% 0.36/0.27 % (596175)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=3289724533:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2999 on theBenchmark for (2999ds/14Mi)
% 0.36/0.27 % (596161)Instruction limit reached!
% 0.36/0.27 % (596161)------------------------------
% 0.36/0.27 % (596161)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596161)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596161)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596161)Termination reason: Instruction limit
% 0.36/0.27 % (596161)Termination phase: Preprocessing 1
% 0.36/0.27 % (596161)Time elapsed: 0.020 s
% 0.36/0.27 % (596161)Peak memory usage: 11 MB
% 0.36/0.27 % (596161)Instructions burned: 86 (million)
% 0.36/0.27 % (596175)Instruction limit reached!
% 0.36/0.27 % (596175)------------------------------
% 0.36/0.27 % (596175)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596175)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596175)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596175)Termination reason: Instruction limit
% 0.36/0.27 % (596175)Termination phase: shuffling
% 0.36/0.27 % (596175)Time elapsed: 0.004 s
% 0.36/0.27 % (596175)Peak memory usage: 10 MB
% 0.36/0.27 % (596175)Instructions burned: 17 (million)
% 0.36/0.27 % (596174)Instruction limit reached!
% 0.36/0.27 % (596174)------------------------------
% 0.36/0.27 % (596174)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596174)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596174)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596174)Termination reason: Instruction limit
% 0.36/0.27 % (596174)Termination phase: shuffling
% 0.36/0.27 % (596174)Time elapsed: 0.007 s
% 0.36/0.27 % (596174)Peak memory usage: 10 MB
% 0.36/0.27 % (596174)Instructions burned: 28 (million)
% 0.36/0.27 % (596170)Instruction limit reached!
% 0.36/0.27 % (596170)------------------------------
% 0.36/0.27 % (596170)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596170)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596170)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596170)Termination reason: Instruction limit
% 0.36/0.27 % (596170)Termination phase: Property scanning
% 0.36/0.27 % (596170)Time elapsed: 0.010 s
% 0.36/0.27 % (596170)Peak memory usage: 11 MB
% 0.36/0.27 % (596170)Instructions burned: 41 (million)
% 0.36/0.27 % (596184)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=2851103716:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2999 on theBenchmark for (2999ds/327Mi)
% 0.36/0.27 % (596186)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=1147066125:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/14Mi)
% 0.36/0.27 % (596187)ott+21_20_to=lpo:sil=128000:tgt=ground:si=on:sp=arity:lma=off:uwa=off:foolp=on:random_seed=1458442983:st=4:i=2:add=off:sd=3:nm=16:fsr=off:rtra=on:ss=axioms:sgt=8:ntd=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.36/0.27 % (596188)ott+1004_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=unary_frequency:cbe=off:uwa=off:nwc=1:random_seed=4122291732:i=26:ep=R:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/26Mi)
% 0.36/0.27 % (596189)dis+1002_16_sil=128000:si=on:sp=occurrence:random_seed=1965148940:cond=fast:i=23:hud=1:av=off:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/23Mi)
% 0.36/0.27 % (596187)Instruction limit reached!
% 0.36/0.27 % (596187)------------------------------
% 0.36/0.27 % (596187)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596187)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596187)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596187)Termination reason: Instruction limit
% 0.36/0.27 % (596187)Termination phase: shuffling
% 0.36/0.27 % (596187)Time elapsed: 0.003 s
% 0.36/0.27 % (596187)Peak memory usage: 10 MB
% 0.36/0.27 % (596187)Instructions burned: 14 (million)
% 0.36/0.27 % (596186)Instruction limit reached!
% 0.36/0.27 % (596186)------------------------------
% 0.36/0.27 % (596186)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596186)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596186)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596186)Termination reason: Instruction limit
% 0.36/0.27 % (596186)Termination phase: shuffling
% 0.36/0.27 % (596186)Time elapsed: 0.004 s
% 0.36/0.27 % (596186)Peak memory usage: 10 MB
% 0.36/0.27 % (596186)Instructions burned: 18 (million)
% 0.36/0.27 % (596189)Instruction limit reached!
% 0.36/0.27 % (596189)------------------------------
% 0.36/0.27 % (596189)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596189)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596189)Termination reason: Instruction limit
% 0.36/0.27 % (596189)Termination phase: shuffling
% 0.36/0.27 % (596189)Time elapsed: 0.006 s
% 0.36/0.27 % (596189)Peak memory usage: 10 MB
% 0.36/0.27 % (596189)Instructions burned: 26 (million)
% 0.36/0.27 % (596188)Instruction limit reached!
% 0.36/0.27 % (596188)------------------------------
% 0.36/0.27 % (596188)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.27 % (596188)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.27 % (596188)CaDiCaL version: 2.1.3
% 0.36/0.27 % (596188)Termination reason: Instruction limit
% 0.36/0.27 % (596188)Termination phase: shuffling
% 0.36/0.27 % (596188)Time elapsed: 0.006 s
% 0.36/0.27 % (596188)Peak memory usage: 11 MB
% 0.36/0.27 % (596188)Instructions burned: 26 (million)
% 0.36/0.27 % (596172) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-596114-596172"...
% 0.36/0.27 % (596172)...printing done.
% 0.36/0.27 % (596196)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
% 0.36/0.27 % (596196)WARNING Broken Constraint: if lrs_weight_limit_only(on) has been set then saturation_algorithm(otter) is equal to lrs
% 0.36/0.27 % (596172)Refutation found. Thanks to Tanya!
% 0.36/0.27 % SZS status Theorem for theBenchmark
% 0.36/0.27 % SZS output start Proof for theBenchmark
% 0.36/0.27 thf(type_def_5, type, product_prod: ($tType * $tType) > $tType).
% 0.36/0.27 thf(type_def_6, type, multiset: $tType > $tType).
% 0.36/0.27 thf(type_def_7, type, list: $tType > $tType).
% 0.36/0.27 thf(type_def_8, type, tree: $tType > $tType).
% 0.36/0.27 thf(type_def_9, type, set: $tType > $tType).
% 0.36/0.27 thf(type_def_10, type, a: $tType).
% 0.36/0.27 thf(type_def_11, type, sTfun: ($tType * $tType) > $tType).
% 0.36/0.27 thf(func_def_0, type, type: !>[X0: $tType]:($o)).
% 0.36/0.27 thf(func_def_1, type, ord: !>[X0: $tType]:($o)).
% 0.36/0.27 thf(func_def_2, type, order: !>[X0: $tType]:($o)).
% 0.36/0.27 thf(func_def_3, type, linorder: !>[X0: $tType]:($o)).
% 0.36/0.27 thf(func_def_4, type, preorder: !>[X0: $tType]:($o)).
% 0.36/0.27 thf(func_def_5, type, cancel1352612707id_add: !>[X0: $tType]:($o)).
% 0.36/0.27 thf(func_def_6, type, linord219039673up_add: !>[X0: $tType]:($o)).
% 0.36/0.27 thf(func_def_7, type, ordere216010020id_add: !>[X0: $tType]:($o)).
% 0.36/0.27 thf(func_def_8, type, ordere779506340up_add: !>[X0: $tType]:($o)).
% 0.36/0.27 thf(func_def_9, type, linord1659791738miring: !>[X0: $tType]:($o)).
% 0.36/0.27 thf(func_def_10, type, canoni770627133id_add: !>[X0: $tType]:($o)).
% 0.36/0.27 thf(func_def_11, type, ordere236663937imp_le: !>[X0: $tType]:($o)).
% 0.36/0.27 thf(func_def_12, type, unique1598680935umeral: !>[X0: $tType]:($o)).
% 0.36/0.27 thf(func_def_13, type, ordere516151231imp_le: !>[X0: $tType]:($o)).
% 0.36/0.27 thf(func_def_14, type, bNF_Ca1785829860lChain: !>[X0: $tType, X1: $tType]:((set @ product_prod @ X0 @ X0 > (X0 > X1) > $o))).
% 0.36/0.27 thf(func_def_15, type, unique455577585es_aux: !>[X0: $tType]:((product_prod @ X0 @ X0 > $o))).
% 0.36/0.27 thf(func_def_16, type, plus_plus: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.36/0.27 thf(func_def_17, type, zero_zero: !>[X0: $tType]:(X0)).
% 0.36/0.27 thf(func_def_18, type, heapIm818251801eapify: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_19, type, heapIm721255937_empty: !>[X0: $tType]:((tree @ X0 > $o))).
% 0.36/0.27 thf(func_def_20, type, heapIm874063447f_list: !>[X0: $tType]:((list @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_21, type, heapIm1271749598e_left: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_22, type, heapIm1912108042t_tree: !>[X0: $tType]:((list @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_23, type, heapIm970386777veLeaf: !>[X0: $tType]:((tree @ X0 > product_prod @ X0 @ tree @ X0))).
% 0.36/0.27 thf(func_def_24, type, heapIm1434396069_right: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_25, type, heapIm748920189ftDown: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_26, type, heap: !>[X0: $tType, X1: $tType]:((X0 > (X0 > $o) > (list @ X1 > X0) > (X0 > multiset @ X1) > (X0 > tree @ X1) > (X0 > product_prod @ X1 @ X0) > $o))).
% 0.36/0.27 thf(func_def_27, type, heap_axioms: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (list @ X1 > X0) > (X0 > multiset @ X1) > (X0 > tree @ X1) > (X0 > product_prod @ X1 @ X0) > $o))).
% 0.36/0.27 thf(func_def_28, type, e: !>[X0: $tType]:(tree @ X0)).
% 0.36/0.27 thf(func_def_29, type, t: !>[X0: $tType]:((X0 > tree @ X0 > tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_30, type, in_tree: !>[X0: $tType]:((X0 > tree @ X0 > $o))).
% 0.36/0.27 thf(func_def_31, type, is_heap: !>[X0: $tType]:((tree @ X0 > $o))).
% 0.36/0.27 thf(func_def_32, type, multiset2: !>[X0: $tType]:((tree @ X0 > multiset @ X0))).
% 0.36/0.27 thf(func_def_33, type, val: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_34, type, lattic929149872er_Max: !>[X0: $tType]:((set @ X0 > X0))).
% 0.36/0.27 thf(func_def_35, type, cons: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 0.36/0.27 thf(func_def_36, type, add_mset: !>[X0: $tType]:((X0 > multiset @ X0 > multiset @ X0))).
% 0.36/0.27 thf(func_def_37, type, is_empty: !>[X0: $tType]:((multiset @ X0 > $o))).
% 0.36/0.27 thf(func_def_38, type, set_mset: !>[X0: $tType]:((multiset @ X0 > set @ X0))).
% 0.36/0.27 thf(func_def_39, type, subseteq_mset: !>[X0: $tType]:((multiset @ X0 > multiset @ X0 > $o))).
% 0.36/0.27 thf(func_def_40, type, ord_less_eq: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.36/0.27 thf(func_def_41, type, order_Greatest: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.36/0.27 thf(func_def_42, type, product_Pair: !>[X0: $tType, X1: $tType]:((X0 > X1 > product_prod @ X0 @ X1))).
% 0.36/0.27 thf(func_def_43, type, produc2004651681e_prod: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1 > X2) > product_prod @ X0 @ X1 > X2))).
% 0.36/0.27 thf(func_def_44, type, product_rec_prod: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1 > X2) > product_prod @ X0 @ X1 > X2))).
% 0.36/0.27 thf(func_def_45, type, collection: !>[X0: $tType, X1: $tType]:((X0 > (X0 > $o) > (list @ X1 > X0) > (X0 > multiset @ X1) > $o))).
% 0.36/0.27 thf(func_def_46, type, set2: !>[X0: $tType, X1: $tType]:(((X0 > multiset @ X1) > X0 > set @ X1))).
% 0.36/0.27 thf(func_def_47, type, removeMax: !>[X0: $tType, X1: $tType]:((X0 > (X0 > $o) > (list @ X1 > X0) > (X0 > multiset @ X1) > (X0 > product_prod @ X1 @ X0) > (X0 > $o) > $o))).
% 0.36/0.27 thf(func_def_48, type, ssort: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > product_prod @ X1 @ X0) > X0 > list @ X1 > list @ X1))).
% 0.36/0.27 thf(func_def_49, type, ssort_dom: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (X0 > product_prod @ X1 @ X0) > product_prod @ X0 @ list @ X1 > $o))).
% 0.36/0.27 thf(func_def_50, type, removeMax_axioms: !>[X0: $tType, X1: $tType]:(((X0 > $o) > (list @ X1 > X0) > (X0 > multiset @ X1) > (X0 > product_prod @ X1 @ X0) > (X0 > $o) > $o))).
% 0.36/0.27 thf(func_def_51, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 0.36/0.27 thf(func_def_52, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 0.36/0.27 thf(func_def_53, type, l1: tree @ a).
% 0.36/0.27 thf(func_def_54, type, l2: tree @ a).
% 0.36/0.27 thf(func_def_55, type, r1: tree @ a).
% 0.36/0.27 thf(func_def_56, type, r2: tree @ a).
% 0.36/0.27 thf(func_def_57, type, v1: a).
% 0.36/0.27 thf(func_def_58, type, v2: a).
% 0.36/0.27 thf(func_def_59, type, v: a).
% 0.36/0.27 thf(func_def_63, type, vAND: ($o > $o > $o)).
% 0.36/0.27 thf(func_def_64, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.36/0.27 thf(func_def_65, type, vOR: ($o > $o > $o)).
% 0.36/0.27 thf(func_def_66, type, db1: !>[X0: $tType]:(X0)).
% 0.36/0.27 thf(func_def_67, type, db0: !>[X0: $tType]:(X0)).
% 0.36/0.27 thf(func_def_68, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.36/0.27 thf(func_def_69, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.36/0.27 thf(func_def_70, type, db2: !>[X0: $tType]:(X0)).
% 0.36/0.27 thf(func_def_71, type, db5: !>[X0: $tType]:(X0)).
% 0.36/0.27 thf(func_def_72, type, db4: !>[X0: $tType]:(X0)).
% 0.36/0.27 thf(func_def_73, type, db3: !>[X0: $tType]:(X0)).
% 0.36/0.27 thf(func_def_74, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.36/0.27 thf(func_def_75, type, vIMP: ($o > $o > $o)).
% 0.36/0.27 thf(func_def_76, type, vNOT: ($o > $o)).
% 0.36/0.27 thf(func_def_77, type, db7: !>[X0: $tType]:(X0)).
% 0.36/0.27 thf(func_def_78, type, sP0: !>[X0: $tType]:(((tree @ X0 > $o) > $o))).
% 0.36/0.27 thf(func_def_79, type, sP1: !>[X0: $tType]:(((tree @ X0 > $o) > $o))).
% 0.36/0.27 thf(func_def_80, type, sP2: !>[X0: $tType]:(((tree @ X0 > $o) > $o))).
% 0.36/0.27 thf(func_def_81, type, sP3: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > product_prod @ X0 @ X1) > (X1 > tree @ X0) > $o))).
% 0.36/0.27 thf(func_def_82, type, sP4: !>[X0: $tType, X1: $tType]:(((X1 > product_prod @ X0 @ X1) > (X1 > $o) > (X1 > tree @ X0) > $o))).
% 0.36/0.27 thf(func_def_83, type, sP5: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 0.36/0.27 thf(func_def_84, type, sP6: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 0.36/0.27 thf(func_def_85, type, sP7: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 0.36/0.27 thf(func_def_86, type, sK8: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_87, type, sK9: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_88, type, sK10: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_89, type, sK11: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_90, type, sK12: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_91, type, sK13: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_92, type, sK14: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_93, type, sK15: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_94, type, sK16: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_95, type, sK17: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_96, type, sK18: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_97, type, sK19: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_98, type, sK20: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_99, type, sK21: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_100, type, sK22: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_101, type, sK23: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_102, type, sK24: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 0.36/0.27 thf(func_def_103, type, sK25: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_104, type, sK26: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_105, type, sK27: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_106, type, sK28: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_107, type, sK29: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_108, type, sK30: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_109, type, sK31: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_110, type, sK32: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_111, type, sK33: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_112, type, sK34: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_113, type, sK35: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_114, type, sK36: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_115, type, sK37: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_116, type, sK38: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_117, type, sK39: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_118, type, sK40: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_119, type, sK41: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_120, type, sK42: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_121, type, sK43: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_122, type, sK44: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_123, type, sK45: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_124, type, sK46: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.27 thf(func_def_125, type, sK47: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.27 thf(func_def_126, type, sK48: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 0.36/0.27 thf(func_def_127, type, sK49: !>[X0: $tType]:(((tree @ X0 > $o) > X0))).
% 0.36/0.27 thf(func_def_128, type, sK50: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 0.36/0.27 thf(func_def_129, type, sK51: !>[X0: $tType]:(((tree @ X0 > $o) > X0))).
% 0.36/0.27 thf(func_def_130, type, sK52: !>[X0: $tType]:(((tree @ X0 > $o) > X0))).
% 0.36/0.27 thf(func_def_131, type, sK53: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 0.36/0.27 thf(func_def_132, type, sK54: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 0.36/0.27 thf(func_def_133, type, sK55: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 0.36/0.27 thf(func_def_134, type, sK56: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 0.36/0.27 thf(func_def_135, type, sK57: !>[X0: $tType]:(((tree @ X0 > $o) > X0))).
% 0.36/0.27 thf(func_def_136, type, sK58: !>[X0: $tType]:(((tree @ X0 > $o) > X0))).
% 0.36/0.27 thf(func_def_137, type, sK59: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 0.36/0.27 thf(func_def_138, type, sK60: !>[X0: $tType]:(((tree @ X0 > $o) > X0))).
% 0.36/0.27 thf(func_def_139, type, sK61: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 0.36/0.27 thf(func_def_140, type, sK62: !>[X0: $tType]:(((tree @ X0 > $o) > X0))).
% 0.36/0.27 thf(func_def_141, type, sK63: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 0.36/0.27 thf(func_def_142, type, sK64: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 0.36/0.28 thf(func_def_143, type, sK65: !>[X0: $tType]:(((tree @ X0 > $o) > X0))).
% 0.36/0.28 thf(func_def_144, type, sK66: !>[X0: $tType]:(((tree @ X0 > $o) > X0))).
% 0.36/0.28 thf(func_def_145, type, sK67: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 0.36/0.28 thf(func_def_146, type, sK68: !>[X0: $tType]:(((tree @ X0 > $o) > X0))).
% 0.36/0.28 thf(func_def_147, type, sK69: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 0.36/0.28 thf(func_def_148, type, sK70: !>[X0: $tType]:(((tree @ X0 > $o) > X0))).
% 0.36/0.28 thf(func_def_149, type, sK71: !>[X0: $tType, X1: $tType]:(((X1 > product_prod @ X0 @ X1) > (X1 > $o) > (X1 > tree @ X0) > X1))).
% 0.36/0.28 thf(func_def_150, type, sK72: !>[X0: $tType, X1: $tType]:(((X1 > product_prod @ X0 @ X1) > (X1 > $o) > (X1 > tree @ X0) > X1))).
% 0.36/0.28 thf(func_def_151, type, sK73: !>[X0: $tType, X1: $tType]:(((X1 > product_prod @ X0 @ X1) > (X1 > $o) > (X1 > tree @ X0) > X0))).
% 0.36/0.28 thf(func_def_152, type, sK74: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > product_prod @ X0 @ X1) > (X1 > tree @ X0) > X1))).
% 0.36/0.28 thf(func_def_153, type, sK75: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > product_prod @ X0 @ X1) > (X1 > tree @ X0) > X0))).
% 0.36/0.28 thf(func_def_154, type, sK76: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > product_prod @ X0 @ X1) > (X1 > tree @ X0) > X1))).
% 0.36/0.28 thf(func_def_155, type, sK77: !>[X0: $tType, X1: $tType]:(((X1 > tree @ X0) > (X1 > $o) > X1))).
% 0.36/0.28 thf(func_def_156, type, sK78: !>[X0: $tType, X1: $tType]:(((X1 > tree @ X0) > (X1 > multiset @ X0) > X1))).
% 0.36/0.28 thf(func_def_157, type, sK79: !>[X0: $tType, X1: $tType]:(((X1 > product_prod @ X0 @ X1) > (X1 > multiset @ X0) > (X1 > $o) > X1))).
% 0.36/0.28 thf(func_def_158, type, sK80: !>[X0: $tType, X1: $tType]:(((X1 > product_prod @ X0 @ X1) > (X1 > multiset @ X0) > (X1 > $o) > X1))).
% 0.36/0.28 thf(func_def_159, type, sK81: !>[X0: $tType, X1: $tType]:(((X1 > product_prod @ X0 @ X1) > (X1 > multiset @ X0) > (X1 > $o) > X0))).
% 0.36/0.28 thf(func_def_160, type, sK82: !>[X0: $tType, X1: $tType]:(((list @ X0 > X1) > (X1 > tree @ X0) > list @ X0))).
% 0.36/0.28 thf(func_def_161, type, sK83: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.28 thf(func_def_162, type, sK84: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.28 thf(func_def_163, type, sK85: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.28 thf(func_def_164, type, sK86: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.36/0.28 thf(func_def_165, type, sK87: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.36/0.28 thf(func_def_166, type, sK88: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.36/0.28 thf(func_def_167, type, sK89: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.36/0.28 thf(func_def_168, type, sK90: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.28 thf(func_def_169, type, sK91: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.28 thf(func_def_170, type, sK92: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.28 thf(func_def_171, type, sK93: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.28 thf(func_def_172, type, sK94: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.28 thf(func_def_173, type, sK95: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.28 thf(func_def_174, type, sK96: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.28 thf(func_def_175, type, sK97: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.28 thf(func_def_176, type, sK98: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.28 thf(func_def_177, type, sK99: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.28 thf(func_def_178, type, sK100: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.28 thf(func_def_179, type, sK101: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.28 thf(func_def_180, type, sK102: !>[X0: $tType]:((tree @ X0 > tree @ X0))).
% 0.36/0.28 thf(func_def_181, type, sK103: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.28 thf(func_def_182, type, sK104: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.28 thf(func_def_183, type, sK105: !>[X0: $tType]:((tree @ X0 > X0))).
% 0.36/0.28 thf(func_def_184, type, sK106: !>[X0: $tType]:(((tree @ X0 > $o) > X0))).
% 0.36/0.28 thf(func_def_185, type, sK107: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 0.36/0.28 thf(func_def_186, type, sK108: !>[X0: $tType]:(((tree @ X0 > $o) > tree @ X0))).
% 0.36/0.28 thf(func_def_187, type, sK109: !>[X0: $tType]:((X0 > tree @ X0 > X0))).
% 0.36/0.28 thf(func_def_188, type, sK110: !>[X0: $tType]:((X0 > tree @ X0 > tree @ X0))).
% 0.36/0.28 thf(func_def_189, type, sK111: !>[X0: $tType]:((X0 > tree @ X0 > tree @ X0))).
% 0.36/0.28 thf(f1,axiom,(
% 0.36/0.28 (ord_less_eq @ a @ v2 @ v1)),
% 0.36/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__092_060open_062v2_A_092_060le_062_Av1_092_060close_062)).
% 0.36/0.28 thf(f2,axiom,(
% 0.36/0.28 (ord_less_eq @ a @ v1 @ v)),
% 0.36/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_True)).
% 0.36/0.28 thf(f34,axiom,(
% 0.36/0.28 ! [X0 : $tType,X3 : tree @ X0,X2 : tree @ X0,X1 : X0] : (((val @ X0 @ (t @ X0 @ X1 @ X2 @ X3))) = X1)),
% 0.36/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_33_val_Osimps)).
% 0.36/0.28 thf(f36,axiom,(
% 0.36/0.28 ! [X0 : $tType] : (linorder @ X0 => ! [X3 : tree @ X0,X2 : tree @ X0,X4 : X0,X6 : tree @ X0,X5 : tree @ X0,X7 : X0,X1 : X0] : ((~(ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X1 @ X2 @ X3)) @ (val @ X0 @ (t @ X0 @ X4 @ X5 @ X6))) => (((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X1 @ X2 @ X3)) @ X7) => (((heapIm748920189ftDown @ X0 @ (t @ X0 @ X7 @ (t @ X0 @ X4 @ X5 @ X6) @ (t @ X0 @ X1 @ X2 @ X3)))) = ((t @ X0 @ X7 @ (t @ X0 @ X4 @ X5 @ X6) @ (t @ X0 @ X1 @ X2 @ X3))))) & (~(ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X1 @ X2 @ X3)) @ X7) => (((heapIm748920189ftDown @ X0 @ (t @ X0 @ X7 @ (t @ X0 @ X4 @ X5 @ X6) @ (t @ X0 @ X1 @ X2 @ X3)))) = ((t @ X0 @ (val @ X0 @ (t @ X0 @ X1 @ X2 @ X3)) @ (t @ X0 @ X4 @ X5 @ X6) @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X7 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X1 @ X2 @ X3)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X1 @ X2 @ X3)))))))))) & ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X1 @ X2 @ X3)) @ (val @ X0 @ (t @ X0 @ X4 @ X5 @ X6))) => ((~(ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X4 @ X5 @ X6)) @ X7) => (((heapIm748920189ftDown @ X0 @ (t @ X0 @ X7 @ (t @ X0 @ X4 @ X5 @ X6) @ (t @ X0 @ X1 @ X2 @ X3)))) = ((t @ X0 @ (val @ X0 @ (t @ X0 @ X4 @ X5 @ X6)) @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X7 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X4 @ X5 @ X6)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X4 @ X5 @ X6)))) @ (t @ X0 @ X1 @ X2 @ X3))))) & ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X4 @ X5 @ X6)) @ X7) => (((heapIm748920189ftDown @ X0 @ (t @ X0 @ X7 @ (t @ X0 @ X4 @ X5 @ X6) @ (t @ X0 @ X1 @ X2 @ X3)))) = ((t @ X0 @ X7 @ (t @ X0 @ X4 @ X5 @ X6) @ (t @ X0 @ X1 @ X2 @ X3)))))))))),
% 0.36/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_35_siftDown_Osimps_I6_J)).
% 0.36/0.28 thf(f276,axiom,(
% 0.36/0.28 linorder @ a),
% 0.36/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',tfree_0)).
% 0.36/0.28 thf(f277,conjecture,(
% 0.36/0.28 (((multiset2 @ a @ (heapIm748920189ftDown @ a @ (t @ a @ v @ (t @ a @ v1 @ l1 @ r1) @ (t @ a @ v2 @ l2 @ r2))))) = ((multiset2 @ a @ (t @ a @ v @ (t @ a @ v1 @ l1 @ r1) @ (t @ a @ v2 @ l2 @ r2)))))),
% 0.36/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)).
% 0.36/0.28 thf(f278,negated_conjecture,(
% 0.36/0.28 ~ (((multiset2 @ a @ (heapIm748920189ftDown @ a @ (t @ a @ v @ (t @ a @ v1 @ l1 @ r1) @ (t @ a @ v2 @ l2 @ r2))))) = ((multiset2 @ a @ (t @ a @ v @ (t @ a @ v1 @ l1 @ r1) @ (t @ a @ v2 @ l2 @ r2)))))),
% 0.36/0.28 inference(negated_conjecture,[status(cth)],[f277])).
% 0.36/0.28 thf(f283,plain,(
% 0.36/0.28 ! [X0 : $tType] : (linorder @ X0 => ! [X1 : tree @ X0,X2 : tree @ X0,X3 : X0,X4 : tree @ X0,X5 : tree @ X0,X6 : X0,X7 : X0] : ((~(ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4))) => (((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ X6) => (((t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1)))))) & (~(ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ X6) => (((t @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (t @ X0 @ X3 @ X5 @ X4) @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X7 @ X2 @ X1)))))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1)))))))) & ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4))) => ((~(ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ X6) => (((t @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X3 @ X5 @ X4)))) @ (t @ X0 @ X7 @ X2 @ X1))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1)))))) & ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ X6) => (((t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1))))))))))),
% 0.36/0.28 inference(rectify,[],[f36])).
% 0.36/0.28 thf(f284,plain,(
% 0.36/0.28 ! [X0 : $tType] : ((linorder @ X0 = $true) => ! [X1 : tree @ X0,X2 : tree @ X0,X3 : X0,X4 : tree @ X0,X5 : tree @ X0,X6 : X0,X7 : X0] : ((~ ($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4))))) => ((($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ X6))) => (((t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1)))))) & (~ ($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ X6))) => (((t @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (t @ X0 @ X3 @ X5 @ X4) @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X7 @ X2 @ X1)))))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1)))))))) & (($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4))))) => ((~ ($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ X6))) => (((t @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X3 @ X5 @ X4)))) @ (t @ X0 @ X7 @ X2 @ X1))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1)))))) & (($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ X6))) => (((t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1))))))))))),
% 0.36/0.28 inference(fool_elimination,[],[f283])).
% 0.36/0.28 thf(f385,plain,(
% 0.36/0.28 linorder @ a),
% 0.36/0.28 inference(rectify,[],[f276])).
% 0.36/0.28 thf(f386,plain,(
% 0.36/0.28 (linorder @ a = $true)),
% 0.36/0.28 inference(fool_elimination,[],[f385])).
% 0.36/0.28 thf(f508,plain,(
% 0.36/0.28 (ord_less_eq @ a @ v1 @ v)),
% 0.36/0.28 inference(rectify,[],[f2])).
% 0.36/0.28 thf(f509,plain,(
% 0.36/0.28 (((ord_less_eq @ a @ v1 @ v)) = $true)),
% 0.36/0.28 inference(fool_elimination,[],[f508])).
% 0.36/0.28 thf(f649,plain,(
% 0.36/0.28 (ord_less_eq @ a @ v2 @ v1)),
% 0.36/0.28 inference(rectify,[],[f1])).
% 0.36/0.28 thf(f650,plain,(
% 0.36/0.28 (((ord_less_eq @ a @ v2 @ v1)) = $true)),
% 0.36/0.28 inference(fool_elimination,[],[f649])).
% 0.36/0.28 thf(f730,plain,(
% 0.36/0.28 (((multiset2 @ a @ (heapIm748920189ftDown @ a @ (t @ a @ v @ (t @ a @ v1 @ l1 @ r1) @ (t @ a @ v2 @ l2 @ r2))))) != ((multiset2 @ a @ (t @ a @ v @ (t @ a @ v1 @ l1 @ r1) @ (t @ a @ v2 @ l2 @ r2)))))),
% 0.36/0.28 inference(flattening,[],[f278])).
% 0.36/0.28 thf(f742,plain,(
% 0.36/0.28 ! [X0 : $tType] : ((linorder @ X0 = $true) => ! [X5 : tree @ X0,X6 : X0,X1 : tree @ X0,X7 : X0,X2 : tree @ X0,X3 : X0,X4 : tree @ X0] : ((($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4))))) => ((($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ X6))) => (((t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1)))))) & (($true != ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ X6))) => (((t @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X3 @ X5 @ X4)))) @ (t @ X0 @ X7 @ X2 @ X1))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1)))))))) & (($true != ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4))))) => ((($true != ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ X6))) => (((t @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (t @ X0 @ X3 @ X5 @ X4) @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X7 @ X2 @ X1)))))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1)))))) & (($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ X6))) => (((t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1))))))))))),
% 0.36/0.28 inference(flattening,[],[f284])).
% 0.36/0.28 thf(f744,plain,(
% 0.36/0.28 ! [X0 : $tType,X1 : tree @ X0,X2 : tree @ X0,X3 : X0] : (((val @ X0 @ (t @ X0 @ X3 @ X2 @ X1))) = X3)),
% 0.36/0.28 inference(rectify,[],[f34])).
% 0.36/0.28 thf(f755,plain,(
% 0.36/0.28 ! [X0 : $tType] : ((linorder @ X0 != $true) | ! [X3 : X0,X6 : X0,X7 : X0,X5 : tree @ X0,X2 : tree @ X0,X4 : tree @ X0,X1 : tree @ X0] : (((((((t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1))))) | ($true != ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ X6)))) & (($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ X6))) | (((t @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (t @ X0 @ X3 @ X5 @ X4) @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X7 @ X2 @ X1)))))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1))))))) | ($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4)))))) & (($true != ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X7 @ X2 @ X1)) @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4))))) | ((($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ X6))) | (((t @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X3 @ X5 @ X4)))) @ (t @ X0 @ X7 @ X2 @ X1))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1)))))) & ((((t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X6 @ (t @ X0 @ X3 @ X5 @ X4) @ (t @ X0 @ X7 @ X2 @ X1))))) | ($true != ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X4)) @ X6))))))))),
% 0.36/0.28 inference(ennf_transformation,[],[f742])).
% 0.36/0.28 thf(f843,plain,(
% 0.36/0.28 ! [X0 : $tType] : ((linorder @ X0 != $true) | ! [X1 : X0,X2 : X0,X3 : X0,X4 : tree @ X0,X5 : tree @ X0,X6 : tree @ X0,X7 : tree @ X0] : (((((((t @ X0 @ X2 @ (t @ X0 @ X1 @ X4 @ X6) @ (t @ X0 @ X3 @ X5 @ X7))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X2 @ (t @ X0 @ X1 @ X4 @ X6) @ (t @ X0 @ X3 @ X5 @ X7))))) | ($true != ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X7)) @ X2)))) & (($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X7)) @ X2))) | (((t @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X7)) @ (t @ X0 @ X1 @ X4 @ X6) @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X2 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X3 @ X5 @ X7)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X3 @ X5 @ X7)))))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X2 @ (t @ X0 @ X1 @ X4 @ X6) @ (t @ X0 @ X3 @ X5 @ X7))))))) | ($true = ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X7)) @ (val @ X0 @ (t @ X0 @ X1 @ X4 @ X6)))))) & (($true != ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X7)) @ (val @ X0 @ (t @ X0 @ X1 @ X4 @ X6))))) | (((((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X1 @ X4 @ X6)) @ X2)) = $true) | (((heapIm748920189ftDown @ X0 @ (t @ X0 @ X2 @ (t @ X0 @ X1 @ X4 @ X6) @ (t @ X0 @ X3 @ X5 @ X7)))) = ((t @ X0 @ (val @ X0 @ (t @ X0 @ X1 @ X4 @ X6)) @ (heapIm748920189ftDown @ X0 @ (t @ X0 @ X2 @ (heapIm1271749598e_left @ X0 @ (t @ X0 @ X1 @ X4 @ X6)) @ (heapIm1434396069_right @ X0 @ (t @ X0 @ X1 @ X4 @ X6)))) @ (t @ X0 @ X3 @ X5 @ X7))))) & ((((t @ X0 @ X2 @ (t @ X0 @ X1 @ X4 @ X6) @ (t @ X0 @ X3 @ X5 @ X7))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X2 @ (t @ X0 @ X1 @ X4 @ X6) @ (t @ X0 @ X3 @ X5 @ X7))))) | (((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X1 @ X4 @ X6)) @ X2)) != $true))))))),
% 0.36/0.28 inference(rectify,[],[f755])).
% 0.36/0.28 thf(f883,plain,(
% 0.36/0.28 (linorder @ a = $true)),
% 0.36/0.28 inference(cnf_transformation,[],[f386])).
% 0.36/0.28 thf(f900,plain,(
% 0.36/0.28 ( ! [X0 : $tType,X2 : tree @ X0,X3 : X0,X1 : tree @ X0] : ((((val @ X0 @ (t @ X0 @ X3 @ X2 @ X1))) = X3)) )),
% 0.36/0.28 inference(cnf_transformation,[],[f744])).
% 0.36/0.28 thf(f913,plain,(
% 0.36/0.28 (((multiset2 @ a @ (heapIm748920189ftDown @ a @ (t @ a @ v @ (t @ a @ v1 @ l1 @ r1) @ (t @ a @ v2 @ l2 @ r2))))) != ((multiset2 @ a @ (t @ a @ v @ (t @ a @ v1 @ l1 @ r1) @ (t @ a @ v2 @ l2 @ r2)))))),
% 0.36/0.28 inference(cnf_transformation,[],[f730])).
% 0.36/0.28 thf(f920,plain,(
% 0.36/0.28 (((ord_less_eq @ a @ v1 @ v)) = $true)),
% 0.36/0.28 inference(cnf_transformation,[],[f509])).
% 0.36/0.28 thf(f921,plain,(
% 0.36/0.28 ( ! [X0 : $tType,X2 : X0,X3 : X0,X1 : X0,X6 : tree @ X0,X7 : tree @ X0,X4 : tree @ X0,X5 : tree @ X0] : ((((t @ X0 @ X2 @ (t @ X0 @ X1 @ X4 @ X6) @ (t @ X0 @ X3 @ X5 @ X7))) = ((heapIm748920189ftDown @ X0 @ (t @ X0 @ X2 @ (t @ X0 @ X1 @ X4 @ X6) @ (t @ X0 @ X3 @ X5 @ X7))))) | ($true != ((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X3 @ X5 @ X7)) @ (val @ X0 @ (t @ X0 @ X1 @ X4 @ X6))))) | (((ord_less_eq @ X0 @ (val @ X0 @ (t @ X0 @ X1 @ X4 @ X6)) @ X2)) != $true) | (linorder @ X0 != $true)) )),
% 0.36/0.28 inference(cnf_transformation,[],[f843])).
% 0.36/0.28 thf(f933,plain,(
% 0.36/0.28 (((ord_less_eq @ a @ v2 @ v1)) = $true)),
% 0.36/0.28 inference(cnf_transformation,[],[f650])).
% 0.36/0.28 thf(f944,plain,(
% 0.36/0.28 (((ord_less_eq @ a @ (val @ a @ (t @ a @ v1 @ l1 @ r1)) @ v)) != $true) | (((ord_less_eq @ a @ (val @ a @ (t @ a @ v2 @ l2 @ r2)) @ (val @ a @ (t @ a @ v1 @ l1 @ r1)))) != $true) | (((multiset2 @ a @ (t @ a @ v @ (t @ a @ v1 @ l1 @ r1) @ (t @ a @ v2 @ l2 @ r2)))) != ((multiset2 @ a @ (t @ a @ v @ (t @ a @ v1 @ l1 @ r1) @ (t @ a @ v2 @ l2 @ r2))))) | (linorder @ a != $true)),
% 0.36/0.28 inference(superposition,[],[f913,f921])).
% 0.36/0.28 thf(f947,plain,(
% 0.36/0.28 (((ord_less_eq @ a @ (val @ a @ (t @ a @ v2 @ l2 @ r2)) @ (val @ a @ (t @ a @ v1 @ l1 @ r1)))) != $true) | (linorder @ a != $true) | (((ord_less_eq @ a @ (val @ a @ (t @ a @ v1 @ l1 @ r1)) @ v)) != $true)),
% 0.36/0.28 inference(trivial_inequality_removal,[],[f944])).
% 0.36/0.28 thf(f951,plain,(
% 0.36/0.28 (((ord_less_eq @ a @ (val @ a @ (t @ a @ v2 @ l2 @ r2)) @ (val @ a @ (t @ a @ v1 @ l1 @ r1)))) != $true) | (((ord_less_eq @ a @ (val @ a @ (t @ a @ v1 @ l1 @ r1)) @ v)) != $true)),
% 0.36/0.28 inference(forward_subsumption_resolution,[],[f947,f883])).
% 0.36/0.28 thf(f955,plain,(
% 0.36/0.28 (((ord_less_eq @ a @ (val @ a @ (t @ a @ v1 @ l1 @ r1)) @ v)) != $true) | ($true != ((ord_less_eq @ a @ v2 @ (val @ a @ (t @ a @ v1 @ l1 @ r1)))))),
% 0.36/0.28 inference(forward_demodulation,[],[f951,f900])).
% 0.36/0.28 thf(f959,plain,(
% 0.36/0.28 ($true != ((ord_less_eq @ a @ v2 @ (val @ a @ (t @ a @ v1 @ l1 @ r1))))) | (((ord_less_eq @ a @ v1 @ v)) != $true)),
% 0.36/0.28 inference(forward_demodulation,[],[f955,f900])).
% 0.36/0.28 thf(f963,plain,(
% 0.36/0.28 ($true != ((ord_less_eq @ a @ v2 @ (val @ a @ (t @ a @ v1 @ l1 @ r1)))))),
% 0.36/0.28 inference(forward_subsumption_resolution,[],[f959,f920])).
% 0.36/0.28 thf(f966,plain,(
% 0.36/0.28 (((ord_less_eq @ a @ v2 @ v1)) != $true)),
% 0.36/0.28 inference(forward_demodulation,[],[f963,f900])).
% 0.36/0.28 thf(f968,plain,(
% 0.36/0.28 $false),
% 0.36/0.28 inference(forward_subsumption_resolution,[],[f966,f933])).
% 0.36/0.28 % SZS output end Proof for theBenchmark
% 0.36/0.28 % (596172)------------------------------
% 0.36/0.28 % (596172)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.28 % (596172)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.28 % (596172)CaDiCaL version: 2.1.3
% 0.36/0.28 % (596172)Termination reason: Refutation
% 0.36/0.28 % (596172)Time elapsed: 0.027 s
% 0.36/0.28 % (596172)Peak memory usage: 14 MB
% 0.36/0.28 % (596172)Instructions burned: 111 (million)
% 0.36/0.28 % (596114)Success in time 0.11 s
% 0.36/0.28 % Vampire exiting
%------------------------------------------------------------------------------