%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP031^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 : n015.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:02 AM UTC 2026
% Result : Theorem 0.52s 0.41s
% Output : Refutation 0.52s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP031^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.09/0.19 % Computer : n015.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 19:42:04 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.23/0.28 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.52/0.41 % (4014171)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.52/0.41 % (4014177)lrs+10_16_si=on:nwc=1.5:random_seed=3657973312:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.52/0.41 % (4014182)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.52/0.41 % (4014182)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.52/0.41 % (4014177)Instruction limit reached!
% 0.52/0.41 % (4014177)------------------------------
% 0.52/0.41 % (4014177)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.41 % (4014177)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.41 % (4014177)CaDiCaL version: 2.1.3
% 0.52/0.41 % (4014177)Termination reason: Instruction limit
% 0.52/0.41 % (4014177)Termination phase: Property scanning
% 0.52/0.41 % (4014177)Time elapsed: 0.006 s
% 0.52/0.41 % (4014177)Peak memory usage: 10 MB
% 0.52/0.41 % (4014177)Instructions burned: 21 (million)
% 0.52/0.41 % (4014176)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2387830382:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.52/0.41 % (4014178)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2640642008:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.52/0.41 % (4014179)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=2396944177: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.52/0.41 % (4014182)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=3272069754:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.52/0.41 % (4014180)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=932346075:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.52/0.41 % (4014178)Instruction limit reached!
% 0.52/0.41 % (4014178)------------------------------
% 0.52/0.41 % (4014178)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.41 % (4014178)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.41 % (4014178)CaDiCaL version: 2.1.3
% 0.52/0.41 % (4014178)Termination reason: Instruction limit
% 0.52/0.41 % (4014178)Termination phase: shuffling
% 0.52/0.41 % (4014178)Time elapsed: 0.002 s
% 0.52/0.41 % (4014178)Peak memory usage: 10 MB
% 0.52/0.41 % (4014178)Instructions burned: 3 (million)
% 0.52/0.41 % (4014181)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3378114635:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.52/0.41 % (4014184)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=4038606537:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.52/0.41 % (4014184)Instruction limit reached!
% 0.52/0.41 % (4014184)------------------------------
% 0.52/0.41 % (4014184)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.41 % (4014184)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.41 % (4014184)CaDiCaL version: 2.1.3
% 0.52/0.41 % (4014184)Termination reason: Instruction limit
% 0.52/0.41 % (4014184)Termination phase: shuffling
% 0.52/0.41 % (4014184)Time elapsed: 0.001 s
% 0.52/0.41 % (4014184)Peak memory usage: 10 MB
% 0.52/0.41 % (4014184)Instructions burned: 5 (million)
% 0.52/0.41 % (4014180)Instruction limit reached!
% 0.52/0.41 % (4014180)------------------------------
% 0.52/0.41 % (4014180)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.41 % (4014180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.41 % (4014180)CaDiCaL version: 2.1.3
% 0.52/0.41 % (4014180)Termination reason: Instruction limit
% 0.52/0.41 % (4014180)Termination phase: Property scanning
% 0.52/0.41 % (4014180)Time elapsed: 0.017 s
% 0.52/0.41 % (4014180)Peak memory usage: 10 MB
% 0.52/0.41 % (4014180)Instructions burned: 24 (million)
% 0.52/0.41 % (4014193)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.52/0.41 % (4014193)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=1397311000:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.52/0.41 % (4014194)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=1508776580:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.52/0.41 % (4014194)Instruction limit reached!
% 0.52/0.41 % (4014194)------------------------------
% 0.52/0.41 % (4014194)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.41 % (4014194)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.41 % (4014194)CaDiCaL version: 2.1.3
% 0.52/0.41 % (4014194)Termination reason: Instruction limit
% 0.52/0.41 % (4014194)Termination phase: shuffling
% 0.52/0.41 % (4014194)Time elapsed: 0.003 s
% 0.52/0.41 % (4014194)Peak memory usage: 10 MB
% 0.52/0.41 % (4014194)Instructions burned: 12 (million)
% 0.52/0.41 % (4014193)Instruction limit reached!
% 0.52/0.41 % (4014193)------------------------------
% 0.52/0.41 % (4014193)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.41 % (4014193)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.41 % (4014193)CaDiCaL version: 2.1.3
% 0.52/0.41 % (4014193)Termination reason: Instruction limit
% 0.52/0.41 % (4014193)Termination phase: shuffling
% 0.52/0.41 % (4014193)Time elapsed: 0.004 s
% 0.52/0.41 % (4014193)Peak memory usage: 10 MB
% 0.52/0.41 % (4014193)Instructions burned: 8 (million)
% 0.52/0.41 % (4014190)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=3536032836:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.52/0.41 % (4014176)Instruction limit reached!
% 0.52/0.41 % (4014176)------------------------------
% 0.52/0.41 % (4014176)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.41 % (4014176)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.41 % (4014176)CaDiCaL version: 2.1.3
% 0.52/0.41 % (4014176)Termination reason: Instruction limit
% 0.52/0.41 % (4014176)Termination phase: Property scanning
% 0.52/0.41 % (4014176)Time elapsed: 0.041 s
% 0.52/0.41 % (4014176)Peak memory usage: 12 MB
% 0.52/0.41 % (4014176)Instructions burned: 88 (million)
% 0.52/0.41 % (4014190)Instruction limit reached!
% 0.52/0.41 % (4014190)------------------------------
% 0.52/0.41 % (4014190)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.41 % (4014190)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.41 % (4014190)CaDiCaL version: 2.1.3
% 0.52/0.41 % (4014190)Termination reason: Instruction limit
% 0.52/0.41 % (4014190)Termination phase: shuffling
% 0.52/0.41 % (4014190)Time elapsed: 0.006 s
% 0.52/0.41 % (4014190)Peak memory usage: 10 MB
% 0.52/0.41 % (4014190)Instructions burned: 5 (million)
% 0.52/0.41 % (4014198)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=3247837279:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.52/0.41 % (4014197)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.52/0.41 % (4014197)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.52/0.41 % (4014197)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=471157247: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.52/0.41 % (4014201)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.52/0.41 % (4014201)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=4067063571:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.52/0.41 % (4014200)lrs+10_1_si=on:cs=on:random_seed=4150840772:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.52/0.41 % (4014201)Instruction limit reached!
% 0.52/0.41 % (4014201)------------------------------
% 0.52/0.41 % (4014201)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.41 % (4014201)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.41 % (4014201)CaDiCaL version: 2.1.3
% 0.52/0.41 % (4014201)Termination reason: Instruction limit
% 0.52/0.41 % (4014201)Termination phase: shuffling
% 0.52/0.41 % (4014201)Time elapsed: 0.003 s
% 0.52/0.41 % (4014201)Peak memory usage: 10 MB
% 0.52/0.41 % (4014201)Instructions burned: 6 (million)
% 0.52/0.41 % (4014200)Instruction limit reached!
% 0.52/0.41 % (4014200)------------------------------
% 0.52/0.41 % (4014200)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.41 % (4014200)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.41 % (4014200)CaDiCaL version: 2.1.3
% 0.52/0.41 % (4014200)Termination reason: Instruction limit
% 0.52/0.41 % (4014200)Termination phase: shuffling
% 0.52/0.41 % (4014200)Time elapsed: 0.004 s
% 0.52/0.41 % (4014200)Peak memory usage: 10 MB
% 0.52/0.41 % (4014200)Instructions burned: 8 (million)
% 0.52/0.41 % (4014179) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4014171-4014179"...
% 0.52/0.41 % (4014181)Instruction limit reached!
% 0.52/0.41 % (4014181)------------------------------
% 0.52/0.41 % (4014181)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.41 % (4014181)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.41 % (4014181)CaDiCaL version: 2.1.3
% 0.52/0.41 % (4014181)Termination reason: Instruction limit
% 0.52/0.41 % (4014181)Termination phase: Function definition elimination
% 0.52/0.41 % (4014181)Time elapsed: 0.064 s
% 0.52/0.41 % (4014181)Peak memory usage: 12 MB
% 0.52/0.41 % (4014181)Instructions burned: 75 (million)
% 0.52/0.41 % (4014197)Instruction limit reached!
% 0.52/0.41 % (4014197)------------------------------
% 0.52/0.41 % (4014197)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.41 % (4014197)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.41 % (4014197)CaDiCaL version: 2.1.3
% 0.52/0.41 % (4014197)Termination reason: Instruction limit
% 0.52/0.41 % (4014197)Termination phase: shuffling
% 0.52/0.41 % (4014197)Time elapsed: 0.020 s
% 0.52/0.41 % (4014197)Peak memory usage: 10 MB
% 0.52/0.41 % (4014197)Instructions burned: 28 (million)
% 0.52/0.41 % (4014179)...printing done.
% 0.52/0.41 % (4014179)Refutation found. Thanks to Tanya!
% 0.52/0.41 % SZS status Theorem for theBenchmark
% 0.52/0.41 % SZS output start Proof for theBenchmark
% 0.52/0.41 thf(type_def_5, type, binary1291135688e_Tree: $tType > $tType).
% 0.52/0.41 thf(type_def_6, type, set: $tType > $tType).
% 0.52/0.41 thf(type_def_7, type, int: $tType).
% 0.52/0.41 thf(type_def_8, type, a: $tType).
% 0.52/0.41 thf(type_def_9, type, sTfun: ($tType * $tType) > $tType).
% 0.52/0.41 thf(func_def_0, type, bounded_lattice: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_1, type, type: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_2, type, minus: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_3, type, bot: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_4, type, ord: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_5, type, order: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_6, type, group_add: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_7, type, lattice: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_8, type, no_bot: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_9, type, no_top: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_10, type, linorder: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_11, type, preorder: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_12, type, order_bot: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_13, type, wellorder: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_14, type, dense_order: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_15, type, semilattice_sup: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_16, type, ordered_ab_group_add: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_17, type, cancel146912293up_add: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_18, type, bounde1808546759up_bot: !>[X0: $tType]:($o)).
% 0.52/0.41 thf(func_def_19, type, binary210054475elle_T: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.52/0.41 thf(func_def_20, type, binary1746293266le_Tip: !>[X0: $tType]:(binary1291135688e_Tree @ X0)).
% 0.52/0.41 thf(func_def_21, type, binary2130109271t_Tree: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > set @ X0))).
% 0.52/0.41 thf(func_def_22, type, binary1830089824insert: !>[X0: $tType]:(((X0 > int) > X0 > binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.52/0.41 thf(func_def_23, type, binary64540844le_eqs: !>[X0: $tType]:(((X0 > int) > X0 > set @ X0))).
% 0.52/0.41 thf(func_def_24, type, binary827270440e_memb: !>[X0: $tType]:(((X0 > int) > X0 > binary1291135688e_Tree @ X0 > $o))).
% 0.52/0.41 thf(func_def_25, type, binary1653327646_setOf: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > set @ X0))).
% 0.52/0.41 thf(func_def_26, type, binary1610619414edTree: !>[X0: $tType]:(((X0 > int) > binary1291135688e_Tree @ X0 > $o))).
% 0.52/0.41 thf(func_def_27, type, binary231205461t_pred: !>[X0: $tType]:(((X0 > int) > X0 > X0 > binary1291135688e_Tree @ X0 > $o))).
% 0.52/0.41 thf(func_def_28, type, minus_minus: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.52/0.41 thf(func_def_29, type, the: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_30, type, if: !>[X0: $tType]:(($o > X0 > X0 > X0))).
% 0.52/0.41 thf(func_def_31, type, sup_sup: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.52/0.41 thf(func_def_32, type, bot_bot: !>[X0: $tType]:(X0)).
% 0.52/0.41 thf(func_def_33, type, ord_less: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.52/0.41 thf(func_def_34, type, ord_less_eq: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.52/0.41 thf(func_def_35, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 0.52/0.41 thf(func_def_36, type, insert: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 0.52/0.41 thf(func_def_37, type, is_empty: !>[X0: $tType]:((set @ X0 > $o))).
% 0.52/0.41 thf(func_def_38, type, is_singleton: !>[X0: $tType]:((set @ X0 > $o))).
% 0.52/0.41 thf(func_def_39, type, pairwise: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > $o))).
% 0.52/0.41 thf(func_def_40, type, remove: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 0.52/0.41 thf(func_def_41, type, the_elem: !>[X0: $tType]:((set @ X0 > X0))).
% 0.52/0.41 thf(func_def_42, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 0.52/0.41 thf(func_def_43, type, e: a).
% 0.52/0.41 thf(func_def_44, type, h: (a > int)).
% 0.52/0.41 thf(func_def_45, type, t1: binary1291135688e_Tree @ a).
% 0.52/0.41 thf(func_def_46, type, t2: binary1291135688e_Tree @ a).
% 0.52/0.41 thf(func_def_47, type, x: a).
% 0.52/0.41 thf(func_def_51, type, db0: !>[X0: $tType]:(X0)).
% 0.52/0.41 thf(func_def_52, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.52/0.41 thf(func_def_53, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.52/0.41 thf(func_def_54, type, db2: !>[X0: $tType]:(X0)).
% 0.52/0.41 thf(func_def_55, type, db1: !>[X0: $tType]:(X0)).
% 0.52/0.41 thf(func_def_56, type, vAND: ($o > $o > $o)).
% 0.52/0.41 thf(func_def_57, type, vNOT: ($o > $o)).
% 0.52/0.41 thf(func_def_58, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.52/0.41 thf(func_def_59, type, vOR: ($o > $o > $o)).
% 0.52/0.41 thf(func_def_60, type, vIMP: ($o > $o > $o)).
% 0.52/0.41 thf(func_def_61, type, db3: !>[X0: $tType]:(X0)).
% 0.52/0.41 thf(func_def_62, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.52/0.41 thf(func_def_63, type, sK0: !>[X0: $tType]:(((X0 > int) > binary1291135688e_Tree @ X0 > X0 > X0))).
% 0.52/0.41 thf(func_def_64, type, sK1: !>[X0: $tType]:(((X0 > int) > binary1291135688e_Tree @ X0 > X0 > X0))).
% 0.52/0.41 thf(func_def_65, type, sK2: !>[X0: $tType]:(((X0 > $o) > set @ X0 > set @ X0 > X0))).
% 0.52/0.41 thf(func_def_66, type, sK3: !>[X0: $tType]:(((X0 > $o) > set @ X0 > X0))).
% 0.52/0.41 thf(func_def_67, type, sK4: !>[X0: $tType]:(((X0 > $o) > set @ X0 > X0))).
% 0.52/0.41 thf(func_def_68, type, sK5: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_69, type, sK6: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_70, type, sK7: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_71, type, sK8: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_72, type, sK9: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_73, type, sK10: !>[X0: $tType]:((X0 > X0))).
% 0.52/0.41 thf(func_def_74, type, sK11: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.52/0.41 thf(func_def_75, type, sK12: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.52/0.41 thf(func_def_76, type, sK13: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 0.52/0.41 thf(func_def_77, type, sK14: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 0.52/0.41 thf(func_def_78, type, sK15: a).
% 0.52/0.41 thf(func_def_79, type, sK16: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_80, type, sK17: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_81, type, sK18: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.52/0.41 thf(func_def_82, type, sK19: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.52/0.41 thf(func_def_83, type, sK20: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.52/0.41 thf(func_def_84, type, sK21: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.52/0.41 thf(func_def_85, type, sK22: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0))).
% 0.52/0.41 thf(func_def_86, type, sK23: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.52/0.41 thf(func_def_87, type, sK24: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > binary1291135688e_Tree @ X0))).
% 0.52/0.41 thf(func_def_88, type, sK25: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_89, type, sK26: !>[X0: $tType]:((set @ X0 > X0))).
% 0.52/0.41 thf(func_def_90, type, sK27: !>[X0: $tType]:((set @ X0 > X0))).
% 0.52/0.41 thf(func_def_91, type, sK28: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_92, type, sK29: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.52/0.41 thf(func_def_93, type, sK30: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 0.52/0.41 thf(func_def_94, type, sK31: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.52/0.41 thf(func_def_95, type, sK32: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.52/0.41 thf(func_def_96, type, sK33: !>[X0: $tType]:(((X0 > $o) > X0 > X0))).
% 0.52/0.41 thf(func_def_97, type, sK34: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > X0))).
% 0.52/0.41 thf(func_def_98, type, sK35: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 0.52/0.41 thf(func_def_99, type, sK36: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 0.52/0.41 thf(func_def_100, type, sK37: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 0.52/0.41 thf(func_def_101, type, sK38: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 0.52/0.41 thf(func_def_102, type, sK39: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 0.52/0.41 thf(func_def_103, type, sK40: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > binary1291135688e_Tree @ X0))).
% 0.52/0.41 thf(func_def_104, type, sK41: !>[X0: $tType]:((binary1291135688e_Tree @ X0 > X0 > X0))).
% 0.52/0.41 thf(func_def_105, type, sK42: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_106, type, sK43: !>[X0: $tType]:((set @ X0 > X0))).
% 0.52/0.41 thf(func_def_107, type, sK44: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_108, type, sK45: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.52/0.41 thf(func_def_109, type, sK46: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.52/0.41 thf(func_def_110, type, sK47: !>[X0: $tType]:((set @ X0 > X0))).
% 0.52/0.41 thf(func_def_111, type, sK48: !>[X0: $tType]:((set @ X0 > X0))).
% 0.52/0.41 thf(func_def_112, type, sK49: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 0.52/0.41 thf(func_def_113, type, sK50: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_114, type, sK51: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.52/0.41 thf(func_def_115, type, sK52: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.52/0.41 thf(func_def_116, type, sK53: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_117, type, sK54: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_118, type, sK55: !>[X0: $tType]:((X0 > X0))).
% 0.52/0.41 thf(func_def_119, type, sK56: !>[X0: $tType]:((X0 > (X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_120, type, sK57: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_121, type, sK58: !>[X0: $tType]:((set @ X0 > X0))).
% 0.52/0.41 thf(func_def_122, type, sK59: !>[X0: $tType]:((set @ X0 > (X0 > $o) > set @ X0 > X0))).
% 0.52/0.41 thf(func_def_123, type, sK60: !>[X0: $tType]:(((X0 > $o) > set @ X0 > X0))).
% 0.52/0.41 thf(func_def_124, type, sK61: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_125, type, sK62: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.52/0.41 thf(func_def_126, type, sK63: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.52/0.41 thf(func_def_127, type, sK64: !>[X0: $tType]:(((binary1291135688e_Tree @ X0 > $o) > binary1291135688e_Tree @ X0))).
% 0.52/0.41 thf(func_def_128, type, sK65: !>[X0: $tType]:(((binary1291135688e_Tree @ X0 > $o) > X0))).
% 0.52/0.41 thf(func_def_129, type, sK66: !>[X0: $tType]:(((binary1291135688e_Tree @ X0 > $o) > binary1291135688e_Tree @ X0))).
% 0.52/0.41 thf(func_def_130, type, sK67: !>[X0: $tType]:((X0 > set @ X0 > X0 > set @ X0 > set @ X0))).
% 0.52/0.41 thf(func_def_131, type, sK68: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.52/0.41 thf(func_def_132, type, sK69: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.52/0.41 thf(func_def_133, type, sK70: !>[X0: $tType, X1: $tType]:(((X0 > X1) > (X0 > X1) > X0))).
% 0.52/0.41 thf(f1,axiom,(
% 0.52/0.41 ! [X1 : a] : ((member @ a @ X1 @ (binary64540844le_eqs @ a @ h @ e)) => (ord_less @ int @ (h @ X1) @ (h @ x)))),
% 0.52/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_eqsLessX)).
% 0.52/0.41 thf(f167,axiom,(
% 0.52/0.41 ! [X0 : $tType] : (order @ X0 => ! [X1 : X0] : ~(ord_less @ X0 @ X1 @ X1))),
% 0.52/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_166_dual__order_Oirrefl)).
% 0.52/0.41 thf(f278,axiom,(
% 0.52/0.41 order @ int),
% 0.52/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',tcon_Int_Oint___Orderings_Oorder_6)).
% 0.52/0.41 thf(f303,conjecture,(
% 0.52/0.41 ! [X0 : a] : ((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e)) => (((h @ X0)) != ((h @ x))))),
% 0.52/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)).
% 0.52/0.41 thf(f304,negated_conjecture,(
% 0.52/0.41 ~ ! [X0 : a] : ((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e)) => (((h @ X0)) != ((h @ x))))),
% 0.52/0.41 inference(negated_conjecture,[status(cth)],[f303])).
% 0.52/0.41 thf(f331,plain,(
% 0.52/0.41 ! [X0 : $tType] : (order @ X0 => ! [X1 : X0] : ~(ord_less @ X0 @ X1 @ X1))),
% 0.52/0.41 inference(rectify,[],[f167])).
% 0.52/0.41 thf(f332,plain,(
% 0.52/0.41 ! [X0 : $tType] : ((order @ X0 = $true) => ! [X1 : X0] : ~ (((ord_less @ X0 @ X1 @ X1)) = $true))),
% 0.52/0.41 inference(fool_elimination,[],[f331])).
% 0.52/0.41 thf(f413,plain,(
% 0.52/0.41 ! [X0 : a] : ((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e)) => (ord_less @ int @ (h @ X0) @ (h @ x)))),
% 0.52/0.41 inference(rectify,[],[f1])).
% 0.52/0.41 thf(f414,plain,(
% 0.52/0.41 ! [X0 : a] : ((((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e))) = $true) => ($true = ((ord_less @ int @ (h @ X0) @ (h @ x)))))),
% 0.52/0.41 inference(fool_elimination,[],[f413])).
% 0.52/0.41 thf(f637,plain,(
% 0.52/0.41 order @ int),
% 0.52/0.41 inference(rectify,[],[f278])).
% 0.52/0.41 thf(f638,plain,(
% 0.52/0.41 (order @ int = $true)),
% 0.52/0.41 inference(fool_elimination,[],[f637])).
% 0.52/0.41 thf(f745,plain,(
% 0.52/0.41 ~ ! [X0 : a] : ((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e)) => (((h @ X0)) != ((h @ x))))),
% 0.52/0.41 inference(rectify,[],[f304])).
% 0.52/0.41 thf(f746,plain,(
% 0.52/0.41 ~ ! [X0 : a] : ((((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e))) = $true) => (((h @ x)) != ((h @ X0))))),
% 0.52/0.41 inference(fool_elimination,[],[f745])).
% 0.52/0.41 thf(f826,plain,(
% 0.52/0.41 ! [X0 : $tType] : ((order @ X0 = $true) => ! [X1 : X0] : (((ord_less @ X0 @ X1 @ X1)) != $true))),
% 0.52/0.41 inference(flattening,[],[f332])).
% 0.52/0.41 thf(f913,plain,(
% 0.52/0.41 ! [X0 : $tType] : (! [X1 : X0] : (((ord_less @ X0 @ X1 @ X1)) != $true) | (order @ X0 != $true))),
% 0.52/0.41 inference(ennf_transformation,[],[f826])).
% 0.52/0.41 thf(f956,plain,(
% 0.52/0.41 ! [X0 : a] : ((((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e))) != $true) | ($true = ((ord_less @ int @ (h @ X0) @ (h @ x)))))),
% 0.52/0.41 inference(ennf_transformation,[],[f414])).
% 0.52/0.41 thf(f1046,plain,(
% 0.52/0.41 ? [X0 : a] : ((((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e))) = $true) & (((h @ x)) = ((h @ X0))))),
% 0.52/0.41 inference(ennf_transformation,[],[f746])).
% 0.52/0.41 thf(f1143,plain,(
% 0.52/0.41 ($true = ((member @ a @ sK15 @ (binary64540844le_eqs @ a @ h @ e)))) & (((h @ x)) = ((h @ sK15)))),
% 0.52/0.41 inference(skolemize,[status(esa),new_symbols(skolem,[sK15]),skolemize(X0,sK15)],[f1046])).
% 0.52/0.41 thf(f1413,plain,(
% 0.52/0.41 ( ! [X0 : a] : (($true = ((ord_less @ int @ (h @ X0) @ (h @ x)))) | (((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e))) != $true)) )),
% 0.52/0.41 inference(cnf_transformation,[],[f956])).
% 0.52/0.41 thf(f1449,plain,(
% 0.52/0.41 (((h @ x)) = ((h @ sK15)))),
% 0.52/0.41 inference(cnf_transformation,[],[f1143])).
% 0.52/0.41 thf(f1450,plain,(
% 0.52/0.41 ($true = ((member @ a @ sK15 @ (binary64540844le_eqs @ a @ h @ e))))),
% 0.52/0.41 inference(cnf_transformation,[],[f1143])).
% 0.52/0.41 thf(f1495,plain,(
% 0.52/0.41 ( ! [X0 : $tType,X1 : X0] : ((((ord_less @ X0 @ X1 @ X1)) != $true) | (order @ X0 != $true)) )),
% 0.52/0.41 inference(cnf_transformation,[],[f913])).
% 0.52/0.41 thf(f1610,plain,(
% 0.52/0.41 (order @ int = $true)),
% 0.52/0.41 inference(cnf_transformation,[],[f638])).
% 0.52/0.41 thf(f1934,definition,(
% 0.52/0.41 spl71_6 <=> ($true = ((member @ a @ sK15 @ (binary64540844le_eqs @ a @ h @ e))))),
% 0.52/0.41 introduced(definition,[new_symbols(definition,[spl71_6])],[avatar_definition])).
% 0.52/0.41 thf(f1936,plain,(
% 0.52/0.41 ($true = ((member @ a @ sK15 @ (binary64540844le_eqs @ a @ h @ e)))) | ~spl71_6),
% 0.52/0.41 inference(avatar_component_clause,[],[f1934])).
% 0.52/0.41 thf(f1937,plain,(
% 0.52/0.41 spl71_6),
% 0.52/0.41 inference(avatar_split_clause,[],[f1450,f1934])).
% 0.52/0.41 thf(f1961,definition,(
% 0.52/0.41 spl71_12 <=> (((h @ x)) = ((h @ sK15)))),
% 0.52/0.41 introduced(definition,[new_symbols(definition,[spl71_12])],[avatar_definition])).
% 0.52/0.41 thf(f1963,plain,(
% 0.52/0.41 (((h @ x)) = ((h @ sK15))) | ~spl71_12),
% 0.52/0.41 inference(avatar_component_clause,[],[f1961])).
% 0.52/0.41 thf(f1964,plain,(
% 0.52/0.41 spl71_12),
% 0.52/0.41 inference(avatar_split_clause,[],[f1449,f1961])).
% 0.52/0.41 thf(f1971,definition,(
% 0.52/0.41 spl71_14 <=> (order @ int = $true)),
% 0.52/0.41 introduced(definition,[new_symbols(definition,[spl71_14])],[avatar_definition])).
% 0.52/0.41 thf(f1974,plain,(
% 0.52/0.41 spl71_14),
% 0.52/0.41 inference(avatar_split_clause,[],[f1610,f1971])).
% 0.52/0.41 thf(f2096,plain,(
% 0.52/0.41 ( ! [X0 : a] : ((((member @ a @ X0 @ (binary64540844le_eqs @ a @ h @ e))) != $true) | ($true = ((ord_less @ int @ (h @ X0) @ (h @ sK15))))) ) | ~spl71_12),
% 0.52/0.41 inference(forward_demodulation,[],[f1413,f1963])).
% 0.52/0.41 thf(f2098,plain,(
% 0.52/0.41 ($true = ((ord_less @ int @ (h @ sK15) @ (h @ sK15)))) | ($true != $true) | (~spl71_6 | ~spl71_12)),
% 0.52/0.41 inference(superposition,[],[f2096,f1936])).
% 0.52/0.41 thf(f2102,plain,(
% 0.52/0.41 ($true = ((ord_less @ int @ (h @ sK15) @ (h @ sK15)))) | (~spl71_6 | ~spl71_12)),
% 0.52/0.41 inference(trivial_inequality_removal,[],[f2098])).
% 0.52/0.41 thf(f2107,definition,(
% 0.52/0.41 spl71_38 <=> ($true = ((ord_less @ int @ (h @ sK15) @ (h @ sK15))))),
% 0.52/0.41 introduced(definition,[new_symbols(definition,[spl71_38])],[avatar_definition])).
% 0.52/0.42 thf(f2109,plain,(
% 0.52/0.42 ($true = ((ord_less @ int @ (h @ sK15) @ (h @ sK15)))) | ~spl71_38),
% 0.52/0.42 inference(avatar_component_clause,[],[f2107])).
% 0.52/0.42 thf(f2110,plain,(
% 0.52/0.42 spl71_38 | ~spl71_6 | ~spl71_12),
% 0.52/0.42 inference(avatar_split_clause,[],[f2102,f1961,f1934,f2107])).
% 0.52/0.42 thf(f2272,plain,(
% 0.52/0.42 (order @ int != $true) | ($true != $true) | ~spl71_38),
% 0.52/0.42 inference(superposition,[],[f1495,f2109])).
% 0.52/0.42 thf(f2273,plain,(
% 0.52/0.42 (order @ int != $true) | ~spl71_38),
% 0.52/0.42 inference(trivial_inequality_removal,[],[f2272])).
% 0.52/0.42 thf(f2274,plain,(
% 0.52/0.42 ~spl71_14 | ~spl71_38),
% 0.52/0.42 inference(avatar_split_clause,[],[f2273,f2107,f1971])).
% 0.52/0.42 cnf(s5, plain, spl71_6, inference(sat_conversion,[],[f1937])).
% 0.52/0.42 cnf(s10, plain, spl71_12, inference(sat_conversion,[],[f1964])).
% 0.52/0.42 cnf(s12, plain, spl71_14, inference(sat_conversion,[],[f1974])).
% 0.52/0.42 cnf(s42, plain, ~spl71_6 | ~spl71_12 | spl71_38, inference(sat_conversion,[],[f2110])).
% 0.52/0.42 cnf(s58, plain, ~spl71_14 | ~spl71_38, inference(sat_conversion,[],[f2274])).
% 0.52/0.42 cnf(s59, plain, ~spl71_38, inference(rat,[],[s58,s12])).
% 0.52/0.42 cnf(s60, plain, ~spl71_6, inference(rat,[],[s42,s59,s10])).
% 0.52/0.42 cnf(s63, plain, $false, inference(rat,[],[s5,s60])).
% 0.52/0.42 thf(f2275,plain,(
% 0.52/0.42 $false),
% 0.52/0.42 inference(avatar_sat_refutation,[],[s63])).
% 0.52/0.42 % SZS output end Proof for theBenchmark
% 0.52/0.42 % (4014179)------------------------------
% 0.52/0.42 % (4014179)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.42 % (4014179)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.42 % (4014179)CaDiCaL version: 2.1.3
% 0.52/0.42 % (4014179)Termination reason: Refutation
% 0.52/0.42 % (4014179)Time elapsed: 0.074 s
% 0.52/0.42 % (4014179)Peak memory usage: 14 MB
% 0.52/0.42 % (4014179)Instructions burned: 143 (million)
% 0.52/0.42 % (4014171)Success in time 0.124 s
% 0.52/0.42 % Vampire exiting
%------------------------------------------------------------------------------