%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : DAT207^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 07:48:32 AM UTC 2026
% Result : Theorem 1.13s 0.48s
% Output : Refutation 1.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT207^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n013.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 18:08:06 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.22/0.29 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.29/0.45 % (2461716)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.29/0.45 % (2461721)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=4014264932:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.29/0.45 % (2461722)lrs+10_16_si=on:nwc=1.5:random_seed=3818385583:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.29/0.45 % (2461723)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=600316604:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.29/0.45 % (2461724)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=409713927:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.29/0.45 % (2461725)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=676748861:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.29/0.45 % (2461723)Instruction limit reached!
% 0.29/0.45 % (2461723)------------------------------
% 0.29/0.45 % (2461723)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.45 % (2461723)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.45 % (2461723)CaDiCaL version: 2.1.3
% 0.29/0.45 % (2461723)Termination reason: Instruction limit
% 0.29/0.45 % (2461723)Termination phase: shuffling
% 0.29/0.45 % (2461723)Time elapsed: 0.002 s
% 0.29/0.45 % (2461723)Peak memory usage: 10 MB
% 0.29/0.45 % (2461723)Instructions burned: 4 (million)
% 0.29/0.45 % (2461722)Instruction limit reached!
% 0.29/0.45 % (2461722)------------------------------
% 0.29/0.45 % (2461722)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.45 % (2461722)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.45 % (2461722)CaDiCaL version: 2.1.3
% 0.29/0.45 % (2461722)Termination reason: Instruction limit
% 0.29/0.45 % (2461722)Termination phase: shuffling
% 0.29/0.45 % (2461722)Time elapsed: 0.010 s
% 0.29/0.45 % (2461722)Peak memory usage: 10 MB
% 0.29/0.45 % (2461722)Instructions burned: 20 (million)
% 0.29/0.45 % (2461727)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.29/0.45 % (2461727)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.29/0.45 % (2461725)Instruction limit reached!
% 0.29/0.45 % (2461725)------------------------------
% 0.29/0.45 % (2461725)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.45 % (2461725)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.45 % (2461725)CaDiCaL version: 2.1.3
% 0.29/0.45 % (2461725)Termination reason: Instruction limit
% 0.29/0.45 % (2461725)Termination phase: Property scanning
% 0.29/0.45 % (2461725)Time elapsed: 0.012 s
% 0.29/0.45 % (2461725)Peak memory usage: 10 MB
% 0.29/0.45 % (2461725)Instructions burned: 24 (million)
% 0.29/0.45 % (2461726)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1488388954:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.29/0.45 % (2461727)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=1021539784:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.29/0.45 % (2461721)Instruction limit reached!
% 0.29/0.45 % (2461721)------------------------------
% 0.29/0.45 % (2461721)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.45 % (2461721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.45 % (2461721)CaDiCaL version: 2.1.3
% 0.29/0.45 % (2461721)Termination reason: Instruction limit
% 0.29/0.45 % (2461721)Termination phase: Property scanning
% 0.29/0.45 % (2461721)Time elapsed: 0.024 s
% 0.29/0.45 % (2461721)Peak memory usage: 12 MB
% 0.29/0.45 % (2461721)Instructions burned: 91 (million)
% 0.29/0.45 % (2461733)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3784027919:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.29/0.45 % (2461733)Instruction limit reached!
% 0.29/0.45 % (2461733)------------------------------
% 0.29/0.45 % (2461733)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.48 % (2461733)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.48 % (2461733)CaDiCaL version: 2.1.3
% 1.13/0.48 % (2461733)Termination reason: Instruction limit
% 1.13/0.48 % (2461733)Termination phase: shuffling
% 1.13/0.48 % (2461733)Time elapsed: 0.002 s
% 1.13/0.48 % (2461733)Peak memory usage: 10 MB
% 1.13/0.48 % (2461733)Instructions burned: 2 (million)
% 1.13/0.48 % (2461738)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=4025359911:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 1.13/0.48 % (2461735)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 1.13/0.48 % (2461734)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=2305035649:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 1.13/0.48 % (2461738)Instruction limit reached!
% 1.13/0.48 % (2461738)------------------------------
% 1.13/0.48 % (2461738)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.48 % (2461738)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.48 % (2461738)CaDiCaL version: 2.1.3
% 1.13/0.48 % (2461738)Termination reason: Instruction limit
% 1.13/0.48 % (2461738)Termination phase: shuffling
% 1.13/0.48 % (2461738)Time elapsed: 0.004 s
% 1.13/0.48 % (2461738)Peak memory usage: 10 MB
% 1.13/0.48 % (2461738)Instructions burned: 17 (million)
% 1.13/0.48 % (2461735)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=2045929287:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 1.13/0.48 % (2461734)Instruction limit reached!
% 1.13/0.48 % (2461734)------------------------------
% 1.13/0.48 % (2461734)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.48 % (2461734)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.48 % (2461734)CaDiCaL version: 2.1.3
% 1.13/0.48 % (2461734)Termination reason: Instruction limit
% 1.13/0.48 % (2461734)Termination phase: shuffling
% 1.13/0.48 % (2461734)Time elapsed: 0.003 s
% 1.13/0.48 % (2461734)Peak memory usage: 10 MB
% 1.13/0.48 % (2461734)Instructions burned: 5 (million)
% 1.13/0.48 % (2461735)Instruction limit reached!
% 1.13/0.48 % (2461735)------------------------------
% 1.13/0.48 % (2461735)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.48 % (2461735)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.48 % (2461735)CaDiCaL version: 2.1.3
% 1.13/0.48 % (2461735)Termination reason: Instruction limit
% 1.13/0.48 % (2461735)Termination phase: shuffling
% 1.13/0.48 % (2461735)Time elapsed: 0.004 s
% 1.13/0.48 % (2461735)Peak memory usage: 10 MB
% 1.13/0.48 % (2461735)Instructions burned: 7 (million)
% 1.13/0.48 % (2461740)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.13/0.48 % (2461740)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 1.13/0.48 % (2461744)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=3763731905:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 1.13/0.48 % (2461740)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=3164408941: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.13/0.48 % (2461746)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.13/0.48 % (2461726)Instruction limit reached!
% 1.13/0.48 % (2461726)------------------------------
% 1.13/0.48 % (2461726)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.48 % (2461726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.48 % (2461726)CaDiCaL version: 2.1.3
% 1.13/0.48 % (2461726)Termination reason: Instruction limit
% 1.13/0.48 % (2461726)Termination phase: Preprocessing 3
% 1.13/0.48 % (2461726)Time elapsed: 0.038 s
% 1.13/0.48 % (2461726)Peak memory usage: 12 MB
% 1.13/0.48 % (2461726)Instructions burned: 77 (million)
% 1.13/0.48 % (2461745)lrs+10_1_si=on:cs=on:random_seed=3936849146:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 1.13/0.48 % (2461746)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=3889398149:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 1.13/0.48 % (2461745)Instruction limit reached!
% 1.13/0.48 % (2461745)------------------------------
% 1.13/0.48 % (2461745)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.48 % (2461745)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.48 % (2461745)CaDiCaL version: 2.1.3
% 1.13/0.48 % (2461745)Termination reason: Instruction limit
% 1.13/0.48 % (2461745)Termination phase: shuffling
% 1.13/0.48 % (2461745)Time elapsed: 0.004 s
% 1.13/0.48 % (2461745)Peak memory usage: 10 MB
% 1.13/0.48 % (2461745)Instructions burned: 8 (million)
% 1.13/0.48 % (2461740)Instruction limit reached!
% 1.13/0.48 % (2461740)------------------------------
% 1.13/0.48 % (2461740)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.48 % (2461740)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.48 % (2461740)CaDiCaL version: 2.1.3
% 1.13/0.48 % (2461740)Termination reason: Instruction limit
% 1.13/0.48 % (2461740)Termination phase: shuffling
% 1.13/0.48 % (2461740)Time elapsed: 0.013 s
% 1.13/0.48 % (2461740)Peak memory usage: 10 MB
% 1.13/0.48 % (2461740)Instructions burned: 29 (million)
% 1.13/0.48 % (2461746)Instruction limit reached!
% 1.13/0.48 % (2461746)------------------------------
% 1.13/0.48 % (2461746)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.48 % (2461746)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.48 % (2461746)CaDiCaL version: 2.1.3
% 1.13/0.48 % (2461746)Termination reason: Instruction limit
% 1.13/0.48 % (2461746)Termination phase: shuffling
% 1.13/0.48 % (2461746)Time elapsed: 0.003 s
% 1.13/0.48 % (2461746)Peak memory usage: 10 MB
% 1.13/0.48 % (2461746)Instructions burned: 6 (million)
% 1.13/0.48 % (2461744)Instruction limit reached!
% 1.13/0.48 % (2461744)------------------------------
% 1.13/0.48 % (2461744)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.48 % (2461744)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.48 % (2461744)CaDiCaL version: 2.1.3
% 1.13/0.48 % (2461744)Termination reason: Instruction limit
% 1.13/0.48 % (2461744)Termination phase: Preprocessing 1
% 1.13/0.48 % (2461744)Time elapsed: 0.020 s
% 1.13/0.48 % (2461744)Peak memory usage: 11 MB
% 1.13/0.48 % (2461744)Instructions burned: 91 (million)
% 1.13/0.48 % (2461750)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=1006691102:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/38Mi)
% 1.13/0.48 % (2461755)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=3197252023:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/327Mi)
% 1.13/0.48 % (2461752)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=221144423:st=2:i=249:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/249Mi)
% 1.13/0.48 % (2461753)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=495109909:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/25Mi)
% 1.13/0.48 % (2461754)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=415656675:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2998 on theBenchmark for (2998ds/14Mi)
% 1.13/0.48 % (2461754)Instruction limit reached!
% 1.13/0.48 % (2461754)------------------------------
% 1.13/0.48 % (2461754)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.48 % (2461754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.48 % (2461754)CaDiCaL version: 2.1.3
% 1.13/0.48 % (2461754)Termination reason: Instruction limit
% 1.13/0.48 % (2461754)Termination phase: shuffling
% 1.13/0.48 % (2461754)Time elapsed: 0.007 s
% 1.13/0.48 % (2461754)Peak memory usage: 10 MB
% 1.13/0.48 % (2461754)Instructions burned: 15 (million)
% 1.13/0.48 % (2461727)Instruction limit reached!
% 1.13/0.48 % (2461727)------------------------------
% 1.13/0.48 % (2461727)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.48 % (2461727)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.48 % (2461727)CaDiCaL version: 2.1.3
% 1.13/0.48 % (2461727)Termination reason: Instruction limit
% 1.13/0.48 % (2461727)Termination phase: Saturation
% 1.13/0.48 % (2461727)Time elapsed: 0.074 s
% 1.13/0.48 % (2461727)Peak memory usage: 14 MB
% 1.13/0.48 % (2461727)Instructions burned: 159 (million)
% 1.13/0.48 % (2461753)Instruction limit reached!
% 1.13/0.48 % (2461753)------------------------------
% 1.13/0.48 % (2461753)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.48 % (2461753)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.48 % (2461753)CaDiCaL version: 2.1.3
% 1.13/0.48 % (2461753)Termination reason: Instruction limit
% 1.13/0.48 % (2461753)Termination phase: Property scanning
% 1.13/0.48 % (2461753)Time elapsed: 0.012 s
% 1.13/0.48 % (2461753)Peak memory usage: 10 MB
% 1.13/0.48 % (2461753)Instructions burned: 26 (million)
% 1.13/0.48 % (2461761)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=635682279:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/14Mi)
% 1.13/0.48 % (2461750)Instruction limit reached!
% 1.13/0.48 % (2461750)------------------------------
% 1.13/0.48 % (2461750)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.48 % (2461750)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.48 % (2461750)CaDiCaL version: 2.1.3
% 1.13/0.48 % (2461750)Termination reason: Instruction limit
% 1.13/0.48 % (2461750)Termination phase: SInE selection
% 1.13/0.48 % (2461750)Time elapsed: 0.038 s
% 1.13/0.48 % (2461750)Peak memory usage: 11 MB
% 1.13/0.48 % (2461750)Instructions burned: 39 (million)
% 1.13/0.48 % (2461763)ott+1004_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=unary_frequency:cbe=off:uwa=off:nwc=1:random_seed=3140371815:i=26:ep=R:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/26Mi)
% 1.13/0.48 % (2461761)Instruction limit reached!
% 1.13/0.48 % (2461761)------------------------------
% 1.13/0.48 % (2461761)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.48 % (2461761)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.48 % (2461761)CaDiCaL version: 2.1.3
% 1.13/0.48 % (2461761)Termination reason: Instruction limit
% 1.13/0.48 % (2461761)Termination phase: shuffling
% 1.13/0.48 % (2461761)Time elapsed: 0.007 s
% 1.13/0.48 % (2461761)Peak memory usage: 10 MB
% 1.13/0.48 % (2461761)Instructions burned: 14 (million)
% 1.13/0.48 % (2461752) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2461716-2461752"...
% 1.13/0.48 % (2461763)Instruction limit reached!
% 1.13/0.48 % (2461763)------------------------------
% 1.13/0.48 % (2461763)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.48 % (2461763)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.48 % (2461763)CaDiCaL version: 2.1.3
% 1.13/0.48 % (2461763)Termination reason: Instruction limit
% 1.13/0.48 % (2461763)Termination phase: shuffling
% 1.13/0.48 % (2461763)Time elapsed: 0.013 s
% 1.13/0.48 % (2461763)Peak memory usage: 11 MB
% 1.13/0.48 % (2461763)Instructions burned: 28 (million)
% 1.13/0.48 % (2461762)ott+21_20_to=lpo:sil=128000:tgt=ground:si=on:sp=arity:lma=off:uwa=off:foolp=on:random_seed=3407698852: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.13/0.48 % (2461752)...printing done.
% 1.13/0.48 % (2461752)Refutation found. Thanks to Tanya!
% 1.13/0.48 % SZS status Theorem for theBenchmark
% 1.13/0.48 % SZS output start Proof for theBenchmark
% 1.13/0.48 thf(type_def_5, type, list: $tType > $tType).
% 1.13/0.48 thf(type_def_6, type, set: $tType > $tType).
% 1.13/0.48 thf(type_def_7, type, itself: $tType > $tType).
% 1.13/0.48 thf(type_def_8, type, a: $tType).
% 1.13/0.48 thf(type_def_9, type, sTfun: ($tType * $tType) > $tType).
% 1.13/0.48 thf(func_def_0, type, bounded_lattice: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_1, type, type: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_2, type, bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_3, type, ord: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_4, type, order: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_5, type, lattice: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_6, type, no_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_7, type, no_top: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_8, type, linorder: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_9, type, preorder: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_10, type, order_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_11, type, wellorder: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_12, type, dense_order: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_13, type, semilattice_sup: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_14, type, bounded_lattice_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_15, type, bounde1808546759up_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 1.13/0.48 thf(func_def_16, type, bNF_Greatest_shift: !>[X0: $tType, X1: $tType]:(((list @ X0 > X1) > X0 > list @ X0 > X1))).
% 1.13/0.48 thf(func_def_17, type, sup_sup: !>[X0: $tType]:((X0 > X0 > X0))).
% 1.13/0.48 thf(func_def_18, type, append: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 1.13/0.48 thf(func_def_19, type, bind: !>[X0: $tType, X1: $tType]:((list @ X0 > (X0 > list @ X1) > list @ X1))).
% 1.13/0.48 thf(func_def_20, type, insert: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 1.13/0.48 thf(func_def_21, type, linord467138063of_set: !>[X0: $tType]:((set @ X0 > list @ X0))).
% 1.13/0.48 thf(func_def_22, type, cons: !>[X0: $tType]:((X0 > list @ X0 > list @ X0))).
% 1.13/0.48 thf(func_def_23, type, nil: !>[X0: $tType]:(list @ X0)).
% 1.13/0.48 thf(func_def_24, type, map: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1))).
% 1.13/0.48 thf(func_def_25, type, list_ex1: !>[X0: $tType]:(((X0 > $o) > list @ X0 > $o))).
% 1.13/0.48 thf(func_def_26, type, listrelp: !>[X0: $tType, X1: $tType]:(((X0 > X1 > $o) > list @ X0 > list @ X1 > $o))).
% 1.13/0.48 thf(func_def_27, type, map_tailrec: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1))).
% 1.13/0.48 thf(func_def_28, type, map_tailrec_rev: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1 > list @ X1))).
% 1.13/0.48 thf(func_def_29, type, lexordp_eq: !>[X0: $tType]:(((X0 > X0 > $o) > list @ X0 > list @ X0 > $o))).
% 1.13/0.48 thf(func_def_30, type, ord_lexordp_eq: !>[X0: $tType]:((list @ X0 > list @ X0 > $o))).
% 1.13/0.48 thf(func_def_31, type, product_lists: !>[X0: $tType]:((list @ list @ X0 > list @ list @ X0))).
% 1.13/0.48 thf(func_def_32, type, rev: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 1.13/0.48 thf(func_def_33, type, splice: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_34, type, sublists: !>[X0: $tType]:((list @ X0 > list @ list @ X0))).
% 1.13/0.49 thf(func_def_35, type, list_c659805718roduct: !>[X0: $tType]:((list @ list @ X0 > list @ list @ X0))).
% 1.13/0.49 thf(func_def_36, type, list_collect_set: !>[X0: $tType, X1: $tType]:(((X0 > set @ X1) > list @ X0 > set @ X1))).
% 1.13/0.49 thf(func_def_37, type, merge: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_38, type, merge_list: !>[X0: $tType]:((list @ list @ X0 > list @ list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_39, type, revg: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_40, type, bot_bot: !>[X0: $tType]:(X0)).
% 1.13/0.49 thf(func_def_41, type, ord_less: !>[X0: $tType]:((X0 > X0 > $o))).
% 1.13/0.49 thf(func_def_42, type, type2: !>[X0: $tType]:(itself @ X0)).
% 1.13/0.49 thf(func_def_43, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 1.13/0.49 thf(func_def_44, type, is_empty: !>[X0: $tType]:((set @ X0 > $o))).
% 1.13/0.49 thf(func_def_45, type, sorted1267110213sorted: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_46, type, sorted2037043510sorted: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_47, type, sorted1061247458sorted: !>[X0: $tType]:((list @ X0 > list @ X0 > $o))).
% 1.13/0.49 thf(func_def_48, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 1.13/0.49 thf(func_def_49, type, l1: list @ a).
% 1.13/0.49 thf(func_def_50, type, l2a: list @ a).
% 1.13/0.49 thf(func_def_51, type, x1: a).
% 1.13/0.49 thf(func_def_55, type, vAND: ($o > $o > $o)).
% 1.13/0.49 thf(func_def_56, type, vNOT: ($o > $o)).
% 1.13/0.49 thf(func_def_57, type, vIMP: ($o > $o > $o)).
% 1.13/0.49 thf(func_def_58, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 1.13/0.49 thf(func_def_59, type, db0: !>[X0: $tType]:(X0)).
% 1.13/0.49 thf(func_def_60, type, db1: !>[X0: $tType]:(X0)).
% 1.13/0.49 thf(func_def_61, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 1.13/0.49 thf(func_def_62, type, db2: !>[X0: $tType]:(X0)).
% 1.13/0.49 thf(func_def_63, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 1.13/0.49 thf(func_def_64, type, vOR: ($o > $o > $o)).
% 1.13/0.49 thf(func_def_65, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 1.13/0.49 thf(func_def_66, type, db5: !>[X0: $tType]:(X0)).
% 1.13/0.49 thf(func_def_67, type, db6: !>[X0: $tType]:(X0)).
% 1.13/0.49 thf(func_def_68, type, db3: !>[X0: $tType]:(X0)).
% 1.13/0.49 thf(func_def_69, type, db4: !>[X0: $tType]:(X0)).
% 1.13/0.49 thf(func_def_70, type, sP0: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > (X1 > X0 > $o) > $o))).
% 1.13/0.49 thf(func_def_71, type, sP1: !>[X0: $tType]:((list @ X0 > list @ X0 > $o))).
% 1.13/0.49 thf(func_def_72, type, sP2: !>[X0: $tType]:((list @ X0 > list @ X0 > $o))).
% 1.13/0.49 thf(func_def_73, type, sK3: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_74, type, sK4: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_75, type, sK5: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_76, type, sK6: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_77, type, sK7: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X1))).
% 1.13/0.49 thf(func_def_78, type, sK8: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.13/0.49 thf(func_def_79, type, sK9: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_80, type, sK10: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X0))).
% 1.13/0.49 thf(func_def_81, type, sK11: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_82, type, sK12: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X0))).
% 1.13/0.49 thf(func_def_83, type, sK13: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X1))).
% 1.13/0.49 thf(func_def_84, type, sK14: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.13/0.49 thf(func_def_85, type, sK15: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_86, type, sK16: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_87, type, sK17: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_88, type, sK18: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_89, type, sK19: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_90, type, sK20: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_91, type, sK21: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_92, type, sK22: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > (X1 > X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_93, type, sK23: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > (X1 > X0 > $o) > X1))).
% 1.13/0.49 thf(func_def_94, type, sK24: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > (X1 > X0 > $o) > list @ X1))).
% 1.13/0.49 thf(func_def_95, type, sK25: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > (X1 > X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_96, type, sK26: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > (list @ X1 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_97, type, sK27: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > (list @ X1 > list @ X0 > $o) > list @ X1))).
% 1.13/0.49 thf(func_def_98, type, sK28: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > (list @ X1 > list @ X0 > $o) > X1))).
% 1.13/0.49 thf(func_def_99, type, sK29: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > (list @ X1 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_100, type, sK30: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_101, type, sK31: !>[X0: $tType, X1: $tType]:(((list @ X1 > list @ X0 > $o) > list @ X1))).
% 1.13/0.49 thf(func_def_102, type, sK32: !>[X0: $tType]:((list @ X0 > X0))).
% 1.13/0.49 thf(func_def_103, type, sK33: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_104, type, sK34: !>[X0: $tType]:((list @ X0 > X0))).
% 1.13/0.49 thf(func_def_105, type, sK35: !>[X0: $tType]:((list @ X0 > X0))).
% 1.13/0.49 thf(func_def_106, type, sK36: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_107, type, sK37: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_108, type, sK38: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.13/0.49 thf(func_def_109, type, sK39: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_110, type, sK40: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > X0))).
% 1.13/0.49 thf(func_def_111, type, sK41: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > X0 > X1))).
% 1.13/0.49 thf(func_def_112, type, sK42: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > X0 > X1))).
% 1.13/0.49 thf(func_def_113, type, sK43: !>[X0: $tType, X1: $tType]:((((X0 > X1) > list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.13/0.49 thf(func_def_114, type, sK44: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_115, type, sK45: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_116, type, sK46: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_117, type, sK47: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_118, type, sK48: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_119, type, sK49: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_120, type, sK50: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_121, type, sK51: !>[X0: $tType]:((list @ list @ X0 > X0))).
% 1.13/0.49 thf(func_def_122, type, sK52: !>[X0: $tType]:((list @ list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_123, type, sK53: !>[X0: $tType]:((list @ list @ X0 > list @ list @ X0))).
% 1.13/0.49 thf(func_def_124, type, sK54: !>[X0: $tType]:((list @ list @ X0 > list @ list @ X0))).
% 1.13/0.49 thf(func_def_125, type, sK55: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_126, type, sK56: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_127, type, sK57: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_128, type, sK58: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_129, type, sK59: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_130, type, sK60: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_131, type, sK61: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_132, type, sK62: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_133, type, sK63: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_134, type, sK64: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_135, type, sK65: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_136, type, sK66: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_137, type, sK67: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_138, type, sK68: !>[X0: $tType]:(((list @ X0 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_139, type, sK69: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_140, type, sK70: !>[X0: $tType]:((list @ X0 > X0))).
% 1.13/0.49 thf(func_def_141, type, sK71: !>[X0: $tType, X1: $tType]:(((X0 > X1) > (X0 > X1) > X0))).
% 1.13/0.49 thf(func_def_142, type, sK72: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0 > X0 > $o))).
% 1.13/0.49 thf(func_def_143, type, sK73: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_144, type, sK74: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_145, type, sK75: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0 > X0 > $o))).
% 1.13/0.49 thf(func_def_146, type, sK76: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_147, type, sK77: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_148, type, sK78: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0 > X0 > $o))).
% 1.13/0.49 thf(func_def_149, type, sK79: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_150, type, sK80: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_151, type, sK81: !>[X0: $tType]:((((X0 > X0 > $o) > list @ X0 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_152, type, sK82: !>[X0: $tType, X1: $tType, X2: $tType]:((((X2 > X0 > X1) > list @ X2 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_153, type, sK83: !>[X0: $tType, X1: $tType, X2: $tType]:((((X2 > X0 > X1) > list @ X2 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_154, type, sK84: !>[X0: $tType, X1: $tType, X2: $tType]:((((X2 > X0 > X1) > list @ X2 > list @ X0 > $o) > X2 > X0 > X1))).
% 1.13/0.49 thf(func_def_155, type, sK85: !>[X0: $tType, X1: $tType, X2: $tType]:((((X2 > X0 > X1) > list @ X2 > list @ X0 > $o) > X2 > X0 > X1))).
% 1.13/0.49 thf(func_def_156, type, sK86: !>[X0: $tType, X1: $tType, X2: $tType]:((((X2 > X0 > X1) > list @ X2 > list @ X0 > $o) > X2))).
% 1.13/0.49 thf(func_def_157, type, sK87: !>[X0: $tType, X1: $tType, X2: $tType]:((((X2 > X0 > X1) > list @ X2 > list @ X0 > $o) > list @ X2))).
% 1.13/0.49 thf(func_def_158, type, sK88: !>[X0: $tType, X1: $tType, X2: $tType]:((((X2 > X0 > X1) > list @ X2 > list @ X0 > $o) > X2 > X0 > X1))).
% 1.13/0.49 thf(func_def_159, type, sK89: !>[X0: $tType, X1: $tType, X2: $tType]:((((X2 > X0 > X1) > list @ X2 > list @ X0 > $o) > X2))).
% 1.13/0.49 thf(func_def_160, type, sK90: !>[X0: $tType, X1: $tType, X2: $tType]:((((X2 > X0 > X1) > list @ X2 > list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_161, type, sK91: !>[X0: $tType, X1: $tType, X2: $tType]:((((X2 > X0 > X1) > list @ X2 > list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_162, type, sK92: !>[X0: $tType, X1: $tType, X2: $tType]:((((X2 > X0 > X1) > list @ X2 > list @ X0 > $o) > list @ X2))).
% 1.13/0.49 thf(func_def_163, type, sK93: !>[X0: $tType, X1: $tType, X2: $tType]:((((X2 > X0 > X1) > list @ X2 > list @ X0 > $o) > X2 > X0 > X1))).
% 1.13/0.49 thf(func_def_164, type, sK94: !>[X0: $tType, X1: $tType]:((((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X1))).
% 1.13/0.49 thf(func_def_165, type, sK95: !>[X0: $tType, X1: $tType]:((((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X0))).
% 1.13/0.49 thf(func_def_166, type, sK96: !>[X0: $tType, X1: $tType]:((((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X0 > X1 > $o))).
% 1.13/0.49 thf(func_def_167, type, sK97: !>[X0: $tType, X1: $tType]:((((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.13/0.49 thf(func_def_168, type, sK98: !>[X0: $tType, X1: $tType]:((((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_169, type, sK99: !>[X0: $tType, X1: $tType]:((((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_170, type, sK100: !>[X0: $tType, X1: $tType]:((((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X0))).
% 1.13/0.49 thf(func_def_171, type, sK101: !>[X0: $tType, X1: $tType]:((((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X0 > X1 > $o))).
% 1.13/0.49 thf(func_def_172, type, sK102: !>[X0: $tType, X1: $tType]:((((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X0 > X1 > $o))).
% 1.13/0.49 thf(func_def_173, type, sK103: !>[X0: $tType, X1: $tType]:((((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X1))).
% 1.13/0.49 thf(func_def_174, type, sK104: !>[X0: $tType, X1: $tType]:((((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.13/0.49 thf(func_def_175, type, sK105: !>[X0: $tType, X1: $tType]:((((X0 > X1 > $o) > list @ X0 > list @ X1 > $o) > X0 > X1 > $o))).
% 1.13/0.49 thf(func_def_176, type, sK106: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_177, type, sK107: !>[X0: $tType]:((list @ X0 > list @ X0 > X0))).
% 1.13/0.49 thf(func_def_178, type, sK108: !>[X0: $tType]:((list @ X0 > list @ X0 > X0))).
% 1.13/0.49 thf(func_def_179, type, sK109: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_180, type, sK110: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_181, type, sK111: !>[X0: $tType]:((list @ X0 > X0))).
% 1.13/0.49 thf(func_def_182, type, sK112: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_183, type, sK113: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_184, type, sK114: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.13/0.49 thf(func_def_185, type, sK115: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X0))).
% 1.13/0.49 thf(func_def_186, type, sK116: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > X1))).
% 1.13/0.49 thf(func_def_187, type, sK117: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X1))).
% 1.13/0.49 thf(func_def_188, type, sK118: !>[X0: $tType, X1: $tType]:(((list @ X0 > list @ X1 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_189, type, sK119: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_190, type, sK120: !>[X0: $tType]:((list @ X0 > list @ X0 > X0))).
% 1.13/0.49 thf(func_def_191, type, sK121: !>[X0: $tType]:((list @ X0 > list @ X0 > X0))).
% 1.13/0.49 thf(func_def_192, type, sK122: !>[X0: $tType]:((list @ X0 > list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_193, type, sK123: !>[X0: $tType]:((list @ X0 > list @ X0))).
% 1.13/0.49 thf(func_def_194, type, sK124: !>[X0: $tType]:((list @ X0 > X0))).
% 1.13/0.49 thf(func_def_195, type, sK125: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 1.13/0.49 thf(func_def_196, type, sK126: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_197, type, sK127: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.13/0.49 thf(func_def_198, type, sK128: !>[X0: $tType]:(((list @ X0 > $o) > X0))).
% 1.13/0.49 thf(f1,axiom,(
% 1.13/0.49 (l2a = nil @ a)),
% 1.13/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_local_ONil)).
% 1.13/0.49 thf(f3,axiom,(
% 1.13/0.49 ! [X0 : $tType] : ((linorder @ X0 @ type2 @ X0) => ! [X1 : X0,X2 : list @ X0] : ~(sorted1061247458sorted @ X0 @ (cons @ X0 @ X1 @ X2) @ nil @ X0))),
% 1.13/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_subset__sorted_Osimps_I2_J)).
% 1.13/0.49 thf(f13,axiom,(
% 1.13/0.49 ! [X0 : $tType,X2 : list @ X0,X1 : X0] : (nil @ X0 != ((cons @ X0 @ X1 @ X2)))),
% 1.13/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_12_list_Odistinct_I1_J)).
% 1.13/0.49 thf(f291,axiom,(
% 1.13/0.49 (linorder @ a @ type2 @ a)),
% 1.13/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',tfree_0)).
% 1.13/0.49 thf(f292,conjecture,(
% 1.13/0.49 ((((cons @ a @ x1 @ l1)) = l2a) = (sorted1061247458sorted @ a @ (cons @ a @ x1 @ l1) @ l2a) & (sorted1061247458sorted @ a @ l2a @ (cons @ a @ x1 @ l1)))),
% 1.13/0.49 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)).
% 1.13/0.49 thf(f293,negated_conjecture,(
% 1.13/0.49 ~ ((((cons @ a @ x1 @ l1)) = l2a) = (sorted1061247458sorted @ a @ (cons @ a @ x1 @ l1) @ l2a) & (sorted1061247458sorted @ a @ l2a @ (cons @ a @ x1 @ l1)))),
% 1.13/0.49 inference(negated_conjecture,[status(cth)],[f292])).
% 1.13/0.49 thf(f333,plain,(
% 1.13/0.49 (linorder @ a @ type2 @ a)),
% 1.13/0.49 inference(rectify,[],[f291])).
% 1.13/0.49 thf(f334,plain,(
% 1.13/0.49 (((linorder @ a @ type2 @ a)) = $true)),
% 1.13/0.49 inference(fool_elimination,[],[f333])).
% 1.13/0.49 thf(f355,plain,(
% 1.13/0.49 ~ ((((cons @ a @ x1 @ l1)) = l2a) = (sorted1061247458sorted @ a @ (cons @ a @ x1 @ l1) @ l2a) & (sorted1061247458sorted @ a @ l2a @ (cons @ a @ x1 @ l1)))),
% 1.13/0.49 inference(rectify,[],[f293])).
% 1.13/0.49 thf(f356,plain,(
% 1.13/0.49 ~ ((((sorted1061247458sorted @ a @ l2a @ (cons @ a @ x1 @ l1)) & (sorted1061247458sorted @ a @ (cons @ a @ x1 @ l1) @ l2a))) = ((l2a = (cons @ a @ x1 @ l1))))),
% 1.13/0.49 inference(fool_elimination,[],[f355])).
% 1.13/0.49 thf(f454,plain,(
% 1.13/0.49 ! [X0 : $tType] : ((linorder @ X0 @ type2 @ X0) => ! [X1 : X0,X2 : list @ X0] : ~(sorted1061247458sorted @ X0 @ (cons @ X0 @ X1 @ X2) @ nil @ X0))),
% 1.13/0.49 inference(rectify,[],[f3])).
% 1.13/0.49 thf(f455,plain,(
% 1.13/0.49 ! [X0 : $tType] : ((((linorder @ X0 @ type2 @ X0)) = $true) => ! [X1 : X0,X2 : list @ X0] : ~ (((sorted1061247458sorted @ X0 @ (cons @ X0 @ X1 @ X2) @ nil @ X0)) = $true))),
% 1.13/0.49 inference(fool_elimination,[],[f454])).
% 1.13/0.49 thf(f749,plain,(
% 1.13/0.49 ((((sorted1061247458sorted @ a @ l2a @ (cons @ a @ x1 @ l1)) & (sorted1061247458sorted @ a @ (cons @ a @ x1 @ l1) @ l2a))) != ((l2a = (cons @ a @ x1 @ l1))))),
% 1.13/0.49 inference(flattening,[],[f356])).
% 1.13/0.49 thf(f757,plain,(
% 1.13/0.49 ! [X0 : $tType,X1 : list @ X0,X2 : X0] : (nil @ X0 != ((cons @ X0 @ X2 @ X1)))),
% 1.13/0.49 inference(rectify,[],[f13])).
% 1.13/0.49 thf(f763,plain,(
% 1.13/0.49 ! [X0 : $tType] : ((((linorder @ X0 @ type2 @ X0)) = $true) => ! [X1 : X0,X2 : list @ X0] : (((sorted1061247458sorted @ X0 @ (cons @ X0 @ X1 @ X2) @ nil @ X0)) != $true))),
% 1.13/0.49 inference(flattening,[],[f455])).
% 1.13/0.49 thf(f794,plain,(
% 1.13/0.49 ! [X0 : $tType] : ((((linorder @ X0 @ type2 @ X0)) != $true) | ! [X1 : X0,X2 : list @ X0] : (((sorted1061247458sorted @ X0 @ (cons @ X0 @ X1 @ X2) @ nil @ X0)) != $true))),
% 1.13/0.49 inference(ennf_transformation,[],[f763])).
% 1.13/0.49 thf(f898,plain,(
% 1.13/0.49 ((((sorted1061247458sorted @ a @ l2a @ (cons @ a @ x1 @ l1)) & (sorted1061247458sorted @ a @ (cons @ a @ x1 @ l1) @ l2a))) != ((l2a = (cons @ a @ x1 @ l1))))),
% 1.13/0.49 inference(cnf_transformation,[],[f749])).
% 1.13/0.49 thf(f918,plain,(
% 1.13/0.49 ( ! [X0 : $tType,X2 : list @ X0,X1 : X0] : ((((sorted1061247458sorted @ X0 @ (cons @ X0 @ X1 @ X2) @ nil @ X0)) != $true) | (((linorder @ X0 @ type2 @ X0)) != $true)) )),
% 1.13/0.49 inference(cnf_transformation,[],[f794])).
% 1.13/0.49 thf(f932,plain,(
% 1.13/0.49 (l2a = nil @ a)),
% 1.13/0.49 inference(cnf_transformation,[],[f1])).
% 1.13/0.49 thf(f958,plain,(
% 1.13/0.49 (((linorder @ a @ type2 @ a)) = $true)),
% 1.13/0.49 inference(cnf_transformation,[],[f334])).
% 1.13/0.49 thf(f961,plain,(
% 1.13/0.49 ( ! [X0 : $tType,X2 : X0,X1 : list @ X0] : ((nil @ X0 != ((cons @ X0 @ X2 @ X1)))) )),
% 1.13/0.49 inference(cnf_transformation,[],[f757])).
% 1.13/0.49 thf(f983,plain,(
% 1.13/0.49 ($true = ((l2a = (cons @ a @ x1 @ l1)))) | ($true = (((sorted1061247458sorted @ a @ l2a @ (cons @ a @ x1 @ l1)) & (sorted1061247458sorted @ a @ (cons @ a @ x1 @ l1) @ l2a))))),
% 1.13/0.49 inference(xor_proxy_clausification,[],[f898])).
% 1.13/0.49 thf(f987,plain,(
% 1.13/0.49 ($true = (((sorted1061247458sorted @ a @ l2a @ (cons @ a @ x1 @ l1)) & (sorted1061247458sorted @ a @ (cons @ a @ x1 @ l1) @ l2a)))) | (l2a = ((cons @ a @ x1 @ l1)))),
% 1.13/0.49 inference(equality_proxy_clausification,[],[f983])).
% 1.13/0.49 thf(f988,plain,(
% 1.13/0.49 (l2a = ((cons @ a @ x1 @ l1))) | (((sorted1061247458sorted @ a @ (cons @ a @ x1 @ l1) @ l2a)) = $true)),
% 1.13/0.49 inference(and_proxy_clausification,[],[f987])).
% 1.13/0.49 thf(f992,plain,(
% 1.13/0.49 (nil @ a = ((cons @ a @ x1 @ l1))) | (((sorted1061247458sorted @ a @ (cons @ a @ x1 @ l1) @ l2a)) = $true)),
% 1.13/0.49 inference(forward_demodulation,[],[f988,f932])).
% 1.13/0.49 thf(f994,plain,(
% 1.13/0.49 (((sorted1061247458sorted @ a @ (cons @ a @ x1 @ l1) @ l2a)) = $true)),
% 1.13/0.49 inference(forward_subsumption_resolution,[],[f992,f961])).
% 1.13/0.49 thf(f996,plain,(
% 1.13/0.49 (((sorted1061247458sorted @ a @ (cons @ a @ x1 @ l1) @ nil @ a)) = $true)),
% 1.13/0.49 inference(forward_demodulation,[],[f994,f932])).
% 1.13/0.49 thf(f997,plain,(
% 1.13/0.49 ($true != $true) | (((linorder @ a @ type2 @ a)) != $true)),
% 1.13/0.49 inference(superposition,[],[f918,f996])).
% 1.13/0.49 thf(f998,plain,(
% 1.13/0.49 (((linorder @ a @ type2 @ a)) != $true)),
% 1.13/0.49 inference(trivial_inequality_removal,[],[f997])).
% 1.13/0.49 thf(f999,plain,(
% 1.13/0.49 $false),
% 1.13/0.49 inference(forward_subsumption_resolution,[],[f998,f958])).
% 1.13/0.49 % SZS output end Proof for theBenchmark
% 1.13/0.49 % (2461752)------------------------------
% 1.13/0.49 % (2461752)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.13/0.49 % (2461752)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.13/0.49 % (2461752)CaDiCaL version: 2.1.3
% 1.13/0.49 % (2461752)Termination reason: Refutation
% 1.13/0.49 % (2461752)Time elapsed: 0.047 s
% 1.13/0.49 % (2461752)Peak memory usage: 13 MB
% 1.13/0.49 % (2461752)Instructions burned: 95 (million)
% 1.13/0.49 % (2461716)Success in time 0.189 s
% 1.13/0.49 % Vampire exiting
%------------------------------------------------------------------------------