%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV186^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:37:59 AM UTC 2026
% Result : Theorem 0.21s 0.30s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV186^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 % Computer : n007.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 15:17:27 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 Running higher-order theorem proving
% 0.10/0.24 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.21/0.30 % (3494045)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.30 % (3494055)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=493712157:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.30 % (3494056)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.30 % (3494056)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.21/0.30 % (3494051)lrs+10_16_si=on:nwc=1.5:random_seed=994106343:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.30 % (3494052)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1482499268:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.30 % (3494050)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2674074841:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.30 % (3494056)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=1167729745:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.30 % (3494054)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1766228258:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.30 % (3494053)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=3056275933: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.21/0.30 % (3494055) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3494045-3494055"...
% 0.21/0.30 % (3494052)Instruction limit reached!
% 0.21/0.30 % (3494052)------------------------------
% 0.21/0.30 % (3494052)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30 % (3494052)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30 % (3494052)CaDiCaL version: 2.1.3
% 0.21/0.30 % (3494052)Termination reason: Instruction limit
% 0.21/0.30 % (3494052)Termination phase: Saturation
% 0.21/0.30 % (3494052)Time elapsed: 0.003 s
% 0.21/0.30 % (3494052)Peak memory usage: 12 MB
% 0.21/0.30 % (3494052)Instructions burned: 4 (million)
% 0.21/0.30 % (3494050) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3494045-3494050"...
% 0.21/0.30 % (3494054) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3494045-3494054"...
% 0.21/0.30 % (3494055)...printing done.
% 0.21/0.30 % (3494055)Refutation found. Thanks to Tanya!
% 0.21/0.30 % SZS status Theorem for theBenchmark
% 0.21/0.30 % SZS output start Proof for theBenchmark
% 0.21/0.30 thf(type_def_5, type, b: $tType).
% 0.21/0.30 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.21/0.30 thf(func_def_3, type, sK0: ((b > $o) > $o)).
% 0.21/0.30 thf(func_def_4, type, sK1: ((b > $o) > (b > $o) > $o)).
% 0.21/0.30 thf(func_def_5, type, sK2: ((b > $o) > (b > $o) > b)).
% 0.21/0.30 thf(func_def_6, type, sK3: (b > $o)).
% 0.21/0.30 thf(func_def_7, type, sK4: (b > $o)).
% 0.21/0.30 thf(func_def_8, type, sK5: b).
% 0.21/0.30 thf(func_def_9, type, sK6: (b > $o)).
% 0.21/0.30 thf(func_def_10, type, vNOT: ($o > $o)).
% 0.21/0.30 thf(func_def_11, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.21/0.30 thf(func_def_12, type, db0: !>[X0: $tType]:(X0)).
% 0.21/0.30 thf(func_def_13, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.21/0.30 thf(func_def_14, type, db1: !>[X0: $tType]:(X0)).
% 0.21/0.30 thf(func_def_16, type, sK8: b).
% 0.21/0.30 thf(func_def_17, type, sK9: ((b > $o) > (b > b > b) > b)).
% 0.21/0.30 thf(func_def_18, type, sK10: ((b > b > b) > (b > b > $o) > (b > $o) > b)).
% 0.21/0.30 thf(func_def_19, type, sK11: b).
% 0.21/0.30 thf(func_def_20, type, sK12: (b > b)).
% 0.21/0.30 thf(func_def_21, type, sK13: ((b > $o) > b)).
% 0.21/0.30 thf(func_def_22, type, sK14: (b > b)).
% 0.21/0.30 thf(func_def_23, type, sK15: b).
% 0.21/0.30 thf(func_def_24, type, sK16: ((b > b > $o) > (b > $o) > (b > b > $o) > b)).
% 0.21/0.30 thf(f1,conjecture,(
% 0.21/0.30 ! [X0 : ((b > $o) > (b > $o) > $o),X1 : ((b > $o) > $o)] : (! [X2 : (b > $o)] : ((X1 @ X2) => ! [X3 : (b > $o),X4 : (b > $o)] : ((! [X5 : b] : ((X3 @ X5) => (X2 @ X5)) & (X0 @ X3 @ X4)) => ! [X5 : b] : ((X4 @ X5) => (X2 @ X5)))) => ! [X4 : (b > $o),X3 : (b > $o)] : (((X0 @ X3 @ X4) & ! [X2 : b] : ((X3 @ X2) => ! [X6 : (b > $o)] : ((X1 @ X6) => (X6 @ X2)))) => ! [X2 : b] : ((X4 @ X2) => ! [X6 : (b > $o)] : ((X1 @ X6) => (X6 @ X2)))))),
% 0.21/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM565_pme)).
% 0.21/0.30 thf(f2,negated_conjecture,(
% 0.21/0.30 ~ ! [X0 : ((b > $o) > (b > $o) > $o),X1 : ((b > $o) > $o)] : (! [X2 : (b > $o)] : ((X1 @ X2) => ! [X3 : (b > $o),X4 : (b > $o)] : ((! [X5 : b] : ((X3 @ X5) => (X2 @ X5)) & (X0 @ X3 @ X4)) => ! [X5 : b] : ((X4 @ X5) => (X2 @ X5)))) => ! [X4 : (b > $o),X3 : (b > $o)] : (((X0 @ X3 @ X4) & ! [X2 : b] : ((X3 @ X2) => ! [X6 : (b > $o)] : ((X1 @ X6) => (X6 @ X2)))) => ! [X2 : b] : ((X4 @ X2) => ! [X6 : (b > $o)] : ((X1 @ X6) => (X6 @ X2)))))),
% 0.21/0.30 inference(negated_conjecture,[status(cth)],[f1])).
% 0.21/0.30 thf(f3,plain,(
% 0.21/0.30 ~ ! [X0 : ((b > $o) > (b > $o) > $o),X1 : ((b > $o) > $o)] : (! [X2 : (b > $o)] : ((X1 @ X2) => ! [X3 : (b > $o),X4 : (b > $o)] : ((! [X5 : b] : ((X3 @ X5) => (X2 @ X5)) & (X0 @ X3 @ X4)) => ! [X6 : b] : ((X4 @ X6) => (X2 @ X6)))) => ! [X7 : (b > $o),X8 : (b > $o)] : (((X0 @ X8 @ X7) & ! [X9 : b] : ((X8 @ X9) => ! [X10 : (b > $o)] : ((X1 @ X10) => (X10 @ X9)))) => ! [X11 : b] : ((X7 @ X11) => ! [X12 : (b > $o)] : ((X1 @ X12) => (X12 @ X11)))))),
% 0.21/0.30 inference(rectify,[],[f2])).
% 0.21/0.30 thf(f4,plain,(
% 0.21/0.30 ~ ! [X0 : ((b > $o) > (b > $o) > $o),X1 : ((b > $o) > $o)] : (! [X2 : (b > $o)] : ((((X1 @ X2)) = $true) => ! [X3 : (b > $o),X4 : (b > $o)] : (((((X0 @ X3 @ X4)) = $true) & ! [X5 : b] : ((((X3 @ X5)) = $true) => (((X2 @ X5)) = $true))) => ! [X6 : b] : (($true = ((X4 @ X6))) => ($true = ((X2 @ X6)))))) => ! [X8 : (b > $o),X7 : (b > $o)] : ((! [X9 : b] : (($true = ((X8 @ X9))) => ! [X10 : (b > $o)] : (($true = ((X1 @ X10))) => ($true = ((X10 @ X9))))) & ($true = ((X0 @ X8 @ X7)))) => ! [X11 : b] : (($true = ((X7 @ X11))) => ! [X12 : (b > $o)] : (($true = ((X1 @ X12))) => ($true = ((X12 @ X11)))))))),
% 0.21/0.30 inference(fool_elimination,[],[f3])).
% 0.21/0.30 thf(f5,plain,(
% 0.21/0.30 ? [X0 : ((b > $o) > (b > $o) > $o),X1 : ((b > $o) > $o)] : (? [X8 : (b > $o),X7 : (b > $o)] : (? [X11 : b] : (? [X12 : (b > $o)] : (($true != ((X12 @ X11))) & ($true = ((X1 @ X12)))) & ($true = ((X7 @ X11)))) & (! [X9 : b] : (! [X10 : (b > $o)] : (($true = ((X10 @ X9))) | ($true != ((X1 @ X10)))) | ($true != ((X8 @ X9)))) & ($true = ((X0 @ X8 @ X7))))) & ! [X2 : (b > $o)] : (! [X3 : (b > $o),X4 : (b > $o)] : (! [X6 : b] : (($true != ((X4 @ X6))) | ($true = ((X2 @ X6)))) | ((((X0 @ X3 @ X4)) != $true) | ? [X5 : b] : ((((X2 @ X5)) != $true) & (((X3 @ X5)) = $true)))) | (((X1 @ X2)) != $true)))),
% 0.21/0.30 inference(ennf_transformation,[],[f4])).
% 0.21/0.30 thf(f6,plain,(
% 0.21/0.30 ? [X1 : ((b > $o) > $o),X0 : ((b > $o) > (b > $o) > $o)] : (! [X2 : (b > $o)] : (! [X3 : (b > $o),X4 : (b > $o)] : ((((X0 @ X3 @ X4)) != $true) | ? [X5 : b] : ((((X2 @ X5)) != $true) & (((X3 @ X5)) = $true)) | ! [X6 : b] : (($true != ((X4 @ X6))) | ($true = ((X2 @ X6))))) | (((X1 @ X2)) != $true)) & ? [X8 : (b > $o),X7 : (b > $o)] : (? [X11 : b] : (? [X12 : (b > $o)] : (($true != ((X12 @ X11))) & ($true = ((X1 @ X12)))) & ($true = ((X7 @ X11)))) & ($true = ((X0 @ X8 @ X7))) & ! [X9 : b] : (! [X10 : (b > $o)] : (($true = ((X10 @ X9))) | ($true != ((X1 @ X10)))) | ($true != ((X8 @ X9))))))),
% 0.21/0.30 inference(flattening,[],[f5])).
% 0.21/0.30 thf(f7,plain,(
% 0.21/0.30 ? [X0 : ((b > $o) > $o),X1 : ((b > $o) > (b > $o) > $o)] : (! [X2 : (b > $o)] : (! [X3 : (b > $o),X4 : (b > $o)] : (($true != ((X1 @ X3 @ X4))) | ? [X5 : b] : ((((X2 @ X5)) != $true) & (((X3 @ X5)) = $true)) | ! [X6 : b] : (($true != ((X4 @ X6))) | ($true = ((X2 @ X6))))) | ($true != ((X0 @ X2)))) & ? [X7 : (b > $o),X8 : (b > $o)] : (? [X9 : b] : (? [X10 : (b > $o)] : (($true != ((X10 @ X9))) & ($true = ((X0 @ X10)))) & ($true = ((X8 @ X9)))) & (((X1 @ X7 @ X8)) = $true) & ! [X11 : b] : (! [X12 : (b > $o)] : (($true = ((X12 @ X11))) | ($true != ((X0 @ X12)))) | ($true != ((X7 @ X11))))))),
% 0.21/0.30 inference(rectify,[],[f6])).
% 0.21/0.30 thf(f8,plain,(
% 0.21/0.30 ! [X2 : (b > $o)] : (! [X3 : (b > $o),X4 : (b > $o)] : (($true != ((sK1 @ X3 @ X4))) | (($true != ((X2 @ (sK2 @ X3 @ X2)))) & ($true = ((X3 @ (sK2 @ X3 @ X2))))) | ! [X6 : b] : (($true != ((X4 @ X6))) | ($true = ((X2 @ X6))))) | ($true != ((sK0 @ X2)))) & (((($true != ((sK6 @ sK5))) & ($true = ((sK0 @ sK6)))) & ($true = ((sK4 @ sK5)))) & ($true = ((sK1 @ sK3 @ sK4))) & ! [X11 : b] : (! [X12 : (b > $o)] : (($true = ((X12 @ X11))) | ($true != ((sK0 @ X12)))) | ($true != ((sK3 @ X11)))))),
% 0.21/0.31 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,vAPP,sK3,sK4,sK5,sK6]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X5,sK2 @ X3 @ X2),skolemize(X7,sK3),skolemize(X8,sK4),skolemize(X9,sK5),skolemize(X10,sK6)],[f7])).
% 0.21/0.31 thf(f9,plain,(
% 0.21/0.31 ( ! [X11 : b,X12 : (b > $o)] : (($true != ((sK0 @ X12))) | ($true != ((sK3 @ X11))) | ($true = ((X12 @ X11)))) )),
% 0.21/0.31 inference(cnf_transformation,[],[f8])).
% 0.21/0.31 thf(f10,plain,(
% 0.21/0.31 ($true = ((sK1 @ sK3 @ sK4)))),
% 0.21/0.31 inference(cnf_transformation,[],[f8])).
% 0.21/0.31 thf(f11,plain,(
% 0.21/0.31 ($true = ((sK4 @ sK5)))),
% 0.21/0.31 inference(cnf_transformation,[],[f8])).
% 0.21/0.31 thf(f12,plain,(
% 0.21/0.31 ($true = ((sK0 @ sK6)))),
% 0.21/0.31 inference(cnf_transformation,[],[f8])).
% 0.21/0.31 thf(f13,plain,(
% 0.21/0.31 ($true != ((sK6 @ sK5)))),
% 0.21/0.31 inference(cnf_transformation,[],[f8])).
% 0.21/0.31 thf(f14,plain,(
% 0.21/0.31 ( ! [X2 : (b > $o),X3 : (b > $o),X6 : b,X4 : (b > $o)] : (($true != ((sK1 @ X3 @ X4))) | ($true = ((X2 @ X6))) | ($true = ((X3 @ (sK2 @ X3 @ X2)))) | ($true != ((sK0 @ X2))) | ($true != ((X4 @ X6)))) )),
% 0.21/0.31 inference(cnf_transformation,[],[f8])).
% 0.21/0.31 thf(f15,plain,(
% 0.21/0.31 ( ! [X2 : (b > $o),X3 : (b > $o),X6 : b,X4 : (b > $o)] : (($true != ((X2 @ (sK2 @ X3 @ X2)))) | ($true = ((X2 @ X6))) | ($true != ((X4 @ X6))) | ($true != ((sK1 @ X3 @ X4))) | ($true != ((sK0 @ X2)))) )),
% 0.21/0.31 inference(cnf_transformation,[],[f8])).
% 0.21/0.31 thf(f18,plain,(
% 0.21/0.31 ( ! [X0 : b] : (($true = ((sK6 @ X0))) | ($true != ((sK3 @ X0))) | ($true != $true)) )),
% 0.21/0.31 inference(constrained_superposition,[],[f9,f12])).
% 0.21/0.31 thf(f19,plain,(
% 0.21/0.31 ( ! [X0 : b] : (($true != ((sK3 @ X0))) | ($true = ((sK6 @ X0)))) )),
% 0.21/0.31 inference(trivial_inequality_removal,[],[f18])).
% 0.21/0.31 thf(f20,plain,(
% 0.21/0.31 ( ! [X0 : (b > $o),X1 : b] : (($true != ((sK4 @ X1))) | ($true != $true) | ($true = ((sK3 @ (sK2 @ sK3 @ X0)))) | ($true != ((sK0 @ X0))) | ($true = ((X0 @ X1)))) )),
% 0.21/0.31 inference(constrained_superposition,[],[f14,f10])).
% 0.21/0.31 thf(f21,plain,(
% 0.21/0.31 ( ! [X0 : (b > $o),X1 : b] : (($true != ((sK0 @ X0))) | ($true = ((X0 @ X1))) | ($true != ((sK4 @ X1))) | ($true = ((sK3 @ (sK2 @ sK3 @ X0))))) )),
% 0.21/0.31 inference(trivial_inequality_removal,[],[f20])).
% 0.21/0.31 thf(f42,plain,(
% 0.21/0.31 ( ! [X0 : b] : (($true != $true) | ($true != ((sK4 @ X0))) | ($true = ((sK3 @ (sK2 @ sK3 @ sK6)))) | ($true = ((sK6 @ X0)))) )),
% 0.21/0.31 inference(constrained_superposition,[],[f21,f12])).
% 0.21/0.31 thf(f43,plain,(
% 0.21/0.31 ( ! [X0 : b] : (($true = ((sK6 @ X0))) | ($true = ((sK3 @ (sK2 @ sK3 @ sK6)))) | ($true != ((sK4 @ X0)))) )),
% 0.21/0.31 inference(trivial_inequality_removal,[],[f42])).
% 0.21/0.31 thf(f45,definition,(
% 0.21/0.31 spl7_1 <=> ($true = ((sK3 @ (sK2 @ sK3 @ sK6))))),
% 0.21/0.31 introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition])).
% 0.21/0.31 thf(f46,plain,(
% 0.21/0.31 ($true = ((sK3 @ (sK2 @ sK3 @ sK6)))) | ~spl7_1),
% 0.21/0.31 inference(avatar_component_clause,[],[f45])).
% 0.21/0.31 thf(f48,definition,(
% 0.21/0.31 spl7_2 <=> ! [X0 : b] : (($true = ((sK6 @ X0))) | ($true != ((sK4 @ X0))))),
% 0.21/0.31 introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition])).
% 0.21/0.31 thf(f49,plain,(
% 0.21/0.31 ( ! [X0 : b] : (($true != ((sK4 @ X0))) | ($true = ((sK6 @ X0)))) ) | ~spl7_2),
% 0.21/0.31 inference(avatar_component_clause,[],[f48])).
% 0.21/0.31 thf(f50,plain,(
% 0.21/0.31 spl7_1 | spl7_2),
% 0.21/0.31 inference(avatar_split_clause,[],[f43,f48,f45])).
% 0.21/0.31 thf(f51,plain,(
% 0.21/0.31 ($true != $true) | ($true = ((sK6 @ sK5))) | ~spl7_2),
% 0.21/0.31 inference(constrained_superposition,[],[f49,f11])).
% 0.21/0.31 thf(f52,plain,(
% 0.21/0.31 ($true = ((sK6 @ sK5))) | ~spl7_2),
% 0.21/0.31 inference(trivial_inequality_removal,[],[f51])).
% 0.21/0.31 thf(f53,plain,(
% 0.21/0.31 $false | ~spl7_2),
% 0.21/0.31 inference(forward_subsumption_resolution,[],[f52,f13])).
% 0.21/0.31 thf(f54,plain,(
% 0.21/0.31 ~spl7_2),
% 0.21/0.31 inference(avatar_contradiction_clause,[],[f53])).
% 0.21/0.31 thf(f58,plain,(
% 0.21/0.31 ($true = ((sK6 @ (sK2 @ sK3 @ sK6)))) | ($true != $true) | ~spl7_1),
% 0.21/0.31 inference(constrained_superposition,[],[f19,f46])).
% 0.21/0.31 thf(f63,plain,(
% 0.21/0.31 ($true = ((sK6 @ (sK2 @ sK3 @ sK6)))) | ~spl7_1),
% 0.21/0.31 inference(trivial_inequality_removal,[],[f58])).
% 0.21/0.31 thf(f128,plain,(
% 0.21/0.31 ( ! [X2 : (b > $o),X0 : (b > $o),X1 : b] : (($true != ((X2 @ X1))) | (((sK1 @ X0 @ X2)) != $true) | ($true != $true) | ($true != ((sK0 @ (^[Y0 : b]: (sK6 @ ((^[Y1 : b]: (Y1)) @ Y0)))))) | ($true = (((^[Y0 : b]: (sK6 @ ((^[Y1 : b]: (Y1)) @ Y0))) @ X1))) | (sK3 != X0)) ) | ~spl7_1),
% 0.21/0.31 inference(constrained_superposition,[],[f15,f63])).
% 0.21/0.31 thf(f130,plain,(
% 0.21/0.31 ( ! [X2 : (b > $o),X0 : (b > $o),X1 : b] : ((sK3 != X0) | (((sK1 @ X0 @ X2)) != $true) | ($true != ((X2 @ X1))) | ($true != ((sK0 @ (^[Y0 : b]: (sK6 @ ((^[Y1 : b]: (Y1)) @ Y0)))))) | ($true = (((^[Y0 : b]: (sK6 @ ((^[Y1 : b]: (Y1)) @ Y0))) @ X1)))) ) | ~spl7_1),
% 0.21/0.31 inference(trivial_inequality_removal,[],[f128])).
% 0.21/0.31 thf(f131,plain,(
% 0.21/0.31 ( ! [X2 : (b > $o),X0 : (b > $o),X1 : b] : ((((sK1 @ X0 @ X2)) != $true) | ($true != ((sK0 @ sK6))) | (sK3 != X0) | ($true = ((sK6 @ X1))) | ($true != ((X2 @ X1)))) ) | ~spl7_1),
% 0.21/0.31 inference(beta-eta_normalization,[],[f130])).
% 0.21/0.31 thf(f134,plain,(
% 0.21/0.31 ( ! [X2 : (b > $o),X0 : (b > $o),X1 : b] : ((((sK1 @ X0 @ X2)) != $true) | ($true = ((sK6 @ X1))) | (sK3 != X0) | ($true != ((X2 @ X1)))) ) | ~spl7_1),
% 0.21/0.31 inference(forward_subsumption_resolution,[],[f131,f12])).
% 0.21/0.31 thf(f192,plain,(
% 0.21/0.31 ( ! [X0 : b] : (($true != ((sK4 @ X0))) | ($true = ((sK6 @ X0))) | ($true != $true) | (sK3 != sK3)) ) | ~spl7_1),
% 0.21/0.31 inference(constrained_superposition,[],[f134,f10])).
% 0.21/0.31 thf(f193,plain,(
% 0.21/0.31 ( ! [X0 : b] : (($true = ((sK6 @ X0))) | ($true != ((sK4 @ X0)))) ) | ~spl7_1),
% 0.21/0.31 inference(trivial_inequality_removal,[],[f192])).
% 0.21/0.31 thf(f194,plain,(
% 0.21/0.31 spl7_2 | ~spl7_1),
% 0.21/0.31 inference(avatar_split_clause,[],[f193,f45,f48])).
% 0.21/0.31 cnf(s1, plain, spl7_1 | spl7_2, inference(sat_conversion,[],[f50])).
% 0.21/0.31 cnf(s2, plain, ~spl7_2, inference(sat_conversion,[],[f54])).
% 0.21/0.31 cnf(s9, plain, ~spl7_1 | spl7_2, inference(sat_conversion,[],[f194])).
% 0.21/0.31 cnf(s11, plain, ~spl7_1, inference(rat,[],[s9,s2])).
% 0.21/0.31 cnf(s12, plain, $false, inference(rat,[],[s1,s2,s11])).
% 0.21/0.31 thf(f195,plain,(
% 0.21/0.31 $false),
% 0.21/0.31 inference(avatar_sat_refutation,[],[s12])).
% 0.21/0.31 % SZS output end Proof for theBenchmark
% 0.21/0.31 % (3494055)------------------------------
% 0.21/0.31 % (3494055)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.31 % (3494055)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.31 % (3494055)CaDiCaL version: 2.1.3
% 0.21/0.31 % (3494055)Termination reason: Refutation
% 0.21/0.31 % (3494055)Time elapsed: 0.010 s
% 0.21/0.31 % (3494055)Peak memory usage: 13 MB
% 0.21/0.31 % (3494055)Instructions burned: 26 (million)
% 0.21/0.31 % (3494045)Success in time 0.052 s
% 0.21/0.31 % Vampire exiting
%------------------------------------------------------------------------------