%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP068^1 : 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 : n017.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.56s 0.45s
% Output : Refutation 0.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP068^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 % Computer : n017.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % 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:42:22 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.22/0.28 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.56/0.42 % (802990)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.56/0.42 % (802996)lrs+10_16_si=on:nwc=1.5:random_seed=1245686582:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.56/0.42 % (803001)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.56/0.42 % (803001)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.56/0.42 % (802996)Instruction limit reached!
% 0.56/0.42 % (802996)------------------------------
% 0.56/0.42 % (802996)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.42 % (802996)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.42 % (802996)CaDiCaL version: 2.1.3
% 0.56/0.42 % (802996)Termination reason: Instruction limit
% 0.56/0.42 % (802996)Termination phase: Property scanning
% 0.56/0.42 % (802996)Time elapsed: 0.005 s
% 0.56/0.42 % (802996)Peak memory usage: 10 MB
% 0.56/0.42 % (802996)Instructions burned: 23 (million)
% 0.56/0.42 % (802995)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3037846218:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.56/0.42 % (802997)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3475971690:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.56/0.42 % (802998)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=291617816: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.56/0.42 % (803000)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3017287891:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.56/0.42 % (803001)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=2006336662:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.56/0.42 % (802997)Instruction limit reached!
% 0.56/0.42 % (802997)------------------------------
% 0.56/0.42 % (802997)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.42 % (802997)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.42 % (802997)CaDiCaL version: 2.1.3
% 0.56/0.42 % (802997)Termination reason: Instruction limit
% 0.56/0.42 % (802997)Termination phase: shuffling
% 0.56/0.42 % (802997)Time elapsed: 0.002 s
% 0.56/0.42 % (802997)Peak memory usage: 10 MB
% 0.56/0.42 % (802997)Instructions burned: 4 (million)
% 0.56/0.42 % (802999)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3539260891:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.56/0.42 % (803003)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=4148752903:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.56/0.42 % (803003)Instruction limit reached!
% 0.56/0.42 % (803003)------------------------------
% 0.56/0.42 % (803003)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.43 % (803003)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.43 % (803003)CaDiCaL version: 2.1.3
% 0.56/0.43 % (803003)Termination reason: Instruction limit
% 0.56/0.43 % (803003)Termination phase: shuffling
% 0.56/0.43 % (803003)Time elapsed: 0.002 s
% 0.56/0.43 % (803003)Peak memory usage: 10 MB
% 0.56/0.43 % (803003)Instructions burned: 9 (million)
% 0.56/0.43 % (803009)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=2370176980:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.56/0.43 % (803012)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.56/0.43 % (803012)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=59660071:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.56/0.43 % (803009)Instruction limit reached!
% 0.56/0.43 % (803009)------------------------------
% 0.56/0.43 % (803009)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (803009)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (803009)CaDiCaL version: 2.1.3
% 0.56/0.45 % (803009)Termination reason: Instruction limit
% 0.56/0.45 % (803009)Termination phase: shuffling
% 0.56/0.45 % (803009)Time elapsed: 0.003 s
% 0.56/0.45 % (803009)Peak memory usage: 10 MB
% 0.56/0.45 % (803009)Instructions burned: 7 (million)
% 0.56/0.45 % (803012)Instruction limit reached!
% 0.56/0.45 % (803012)------------------------------
% 0.56/0.45 % (803012)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (803012)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (803012)CaDiCaL version: 2.1.3
% 0.56/0.45 % (803012)Termination reason: Instruction limit
% 0.56/0.45 % (803012)Termination phase: shuffling
% 0.56/0.45 % (803012)Time elapsed: 0.003 s
% 0.56/0.45 % (803012)Peak memory usage: 10 MB
% 0.56/0.45 % (803012)Instructions burned: 11 (million)
% 0.56/0.45 % (802999)Instruction limit reached!
% 0.56/0.45 % (802999)------------------------------
% 0.56/0.45 % (802999)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (802999)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (802999)CaDiCaL version: 2.1.3
% 0.56/0.45 % (802999)Termination reason: Instruction limit
% 0.56/0.45 % (802999)Termination phase: Property scanning
% 0.56/0.45 % (802999)Time elapsed: 0.021 s
% 0.56/0.45 % (802999)Peak memory usage: 10 MB
% 0.56/0.45 % (802999)Instructions burned: 26 (million)
% 0.56/0.45 % (803000)Instruction limit reached!
% 0.56/0.45 % (803000)------------------------------
% 0.56/0.45 % (803000)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (803000)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (803000)CaDiCaL version: 2.1.3
% 0.56/0.45 % (803000)Termination reason: Instruction limit
% 0.56/0.45 % (803000)Termination phase: Property scanning
% 0.56/0.45 % (803000)Time elapsed: 0.034 s
% 0.56/0.45 % (803000)Peak memory usage: 12 MB
% 0.56/0.45 % (803000)Instructions burned: 77 (million)
% 0.56/0.45 % (802995)Instruction limit reached!
% 0.56/0.45 % (802995)------------------------------
% 0.56/0.45 % (802995)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (802995)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (802995)CaDiCaL version: 2.1.3
% 0.56/0.45 % (802995)Termination reason: Instruction limit
% 0.56/0.45 % (802995)Termination phase: Property scanning
% 0.56/0.45 % (802995)Time elapsed: 0.039 s
% 0.56/0.45 % (802995)Peak memory usage: 12 MB
% 0.56/0.45 % (802995)Instructions burned: 89 (million)
% 0.56/0.45 % (803016)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.56/0.45 % (803016)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.56/0.45 % (803016)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=1259942928: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.56/0.45 % (803016)Instruction limit reached!
% 0.56/0.45 % (803016)------------------------------
% 0.56/0.45 % (803016)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (803016)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (803016)CaDiCaL version: 2.1.3
% 0.56/0.45 % (803016)Termination reason: Instruction limit
% 0.56/0.45 % (803016)Termination phase: Property scanning
% 0.56/0.45 % (803016)Time elapsed: 0.007 s
% 0.56/0.45 % (803016)Peak memory usage: 10 MB
% 0.56/0.45 % (803016)Instructions burned: 32 (million)
% 0.56/0.45 % (803018)lrs+10_1_si=on:cs=on:random_seed=525689772:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.56/0.45 % (803019)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.56/0.45 % (803017)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=32376125:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.56/0.45 % (803015)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=118471087:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.56/0.45 % (803019)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=377783836:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.56/0.45 % (803018)Instruction limit reached!
% 0.56/0.45 % (803018)------------------------------
% 0.56/0.45 % (803018)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (803018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (803018)CaDiCaL version: 2.1.3
% 0.56/0.45 % (803018)Termination reason: Instruction limit
% 0.56/0.45 % (803018)Termination phase: shuffling
% 0.56/0.45 % (803018)Time elapsed: 0.004 s
% 0.56/0.45 % (803018)Peak memory usage: 10 MB
% 0.56/0.45 % (803018)Instructions burned: 10 (million)
% 0.56/0.45 % (803021)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=3080661558:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/38Mi)
% 0.56/0.45 % (803019)Instruction limit reached!
% 0.56/0.45 % (803019)------------------------------
% 0.56/0.45 % (803019)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (803019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (803019)CaDiCaL version: 2.1.3
% 0.56/0.45 % (803019)Termination reason: Instruction limit
% 0.56/0.45 % (803019)Termination phase: shuffling
% 0.56/0.45 % (803019)Time elapsed: 0.003 s
% 0.56/0.45 % (803019)Peak memory usage: 10 MB
% 0.56/0.45 % (803019)Instructions burned: 6 (million)
% 0.56/0.45 % (803015)Instruction limit reached!
% 0.56/0.45 % (803015)------------------------------
% 0.56/0.45 % (803015)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (803015)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (803015)CaDiCaL version: 2.1.3
% 0.56/0.45 % (803015)Termination reason: Instruction limit
% 0.56/0.45 % (803015)Termination phase: shuffling
% 0.56/0.45 % (803015)Time elapsed: 0.006 s
% 0.56/0.45 % (803015)Peak memory usage: 10 MB
% 0.56/0.45 % (803015)Instructions burned: 14 (million)
% 0.56/0.45 % (803021)Instruction limit reached!
% 0.56/0.45 % (803021)------------------------------
% 0.56/0.45 % (803021)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (803021)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (803021)CaDiCaL version: 2.1.3
% 0.56/0.45 % (803021)Termination reason: Instruction limit
% 0.56/0.45 % (803021)Termination phase: Property scanning
% 0.56/0.45 % (803021)Time elapsed: 0.009 s
% 0.56/0.45 % (803021)Peak memory usage: 11 MB
% 0.56/0.45 % (803021)Instructions burned: 41 (million)
% 0.56/0.45 % (803001)Instruction limit reached!
% 0.56/0.45 % (803001)------------------------------
% 0.56/0.45 % (803001)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (803001)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (803001)CaDiCaL version: 2.1.3
% 0.56/0.45 % (803001)Termination reason: Instruction limit
% 0.56/0.45 % (803001)Termination phase: Saturation
% 0.56/0.45 % (803001)Time elapsed: 0.076 s
% 0.56/0.45 % (803001)Peak memory usage: 14 MB
% 0.56/0.45 % (803001)Instructions burned: 159 (million)
% 0.56/0.45 % (803027)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=1732697843:st=2:i=249:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/249Mi)
% 0.56/0.45 % (803030)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=3696090395:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/327Mi)
% 0.56/0.45 % (803028)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=862246807:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/25Mi)
% 0.56/0.45 % (803029)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=3843311735:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2998 on theBenchmark for (2998ds/14Mi)
% 0.56/0.45 % (803029)Instruction limit reached!
% 0.56/0.45 % (803029)------------------------------
% 0.56/0.45 % (803029)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (803029)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (803029)CaDiCaL version: 2.1.3
% 0.56/0.45 % (803029)Termination reason: Instruction limit
% 0.56/0.45 % (803029)Termination phase: shuffling
% 0.56/0.45 % (803029)Time elapsed: 0.006 s
% 0.56/0.45 % (803029)Peak memory usage: 10 MB
% 0.56/0.45 % (803029)Instructions burned: 15 (million)
% 0.56/0.45 % (803028)Instruction limit reached!
% 0.56/0.45 % (803028)------------------------------
% 0.56/0.45 % (803028)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (803028)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (803028)CaDiCaL version: 2.1.3
% 0.56/0.45 % (803028)Termination reason: Instruction limit
% 0.56/0.45 % (803028)Termination phase: Property scanning
% 0.56/0.45 % (803028)Time elapsed: 0.011 s
% 0.56/0.45 % (803028)Peak memory usage: 10 MB
% 0.56/0.45 % (803028)Instructions burned: 27 (million)
% 0.56/0.45 % (803017)Instruction limit reached!
% 0.56/0.45 % (803017)------------------------------
% 0.56/0.45 % (803017)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (803017)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (803017)CaDiCaL version: 2.1.3
% 0.56/0.45 % (803017)Termination reason: Instruction limit
% 0.56/0.45 % (803017)Termination phase: Property scanning
% 0.56/0.45 % (803017)Time elapsed: 0.037 s
% 0.56/0.45 % (803017)Peak memory usage: 11 MB
% 0.56/0.45 % (803017)Instructions burned: 88 (million)
% 0.56/0.45 % (803031)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=2240843940:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/14Mi)
% 0.56/0.45 % (803031)Instruction limit reached!
% 0.56/0.45 % (803031)------------------------------
% 0.56/0.45 % (803031)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (803031)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (803031)CaDiCaL version: 2.1.3
% 0.56/0.45 % (803031)Termination reason: Instruction limit
% 0.56/0.45 % (803031)Termination phase: shuffling
% 0.56/0.45 % (803031)Time elapsed: 0.007 s
% 0.56/0.45 % (803031)Peak memory usage: 10 MB
% 0.56/0.45 % (803031)Instructions burned: 15 (million)
% 0.56/0.45 % (802998) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-802990-802998"...
% 0.56/0.45 % (802998)...printing done.
% 0.56/0.45 % (802998)Refutation found. Thanks to Tanya!
% 0.56/0.45 % SZS status Theorem for theBenchmark
% 0.56/0.45 % SZS output start Proof for theBenchmark
% 0.56/0.45 thf(type_def_5, type, set_Pr158363655iset_a: $tType).
% 0.56/0.45 thf(type_def_6, type, produc1127127335iset_a: $tType).
% 0.56/0.45 thf(type_def_7, type, set_Product_prod_a_a: $tType).
% 0.56/0.45 thf(type_def_8, type, multiset_multiset_a: $tType).
% 0.56/0.45 thf(type_def_9, type, set_multiset_a: $tType).
% 0.56/0.45 thf(type_def_10, type, product_prod_a_a: $tType).
% 0.56/0.45 thf(type_def_11, type, multiset_a: $tType).
% 0.56/0.45 thf(type_def_12, type, tree_a: $tType).
% 0.56/0.45 thf(type_def_13, type, set_a: $tType).
% 0.56/0.45 thf(type_def_14, type, a: $tType).
% 0.56/0.45 thf(type_def_15, type, sTfun: ($tType * $tType) > $tType).
% 0.56/0.45 thf(func_def_0, type, plus_plus_multiset_a: (multiset_a > multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_1, type, zero_zero_multiset_a: multiset_a).
% 0.56/0.45 thf(func_def_2, type, nO_MAT1617603563iset_a: (multiset_a > multiset_a > $o)).
% 0.56/0.45 thf(func_def_3, type, heapIm1140443833left_a: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_4, type, heapIm1257206334ight_a: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_5, type, heapIm1091024090Down_a: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_6, type, e_a: tree_a).
% 0.56/0.45 thf(func_def_7, type, t_a: (a > tree_a > tree_a > tree_a)).
% 0.56/0.45 thf(func_def_8, type, rel_Tree_a_a: ((a > a > $o) > tree_a > tree_a > $o)).
% 0.56/0.45 thf(func_def_9, type, in_tree_a: (a > tree_a > $o)).
% 0.56/0.45 thf(func_def_10, type, is_heap_a: (tree_a > $o)).
% 0.56/0.45 thf(func_def_11, type, multiset_a2: (tree_a > multiset_a)).
% 0.56/0.45 thf(func_def_12, type, val_a: (tree_a > a)).
% 0.56/0.45 thf(func_def_13, type, lattic146396397_Max_a: (set_a > a)).
% 0.56/0.45 thf(func_def_14, type, add_mset_a: (a > multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_15, type, comm_m315775925iset_a: ((multiset_a > multiset_a > multiset_a) > multiset_a > multiset_multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_16, type, fold_m382157835iset_a: ((multiset_a > multiset_a > multiset_a) > multiset_a > multiset_multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_17, type, fold_m364285649iset_a: ((a > multiset_a > multiset_a) > multiset_a > multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_18, type, image_929116801iset_a: ((a > multiset_a) > multiset_a > multiset_multiset_a)).
% 0.56/0.45 thf(func_def_19, type, image_mset_a_a: ((a > a) > multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_20, type, mult1_a: (set_Product_prod_a_a > set_Pr158363655iset_a)).
% 0.56/0.45 thf(func_def_21, type, mult_a: (set_Product_prod_a_a > set_Pr158363655iset_a)).
% 0.56/0.45 thf(func_def_22, type, set_mset_multiset_a: (multiset_multiset_a > set_multiset_a)).
% 0.56/0.45 thf(func_def_23, type, set_mset_a: (multiset_a > set_a)).
% 0.56/0.45 thf(func_def_24, type, subseteq_mset_a: (multiset_a > multiset_a > $o)).
% 0.56/0.45 thf(func_def_25, type, ord_less_eq_o_o_a: (($o > $o > a) > ($o > $o > a) > $o)).
% 0.56/0.45 thf(func_def_26, type, ord_less_eq_o_a: (($o > a) > ($o > a) > $o)).
% 0.56/0.45 thf(func_def_27, type, ord_le1530450702ee_a_o: ((tree_a > tree_a > $o) > (tree_a > tree_a > $o) > $o)).
% 0.56/0.45 thf(func_def_28, type, ord_less_eq_a_a_o: ((a > a > $o) > (a > a > $o) > $o)).
% 0.56/0.45 thf(func_def_29, type, ord_le1199012836iset_a: (multiset_a > multiset_a > $o)).
% 0.56/0.45 thf(func_def_30, type, ord_less_eq_set_a: (set_a > set_a > $o)).
% 0.56/0.45 thf(func_def_31, type, ord_less_eq_a: (a > a > $o)).
% 0.56/0.45 thf(func_def_32, type, order_Greatest_o_a: ((($o > a) > $o) > $o > a)).
% 0.56/0.45 thf(func_def_33, type, order_Greatest_a: ((a > $o) > a)).
% 0.56/0.45 thf(func_def_34, type, produc2037245207iset_a: (multiset_a > multiset_a > produc1127127335iset_a)).
% 0.56/0.45 thf(func_def_35, type, product_Pair_a_a: (a > a > product_prod_a_a)).
% 0.56/0.45 thf(func_def_36, type, irrefl_a: (set_Product_prod_a_a > $o)).
% 0.56/0.45 thf(func_def_37, type, trans_a: (set_Product_prod_a_a > $o)).
% 0.56/0.45 thf(func_def_38, type, collect_a: ((a > $o) > set_a)).
% 0.56/0.45 thf(func_def_39, type, member_multiset_a: (multiset_a > set_multiset_a > $o)).
% 0.56/0.45 thf(func_def_40, type, member340150864iset_a: (produc1127127335iset_a > set_Pr158363655iset_a > $o)).
% 0.56/0.45 thf(func_def_41, type, member449909584od_a_a: (product_prod_a_a > set_Product_prod_a_a > $o)).
% 0.56/0.45 thf(func_def_42, type, member_a: (a > set_a > $o)).
% 0.56/0.45 thf(func_def_43, type, l: tree_a).
% 0.56/0.45 thf(func_def_44, type, l1: tree_a).
% 0.56/0.45 thf(func_def_45, type, la: tree_a).
% 0.56/0.45 thf(func_def_46, type, r: tree_a).
% 0.56/0.45 thf(func_def_47, type, r1: tree_a).
% 0.56/0.45 thf(func_def_48, type, ra: tree_a).
% 0.56/0.45 thf(func_def_49, type, t: tree_a).
% 0.56/0.45 thf(func_def_50, type, v: a).
% 0.56/0.45 thf(func_def_51, type, v1: a).
% 0.56/0.45 thf(func_def_52, type, v2: a).
% 0.56/0.45 thf(func_def_53, type, va: a).
% 0.56/0.45 thf(func_def_57, type, db1: !>[X0: $tType]:(X0)).
% 0.56/0.45 thf(func_def_58, type, db0: !>[X0: $tType]:(X0)).
% 0.56/0.45 thf(func_def_59, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.56/0.45 thf(func_def_60, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.56/0.45 thf(func_def_61, type, vIMP: ($o > $o > $o)).
% 0.56/0.45 thf(func_def_62, type, db2: !>[X0: $tType]:(X0)).
% 0.56/0.45 thf(func_def_63, type, vAND: ($o > $o > $o)).
% 0.56/0.45 thf(func_def_64, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.56/0.45 thf(func_def_65, type, sP0: (a > a > a > $o)).
% 0.56/0.45 thf(func_def_66, type, sP1: (a > a > a > $o)).
% 0.56/0.45 thf(func_def_67, type, sK2: (multiset_a > a > (a > a) > multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_68, type, sK3: (multiset_a > a > (a > a) > multiset_a > a)).
% 0.56/0.45 thf(func_def_69, type, sK4: ((a > a > $o) > tree_a > tree_a > tree_a)).
% 0.56/0.45 thf(func_def_70, type, sK5: ((a > a > $o) > tree_a > tree_a > a)).
% 0.56/0.45 thf(func_def_71, type, sK6: ((a > a > $o) > tree_a > tree_a > tree_a)).
% 0.56/0.45 thf(func_def_72, type, sK7: ((a > a > $o) > tree_a > tree_a > tree_a)).
% 0.56/0.45 thf(func_def_73, type, sK8: ((a > a > $o) > tree_a > tree_a > a)).
% 0.56/0.45 thf(func_def_74, type, sK9: ((a > a > $o) > tree_a > tree_a > tree_a)).
% 0.56/0.45 thf(func_def_75, type, sK10: (multiset_a > multiset_a > set_Product_prod_a_a > multiset_a)).
% 0.56/0.45 thf(func_def_76, type, sK11: (multiset_a > multiset_a > set_Product_prod_a_a > multiset_a)).
% 0.56/0.45 thf(func_def_77, type, sK12: (multiset_a > multiset_a > set_Product_prod_a_a > multiset_a)).
% 0.56/0.45 thf(func_def_78, type, sK13: (a > multiset_a > multiset_a > set_Product_prod_a_a > a)).
% 0.56/0.45 thf(func_def_79, type, sK14: (tree_a > a)).
% 0.56/0.45 thf(func_def_80, type, sK15: (tree_a > a)).
% 0.56/0.45 thf(func_def_81, type, sK16: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_82, type, sK17: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_83, type, sK18: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_84, type, sK19: (tree_a > a)).
% 0.56/0.45 thf(func_def_85, type, sK20: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_86, type, sK21: (tree_a > a)).
% 0.56/0.45 thf(func_def_87, type, sK22: (tree_a > a)).
% 0.56/0.45 thf(func_def_88, type, sK23: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_89, type, sK24: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_90, type, sK25: (tree_a > a)).
% 0.56/0.45 thf(func_def_91, type, sK26: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_92, type, sK27: (tree_a > a)).
% 0.56/0.45 thf(func_def_93, type, sK28: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_94, type, sK29: (tree_a > a)).
% 0.56/0.45 thf(func_def_95, type, sK30: (a > multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_96, type, sK31: ((a > a) > a)).
% 0.56/0.45 thf(func_def_97, type, sK32: ((a > a) > a)).
% 0.56/0.45 thf(func_def_98, type, sK33: (multiset_a > (a > multiset_a) > (a > multiset_a) > a)).
% 0.56/0.45 thf(func_def_99, type, sK34: ((($o > a) > $o) > ($o > a) > $o > a)).
% 0.56/0.45 thf(func_def_100, type, sK35: ((($o > a) > $o) > (($o > a) > $o) > $o > a)).
% 0.56/0.45 thf(func_def_101, type, sK36: (multiset_multiset_a > a > multiset_a)).
% 0.56/0.45 thf(func_def_102, type, sK37: ((($o > a) > $o > a) > $o > a)).
% 0.56/0.45 thf(func_def_103, type, sK38: ((($o > a) > $o > a) > $o > a)).
% 0.56/0.45 thf(func_def_104, type, sK39: ((a > a) > a)).
% 0.56/0.45 thf(func_def_105, type, sK40: ((a > a) > a)).
% 0.56/0.45 thf(func_def_106, type, sK41: (set_Product_prod_a_a > a > multiset_a > a)).
% 0.56/0.45 thf(func_def_107, type, sK42: (tree_a > a > a)).
% 0.56/0.45 thf(func_def_108, type, sK43: (tree_a > a > tree_a)).
% 0.56/0.45 thf(func_def_109, type, sK44: (tree_a > a > tree_a)).
% 0.56/0.45 thf(func_def_110, type, sK45: (set_Product_prod_a_a > multiset_a > multiset_a > a)).
% 0.56/0.45 thf(func_def_111, type, sK46: (set_Product_prod_a_a > multiset_a > multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_112, type, sK47: (set_Product_prod_a_a > multiset_a > multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_113, type, sK48: (($o > a) > (($o > a) > $o) > $o > a)).
% 0.56/0.45 thf(func_def_114, type, sK49: (multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_115, type, sK50: (multiset_a > a)).
% 0.56/0.45 thf(func_def_116, type, sK51: ((($o > a) > $o > a) > $o > a)).
% 0.56/0.45 thf(func_def_117, type, sK52: ((($o > a) > $o > a) > $o > a)).
% 0.56/0.45 thf(func_def_118, type, sK53: ((($o > a) > $o > a) > $o > a)).
% 0.56/0.45 thf(func_def_119, type, sK54: ((($o > a) > $o > a) > $o > a)).
% 0.56/0.45 thf(func_def_120, type, sK55: ((a > a > $o) > (tree_a > tree_a > $o) > a)).
% 0.56/0.45 thf(func_def_121, type, sK56: ((a > a > $o) > (tree_a > tree_a > $o) > tree_a)).
% 0.56/0.45 thf(func_def_122, type, sK57: ((a > a > $o) > (tree_a > tree_a > $o) > tree_a)).
% 0.56/0.45 thf(func_def_123, type, sK58: ((a > a > $o) > (tree_a > tree_a > $o) > a)).
% 0.56/0.45 thf(func_def_124, type, sK59: ((a > a > $o) > (tree_a > tree_a > $o) > tree_a)).
% 0.56/0.45 thf(func_def_125, type, sK60: ((a > a > $o) > (tree_a > tree_a > $o) > tree_a)).
% 0.56/0.45 thf(func_def_126, type, sK61: ((a > a) > a)).
% 0.56/0.45 thf(func_def_127, type, sK62: ((a > a) > a)).
% 0.56/0.45 thf(func_def_128, type, sK63: (multiset_a > a > multiset_a > (a > a) > multiset_a)).
% 0.56/0.45 thf(func_def_129, type, sK64: (set_Product_prod_a_a > multiset_a > multiset_a > a)).
% 0.56/0.45 thf(func_def_130, type, sK65: ((multiset_a > multiset_a > $o) > a)).
% 0.56/0.45 thf(func_def_131, type, sK66: ((multiset_a > multiset_a > $o) > multiset_a)).
% 0.56/0.45 thf(func_def_132, type, sK67: ((multiset_a > multiset_a > $o) > multiset_a)).
% 0.56/0.45 thf(func_def_133, type, sK68: ((multiset_a > multiset_a > $o) > multiset_a)).
% 0.56/0.45 thf(func_def_134, type, sK69: ((multiset_a > multiset_a > $o) > multiset_a)).
% 0.56/0.45 thf(func_def_135, type, sK70: ((multiset_a > multiset_a > $o) > a)).
% 0.56/0.45 thf(func_def_136, type, sK71: ((tree_a > $o) > tree_a)).
% 0.56/0.45 thf(func_def_137, type, sK72: ((tree_a > $o) > tree_a)).
% 0.56/0.45 thf(func_def_138, type, sK73: ((tree_a > $o) > a)).
% 0.56/0.45 thf(func_def_139, type, sK74: (a > multiset_a > a > multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_140, type, sK75: (a > (a > $o) > a)).
% 0.56/0.45 thf(func_def_141, type, sK76: (multiset_a > a > multiset_a)).
% 0.56/0.45 thf(func_def_142, type, sK77: (multiset_multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_143, type, sK78: ((multiset_a > $o) > multiset_a)).
% 0.56/0.45 thf(func_def_144, type, sK79: ((multiset_a > $o) > a)).
% 0.56/0.45 thf(func_def_145, type, sK80: ((a > $o > a) > a)).
% 0.56/0.45 thf(func_def_146, type, sK81: ((a > $o > a) > a)).
% 0.56/0.45 thf(func_def_147, type, sK82: (set_a > set_a > a)).
% 0.56/0.45 thf(func_def_148, type, sK83: (multiset_a > set_Product_prod_a_a > a > multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_149, type, sK84: (multiset_a > set_Product_prod_a_a > a > multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_150, type, sK85: ((multiset_a > $o) > a)).
% 0.56/0.45 thf(func_def_151, type, sK86: ((multiset_a > $o) > multiset_a)).
% 0.56/0.45 thf(func_def_152, type, sK87: (multiset_a > a)).
% 0.56/0.45 thf(func_def_153, type, sK88: ((a > $o > a) > a)).
% 0.56/0.45 thf(func_def_154, type, sK89: ((a > $o > a) > a)).
% 0.56/0.45 thf(func_def_155, type, sK90: ((a > $o) > (a > $o) > a)).
% 0.56/0.45 thf(func_def_156, type, sK91: ((a > $o) > a > a)).
% 0.56/0.45 thf(func_def_157, type, sK92: ((($o > a) > a) > $o > a)).
% 0.56/0.45 thf(func_def_158, type, sK93: ((($o > a) > a) > $o > a)).
% 0.56/0.45 thf(func_def_159, type, sK94: ((a > a) > a)).
% 0.56/0.45 thf(func_def_160, type, sK95: ((a > a) > a)).
% 0.56/0.45 thf(func_def_161, type, sK96: (multiset_a > (multiset_a > $o) > multiset_a)).
% 0.56/0.45 thf(func_def_162, type, sK97: (multiset_a > (multiset_a > $o) > a)).
% 0.56/0.45 thf(func_def_163, type, sK98: ((multiset_a > $o) > a)).
% 0.56/0.45 thf(func_def_164, type, sK99: ((multiset_a > $o) > multiset_a)).
% 0.56/0.45 thf(func_def_165, type, sK100: ((a > $o > a) > a)).
% 0.56/0.45 thf(func_def_166, type, sK101: ((a > $o > a) > a)).
% 0.56/0.45 thf(func_def_167, type, sK102: ((a > a > $o) > a)).
% 0.56/0.45 thf(func_def_168, type, sK103: ((a > a > $o) > a)).
% 0.56/0.45 thf(func_def_169, type, sK104: ((a > a > $o) > a)).
% 0.56/0.45 thf(func_def_170, type, sK105: ((a > a > $o) > a)).
% 0.56/0.45 thf(func_def_171, type, sK106: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_172, type, sK107: (tree_a > a)).
% 0.56/0.45 thf(func_def_173, type, sK108: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_174, type, sK109: (multiset_a > a)).
% 0.56/0.45 thf(func_def_175, type, sK110: (multiset_a > multiset_a)).
% 0.56/0.45 thf(func_def_176, type, sK111: ((($o > a) > a) > $o > a)).
% 0.56/0.45 thf(func_def_177, type, sK112: ((($o > a) > a) > $o > a)).
% 0.56/0.45 thf(func_def_178, type, sK113: ((($o > a) > $o > a) > $o > a)).
% 0.56/0.45 thf(func_def_179, type, sK114: ((($o > a) > $o > a) > $o > a)).
% 0.56/0.45 thf(func_def_180, type, sK115: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_181, type, sK116: (tree_a > a)).
% 0.56/0.45 thf(func_def_182, type, sK117: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_183, type, sK118: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_184, type, sK119: (tree_a > a)).
% 0.56/0.45 thf(func_def_185, type, sK120: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_186, type, sK121: (tree_a > a)).
% 0.56/0.45 thf(func_def_187, type, sK122: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_188, type, sK123: (tree_a > a)).
% 0.56/0.45 thf(func_def_189, type, sK124: (tree_a > a)).
% 0.56/0.45 thf(func_def_190, type, sK125: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_191, type, sK126: (tree_a > a)).
% 0.56/0.45 thf(func_def_192, type, sK127: (tree_a > a)).
% 0.56/0.45 thf(func_def_193, type, sK128: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_194, type, sK129: (tree_a > tree_a)).
% 0.56/0.45 thf(func_def_195, type, sK130: (tree_a > a)).
% 0.56/0.45 thf(func_def_196, type, sK131: ((($o > a) > a) > $o > a)).
% 0.56/0.45 thf(func_def_197, type, sK132: ((($o > a) > a) > $o > a)).
% 0.56/0.45 thf(func_def_198, type, sK133: ((($o > a) > a) > $o > a)).
% 0.56/0.45 thf(func_def_199, type, sK134: ((($o > a) > a) > $o > a)).
% 0.56/0.45 thf(func_def_200, type, sK135: ((a > $o > a) > a)).
% 0.56/0.45 thf(func_def_201, type, sK136: ((a > $o > a) > a)).
% 0.56/0.45 thf(func_def_202, type, sK137: (($o > a) > ($o > a) > $o)).
% 0.56/0.45 thf(func_def_203, type, sK138: ((a > a > $o) > a)).
% 0.56/0.45 thf(func_def_204, type, vNOT: ($o > $o)).
% 0.56/0.45 thf(f1,axiom,(
% 0.56/0.45 (is_heap_a @ ra)),
% 0.56/0.45 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__C4_Oprems_C_I2_J)).
% 0.56/0.45 thf(f5,axiom,(
% 0.56/0.45 (ord_less_eq_a @ v1 @ v2)),
% 0.56/0.45 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4_True)).
% 0.56/0.45 thf(f6,axiom,(
% 0.56/0.45 (((t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))) = ((t_a @ va @ la @ ra)))),
% 0.56/0.45 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_5__C4_Oprems_C_I3_J)).
% 0.56/0.45 thf(f23,axiom,(
% 0.56/0.45 ! [X0 : a,X2 : tree_a,X1 : tree_a] : (((val_a @ (t_a @ X0 @ X1 @ X2))) = X0)),
% 0.56/0.45 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_22_val_Osimps)).
% 0.56/0.45 thf(f31,axiom,(
% 0.56/0.45 ! [X2 : tree_a,X3 : a,X0 : a,X1 : tree_a] : ((~(ord_less_eq_a @ (val_a @ (t_a @ X0 @ X1 @ X2)) @ X3) => (((heapIm1091024090Down_a @ (t_a @ X3 @ e_a @ (t_a @ X0 @ X1 @ X2)))) = ((t_a @ (val_a @ (t_a @ X0 @ X1 @ X2)) @ e_a @ (heapIm1091024090Down_a @ (t_a @ X3 @ (heapIm1140443833left_a @ (t_a @ X0 @ X1 @ X2)) @ (heapIm1257206334ight_a @ (t_a @ X0 @ X1 @ X2)))))))) & ((ord_less_eq_a @ (val_a @ (t_a @ X0 @ X1 @ X2)) @ X3) => (((heapIm1091024090Down_a @ (t_a @ X3 @ e_a @ (t_a @ X0 @ X1 @ X2)))) = ((t_a @ X3 @ e_a @ (t_a @ X0 @ X1 @ X2))))))),
% 0.56/0.45 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_30_siftDown_Osimps_I4_J)).
% 0.56/0.45 thf(f33,axiom,(
% 0.56/0.45 ! [X2 : tree_a,X0 : a,X1 : a,X3 : tree_a] : (((is_heap_a @ (t_a @ X0 @ e_a @ (t_a @ X1 @ X2 @ X3)))) = (is_heap_a @ (t_a @ X1 @ X2 @ X3)) & (ord_less_eq_a @ (val_a @ (t_a @ X1 @ X2 @ X3)) @ X0))),
% 0.56/0.45 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_32_is__heap_Osimps_I3_J)).
% 0.56/0.45 thf(f35,axiom,(
% 0.56/0.45 ! [X1 : tree_a,X0 : a,X2 : tree_a] : (((heapIm1257206334ight_a @ (t_a @ X0 @ X1 @ X2))) = X2)),
% 0.56/0.45 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_34_right_Osimps)).
% 0.56/0.45 thf(f176,conjecture,(
% 0.56/0.45 (is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))))),
% 0.56/0.45 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)).
% 0.56/0.45 thf(f177,negated_conjecture,(
% 0.56/0.45 ~(is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))))),
% 0.56/0.45 inference(negated_conjecture,[status(cth)],[f176])).
% 0.56/0.45 thf(f283,plain,(
% 0.56/0.45 ! [X0 : tree_a,X1 : a,X2 : a,X3 : tree_a] : ((~(ord_less_eq_a @ (val_a @ (t_a @ X2 @ X3 @ X0)) @ X1) => (((heapIm1091024090Down_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X3 @ X0)))) = ((t_a @ (val_a @ (t_a @ X2 @ X3 @ X0)) @ e_a @ (heapIm1091024090Down_a @ (t_a @ X1 @ (heapIm1140443833left_a @ (t_a @ X2 @ X3 @ X0)) @ (heapIm1257206334ight_a @ (t_a @ X2 @ X3 @ X0)))))))) & ((ord_less_eq_a @ (val_a @ (t_a @ X2 @ X3 @ X0)) @ X1) => (((heapIm1091024090Down_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X3 @ X0)))) = ((t_a @ X1 @ e_a @ (t_a @ X2 @ X3 @ X0))))))),
% 0.56/0.45 inference(rectify,[],[f31])).
% 0.56/0.45 thf(f284,plain,(
% 0.56/0.45 ! [X0 : tree_a,X1 : a,X2 : a,X3 : tree_a] : ((~ ($true = ((ord_less_eq_a @ (val_a @ (t_a @ X2 @ X3 @ X0)) @ X1))) => (((heapIm1091024090Down_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X3 @ X0)))) = ((t_a @ (val_a @ (t_a @ X2 @ X3 @ X0)) @ e_a @ (heapIm1091024090Down_a @ (t_a @ X1 @ (heapIm1140443833left_a @ (t_a @ X2 @ X3 @ X0)) @ (heapIm1257206334ight_a @ (t_a @ X2 @ X3 @ X0)))))))) & (($true = ((ord_less_eq_a @ (val_a @ (t_a @ X2 @ X3 @ X0)) @ X1))) => (((heapIm1091024090Down_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X3 @ X0)))) = ((t_a @ X1 @ e_a @ (t_a @ X2 @ X3 @ X0))))))),
% 0.56/0.45 inference(fool_elimination,[],[f283])).
% 0.56/0.45 thf(f289,plain,(
% 0.56/0.45 ~(is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))))),
% 0.56/0.45 inference(rectify,[],[f177])).
% 0.56/0.45 thf(f290,plain,(
% 0.56/0.45 ~ (((is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))))) = $true)),
% 0.56/0.45 inference(fool_elimination,[],[f289])).
% 0.56/0.45 thf(f373,plain,(
% 0.56/0.45 (is_heap_a @ ra)),
% 0.56/0.45 inference(rectify,[],[f1])).
% 0.56/0.45 thf(f374,plain,(
% 0.56/0.45 (((is_heap_a @ ra)) = $true)),
% 0.56/0.45 inference(fool_elimination,[],[f373])).
% 0.56/0.45 thf(f441,plain,(
% 0.56/0.45 (ord_less_eq_a @ v1 @ v2)),
% 0.56/0.45 inference(rectify,[],[f5])).
% 0.56/0.45 thf(f442,plain,(
% 0.56/0.45 (((ord_less_eq_a @ v1 @ v2)) = $true)),
% 0.56/0.45 inference(fool_elimination,[],[f441])).
% 0.56/0.45 thf(f467,plain,(
% 0.56/0.45 ! [X0 : tree_a,X1 : a,X2 : a,X3 : tree_a] : (((is_heap_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X0 @ X3)))) = (is_heap_a @ (t_a @ X2 @ X0 @ X3)) & (ord_less_eq_a @ (val_a @ (t_a @ X2 @ X0 @ X3)) @ X1))),
% 0.56/0.45 inference(rectify,[],[f33])).
% 0.56/0.45 thf(f468,plain,(
% 0.56/0.45 ! [X0 : tree_a,X1 : a,X2 : a,X3 : tree_a] : (($true = ((is_heap_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X0 @ X3))))) <=> (($true = ((is_heap_a @ (t_a @ X2 @ X0 @ X3)))) & ($true = ((ord_less_eq_a @ (val_a @ (t_a @ X2 @ X0 @ X3)) @ X1)))))),
% 0.56/0.45 inference(fool_elimination,[],[f467])).
% 0.56/0.45 thf(f472,plain,(
% 0.56/0.45 ! [X2 : tree_a,X0 : tree_a,X1 : a] : (((heapIm1257206334ight_a @ (t_a @ X1 @ X0 @ X2))) = X2)),
% 0.56/0.45 inference(rectify,[],[f35])).
% 0.56/0.45 thf(f484,plain,(
% 0.56/0.45 ! [X1 : a,X3 : tree_a,X2 : a,X0 : tree_a] : ((($true != ((ord_less_eq_a @ (val_a @ (t_a @ X2 @ X3 @ X0)) @ X1))) => (((heapIm1091024090Down_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X3 @ X0)))) = ((t_a @ (val_a @ (t_a @ X2 @ X3 @ X0)) @ e_a @ (heapIm1091024090Down_a @ (t_a @ X1 @ (heapIm1140443833left_a @ (t_a @ X2 @ X3 @ X0)) @ (heapIm1257206334ight_a @ (t_a @ X2 @ X3 @ X0)))))))) & (($true = ((ord_less_eq_a @ (val_a @ (t_a @ X2 @ X3 @ X0)) @ X1))) => (((heapIm1091024090Down_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X3 @ X0)))) = ((t_a @ X1 @ e_a @ (t_a @ X2 @ X3 @ X0))))))),
% 0.56/0.45 inference(flattening,[],[f284])).
% 0.56/0.45 thf(f485,plain,(
% 0.56/0.45 (((is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))))) != $true)),
% 0.56/0.45 inference(flattening,[],[f290])).
% 0.56/0.45 thf(f490,plain,(
% 0.56/0.45 ! [X2 : tree_a,X1 : tree_a,X0 : a] : (((val_a @ (t_a @ X0 @ X2 @ X1))) = X0)),
% 0.56/0.45 inference(rectify,[],[f23])).
% 0.56/0.45 thf(f632,plain,(
% 0.56/0.45 ! [X2 : a,X3 : tree_a,X0 : tree_a,X1 : a] : (((((heapIm1091024090Down_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X3 @ X0)))) = ((t_a @ X1 @ e_a @ (t_a @ X2 @ X3 @ X0)))) | ($true != ((ord_less_eq_a @ (val_a @ (t_a @ X2 @ X3 @ X0)) @ X1)))) & ((((heapIm1091024090Down_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X3 @ X0)))) = ((t_a @ (val_a @ (t_a @ X2 @ X3 @ X0)) @ e_a @ (heapIm1091024090Down_a @ (t_a @ X1 @ (heapIm1140443833left_a @ (t_a @ X2 @ X3 @ X0)) @ (heapIm1257206334ight_a @ (t_a @ X2 @ X3 @ X0))))))) | ($true = ((ord_less_eq_a @ (val_a @ (t_a @ X2 @ X3 @ X0)) @ X1)))))),
% 0.56/0.45 inference(ennf_transformation,[],[f484])).
% 0.56/0.45 thf(f731,plain,(
% 0.56/0.45 ! [X0 : tree_a,X1 : tree_a,X2 : a] : (((val_a @ (t_a @ X2 @ X0 @ X1))) = X2)),
% 0.56/0.45 inference(rectify,[],[f490])).
% 0.56/0.45 thf(f771,plain,(
% 0.56/0.45 ! [X0 : a,X1 : tree_a,X2 : tree_a,X3 : a] : (((((t_a @ X3 @ e_a @ (t_a @ X0 @ X1 @ X2))) = ((heapIm1091024090Down_a @ (t_a @ X3 @ e_a @ (t_a @ X0 @ X1 @ X2))))) | (((ord_less_eq_a @ (val_a @ (t_a @ X0 @ X1 @ X2)) @ X3)) != $true)) & ((((heapIm1091024090Down_a @ (t_a @ X3 @ e_a @ (t_a @ X0 @ X1 @ X2)))) = ((t_a @ (val_a @ (t_a @ X0 @ X1 @ X2)) @ e_a @ (heapIm1091024090Down_a @ (t_a @ X3 @ (heapIm1140443833left_a @ (t_a @ X0 @ X1 @ X2)) @ (heapIm1257206334ight_a @ (t_a @ X0 @ X1 @ X2))))))) | (((ord_less_eq_a @ (val_a @ (t_a @ X0 @ X1 @ X2)) @ X3)) = $true)))),
% 0.56/0.45 inference(rectify,[],[f632])).
% 0.56/0.45 thf(f805,plain,(
% 0.56/0.45 ! [X0 : tree_a,X1 : tree_a,X2 : a] : (((heapIm1257206334ight_a @ (t_a @ X2 @ X1 @ X0))) = X0)),
% 0.56/0.45 inference(rectify,[],[f472])).
% 0.56/0.45 thf(f871,plain,(
% 0.56/0.45 ! [X0 : tree_a,X1 : a,X2 : a,X3 : tree_a] : ((($true = ((is_heap_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X0 @ X3))))) | (($true != ((is_heap_a @ (t_a @ X2 @ X0 @ X3)))) | ($true != ((ord_less_eq_a @ (val_a @ (t_a @ X2 @ X0 @ X3)) @ X1))))) & ((($true = ((is_heap_a @ (t_a @ X2 @ X0 @ X3)))) & ($true = ((ord_less_eq_a @ (val_a @ (t_a @ X2 @ X0 @ X3)) @ X1)))) | ($true != ((is_heap_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X0 @ X3)))))))),
% 0.56/0.45 inference(nnf_transformation,[],[f468])).
% 0.56/0.45 thf(f872,plain,(
% 0.56/0.45 ! [X0 : tree_a,X1 : a,X2 : a,X3 : tree_a] : ((($true = ((is_heap_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X0 @ X3))))) | ($true != ((is_heap_a @ (t_a @ X2 @ X0 @ X3)))) | ($true != ((ord_less_eq_a @ (val_a @ (t_a @ X2 @ X0 @ X3)) @ X1)))) & ((($true = ((is_heap_a @ (t_a @ X2 @ X0 @ X3)))) & ($true = ((ord_less_eq_a @ (val_a @ (t_a @ X2 @ X0 @ X3)) @ X1)))) | ($true != ((is_heap_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X0 @ X3)))))))),
% 0.56/0.45 inference(flattening,[],[f871])).
% 0.56/0.45 thf(f926,plain,(
% 0.56/0.45 (((t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))) = ((t_a @ va @ la @ ra)))),
% 0.56/0.45 inference(cnf_transformation,[],[f6])).
% 0.56/0.45 thf(f979,plain,(
% 0.56/0.45 ( ! [X2 : a,X0 : tree_a,X1 : tree_a] : ((((val_a @ (t_a @ X2 @ X0 @ X1))) = X2)) )),
% 0.56/0.45 inference(cnf_transformation,[],[f731])).
% 0.56/0.45 thf(f1037,plain,(
% 0.56/0.45 (((ord_less_eq_a @ v1 @ v2)) = $true)),
% 0.56/0.45 inference(cnf_transformation,[],[f442])).
% 0.56/0.45 thf(f1038,plain,(
% 0.56/0.45 (((is_heap_a @ ra)) = $true)),
% 0.56/0.45 inference(cnf_transformation,[],[f374])).
% 0.56/0.45 thf(f1040,plain,(
% 0.56/0.45 ( ! [X2 : tree_a,X3 : a,X0 : a,X1 : tree_a] : ((((ord_less_eq_a @ (val_a @ (t_a @ X0 @ X1 @ X2)) @ X3)) != $true) | (((t_a @ X3 @ e_a @ (t_a @ X0 @ X1 @ X2))) = ((heapIm1091024090Down_a @ (t_a @ X3 @ e_a @ (t_a @ X0 @ X1 @ X2)))))) )),
% 0.56/0.45 inference(cnf_transformation,[],[f771])).
% 0.56/0.45 thf(f1092,plain,(
% 0.56/0.45 ( ! [X2 : a,X0 : tree_a,X1 : tree_a] : ((((heapIm1257206334ight_a @ (t_a @ X2 @ X1 @ X0))) = X0)) )),
% 0.56/0.45 inference(cnf_transformation,[],[f805])).
% 0.56/0.45 thf(f1128,plain,(
% 0.56/0.45 (((is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))))) != $true)),
% 0.56/0.45 inference(cnf_transformation,[],[f485])).
% 0.56/0.45 thf(f1198,plain,(
% 0.56/0.45 ( ! [X2 : a,X3 : tree_a,X0 : tree_a,X1 : a] : (($true != ((is_heap_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X0 @ X3))))) | ($true = ((ord_less_eq_a @ (val_a @ (t_a @ X2 @ X0 @ X3)) @ X1)))) )),
% 0.56/0.45 inference(cnf_transformation,[],[f872])).
% 0.56/0.45 thf(f1200,plain,(
% 0.56/0.45 ( ! [X2 : a,X3 : tree_a,X0 : tree_a,X1 : a] : (($true != ((ord_less_eq_a @ (val_a @ (t_a @ X2 @ X0 @ X3)) @ X1))) | ($true != ((is_heap_a @ (t_a @ X2 @ X0 @ X3)))) | ($true = ((is_heap_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X0 @ X3)))))) )),
% 0.56/0.45 inference(cnf_transformation,[],[f872])).
% 0.56/0.45 thf(f1293,definition,(
% 0.56/0.45 spl139_2 <=> (((ord_less_eq_a @ v1 @ v2)) = $true)),
% 0.56/0.45 introduced(definition,[new_symbols(definition,[spl139_2])],[avatar_definition])).
% 0.56/0.45 thf(f1295,plain,(
% 0.56/0.45 (((ord_less_eq_a @ v1 @ v2)) = $true) | ~spl139_2),
% 0.56/0.45 inference(avatar_component_clause,[],[f1293])).
% 0.56/0.45 thf(f1296,plain,(
% 0.56/0.45 spl139_2),
% 0.56/0.45 inference(avatar_split_clause,[],[f1037,f1293])).
% 0.56/0.45 thf(f1323,definition,(
% 0.56/0.45 spl139_8 <=> (((t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))) = ((t_a @ va @ la @ ra)))),
% 0.56/0.45 introduced(definition,[new_symbols(definition,[spl139_8])],[avatar_definition])).
% 0.56/0.45 thf(f1325,plain,(
% 0.56/0.45 (((t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))) = ((t_a @ va @ la @ ra))) | ~spl139_8),
% 0.56/0.45 inference(avatar_component_clause,[],[f1323])).
% 0.56/0.45 thf(f1326,plain,(
% 0.56/0.45 spl139_8),
% 0.56/0.45 inference(avatar_split_clause,[],[f926,f1323])).
% 0.56/0.45 thf(f1385,definition,(
% 0.56/0.45 spl139_21 <=> (((is_heap_a @ ra)) = $true)),
% 0.56/0.45 introduced(definition,[new_symbols(definition,[spl139_21])],[avatar_definition])).
% 0.56/0.45 thf(f1388,plain,(
% 0.56/0.45 spl139_21),
% 0.56/0.45 inference(avatar_split_clause,[],[f1038,f1385])).
% 0.56/0.45 thf(f1390,definition,(
% 0.56/0.45 spl139_22 <=> (((is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))))) = $true)),
% 0.56/0.45 introduced(definition,[new_symbols(definition,[spl139_22])],[avatar_definition])).
% 0.56/0.45 thf(f1392,plain,(
% 0.56/0.45 (((is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))))) != $true) | spl139_22),
% 0.56/0.45 inference(avatar_component_clause,[],[f1390])).
% 0.56/0.45 thf(f1393,plain,(
% 0.56/0.45 ~spl139_22),
% 0.56/0.45 inference(avatar_split_clause,[],[f1128,f1390])).
% 0.56/0.45 thf(f1526,plain,(
% 0.56/0.45 (ra = ((heapIm1257206334ight_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))))) | ~spl139_8),
% 0.56/0.45 inference(superposition,[],[f1092,f1325])).
% 0.56/0.45 thf(f1536,plain,(
% 0.56/0.45 (ra = ((t_a @ v1 @ l1 @ r1))) | ~spl139_8),
% 0.56/0.45 inference(forward_demodulation,[],[f1526,f1092])).
% 0.56/0.45 thf(f1554,definition,(
% 0.56/0.45 spl139_39 <=> (ra = ((t_a @ v1 @ l1 @ r1)))),
% 0.56/0.45 introduced(definition,[new_symbols(definition,[spl139_39])],[avatar_definition])).
% 0.56/0.45 thf(f1557,plain,(
% 0.56/0.45 spl139_39 | ~spl139_8),
% 0.56/0.45 inference(avatar_split_clause,[],[f1536,f1323,f1554])).
% 0.56/0.45 thf(f1659,plain,(
% 0.56/0.45 ( ! [X2 : a,X3 : tree_a,X0 : tree_a,X1 : a] : (($true != ((is_heap_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X0 @ X3))))) | (((ord_less_eq_a @ X2 @ X1)) = $true)) )),
% 0.56/0.45 inference(forward_demodulation,[],[f1198,f979])).
% 0.56/0.45 thf(f1783,plain,(
% 0.56/0.45 ( ! [X2 : a,X3 : tree_a,X0 : tree_a,X1 : a] : (($true = ((is_heap_a @ (t_a @ X1 @ e_a @ (t_a @ X2 @ X0 @ X3))))) | (((ord_less_eq_a @ X2 @ X1)) != $true) | ($true != ((is_heap_a @ (t_a @ X2 @ X0 @ X3))))) )),
% 0.56/0.45 inference(forward_demodulation,[],[f1200,f979])).
% 0.56/0.45 thf(f1823,plain,(
% 0.56/0.45 ( ! [X2 : tree_a,X3 : a,X0 : a,X1 : tree_a] : ((((t_a @ X3 @ e_a @ (t_a @ X0 @ X1 @ X2))) = ((heapIm1091024090Down_a @ (t_a @ X3 @ e_a @ (t_a @ X0 @ X1 @ X2))))) | ($true != ((ord_less_eq_a @ X0 @ X3)))) )),
% 0.56/0.45 inference(forward_demodulation,[],[f1040,f979])).
% 0.56/0.45 thf(f1827,plain,(
% 0.56/0.45 (((ord_less_eq_a @ v1 @ v2)) != $true) | ($true != ((is_heap_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))))) | spl139_22),
% 0.56/0.45 inference(superposition,[],[f1392,f1823])).
% 0.56/0.45 thf(f1831,plain,(
% 0.56/0.45 ($true != ((is_heap_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))))) | spl139_22),
% 0.56/0.45 inference(forward_subsumption_resolution,[],[f1827,f1659])).
% 0.56/0.45 thf(f1835,definition,(
% 0.56/0.45 spl139_55 <=> ($true = ((is_heap_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1)))))),
% 0.56/0.45 introduced(definition,[new_symbols(definition,[spl139_55])],[avatar_definition])).
% 0.56/0.45 thf(f1837,plain,(
% 0.56/0.45 ($true != ((is_heap_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))))) | spl139_55),
% 0.56/0.45 inference(avatar_component_clause,[],[f1835])).
% 0.56/0.45 thf(f1838,plain,(
% 0.56/0.45 ~spl139_55 | spl139_22),
% 0.56/0.45 inference(avatar_split_clause,[],[f1831,f1390,f1835])).
% 0.56/0.45 thf(f2094,plain,(
% 0.56/0.45 (((ord_less_eq_a @ v1 @ v2)) != $true) | ($true != ((is_heap_a @ (t_a @ v1 @ l1 @ r1)))) | ($true != $true) | spl139_55),
% 0.56/0.45 inference(superposition,[],[f1837,f1783])).
% 0.56/0.45 thf(f2095,plain,(
% 0.56/0.45 ($true != ((is_heap_a @ (t_a @ v1 @ l1 @ r1)))) | (((ord_less_eq_a @ v1 @ v2)) != $true) | spl139_55),
% 0.56/0.45 inference(trivial_inequality_removal,[],[f2094])).
% 0.56/0.45 thf(f2096,plain,(
% 0.56/0.45 ($true != ((is_heap_a @ (t_a @ v1 @ l1 @ r1)))) | (~spl139_2 | spl139_55)),
% 0.56/0.45 inference(forward_subsumption_resolution,[],[f2095,f1295])).
% 0.56/0.45 thf(f2098,definition,(
% 0.56/0.45 spl139_60 <=> ($true = ((is_heap_a @ (t_a @ v1 @ l1 @ r1))))),
% 0.56/0.45 introduced(definition,[new_symbols(definition,[spl139_60])],[avatar_definition])).
% 0.56/0.45 thf(f2101,plain,(
% 0.56/0.45 ~spl139_60 | ~spl139_2 | spl139_55),
% 0.56/0.45 inference(avatar_split_clause,[],[f2096,f1835,f1293,f2098])).
% 0.56/0.45 thf(f2102,definition,(
% 0.56/0.45 (ra != ((t_a @ v1 @ l1 @ r1))) | (((is_heap_a @ ra)) != $true) | ($true = ((is_heap_a @ (t_a @ v1 @ l1 @ r1))))),
% 0.56/0.45 introduced(theory,[theory_tautology_sat_conflict])).
% 0.56/0.45 cnf(s2, plain, spl139_2, inference(sat_conversion,[],[f1296])).
% 0.56/0.45 cnf(s8, plain, spl139_8, inference(sat_conversion,[],[f1326])).
% 0.56/0.45 cnf(s21, plain, spl139_21, inference(sat_conversion,[],[f1388])).
% 0.56/0.45 cnf(s22, plain, ~spl139_22, inference(sat_conversion,[],[f1393])).
% 0.56/0.45 cnf(s41, plain, ~spl139_8 | spl139_39, inference(sat_conversion,[],[f1557])).
% 0.56/0.45 cnf(s58, plain, spl139_22 | ~spl139_55, inference(sat_conversion,[],[f1838])).
% 0.56/0.45 cnf(s63, plain, ~spl139_2 | spl139_55 | ~spl139_60, inference(sat_conversion,[],[f2101])).
% 0.56/0.45 cnf(s64, plain, ~spl139_21 | ~spl139_39 | spl139_60, inference(sat_conversion,[],[f2102])).
% 0.56/0.45 cnf(s67, plain, ~spl139_55, inference(rat,[],[s58,s22])).
% 0.56/0.45 cnf(s69, plain, spl139_39, inference(rat,[],[s41,s8])).
% 0.56/0.45 cnf(s73, plain, spl139_60, inference(rat,[],[s64,s21,s69])).
% 0.56/0.45 cnf(s77, plain, ~spl139_2, inference(rat,[],[s63,s67,s73])).
% 0.56/0.45 cnf(s90, plain, $false, inference(rat,[],[s2,s77])).
% 0.56/0.45 thf(f2103,plain,(
% 0.56/0.45 $false),
% 0.56/0.45 inference(avatar_sat_refutation,[],[s90])).
% 0.56/0.45 % SZS output end Proof for theBenchmark
% 0.56/0.45 % (802998)------------------------------
% 0.56/0.45 % (802998)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.45 % (802998)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.45 % (802998)CaDiCaL version: 2.1.3
% 0.56/0.45 % (802998)Termination reason: Refutation
% 0.56/0.45 % (802998)Time elapsed: 0.108 s
% 0.56/0.45 % (802998)Peak memory usage: 15 MB
% 0.56/0.45 % (802998)Instructions burned: 209 (million)
% 0.56/0.45 % (802990)Success in time 0.162 s
% 0.56/0.45 % Vampire exiting
%------------------------------------------------------------------------------