%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV126^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:39:02 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV126^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n007.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 15:10:41 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.28 % (3484034)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (3484039)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1596735688_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.28 % Exception at run slice level
% 0.20/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.28 % (3484040)% WARNING: option uhcvi not known.
% 0.20/0.28 % (3484043)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3093774359:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28 % (3484040)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1299827884:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28 % (3484041)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3185295665:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28 % (3484042)dis+10_1_sil=32000:sp=arity:random_seed=3768839545:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28 % (3484043)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.28 % (3484040)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.28 % (3484040)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.28 % (3484044)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4026740962:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.28 % (3484045)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1828433965:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.28 % (3484044) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3484034-3484044"...
% 0.20/0.28 % (3484044)...printing done.
% 0.20/0.28 % (3484047)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2353190628:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.28 % (3484044)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% 0.20/0.28 thf(type_def_5, type, a: $tType).
% 0.20/0.28 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.28 thf(func_def_3, type, sK0: ((a > a > $o) > $o)).
% 0.20/0.28 thf(func_def_4, type, sK1: (a > a > $o)).
% 0.20/0.28 thf(func_def_5, type, sK2: (a > a > $o)).
% 0.20/0.28 thf(func_def_6, type, sK3: a).
% 0.20/0.28 thf(func_def_7, type, sK4: a).
% 0.20/0.28 thf(func_def_8, type, sK5: (a > a > $o)).
% 0.20/0.28 thf(func_def_9, type, sK6: (a > a > a > a > $o)).
% 0.20/0.28 thf(func_def_10, type, sK7: (a > a > a > a > $o)).
% 0.20/0.28 thf(func_def_11, type, sK8: ((a > a > $o) > a)).
% 0.20/0.28 thf(func_def_12, type, sK9: ((a > a > $o) > a)).
% 0.20/0.28 thf(func_def_13, type, vNOT: ($o > $o)).
% 0.20/0.28 thf(func_def_14, type, db0: !>[X0: $tType]:(X0)).
% 0.20/0.28 thf(func_def_15, type, db1: !>[X0: $tType]:(X0)).
% 0.20/0.28 thf(func_def_16, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.20/0.28 thf(func_def_17, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.20/0.28 thf(func_def_18, type, db2: !>[X0: $tType]:(X0)).
% 0.20/0.28 thf(func_def_19, type, db3: !>[X0: $tType]:(X0)).
% 0.20/0.28 thf(func_def_20, type, db4: !>[X0: $tType]:(X0)).
% 0.20/0.28 thf(func_def_22, type, sK11: ((a > a > a > a > a) > (a > a > a > a > a) > a)).
% 0.20/0.28 thf(f1,conjecture,(
% 0.20/0.28 ! [X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o),X3 : a,X4 : a] : (! [X5 : (a > a > $o)] : (((X0 @ X5) & ! [X6 : a,X7 : a] : (((X2 @ X6 @ X7) | (X1 @ X6 @ X7)) => (X5 @ X6 @ X7))) => (X5 @ X3 @ X4)) => ! [X5 : (a > a > $o)] : (((X0 @ X5) & ! [X6 : a,X7 : a] : ((! [X8 : (a > a > $o)] : (((X0 @ X8) & ! [X9 : a,X10 : a] : ((X2 @ X9 @ X10) => (X8 @ X9 @ X10))) => (X8 @ X6 @ X7)) | ! [X8 : (a > a > $o)] : (((X0 @ X8) & ! [X9 : a,X10 : a] : ((X1 @ X9 @ X10) => (X8 @ X9 @ X10))) => (X8 @ X6 @ X7))) => (X5 @ X6 @ X7))) => (X5 @ X3 @ X4)))),
% 0.20/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM252B_pme)).
% 0.20/0.28 thf(f2,negated_conjecture,(
% 0.20/0.28 ~ ! [X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o),X3 : a,X4 : a] : (! [X5 : (a > a > $o)] : (((X0 @ X5) & ! [X6 : a,X7 : a] : (((X2 @ X6 @ X7) | (X1 @ X6 @ X7)) => (X5 @ X6 @ X7))) => (X5 @ X3 @ X4)) => ! [X5 : (a > a > $o)] : (((X0 @ X5) & ! [X6 : a,X7 : a] : ((! [X8 : (a > a > $o)] : (((X0 @ X8) & ! [X9 : a,X10 : a] : ((X2 @ X9 @ X10) => (X8 @ X9 @ X10))) => (X8 @ X6 @ X7)) | ! [X8 : (a > a > $o)] : (((X0 @ X8) & ! [X9 : a,X10 : a] : ((X1 @ X9 @ X10) => (X8 @ X9 @ X10))) => (X8 @ X6 @ X7))) => (X5 @ X6 @ X7))) => (X5 @ X3 @ X4)))),
% 0.20/0.28 inference(negated_conjecture,[status(cth)],[f1])).
% 0.20/0.28 thf(f3,plain,(
% 0.20/0.28 ~ ! [X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o),X3 : a,X4 : a] : (! [X5 : (a > a > $o)] : (((X0 @ X5) & ! [X6 : a,X7 : a] : (((X2 @ X6 @ X7) | (X1 @ X6 @ X7)) => (X5 @ X6 @ X7))) => (X5 @ X3 @ X4)) => ! [X8 : (a > a > $o)] : (((X0 @ X8) & ! [X9 : a,X10 : a] : ((! [X11 : (a > a > $o)] : (((X0 @ X11) & ! [X12 : a,X13 : a] : ((X2 @ X12 @ X13) => (X11 @ X12 @ X13))) => (X11 @ X9 @ X10)) | ! [X14 : (a > a > $o)] : (((X0 @ X14) & ! [X15 : a,X16 : a] : ((X1 @ X15 @ X16) => (X14 @ X15 @ X16))) => (X14 @ X9 @ X10))) => (X8 @ X9 @ X10))) => (X8 @ X3 @ X4)))),
% 0.20/0.28 inference(rectify,[],[f2])).
% 0.20/0.28 thf(f4,plain,(
% 0.20/0.28 ~ ! [X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o),X3 : a,X4 : a] : (! [X5 : (a > a > $o)] : (((((X0 @ X5)) = $true) & ! [X6 : a,X7 : a] : (((((X2 @ X6 @ X7)) = $true) | (((X1 @ X6 @ X7)) = $true)) => (((X5 @ X6 @ X7)) = $true))) => (((X5 @ X3 @ X4)) = $true)) => ! [X8 : (a > a > $o)] : (((((X0 @ X8)) = $true) & ! [X9 : a,X10 : a] : ((! [X11 : (a > a > $o)] : (((((X0 @ X11)) = $true) & ! [X12 : a,X13 : a] : ((((X2 @ X12 @ X13)) = $true) => (((X11 @ X12 @ X13)) = $true))) => (((X11 @ X9 @ X10)) = $true)) | ! [X14 : (a > a > $o)] : (((((X0 @ X14)) = $true) & ! [X15 : a,X16 : a] : ((((X1 @ X15 @ X16)) = $true) => (((X14 @ X15 @ X16)) = $true))) => (((X14 @ X9 @ X10)) = $true))) => (((X8 @ X9 @ X10)) = $true))) => (((X8 @ X3 @ X4)) = $true)))),
% 0.20/0.28 inference(fool_elimination,[],[f3])).
% 0.20/0.28 thf(f5,plain,(
% 0.20/0.28 ? [X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o),X3 : a,X4 : a] : (? [X8 : (a > a > $o)] : ((((X8 @ X3 @ X4)) != $true) & ((((X0 @ X8)) = $true) & ! [X9 : a,X10 : a] : ((((X8 @ X9 @ X10)) = $true) | (? [X11 : (a > a > $o)] : ((((X11 @ X9 @ X10)) != $true) & ((((X0 @ X11)) = $true) & ! [X12 : a,X13 : a] : ((((X11 @ X12 @ X13)) = $true) | (((X2 @ X12 @ X13)) != $true)))) & ? [X14 : (a > a > $o)] : ((((X14 @ X9 @ X10)) != $true) & ((((X0 @ X14)) = $true) & ! [X15 : a,X16 : a] : ((((X14 @ X15 @ X16)) = $true) | (((X1 @ X15 @ X16)) != $true)))))))) & ! [X5 : (a > a > $o)] : ((((X5 @ X3 @ X4)) = $true) | ((((X0 @ X5)) != $true) | ? [X6 : a,X7 : a] : ((((X5 @ X6 @ X7)) != $true) & ((((X2 @ X6 @ X7)) = $true) | (((X1 @ X6 @ X7)) = $true))))))),
% 0.20/0.28 inference(ennf_transformation,[],[f4])).
% 0.20/0.28 thf(f6,plain,(
% 0.20/0.28 ? [X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o),X3 : a,X4 : a] : (? [X8 : (a > a > $o)] : ((((X8 @ X3 @ X4)) != $true) & (((X0 @ X8)) = $true) & ! [X9 : a,X10 : a] : ((((X8 @ X9 @ X10)) = $true) | (? [X11 : (a > a > $o)] : ((((X11 @ X9 @ X10)) != $true) & (((X0 @ X11)) = $true) & ! [X12 : a,X13 : a] : ((((X11 @ X12 @ X13)) = $true) | (((X2 @ X12 @ X13)) != $true))) & ? [X14 : (a > a > $o)] : ((((X14 @ X9 @ X10)) != $true) & (((X0 @ X14)) = $true) & ! [X15 : a,X16 : a] : ((((X14 @ X15 @ X16)) = $true) | (((X1 @ X15 @ X16)) != $true)))))) & ! [X5 : (a > a > $o)] : ((((X5 @ X3 @ X4)) = $true) | (((X0 @ X5)) != $true) | ? [X6 : a,X7 : a] : ((((X5 @ X6 @ X7)) != $true) & ((((X2 @ X6 @ X7)) = $true) | (((X1 @ X6 @ X7)) = $true)))))),
% 0.20/0.28 inference(flattening,[],[f5])).
% 0.20/0.28 thf(f7,plain,(
% 0.20/0.28 ? [X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o),X3 : a,X4 : a] : (? [X5 : (a > a > $o)] : ((((X5 @ X3 @ X4)) != $true) & (((X0 @ X5)) = $true) & ! [X6 : a,X7 : a] : ((((X5 @ X6 @ X7)) = $true) | (? [X8 : (a > a > $o)] : ((((X8 @ X6 @ X7)) != $true) & (((X0 @ X8)) = $true) & ! [X9 : a,X10 : a] : ((((X8 @ X9 @ X10)) = $true) | (((X2 @ X9 @ X10)) != $true))) & ? [X11 : (a > a > $o)] : (($true != ((X11 @ X6 @ X7))) & (((X0 @ X11)) = $true) & ! [X12 : a,X13 : a] : ((((X11 @ X12 @ X13)) = $true) | ($true != ((X1 @ X12 @ X13)))))))) & ! [X14 : (a > a > $o)] : (($true = ((X14 @ X3 @ X4))) | (((X0 @ X14)) != $true) | ? [X15 : a,X16 : a] : ((((X14 @ X15 @ X16)) != $true) & (($true = ((X2 @ X15 @ X16))) | (((X1 @ X15 @ X16)) = $true)))))),
% 0.20/0.28 inference(rectify,[],[f6])).
% 0.20/0.28 thf(f8,plain,(
% 0.20/0.28 (($true != ((sK5 @ sK3 @ sK4))) & ($true = ((sK0 @ sK5))) & ! [X6 : a,X7 : a] : (($true = ((sK5 @ X6 @ X7))) | ((($true != ((sK6 @ X7 @ X6 @ X6 @ X7))) & ($true = ((sK0 @ (sK6 @ X7 @ X6)))) & ! [X9 : a,X10 : a] : (($true = ((sK6 @ X7 @ X6 @ X9 @ X10))) | ($true != ((sK2 @ X9 @ X10))))) & (($true != ((sK7 @ X7 @ X6 @ X6 @ X7))) & ($true = ((sK0 @ (sK7 @ X7 @ X6)))) & ! [X12 : a,X13 : a] : (($true = ((sK7 @ X7 @ X6 @ X12 @ X13))) | ($true != ((sK1 @ X12 @ X13)))))))) & ! [X14 : (a > a > $o)] : (($true = ((X14 @ sK3 @ sK4))) | ($true != ((sK0 @ X14))) | (($true != ((X14 @ (sK8 @ X14) @ (sK9 @ X14)))) & (($true = ((sK2 @ (sK8 @ X14) @ (sK9 @ X14)))) | ($true = ((sK1 @ (sK8 @ X14) @ (sK9 @ X14)))))))),
% 0.20/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,vAPP,vAPP,vAPP,vAPP]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X16,sK9 @ X14),skolemize(X16,sK9 @ X14),skolemize(X16,sK9 @ X14),skolemize(X16,sK9 @ X14)],[f7])).
% 0.20/0.28 thf(f9,plain,(
% 0.20/0.28 ( ! [X14 : (a > a > $o)] : (($true != ((sK0 @ X14))) | ($true = ((X14 @ sK3 @ sK4))) | ($true = ((sK2 @ (sK8 @ X14) @ (sK9 @ X14)))) | ($true = ((sK1 @ (sK8 @ X14) @ (sK9 @ X14))))) )),
% 0.20/0.28 inference(cnf_transformation,[],[f8])).
% 0.20/0.28 thf(f10,plain,(
% 0.20/0.28 ( ! [X14 : (a > a > $o)] : (($true != ((X14 @ (sK8 @ X14) @ (sK9 @ X14)))) | ($true != ((sK0 @ X14))) | ($true = ((X14 @ sK3 @ sK4)))) )),
% 0.20/0.28 inference(cnf_transformation,[],[f8])).
% 0.20/0.28 thf(f11,plain,(
% 0.20/0.28 ( ! [X6 : a,X7 : a,X12 : a,X13 : a] : (($true != ((sK1 @ X12 @ X13))) | ($true = ((sK7 @ X7 @ X6 @ X12 @ X13))) | ($true = ((sK5 @ X6 @ X7)))) )),
% 0.20/0.28 inference(cnf_transformation,[],[f8])).
% 0.20/0.28 thf(f13,plain,(
% 0.20/0.28 ( ! [X6 : a,X7 : a] : (($true != ((sK7 @ X7 @ X6 @ X6 @ X7))) | ($true = ((sK5 @ X6 @ X7)))) )),
% 0.20/0.28 inference(cnf_transformation,[],[f8])).
% 0.20/0.28 thf(f14,plain,(
% 0.20/0.28 ( ! [X10 : a,X6 : a,X9 : a,X7 : a] : (($true != ((sK2 @ X9 @ X10))) | ($true = ((sK6 @ X7 @ X6 @ X9 @ X10))) | ($true = ((sK5 @ X6 @ X7)))) )),
% 0.20/0.28 inference(cnf_transformation,[],[f8])).
% 0.20/0.28 thf(f16,plain,(
% 0.20/0.28 ( ! [X6 : a,X7 : a] : (($true != ((sK6 @ X7 @ X6 @ X6 @ X7))) | ($true = ((sK5 @ X6 @ X7)))) )),
% 0.20/0.28 inference(cnf_transformation,[],[f8])).
% 0.20/0.28 thf(f17,plain,(
% 0.20/0.28 ($true = ((sK0 @ sK5)))),
% 0.20/0.28 inference(cnf_transformation,[],[f8])).
% 0.20/0.28 thf(f18,plain,(
% 0.20/0.28 ($true != ((sK5 @ sK3 @ sK4)))),
% 0.20/0.28 inference(cnf_transformation,[],[f8])).
% 0.20/0.28 thf(f20,definition,(
% 0.20/0.28 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.20/0.28 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.20/0.28 thf(f77,plain,(
% 0.20/0.28 ( ! [X2 : a,X3 : a,X0 : a,X1 : a] : (($true != $true) | ($true = ((sK7 @ X2 @ X3 @ X0 @ X1))) | ($true = ((sK5 @ X3 @ X2))) | ($false = ((sK1 @ X0 @ X1)))) )),
% 0.20/0.28 inference(constrained_superposition,[],[f11,f20])).
% 0.20/0.28 thf(f78,plain,(
% 0.20/0.28 ( ! [X2 : a,X3 : a,X0 : a,X1 : a] : (($true != $true) | ($true = ((sK6 @ X2 @ X3 @ X0 @ X1))) | ($true = ((sK5 @ X3 @ X2))) | ($false = ((sK2 @ X0 @ X1)))) )),
% 0.20/0.28 inference(constrained_superposition,[],[f14,f20])).
% 0.20/0.28 thf(f79,plain,(
% 0.20/0.28 ( ! [X0 : (a > a > $o)] : (($true != $true) | ($true != ((sK0 @ X0))) | ($true = ((X0 @ sK3 @ sK4))) | ($false = ((X0 @ (sK8 @ X0) @ (sK9 @ X0))))) )),
% 0.20/0.28 inference(constrained_superposition,[],[f10,f20])).
% 0.20/0.28 thf(f83,plain,(
% 0.20/0.28 ( ! [X0 : (a > a > $o)] : (($true != ((sK0 @ X0))) | ($true = ((X0 @ sK3 @ sK4))) | ($false = ((X0 @ (sK8 @ X0) @ (sK9 @ X0))))) )),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f79])).
% 0.20/0.28 thf(f84,plain,(
% 0.20/0.28 ( ! [X2 : a,X3 : a,X0 : a,X1 : a] : (($true = ((sK6 @ X2 @ X3 @ X0 @ X1))) | ($true = ((sK5 @ X3 @ X2))) | ($false = ((sK2 @ X0 @ X1)))) )),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f78])).
% 0.20/0.28 thf(f85,plain,(
% 0.20/0.28 ( ! [X2 : a,X3 : a,X0 : a,X1 : a] : (($true = ((sK7 @ X2 @ X3 @ X0 @ X1))) | ($true = ((sK5 @ X3 @ X2))) | ($false = ((sK1 @ X0 @ X1)))) )),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f77])).
% 0.20/0.28 thf(f93,plain,(
% 0.20/0.28 ($true != $true) | ($true = ((sK5 @ sK3 @ sK4))) | ($true = ((sK2 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | ($true = ((sK1 @ (sK8 @ sK5) @ (sK9 @ sK5))))),
% 0.20/0.28 inference(constrained_superposition,[],[f9,f17])).
% 0.20/0.28 thf(f100,plain,(
% 0.20/0.28 ($true = ((sK5 @ sK3 @ sK4))) | ($true = ((sK2 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | ($true = ((sK1 @ (sK8 @ sK5) @ (sK9 @ sK5))))),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f93])).
% 0.20/0.28 thf(f101,plain,(
% 0.20/0.28 ($true = ((sK2 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | ($true = ((sK1 @ (sK8 @ sK5) @ (sK9 @ sK5))))),
% 0.20/0.28 inference(forward_subsumption_resolution,[],[f100,f18])).
% 0.20/0.28 thf(f103,definition,(
% 0.20/0.28 spl10_6 <=> ($true = ((sK1 @ (sK8 @ sK5) @ (sK9 @ sK5))))),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl10_6])],[avatar_definition])).
% 0.20/0.28 thf(f105,plain,(
% 0.20/0.28 ($true = ((sK1 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | ~spl10_6),
% 0.20/0.28 inference(avatar_component_clause,[],[f103])).
% 0.20/0.28 thf(f107,definition,(
% 0.20/0.28 spl10_7 <=> ($true = ((sK2 @ (sK8 @ sK5) @ (sK9 @ sK5))))),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl10_7])],[avatar_definition])).
% 0.20/0.28 thf(f109,plain,(
% 0.20/0.28 ($true = ((sK2 @ (sK8 @ sK5) @ (sK9 @ sK5)))) | ~spl10_7),
% 0.20/0.28 inference(avatar_component_clause,[],[f107])).
% 0.20/0.28 thf(f110,plain,(
% 0.20/0.28 spl10_6 | spl10_7),
% 0.20/0.28 inference(avatar_split_clause,[],[f101,f107,f103])).
% 0.20/0.28 thf(f133,plain,(
% 0.20/0.28 ($true != $true) | ($true = ((sK5 @ sK3 @ sK4))) | ($false = ((sK5 @ (sK8 @ sK5) @ (sK9 @ sK5))))),
% 0.20/0.28 inference(constrained_superposition,[],[f83,f17])).
% 0.20/0.28 thf(f140,plain,(
% 0.20/0.28 ($true = ((sK5 @ sK3 @ sK4))) | ($false = ((sK5 @ (sK8 @ sK5) @ (sK9 @ sK5))))),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f133])).
% 0.20/0.28 thf(f141,plain,(
% 0.20/0.28 ($false = ((sK5 @ (sK8 @ sK5) @ (sK9 @ sK5))))),
% 0.20/0.28 inference(forward_subsumption_resolution,[],[f140,f18])).
% 0.20/0.28 thf(f144,plain,(
% 0.20/0.28 ( ! [X0 : a,X1 : a] : (($true != $true) | ($true = ((sK5 @ X1 @ X0))) | ($true = ((sK5 @ X1 @ X0))) | ($false = ((sK2 @ X1 @ X0)))) )),
% 0.20/0.28 inference(constrained_superposition,[],[f16,f84])).
% 0.20/0.28 thf(f148,plain,(
% 0.20/0.28 ( ! [X0 : a,X1 : a] : (($true != $true) | ($true = ((sK5 @ X1 @ X0))) | ($false = ((sK2 @ X1 @ X0)))) )),
% 0.20/0.28 inference(duplicate_literal_removal,[],[f144])).
% 0.20/0.28 thf(f149,plain,(
% 0.20/0.28 ( ! [X0 : a,X1 : a] : (($true = ((sK5 @ X1 @ X0))) | ($false = ((sK2 @ X1 @ X0)))) )),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f148])).
% 0.20/0.28 thf(f165,plain,(
% 0.20/0.28 ( ! [X0 : a,X1 : a] : (($true != $true) | ($true = ((sK5 @ X1 @ X0))) | ($true = ((sK5 @ X1 @ X0))) | ($false = ((sK1 @ X1 @ X0)))) )),
% 0.20/0.28 inference(constrained_superposition,[],[f13,f85])).
% 0.20/0.28 thf(f169,plain,(
% 0.20/0.28 ( ! [X0 : a,X1 : a] : (($true != $true) | ($true = ((sK5 @ X1 @ X0))) | ($false = ((sK1 @ X1 @ X0)))) )),
% 0.20/0.28 inference(duplicate_literal_removal,[],[f165])).
% 0.20/0.28 thf(f170,plain,(
% 0.20/0.28 ( ! [X0 : a,X1 : a] : (($true = ((sK5 @ X1 @ X0))) | ($false = ((sK1 @ X1 @ X0)))) )),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f169])).
% 0.20/0.28 thf(f218,plain,(
% 0.20/0.28 ($true = $false) | ($false = ((sK1 @ (sK8 @ sK5) @ (sK9 @ sK5))))),
% 0.20/0.28 inference(constrained_superposition,[],[f170,f141])).
% 0.20/0.28 thf(f219,plain,(
% 0.20/0.28 ($true = $false) | ($false = ((sK2 @ (sK8 @ sK5) @ (sK9 @ sK5))))),
% 0.20/0.28 inference(constrained_superposition,[],[f149,f141])).
% 0.20/0.28 thf(f224,plain,(
% 0.20/0.28 ($false = ((sK2 @ (sK8 @ sK5) @ (sK9 @ sK5))))),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f219])).
% 0.20/0.28 thf(f225,plain,(
% 0.20/0.28 ($false = ((sK1 @ (sK8 @ sK5) @ (sK9 @ sK5))))),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f218])).
% 0.20/0.28 thf(f247,plain,(
% 0.20/0.28 ($true = $false) | ~spl10_6),
% 0.20/0.28 inference(constrained_superposition,[],[f225,f105])).
% 0.20/0.28 thf(f256,plain,(
% 0.20/0.28 $false | ~spl10_6),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f247])).
% 0.20/0.28 thf(f257,plain,(
% 0.20/0.28 ~spl10_6),
% 0.20/0.28 inference(avatar_contradiction_clause,[],[f256])).
% 0.20/0.28 thf(f259,plain,(
% 0.20/0.28 ($true = $false) | ~spl10_7),
% 0.20/0.28 inference(forward_demodulation,[],[f109,f224])).
% 0.20/0.28 thf(f260,plain,(
% 0.20/0.28 $false | ~spl10_7),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f259])).
% 0.20/0.28 thf(f261,plain,(
% 0.20/0.28 ~spl10_7),
% 0.20/0.28 inference(avatar_contradiction_clause,[],[f260])).
% 0.20/0.28 cnf(s3, plain, spl10_6 | spl10_7, inference(sat_conversion,[],[f110])).
% 0.20/0.28 cnf(s5, plain, ~spl10_6, inference(sat_conversion,[],[f257])).
% 0.20/0.28 cnf(s6, plain, ~spl10_7, inference(sat_conversion,[],[f261])).
% 0.20/0.28 cnf(s7, plain, $false, inference(rat,[],[s3,s6,s5])).
% 0.20/0.28 thf(f268,plain,(
% 0.20/0.28 $false),
% 0.20/0.28 inference(avatar_sat_refutation,[],[s7])).
% 0.20/0.28 % SZS output end Proof for theBenchmark
% 0.20/0.28 % (3484044)------------------------------
% 0.20/0.28 % (3484044)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (3484044)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (3484044)CaDiCaL version: 2.1.3
% 0.20/0.28 % (3484044)Termination reason: Refutation
% 0.20/0.28 % (3484044)Time elapsed: 0.014 s
% 0.20/0.28 % (3484044)Peak memory usage: 13 MB
% 0.20/0.28 % (3484044)Instructions burned: 48 (million)
% 0.20/0.28 % (3484034)Success in time 0.056 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------