%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP081^2 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:15 AM UTC 2026
% Result : Theorem 1.12s 0.52s
% Output : Refutation 1.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP081^2 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n019.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 19:48:48 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.21/0.29 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.28/0.45 % (1260981)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.28/0.45 % (1260990)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2412168505:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.28/0.45 % (1260986)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=983858866:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.28/0.45 % (1260987)lrs+10_16_si=on:nwc=1.5:random_seed=3408376992:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.28/0.45 % (1260988)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2565213889:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.28/0.45 % (1260989)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=206110030: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.28/0.45 % (1260990)Instruction limit reached!
% 0.28/0.45 % (1260990)------------------------------
% 0.28/0.45 % (1260990)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.28/0.45 % (1260990)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.28/0.45 % (1260990)CaDiCaL version: 2.1.3
% 0.28/0.45 % (1260990)Termination reason: Instruction limit
% 0.28/0.45 % (1260990)Termination phase: shuffling
% 0.28/0.45 % (1260990)Time elapsed: 0.008 s
% 0.28/0.45 % (1260990)Peak memory usage: 10 MB
% 0.28/0.45 % (1260990)Instructions burned: 33 (million)
% 0.28/0.45 % (1260988)Instruction limit reached!
% 0.28/0.45 % (1260988)------------------------------
% 0.28/0.45 % (1260988)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.28/0.45 % (1260988)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.28/0.45 % (1260988)CaDiCaL version: 2.1.3
% 0.28/0.45 % (1260988)Termination reason: Instruction limit
% 0.28/0.45 % (1260988)Termination phase: shuffling
% 0.28/0.45 % (1260988)Time elapsed: 0.002 s
% 0.28/0.45 % (1260988)Peak memory usage: 10 MB
% 0.28/0.45 % (1260988)Instructions burned: 3 (million)
% 0.28/0.45 % (1260992)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.28/0.45 % (1260992)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.28/0.45 % (1260992)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=3699601484:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.28/0.45 % (1260987)Instruction limit reached!
% 0.28/0.45 % (1260987)------------------------------
% 0.28/0.45 % (1260987)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.28/0.45 % (1260987)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.28/0.45 % (1260987)CaDiCaL version: 2.1.3
% 0.28/0.45 % (1260987)Termination reason: Instruction limit
% 0.28/0.45 % (1260987)Termination phase: shuffling
% 0.28/0.45 % (1260987)Time elapsed: 0.009 s
% 0.28/0.45 % (1260987)Peak memory usage: 10 MB
% 0.28/0.45 % (1260987)Instructions burned: 19 (million)
% 0.28/0.45 % (1260999)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=2849955966:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.28/0.45 % (1260991)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2918689108:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.28/0.45 % (1260999)Instruction limit reached!
% 0.28/0.45 % (1260999)------------------------------
% 0.28/0.45 % (1260999)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.28/0.45 % (1260999)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.28/0.45 % (1260999)CaDiCaL version: 2.1.3
% 0.28/0.45 % (1260999)Termination reason: Instruction limit
% 0.28/0.45 % (1260999)Termination phase: shuffling
% 0.28/0.45 % (1260999)Time elapsed: 0.002 s
% 0.28/0.45 % (1260999)Peak memory usage: 10 MB
% 0.28/0.45 % (1260999)Instructions burned: 8 (million)
% 0.28/0.45 % (1260998)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=19645326:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 1.12/0.48 % (1261001)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 1.12/0.48 % (1260998)Instruction limit reached!
% 1.12/0.48 % (1260998)------------------------------
% 1.12/0.48 % (1260998)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.48 % (1260998)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.48 % (1260998)CaDiCaL version: 2.1.3
% 1.12/0.48 % (1260998)Termination reason: Instruction limit
% 1.12/0.48 % (1260998)Termination phase: shuffling
% 1.12/0.48 % (1260998)Time elapsed: 0.002 s
% 1.12/0.48 % (1260998)Peak memory usage: 10 MB
% 1.12/0.48 % (1260998)Instructions burned: 3 (million)
% 1.12/0.48 % (1261001)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=3676649387:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 1.12/0.48 % (1261001)Instruction limit reached!
% 1.12/0.48 % (1261001)------------------------------
% 1.12/0.48 % (1261001)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.48 % (1261001)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.48 % (1261001)CaDiCaL version: 2.1.3
% 1.12/0.48 % (1261001)Termination reason: Instruction limit
% 1.12/0.48 % (1261001)Termination phase: shuffling
% 1.12/0.48 % (1261001)Time elapsed: 0.004 s
% 1.12/0.48 % (1261001)Peak memory usage: 10 MB
% 1.12/0.48 % (1261001)Instructions burned: 8 (million)
% 1.12/0.48 % (1261004)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=594154129:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 1.12/0.48 % (1260986)Instruction limit reached!
% 1.12/0.48 % (1260986)------------------------------
% 1.12/0.48 % (1260986)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.48 % (1260986)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.48 % (1260986)CaDiCaL version: 2.1.3
% 1.12/0.48 % (1260986)Termination reason: Instruction limit
% 1.12/0.48 % (1260986)Termination phase: Preprocessing 3
% 1.12/0.48 % (1260986)Time elapsed: 0.040 s
% 1.12/0.48 % (1260986)Peak memory usage: 12 MB
% 1.12/0.48 % (1260986)Instructions burned: 88 (million)
% 1.12/0.48 % (1261006)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 1.12/0.48 % (1261006)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 1.12/0.48 % (1261004)Instruction limit reached!
% 1.12/0.48 % (1261004)------------------------------
% 1.12/0.48 % (1261004)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.48 % (1261004)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.48 % (1261004)CaDiCaL version: 2.1.3
% 1.12/0.48 % (1261004)Termination reason: Instruction limit
% 1.12/0.48 % (1261004)Termination phase: shuffling
% 1.12/0.48 % (1261004)Time elapsed: 0.006 s
% 1.12/0.48 % (1261004)Peak memory usage: 10 MB
% 1.12/0.48 % (1261004)Instructions burned: 13 (million)
% 1.12/0.48 % (1261006)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=594039194:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 1.12/0.48 % (1261008)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=1131664213:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 1.12/0.48 % (1261011)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 1.12/0.48 % (1261011)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=4137235098:i=2:add=on:rtra=on_2998 on theBenchmark for (2998ds/2Mi)
% 1.12/0.48 % (1261011)Instruction limit reached!
% 1.12/0.48 % (1261011)------------------------------
% 1.12/0.48 % (1261011)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.48 % (1261011)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.48 % (1261011)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1261011)Termination reason: Instruction limit
% 1.12/0.52 % (1261011)Termination phase: shuffling
% 1.12/0.52 % (1261011)Time elapsed: 0.001 s
% 1.12/0.52 % (1261011)Peak memory usage: 10 MB
% 1.12/0.52 % (1261011)Instructions burned: 3 (million)
% 1.12/0.52 % (1261006)Instruction limit reached!
% 1.12/0.52 % (1261006)------------------------------
% 1.12/0.52 % (1261006)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1261006)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1261006)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1261006)Termination reason: Instruction limit
% 1.12/0.52 % (1261006)Termination phase: shuffling
% 1.12/0.52 % (1261006)Time elapsed: 0.013 s
% 1.12/0.52 % (1261006)Peak memory usage: 10 MB
% 1.12/0.52 % (1261006)Instructions burned: 28 (million)
% 1.12/0.52 % (1261010)lrs+10_1_si=on:cs=on:random_seed=3249581158:i=8:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/8Mi)
% 1.12/0.52 % (1261010)Instruction limit reached!
% 1.12/0.52 % (1261010)------------------------------
% 1.12/0.52 % (1261010)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1261010)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1261010)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1261010)Termination reason: Instruction limit
% 1.12/0.52 % (1261010)Termination phase: shuffling
% 1.12/0.52 % (1261010)Time elapsed: 0.004 s
% 1.12/0.52 % (1261010)Peak memory usage: 10 MB
% 1.12/0.52 % (1261010)Instructions burned: 9 (million)
% 1.12/0.52 % (1261015)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=2307412565:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/38Mi)
% 1.12/0.52 % (1261015)Instruction limit reached!
% 1.12/0.52 % (1261015)------------------------------
% 1.12/0.52 % (1261015)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1261015)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1261015)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1261015)Termination reason: Instruction limit
% 1.12/0.52 % (1261015)Termination phase: Property scanning
% 1.12/0.52 % (1261015)Time elapsed: 0.009 s
% 1.12/0.52 % (1261015)Peak memory usage: 10 MB
% 1.12/0.52 % (1261015)Instructions burned: 39 (million)
% 1.12/0.52 % (1260991)Instruction limit reached!
% 1.12/0.52 % (1260991)------------------------------
% 1.12/0.52 % (1260991)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1260991)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1260991)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1260991)Termination reason: Instruction limit
% 1.12/0.52 % (1260991)Termination phase: Preprocessing 3
% 1.12/0.52 % (1260991)Time elapsed: 0.060 s
% 1.12/0.52 % (1260991)Peak memory usage: 11 MB
% 1.12/0.52 % (1260991)Instructions burned: 75 (million)
% 1.12/0.52 % (1261016)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=1279843846:st=2:i=249:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/249Mi)
% 1.12/0.52 % (1261018)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=483397830:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/25Mi)
% 1.12/0.52 % (1261020)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=2960781638:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2998 on theBenchmark for (2998ds/14Mi)
% 1.12/0.52 % (1261020)Instruction limit reached!
% 1.12/0.52 % (1261020)------------------------------
% 1.12/0.52 % (1261020)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1261020)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1261020)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1261020)Termination reason: Instruction limit
% 1.12/0.52 % (1261020)Termination phase: shuffling
% 1.12/0.52 % (1261020)Time elapsed: 0.003 s
% 1.12/0.52 % (1261020)Peak memory usage: 10 MB
% 1.12/0.52 % (1261020)Instructions burned: 16 (million)
% 1.12/0.52 % (1261008)Instruction limit reached!
% 1.12/0.52 % (1261008)------------------------------
% 1.12/0.52 % (1261008)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1261008)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1261008)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1261008)Termination reason: Instruction limit
% 1.12/0.52 % (1261008)Termination phase: Preprocessing 1
% 1.12/0.52 % (1261008)Time elapsed: 0.038 s
% 1.12/0.52 % (1261008)Peak memory usage: 11 MB
% 1.12/0.52 % (1261008)Instructions burned: 89 (million)
% 1.12/0.52 % (1261018)Instruction limit reached!
% 1.12/0.52 % (1261018)------------------------------
% 1.12/0.52 % (1261018)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1261018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1261018)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1261018)Termination reason: Instruction limit
% 1.12/0.52 % (1261018)Termination phase: shuffling
% 1.12/0.52 % (1261018)Time elapsed: 0.011 s
% 1.12/0.52 % (1261018)Peak memory usage: 10 MB
% 1.12/0.52 % (1261018)Instructions burned: 25 (million)
% 1.12/0.52 % (1261022)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=3839508686:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/327Mi)
% 1.12/0.52 % (1261025)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=516210602:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/14Mi)
% 1.12/0.52 % (1261025)Instruction limit reached!
% 1.12/0.52 % (1261025)------------------------------
% 1.12/0.52 % (1261025)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1261025)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1261025)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1261025)Termination reason: Instruction limit
% 1.12/0.52 % (1261025)Termination phase: shuffling
% 1.12/0.52 % (1261025)Time elapsed: 0.003 s
% 1.12/0.52 % (1261025)Peak memory usage: 10 MB
% 1.12/0.52 % (1261025)Instructions burned: 15 (million)
% 1.12/0.52 % (1261026)ott+21_20_to=lpo:sil=128000:tgt=ground:si=on:sp=arity:lma=off:uwa=off:foolp=on:random_seed=1312930231:st=4:i=2:add=off:sd=3:nm=16:fsr=off:rtra=on:ss=axioms:sgt=8:ntd=on_2998 on theBenchmark for (2998ds/2Mi)
% 1.12/0.52 % (1261026)Instruction limit reached!
% 1.12/0.52 % (1261026)------------------------------
% 1.12/0.52 % (1261026)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1261026)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1261026)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1261026)Termination reason: Instruction limit
% 1.12/0.52 % (1261026)Termination phase: shuffling
% 1.12/0.52 % (1261026)Time elapsed: 0.003 s
% 1.12/0.52 % (1261026)Peak memory usage: 10 MB
% 1.12/0.52 % (1261026)Instructions burned: 7 (million)
% 1.12/0.52 % (1261028)ott+1004_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=unary_frequency:cbe=off:uwa=off:nwc=1:random_seed=303002294:i=26:ep=R:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/26Mi)
% 1.12/0.52 % (1261030)dis+1002_16_sil=128000:si=on:sp=occurrence:random_seed=774276208:cond=fast:i=23:hud=1:av=off:rtra=on:fe=abstraction:ntd=on_2998 on theBenchmark for (2998ds/23Mi)
% 1.12/0.52 % (1260992)Instruction limit reached!
% 1.12/0.52 % (1260992)------------------------------
% 1.12/0.52 % (1260992)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1260992)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1260992)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1260992)Termination reason: Instruction limit
% 1.12/0.52 % (1260992)Termination phase: Property scanning
% 1.12/0.52 % (1260992)Time elapsed: 0.108 s
% 1.12/0.52 % (1260992)Peak memory usage: 12 MB
% 1.12/0.52 % (1260992)Instructions burned: 157 (million)
% 1.12/0.52 % (1261030)Instruction limit reached!
% 1.12/0.52 % (1261030)------------------------------
% 1.12/0.52 % (1261030)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1261030)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1261030)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1261030)Termination reason: Instruction limit
% 1.12/0.52 % (1261030)Termination phase: shuffling
% 1.12/0.52 % (1261030)Time elapsed: 0.006 s
% 1.12/0.52 % (1261030)Peak memory usage: 10 MB
% 1.12/0.52 % (1261030)Instructions burned: 27 (million)
% 1.12/0.52 % (1261028)Instruction limit reached!
% 1.12/0.52 % (1261028)------------------------------
% 1.12/0.52 % (1261028)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1261028)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1261028)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1261028)Termination reason: Instruction limit
% 1.12/0.52 % (1261028)Termination phase: shuffling
% 1.12/0.52 % (1261028)Time elapsed: 0.012 s
% 1.12/0.52 % (1261028)Peak memory usage: 10 MB
% 1.12/0.52 % (1261028)Instructions burned: 26 (million)
% 1.12/0.52 % (1261036)WARNING Broken Constraint: if choice_reasoning(on) has been set then choice_ax(on) is equal to off
% 1.12/0.52 % (1261036)lrs+1010_4:1_slsqr=8,1:to=kbo:cha=on:drc=off:si=on:sp=arity:lcm=predicate:uwa=off:fd=preordered:gs=on:nwc=5:s2agt=32:slsqc=1:kmz=on:updr=off:chr=on:pe=on:slsq=on:random_seed=3591139706:i=8:nm=2:rtra=on:fe=abstraction:inj=on_2998 on theBenchmark for (2998ds/8Mi)
% 1.12/0.52 % (1261036)Instruction limit reached!
% 1.12/0.52 % (1261036)------------------------------
% 1.12/0.52 % (1261036)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1261036)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1261036)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1261036)Termination reason: Instruction limit
% 1.12/0.52 % (1261036)Termination phase: shuffling
% 1.12/0.52 % (1261036)Time elapsed: 0.002 s
% 1.12/0.52 % (1261036)Peak memory usage: 10 MB
% 1.12/0.52 % (1261036)Instructions burned: 10 (million)
% 1.12/0.52 % (1261032)lrs+1002_1024_sil=128000:tgt=ground:fde=none:e2e=on:si=on:uwa=off:nwc=1:random_seed=1717051961:cond=on:i=60:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/60Mi)
% 1.12/0.52 % (1261035)WARNING Broken Constraint: if sine_to_age_generality_threshold(10) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 1.12/0.52 % (1261035)WARNING Broken Constraint: if lrs_weight_limit_only(on) has been set then saturation_algorithm(otter) is equal to lrs
% 1.12/0.52 % (1261035)ott+21_1_to=kbo:sil=128000:cnfonf=lazy_gen:bsd=on:si=on:sp=const_frequency:lma=off:uwa=off:foolp=on:s2agt=10:lwlo=on:random_seed=982374358:i=14:add=off:nm=40:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 1.12/0.52 % (1261039)dis+10_1024_sil=128000:cnfonf=off:si=on:fd=off:random_seed=3772735753:i=7:hud=5:bd=preordered:rtra=on:bet=on_2998 on theBenchmark for (2998ds/7Mi)
% 1.12/0.52 % (1261037)dis+1004_50_to=lpo:drc=off:fde=unused:cnfonf=lazy_not_gen_be_off:si=on:sp=reverse_arity:spb=units:cbe=off:foolp=on:random_seed=2121631430:uwa_fpi=on:i=31:doe=on:bd=preordered:rtra=on:fsd=on_2998 on theBenchmark for (2998ds/31Mi)
% 1.12/0.52 % (1261039)Instruction limit reached!
% 1.12/0.52 % (1261039)------------------------------
% 1.12/0.52 % (1261039)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1261039)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1261039)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1261039)Termination reason: Instruction limit
% 1.12/0.52 % (1261039)Termination phase: shuffling
% 1.12/0.52 % (1261039)Time elapsed: 0.002 s
% 1.12/0.52 % (1261039)Peak memory usage: 10 MB
% 1.12/0.52 % (1261039)Instructions burned: 12 (million)
% 1.12/0.52 % (1261035)Instruction limit reached!
% 1.12/0.52 % (1261035)------------------------------
% 1.12/0.52 % (1261035)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1261035)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1261035)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1261035)Termination reason: Instruction limit
% 1.12/0.52 % (1261035)Termination phase: shuffling
% 1.12/0.52 % (1261035)Time elapsed: 0.007 s
% 1.12/0.52 % (1261035)Peak memory usage: 10 MB
% 1.12/0.52 % (1261035)Instructions burned: 15 (million)
% 1.12/0.52 % (1261016) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1260981-1261016"...
% 1.12/0.52 % (1261016)...printing done.
% 1.12/0.52 % (1261044)lrs+10_1_plsq=on:drc=ordering:cnfonf=lazy_not_gen_be_off:bsd=on:si=on:plsqr=32,1:cs=on:random_seed=3580927453:i=23:rtra=on:ntd=on_2997 on theBenchmark for (2997ds/23Mi)
% 1.12/0.52 % (1261016)Refutation found. Thanks to Tanya!
% 1.12/0.52 % SZS status Theorem for theBenchmark
% 1.12/0.52 % SZS output start Proof for theBenchmark
% 1.12/0.52 thf(type_def_5, type, product_prod: ($tType * $tType) > $tType).
% 1.12/0.52 thf(type_def_6, type, option: $tType > $tType).
% 1.12/0.52 thf(type_def_7, type, list: $tType > $tType).
% 1.12/0.52 thf(type_def_8, type, set: $tType > $tType).
% 1.12/0.52 thf(type_def_9, type, edgeD: $tType).
% 1.12/0.52 thf(type_def_10, type, node: $tType).
% 1.12/0.52 thf(type_def_11, type, val: $tType).
% 1.12/0.52 thf(type_def_12, type, g: $tType).
% 1.12/0.52 thf(type_def_13, type, sTfun: ($tType * $tType) > $tType).
% 1.12/0.52 thf(func_def_0, type, type: !>[X0: $tType]:($o)).
% 1.12/0.52 thf(func_def_1, type, ord: !>[X0: $tType]:($o)).
% 1.12/0.52 thf(func_def_2, type, linorder: !>[X0: $tType]:($o)).
% 1.12/0.52 thf(func_def_3, type, finite_finite: !>[X0: $tType]:((set @ X0 > $o))).
% 1.12/0.52 thf(func_def_4, type, graph_1146196722h_path: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > list @ X1) > (X0 > $o) > (X0 > X1 > list @ product_prod @ X1 @ X2) > X0 > list @ X1 > $o))).
% 1.12/0.52 thf(func_def_5, type, graph_1661282752_path2: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > list @ X1) > (X0 > $o) > (X0 > X1 > list @ product_prod @ X1 @ X2) > X0 > X1 > list @ X1 > X1 > $o))).
% 1.12/0.52 thf(func_def_6, type, graph_1201503639essors: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1 > list @ product_prod @ X1 @ X2) > X0 > X1 > list @ X1))).
% 1.12/0.52 thf(func_def_7, type, append: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_8, type, butlast: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_9, type, cons: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_10, type, nil: !>[X0: $tType]:(list @ X0)).
% 1.12/0.52 thf(func_def_11, type, hd: !>[X0: $tType]:((list @ X0 > X0))).
% 1.12/0.52 thf(func_def_12, type, set2: !>[X0: $tType]:((list @ X0 > set @ X0))).
% 1.12/0.52 thf(func_def_13, type, tl: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_14, type, ord_less_eq: !>[X0: $tType]:((X0 > X0 > $o))).
% 1.12/0.52 thf(func_def_15, type, sSA_CFG_SSA_phiUses: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:(((X0 > list @ X1) > (X0 > X1 > list @ product_prod @ X1 @ X2) > (X0 > product_prod @ X1 @ X3 > option @ list @ X3) > X0 > X1 > set @ X3))).
% 1.12/0.52 thf(func_def_16, type, sSA_CF1081484811efNode: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > list @ X1) > (X0 > X1 > set @ X2) > (X0 > product_prod @ X1 @ X2 > option @ list @ X2) > X0 > X2 > X1))).
% 1.12/0.52 thf(func_def_17, type, sSA_CF1165125185phiArg: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > list @ X1) > (X0 > X1 > set @ X2) > (X0 > product_prod @ X1 @ X2 > option @ list @ X2) > X0 > X2 > X2 > $o))).
% 1.12/0.52 thf(func_def_18, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 1.12/0.52 thf(func_def_19, type, prefix: !>[X0: $tType]:((list @ X0 > list @ X0 > $o))).
% 1.12/0.52 thf(func_def_20, type, suffix: !>[X0: $tType]:((list @ X0 > list @ X0 > $o))).
% 1.12/0.52 thf(func_def_21, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 1.12/0.52 thf(func_def_22, type, alpha_n: (g > list @ node)).
% 1.12/0.52 thf(func_def_23, type, phi_r: val).
% 1.12/0.52 thf(func_def_24, type, defs: (g > node > set @ val)).
% 1.12/0.52 thf(func_def_25, type, g2: g).
% 1.12/0.52 thf(func_def_26, type, i: node).
% 1.12/0.52 thf(func_def_27, type, inEdges: (g > node > list @ product_prod @ node @ edgeD)).
% 1.12/0.52 thf(func_def_28, type, invar: (g > $o)).
% 1.12/0.52 thf(func_def_29, type, m: node).
% 1.12/0.52 thf(func_def_30, type, ms: list @ node).
% 1.12/0.52 thf(func_def_31, type, ms2: list @ node).
% 1.12/0.52 thf(func_def_32, type, n: node).
% 1.12/0.52 thf(func_def_33, type, ns: list @ node).
% 1.12/0.52 thf(func_def_34, type, phis: (g > product_prod @ node @ val > option @ list @ val)).
% 1.12/0.52 thf(func_def_35, type, pred_phi_r: node).
% 1.12/0.52 thf(func_def_36, type, r: val).
% 1.12/0.52 thf(func_def_37, type, ri: list @ node).
% 1.12/0.52 thf(func_def_38, type, rs: list @ node).
% 1.12/0.52 thf(func_def_39, type, rs2: list @ node).
% 1.12/0.52 thf(func_def_40, type, s: val).
% 1.12/0.52 thf(func_def_44, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 1.12/0.52 thf(func_def_45, type, vNOT: ($o > $o)).
% 1.12/0.52 thf(func_def_46, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 1.12/0.52 thf(func_def_47, type, db1: !>[X0: $tType]:(X0)).
% 1.12/0.52 thf(func_def_48, type, db0: !>[X0: $tType]:(X0)).
% 1.12/0.52 thf(func_def_49, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 1.12/0.52 thf(func_def_50, type, vAND: ($o > $o > $o)).
% 1.12/0.52 thf(func_def_51, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 1.12/0.52 thf(func_def_52, type, vIMP: ($o > $o > $o)).
% 1.12/0.52 thf(func_def_53, type, db3: !>[X0: $tType]:(X0)).
% 1.12/0.52 thf(func_def_54, type, db2: !>[X0: $tType]:(X0)).
% 1.12/0.52 thf(func_def_55, type, vOR: ($o > $o > $o)).
% 1.12/0.52 thf(func_def_56, type, sP0: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > (X1 > X0 > $o) > $o))).
% 1.12/0.52 thf(func_def_57, type, sP1: !>[X0: $tType]:((X0 > X0 > list @ X0 > list @ X0 > list @ X0 > list @ X0 > $o))).
% 1.12/0.52 thf(func_def_58, type, sP2: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > $o))).
% 1.12/0.52 thf(func_def_59, type, sK3: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_60, type, sK4: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_61, type, sK5: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_62, type, sK6: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_63, type, sK7: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_64, type, sK8: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > $o) > X0 > X0 > $o))).
% 1.12/0.52 thf(func_def_65, type, sK9: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_66, type, sK10: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > $o) > X0 > X0 > $o))).
% 1.12/0.52 thf(func_def_67, type, sK11: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > $o) > X0 > X0 > $o))).
% 1.12/0.52 thf(func_def_68, type, sK12: (node > list @ node > node > node > g > list @ node)).
% 1.12/0.52 thf(func_def_69, type, sK13: (node > list @ node > node > node > g > list @ node)).
% 1.12/0.52 thf(func_def_70, type, sK14: !>[X0: $tType]:((list @ X0 > (X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_71, type, sK15: !>[X0: $tType]:((list @ X0 > (X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_72, type, sK16: !>[X0: $tType]:((list @ X0 > (X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_73, type, sK17: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_74, type, sK18: !>[X0: $tType]:((list @ X0 > X0))).
% 1.12/0.52 thf(func_def_75, type, sK19: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_76, type, sK20: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_77, type, sK21: !>[X0: $tType, X1: $tType]:((((X1 > X0 > $o) > list @ X1 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_78, type, sK22: !>[X0: $tType, X1: $tType]:((((X1 > X0 > $o) > list @ X1 > list @ X0 > $o) > X1 > X0 > $o))).
% 1.12/0.52 thf(func_def_79, type, sK23: !>[X0: $tType, X1: $tType]:((((X1 > X0 > $o) > list @ X1 > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_80, type, sK24: !>[X0: $tType, X1: $tType]:((((X1 > X0 > $o) > list @ X1 > list @ X0 > $o) > X1 > X0 > $o))).
% 1.12/0.52 thf(func_def_81, type, sK25: !>[X0: $tType, X1: $tType]:((((X1 > X0 > $o) > list @ X1 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_82, type, sK26: !>[X0: $tType, X1: $tType]:((((X1 > X0 > $o) > list @ X1 > list @ X0 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_83, type, sK27: !>[X0: $tType, X1: $tType]:((((X1 > X0 > $o) > list @ X1 > list @ X0 > $o) > X1 > X0 > $o))).
% 1.12/0.52 thf(func_def_84, type, sK28: !>[X0: $tType, X1: $tType]:((((X1 > X0 > $o) > list @ X1 > list @ X0 > $o) > X1))).
% 1.12/0.52 thf(func_def_85, type, sK29: !>[X0: $tType, X1: $tType]:((((X1 > X0 > $o) > list @ X1 > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_86, type, sK30: !>[X0: $tType, X1: $tType]:((((X1 > X0 > $o) > list @ X1 > list @ X0 > $o) > X1))).
% 1.12/0.52 thf(func_def_87, type, sK31: !>[X0: $tType, X1: $tType]:((((X1 > X0 > $o) > list @ X1 > list @ X0 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_88, type, sK32: !>[X0: $tType, X1: $tType]:((((X1 > X0 > $o) > list @ X1 > list @ X0 > $o) > X1 > X0 > $o))).
% 1.12/0.52 thf(func_def_89, type, sK33: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_90, type, sK34: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_91, type, sK35: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_92, type, sK36: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_93, type, sK37: (node > list @ node > (node > $o) > g > list @ node)).
% 1.12/0.52 thf(func_def_94, type, sK38: (node > list @ node > (node > $o) > g > node)).
% 1.12/0.52 thf(func_def_95, type, sK39: !>[X0: $tType]:(((X0 > $o) > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_96, type, sK40: !>[X0: $tType]:(((X0 > $o) > list @ X0 > X0))).
% 1.12/0.52 thf(func_def_97, type, sK41: !>[X0: $tType]:(((X0 > $o) > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_98, type, sK42: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > (X1 > X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_99, type, sK43: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > (X1 > X0 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_100, type, sK44: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > (X1 > X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_101, type, sK45: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > (X1 > X0 > $o) > X1))).
% 1.12/0.52 thf(func_def_102, type, sK46: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > (X1 > X0 > $o) > X1))).
% 1.12/0.52 thf(func_def_103, type, sK47: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > (X1 > X0 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_104, type, sK48: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > (X1 > X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_105, type, sK49: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > (X1 > X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_106, type, sK50: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_107, type, sK51: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_108, type, sK52: !>[X0: $tType]:((list @ X0 > list @ X0 > X0 > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_109, type, sK53: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_110, type, sK54: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_111, type, sK55: !>[X0: $tType]:((X0 > list @ X0 > X0 > list @ X0))).
% 1.12/0.52 thf(func_def_112, type, sK56: !>[X0: $tType]:((X0 > list @ X0 > X0 > list @ X0))).
% 1.12/0.52 thf(func_def_113, type, sK57: !>[X0: $tType]:((X0 > list @ X0 > X0 > list @ X0))).
% 1.12/0.52 thf(func_def_114, type, sK58: !>[X0: $tType]:((X0 > list @ X0 > X0 > list @ X0))).
% 1.12/0.52 thf(func_def_115, type, sK59: !>[X0: $tType]:((X0 > list @ X0 > X0 > list @ X0))).
% 1.12/0.52 thf(func_def_116, type, sK60: !>[X0: $tType]:((X0 > list @ X0 > X0 > list @ X0))).
% 1.12/0.52 thf(func_def_117, type, sK61: (node > g > node > list @ node > list @ node)).
% 1.12/0.52 thf(func_def_118, type, sK62: !>[X0: $tType]:((X0 > list @ X0 > X0))).
% 1.12/0.52 thf(func_def_119, type, sK63: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_120, type, sK64: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_121, type, sK65: !>[X0: $tType]:((X0 > X0 > list @ X0 > list @ X0 > list @ X0 > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_122, type, sK66: !>[X0: $tType]:((X0 > X0 > list @ X0 > list @ X0 > list @ X0 > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_123, type, sK67: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_124, type, sK68: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_125, type, sK69: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0 > X0 > list @ X0))).
% 1.12/0.52 thf(func_def_126, type, sK70: !>[X0: $tType]:((list @ X0 > (X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_127, type, sK71: !>[X0: $tType]:((list @ X0 > (X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_128, type, sK72: !>[X0: $tType]:((list @ X0 > (X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_129, type, sK73: ((node > $o) > g > list @ node > node > list @ node)).
% 1.12/0.52 thf(func_def_130, type, sK74: ((node > $o) > g > list @ node > node > node)).
% 1.12/0.52 thf(func_def_131, type, sK75: !>[X0: $tType]:((list @ X0 > X0))).
% 1.12/0.52 thf(func_def_132, type, sK76: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_133, type, sK77: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_134, type, sK78: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_135, type, sK79: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_136, type, sK80: (list @ node > node > node > g > node > list @ node)).
% 1.12/0.52 thf(func_def_137, type, sK81: (list @ node > node > node > g > node > list @ node)).
% 1.12/0.52 thf(func_def_138, type, sK82: !>[X0: $tType, X1: $tType, X2: $tType]:((((X0 > X1 > X2) > list @ X0 > list @ X1 > $o) > X0 > X1 > X2))).
% 1.12/0.52 thf(func_def_139, type, sK83: !>[X0: $tType, X1: $tType, X2: $tType]:((((X0 > X1 > X2) > list @ X0 > list @ X1 > $o) > X1))).
% 1.12/0.52 thf(func_def_140, type, sK84: !>[X0: $tType, X1: $tType, X2: $tType]:((((X0 > X1 > X2) > list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_141, type, sK85: !>[X0: $tType, X1: $tType, X2: $tType]:((((X0 > X1 > X2) > list @ X0 > list @ X1 > $o) > X0 > X1 > X2))).
% 1.12/0.52 thf(func_def_142, type, sK86: !>[X0: $tType, X1: $tType, X2: $tType]:((((X0 > X1 > X2) > list @ X0 > list @ X1 > $o) > X0))).
% 1.12/0.52 thf(func_def_143, type, sK87: !>[X0: $tType, X1: $tType, X2: $tType]:((((X0 > X1 > X2) > list @ X0 > list @ X1 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_144, type, sK88: !>[X0: $tType, X1: $tType, X2: $tType]:((((X0 > X1 > X2) > list @ X0 > list @ X1 > $o) > X0))).
% 1.12/0.52 thf(func_def_145, type, sK89: !>[X0: $tType, X1: $tType, X2: $tType]:((((X0 > X1 > X2) > list @ X0 > list @ X1 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_146, type, sK90: !>[X0: $tType, X1: $tType, X2: $tType]:((((X0 > X1 > X2) > list @ X0 > list @ X1 > $o) > X0 > X1 > X2))).
% 1.12/0.52 thf(func_def_147, type, sK91: !>[X0: $tType, X1: $tType, X2: $tType]:((((X0 > X1 > X2) > list @ X0 > list @ X1 > $o) > X1))).
% 1.12/0.52 thf(func_def_148, type, sK92: !>[X0: $tType, X1: $tType, X2: $tType]:((((X0 > X1 > X2) > list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_149, type, sK93: !>[X0: $tType, X1: $tType, X2: $tType]:((((X0 > X1 > X2) > list @ X0 > list @ X1 > $o) > X0 > X1 > X2))).
% 1.12/0.52 thf(func_def_150, type, sK94: (node > list @ node > g > node > node > list @ node)).
% 1.12/0.52 thf(func_def_151, type, sK95: (node > list @ node > g > node > node > list @ node)).
% 1.12/0.52 thf(func_def_152, type, sK96: (node > list @ node > g > node > node > list @ node)).
% 1.12/0.52 thf(func_def_153, type, sK97: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_154, type, sK98: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0 > X0 > $o))).
% 1.12/0.52 thf(func_def_155, type, sK99: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_156, type, sK100: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_157, type, sK101: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0 > X0 > $o))).
% 1.12/0.52 thf(func_def_158, type, sK102: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_159, type, sK103: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_160, type, sK104: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_161, type, sK105: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0 > X0 > $o))).
% 1.12/0.52 thf(func_def_162, type, sK106: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_163, type, sK107: !>[X0: $tType]:((list @ X0 > X0 > list @ X0))).
% 1.12/0.52 thf(func_def_164, type, sK108: !>[X0: $tType]:((list @ X0 > X0 > list @ X0))).
% 1.12/0.52 thf(func_def_165, type, sK109: !>[X0: $tType]:((list @ X0 > (X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_166, type, sK110: !>[X0: $tType]:((list @ X0 > (X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_167, type, sK111: !>[X0: $tType]:((list @ X0 > (X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_168, type, sK112: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_169, type, sK113: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_170, type, sK114: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_171, type, sK115: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_172, type, sK116: !>[X0: $tType]:((list @ X0 > (X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_173, type, sK117: !>[X0: $tType]:((list @ X0 > (X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_174, type, sK118: !>[X0: $tType]:((list @ X0 > (X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_175, type, sK119: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_176, type, sK120: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_177, type, sK121: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_178, type, sK122: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_179, type, sK123: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_180, type, sK124: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_181, type, sK125: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_182, type, sK126: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > X1))).
% 1.12/0.52 thf(func_def_183, type, sK127: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_184, type, sK128: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > X1))).
% 1.12/0.52 thf(func_def_185, type, sK129: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > X1))).
% 1.12/0.52 thf(func_def_186, type, sK130: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_187, type, sK131: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_188, type, sK132: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_189, type, sK133: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > X1))).
% 1.12/0.52 thf(func_def_190, type, sK134: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_191, type, sK135: !>[X0: $tType]:((list @ X0 > (X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_192, type, sK136: !>[X0: $tType]:((list @ X0 > (X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_193, type, sK137: !>[X0: $tType]:((list @ X0 > (X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_194, type, sK138: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_195, type, sK139: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_196, type, sK140: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_197, type, sK141: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_198, type, sK142: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > X0 > X1))).
% 1.12/0.52 thf(func_def_199, type, sK143: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_200, type, sK144: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > X0))).
% 1.12/0.52 thf(func_def_201, type, sK145: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_202, type, sK146: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > X0 > X1))).
% 1.12/0.52 thf(func_def_203, type, sK147: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_204, type, sK148: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_205, type, sK149: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > X1))).
% 1.12/0.52 thf(func_def_206, type, sK150: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_207, type, sK151: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > X1))).
% 1.12/0.52 thf(func_def_208, type, sK152: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_209, type, sK153: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_210, type, sK154: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_211, type, sK155: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_212, type, sK156: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_213, type, sK157: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_214, type, sK158: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_215, type, sK159: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_216, type, sK160: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_217, type, sK161: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_218, type, sK162: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_219, type, sK163: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_220, type, sK164: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_221, type, sK165: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_222, type, sK166: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X1))).
% 1.12/0.52 thf(func_def_223, type, sK167: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_224, type, sK168: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X0))).
% 1.12/0.52 thf(func_def_225, type, sK169: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_226, type, sK170: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_227, type, sK171: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_228, type, sK172: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_229, type, sK173: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > $o) > X0 > X1))).
% 1.12/0.52 thf(func_def_230, type, sK174: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > $o) > X0 > X1))).
% 1.12/0.52 thf(func_def_231, type, sK175: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_232, type, sK176: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > $o) > X0 > X1))).
% 1.12/0.52 thf(func_def_233, type, sK177: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X1))).
% 1.12/0.52 thf(func_def_234, type, sK178: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_235, type, sK179: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_236, type, sK180: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X1))).
% 1.12/0.52 thf(func_def_237, type, sK181: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.12/0.52 thf(func_def_238, type, sK182: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X0))).
% 1.12/0.52 thf(func_def_239, type, sK183: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_240, type, sK184: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X0))).
% 1.12/0.52 thf(func_def_241, type, sK185: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_242, type, sK186: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_243, type, sK187: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_244, type, sK188: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_245, type, sK189: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_246, type, sK190: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_247, type, sK191: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 1.12/0.52 thf(func_def_248, type, sK192: !>[X0: $tType]:((list @ X0 > X0))).
% 1.12/0.52 thf(func_def_249, type, sK193: !>[X0: $tType, X1: $tType]:(((X0 > X1) > (X0 > X1) > X0))).
% 1.12/0.52 thf(func_def_250, type, sK194: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > $o) > X0 > X0 > $o))).
% 1.12/0.52 thf(func_def_251, type, sK195: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > $o) > X0 > X0 > $o))).
% 1.12/0.52 thf(func_def_252, type, sK196: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_253, type, sK197: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_254, type, sK198: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(func_def_255, type, sK199: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_256, type, sK200: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 1.12/0.52 thf(func_def_257, type, sK201: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.12/0.52 thf(f2,axiom,(
% 1.12/0.52 (i = ((sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r)))),
% 1.12/0.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_ri__is__valid)).
% 1.12/0.52 thf(f4,axiom,(
% 1.12/0.52 (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r))),
% 1.12/0.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_assms_I7_J)).
% 1.12/0.52 thf(f5,axiom,(
% 1.12/0.52 (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r) @ ri @ i)),
% 1.12/0.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4_ri__props_I1_J)).
% 1.12/0.52 thf(f6,axiom,(
% 1.12/0.52 ! [X4 : list @ node,X3 : node,X0 : g,X2 : list @ node,X1 : node,X5 : node] : ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ X2 @ X3) => ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X3 @ X4 @ X5) => (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ (append @ node @ X2 @ (tl @ node @ X4)) @ X5)))),
% 1.12/0.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_5_old_Opath2__app)).
% 1.12/0.52 thf(f264,conjecture,(
% 1.12/0.52 (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append @ node @ ns @ (tl @ node @ ri)) @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r))),
% 1.12/0.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0)).
% 1.12/0.52 thf(f265,negated_conjecture,(
% 1.12/0.52 ~(graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append @ node @ ns @ (tl @ node @ ri)) @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r))),
% 1.12/0.52 inference(negated_conjecture,[status(cth)],[f264])).
% 1.12/0.52 thf(f371,plain,(
% 1.12/0.52 (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r))),
% 1.12/0.52 inference(rectify,[],[f4])).
% 1.12/0.52 thf(f372,plain,(
% 1.12/0.52 (((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r))) = $true)),
% 1.12/0.52 inference(fool_elimination,[],[f371])).
% 1.12/0.52 thf(f389,plain,(
% 1.12/0.52 ! [X0 : list @ node,X1 : node,X2 : g,X3 : list @ node,X4 : node,X5 : node] : ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X2 @ X4 @ X3 @ X1) => ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X2 @ X1 @ X0 @ X5) => (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X2 @ X4 @ (append @ node @ X3 @ (tl @ node @ X0)) @ X5)))),
% 1.12/0.52 inference(rectify,[],[f6])).
% 1.12/0.52 thf(f390,plain,(
% 1.12/0.52 ! [X4 : node,X0 : list @ node,X3 : list @ node,X5 : node,X1 : node,X2 : g] : (($true = ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X2 @ X4 @ X3 @ X1))) => (($true = ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X2 @ X1 @ X0 @ X5))) => ($true = ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X2 @ X4 @ (append @ node @ X3 @ (tl @ node @ X0)) @ X5)))))),
% 1.12/0.52 inference(fool_elimination,[],[f389])).
% 1.12/0.52 thf(f561,plain,(
% 1.12/0.52 ~(graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append @ node @ ns @ (tl @ node @ ri)) @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r))),
% 1.12/0.52 inference(rectify,[],[f265])).
% 1.12/0.52 thf(f562,plain,(
% 1.12/0.52 ~ (((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append @ node @ ns @ (tl @ node @ ri)) @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r))) = $true)),
% 1.12/0.52 inference(fool_elimination,[],[f561])).
% 1.12/0.52 thf(f589,plain,(
% 1.12/0.52 (graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r) @ ri @ i)),
% 1.12/0.52 inference(rectify,[],[f5])).
% 1.12/0.52 thf(f590,plain,(
% 1.12/0.52 (((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r) @ ri @ i)) = $true)),
% 1.12/0.52 inference(fool_elimination,[],[f589])).
% 1.12/0.52 thf(f683,plain,(
% 1.12/0.52 (((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append @ node @ ns @ (tl @ node @ ri)) @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r))) != $true)),
% 1.12/0.52 inference(flattening,[],[f562])).
% 1.12/0.52 thf(f747,plain,(
% 1.12/0.52 ! [X4 : node,X0 : list @ node,X3 : list @ node,X5 : node,X1 : node,X2 : g] : ((($true = ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X2 @ X4 @ (append @ node @ X3 @ (tl @ node @ X0)) @ X5))) | ($true != ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X2 @ X1 @ X0 @ X5)))) | ($true != ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X2 @ X4 @ X3 @ X1))))),
% 1.12/0.52 inference(ennf_transformation,[],[f390])).
% 1.12/0.52 thf(f748,plain,(
% 1.12/0.52 ! [X0 : list @ node,X3 : list @ node,X1 : node,X4 : node,X2 : g,X5 : node] : (($true != ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X2 @ X4 @ X3 @ X1))) | ($true != ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X2 @ X1 @ X0 @ X5))) | ($true = ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X2 @ X4 @ (append @ node @ X3 @ (tl @ node @ X0)) @ X5))))),
% 1.12/0.52 inference(flattening,[],[f747])).
% 1.12/0.52 thf(f938,plain,(
% 1.12/0.52 ! [X0 : list @ node,X1 : list @ node,X2 : node,X3 : node,X4 : g,X5 : node] : (($true != ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X4 @ X3 @ X1 @ X2))) | ($true != ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X4 @ X2 @ X0 @ X5))) | ($true = ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X4 @ X3 @ (append @ node @ X1 @ (tl @ node @ X0)) @ X5))))),
% 1.12/0.52 inference(rectify,[],[f748])).
% 1.12/0.52 thf(f1094,plain,(
% 1.12/0.52 (i = ((sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r)))),
% 1.12/0.52 inference(cnf_transformation,[],[f2])).
% 1.12/0.52 thf(f1131,plain,(
% 1.12/0.52 ( ! [X2 : node,X3 : node,X0 : list @ node,X1 : list @ node,X4 : g,X5 : node] : (($true = ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X4 @ X3 @ (append @ node @ X1 @ (tl @ node @ X0)) @ X5))) | ($true != ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X4 @ X3 @ X1 @ X2))) | ($true != ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ X4 @ X2 @ X0 @ X5)))) )),
% 1.12/0.52 inference(cnf_transformation,[],[f938])).
% 1.12/0.52 thf(f1132,plain,(
% 1.12/0.52 (((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append @ node @ ns @ (tl @ node @ ri)) @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ phi_r))) != $true)),
% 1.12/0.52 inference(cnf_transformation,[],[f683])).
% 1.12/0.52 thf(f1152,plain,(
% 1.12/0.52 (((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r))) = $true)),
% 1.12/0.52 inference(cnf_transformation,[],[f372])).
% 1.12/0.52 thf(f1162,plain,(
% 1.12/0.52 (((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r) @ ri @ i)) = $true)),
% 1.12/0.52 inference(cnf_transformation,[],[f590])).
% 1.12/0.52 thf(f1196,plain,(
% 1.12/0.52 ($true != ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ (append @ node @ ns @ (tl @ node @ ri)) @ i)))),
% 1.12/0.52 inference(forward_demodulation,[],[f1132,f1094])).
% 1.12/0.52 thf(f1197,plain,(
% 1.12/0.52 ( ! [X0 : node] : (($true != ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ X0))) | (((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ X0 @ ri @ i)) != $true) | ($true != $true)) )),
% 1.12/0.52 inference(superposition,[],[f1196,f1131])).
% 1.12/0.52 thf(f1200,plain,(
% 1.12/0.52 ( ! [X0 : node] : (($true != ((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ X0))) | (((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ X0 @ ri @ i)) != $true)) )),
% 1.12/0.52 inference(trivial_inequality_removal,[],[f1197])).
% 1.12/0.52 thf(f1228,plain,(
% 1.12/0.52 ($true != $true) | (((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r) @ ri @ i)) != $true)),
% 1.12/0.52 inference(superposition,[],[f1200,f1152])).
% 1.12/0.52 thf(f1236,plain,(
% 1.12/0.52 (((graph_1661282752_path2 @ g @ node @ edgeD @ alpha_n @ invar @ inEdges @ g2 @ (sSA_CF1081484811efNode @ g @ node @ val @ alpha_n @ defs @ phis @ g2 @ r) @ ri @ i)) != $true)),
% 1.12/0.52 inference(trivial_inequality_removal,[],[f1228])).
% 1.12/0.52 thf(f1242,plain,(
% 1.12/0.52 $false),
% 1.12/0.52 inference(forward_subsumption_resolution,[],[f1236,f1162])).
% 1.12/0.52 % SZS output end Proof for theBenchmark
% 1.12/0.52 % (1261016)------------------------------
% 1.12/0.52 % (1261016)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.52 % (1261016)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.52 % (1261016)CaDiCaL version: 2.1.3
% 1.12/0.52 % (1261016)Termination reason: Refutation
% 1.12/0.52 % (1261016)Time elapsed: 0.079 s
% 1.12/0.52 % (1261016)Peak memory usage: 14 MB
% 1.12/0.52 % (1261016)Instructions burned: 169 (million)
% 1.12/0.52 % (1260981)Success in time 0.221 s
% 1.12/0.52 % Vampire exiting
%------------------------------------------------------------------------------