%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP099^2 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:20 AM UTC 2026
% Result : Theorem 0.63s 0.44s
% Output : Refutation 0.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP099^2 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n008.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 19:54:09 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.23/0.27 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.63/0.42 % (3648795)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.63/0.42 % (3648820)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2155537255:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.63/0.42 % (3648821)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.63/0.42 % (3648821)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.63/0.42 % (3648815)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=4112773157:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.63/0.42 % (3648816)lrs+10_16_si=on:nwc=1.5:random_seed=245713309:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.63/0.42 % (3648818)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=594473387: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.63/0.42 % (3648819)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=4043647868:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.63/0.42 % (3648821)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=407775697:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.63/0.42 % (3648817)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=719818069:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.63/0.42 % (3648817)Instruction limit reached!
% 0.63/0.42 % (3648817)------------------------------
% 0.63/0.42 % (3648817)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.42 % (3648817)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.42 % (3648817)CaDiCaL version: 2.1.3
% 0.63/0.42 % (3648817)Termination reason: Instruction limit
% 0.63/0.42 % (3648817)Termination phase: shuffling
% 0.63/0.42 % (3648817)Time elapsed: 0.003 s
% 0.63/0.42 % (3648817)Peak memory usage: 10 MB
% 0.63/0.42 % (3648817)Instructions burned: 5 (million)
% 0.63/0.42 % (3648816)Instruction limit reached!
% 0.63/0.42 % (3648816)------------------------------
% 0.63/0.42 % (3648816)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.42 % (3648816)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.42 % (3648816)CaDiCaL version: 2.1.3
% 0.63/0.42 % (3648816)Termination reason: Instruction limit
% 0.63/0.42 % (3648816)Termination phase: Property scanning
% 0.63/0.42 % (3648816)Time elapsed: 0.010 s
% 0.63/0.42 % (3648816)Peak memory usage: 10 MB
% 0.63/0.42 % (3648816)Instructions burned: 20 (million)
% 0.63/0.42 % (3648820)Instruction limit reached!
% 0.63/0.42 % (3648820)------------------------------
% 0.63/0.42 % (3648820)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.42 % (3648820)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.42 % (3648820)CaDiCaL version: 2.1.3
% 0.63/0.42 % (3648820)Termination reason: Instruction limit
% 0.63/0.42 % (3648820)Termination phase: Function definition elimination
% 0.63/0.42 % (3648820)Time elapsed: 0.020 s
% 0.63/0.42 % (3648820)Peak memory usage: 12 MB
% 0.63/0.42 % (3648820)Instructions burned: 77 (million)
% 0.63/0.42 % (3648819)Instruction limit reached!
% 0.63/0.42 % (3648819)------------------------------
% 0.63/0.42 % (3648819)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.42 % (3648819)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.42 % (3648819)CaDiCaL version: 2.1.3
% 0.63/0.42 % (3648819)Termination reason: Instruction limit
% 0.63/0.42 % (3648819)Termination phase: Property scanning
% 0.63/0.42 % (3648819)Time elapsed: 0.014 s
% 0.63/0.42 % (3648819)Peak memory usage: 10 MB
% 0.63/0.42 % (3648819)Instructions burned: 29 (million)
% 0.63/0.42 % (3648843)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.63/0.42 % (3648843)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=3531429487:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.63/0.44 % (3648843)Instruction limit reached!
% 0.63/0.44 % (3648843)------------------------------
% 0.63/0.44 % (3648843)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.44 % (3648843)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.44 % (3648843)CaDiCaL version: 2.1.3
% 0.63/0.44 % (3648843)Termination reason: Instruction limit
% 0.63/0.44 % (3648843)Termination phase: shuffling
% 0.63/0.44 % (3648843)Time elapsed: 0.002 s
% 0.63/0.44 % (3648843)Peak memory usage: 10 MB
% 0.63/0.44 % (3648843)Instructions burned: 7 (million)
% 0.63/0.44 % (3648840)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=446580677:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.63/0.44 % (3648840)Instruction limit reached!
% 0.63/0.44 % (3648840)------------------------------
% 0.63/0.44 % (3648840)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.44 % (3648840)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.44 % (3648840)CaDiCaL version: 2.1.3
% 0.63/0.44 % (3648840)Termination reason: Instruction limit
% 0.63/0.44 % (3648840)Termination phase: shuffling
% 0.63/0.44 % (3648840)Time elapsed: 0.003 s
% 0.63/0.44 % (3648840)Peak memory usage: 10 MB
% 0.63/0.44 % (3648840)Instructions burned: 5 (million)
% 0.63/0.44 % (3648844)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=930181377:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.63/0.44 % (3648851)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.63/0.44 % (3648851)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.63/0.44 % (3648851)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=3015541338: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.63/0.44 % (3648844)Instruction limit reached!
% 0.63/0.44 % (3648844)------------------------------
% 0.63/0.44 % (3648844)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.44 % (3648844)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.44 % (3648844)CaDiCaL version: 2.1.3
% 0.63/0.44 % (3648844)Termination reason: Instruction limit
% 0.63/0.44 % (3648844)Termination phase: shuffling
% 0.63/0.44 % (3648844)Time elapsed: 0.006 s
% 0.63/0.44 % (3648844)Peak memory usage: 10 MB
% 0.63/0.44 % (3648844)Instructions burned: 12 (million)
% 0.63/0.44 % (3648815)Instruction limit reached!
% 0.63/0.44 % (3648815)------------------------------
% 0.63/0.44 % (3648815)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.44 % (3648815)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.44 % (3648815)CaDiCaL version: 2.1.3
% 0.63/0.44 % (3648815)Termination reason: Instruction limit
% 0.63/0.44 % (3648815)Termination phase: Property scanning
% 0.63/0.44 % (3648815)Time elapsed: 0.041 s
% 0.63/0.44 % (3648815)Peak memory usage: 12 MB
% 0.63/0.44 % (3648815)Instructions burned: 87 (million)
% 0.63/0.44 % (3648836)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3287334429:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.63/0.44 % (3648851)Instruction limit reached!
% 0.63/0.44 % (3648851)------------------------------
% 0.63/0.44 % (3648851)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.44 % (3648851)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.44 % (3648851)CaDiCaL version: 2.1.3
% 0.63/0.44 % (3648851)Termination reason: Instruction limit
% 0.63/0.44 % (3648851)Termination phase: Property scanning
% 0.63/0.44 % (3648851)Time elapsed: 0.009 s
% 0.63/0.44 % (3648851)Peak memory usage: 10 MB
% 0.63/0.44 % (3648851)Instructions burned: 38 (million)
% 0.63/0.44 % (3648836)Instruction limit reached!
% 0.63/0.44 % (3648836)------------------------------
% 0.63/0.44 % (3648836)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.44 % (3648836)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.44 % (3648836)CaDiCaL version: 2.1.3
% 0.63/0.44 % (3648836)Termination reason: Instruction limit
% 0.63/0.44 % (3648836)Termination phase: shuffling
% 0.63/0.44 % (3648836)Time elapsed: 0.002 s
% 0.63/0.44 % (3648836)Peak memory usage: 10 MB
% 0.63/0.44 % (3648836)Instructions burned: 3 (million)
% 0.63/0.44 % (3648854)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=1903904429:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.63/0.44 % (3648857)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.63/0.44 % (3648862)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=2968014995:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/38Mi)
% 0.63/0.44 % (3648856)lrs+10_1_si=on:cs=on:random_seed=255960852:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.63/0.44 % (3648857)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=2493563877:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.63/0.44 % (3648857)Instruction limit reached!
% 0.63/0.44 % (3648857)------------------------------
% 0.63/0.44 % (3648857)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.44 % (3648857)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.44 % (3648857)CaDiCaL version: 2.1.3
% 0.63/0.44 % (3648857)Termination reason: Instruction limit
% 0.63/0.44 % (3648857)Termination phase: shuffling
% 0.63/0.44 % (3648857)Time elapsed: 0.002 s
% 0.63/0.44 % (3648857)Peak memory usage: 10 MB
% 0.63/0.44 % (3648857)Instructions burned: 3 (million)
% 0.63/0.44 % (3648856)Instruction limit reached!
% 0.63/0.44 % (3648856)------------------------------
% 0.63/0.44 % (3648856)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.44 % (3648856)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.44 % (3648856)CaDiCaL version: 2.1.3
% 0.63/0.44 % (3648856)Termination reason: Instruction limit
% 0.63/0.44 % (3648856)Termination phase: shuffling
% 0.63/0.44 % (3648856)Time elapsed: 0.005 s
% 0.63/0.44 % (3648856)Peak memory usage: 10 MB
% 0.63/0.44 % (3648856)Instructions burned: 10 (million)
% 0.63/0.44 % (3648863)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=2060660262:st=2:i=249:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/249Mi)
% 0.63/0.44 % (3648862)Instruction limit reached!
% 0.63/0.44 % (3648862)------------------------------
% 0.63/0.44 % (3648862)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.44 % (3648862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.44 % (3648862)CaDiCaL version: 2.1.3
% 0.63/0.44 % (3648862)Termination reason: Instruction limit
% 0.63/0.44 % (3648862)Termination phase: Property scanning
% 0.63/0.44 % (3648862)Time elapsed: 0.010 s
% 0.63/0.44 % (3648862)Peak memory usage: 11 MB
% 0.63/0.44 % (3648862)Instructions burned: 41 (million)
% 0.63/0.44 % (3648874)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=615040141:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/25Mi)
% 0.63/0.44 % (3648882)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=77036868:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/327Mi)
% 0.63/0.44 % (3648821)Instruction limit reached!
% 0.63/0.44 % (3648821)------------------------------
% 0.63/0.44 % (3648821)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.44 % (3648821)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.44 % (3648821)CaDiCaL version: 2.1.3
% 0.63/0.44 % (3648821)Termination reason: Instruction limit
% 0.63/0.44 % (3648821)Termination phase: Saturation
% 0.63/0.44 % (3648821)Time elapsed: 0.081 s
% 0.63/0.44 % (3648821)Peak memory usage: 13 MB
% 0.63/0.44 % (3648821)Instructions burned: 158 (million)
% 0.63/0.44 % (3648877)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=2509703259:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2998 on theBenchmark for (2998ds/14Mi)
% 0.63/0.44 % (3648854)Instruction limit reached!
% 0.63/0.44 % (3648854)------------------------------
% 0.63/0.44 % (3648854)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.44 % (3648854)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.44 % (3648854)CaDiCaL version: 2.1.3
% 0.63/0.44 % (3648854)Termination reason: Instruction limit
% 0.63/0.44 % (3648854)Termination phase: Property scanning
% 0.63/0.44 % (3648854)Time elapsed: 0.037 s
% 0.63/0.44 % (3648854)Peak memory usage: 11 MB
% 0.63/0.44 % (3648854)Instructions burned: 88 (million)
% 0.63/0.44 % (3648877)Instruction limit reached!
% 0.63/0.44 % (3648877)------------------------------
% 0.63/0.44 % (3648877)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.44 % (3648877)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.44 % (3648877)CaDiCaL version: 2.1.3
% 0.63/0.44 % (3648877)Termination reason: Instruction limit
% 0.63/0.44 % (3648877)Termination phase: shuffling
% 0.63/0.44 % (3648877)Time elapsed: 0.007 s
% 0.63/0.44 % (3648877)Peak memory usage: 10 MB
% 0.63/0.44 % (3648877)Instructions burned: 15 (million)
% 0.63/0.44 % (3648874)Instruction limit reached!
% 0.63/0.44 % (3648874)------------------------------
% 0.63/0.44 % (3648874)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.44 % (3648874)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.44 % (3648874)CaDiCaL version: 2.1.3
% 0.63/0.44 % (3648874)Termination reason: Instruction limit
% 0.63/0.44 % (3648874)Termination phase: Property scanning
% 0.63/0.44 % (3648874)Time elapsed: 0.011 s
% 0.63/0.44 % (3648874)Peak memory usage: 10 MB
% 0.63/0.44 % (3648874)Instructions burned: 25 (million)
% 0.63/0.44 % (3648893)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=1550176139:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/14Mi)
% 0.63/0.44 % (3648863) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3648795-3648863"...
% 0.63/0.44 % (3648863)...printing done.
% 0.63/0.44 % (3648863)Refutation found. Thanks to Tanya!
% 0.63/0.44 % SZS status Theorem for theBenchmark
% 0.63/0.44 % SZS output start Proof for theBenchmark
% 0.63/0.44 thf(type_def_5, type, list: $tType > $tType).
% 0.63/0.44 thf(type_def_6, type, nat: $tType).
% 0.63/0.44 thf(type_def_7, type, a: $tType).
% 0.63/0.44 thf(type_def_8, type, sTfun: ($tType * $tType) > $tType).
% 0.63/0.44 thf(func_def_0, type, type: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_1, type, size: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_2, type, minus: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_3, type, ord: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_4, type, order: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_5, type, group_add: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_6, type, no_bot: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_7, type, no_top: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_8, type, linorder: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_9, type, preorder: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_10, type, wellorder: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_11, type, dense_order: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_12, type, dense_linorder: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_13, type, cancel_semigroup_add: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_14, type, ordered_ab_group_add: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_15, type, cancel146912293up_add: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_16, type, ordere236663937imp_le: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_17, type, condit1656338222tinuum: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_18, type, condit1037483654norder: !>[X0: $tType]:($o)).
% 0.63/0.44 thf(func_def_19, type, minus_minus: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.63/0.44 thf(func_def_20, type, plus_plus: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.63/0.44 thf(func_def_21, type, if: !>[X0: $tType]:(($o > X0 > X0 > X0))).
% 0.63/0.44 thf(func_def_22, type, list_asc: !>[X0: $tType]:((list @ X0 > $o))).
% 0.63/0.44 thf(func_def_23, type, list_desc: !>[X0: $tType]:((list @ X0 > $o))).
% 0.63/0.44 thf(func_def_24, type, list_strict_asc: !>[X0: $tType]:((list @ X0 > $o))).
% 0.63/0.44 thf(func_def_25, type, list_strict_desc: !>[X0: $tType]:((list @ X0 > $o))).
% 0.63/0.44 thf(func_def_26, type, listIn521021761append: !>[X0: $tType]:((list @ X0 > (nat > X0) > nat > X0))).
% 0.63/0.44 thf(func_def_27, type, listIn1569887318i_drop: !>[X0: $tType]:((nat > (nat > X0) > nat > X0))).
% 0.63/0.44 thf(func_def_28, type, listIn1033672622i_take: !>[X0: $tType]:((nat > (nat > X0) > list @ X0))).
% 0.63/0.44 thf(func_def_29, type, append: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 0.63/0.44 thf(func_def_30, type, drop: !>[X0: $tType]:((nat > list @ X0 > list @ X0))).
% 0.63/0.44 thf(func_def_31, type, last: !>[X0: $tType]:((list @ X0 > X0))).
% 0.63/0.44 thf(func_def_32, type, nth: !>[X0: $tType]:((list @ X0 > nat > X0))).
% 0.63/0.44 thf(func_def_33, type, size_size: !>[X0: $tType]:((X0 > nat))).
% 0.63/0.44 thf(func_def_34, type, ord_less: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.63/0.44 thf(func_def_35, type, ord_less_eq: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.63/0.44 thf(func_def_36, type, f: (nat > a)).
% 0.63/0.44 thf(func_def_37, type, n: nat).
% 0.63/0.44 thf(func_def_38, type, xs: list @ a).
% 0.63/0.44 thf(func_def_42, type, vOR: ($o > $o > $o)).
% 0.63/0.44 thf(func_def_43, type, db1: !>[X0: $tType]:(X0)).
% 0.63/0.44 thf(func_def_44, type, db0: !>[X0: $tType]:(X0)).
% 0.63/0.44 thf(func_def_45, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.63/0.44 thf(func_def_46, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.63/0.44 thf(func_def_47, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.63/0.44 thf(func_def_48, type, vIMP: ($o > $o > $o)).
% 0.63/0.44 thf(func_def_49, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.63/0.44 thf(func_def_50, type, vAND: ($o > $o > $o)).
% 0.63/0.44 thf(func_def_51, type, db2: !>[X0: $tType]:(X0)).
% 0.63/0.44 thf(func_def_52, type, vNOT: ($o > $o)).
% 0.63/0.44 thf(func_def_53, type, sK0: !>[X0: $tType]:((list @ X0 > list @ X0 > nat))).
% 0.63/0.44 thf(func_def_54, type, sK1: !>[X0: $tType]:(((X0 > nat) > (X0 > $o) > X0))).
% 0.63/0.44 thf(func_def_55, type, sK2: ((nat > $o) > nat)).
% 0.63/0.44 thf(func_def_56, type, sK3: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 0.63/0.44 thf(func_def_57, type, sK4: !>[X0: $tType]:(((X0 > $o) > (X0 > nat) > X0))).
% 0.63/0.44 thf(func_def_58, type, sK5: !>[X0: $tType]:((list @ X0 > (nat > X0) > (nat > X0) > list @ X0 > list @ X0))).
% 0.63/0.44 thf(func_def_59, type, sK6: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 0.63/0.44 thf(func_def_60, type, sK7: ((nat > $o) > nat)).
% 0.63/0.44 thf(func_def_61, type, sK8: ((nat > $o) > nat > nat)).
% 0.63/0.44 thf(func_def_62, type, sK9: ((nat > $o) > nat)).
% 0.63/0.44 thf(func_def_63, type, sK10: ((nat > $o) > nat > nat)).
% 0.63/0.44 thf(func_def_64, type, sK11: ((nat > $o) > nat > nat)).
% 0.63/0.44 thf(func_def_65, type, sK12: ((nat > nat) > nat)).
% 0.63/0.44 thf(func_def_66, type, sK13: ((nat > nat) > nat)).
% 0.63/0.44 thf(func_def_67, type, sK14: !>[X0: $tType]:(((X0 > nat) > (X0 > $o) > X0))).
% 0.63/0.44 thf(func_def_68, type, sK15: !>[X0: $tType]:(((X0 > nat) > nat > (X0 > $o) > X0))).
% 0.63/0.44 thf(func_def_69, type, sK16: !>[X0: $tType]:((nat > list @ X0))).
% 0.63/0.44 thf(func_def_71, type, sK18: nat).
% 0.63/0.44 thf(func_def_72, type, sK19: nat).
% 0.63/0.44 thf(f19,axiom,(
% 0.63/0.44 ! [X1 : nat,X0 : nat] : ((X0 != X1) => (~(ord_less @ nat @ X0 @ X1) => (ord_less @ nat @ X1 @ X0)))),
% 0.63/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_18_linorder__neqE__nat)).
% 0.63/0.44 thf(f36,axiom,(
% 0.63/0.44 ! [X0 : $tType,X2 : list @ X0,X1 : nat,X3 : (nat > X0)] : ((ord_less_eq @ nat @ X1 @ (size_size @ list @ X0 @ X2)) => (((listIn1569887318i_drop @ X0 @ X1 @ (listIn521021761append @ X0 @ X2 @ X3))) = ((listIn521021761append @ X0 @ (drop @ X0 @ X1 @ X2) @ X3))))),
% 0.63/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_35_i__append__i__drop__eq1)).
% 0.63/0.44 thf(f37,axiom,(
% 0.63/0.44 ! [X0 : $tType,X3 : (nat > X0),X2 : nat,X1 : list @ X0] : ((ord_less_eq @ nat @ (size_size @ list @ X0 @ X1) @ X2) => (((listIn1569887318i_drop @ X0 @ X2 @ (listIn521021761append @ X0 @ X1 @ X3))) = ((listIn1569887318i_drop @ X0 @ (minus_minus @ nat @ X2 @ (size_size @ list @ X0 @ X1)) @ X3))))),
% 0.63/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_36_i__append__i__drop__eq2)).
% 0.63/0.44 thf(f52,axiom,(
% 0.63/0.44 ! [X0 : nat] : (ord_less_eq @ nat @ X0 @ X0)),
% 0.63/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_51_le__refl)).
% 0.63/0.44 thf(f56,axiom,(
% 0.63/0.44 ! [X1 : nat,X0 : nat] : ((ord_less_eq @ nat @ X0 @ X1) | (ord_less_eq @ nat @ X1 @ X0))),
% 0.63/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_55_nat__le__linear)).
% 0.63/0.44 thf(f70,axiom,(
% 0.63/0.44 ! [X1 : nat,X0 : nat] : ((ord_less @ nat @ X0 @ X1) => (ord_less_eq @ nat @ X0 @ X1))),
% 0.63/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_69_less__imp__le__nat)).
% 0.63/0.44 thf(f72,axiom,(
% 0.63/0.44 ! [X1 : nat,X0 : nat] : (((X0 = X1) | (ord_less @ nat @ X0 @ X1)) => (ord_less_eq @ nat @ X0 @ X1))),
% 0.63/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_71_less__or__eq__imp__le)).
% 0.63/0.44 thf(f282,conjecture,(
% 0.63/0.44 (~(ord_less @ nat @ n @ (size_size @ list @ a @ xs)) => (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) = ((listIn1569887318i_drop @ a @ (minus_minus @ nat @ n @ (size_size @ list @ a @ xs)) @ f)))) & ((ord_less @ nat @ n @ (size_size @ list @ a @ xs)) => (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) = ((listIn521021761append @ a @ (drop @ a @ n @ xs) @ f))))),
% 0.63/0.44 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)).
% 0.63/0.44 thf(f283,negated_conjecture,(
% 0.63/0.44 ~((~(ord_less @ nat @ n @ (size_size @ list @ a @ xs)) => (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) = ((listIn1569887318i_drop @ a @ (minus_minus @ nat @ n @ (size_size @ list @ a @ xs)) @ f)))) & ((ord_less @ nat @ n @ (size_size @ list @ a @ xs)) => (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) = ((listIn521021761append @ a @ (drop @ a @ n @ xs) @ f)))))),
% 0.63/0.44 inference(negated_conjecture,[status(cth)],[f282])).
% 0.63/0.44 thf(f300,plain,(
% 0.63/0.44 ! [X0 : $tType,X1 : (nat > X0),X2 : nat,X3 : list @ X0] : ((ord_less_eq @ nat @ (size_size @ list @ X0 @ X3) @ X2) => (((listIn1569887318i_drop @ X0 @ X2 @ (listIn521021761append @ X0 @ X3 @ X1))) = ((listIn1569887318i_drop @ X0 @ (minus_minus @ nat @ X2 @ (size_size @ list @ X0 @ X3)) @ X1))))),
% 0.63/0.44 inference(rectify,[],[f37])).
% 0.63/0.44 thf(f301,plain,(
% 0.63/0.44 ! [X0 : $tType,X2 : nat,X3 : list @ X0,X1 : (nat > X0)] : ((((ord_less_eq @ nat @ (size_size @ list @ X0 @ X3) @ X2)) = $true) => (((listIn1569887318i_drop @ X0 @ X2 @ (listIn521021761append @ X0 @ X3 @ X1))) = ((listIn1569887318i_drop @ X0 @ (minus_minus @ nat @ X2 @ (size_size @ list @ X0 @ X3)) @ X1))))),
% 0.63/0.44 inference(fool_elimination,[],[f300])).
% 0.63/0.44 thf(f388,plain,(
% 0.63/0.44 ! [X0 : nat,X1 : nat] : ((ord_less_eq @ nat @ X1 @ X0) | (ord_less_eq @ nat @ X0 @ X1))),
% 0.63/0.44 inference(rectify,[],[f56])).
% 0.63/0.44 thf(f389,plain,(
% 0.63/0.44 ! [X0 : nat,X1 : nat] : ((((ord_less_eq @ nat @ X0 @ X1)) = $true) | (((ord_less_eq @ nat @ X1 @ X0)) = $true))),
% 0.63/0.44 inference(fool_elimination,[],[f388])).
% 0.63/0.44 thf(f471,plain,(
% 0.63/0.44 ! [X0 : nat,X1 : nat] : (((X0 = X1) | (ord_less @ nat @ X1 @ X0)) => (ord_less_eq @ nat @ X1 @ X0))),
% 0.63/0.44 inference(rectify,[],[f72])).
% 0.63/0.44 thf(f472,plain,(
% 0.63/0.44 ! [X1 : nat,X0 : nat] : (((((ord_less @ nat @ X1 @ X0)) = $true) | (X0 = X1)) => (((ord_less_eq @ nat @ X1 @ X0)) = $true))),
% 0.63/0.44 inference(fool_elimination,[],[f471])).
% 0.63/0.44 thf(f558,plain,(
% 0.63/0.44 ! [X0 : nat,X1 : nat] : ((ord_less @ nat @ X1 @ X0) => (ord_less_eq @ nat @ X1 @ X0))),
% 0.63/0.44 inference(rectify,[],[f70])).
% 0.63/0.44 thf(f559,plain,(
% 0.63/0.44 ! [X0 : nat,X1 : nat] : ((((ord_less @ nat @ X1 @ X0)) = $true) => (((ord_less_eq @ nat @ X1 @ X0)) = $true))),
% 0.63/0.44 inference(fool_elimination,[],[f558])).
% 0.63/0.44 thf(f713,plain,(
% 0.63/0.44 ! [X0 : nat,X1 : nat] : ((X0 != X1) => (~(ord_less @ nat @ X1 @ X0) => (ord_less @ nat @ X0 @ X1)))),
% 0.63/0.44 inference(rectify,[],[f19])).
% 0.63/0.44 thf(f714,plain,(
% 0.63/0.44 ! [X0 : nat,X1 : nat] : ((X0 != X1) => (~ (((ord_less @ nat @ X1 @ X0)) = $true) => (((ord_less @ nat @ X0 @ X1)) = $true)))),
% 0.63/0.44 inference(fool_elimination,[],[f713])).
% 0.63/0.44 thf(f742,plain,(
% 0.63/0.44 ! [X0 : nat] : (ord_less_eq @ nat @ X0 @ X0)),
% 0.63/0.44 inference(rectify,[],[f52])).
% 0.63/0.44 thf(f743,plain,(
% 0.63/0.44 ! [X0 : nat] : (((ord_less_eq @ nat @ X0 @ X0)) = $true)),
% 0.63/0.44 inference(fool_elimination,[],[f742])).
% 0.63/0.44 thf(f776,plain,(
% 0.63/0.44 ~((~(ord_less @ nat @ n @ (size_size @ list @ a @ xs)) => (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) = ((listIn1569887318i_drop @ a @ (minus_minus @ nat @ n @ (size_size @ list @ a @ xs)) @ f)))) & ((ord_less @ nat @ n @ (size_size @ list @ a @ xs)) => (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) = ((listIn521021761append @ a @ (drop @ a @ n @ xs) @ f)))))),
% 0.63/0.44 inference(rectify,[],[f283])).
% 0.63/0.44 thf(f777,plain,(
% 0.63/0.44 ~((~ (((ord_less @ nat @ n @ (size_size @ list @ a @ xs))) = $true) => (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) = ((listIn1569887318i_drop @ a @ (minus_minus @ nat @ n @ (size_size @ list @ a @ xs)) @ f)))) & ((((ord_less @ nat @ n @ (size_size @ list @ a @ xs))) = $true) => (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) = ((listIn521021761append @ a @ (drop @ a @ n @ xs) @ f)))))),
% 0.63/0.44 inference(fool_elimination,[],[f776])).
% 0.63/0.44 thf(f784,plain,(
% 0.63/0.44 ! [X0 : $tType,X1 : list @ X0,X2 : nat,X3 : (nat > X0)] : ((ord_less_eq @ nat @ X2 @ (size_size @ list @ X0 @ X1)) => (((listIn1569887318i_drop @ X0 @ X2 @ (listIn521021761append @ X0 @ X1 @ X3))) = ((listIn521021761append @ X0 @ (drop @ X0 @ X2 @ X1) @ X3))))),
% 0.63/0.44 inference(rectify,[],[f36])).
% 0.63/0.44 thf(f785,plain,(
% 0.63/0.44 ! [X0 : $tType,X3 : (nat > X0),X1 : list @ X0,X2 : nat] : (($true = ((ord_less_eq @ nat @ X2 @ (size_size @ list @ X0 @ X1)))) => (((listIn1569887318i_drop @ X0 @ X2 @ (listIn521021761append @ X0 @ X1 @ X3))) = ((listIn521021761append @ X0 @ (drop @ X0 @ X2 @ X1) @ X3))))),
% 0.63/0.44 inference(fool_elimination,[],[f784])).
% 0.63/0.44 thf(f812,plain,(
% 0.63/0.44 ~(((((ord_less @ nat @ n @ (size_size @ list @ a @ xs))) = $true) => (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) = ((listIn521021761append @ a @ (drop @ a @ n @ xs) @ f)))) & ((((ord_less @ nat @ n @ (size_size @ list @ a @ xs))) != $true) => (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) = ((listIn1569887318i_drop @ a @ (minus_minus @ nat @ n @ (size_size @ list @ a @ xs)) @ f)))))),
% 0.63/0.44 inference(flattening,[],[f777])).
% 0.63/0.44 thf(f815,plain,(
% 0.63/0.44 ! [X1 : nat,X0 : nat] : ((X0 != X1) => ((((ord_less @ nat @ X1 @ X0)) != $true) => (((ord_less @ nat @ X0 @ X1)) = $true)))),
% 0.63/0.44 inference(flattening,[],[f714])).
% 0.63/0.44 thf(f830,plain,(
% 0.63/0.44 ! [X0 : $tType,X2 : nat,X1 : list @ X0,X3 : (nat > X0)] : (($true != ((ord_less_eq @ nat @ X2 @ (size_size @ list @ X0 @ X1)))) | (((listIn1569887318i_drop @ X0 @ X2 @ (listIn521021761append @ X0 @ X1 @ X3))) = ((listIn521021761append @ X0 @ (drop @ X0 @ X2 @ X1) @ X3))))),
% 0.63/0.44 inference(ennf_transformation,[],[f785])).
% 0.63/0.44 thf(f849,plain,(
% 0.63/0.44 ! [X0 : $tType,X3 : list @ X0,X1 : (nat > X0),X2 : nat] : ((((ord_less_eq @ nat @ (size_size @ list @ X0 @ X3) @ X2)) != $true) | (((listIn1569887318i_drop @ X0 @ X2 @ (listIn521021761append @ X0 @ X3 @ X1))) = ((listIn1569887318i_drop @ X0 @ (minus_minus @ nat @ X2 @ (size_size @ list @ X0 @ X3)) @ X1))))),
% 0.63/0.44 inference(ennf_transformation,[],[f301])).
% 0.63/0.44 thf(f886,plain,(
% 0.63/0.44 ! [X1 : nat,X0 : nat] : (((((ord_less @ nat @ X0 @ X1)) = $true) | (((ord_less @ nat @ X1 @ X0)) = $true)) | (X0 = X1))),
% 0.63/0.44 inference(ennf_transformation,[],[f815])).
% 0.63/0.44 thf(f887,plain,(
% 0.63/0.44 ! [X1 : nat,X0 : nat] : ((((ord_less @ nat @ X0 @ X1)) = $true) | (((ord_less @ nat @ X1 @ X0)) = $true) | (X0 = X1))),
% 0.63/0.44 inference(flattening,[],[f886])).
% 0.63/0.44 thf(f891,plain,(
% 0.63/0.44 ! [X0 : nat,X1 : nat] : ((((ord_less @ nat @ X1 @ X0)) != $true) | (((ord_less_eq @ nat @ X1 @ X0)) = $true))),
% 0.63/0.44 inference(ennf_transformation,[],[f559])).
% 0.63/0.44 thf(f893,plain,(
% 0.63/0.44 ! [X0 : nat,X1 : nat] : (((((ord_less @ nat @ X1 @ X0)) != $true) & (X0 != X1)) | (((ord_less_eq @ nat @ X1 @ X0)) = $true))),
% 0.63/0.44 inference(ennf_transformation,[],[f472])).
% 0.63/0.44 thf(f899,plain,(
% 0.63/0.44 ((((ord_less @ nat @ n @ (size_size @ list @ a @ xs))) = $true) & (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) != ((listIn521021761append @ a @ (drop @ a @ n @ xs) @ f)))) | ((((ord_less @ nat @ n @ (size_size @ list @ a @ xs))) != $true) & (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) != ((listIn1569887318i_drop @ a @ (minus_minus @ nat @ n @ (size_size @ list @ a @ xs)) @ f))))),
% 0.63/0.44 inference(ennf_transformation,[],[f812])).
% 0.63/0.44 thf(f927,plain,(
% 0.63/0.44 ! [X0 : nat,X1 : nat] : ((((ord_less @ nat @ X1 @ X0)) = $true) | (((ord_less @ nat @ X0 @ X1)) = $true) | (X0 = X1))),
% 0.63/0.44 inference(rectify,[],[f887])).
% 0.63/0.44 thf(f945,plain,(
% 0.63/0.44 ! [X0 : $tType,X1 : list @ X0,X2 : (nat > X0),X3 : nat] : (($true != ((ord_less_eq @ nat @ (size_size @ list @ X0 @ X1) @ X3))) | (((listIn1569887318i_drop @ X0 @ X3 @ (listIn521021761append @ X0 @ X1 @ X2))) = ((listIn1569887318i_drop @ X0 @ (minus_minus @ nat @ X3 @ (size_size @ list @ X0 @ X1)) @ X2))))),
% 0.63/0.44 inference(rectify,[],[f849])).
% 0.63/0.44 thf(f951,plain,(
% 0.63/0.44 ! [X0 : $tType,X1 : nat,X2 : list @ X0,X3 : (nat > X0)] : ((((ord_less_eq @ nat @ X1 @ (size_size @ list @ X0 @ X2))) != $true) | (((listIn1569887318i_drop @ X0 @ X1 @ (listIn521021761append @ X0 @ X2 @ X3))) = ((listIn521021761append @ X0 @ (drop @ X0 @ X1 @ X2) @ X3))))),
% 0.63/0.44 inference(rectify,[],[f830])).
% 0.63/0.44 thf(f996,plain,(
% 0.63/0.44 ( ! [X0 : nat,X1 : nat] : ((((ord_less @ nat @ X1 @ X0)) = $true) | (X0 = X1) | (((ord_less @ nat @ X0 @ X1)) = $true)) )),
% 0.63/0.44 inference(cnf_transformation,[],[f927])).
% 0.63/0.44 thf(f1005,plain,(
% 0.63/0.44 ( ! [X0 : nat] : ((((ord_less_eq @ nat @ X0 @ X0)) = $true)) )),
% 0.63/0.44 inference(cnf_transformation,[],[f743])).
% 0.63/0.44 thf(f1013,plain,(
% 0.63/0.44 ( ! [X0 : nat,X1 : nat] : ((((ord_less_eq @ nat @ X1 @ X0)) = $true) | (((ord_less @ nat @ X1 @ X0)) != $true)) )),
% 0.63/0.44 inference(cnf_transformation,[],[f893])).
% 0.63/0.44 thf(f1021,plain,(
% 0.63/0.44 ( ! [X0 : $tType,X2 : (nat > X0),X3 : nat,X1 : list @ X0] : ((((listIn1569887318i_drop @ X0 @ X3 @ (listIn521021761append @ X0 @ X1 @ X2))) = ((listIn1569887318i_drop @ X0 @ (minus_minus @ nat @ X3 @ (size_size @ list @ X0 @ X1)) @ X2))) | ($true != ((ord_less_eq @ nat @ (size_size @ list @ X0 @ X1) @ X3)))) )),
% 0.63/0.44 inference(cnf_transformation,[],[f945])).
% 0.63/0.44 thf(f1026,plain,(
% 0.63/0.44 ( ! [X0 : nat,X1 : nat] : ((((ord_less_eq @ nat @ X1 @ X0)) = $true) | (((ord_less @ nat @ X1 @ X0)) != $true)) )),
% 0.63/0.44 inference(cnf_transformation,[],[f891])).
% 0.63/0.44 thf(f1029,plain,(
% 0.63/0.44 ( ! [X0 : nat,X1 : nat] : ((((ord_less_eq @ nat @ X1 @ X0)) = $true) | (((ord_less_eq @ nat @ X0 @ X1)) = $true)) )),
% 0.63/0.44 inference(cnf_transformation,[],[f389])).
% 0.63/0.44 thf(f1030,plain,(
% 0.63/0.44 ( ! [X0 : $tType,X2 : list @ X0,X3 : (nat > X0),X1 : nat] : ((((listIn1569887318i_drop @ X0 @ X1 @ (listIn521021761append @ X0 @ X2 @ X3))) = ((listIn521021761append @ X0 @ (drop @ X0 @ X1 @ X2) @ X3))) | (((ord_less_eq @ nat @ X1 @ (size_size @ list @ X0 @ X2))) != $true)) )),
% 0.63/0.44 inference(cnf_transformation,[],[f951])).
% 0.63/0.44 thf(f1055,plain,(
% 0.63/0.44 (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) != ((listIn521021761append @ a @ (drop @ a @ n @ xs) @ f))) | (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) != ((listIn1569887318i_drop @ a @ (minus_minus @ nat @ n @ (size_size @ list @ a @ xs)) @ f)))),
% 0.63/0.44 inference(cnf_transformation,[],[f899])).
% 0.63/0.44 thf(f1056,plain,(
% 0.63/0.44 (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) != ((listIn521021761append @ a @ (drop @ a @ n @ xs) @ f))) | (((ord_less @ nat @ n @ (size_size @ list @ a @ xs))) != $true)),
% 0.63/0.44 inference(cnf_transformation,[],[f899])).
% 0.63/0.44 thf(f1057,plain,(
% 0.63/0.44 (((ord_less @ nat @ n @ (size_size @ list @ a @ xs))) = $true) | (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) != ((listIn1569887318i_drop @ a @ (minus_minus @ nat @ n @ (size_size @ list @ a @ xs)) @ f)))),
% 0.63/0.44 inference(cnf_transformation,[],[f899])).
% 0.63/0.44 thf(f1086,definition,(
% 0.63/0.44 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.63/0.44 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.63/0.44 thf(f1097,definition,(
% 0.63/0.44 spl17_1 <=> (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) = ((listIn1569887318i_drop @ a @ (minus_minus @ nat @ n @ (size_size @ list @ a @ xs)) @ f)))),
% 0.63/0.44 introduced(definition,[new_symbols(definition,[spl17_1])],[avatar_definition])).
% 0.63/0.44 thf(f1099,plain,(
% 0.63/0.44 (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) != ((listIn1569887318i_drop @ a @ (minus_minus @ nat @ n @ (size_size @ list @ a @ xs)) @ f))) | spl17_1),
% 0.63/0.44 inference(avatar_component_clause,[],[f1097])).
% 0.63/0.44 thf(f1101,definition,(
% 0.63/0.44 spl17_2 <=> (((ord_less @ nat @ n @ (size_size @ list @ a @ xs))) = $true)),
% 0.63/0.44 introduced(definition,[new_symbols(definition,[spl17_2])],[avatar_definition])).
% 0.63/0.44 thf(f1102,plain,(
% 0.63/0.44 (((ord_less @ nat @ n @ (size_size @ list @ a @ xs))) != $true) | spl17_2),
% 0.63/0.44 inference(avatar_component_clause,[],[f1101])).
% 0.63/0.44 thf(f1104,plain,(
% 0.63/0.44 ~spl17_1 | spl17_2),
% 0.63/0.44 inference(avatar_split_clause,[],[f1057,f1101,f1097])).
% 0.63/0.44 thf(f1106,definition,(
% 0.63/0.44 spl17_3 <=> (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) = ((listIn521021761append @ a @ (drop @ a @ n @ xs) @ f)))),
% 0.63/0.44 introduced(definition,[new_symbols(definition,[spl17_3])],[avatar_definition])).
% 0.63/0.44 thf(f1108,plain,(
% 0.63/0.44 (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) != ((listIn521021761append @ a @ (drop @ a @ n @ xs) @ f))) | spl17_3),
% 0.63/0.44 inference(avatar_component_clause,[],[f1106])).
% 0.63/0.44 thf(f1109,plain,(
% 0.63/0.44 ~spl17_3 | ~spl17_2),
% 0.63/0.44 inference(avatar_split_clause,[],[f1056,f1101,f1106])).
% 0.63/0.44 thf(f1110,plain,(
% 0.63/0.44 ~spl17_1 | ~spl17_3),
% 0.63/0.44 inference(avatar_split_clause,[],[f1055,f1106,f1097])).
% 0.63/0.44 thf(f1112,plain,(
% 0.63/0.44 (((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f))) != ((listIn1569887318i_drop @ a @ n @ (listIn521021761append @ a @ xs @ f)))) | (((ord_less_eq @ nat @ n @ (size_size @ list @ a @ xs))) != $true) | spl17_3),
% 0.63/0.44 inference(superposition,[],[f1108,f1030])).
% 0.63/0.44 thf(f1113,plain,(
% 0.63/0.44 (((ord_less_eq @ nat @ n @ (size_size @ list @ a @ xs))) != $true) | spl17_3),
% 0.63/0.44 inference(trivial_inequality_removal,[],[f1112])).
% 0.63/0.44 thf(f1115,plain,(
% 0.63/0.44 (((listIn1569887318i_drop @ a @ (minus_minus @ nat @ n @ (size_size @ list @ a @ xs)) @ f)) != ((listIn1569887318i_drop @ a @ (minus_minus @ nat @ n @ (size_size @ list @ a @ xs)) @ f))) | (((ord_less_eq @ nat @ (size_size @ list @ a @ xs) @ n)) != $true) | spl17_1),
% 0.63/0.44 inference(superposition,[],[f1099,f1021])).
% 0.63/0.44 thf(f1116,plain,(
% 0.63/0.44 (((ord_less_eq @ nat @ (size_size @ list @ a @ xs) @ n)) != $true) | spl17_1),
% 0.63/0.44 inference(trivial_inequality_removal,[],[f1115])).
% 0.63/0.44 thf(f1118,plain,(
% 0.63/0.44 ($true != $true) | (((ord_less_eq @ nat @ (size_size @ list @ a @ xs) @ n)) = $true) | spl17_3),
% 0.63/0.44 inference(superposition,[],[f1113,f1029])).
% 0.63/0.44 thf(f1120,plain,(
% 0.63/0.44 (((ord_less @ nat @ n @ (size_size @ list @ a @ xs))) != $true) | ($true != $true) | spl17_3),
% 0.63/0.44 inference(superposition,[],[f1113,f1013])).
% 0.63/0.44 thf(f1123,plain,(
% 0.63/0.44 (((ord_less @ nat @ n @ (size_size @ list @ a @ xs))) != $true) | spl17_3),
% 0.63/0.44 inference(trivial_inequality_removal,[],[f1120])).
% 0.63/0.44 thf(f1126,plain,(
% 0.63/0.44 (((ord_less_eq @ nat @ (size_size @ list @ a @ xs) @ n)) = $true) | spl17_3),
% 0.63/0.44 inference(trivial_inequality_removal,[],[f1118])).
% 0.63/0.44 thf(f1127,plain,(
% 0.63/0.44 ~spl17_2 | spl17_3),
% 0.63/0.44 inference(avatar_split_clause,[],[f1123,f1106,f1101])).
% 0.63/0.44 thf(f1128,plain,(
% 0.63/0.44 $false | (spl17_1 | spl17_3)),
% 0.63/0.44 inference(forward_subsumption_resolution,[],[f1126,f1116])).
% 0.63/0.44 thf(f1129,plain,(
% 0.63/0.44 spl17_1 | spl17_3),
% 0.63/0.44 inference(avatar_contradiction_clause,[],[f1128])).
% 0.63/0.44 thf(f1130,plain,(
% 0.63/0.44 ($true != $true) | (((ord_less @ nat @ (size_size @ list @ a @ xs) @ n)) = $true) | (n = ((size_size @ list @ a @ xs))) | spl17_2),
% 0.63/0.44 inference(superposition,[],[f1102,f996])).
% 0.63/0.44 thf(f1135,plain,(
% 0.63/0.44 (n = ((size_size @ list @ a @ xs))) | (((ord_less @ nat @ (size_size @ list @ a @ xs) @ n)) = $true) | spl17_2),
% 0.63/0.44 inference(trivial_inequality_removal,[],[f1130])).
% 0.63/0.44 thf(f1137,definition,(
% 0.63/0.44 spl17_4 <=> (n = ((size_size @ list @ a @ xs)))),
% 0.63/0.44 introduced(definition,[new_symbols(definition,[spl17_4])],[avatar_definition])).
% 0.63/0.44 thf(f1139,plain,(
% 0.63/0.44 (n = ((size_size @ list @ a @ xs))) | ~spl17_4),
% 0.63/0.44 inference(avatar_component_clause,[],[f1137])).
% 0.63/0.44 thf(f1146,definition,(
% 0.63/0.44 spl17_6 <=> (((ord_less @ nat @ (size_size @ list @ a @ xs) @ n)) = $true)),
% 0.63/0.44 introduced(definition,[new_symbols(definition,[spl17_6])],[avatar_definition])).
% 0.63/0.44 thf(f1149,plain,(
% 0.63/0.44 spl17_4 | spl17_6 | spl17_2),
% 0.63/0.44 inference(avatar_split_clause,[],[f1135,f1101,f1146,f1137])).
% 0.63/0.44 thf(f1184,plain,(
% 0.63/0.44 ($true != $true) | (((ord_less @ nat @ (size_size @ list @ a @ xs) @ n)) != $true) | spl17_1),
% 0.63/0.44 inference(superposition,[],[f1116,f1026])).
% 0.63/0.44 thf(f1186,plain,(
% 0.63/0.44 (((ord_less_eq @ nat @ (size_size @ list @ a @ xs) @ n)) = $false) | ($true != $true) | spl17_1),
% 0.63/0.44 inference(superposition,[],[f1116,f1086])).
% 0.63/0.44 thf(f1187,plain,(
% 0.63/0.44 (((ord_less @ nat @ (size_size @ list @ a @ xs) @ n)) != $true) | spl17_1),
% 0.63/0.44 inference(trivial_inequality_removal,[],[f1184])).
% 0.63/0.44 thf(f1188,plain,(
% 0.63/0.44 (((ord_less_eq @ nat @ (size_size @ list @ a @ xs) @ n)) = $false) | spl17_1),
% 0.63/0.44 inference(trivial_inequality_removal,[],[f1186])).
% 0.63/0.44 thf(f1193,plain,(
% 0.63/0.44 (((ord_less_eq @ nat @ n @ n)) = $false) | (spl17_1 | ~spl17_4)),
% 0.63/0.44 inference(forward_demodulation,[],[f1188,f1139])).
% 0.63/0.44 thf(f1201,plain,(
% 0.63/0.44 ($true = $false) | (spl17_1 | ~spl17_4)),
% 0.63/0.44 inference(forward_demodulation,[],[f1193,f1005])).
% 0.63/0.44 thf(f1202,plain,(
% 0.63/0.44 $false | (spl17_1 | ~spl17_4)),
% 0.63/0.44 inference(trivial_inequality_removal,[],[f1201])).
% 0.63/0.44 thf(f1203,plain,(
% 0.63/0.44 spl17_1 | ~spl17_4),
% 0.63/0.44 inference(avatar_contradiction_clause,[],[f1202])).
% 0.63/0.44 thf(f1207,plain,(
% 0.63/0.44 ~spl17_6 | spl17_1),
% 0.63/0.44 inference(avatar_split_clause,[],[f1187,f1097,f1146])).
% 0.63/0.44 cnf(s1, plain, ~spl17_1 | spl17_2, inference(sat_conversion,[],[f1104])).
% 0.63/0.44 cnf(s2, plain, ~spl17_2 | ~spl17_3, inference(sat_conversion,[],[f1109])).
% 0.63/0.44 cnf(s3, plain, ~spl17_1 | ~spl17_3, inference(sat_conversion,[],[f1110])).
% 0.63/0.44 cnf(s4, plain, ~spl17_2 | spl17_3, inference(sat_conversion,[],[f1127])).
% 0.63/0.44 cnf(s6, plain, spl17_1 | spl17_3, inference(sat_conversion,[],[f1129])).
% 0.63/0.44 cnf(s8, plain, spl17_2 | spl17_4 | spl17_6, inference(sat_conversion,[],[f1149])).
% 0.63/0.44 cnf(s10, plain, spl17_1 | ~spl17_4, inference(sat_conversion,[],[f1203])).
% 0.63/0.44 cnf(s12, plain, spl17_1 | ~spl17_6, inference(sat_conversion,[],[f1207])).
% 0.63/0.44 cnf(s14, plain, spl17_1, inference(rat,[],[s2,s8,s6,s10,s12])).
% 0.63/0.44 cnf(s15, plain, ~spl17_3, inference(rat,[],[s3,s14])).
% 0.63/0.44 cnf(s16, plain, spl17_2, inference(rat,[],[s1,s14])).
% 0.63/0.44 cnf(s17, plain, $false, inference(rat,[],[s4,s15,s16])).
% 0.63/0.44 thf(f1208,plain,(
% 0.63/0.44 $false),
% 0.63/0.44 inference(avatar_sat_refutation,[],[s17])).
% 0.63/0.44 % SZS output end Proof for theBenchmark
% 0.63/0.44 % (3648863)------------------------------
% 0.63/0.44 % (3648863)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.63/0.44 % (3648863)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.63/0.44 % (3648863)CaDiCaL version: 2.1.3
% 0.63/0.44 % (3648863)Termination reason: Refutation
% 0.63/0.44 % (3648863)Time elapsed: 0.037 s
% 0.63/0.44 % (3648863)Peak memory usage: 14 MB
% 0.63/0.44 % (3648863)Instructions burned: 74 (million)
% 0.63/0.44 % (3648795)Success in time 0.163 s
% 0.63/0.44 % Vampire exiting
%------------------------------------------------------------------------------