%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV186^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:07 AM UTC 2026
% Result : Theorem 0.11s 0.28s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV186^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.19 % Computer : n006.cluster.edu
% 0.11/0.19 % Model : x86_64 x86_64
% 0.11/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.19 % Memory : 8046.5625MB
% 0.11/0.19 % OS : Linux 6.8.0-71-generic
% 0.11/0.19 % CPULimit : 300
% 0.11/0.19 % WCLimit : 300
% 0.11/0.19 % DateTime : Tue Sep 29 15:19:10 UTC 2026
% 0.11/0.19 % CPUTime :
% 0.11/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.23 Running first-order model finding
% 0.11/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.28 % (855077)Will run a generic schedule for satisfiability detection.
% 0.11/0.28 % (855085)dis+10_1_sil=32000:sp=arity:random_seed=2752192099:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.28 % (855082)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1456922414_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.28 % (855083)% WARNING: option uhcvi not known.
% 0.11/0.28 % Exception at run slice level
% 0.11/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.11/0.28 % (855088)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2784422600:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.28 % (855083)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=239667632:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.28 % (855083)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.11/0.28 % (855083)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.11/0.28 % (855085) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-855077-855085"...
% 0.11/0.28 % (855085)...printing done.
% 0.11/0.28 % (855085)Refutation found. Thanks to Tanya!
% 0.11/0.28 % SZS status Theorem for theBenchmark
% 0.11/0.28 % SZS output start Proof for theBenchmark
% 0.11/0.28 thf(type_def_5, type, b: $tType).
% 0.11/0.28 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.11/0.28 thf(func_def_3, type, sK0: ((b > $o) > (b > $o) > $o)).
% 0.11/0.28 thf(func_def_4, type, sK1: ((b > $o) > $o)).
% 0.11/0.28 thf(func_def_5, type, sK2: (b > $o)).
% 0.11/0.28 thf(func_def_6, type, sK3: (b > $o)).
% 0.11/0.28 thf(func_def_7, type, sK4: b).
% 0.11/0.28 thf(func_def_8, type, sK5: (b > $o)).
% 0.11/0.28 thf(func_def_9, type, sK6: ((b > $o) > (b > $o) > b)).
% 0.11/0.28 thf(func_def_10, type, vNOT: ($o > $o)).
% 0.11/0.28 thf(func_def_11, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.11/0.28 thf(func_def_12, type, db0: !>[X0: $tType]:(X0)).
% 0.11/0.28 thf(func_def_13, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.11/0.28 thf(func_def_14, type, db1: !>[X0: $tType]:(X0)).
% 0.11/0.28 thf(func_def_16, type, sK8: ((b > $o) > (b > b > b) > b)).
% 0.11/0.28 thf(func_def_17, type, sK9: ((b > b > b) > (b > b > $o) > (b > $o) > b)).
% 0.11/0.28 thf(f1,conjecture,(
% 0.11/0.28 ! [X0 : ((b > $o) > (b > $o) > $o),X1 : ((b > $o) > $o)] : (! [X2 : (b > $o)] : ((X1 @ X2) => ! [X3 : (b > $o),X4 : (b > $o)] : (((X0 @ X3 @ X4) & ! [X5 : b] : ((X3 @ X5) => (X2 @ X5))) => ! [X5 : b] : ((X4 @ X5) => (X2 @ X5)))) => ! [X3 : (b > $o),X4 : (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.11/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM565_pme)).
% 0.11/0.28 thf(f2,negated_conjecture,(
% 0.11/0.28 ~ ! [X0 : ((b > $o) > (b > $o) > $o),X1 : ((b > $o) > $o)] : (! [X2 : (b > $o)] : ((X1 @ X2) => ! [X3 : (b > $o),X4 : (b > $o)] : (((X0 @ X3 @ X4) & ! [X5 : b] : ((X3 @ X5) => (X2 @ X5))) => ! [X5 : b] : ((X4 @ X5) => (X2 @ X5)))) => ! [X3 : (b > $o),X4 : (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.11/0.28 inference(negated_conjecture,[status(cth)],[f1])).
% 0.11/0.28 thf(f3,plain,(
% 0.11/0.28 ~ ! [X0 : ((b > $o) > (b > $o) > $o),X1 : ((b > $o) > $o)] : (! [X2 : (b > $o)] : ((X1 @ X2) => ! [X3 : (b > $o),X4 : (b > $o)] : (((X0 @ X3 @ X4) & ! [X5 : b] : ((X3 @ X5) => (X2 @ X5))) => ! [X6 : b] : ((X4 @ X6) => (X2 @ X6)))) => ! [X7 : (b > $o),X8 : (b > $o)] : (((X0 @ X7 @ X8) & ! [X9 : b] : ((X7 @ X9) => ! [X10 : (b > $o)] : ((X1 @ X10) => (X10 @ X9)))) => ! [X11 : b] : ((X8 @ X11) => ! [X12 : (b > $o)] : ((X1 @ X12) => (X12 @ X11)))))),
% 0.11/0.28 inference(rectify,[],[f2])).
% 0.11/0.28 thf(f4,plain,(
% 0.11/0.28 ~ ! [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] : ((((X4 @ X6)) = $true) => (((X2 @ X6)) = $true)))) => ! [X7 : (b > $o),X8 : (b > $o)] : (((((X0 @ X7 @ X8)) = $true) & ! [X9 : b] : ((((X7 @ X9)) = $true) => ! [X10 : (b > $o)] : ((((X1 @ X10)) = $true) => (((X10 @ X9)) = $true)))) => ! [X11 : b] : ((((X8 @ X11)) = $true) => ! [X12 : (b > $o)] : ((((X1 @ X12)) = $true) => (((X12 @ X11)) = $true)))))),
% 0.11/0.28 inference(fool_elimination,[],[f3])).
% 0.11/0.28 thf(f5,plain,(
% 0.11/0.28 ? [X0 : ((b > $o) > (b > $o) > $o),X1 : ((b > $o) > $o)] : (? [X7 : (b > $o),X8 : (b > $o)] : (? [X11 : b] : (? [X12 : (b > $o)] : ((((X12 @ X11)) != $true) & (((X1 @ X12)) = $true)) & (((X8 @ X11)) = $true)) & ((((X0 @ X7 @ X8)) = $true) & ! [X9 : b] : (! [X10 : (b > $o)] : ((((X10 @ X9)) = $true) | (((X1 @ X10)) != $true)) | (((X7 @ X9)) != $true)))) & ! [X2 : (b > $o)] : (! [X3 : (b > $o),X4 : (b > $o)] : (! [X6 : b] : ((((X2 @ X6)) = $true) | (((X4 @ X6)) != $true)) | ((((X0 @ X3 @ X4)) != $true) | ? [X5 : b] : ((((X2 @ X5)) != $true) & (((X3 @ X5)) = $true)))) | (((X1 @ X2)) != $true)))),
% 0.11/0.28 inference(ennf_transformation,[],[f4])).
% 0.11/0.28 thf(f6,plain,(
% 0.11/0.28 ? [X0 : ((b > $o) > (b > $o) > $o),X1 : ((b > $o) > $o)] : (? [X7 : (b > $o),X8 : (b > $o)] : (? [X11 : b] : (? [X12 : (b > $o)] : ((((X12 @ X11)) != $true) & (((X1 @ X12)) = $true)) & (((X8 @ X11)) = $true)) & (((X0 @ X7 @ X8)) = $true) & ! [X9 : b] : (! [X10 : (b > $o)] : ((((X10 @ X9)) = $true) | (((X1 @ X10)) != $true)) | (((X7 @ X9)) != $true))) & ! [X2 : (b > $o)] : (! [X3 : (b > $o),X4 : (b > $o)] : (! [X6 : b] : ((((X2 @ X6)) = $true) | (((X4 @ X6)) != $true)) | (((X0 @ X3 @ X4)) != $true) | ? [X5 : b] : ((((X2 @ X5)) != $true) & (((X3 @ X5)) = $true))) | (((X1 @ X2)) != $true)))),
% 0.11/0.28 inference(flattening,[],[f5])).
% 0.11/0.28 thf(f7,plain,(
% 0.11/0.28 ? [X0 : ((b > $o) > (b > $o) > $o),X1 : ((b > $o) > $o)] : (? [X2 : (b > $o),X3 : (b > $o)] : (? [X4 : b] : (? [X5 : (b > $o)] : (($true != ((X5 @ X4))) & ($true = ((X1 @ X5)))) & ($true = ((X3 @ X4)))) & ($true = ((X0 @ X2 @ X3))) & ! [X6 : b] : (! [X7 : (b > $o)] : (($true = ((X7 @ X6))) | ($true != ((X1 @ X7)))) | (((X2 @ X6)) != $true))) & ! [X8 : (b > $o)] : (! [X9 : (b > $o),X10 : (b > $o)] : (! [X11 : b] : ((((X8 @ X11)) = $true) | ($true != ((X10 @ X11)))) | ($true != ((X0 @ X9 @ X10))) | ? [X12 : b] : (($true != ((X8 @ X12))) & ($true = ((X9 @ X12))))) | ($true != ((X1 @ X8)))))),
% 0.11/0.28 inference(rectify,[],[f6])).
% 0.11/0.28 thf(f8,plain,(
% 0.11/0.28 (((($true != ((sK5 @ sK4))) & ($true = ((sK1 @ sK5)))) & ($true = ((sK3 @ sK4)))) & ($true = ((sK0 @ sK2 @ sK3))) & ! [X6 : b] : (! [X7 : (b > $o)] : (($true = ((X7 @ X6))) | ($true != ((sK1 @ X7)))) | ($true != ((sK2 @ X6))))) & ! [X8 : (b > $o)] : (! [X9 : (b > $o),X10 : (b > $o)] : (! [X11 : b] : ((((X8 @ X11)) = $true) | ($true != ((X10 @ X11)))) | ($true != ((sK0 @ X9 @ X10))) | (($true != ((X8 @ (sK6 @ X9 @ X8)))) & ($true = ((X9 @ (sK6 @ X9 @ X8)))))) | ($true != ((sK1 @ X8))))),
% 0.11/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,vAPP]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X12,sK6 @ X9 @ X8)],[f7])).
% 0.11/0.28 thf(f9,plain,(
% 0.11/0.28 ( ! [X10 : (b > $o),X11 : b,X8 : (b > $o),X9 : (b > $o)] : (($true != ((sK0 @ X9 @ X10))) | ($true != ((X10 @ X11))) | (((X8 @ X11)) = $true) | ($true = ((X9 @ (sK6 @ X9 @ X8)))) | ($true != ((sK1 @ X8)))) )),
% 0.11/0.28 inference(cnf_transformation,[],[f8])).
% 0.11/0.28 thf(f10,plain,(
% 0.11/0.28 ( ! [X10 : (b > $o),X11 : b,X8 : (b > $o),X9 : (b > $o)] : (($true != ((X8 @ (sK6 @ X9 @ X8)))) | ($true != ((X10 @ X11))) | ($true != ((sK0 @ X9 @ X10))) | (((X8 @ X11)) = $true) | ($true != ((sK1 @ X8)))) )),
% 0.11/0.28 inference(cnf_transformation,[],[f8])).
% 0.11/0.28 thf(f11,plain,(
% 0.11/0.28 ( ! [X6 : b,X7 : (b > $o)] : (($true != ((sK1 @ X7))) | ($true = ((X7 @ X6))) | ($true != ((sK2 @ X6)))) )),
% 0.11/0.28 inference(cnf_transformation,[],[f8])).
% 0.11/0.28 thf(f12,plain,(
% 0.11/0.28 ($true = ((sK0 @ sK2 @ sK3)))),
% 0.11/0.28 inference(cnf_transformation,[],[f8])).
% 0.11/0.28 thf(f13,plain,(
% 0.11/0.28 ($true = ((sK3 @ sK4)))),
% 0.11/0.28 inference(cnf_transformation,[],[f8])).
% 0.11/0.28 thf(f14,plain,(
% 0.11/0.28 ($true = ((sK1 @ sK5)))),
% 0.11/0.28 inference(cnf_transformation,[],[f8])).
% 0.11/0.28 thf(f15,plain,(
% 0.11/0.28 ($true != ((sK5 @ sK4)))),
% 0.11/0.28 inference(cnf_transformation,[],[f8])).
% 0.11/0.28 thf(f17,definition,(
% 0.11/0.28 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.11/0.28 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.11/0.28 thf(f18,plain,(
% 0.11/0.28 ( ! [X0 : b] : (($true != $true) | ($true = ((sK5 @ X0))) | ($true != ((sK2 @ X0)))) )),
% 0.11/0.28 inference(constrained_superposition,[],[f11,f14])).
% 0.11/0.28 thf(f19,plain,(
% 0.11/0.28 ( ! [X0 : b] : (($true != ((sK2 @ X0))) | ($true = ((sK5 @ X0)))) )),
% 0.11/0.28 inference(trivial_inequality_removal,[],[f18])).
% 0.11/0.28 thf(f36,plain,(
% 0.11/0.28 ( ! [X0 : b,X1 : (b > $o)] : (($true != $true) | ($true != ((sK3 @ X0))) | ($true = ((X1 @ X0))) | ($true = ((sK2 @ (sK6 @ sK2 @ X1)))) | ($true != ((sK1 @ X1)))) )),
% 0.11/0.28 inference(constrained_superposition,[],[f9,f12])).
% 0.11/0.28 thf(f39,plain,(
% 0.11/0.28 ( ! [X0 : b,X1 : (b > $o)] : (($true != ((sK1 @ X1))) | ($true = ((X1 @ X0))) | ($true = ((sK2 @ (sK6 @ sK2 @ X1)))) | ($true != ((sK3 @ X0)))) )),
% 0.11/0.28 inference(trivial_inequality_removal,[],[f36])).
% 0.11/0.28 thf(f56,plain,(
% 0.11/0.28 ( ! [X2 : (b > $o),X3 : b,X0 : (b > $o),X1 : (b > $o)] : (($true != $true) | ($true != ((X2 @ X3))) | ($true != ((sK0 @ X1 @ X2))) | ($true = ((X0 @ X3))) | ($true != ((sK1 @ X0))) | ($false = ((X0 @ (sK6 @ X1 @ X0))))) )),
% 0.11/0.28 inference(constrained_superposition,[],[f10,f17])).
% 0.11/0.28 thf(f59,plain,(
% 0.11/0.28 ( ! [X2 : (b > $o),X3 : b,X0 : (b > $o),X1 : (b > $o)] : (($true != ((sK0 @ X1 @ X2))) | ($true != ((X2 @ X3))) | ($true = ((X0 @ X3))) | ($true != ((sK1 @ X0))) | ($false = ((X0 @ (sK6 @ X1 @ X0))))) )),
% 0.11/0.28 inference(trivial_inequality_removal,[],[f56])).
% 0.11/0.28 thf(f83,plain,(
% 0.11/0.28 ( ! [X0 : b] : (($true != $true) | ($true = ((sK5 @ X0))) | ($true = ((sK2 @ (sK6 @ sK2 @ sK5)))) | ($true != ((sK3 @ X0)))) )),
% 0.11/0.28 inference(constrained_superposition,[],[f39,f14])).
% 0.11/0.28 thf(f86,plain,(
% 0.11/0.28 ( ! [X0 : b] : (($true = ((sK5 @ X0))) | ($true = ((sK2 @ (sK6 @ sK2 @ sK5)))) | ($true != ((sK3 @ X0)))) )),
% 0.11/0.28 inference(trivial_inequality_removal,[],[f83])).
% 0.11/0.28 thf(f88,definition,(
% 0.11/0.28 spl7_1 <=> ($true = ((sK2 @ (sK6 @ sK2 @ sK5))))),
% 0.11/0.28 introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition])).
% 0.11/0.28 thf(f90,plain,(
% 0.11/0.28 ($true = ((sK2 @ (sK6 @ sK2 @ sK5)))) | ~spl7_1),
% 0.11/0.28 inference(avatar_component_clause,[],[f88])).
% 0.11/0.28 thf(f92,definition,(
% 0.11/0.28 spl7_2 <=> ! [X0 : b] : (($true = ((sK5 @ X0))) | ($true != ((sK3 @ X0))))),
% 0.11/0.28 introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition])).
% 0.11/0.28 thf(f93,plain,(
% 0.11/0.28 ( ! [X0 : b] : (($true != ((sK3 @ X0))) | ($true = ((sK5 @ X0)))) ) | ~spl7_2),
% 0.11/0.28 inference(avatar_component_clause,[],[f92])).
% 0.11/0.28 thf(f94,plain,(
% 0.11/0.28 spl7_1 | spl7_2),
% 0.11/0.28 inference(avatar_split_clause,[],[f86,f92,f88])).
% 0.11/0.28 thf(f99,plain,(
% 0.11/0.28 ($true != $true) | ($true = ((sK5 @ sK4))) | ~spl7_2),
% 0.11/0.28 inference(constrained_superposition,[],[f93,f13])).
% 0.11/0.28 thf(f102,plain,(
% 0.11/0.28 ($true = ((sK5 @ sK4))) | ~spl7_2),
% 0.11/0.28 inference(trivial_inequality_removal,[],[f99])).
% 0.11/0.28 thf(f103,plain,(
% 0.11/0.28 $false | ~spl7_2),
% 0.11/0.28 inference(forward_subsumption_resolution,[],[f102,f15])).
% 0.11/0.28 thf(f104,plain,(
% 0.11/0.28 ~spl7_2),
% 0.11/0.28 inference(avatar_contradiction_clause,[],[f103])).
% 0.11/0.28 thf(f106,plain,(
% 0.11/0.28 ( ! [X0 : b,X1 : (b > $o)] : (($true != $true) | ($true != ((sK3 @ X0))) | ($true = ((X1 @ X0))) | ($true != ((sK1 @ X1))) | ($false = ((X1 @ (sK6 @ sK2 @ X1))))) )),
% 0.11/0.28 inference(constrained_superposition,[],[f59,f12])).
% 0.11/0.28 thf(f109,plain,(
% 0.11/0.28 ( ! [X0 : b,X1 : (b > $o)] : (($true != ((sK1 @ X1))) | ($true = ((X1 @ X0))) | ($true != ((sK3 @ X0))) | ($false = ((X1 @ (sK6 @ sK2 @ X1))))) )),
% 0.11/0.28 inference(trivial_inequality_removal,[],[f106])).
% 0.11/0.28 thf(f347,plain,(
% 0.11/0.28 ($true != $true) | ($true = ((sK5 @ (sK6 @ sK2 @ sK5)))) | ~spl7_1),
% 0.11/0.28 inference(constrained_superposition,[],[f19,f90])).
% 0.11/0.28 thf(f351,plain,(
% 0.11/0.28 ($true = ((sK5 @ (sK6 @ sK2 @ sK5)))) | ~spl7_1),
% 0.11/0.28 inference(trivial_inequality_removal,[],[f347])).
% 0.11/0.28 thf(f416,plain,(
% 0.11/0.28 ( ! [X0 : b] : (($true != $true) | ($true = ((sK5 @ X0))) | ($true != ((sK3 @ X0))) | ($false = ((sK5 @ (sK6 @ sK2 @ sK5))))) )),
% 0.11/0.28 inference(constrained_superposition,[],[f109,f14])).
% 0.11/0.28 thf(f426,plain,(
% 0.11/0.28 ( ! [X0 : b] : (($true = ((sK5 @ X0))) | ($true != ((sK3 @ X0))) | ($false = ((sK5 @ (sK6 @ sK2 @ sK5))))) )),
% 0.11/0.28 inference(trivial_inequality_removal,[],[f416])).
% 0.11/0.28 thf(f429,definition,(
% 0.11/0.28 spl7_10 <=> ($false = ((sK5 @ (sK6 @ sK2 @ sK5))))),
% 0.11/0.28 introduced(definition,[new_symbols(definition,[spl7_10])],[avatar_definition])).
% 0.11/0.28 thf(f431,plain,(
% 0.11/0.28 ($false = ((sK5 @ (sK6 @ sK2 @ sK5)))) | ~spl7_10),
% 0.11/0.28 inference(avatar_component_clause,[],[f429])).
% 0.11/0.28 thf(f432,plain,(
% 0.11/0.28 spl7_10 | spl7_2),
% 0.11/0.28 inference(avatar_split_clause,[],[f426,f92,f429])).
% 0.11/0.28 thf(f743,plain,(
% 0.11/0.28 ($true = $false) | (~spl7_1 | ~spl7_10)),
% 0.11/0.28 inference(constrained_superposition,[],[f431,f351])).
% 0.11/0.28 thf(f773,plain,(
% 0.11/0.28 $false | (~spl7_1 | ~spl7_10)),
% 0.11/0.28 inference(trivial_inequality_removal,[],[f743])).
% 0.11/0.28 thf(f774,plain,(
% 0.11/0.28 ~spl7_1 | ~spl7_10),
% 0.11/0.28 inference(avatar_contradiction_clause,[],[f773])).
% 0.11/0.28 cnf(s1, plain, spl7_1 | spl7_2, inference(sat_conversion,[],[f94])).
% 0.11/0.28 cnf(s2, plain, ~spl7_2, inference(sat_conversion,[],[f104])).
% 0.11/0.28 cnf(s18, plain, spl7_2 | spl7_10, inference(sat_conversion,[],[f432])).
% 0.11/0.28 cnf(s41, plain, ~spl7_1 | ~spl7_10, inference(sat_conversion,[],[f774])).
% 0.11/0.28 cnf(s48, plain, spl7_10, inference(rat,[],[s18,s2])).
% 0.11/0.28 cnf(s49, plain, ~spl7_1, inference(rat,[],[s41,s48])).
% 0.11/0.28 cnf(s50, plain, $false, inference(rat,[],[s1,s2,s49])).
% 0.11/0.28 thf(f787,plain,(
% 0.11/0.28 $false),
% 0.11/0.28 inference(avatar_sat_refutation,[],[s50])).
% 0.11/0.28 % SZS output end Proof for theBenchmark
% 0.11/0.28 % (855085)------------------------------
% 0.11/0.28 % (855085)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.28 % (855085)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.28 % (855085)CaDiCaL version: 2.1.3
% 0.11/0.28 % (855085)Termination reason: Refutation
% 0.11/0.28 % (855085)Time elapsed: 0.019 s
% 0.11/0.28 % (855085)Peak memory usage: 13 MB
% 0.11/0.28 % (855085)Instructions burned: 60 (million)
% 0.11/0.28 % (855077)Success in time 0.047 s
% 0.11/0.28 % Vampire exiting
%------------------------------------------------------------------------------