%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : DAT176^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 : n018.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:29 AM UTC 2026
% Result : Theorem 0.49s 0.40s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT176^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n018.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 18:08:12 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.21/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.49/0.40 % (439615)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.49/0.40 % (439626)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.49/0.40 % (439626)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.49/0.40 % (439626)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=1749084295:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.49/0.40 % (439620)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1903401956:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.49/0.40 % (439621)lrs+10_16_si=on:nwc=1.5:random_seed=3663971945:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.49/0.40 % (439622)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=603685690:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.49/0.40 % (439624)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2685557049:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.49/0.40 % (439623)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=757243799: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.49/0.40 % (439625)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3073938869:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.49/0.40 % (439622)Instruction limit reached!
% 0.49/0.40 % (439622)------------------------------
% 0.49/0.40 % (439622)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.40 % (439622)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.40 % (439622)CaDiCaL version: 2.1.3
% 0.49/0.40 % (439622)Termination reason: Instruction limit
% 0.49/0.40 % (439622)Termination phase: shuffling
% 0.49/0.40 % (439622)Time elapsed: 0.005 s
% 0.49/0.40 % (439622)Peak memory usage: 10 MB
% 0.49/0.40 % (439622)Instructions burned: 7 (million)
% 0.49/0.40 % (439621)Instruction limit reached!
% 0.49/0.40 % (439621)------------------------------
% 0.49/0.40 % (439621)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.40 % (439621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.40 % (439621)CaDiCaL version: 2.1.3
% 0.49/0.40 % (439621)Termination reason: Instruction limit
% 0.49/0.40 % (439621)Termination phase: Property scanning
% 0.49/0.40 % (439621)Time elapsed: 0.009 s
% 0.49/0.40 % (439621)Peak memory usage: 10 MB
% 0.49/0.40 % (439621)Instructions burned: 19 (million)
% 0.49/0.40 % (439624)Instruction limit reached!
% 0.49/0.40 % (439624)------------------------------
% 0.49/0.40 % (439624)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.40 % (439624)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.40 % (439624)CaDiCaL version: 2.1.3
% 0.49/0.40 % (439624)Termination reason: Instruction limit
% 0.49/0.40 % (439624)Termination phase: Preprocessing 1
% 0.49/0.40 % (439624)Time elapsed: 0.011 s
% 0.49/0.40 % (439624)Peak memory usage: 10 MB
% 0.49/0.40 % (439624)Instructions burned: 25 (million)
% 0.49/0.40 % (439634)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3145133232:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.49/0.40 % (439636)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.49/0.40 % (439634)Instruction limit reached!
% 0.49/0.40 % (439634)------------------------------
% 0.49/0.40 % (439634)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.40 % (439634)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.40 % (439634)CaDiCaL version: 2.1.3
% 0.49/0.40 % (439634)Termination reason: Instruction limit
% 0.49/0.40 % (439634)Termination phase: shuffling
% 0.49/0.40 % (439634)Time elapsed: 0.002 s
% 0.49/0.40 % (439634)Peak memory usage: 10 MB
% 0.49/0.40 % (439634)Instructions burned: 2 (million)
% 0.49/0.40 % (439635)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=340074905:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.49/0.40 % (439636)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=812957073:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.49/0.40 % (439635)Instruction limit reached!
% 0.49/0.40 % (439635)------------------------------
% 0.49/0.40 % (439635)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.40 % (439635)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.40 % (439635)CaDiCaL version: 2.1.3
% 0.49/0.40 % (439635)Termination reason: Instruction limit
% 0.49/0.40 % (439635)Termination phase: shuffling
% 0.49/0.40 % (439635)Time elapsed: 0.003 s
% 0.49/0.40 % (439635)Peak memory usage: 10 MB
% 0.49/0.40 % (439635)Instructions burned: 5 (million)
% 0.49/0.40 % (439625)Instruction limit reached!
% 0.49/0.40 % (439625)------------------------------
% 0.49/0.40 % (439625)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.40 % (439625)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.40 % (439636)Instruction limit reached!
% 0.49/0.40 % (439636)------------------------------
% 0.49/0.40 % (439636)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.40 % (439636)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.40 % (439625)CaDiCaL version: 2.1.3
% 0.49/0.40 % (439636)CaDiCaL version: 2.1.3
% 0.49/0.40 % (439625)Termination reason: Instruction limit
% 0.49/0.40 % (439625)Termination phase: Saturation
% 0.49/0.40 % (439636)Termination reason: Instruction limit
% 0.49/0.40 % (439636)Termination phase: shuffling
% 0.49/0.40 % (439625)Time elapsed: 0.035 s
% 0.49/0.40 % (439636)Time elapsed: 0.003 s
% 0.49/0.40 % (439625)Peak memory usage: 12 MB
% 0.49/0.40 % (439636)Peak memory usage: 10 MB
% 0.49/0.40 % (439625)Instructions burned: 76 (million)
% 0.49/0.40 % (439636)Instructions burned: 7 (million)
% 0.49/0.40 % (439626)Instruction limit reached!
% 0.49/0.40 % (439626)------------------------------
% 0.49/0.40 % (439626)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.40 % (439626)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.40 % (439626)CaDiCaL version: 2.1.3
% 0.49/0.40 % (439626)Termination reason: Instruction limit
% 0.49/0.40 % (439626)Termination phase: Saturation
% 0.49/0.40 % (439626)Time elapsed: 0.045 s
% 0.49/0.40 % (439626)Peak memory usage: 13 MB
% 0.49/0.40 % (439626)Instructions burned: 160 (million)
% 0.49/0.40 % (439620)Instruction limit reached!
% 0.49/0.40 % (439620)------------------------------
% 0.49/0.40 % (439620)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.40 % (439620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.40 % (439620)CaDiCaL version: 2.1.3
% 0.49/0.40 % (439620)Termination reason: Instruction limit
% 0.49/0.40 % (439620)Termination phase: Saturation
% 0.49/0.40 % (439620)Time elapsed: 0.041 s
% 0.49/0.40 % (439620)Peak memory usage: 13 MB
% 0.49/0.40 % (439620)Instructions burned: 87 (million)
% 0.49/0.40 % (439641)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.49/0.40 % (439641)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.49/0.40 % (439644)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.49/0.40 % (439639)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=1664158010:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.49/0.40 % (439644)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=230071882:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.49/0.40 % (439644)Instruction limit reached!
% 0.49/0.40 % (439644)------------------------------
% 0.49/0.40 % (439644)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.40 % (439644)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.40 % (439644)CaDiCaL version: 2.1.3
% 0.49/0.40 % (439644)Termination reason: Instruction limit
% 0.49/0.40 % (439644)Termination phase: shuffling
% 0.49/0.40 % (439644)Time elapsed: 0.001 s
% 0.49/0.40 % (439644)Peak memory usage: 10 MB
% 0.49/0.40 % (439644)Instructions burned: 3 (million)
% 0.49/0.40 % (439641)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=3335986758: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.49/0.40 % (439639)Instruction limit reached!
% 0.49/0.40 % (439639)------------------------------
% 0.49/0.40 % (439639)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.40 % (439639)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.40 % (439642)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=207740018:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.49/0.40 % (439639)CaDiCaL version: 2.1.3
% 0.49/0.40 % (439639)Termination reason: Instruction limit
% 0.49/0.40 % (439639)Termination phase: shuffling
% 0.49/0.40 % (439639)Time elapsed: 0.006 s
% 0.49/0.40 % (439639)Peak memory usage: 10 MB
% 0.49/0.40 % (439639)Instructions burned: 13 (million)
% 0.49/0.40 % (439643)lrs+10_1_si=on:cs=on:random_seed=2903526211:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.49/0.40 % (439643)Instruction limit reached!
% 0.49/0.40 % (439643)------------------------------
% 0.49/0.40 % (439643)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.40 % (439643)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.40 % (439643)CaDiCaL version: 2.1.3
% 0.49/0.40 % (439643)Termination reason: Instruction limit
% 0.49/0.40 % (439643)Termination phase: shuffling
% 0.49/0.40 % (439643)Time elapsed: 0.004 s
% 0.49/0.40 % (439643)Peak memory usage: 10 MB
% 0.49/0.40 % (439643)Instructions burned: 8 (million)
% 0.49/0.40 % (439645)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=3452771083:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/38Mi)
% 0.49/0.40 % (439649)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=2838771440:st=2:i=249:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/249Mi)
% 0.49/0.40 % (439641)Instruction limit reached!
% 0.49/0.40 % (439641)------------------------------
% 0.49/0.40 % (439641)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.40 % (439641)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.40 % (439641)CaDiCaL version: 2.1.3
% 0.49/0.40 % (439641)Termination reason: Instruction limit
% 0.49/0.40 % (439641)Termination phase: Property scanning
% 0.49/0.40 % (439641)Time elapsed: 0.013 s
% 0.49/0.40 % (439641)Peak memory usage: 10 MB
% 0.49/0.40 % (439641)Instructions burned: 29 (million)
% 0.49/0.40 % (439623) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-439615-439623"...
% 0.49/0.40 % (439623)...printing done.
% 0.49/0.40 % (439623)Refutation found. Thanks to Tanya!
% 0.49/0.40 % SZS status Theorem for theBenchmark
% 0.49/0.40 % SZS output start Proof for theBenchmark
% 0.49/0.40 thf(type_def_5, type, coinductive_llist: $tType > $tType).
% 0.49/0.40 thf(type_def_6, type, set: $tType > $tType).
% 0.49/0.40 thf(type_def_7, type, itself: $tType > $tType).
% 0.49/0.40 thf(type_def_8, type, a: $tType).
% 0.49/0.40 thf(type_def_9, type, sTfun: ($tType * $tType) > $tType).
% 0.49/0.40 thf(func_def_0, type, bounded_lattice: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_1, type, type: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_2, type, minus: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_3, type, uminus: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_4, type, bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_5, type, top: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_6, type, group_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_7, type, lattice: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_8, type, ab_group_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_9, type, boolean_algebra: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_10, type, distrib_lattice: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_11, type, semilattice_inf: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_12, type, semilattice_sup: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_13, type, bounded_lattice_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_14, type, bounded_lattice_top: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_15, type, cancel146912293up_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_16, type, bounde1561333602nf_top: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_17, type, bounde1808546759up_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.49/0.40 thf(func_def_18, type, coinductive_LCons: !>[X0: $tType]:((X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_19, type, coinductive_LNil: !>[X0: $tType]:(coinductive_llist @ X0)).
% 0.49/0.40 thf(func_def_20, type, minus_minus: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.49/0.40 thf(func_def_21, type, uminus_uminus: !>[X0: $tType]:((X0 > X0))).
% 0.49/0.40 thf(func_def_22, type, lList2435255213lllsts: !>[X0: $tType]:((set @ X0 > set @ coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_23, type, lList2236698231inlsts: !>[X0: $tType]:((set @ X0 > set @ coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_24, type, lList21916056377ts_rec: !>[X0: $tType, X1: $tType]:((X0 > (X1 > coinductive_llist @ X1 > X0 > X0) > coinductive_llist @ X1 > X0))).
% 0.49/0.40 thf(func_def_25, type, lList22096119349pslsts: !>[X0: $tType]:((set @ X0 > set @ coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_26, type, lList21612149805nflsts: !>[X0: $tType]:((set @ X0 > set @ coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_27, type, lList21148268032oslsts: !>[X0: $tType]:((set @ X0 > set @ coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_28, type, inf_inf: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.49/0.40 thf(func_def_29, type, sup_sup: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.49/0.40 thf(func_def_30, type, bot_bot: !>[X0: $tType]:(X0)).
% 0.49/0.40 thf(func_def_31, type, top_top: !>[X0: $tType]:(X0)).
% 0.49/0.40 thf(func_def_32, type, type2: !>[X0: $tType]:(itself @ X0)).
% 0.49/0.40 thf(func_def_33, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 0.49/0.40 thf(func_def_34, type, disjnt: !>[X0: $tType]:((set @ X0 > set @ X0 > $o))).
% 0.49/0.40 thf(func_def_35, type, insert: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 0.49/0.40 thf(func_def_36, type, is_empty: !>[X0: $tType]:((set @ X0 > $o))).
% 0.49/0.40 thf(func_def_37, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 0.49/0.40 thf(func_def_38, type, x: coinductive_llist @ a).
% 0.49/0.40 thf(func_def_42, type, db0: !>[X0: $tType]:(X0)).
% 0.49/0.40 thf(func_def_43, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.49/0.40 thf(func_def_44, type, db1: !>[X0: $tType]:(X0)).
% 0.49/0.40 thf(func_def_45, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.49/0.40 thf(func_def_46, type, db2: !>[X0: $tType]:(X0)).
% 0.49/0.40 thf(func_def_47, type, sK0: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_48, type, sK1: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > X0))).
% 0.49/0.40 thf(func_def_49, type, sK2: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.49/0.40 thf(func_def_50, type, sK3: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.49/0.40 thf(func_def_51, type, sK4: !>[X0: $tType]:((set @ X0 > X0))).
% 0.49/0.40 thf(func_def_52, type, sK5: !>[X0: $tType]:((coinductive_llist @ X0 > set @ X0 > coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_53, type, sK6: !>[X0: $tType]:((coinductive_llist @ X0 > set @ X0 > X0))).
% 0.49/0.40 thf(func_def_54, type, sK7: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.49/0.40 thf(func_def_55, type, sK8: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_56, type, sK9: !>[X0: $tType]:((coinductive_llist @ X0 > X0))).
% 0.49/0.40 thf(func_def_57, type, sK10: !>[X0: $tType]:((set @ X0 > X0))).
% 0.49/0.40 thf(func_def_58, type, sK11: !>[X0: $tType]:((set @ X0 > set @ X0 > (X0 > $o) > X0))).
% 0.49/0.40 thf(func_def_59, type, sK12: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 0.49/0.40 thf(func_def_60, type, sK13: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 0.49/0.40 thf(func_def_61, type, sK14: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > set @ X0 > X0))).
% 0.49/0.40 thf(func_def_62, type, sK15: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > set @ X0 > coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_63, type, sK16: !>[X0: $tType, X1: $tType]:(((X0 > X1) > (X0 > X1) > X0))).
% 0.49/0.40 thf(func_def_64, type, sK17: !>[X0: $tType]:(X0)).
% 0.49/0.40 thf(func_def_65, type, sK18: !>[X0: $tType]:(X0)).
% 0.49/0.40 thf(func_def_66, type, sK19: !>[X0: $tType]:(X0)).
% 0.49/0.40 thf(func_def_67, type, sK20: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_68, type, sK21: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > X0))).
% 0.49/0.40 thf(func_def_69, type, sK22: !>[X0: $tType]:(X0)).
% 0.49/0.40 thf(func_def_70, type, sK23: !>[X0: $tType]:(X0)).
% 0.49/0.40 thf(func_def_71, type, sK24: !>[X0: $tType]:(X0)).
% 0.49/0.40 thf(func_def_72, type, sK25: !>[X0: $tType]:(X0)).
% 0.49/0.40 thf(func_def_73, type, sK26: !>[X0: $tType]:((coinductive_llist @ X0 > X0))).
% 0.49/0.40 thf(func_def_74, type, sK27: !>[X0: $tType]:((coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_75, type, sK28: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_76, type, sK29: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > X0))).
% 0.49/0.40 thf(func_def_77, type, sK30: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 0.49/0.40 thf(func_def_78, type, sK31: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > X0))).
% 0.49/0.40 thf(func_def_79, type, sK32: !>[X0: $tType]:((set @ X0 > coinductive_llist @ X0 > coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_80, type, sK33: !>[X0: $tType]:(((X0 > $o) > set @ X0 > X0))).
% 0.49/0.40 thf(func_def_81, type, sK34: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 0.49/0.40 thf(func_def_82, type, sK35: !>[X0: $tType]:((set @ X0 > (X0 > $o) > set @ X0 > X0))).
% 0.49/0.40 thf(func_def_83, type, sK36: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 0.49/0.40 thf(func_def_84, type, sK37: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 0.49/0.40 thf(func_def_85, type, sK38: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > set @ X0 > coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_86, type, sK39: !>[X0: $tType]:((coinductive_llist @ X0 > set @ X0 > X0))).
% 0.49/0.40 thf(func_def_87, type, sK40: !>[X0: $tType]:((coinductive_llist @ X0 > set @ X0 > coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_88, type, sK41: !>[X0: $tType]:((set @ X0 > X0))).
% 0.49/0.40 thf(func_def_89, type, sK42: !>[X0: $tType]:((set @ X0 > X0))).
% 0.49/0.40 thf(func_def_90, type, sK43: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_91, type, sK44: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > set @ X0 > X0))).
% 0.49/0.40 thf(func_def_92, type, sK45: !>[X0: $tType]:(((coinductive_llist @ X0 > $o) > set @ X0 > coinductive_llist @ X0))).
% 0.49/0.40 thf(func_def_93, type, vNOT: ($o > $o)).
% 0.49/0.40 thf(f1,axiom,(
% 0.49/0.40 ! [X0 : $tType,X2 : coinductive_llist @ X0] : (((member @ coinductive_llist @ X0 @ X2 @ (lList21612149805nflsts @ X0 @ top_top @ set @ X0))) = ~(member @ coinductive_llist @ X0 @ X2 @ (lList2236698231inlsts @ X0 @ top_top @ set @ X0)))),
% 0.49/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_notfin__inf)).
% 0.49/0.40 thf(f10,axiom,(
% 0.49/0.40 ! [X0 : $tType,X1 : coinductive_llist @ X0,X2 : set @ X0] : ((member @ coinductive_llist @ X0 @ X1 @ (lList21612149805nflsts @ X0 @ X2)) => ~((member @ coinductive_llist @ X0 @ X1 @ (lList2435255213lllsts @ X0 @ X2)) => (member @ coinductive_llist @ X0 @ X1 @ (lList2236698231inlsts @ X0 @ top_top @ set @ X0))))),
% 0.49/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_9_inflstsE)).
% 0.49/0.40 thf(f299,conjecture,(
% 0.49/0.40 (((member @ coinductive_llist @ a @ x @ (lList2236698231inlsts @ a @ top_top @ set @ a))) = ~(member @ coinductive_llist @ a @ x @ (lList21612149805nflsts @ a @ top_top @ set @ a)))),
% 0.49/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)).
% 0.49/0.40 thf(f300,negated_conjecture,(
% 0.49/0.40 ~ (((member @ coinductive_llist @ a @ x @ (lList2236698231inlsts @ a @ top_top @ set @ a))) = ~(member @ coinductive_llist @ a @ x @ (lList21612149805nflsts @ a @ top_top @ set @ a)))),
% 0.49/0.40 inference(negated_conjecture,[status(cth)],[f299])).
% 0.49/0.40 thf(f315,plain,(
% 0.49/0.40 ! [X0 : $tType,X1 : coinductive_llist @ X0] : (((member @ coinductive_llist @ X0 @ X1 @ (lList21612149805nflsts @ X0 @ top_top @ set @ X0))) = ~(member @ coinductive_llist @ X0 @ X1 @ (lList2236698231inlsts @ X0 @ top_top @ set @ X0)))),
% 0.49/0.40 inference(rectify,[],[f1])).
% 0.49/0.40 thf(f316,plain,(
% 0.49/0.40 ! [X0 : $tType,X1 : coinductive_llist @ X0] : ((((member @ coinductive_llist @ X0 @ X1 @ (lList21612149805nflsts @ X0 @ top_top @ set @ X0))) = $true) <=> ~ (((member @ coinductive_llist @ X0 @ X1 @ (lList2236698231inlsts @ X0 @ top_top @ set @ X0))) = $true))),
% 0.49/0.40 inference(fool_elimination,[],[f315])).
% 0.49/0.40 thf(f443,plain,(
% 0.49/0.40 ~ (((member @ coinductive_llist @ a @ x @ (lList2236698231inlsts @ a @ top_top @ set @ a))) = ~(member @ coinductive_llist @ a @ x @ (lList21612149805nflsts @ a @ top_top @ set @ a)))),
% 0.49/0.40 inference(rectify,[],[f300])).
% 0.49/0.40 thf(f444,plain,(
% 0.49/0.40 ~((((member @ coinductive_llist @ a @ x @ (lList2236698231inlsts @ a @ top_top @ set @ a))) = $true) <=> ~ (((member @ coinductive_llist @ a @ x @ (lList21612149805nflsts @ a @ top_top @ set @ a))) = $true))),
% 0.49/0.40 inference(fool_elimination,[],[f443])).
% 0.49/0.40 thf(f568,plain,(
% 0.49/0.40 ! [X0 : $tType,X1 : coinductive_llist @ X0,X2 : set @ X0] : ((member @ coinductive_llist @ X0 @ X1 @ (lList21612149805nflsts @ X0 @ X2)) => ~((member @ coinductive_llist @ X0 @ X1 @ (lList2435255213lllsts @ X0 @ X2)) => (member @ coinductive_llist @ X0 @ X1 @ (lList2236698231inlsts @ X0 @ top_top @ set @ X0))))),
% 0.49/0.40 inference(rectify,[],[f10])).
% 0.49/0.40 thf(f569,plain,(
% 0.49/0.40 ! [X0 : $tType,X2 : set @ X0,X1 : coinductive_llist @ X0] : ((((member @ coinductive_llist @ X0 @ X1 @ (lList21612149805nflsts @ X0 @ X2))) = $true) => ~((((member @ coinductive_llist @ X0 @ X1 @ (lList2435255213lllsts @ X0 @ X2))) = $true) => (((member @ coinductive_llist @ X0 @ X1 @ (lList2236698231inlsts @ X0 @ top_top @ set @ X0))) = $true)))),
% 0.49/0.40 inference(fool_elimination,[],[f568])).
% 0.49/0.40 thf(f748,plain,(
% 0.49/0.40 ! [X0 : $tType,X1 : coinductive_llist @ X0] : ((((member @ coinductive_llist @ X0 @ X1 @ (lList21612149805nflsts @ X0 @ top_top @ set @ X0))) = $true) <=> (((member @ coinductive_llist @ X0 @ X1 @ (lList2236698231inlsts @ X0 @ top_top @ set @ X0))) != $true))),
% 0.49/0.40 inference(flattening,[],[f316])).
% 0.49/0.40 thf(f768,plain,(
% 0.49/0.40 ~((((member @ coinductive_llist @ a @ x @ (lList2236698231inlsts @ a @ top_top @ set @ a))) = $true) <=> (((member @ coinductive_llist @ a @ x @ (lList21612149805nflsts @ a @ top_top @ set @ a))) != $true))),
% 0.49/0.40 inference(flattening,[],[f444])).
% 0.49/0.40 thf(f848,plain,(
% 0.49/0.40 ! [X0 : $tType,X1 : coinductive_llist @ X0,X2 : set @ X0] : (((((member @ coinductive_llist @ X0 @ X1 @ (lList2435255213lllsts @ X0 @ X2))) = $true) & (((member @ coinductive_llist @ X0 @ X1 @ (lList2236698231inlsts @ X0 @ top_top @ set @ X0))) != $true)) | (((member @ coinductive_llist @ X0 @ X1 @ (lList21612149805nflsts @ X0 @ X2))) != $true))),
% 0.49/0.40 inference(ennf_transformation,[],[f569])).
% 0.49/0.40 thf(f956,plain,(
% 0.49/0.40 (((member @ coinductive_llist @ a @ x @ (lList2236698231inlsts @ a @ top_top @ set @ a))) = $true) <~> (((member @ coinductive_llist @ a @ x @ (lList21612149805nflsts @ a @ top_top @ set @ a))) != $true)),
% 0.49/0.40 inference(ennf_transformation,[],[f768])).
% 0.49/0.40 thf(f1059,plain,(
% 0.49/0.40 ((((member @ coinductive_llist @ a @ x @ (lList21612149805nflsts @ a @ top_top @ set @ a))) = $true) | (((member @ coinductive_llist @ a @ x @ (lList2236698231inlsts @ a @ top_top @ set @ a))) != $true)) & ((((member @ coinductive_llist @ a @ x @ (lList21612149805nflsts @ a @ top_top @ set @ a))) != $true) | (((member @ coinductive_llist @ a @ x @ (lList2236698231inlsts @ a @ top_top @ set @ a))) = $true))),
% 0.49/0.40 inference(nnf_transformation,[],[f956])).
% 0.49/0.40 thf(f1118,plain,(
% 0.49/0.40 ! [X0 : $tType,X1 : coinductive_llist @ X0] : (((((member @ coinductive_llist @ X0 @ X1 @ (lList21612149805nflsts @ X0 @ top_top @ set @ X0))) = $true) | (((member @ coinductive_llist @ X0 @ X1 @ (lList2236698231inlsts @ X0 @ top_top @ set @ X0))) = $true)) & ((((member @ coinductive_llist @ X0 @ X1 @ (lList2236698231inlsts @ X0 @ top_top @ set @ X0))) != $true) | (((member @ coinductive_llist @ X0 @ X1 @ (lList21612149805nflsts @ X0 @ top_top @ set @ X0))) != $true)))),
% 0.49/0.40 inference(nnf_transformation,[],[f748])).
% 0.49/0.40 thf(f1285,plain,(
% 0.49/0.40 ( ! [X0 : $tType,X2 : set @ X0,X1 : coinductive_llist @ X0] : ((((member @ coinductive_llist @ X0 @ X1 @ (lList2236698231inlsts @ X0 @ top_top @ set @ X0))) != $true) | (((member @ coinductive_llist @ X0 @ X1 @ (lList21612149805nflsts @ X0 @ X2))) != $true)) )),
% 0.49/0.40 inference(cnf_transformation,[],[f848])).
% 0.49/0.40 thf(f1320,plain,(
% 0.49/0.40 (((member @ coinductive_llist @ a @ x @ (lList2236698231inlsts @ a @ top_top @ set @ a))) = $true) | (((member @ coinductive_llist @ a @ x @ (lList21612149805nflsts @ a @ top_top @ set @ a))) != $true)),
% 0.49/0.40 inference(cnf_transformation,[],[f1059])).
% 0.49/0.40 thf(f1321,plain,(
% 0.49/0.40 (((member @ coinductive_llist @ a @ x @ (lList2236698231inlsts @ a @ top_top @ set @ a))) != $true) | (((member @ coinductive_llist @ a @ x @ (lList21612149805nflsts @ a @ top_top @ set @ a))) = $true)),
% 0.49/0.40 inference(cnf_transformation,[],[f1059])).
% 0.49/0.40 thf(f1438,plain,(
% 0.49/0.40 ( ! [X0 : $tType,X1 : coinductive_llist @ X0] : ((((member @ coinductive_llist @ X0 @ X1 @ (lList21612149805nflsts @ X0 @ top_top @ set @ X0))) = $true) | (((member @ coinductive_llist @ X0 @ X1 @ (lList2236698231inlsts @ X0 @ top_top @ set @ X0))) = $true)) )),
% 0.49/0.40 inference(cnf_transformation,[],[f1118])).
% 0.49/0.40 thf(f1633,definition,(
% 0.49/0.40 spl46_1 <=> (((member @ coinductive_llist @ a @ x @ (lList2236698231inlsts @ a @ top_top @ set @ a))) = $true)),
% 0.49/0.40 introduced(definition,[new_symbols(definition,[spl46_1])],[avatar_definition])).
% 0.49/0.40 thf(f1634,plain,(
% 0.49/0.40 (((member @ coinductive_llist @ a @ x @ (lList2236698231inlsts @ a @ top_top @ set @ a))) = $true) | ~spl46_1),
% 0.49/0.40 inference(avatar_component_clause,[],[f1633])).
% 0.49/0.40 thf(f1635,plain,(
% 0.49/0.40 (((member @ coinductive_llist @ a @ x @ (lList2236698231inlsts @ a @ top_top @ set @ a))) != $true) | spl46_1),
% 0.49/0.40 inference(avatar_component_clause,[],[f1633])).
% 0.49/0.40 thf(f1637,definition,(
% 0.49/0.40 spl46_2 <=> (((member @ coinductive_llist @ a @ x @ (lList21612149805nflsts @ a @ top_top @ set @ a))) = $true)),
% 0.49/0.40 introduced(definition,[new_symbols(definition,[spl46_2])],[avatar_definition])).
% 0.49/0.40 thf(f1638,plain,(
% 0.49/0.40 (((member @ coinductive_llist @ a @ x @ (lList21612149805nflsts @ a @ top_top @ set @ a))) != $true) | spl46_2),
% 0.49/0.40 inference(avatar_component_clause,[],[f1637])).
% 0.49/0.40 thf(f1639,plain,(
% 0.49/0.40 (((member @ coinductive_llist @ a @ x @ (lList21612149805nflsts @ a @ top_top @ set @ a))) = $true) | ~spl46_2),
% 0.49/0.40 inference(avatar_component_clause,[],[f1637])).
% 0.49/0.40 thf(f1640,plain,(
% 0.49/0.40 ~spl46_1 | spl46_2),
% 0.49/0.40 inference(avatar_split_clause,[],[f1321,f1637,f1633])).
% 0.49/0.40 thf(f1651,plain,(
% 0.49/0.40 ~spl46_2 | spl46_1),
% 0.49/0.40 inference(avatar_split_clause,[],[f1320,f1633,f1637])).
% 0.49/0.40 thf(f1789,plain,(
% 0.49/0.40 (((member @ coinductive_llist @ a @ x @ (lList2236698231inlsts @ a @ top_top @ set @ a))) = $true) | ($true != $true) | spl46_2),
% 0.49/0.40 inference(superposition,[],[f1638,f1438])).
% 0.49/0.40 thf(f1794,plain,(
% 0.49/0.40 (((member @ coinductive_llist @ a @ x @ (lList2236698231inlsts @ a @ top_top @ set @ a))) = $true) | spl46_2),
% 0.49/0.40 inference(trivial_inequality_removal,[],[f1789])).
% 0.49/0.40 thf(f1797,plain,(
% 0.49/0.40 $false | (spl46_1 | spl46_2)),
% 0.49/0.40 inference(forward_subsumption_resolution,[],[f1794,f1635])).
% 0.49/0.40 thf(f1798,plain,(
% 0.49/0.40 spl46_1 | spl46_2),
% 0.49/0.40 inference(avatar_contradiction_clause,[],[f1797])).
% 0.49/0.40 thf(f1799,plain,(
% 0.49/0.40 ( ! [X0 : set @ a] : (($true != $true) | (((member @ coinductive_llist @ a @ x @ (lList21612149805nflsts @ a @ X0))) != $true)) ) | ~spl46_1),
% 0.49/0.40 inference(superposition,[],[f1285,f1634])).
% 0.49/0.40 thf(f1800,plain,(
% 0.49/0.40 ( ! [X0 : set @ a] : ((((member @ coinductive_llist @ a @ x @ (lList21612149805nflsts @ a @ X0))) != $true)) ) | ~spl46_1),
% 0.49/0.40 inference(trivial_inequality_removal,[],[f1799])).
% 0.49/0.40 thf(f1857,plain,(
% 0.49/0.40 ($true != $true) | (~spl46_1 | ~spl46_2)),
% 0.49/0.40 inference(superposition,[],[f1800,f1639])).
% 0.49/0.40 thf(f1861,plain,(
% 0.49/0.40 $false | (~spl46_1 | ~spl46_2)),
% 0.49/0.40 inference(trivial_inequality_removal,[],[f1857])).
% 0.49/0.40 thf(f1862,plain,(
% 0.49/0.40 ~spl46_1 | ~spl46_2),
% 0.49/0.40 inference(avatar_contradiction_clause,[],[f1861])).
% 0.49/0.40 cnf(s1, plain, ~spl46_1 | spl46_2, inference(sat_conversion,[],[f1640])).
% 0.49/0.40 cnf(s4, plain, spl46_1 | ~spl46_2, inference(sat_conversion,[],[f1651])).
% 0.49/0.40 cnf(s19, plain, spl46_1 | spl46_2, inference(sat_conversion,[],[f1798])).
% 0.49/0.40 cnf(s20, plain, ~spl46_1 | ~spl46_2, inference(sat_conversion,[],[f1862])).
% 0.49/0.40 cnf(s21, plain, spl46_1, inference(rat,[],[s4,s19])).
% 0.49/0.40 cnf(s22, plain, ~spl46_2, inference(rat,[],[s20,s21])).
% 0.49/0.40 cnf(s23, plain, $false, inference(rat,[],[s1,s22,s21])).
% 0.49/0.40 thf(f1864,plain,(
% 0.49/0.40 $false),
% 0.49/0.40 inference(avatar_sat_refutation,[],[s23])).
% 0.49/0.40 % SZS output end Proof for theBenchmark
% 0.49/0.40 % (439623)------------------------------
% 0.49/0.40 % (439623)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.40 % (439623)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.40 % (439623)CaDiCaL version: 2.1.3
% 0.49/0.40 % (439623)Termination reason: Refutation
% 0.49/0.40 % (439623)Time elapsed: 0.067 s
% 0.49/0.40 % (439623)Peak memory usage: 14 MB
% 0.49/0.40 % (439623)Instructions burned: 130 (million)
% 0.49/0.40 % (439615)Success in time 0.122 s
% 0.49/0.40 % Vampire exiting
%------------------------------------------------------------------------------