%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV104^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:39 AM UTC 2026
% Result : Theorem 0.22s 0.27s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV104^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n011.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 15:10:47 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.24 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.27 % (201755)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.27 % (201765)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=555686337:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.27 % (201765) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-201755-201765"...
% 0.22/0.27 % (201765)...printing done.
% 0.22/0.27 % (201771)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.27 % (201771)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.22/0.27 % (201765)Refutation found. Thanks to Tanya!
% 0.22/0.27 % SZS status Theorem for theBenchmark
% 0.22/0.27 % SZS output start Proof for theBenchmark
% 0.22/0.27 thf(type_def_5, type, a: $tType).
% 0.22/0.27 thf(type_def_6, type, b: $tType).
% 0.22/0.27 thf(type_def_7, type, sTfun: ($tType * $tType) > $tType).
% 0.22/0.27 thf(func_def_0, type, cR: (a > a > $o)).
% 0.22/0.27 thf(func_def_1, type, z: a).
% 0.22/0.27 thf(func_def_2, type, f: (a > b > $o)).
% 0.22/0.27 thf(func_def_3, type, cS: (b > b > $o)).
% 0.22/0.27 thf(func_def_7, type, sK0: b).
% 0.22/0.27 thf(func_def_8, type, sK1: a).
% 0.22/0.27 thf(func_def_9, type, sK2: a).
% 0.22/0.27 thf(func_def_10, type, sK3: (a > b)).
% 0.22/0.27 thf(f1,conjecture,(
% 0.22/0.27 (! [X3 : a] : (cR @ X3 @ X3) & ! [X2 : a,X0 : a,X1 : a] : (((cR @ X2 @ X1) & (cR @ X0 @ X1)) => (cR @ X0 @ X2))) => ((! [X6 : b,X3 : a,X5 : b] : (((f @ X3 @ X5) & (f @ X3 @ X6)) => (cS @ X5 @ X6)) & ! [X3 : a] : ? [X4 : b] : (f @ X3 @ X4) & ! [X4 : b,X7 : a,X8 : a] : (((f @ X8 @ X4) & (f @ X7 @ X4)) => (cR @ X7 @ X8))) => ! [X8 : a,X4 : b,X7 : a] : ((! [X2 : a] : (((cR @ X8 @ z) & ~(f @ X2 @ X4)) | (f @ X8 @ X4)) & ! [X2 : a] : ((~(f @ X2 @ X4) & (cR @ X7 @ z)) | (f @ X7 @ X4))) => (cR @ X7 @ X8)))),
% 0.22/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM552D_pme)).
% 0.22/0.27 thf(f2,negated_conjecture,(
% 0.22/0.27 ~((! [X3 : a] : (cR @ X3 @ X3) & ! [X2 : a,X0 : a,X1 : a] : (((cR @ X2 @ X1) & (cR @ X0 @ X1)) => (cR @ X0 @ X2))) => ((! [X6 : b,X3 : a,X5 : b] : (((f @ X3 @ X5) & (f @ X3 @ X6)) => (cS @ X5 @ X6)) & ! [X3 : a] : ? [X4 : b] : (f @ X3 @ X4) & ! [X4 : b,X7 : a,X8 : a] : (((f @ X8 @ X4) & (f @ X7 @ X4)) => (cR @ X7 @ X8))) => ! [X8 : a,X4 : b,X7 : a] : ((! [X2 : a] : (((cR @ X8 @ z) & ~(f @ X2 @ X4)) | (f @ X8 @ X4)) & ! [X2 : a] : ((~(f @ X2 @ X4) & (cR @ X7 @ z)) | (f @ X7 @ X4))) => (cR @ X7 @ X8))))),
% 0.22/0.27 inference(negated_conjecture,[status(cth)],[f1])).
% 0.22/0.27 thf(f3,plain,(
% 0.22/0.27 ~((! [X0 : a] : (cR @ X0 @ X0) & ! [X1 : a,X2 : a,X3 : a] : (((cR @ X1 @ X3) & (cR @ X2 @ X3)) => (cR @ X2 @ X1))) => ((! [X4 : b,X5 : a,X6 : b] : (((f @ X5 @ X6) & (f @ X5 @ X4)) => (cS @ X6 @ X4)) & ! [X7 : a] : ? [X8 : b] : (f @ X7 @ X8) & ! [X9 : b,X10 : a,X11 : a] : (((f @ X11 @ X9) & (f @ X10 @ X9)) => (cR @ X10 @ X11))) => ! [X12 : a,X13 : b,X14 : a] : ((! [X15 : a] : (((cR @ X12 @ z) & ~(f @ X15 @ X13)) | (f @ X12 @ X13)) & ! [X16 : a] : ((~(f @ X16 @ X13) & (cR @ X14 @ z)) | (f @ X14 @ X13))) => (cR @ X14 @ X12))))),
% 0.22/0.27 inference(rectify,[],[f2])).
% 0.22/0.27 thf(f4,plain,(
% 0.22/0.27 ~((! [X0 : a] : ($true = ((cR @ X0 @ X0))) & ! [X3 : a,X2 : a,X1 : a] : ((($true = ((cR @ X2 @ X3))) & ($true = ((cR @ X1 @ X3)))) => (((cR @ X2 @ X1)) = $true))) => ((! [X4 : b,X6 : b,X5 : a] : ((($true = ((f @ X5 @ X6))) & (((f @ X5 @ X4)) = $true)) => ($true = ((cS @ X6 @ X4)))) & ! [X9 : b,X10 : a,X11 : a] : ((($true = ((f @ X10 @ X9))) & ($true = ((f @ X11 @ X9)))) => ($true = ((cR @ X10 @ X11)))) & ! [X7 : a] : ? [X8 : b] : ($true = ((f @ X7 @ X8)))) => ! [X12 : a,X13 : b,X14 : a] : ((! [X15 : a] : (((((cR @ X12 @ z)) = $true) & ~ ($true = ((f @ X15 @ X13)))) | ($true = ((f @ X12 @ X13)))) & ! [X16 : a] : ((~ ($true = ((f @ X16 @ X13))) & ($true = ((cR @ X14 @ z)))) | ($true = ((f @ X14 @ X13))))) => (((cR @ X14 @ X12)) = $true))))),
% 0.22/0.27 inference(fool_elimination,[],[f3])).
% 0.22/0.27 thf(f5,plain,(
% 0.22/0.27 ~((! [X0 : a] : ($true = ((cR @ X0 @ X0))) & ! [X3 : a,X2 : a,X1 : a] : ((($true = ((cR @ X2 @ X3))) & ($true = ((cR @ X1 @ X3)))) => (((cR @ X2 @ X1)) = $true))) => ((! [X4 : b,X6 : b,X5 : a] : ((($true = ((f @ X5 @ X6))) & (((f @ X5 @ X4)) = $true)) => ($true = ((cS @ X6 @ X4)))) & ! [X9 : b,X10 : a,X11 : a] : ((($true = ((f @ X10 @ X9))) & ($true = ((f @ X11 @ X9)))) => ($true = ((cR @ X10 @ X11)))) & ! [X7 : a] : ? [X8 : b] : ($true = ((f @ X7 @ X8)))) => ! [X14 : a,X13 : b,X12 : a] : ((! [X15 : a] : ((($true != ((f @ X15 @ X13))) & (((cR @ X12 @ z)) = $true)) | ($true = ((f @ X12 @ X13)))) & ! [X16 : a] : ((($true = ((cR @ X14 @ z))) & ($true != ((f @ X16 @ X13)))) | ($true = ((f @ X14 @ X13))))) => (((cR @ X14 @ X12)) = $true))))),
% 0.22/0.27 inference(flattening,[],[f4])).
% 0.22/0.27 thf(f6,plain,(
% 0.22/0.27 (? [X14 : a,X13 : b,X12 : a] : ((((cR @ X14 @ X12)) != $true) & (! [X15 : a] : ((($true != ((f @ X15 @ X13))) & (((cR @ X12 @ z)) = $true)) | ($true = ((f @ X12 @ X13)))) & ! [X16 : a] : ((($true = ((cR @ X14 @ z))) & ($true != ((f @ X16 @ X13)))) | ($true = ((f @ X14 @ X13)))))) & (! [X4 : b,X6 : b,X5 : a] : (($true = ((cS @ X6 @ X4))) | (($true != ((f @ X5 @ X6))) | (((f @ X5 @ X4)) != $true))) & ! [X9 : b,X10 : a,X11 : a] : (($true = ((cR @ X10 @ X11))) | (($true != ((f @ X10 @ X9))) | ($true != ((f @ X11 @ X9))))) & ! [X7 : a] : ? [X8 : b] : ($true = ((f @ X7 @ X8))))) & (! [X0 : a] : ($true = ((cR @ X0 @ X0))) & ! [X3 : a,X2 : a,X1 : a] : ((((cR @ X2 @ X1)) = $true) | (($true != ((cR @ X2 @ X3))) | ($true != ((cR @ X1 @ X3))))))),
% 0.22/0.27 inference(ennf_transformation,[],[f5])).
% 0.22/0.27 thf(f7,plain,(
% 0.22/0.27 ! [X6 : b,X5 : a,X4 : b] : ((((f @ X5 @ X4)) != $true) | ($true != ((f @ X5 @ X6))) | ($true = ((cS @ X6 @ X4)))) & ! [X10 : a,X11 : a,X9 : b] : (($true != ((f @ X11 @ X9))) | ($true = ((cR @ X10 @ X11))) | ($true != ((f @ X10 @ X9)))) & ! [X0 : a] : ($true = ((cR @ X0 @ X0))) & ? [X13 : b,X14 : a,X12 : a] : (! [X16 : a] : ((($true = ((cR @ X14 @ z))) & ($true != ((f @ X16 @ X13)))) | ($true = ((f @ X14 @ X13)))) & ! [X15 : a] : ((($true != ((f @ X15 @ X13))) & (((cR @ X12 @ z)) = $true)) | ($true = ((f @ X12 @ X13)))) & (((cR @ X14 @ X12)) != $true)) & ! [X1 : a,X2 : a,X3 : a] : (($true != ((cR @ X1 @ X3))) | (((cR @ X2 @ X1)) = $true) | ($true != ((cR @ X2 @ X3)))) & ! [X7 : a] : ? [X8 : b] : ($true = ((f @ X7 @ X8)))),
% 0.22/0.27 inference(flattening,[],[f6])).
% 0.22/0.27 thf(f8,plain,(
% 0.22/0.27 ! [X0 : b,X1 : a,X2 : b] : (($true != ((f @ X1 @ X2))) | ($true != ((f @ X1 @ X0))) | ($true = ((cS @ X0 @ X2)))) & ! [X3 : a,X4 : a,X5 : b] : ((((f @ X4 @ X5)) != $true) | ($true = ((cR @ X3 @ X4))) | (((f @ X3 @ X5)) != $true)) & ! [X6 : a] : ($true = ((cR @ X6 @ X6))) & ? [X7 : b,X8 : a,X9 : a] : (! [X10 : a] : (((((cR @ X8 @ z)) = $true) & ($true != ((f @ X10 @ X7)))) | ($true = ((f @ X8 @ X7)))) & ! [X11 : a] : ((($true != ((f @ X11 @ X7))) & ($true = ((cR @ X9 @ z)))) | ($true = ((f @ X9 @ X7)))) & ($true != ((cR @ X8 @ X9)))) & ! [X12 : a,X13 : a,X14 : a] : ((((cR @ X12 @ X14)) != $true) | ($true = ((cR @ X13 @ X12))) | ($true != ((cR @ X13 @ X14)))) & ! [X15 : a] : ? [X16 : b] : ($true = ((f @ X15 @ X16)))),
% 0.22/0.27 inference(rectify,[],[f7])).
% 0.22/0.27 thf(f9,plain,(
% 0.22/0.27 ! [X0 : b,X1 : a,X2 : b] : (($true != ((f @ X1 @ X2))) | ($true != ((f @ X1 @ X0))) | ($true = ((cS @ X0 @ X2)))) & ! [X3 : a,X4 : a,X5 : b] : ((((f @ X4 @ X5)) != $true) | ($true = ((cR @ X3 @ X4))) | (((f @ X3 @ X5)) != $true)) & ! [X6 : a] : ($true = ((cR @ X6 @ X6))) & (! [X10 : a] : ((($true = ((cR @ sK1 @ z))) & ($true != ((f @ X10 @ sK0)))) | ($true = ((f @ sK1 @ sK0)))) & ! [X11 : a] : ((($true != ((f @ X11 @ sK0))) & ($true = ((cR @ sK2 @ z)))) | ($true = ((f @ sK2 @ sK0)))) & ($true != ((cR @ sK1 @ sK2)))) & ! [X12 : a,X13 : a,X14 : a] : ((((cR @ X12 @ X14)) != $true) | ($true = ((cR @ X13 @ X12))) | ($true != ((cR @ X13 @ X14)))) & ! [X15 : a] : ($true = ((f @ X15 @ (sK3 @ X15))))),
% 0.22/0.27 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,vAPP]),skolemize(X7,sK0),skolemize(X8,sK1),skolemize(X9,sK2),skolemize(X16,sK3 @ X15)],[f8])).
% 0.22/0.27 thf(f11,plain,(
% 0.22/0.27 ( ! [X14 : a,X12 : a,X13 : a] : (($true != ((cR @ X13 @ X14))) | ($true = ((cR @ X13 @ X12))) | (((cR @ X12 @ X14)) != $true)) )),
% 0.22/0.27 inference(cnf_transformation,[],[f9])).
% 0.22/0.27 thf(f12,plain,(
% 0.22/0.27 ($true != ((cR @ sK1 @ sK2)))),
% 0.22/0.27 inference(cnf_transformation,[],[f9])).
% 0.22/0.27 thf(f13,plain,(
% 0.22/0.27 ($true = ((f @ sK2 @ sK0))) | ($true = ((cR @ sK2 @ z)))),
% 0.22/0.27 inference(cnf_transformation,[],[f9])).
% 0.22/0.27 thf(f14,plain,(
% 0.22/0.27 ( ! [X11 : a] : (($true != ((f @ X11 @ sK0))) | ($true = ((f @ sK2 @ sK0)))) )),
% 0.22/0.27 inference(cnf_transformation,[],[f9])).
% 0.22/0.27 thf(f15,plain,(
% 0.22/0.27 ( ! [X10 : a] : (($true = ((f @ sK1 @ sK0))) | ($true != ((f @ X10 @ sK0)))) )),
% 0.22/0.27 inference(cnf_transformation,[],[f9])).
% 0.22/0.27 thf(f16,plain,(
% 0.22/0.27 ($true = ((f @ sK1 @ sK0))) | ($true = ((cR @ sK1 @ z)))),
% 0.22/0.27 inference(cnf_transformation,[],[f9])).
% 0.22/0.27 thf(f17,plain,(
% 0.22/0.27 ( ! [X6 : a] : (($true = ((cR @ X6 @ X6)))) )),
% 0.22/0.27 inference(cnf_transformation,[],[f9])).
% 0.22/0.27 thf(f18,plain,(
% 0.22/0.27 ( ! [X3 : a,X4 : a,X5 : b] : ((((f @ X4 @ X5)) != $true) | ($true = ((cR @ X3 @ X4))) | (((f @ X3 @ X5)) != $true)) )),
% 0.22/0.27 inference(cnf_transformation,[],[f9])).
% 0.22/0.27 thf(f23,definition,(
% 0.22/0.27 spl4_1 <=> ($true = ((f @ sK1 @ sK0)))),
% 0.22/0.27 introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition])).
% 0.22/0.27 thf(f25,plain,(
% 0.22/0.27 ($true = ((f @ sK1 @ sK0))) | ~spl4_1),
% 0.22/0.27 inference(avatar_component_clause,[],[f23])).
% 0.22/0.27 thf(f27,definition,(
% 0.22/0.27 spl4_2 <=> ! [X10 : a] : ($true != ((f @ X10 @ sK0)))),
% 0.22/0.27 introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition])).
% 0.22/0.27 thf(f28,plain,(
% 0.22/0.27 ( ! [X10 : a] : (($true != ((f @ X10 @ sK0)))) ) | ~spl4_2),
% 0.22/0.27 inference(avatar_component_clause,[],[f27])).
% 0.22/0.27 thf(f29,plain,(
% 0.22/0.27 spl4_1 | spl4_2),
% 0.22/0.27 inference(avatar_split_clause,[],[f15,f27,f23])).
% 0.22/0.27 thf(f31,definition,(
% 0.22/0.27 spl4_3 <=> ($true = ((cR @ sK1 @ z)))),
% 0.22/0.27 introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition])).
% 0.22/0.27 thf(f33,plain,(
% 0.22/0.27 ($true = ((cR @ sK1 @ z))) | ~spl4_3),
% 0.22/0.27 inference(avatar_component_clause,[],[f31])).
% 0.22/0.27 thf(f34,plain,(
% 0.22/0.27 spl4_1 | spl4_3),
% 0.22/0.27 inference(avatar_split_clause,[],[f16,f31,f23])).
% 0.22/0.27 thf(f36,definition,(
% 0.22/0.27 spl4_4 <=> ($true = ((f @ sK2 @ sK0)))),
% 0.22/0.27 introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition])).
% 0.22/0.27 thf(f38,plain,(
% 0.22/0.27 ($true = ((f @ sK2 @ sK0))) | ~spl4_4),
% 0.22/0.27 inference(avatar_component_clause,[],[f36])).
% 0.22/0.27 thf(f39,plain,(
% 0.22/0.27 spl4_2 | spl4_4),
% 0.22/0.27 inference(avatar_split_clause,[],[f14,f36,f27])).
% 0.22/0.27 thf(f41,definition,(
% 0.22/0.27 spl4_5 <=> ($true = ((cR @ sK2 @ z)))),
% 0.22/0.27 introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition])).
% 0.22/0.27 thf(f43,plain,(
% 0.22/0.27 ($true = ((cR @ sK2 @ z))) | ~spl4_5),
% 0.22/0.27 inference(avatar_component_clause,[],[f41])).
% 0.22/0.27 thf(f44,plain,(
% 0.22/0.27 spl4_5 | spl4_4),
% 0.22/0.27 inference(avatar_split_clause,[],[f13,f36,f41])).
% 0.22/0.27 thf(f45,plain,(
% 0.22/0.27 ($true != $true) | (~spl4_2 | ~spl4_4)),
% 0.22/0.27 inference(constrained_superposition,[],[f28,f38])).
% 0.22/0.27 thf(f46,plain,(
% 0.22/0.27 $false | (~spl4_2 | ~spl4_4)),
% 0.22/0.27 inference(trivial_inequality_removal,[],[f45])).
% 0.22/0.27 thf(f47,plain,(
% 0.22/0.27 ~spl4_2 | ~spl4_4),
% 0.22/0.27 inference(avatar_contradiction_clause,[],[f46])).
% 0.22/0.27 thf(f48,plain,(
% 0.22/0.27 ( ! [X0 : a,X1 : a] : ((((cR @ X0 @ X1)) = $true) | ($true != $true) | ($true != ((cR @ X1 @ X0)))) )),
% 0.22/0.27 inference(constrained_superposition,[],[f11,f17])).
% 0.22/0.27 thf(f49,plain,(
% 0.22/0.27 ( ! [X0 : a] : (($true != ((cR @ X0 @ z))) | ($true != $true) | ($true = ((cR @ sK1 @ X0)))) ) | ~spl4_3),
% 0.22/0.27 inference(constrained_superposition,[],[f11,f33])).
% 0.22/0.27 thf(f50,plain,(
% 0.22/0.27 ( ! [X0 : a] : (($true != ((cR @ X0 @ z))) | ($true = ((cR @ sK1 @ X0)))) ) | ~spl4_3),
% 0.22/0.27 inference(trivial_inequality_removal,[],[f49])).
% 0.22/0.27 thf(f51,plain,(
% 0.22/0.27 ( ! [X0 : a,X1 : a] : (($true != ((cR @ X1 @ X0))) | (((cR @ X0 @ X1)) = $true)) )),
% 0.22/0.27 inference(trivial_inequality_removal,[],[f48])).
% 0.22/0.27 thf(f67,plain,(
% 0.22/0.27 ( ! [X0 : a] : (($true != $true) | ($true = ((cR @ X0 @ sK1))) | ($true != ((f @ X0 @ sK0)))) ) | ~spl4_1),
% 0.22/0.27 inference(constrained_superposition,[],[f18,f25])).
% 0.22/0.27 thf(f69,plain,(
% 0.22/0.27 ( ! [X0 : a] : (($true != ((f @ X0 @ sK0))) | ($true = ((cR @ X0 @ sK1)))) ) | ~spl4_1),
% 0.22/0.27 inference(trivial_inequality_removal,[],[f67])).
% 0.22/0.27 thf(f72,plain,(
% 0.22/0.27 ($true != $true) | ($true = ((cR @ sK2 @ sK1))) | (~spl4_1 | ~spl4_4)),
% 0.22/0.27 inference(constrained_superposition,[],[f69,f38])).
% 0.22/0.27 thf(f75,plain,(
% 0.22/0.27 ($true = ((cR @ sK2 @ sK1))) | (~spl4_1 | ~spl4_4)),
% 0.22/0.27 inference(trivial_inequality_removal,[],[f72])).
% 0.22/0.27 thf(f76,plain,(
% 0.22/0.27 ($true = ((cR @ sK1 @ sK2))) | ($true != $true) | (~spl4_1 | ~spl4_4)),
% 0.22/0.27 inference(constrained_superposition,[],[f51,f75])).
% 0.22/0.27 thf(f81,plain,(
% 0.22/0.27 ($true = ((cR @ sK1 @ sK2))) | (~spl4_1 | ~spl4_4)),
% 0.22/0.27 inference(trivial_inequality_removal,[],[f76])).
% 0.22/0.27 thf(f82,plain,(
% 0.22/0.27 $false | (~spl4_1 | ~spl4_4)),
% 0.22/0.27 inference(forward_subsumption_resolution,[],[f81,f12])).
% 0.22/0.27 thf(f83,plain,(
% 0.22/0.27 ~spl4_1 | ~spl4_4),
% 0.22/0.27 inference(avatar_contradiction_clause,[],[f82])).
% 0.22/0.27 thf(f86,plain,(
% 0.22/0.27 ($true = ((cR @ sK1 @ sK2))) | ($true != $true) | (~spl4_3 | ~spl4_5)),
% 0.22/0.27 inference(constrained_superposition,[],[f50,f43])).
% 0.22/0.27 thf(f89,plain,(
% 0.22/0.27 ($true = ((cR @ sK1 @ sK2))) | (~spl4_3 | ~spl4_5)),
% 0.22/0.27 inference(trivial_inequality_removal,[],[f86])).
% 0.22/0.27 thf(f90,plain,(
% 0.22/0.27 $false | (~spl4_3 | ~spl4_5)),
% 0.22/0.27 inference(forward_subsumption_resolution,[],[f89,f12])).
% 0.22/0.27 thf(f91,plain,(
% 0.22/0.27 ~spl4_3 | ~spl4_5),
% 0.22/0.27 inference(avatar_contradiction_clause,[],[f90])).
% 0.22/0.27 thf(f92,plain,(
% 0.22/0.27 $false | (~spl4_1 | ~spl4_2)),
% 0.22/0.27 inference(forward_subsumption_resolution,[],[f25,f28])).
% 0.22/0.27 thf(f93,plain,(
% 0.22/0.27 ~spl4_1 | ~spl4_2),
% 0.22/0.27 inference(avatar_contradiction_clause,[],[f92])).
% 0.22/0.27 cnf(s1, plain, spl4_1 | spl4_2, inference(sat_conversion,[],[f29])).
% 0.22/0.27 cnf(s2, plain, spl4_1 | spl4_3, inference(sat_conversion,[],[f34])).
% 0.22/0.27 cnf(s3, plain, spl4_2 | spl4_4, inference(sat_conversion,[],[f39])).
% 0.22/0.27 cnf(s4, plain, spl4_4 | spl4_5, inference(sat_conversion,[],[f44])).
% 0.22/0.27 cnf(s5, plain, ~spl4_2 | ~spl4_4, inference(sat_conversion,[],[f47])).
% 0.22/0.27 cnf(s6, plain, ~spl4_1 | ~spl4_4, inference(sat_conversion,[],[f83])).
% 0.22/0.27 cnf(s7, plain, ~spl4_3 | ~spl4_5, inference(sat_conversion,[],[f91])).
% 0.22/0.27 cnf(s8, plain, ~spl4_1 | ~spl4_2, inference(sat_conversion,[],[f93])).
% 0.22/0.27 cnf(s9, plain, spl4_1, inference(rat,[],[s4,s5,s7,s1,s2])).
% 0.22/0.27 cnf(s10, plain, ~spl4_2, inference(rat,[],[s8,s9])).
% 0.22/0.27 cnf(s11, plain, ~spl4_4, inference(rat,[],[s6,s9])).
% 0.22/0.27 cnf(s12, plain, $false, inference(rat,[],[s3,s11,s10])).
% 0.22/0.27 thf(f94,plain,(
% 0.22/0.27 $false),
% 0.22/0.27 inference(avatar_sat_refutation,[],[s12])).
% 0.22/0.27 % SZS output end Proof for theBenchmark
% 0.22/0.27 % (201765)------------------------------
% 0.22/0.27 % (201765)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.27 % (201765)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.27 % (201765)CaDiCaL version: 2.1.3
% 0.22/0.27 % (201765)Termination reason: Refutation
% 0.22/0.27 % (201765)Time elapsed: 0.003 s
% 0.22/0.27 % (201765)Peak memory usage: 13 MB
% 0.22/0.27 % (201765)Instructions burned: 8 (million)
% 0.22/0.27 % (201755)Success in time 0.02 s
% 0.22/0.27 % Vampire exiting
%------------------------------------------------------------------------------