%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV137^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 : n003.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:53 AM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : Refutation 0.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV137^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.07/0.16 % Computer : n003.cluster.edu
% 0.07/0.16 % Model : x86_64 x86_64
% 0.07/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.16 % Memory : 8046.5625MB
% 0.07/0.16 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 15:17:58 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.19 Running higher-order theorem proving
% 0.07/0.21 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.07/0.25 % (2628484)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.07/0.25 % (2628489)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=384105697:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.07/0.25 % (2628489) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2628484-2628489"...
% 0.07/0.25 % (2628489)...printing done.
% 0.07/0.25 % (2628489)Refutation found. Thanks to Tanya!
% 0.07/0.25 % SZS status Theorem for theBenchmark
% 0.07/0.25 % SZS output start Proof for theBenchmark
% 0.07/0.25 thf(type_def_5, type, a: $tType).
% 0.07/0.25 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.07/0.25 thf(func_def_3, type, sK0: a).
% 0.07/0.25 thf(func_def_4, type, sK1: a).
% 0.07/0.25 thf(func_def_5, type, sK2: a).
% 0.07/0.25 thf(func_def_6, type, sK3: (a > a > $o)).
% 0.07/0.25 thf(func_def_7, type, sK4: ((a > $o) > a)).
% 0.07/0.25 thf(func_def_8, type, sK5: ((a > $o) > a)).
% 0.07/0.25 thf(func_def_9, type, sK6: ((a > $o) > a)).
% 0.07/0.25 thf(func_def_10, type, sK7: ((a > $o) > a)).
% 0.07/0.25 thf(func_def_11, type, sK8: (a > $o)).
% 0.07/0.25 thf(func_def_12, type, vNOT: ($o > $o)).
% 0.07/0.25 thf(func_def_13, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.07/0.25 thf(func_def_14, type, db0: !>[X0: $tType]:(X0)).
% 0.07/0.25 thf(func_def_15, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.07/0.25 thf(f1,conjecture,(
% 0.07/0.25 ! [X0 : (a > a > $o),X1 : a,X2 : a,X3 : a] : ((! [X4 : (a > $o)] : (! [X6 : a,X5 : a] : (((X0 @ X5 @ X6) & (X4 @ X5)) => (X4 @ X6)) => ((X4 @ X2) => (X4 @ X3))) & ! [X4 : (a > $o)] : (! [X6 : a,X5 : a] : (((X0 @ X5 @ X6) & (X4 @ X5)) => (X4 @ X6)) => ((X4 @ X1) => (X4 @ X2)))) => ! [X4 : (a > $o)] : (! [X6 : a,X5 : a] : (((X0 @ X5 @ X6) & (X4 @ X5)) => (X4 @ X6)) => ((X4 @ X1) => (X4 @ X3))))),
% 0.07/0.25 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM204_pme)).
% 0.07/0.25 thf(f2,negated_conjecture,(
% 0.07/0.25 ~ ! [X0 : (a > a > $o),X1 : a,X2 : a,X3 : a] : ((! [X4 : (a > $o)] : (! [X6 : a,X5 : a] : (((X0 @ X5 @ X6) & (X4 @ X5)) => (X4 @ X6)) => ((X4 @ X2) => (X4 @ X3))) & ! [X4 : (a > $o)] : (! [X6 : a,X5 : a] : (((X0 @ X5 @ X6) & (X4 @ X5)) => (X4 @ X6)) => ((X4 @ X1) => (X4 @ X2)))) => ! [X4 : (a > $o)] : (! [X6 : a,X5 : a] : (((X0 @ X5 @ X6) & (X4 @ X5)) => (X4 @ X6)) => ((X4 @ X1) => (X4 @ X3))))),
% 0.07/0.25 inference(negated_conjecture,[status(cth)],[f1])).
% 0.07/0.25 thf(f3,plain,(
% 0.07/0.25 ~ ! [X0 : (a > a > $o),X1 : a,X2 : a,X3 : a] : ((! [X4 : (a > $o)] : (! [X5 : a,X6 : a] : (((X0 @ X6 @ X5) & (X4 @ X6)) => (X4 @ X5)) => ((X4 @ X2) => (X4 @ X3))) & ! [X7 : (a > $o)] : (! [X8 : a,X9 : a] : (((X0 @ X9 @ X8) & (X7 @ X9)) => (X7 @ X8)) => ((X7 @ X1) => (X7 @ X2)))) => ! [X10 : (a > $o)] : (! [X11 : a,X12 : a] : (((X0 @ X12 @ X11) & (X10 @ X12)) => (X10 @ X11)) => ((X10 @ X1) => (X10 @ X3))))),
% 0.07/0.25 inference(rectify,[],[f2])).
% 0.07/0.25 thf(f4,plain,(
% 0.07/0.25 ~ ! [X3 : a,X0 : (a > a > $o),X2 : a,X1 : a] : ((! [X7 : (a > $o)] : (! [X9 : a,X8 : a] : ((($true = ((X0 @ X9 @ X8))) & ($true = ((X7 @ X9)))) => ($true = ((X7 @ X8)))) => (($true = ((X7 @ X1))) => ($true = ((X7 @ X2))))) & ! [X4 : (a > $o)] : (! [X6 : a,X5 : a] : (((((X4 @ X6)) = $true) & ($true = ((X0 @ X6 @ X5)))) => (((X4 @ X5)) = $true)) => ((((X4 @ X2)) = $true) => (((X4 @ X3)) = $true)))) => ! [X10 : (a > $o)] : (! [X12 : a,X11 : a] : (((((X10 @ X12)) = $true) & (((X0 @ X12 @ X11)) = $true)) => ($true = ((X10 @ X11)))) => ((((X10 @ X1)) = $true) => ($true = ((X10 @ X3))))))),
% 0.07/0.25 inference(fool_elimination,[],[f3])).
% 0.07/0.25 thf(f5,plain,(
% 0.07/0.25 ? [X3 : a,X0 : (a > a > $o),X2 : a,X1 : a] : (? [X10 : (a > $o)] : ((($true != ((X10 @ X3))) & (((X10 @ X1)) = $true)) & ! [X12 : a,X11 : a] : (($true = ((X10 @ X11))) | ((((X10 @ X12)) != $true) | (((X0 @ X12 @ X11)) != $true)))) & (! [X7 : (a > $o)] : ((($true = ((X7 @ X2))) | ($true != ((X7 @ X1)))) | ? [X9 : a,X8 : a] : (($true != ((X7 @ X8))) & (($true = ((X0 @ X9 @ X8))) & ($true = ((X7 @ X9)))))) & ! [X4 : (a > $o)] : (((((X4 @ X3)) = $true) | (((X4 @ X2)) != $true)) | ? [X6 : a,X5 : a] : ((((X4 @ X5)) != $true) & ((((X4 @ X6)) = $true) & ($true = ((X0 @ X6 @ X5))))))))),
% 0.07/0.25 inference(ennf_transformation,[],[f4])).
% 0.07/0.25 thf(f6,plain,(
% 0.07/0.25 ? [X3 : a,X1 : a,X2 : a,X0 : (a > a > $o)] : (! [X4 : (a > $o)] : ((((X4 @ X2)) != $true) | ? [X5 : a,X6 : a] : ((((X4 @ X6)) = $true) & (((X4 @ X5)) != $true) & ($true = ((X0 @ X6 @ X5)))) | (((X4 @ X3)) = $true)) & ! [X7 : (a > $o)] : (($true = ((X7 @ X2))) | ($true != ((X7 @ X1))) | ? [X9 : a,X8 : a] : (($true = ((X0 @ X9 @ X8))) & ($true != ((X7 @ X8))) & ($true = ((X7 @ X9))))) & ? [X10 : (a > $o)] : ((((X10 @ X1)) = $true) & ! [X11 : a,X12 : a] : ((((X10 @ X12)) != $true) | ($true = ((X10 @ X11))) | (((X0 @ X12 @ X11)) != $true)) & ($true != ((X10 @ X3)))))),
% 0.07/0.26 inference(flattening,[],[f5])).
% 0.07/0.26 thf(f7,plain,(
% 0.07/0.26 ? [X0 : a,X1 : a,X2 : a,X3 : (a > a > $o)] : (! [X4 : (a > $o)] : ((((X4 @ X2)) != $true) | ? [X5 : a,X6 : a] : ((((X4 @ X6)) = $true) & (((X4 @ X5)) != $true) & ($true = ((X3 @ X6 @ X5)))) | ($true = ((X4 @ X0)))) & ! [X7 : (a > $o)] : (($true = ((X7 @ X2))) | ($true != ((X7 @ X1))) | ? [X8 : a,X9 : a] : (($true = ((X3 @ X8 @ X9))) & ($true != ((X7 @ X9))) & ($true = ((X7 @ X8))))) & ? [X10 : (a > $o)] : ((((X10 @ X1)) = $true) & ! [X11 : a,X12 : a] : ((((X10 @ X12)) != $true) | ($true = ((X10 @ X11))) | ($true != ((X3 @ X12 @ X11)))) & ($true != ((X10 @ X0)))))),
% 0.07/0.26 inference(rectify,[],[f6])).
% 0.07/0.26 thf(f8,plain,(
% 0.07/0.26 ! [X4 : (a > $o)] : (($true != ((X4 @ sK2))) | (($true = ((X4 @ (sK5 @ X4)))) & (((X4 @ (sK4 @ X4))) != $true) & (((sK3 @ (sK5 @ X4) @ (sK4 @ X4))) = $true)) | ($true = ((X4 @ sK0)))) & ! [X7 : (a > $o)] : (($true = ((X7 @ sK2))) | ($true != ((X7 @ sK1))) | (($true = ((sK3 @ (sK6 @ X7) @ (sK7 @ X7)))) & ($true != ((X7 @ (sK7 @ X7)))) & ($true = ((X7 @ (sK6 @ X7)))))) & (($true = ((sK8 @ sK1))) & ! [X11 : a,X12 : a] : (($true != ((sK8 @ X12))) | ($true = ((sK8 @ X11))) | ($true != ((sK3 @ X12 @ X11)))) & ($true != ((sK8 @ sK0))))),
% 0.07/0.26 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,vAPP,vAPP,vAPP,vAPP,sK8]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X9,sK7 @ X7),skolemize(X9,sK7 @ X7),skolemize(X9,sK7 @ X7),skolemize(X9,sK7 @ X7),skolemize(X10,sK8)],[f7])).
% 0.07/0.26 thf(f9,plain,(
% 0.07/0.26 ($true != ((sK8 @ sK0)))),
% 0.07/0.26 inference(cnf_transformation,[],[f8])).
% 0.07/0.26 thf(f10,plain,(
% 0.07/0.26 ( ! [X11 : a,X12 : a] : (($true != ((sK3 @ X12 @ X11))) | ($true = ((sK8 @ X11))) | ($true != ((sK8 @ X12)))) )),
% 0.07/0.26 inference(cnf_transformation,[],[f8])).
% 0.07/0.26 thf(f11,plain,(
% 0.07/0.26 ($true = ((sK8 @ sK1)))),
% 0.07/0.26 inference(cnf_transformation,[],[f8])).
% 0.07/0.26 thf(f12,plain,(
% 0.07/0.26 ( ! [X7 : (a > $o)] : (($true != ((X7 @ sK1))) | ($true = ((X7 @ (sK6 @ X7)))) | ($true = ((X7 @ sK2)))) )),
% 0.07/0.26 inference(cnf_transformation,[],[f8])).
% 0.07/0.26 thf(f13,plain,(
% 0.07/0.26 ( ! [X7 : (a > $o)] : (($true != ((X7 @ (sK7 @ X7)))) | ($true != ((X7 @ sK1))) | ($true = ((X7 @ sK2)))) )),
% 0.07/0.26 inference(cnf_transformation,[],[f8])).
% 0.07/0.26 thf(f14,plain,(
% 0.07/0.26 ( ! [X7 : (a > $o)] : (($true != ((X7 @ sK1))) | ($true = ((sK3 @ (sK6 @ X7) @ (sK7 @ X7)))) | ($true = ((X7 @ sK2)))) )),
% 0.07/0.26 inference(cnf_transformation,[],[f8])).
% 0.07/0.26 thf(f15,plain,(
% 0.07/0.26 ( ! [X4 : (a > $o)] : (($true != ((X4 @ sK2))) | (((sK3 @ (sK5 @ X4) @ (sK4 @ X4))) = $true) | ($true = ((X4 @ sK0)))) )),
% 0.07/0.26 inference(cnf_transformation,[],[f8])).
% 0.07/0.26 thf(f16,plain,(
% 0.07/0.26 ( ! [X4 : (a > $o)] : ((((X4 @ (sK4 @ X4))) != $true) | ($true = ((X4 @ sK0))) | ($true != ((X4 @ sK2)))) )),
% 0.07/0.26 inference(cnf_transformation,[],[f8])).
% 0.07/0.26 thf(f17,plain,(
% 0.07/0.26 ( ! [X4 : (a > $o)] : (($true != ((X4 @ sK2))) | ($true = ((X4 @ sK0))) | ($true = ((X4 @ (sK5 @ X4))))) )),
% 0.07/0.26 inference(cnf_transformation,[],[f8])).
% 0.07/0.26 thf(f25,plain,(
% 0.07/0.26 ($true = ((sK8 @ sK2))) | ($true = ((sK8 @ (sK6 @ sK8)))) | ($true != $true)),
% 0.07/0.26 inference(constrained_superposition,[],[f12,f11])).
% 0.07/0.26 thf(f27,plain,(
% 0.07/0.26 ($true = ((sK8 @ (sK6 @ sK8)))) | ($true = ((sK8 @ sK2)))),
% 0.07/0.26 inference(trivial_inequality_removal,[],[f25])).
% 0.07/0.26 thf(f48,definition,(
% 0.07/0.26 spl9_3 <=> ($true = ((sK8 @ sK2)))),
% 0.07/0.26 introduced(definition,[new_symbols(definition,[spl9_3])],[avatar_definition])).
% 0.07/0.26 thf(f49,plain,(
% 0.07/0.26 ($true != ((sK8 @ sK2))) | spl9_3),
% 0.07/0.26 inference(avatar_component_clause,[],[f48])).
% 0.07/0.26 thf(f50,plain,(
% 0.07/0.26 ($true = ((sK8 @ sK2))) | ~spl9_3),
% 0.07/0.26 inference(avatar_component_clause,[],[f48])).
% 0.07/0.26 thf(f52,definition,(
% 0.07/0.26 spl9_4 <=> ($true = ((sK8 @ (sK6 @ sK8))))),
% 0.07/0.26 introduced(definition,[new_symbols(definition,[spl9_4])],[avatar_definition])).
% 0.07/0.26 thf(f54,plain,(
% 0.07/0.26 ($true = ((sK8 @ (sK6 @ sK8)))) | ~spl9_4),
% 0.07/0.26 inference(avatar_component_clause,[],[f52])).
% 0.07/0.26 thf(f55,plain,(
% 0.07/0.26 spl9_3 | spl9_4),
% 0.07/0.26 inference(avatar_split_clause,[],[f27,f52,f48])).
% 0.07/0.26 thf(f113,plain,(
% 0.07/0.26 ($true != $true) | ($true = ((sK8 @ (sK5 @ sK8)))) | ($true = ((sK8 @ sK0))) | ~spl9_3),
% 0.07/0.26 inference(constrained_superposition,[],[f17,f50])).
% 0.07/0.26 thf(f128,plain,(
% 0.07/0.26 ($true = ((sK8 @ sK0))) | ($true = ((sK8 @ (sK5 @ sK8)))) | ~spl9_3),
% 0.07/0.26 inference(trivial_inequality_removal,[],[f113])).
% 0.07/0.26 thf(f131,plain,(
% 0.07/0.26 ($true = ((sK8 @ (sK5 @ sK8)))) | ~spl9_3),
% 0.07/0.26 inference(forward_subsumption_resolution,[],[f128,f9])).
% 0.07/0.26 thf(f140,plain,(
% 0.07/0.26 ($true != $true) | ($true = ((sK8 @ sK2))) | ($true = ((sK3 @ (sK6 @ sK8) @ (sK7 @ sK8))))),
% 0.07/0.26 inference(constrained_superposition,[],[f14,f11])).
% 0.07/0.26 thf(f143,plain,(
% 0.07/0.26 ($true = ((sK8 @ sK2))) | ($true = ((sK3 @ (sK6 @ sK8) @ (sK7 @ sK8))))),
% 0.07/0.26 inference(trivial_inequality_removal,[],[f140])).
% 0.07/0.26 thf(f155,plain,(
% 0.07/0.26 ($true = ((sK3 @ (sK5 @ sK8) @ (sK4 @ sK8)))) | ($true = ((sK8 @ sK0))) | ($true != $true) | ~spl9_3),
% 0.07/0.26 inference(constrained_superposition,[],[f15,f50])).
% 0.07/0.26 thf(f162,plain,(
% 0.07/0.26 ($true = ((sK3 @ (sK5 @ sK8) @ (sK4 @ sK8)))) | ($true = ((sK8 @ sK0))) | ~spl9_3),
% 0.07/0.26 inference(trivial_inequality_removal,[],[f155])).
% 0.07/0.26 thf(f165,plain,(
% 0.07/0.26 ($true = ((sK3 @ (sK5 @ sK8) @ (sK4 @ sK8)))) | ~spl9_3),
% 0.07/0.26 inference(forward_subsumption_resolution,[],[f162,f9])).
% 0.07/0.26 thf(f168,plain,(
% 0.07/0.26 ($true != $true) | ($true = ((sK8 @ (sK4 @ sK8)))) | ($true != ((sK8 @ (sK5 @ sK8)))) | ~spl9_3),
% 0.07/0.26 inference(constrained_superposition,[],[f10,f165])).
% 0.07/0.26 thf(f169,plain,(
% 0.07/0.26 ($true != ((sK8 @ (sK5 @ sK8)))) | ($true = ((sK8 @ (sK4 @ sK8)))) | ~spl9_3),
% 0.07/0.26 inference(trivial_inequality_removal,[],[f168])).
% 0.07/0.26 thf(f170,plain,(
% 0.07/0.26 ($true = ((sK8 @ (sK4 @ sK8)))) | ~spl9_3),
% 0.07/0.26 inference(forward_subsumption_resolution,[],[f169,f131])).
% 0.07/0.26 thf(f171,plain,(
% 0.07/0.26 ($true = ((sK8 @ sK0))) | ($true != $true) | ($true != ((sK8 @ sK2))) | ~spl9_3),
% 0.07/0.26 inference(constrained_superposition,[],[f16,f170])).
% 0.07/0.26 thf(f172,plain,(
% 0.07/0.26 ($true != ((sK8 @ sK2))) | ($true = ((sK8 @ sK0))) | ~spl9_3),
% 0.07/0.26 inference(trivial_inequality_removal,[],[f171])).
% 0.07/0.26 thf(f173,plain,(
% 0.07/0.26 ($true = ((sK8 @ sK0))) | ~spl9_3),
% 0.07/0.26 inference(forward_subsumption_resolution,[],[f172,f50])).
% 0.07/0.26 thf(f174,plain,(
% 0.07/0.26 $false | ~spl9_3),
% 0.07/0.26 inference(forward_subsumption_resolution,[],[f173,f9])).
% 0.07/0.26 thf(f175,plain,(
% 0.07/0.26 ~spl9_3),
% 0.07/0.26 inference(avatar_contradiction_clause,[],[f174])).
% 0.07/0.26 thf(f177,plain,(
% 0.07/0.26 ($true = ((sK3 @ (sK6 @ sK8) @ (sK7 @ sK8)))) | spl9_3),
% 0.07/0.26 inference(forward_subsumption_resolution,[],[f143,f49])).
% 0.07/0.26 thf(f195,plain,(
% 0.07/0.26 ($true != ((sK8 @ (sK6 @ sK8)))) | ($true != $true) | ($true = ((sK8 @ (sK7 @ sK8)))) | spl9_3),
% 0.07/0.26 inference(constrained_superposition,[],[f10,f177])).
% 0.07/0.26 thf(f196,plain,(
% 0.07/0.26 ($true != ((sK8 @ (sK6 @ sK8)))) | ($true = ((sK8 @ (sK7 @ sK8)))) | spl9_3),
% 0.07/0.26 inference(trivial_inequality_removal,[],[f195])).
% 0.07/0.26 thf(f197,plain,(
% 0.07/0.26 ($true = ((sK8 @ (sK7 @ sK8)))) | (spl9_3 | ~spl9_4)),
% 0.07/0.26 inference(forward_subsumption_resolution,[],[f196,f54])).
% 0.07/0.26 thf(f198,plain,(
% 0.07/0.26 ($true != ((sK8 @ sK1))) | ($true != $true) | ($true = ((sK8 @ sK2))) | (spl9_3 | ~spl9_4)),
% 0.07/0.26 inference(constrained_superposition,[],[f13,f197])).
% 0.07/0.26 thf(f199,plain,(
% 0.07/0.26 ($true = ((sK8 @ sK2))) | ($true != ((sK8 @ sK1))) | (spl9_3 | ~spl9_4)),
% 0.07/0.26 inference(trivial_inequality_removal,[],[f198])).
% 0.07/0.26 thf(f200,plain,(
% 0.07/0.26 ($true != ((sK8 @ sK1))) | (spl9_3 | ~spl9_4)),
% 0.07/0.26 inference(forward_subsumption_resolution,[],[f199,f49])).
% 0.07/0.26 thf(f201,plain,(
% 0.07/0.26 $false | (spl9_3 | ~spl9_4)),
% 0.07/0.26 inference(forward_subsumption_resolution,[],[f200,f11])).
% 0.07/0.26 thf(f202,plain,(
% 0.07/0.26 spl9_3 | ~spl9_4),
% 0.07/0.26 inference(avatar_contradiction_clause,[],[f201])).
% 0.07/0.26 cnf(s2, plain, spl9_3 | spl9_4, inference(sat_conversion,[],[f55])).
% 0.07/0.26 cnf(s5, plain, ~spl9_3, inference(sat_conversion,[],[f175])).
% 0.07/0.26 cnf(s10, plain, spl9_3 | ~spl9_4, inference(sat_conversion,[],[f202])).
% 0.07/0.26 cnf(s11, plain, ~spl9_4, inference(rat,[],[s10,s5])).
% 0.07/0.26 cnf(s16, plain, $false, inference(rat,[],[s2,s11,s5])).
% 0.07/0.26 thf(f203,plain,(
% 0.07/0.26 $false),
% 0.07/0.26 inference(avatar_sat_refutation,[],[s16])).
% 0.07/0.26 % SZS output end Proof for theBenchmark
% 0.07/0.26 % (2628489)------------------------------
% 0.07/0.26 % (2628489)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.26 % (2628489)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.26 % (2628489)CaDiCaL version: 2.1.3
% 0.07/0.26 % (2628489)Termination reason: Refutation
% 0.07/0.26 % (2628489)Time elapsed: 0.004 s
% 0.07/0.26 % (2628489)Peak memory usage: 13 MB
% 0.07/0.26 % (2628489)Instructions burned: 11 (million)
% 0.07/0.26 % (2628484)Success in time 0.039 s
% 0.07/0.26 % Vampire exiting
%------------------------------------------------------------------------------