%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO266^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 : 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:49:38 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO266^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n011.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 16:42:31 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.21/0.28 % (325398)Will run a generic schedule for satisfiability detection.
% 0.21/0.28 % (325404)% WARNING: option uhcvi not known.
% 0.21/0.28 % (325404)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2600684078:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.28 % (325404)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.28 % (325404)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.21/0.28 % (325406)dis+10_1_sil=32000:sp=arity:random_seed=3533201009:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.28 % (325403)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1598768782_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.28 % (325405)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=945688085:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.28 % (325407)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2364942534:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.28 % Exception at run slice level
% 0.21/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.28 % (325407)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.28 % (325404) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-325398-325404"...
% 0.21/0.28 % (325408)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3770974696:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.28 % (325404)...printing done.
% 0.21/0.28 % (325404)Refutation found. Thanks to Tanya!
% 0.21/0.28 % SZS status Theorem for theBenchmark
% 0.21/0.28 % SZS output start Proof for theBenchmark
% 0.21/0.28 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.21/0.28 thf(func_def_0, type, cQ: ($i > $o)).
% 0.21/0.28 thf(func_def_1, type, cP: ($i > $o)).
% 0.21/0.28 thf(func_def_6, type, sK1: (($i > $o) > $i)).
% 0.21/0.28 thf(func_def_7, type, sK2: ($i > $o)).
% 0.21/0.28 thf(func_def_8, type, vNOT: ($o > $o)).
% 0.21/0.28 thf(func_def_10, type, db0: !>[X0: $tType]:(X0)).
% 0.21/0.28 thf(func_def_11, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.21/0.28 thf(f1,conjecture,(
% 0.21/0.28 ? [X0 : ($i > $o)] : ! [X1 : $i] : (((cQ @ X1) | ~(X0 @ X1)) & ((cP @ X1) | (X0 @ X1))) <=> ! [X2 : $i] : ((cQ @ X2) | (cP @ X2))),
% 0.21/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM44)).
% 0.21/0.28 thf(f2,negated_conjecture,(
% 0.21/0.28 ~(? [X0 : ($i > $o)] : ! [X1 : $i] : (((cQ @ X1) | ~(X0 @ X1)) & ((cP @ X1) | (X0 @ X1))) <=> ! [X2 : $i] : ((cQ @ X2) | (cP @ X2)))),
% 0.21/0.28 inference(negated_conjecture,[status(cth)],[f1])).
% 0.21/0.28 thf(f3,plain,(
% 0.21/0.28 ~(? [X0 : ($i > $o)] : ! [X1 : $i] : (((cQ @ X1) | ~(X0 @ X1)) & ((cP @ X1) | (X0 @ X1))) <=> ! [X2 : $i] : ((cQ @ X2) | (cP @ X2)))),
% 0.21/0.28 inference(rectify,[],[f2])).
% 0.21/0.28 thf(f4,plain,(
% 0.21/0.28 ~(? [X0 : ($i > $o)] : ! [X1 : $i] : (((((cQ @ X1)) = $true) | ~ (((X0 @ X1)) = $true)) & ((((cP @ X1)) = $true) | (((X0 @ X1)) = $true))) <=> ! [X2 : $i] : ((((cQ @ X2)) = $true) | (((cP @ X2)) = $true)))),
% 0.21/0.28 inference(fool_elimination,[],[f3])).
% 0.21/0.28 thf(f5,plain,(
% 0.21/0.28 ~(? [X0 : ($i > $o)] : ! [X1 : $i] : (((((cQ @ X1)) = $true) | (((X0 @ X1)) != $true)) & ((((cP @ X1)) = $true) | (((X0 @ X1)) = $true))) <=> ! [X2 : $i] : ((((cQ @ X2)) = $true) | (((cP @ X2)) = $true)))),
% 0.21/0.28 inference(flattening,[],[f4])).
% 0.21/0.28 thf(f6,plain,(
% 0.21/0.28 ? [X0 : ($i > $o)] : ! [X1 : $i] : (((((cQ @ X1)) = $true) | (((X0 @ X1)) != $true)) & ((((cP @ X1)) = $true) | (((X0 @ X1)) = $true))) <~> ! [X2 : $i] : ((((cQ @ X2)) = $true) | (((cP @ X2)) = $true))),
% 0.21/0.28 inference(ennf_transformation,[],[f5])).
% 0.21/0.28 thf(f7,plain,(
% 0.21/0.28 (? [X2 : $i] : ((((cQ @ X2)) != $true) & (((cP @ X2)) != $true)) | ! [X0 : ($i > $o)] : ? [X1 : $i] : (((((cQ @ X1)) != $true) & (((X0 @ X1)) = $true)) | ((((cP @ X1)) != $true) & (((X0 @ X1)) != $true)))) & (! [X2 : $i] : ((((cQ @ X2)) = $true) | (((cP @ X2)) = $true)) | ? [X0 : ($i > $o)] : ! [X1 : $i] : (((((cQ @ X1)) = $true) | (((X0 @ X1)) != $true)) & ((((cP @ X1)) = $true) | (((X0 @ X1)) = $true))))),
% 0.21/0.28 inference(nnf_transformation,[],[f6])).
% 0.21/0.28 thf(f8,plain,(
% 0.21/0.28 (? [X0 : $i] : (($true != ((cQ @ X0))) & ($true != ((cP @ X0)))) | ! [X1 : ($i > $o)] : ? [X2 : $i] : (((((cQ @ X2)) != $true) & ($true = ((X1 @ X2)))) | ((((cP @ X2)) != $true) & ($true != ((X1 @ X2)))))) & (! [X3 : $i] : (($true = ((cQ @ X3))) | ($true = ((cP @ X3)))) | ? [X4 : ($i > $o)] : ! [X5 : $i] : ((($true = ((cQ @ X5))) | ($true != ((X4 @ X5)))) & (($true = ((cP @ X5))) | ($true = ((X4 @ X5))))))),
% 0.21/0.28 inference(rectify,[],[f7])).
% 0.21/0.28 thf(f9,plain,(
% 0.21/0.28 ((($true != ((cQ @ sK0))) & ($true != ((cP @ sK0)))) | ! [X1 : ($i > $o)] : ((($true != ((cQ @ (sK1 @ X1)))) & ($true = ((X1 @ (sK1 @ X1))))) | (($true != ((cP @ (sK1 @ X1)))) & ($true != ((X1 @ (sK1 @ X1))))))) & (! [X3 : $i] : (($true = ((cQ @ X3))) | ($true = ((cP @ X3)))) | ! [X5 : $i] : ((($true = ((cQ @ X5))) | ($true != ((sK2 @ X5)))) & (($true = ((cP @ X5))) | ($true = ((sK2 @ X5))))))),
% 0.21/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP,sK2]),skolemize(X0,sK0),skolemize(X2,sK1 @ X1),skolemize(X4,sK2)],[f8])).
% 0.21/0.28 thf(f10,plain,(
% 0.21/0.28 ( ! [X3 : $i,X5 : $i] : (($true = ((cQ @ X3))) | ($true = ((cP @ X3))) | ($true = ((cP @ X5))) | ($true = ((sK2 @ X5)))) )),
% 0.21/0.28 inference(cnf_transformation,[],[f9])).
% 0.21/0.28 thf(f11,plain,(
% 0.21/0.28 ( ! [X3 : $i,X5 : $i] : (($true = ((cQ @ X3))) | ($true = ((cP @ X3))) | ($true = ((cQ @ X5))) | ($true != ((sK2 @ X5)))) )),
% 0.21/0.28 inference(cnf_transformation,[],[f9])).
% 0.21/0.28 thf(f13,plain,(
% 0.21/0.28 ( ! [X1 : ($i > $o)] : (($true != ((cP @ sK0))) | ($true = ((X1 @ (sK1 @ X1)))) | ($true != ((cP @ (sK1 @ X1))))) )),
% 0.21/0.28 inference(cnf_transformation,[],[f9])).
% 0.21/0.28 thf(f14,plain,(
% 0.21/0.28 ( ! [X1 : ($i > $o)] : (($true != ((cP @ sK0))) | ($true != ((cQ @ (sK1 @ X1)))) | ($true != ((X1 @ (sK1 @ X1))))) )),
% 0.21/0.28 inference(cnf_transformation,[],[f9])).
% 0.21/0.28 thf(f17,plain,(
% 0.21/0.28 ( ! [X1 : ($i > $o)] : (($true != ((cQ @ sK0))) | ($true = ((X1 @ (sK1 @ X1)))) | ($true != ((cP @ (sK1 @ X1))))) )),
% 0.21/0.28 inference(cnf_transformation,[],[f9])).
% 0.21/0.28 thf(f18,plain,(
% 0.21/0.28 ( ! [X1 : ($i > $o)] : (($true != ((cQ @ sK0))) | ($true != ((cQ @ (sK1 @ X1)))) | ($true != ((X1 @ (sK1 @ X1))))) )),
% 0.21/0.28 inference(cnf_transformation,[],[f9])).
% 0.21/0.28 thf(f23,definition,(
% 0.21/0.28 spl3_1 <=> ! [X5 : $i] : (($true = ((cP @ X5))) | ($true = ((sK2 @ X5))))),
% 0.21/0.28 introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition])).
% 0.21/0.28 thf(f24,plain,(
% 0.21/0.28 ( ! [X5 : $i] : (($true = ((sK2 @ X5))) | ($true = ((cP @ X5)))) ) | ~spl3_1),
% 0.21/0.28 inference(avatar_component_clause,[],[f23])).
% 0.21/0.28 thf(f26,definition,(
% 0.21/0.28 spl3_2 <=> ! [X3 : $i] : (($true = ((cQ @ X3))) | ($true = ((cP @ X3))))),
% 0.21/0.28 introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition])).
% 0.21/0.28 thf(f27,plain,(
% 0.21/0.28 ( ! [X3 : $i] : (($true = ((cP @ X3))) | ($true = ((cQ @ X3)))) ) | ~spl3_2),
% 0.21/0.28 inference(avatar_component_clause,[],[f26])).
% 0.21/0.28 thf(f28,plain,(
% 0.21/0.28 spl3_1 | spl3_2),
% 0.21/0.28 inference(avatar_split_clause,[],[f10,f26,f23])).
% 0.21/0.28 thf(f30,definition,(
% 0.21/0.28 spl3_3 <=> ! [X5 : $i] : (($true = ((cQ @ X5))) | ($true != ((sK2 @ X5))))),
% 0.21/0.28 introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition])).
% 0.21/0.28 thf(f31,plain,(
% 0.21/0.28 ( ! [X5 : $i] : (($true != ((sK2 @ X5))) | ($true = ((cQ @ X5)))) ) | ~spl3_3),
% 0.21/0.28 inference(avatar_component_clause,[],[f30])).
% 0.21/0.28 thf(f32,plain,(
% 0.21/0.28 spl3_3 | spl3_2),
% 0.21/0.28 inference(avatar_split_clause,[],[f11,f26,f30])).
% 0.21/0.28 thf(f34,definition,(
% 0.21/0.28 spl3_4 <=> ! [X1 : ($i > $o)] : (($true = ((X1 @ (sK1 @ X1)))) | ($true != ((cP @ (sK1 @ X1)))))),
% 0.21/0.28 introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition])).
% 0.21/0.28 thf(f35,plain,(
% 0.21/0.28 ( ! [X1 : ($i > $o)] : (($true != ((cP @ (sK1 @ X1)))) | ($true = ((X1 @ (sK1 @ X1))))) ) | ~spl3_4),
% 0.21/0.28 inference(avatar_component_clause,[],[f34])).
% 0.21/0.28 thf(f37,definition,(
% 0.21/0.28 spl3_5 <=> ($true = ((cP @ sK0)))),
% 0.21/0.28 introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition])).
% 0.21/0.28 thf(f39,plain,(
% 0.21/0.28 ($true != ((cP @ sK0))) | spl3_5),
% 0.21/0.28 inference(avatar_component_clause,[],[f37])).
% 0.21/0.28 thf(f40,plain,(
% 0.21/0.28 spl3_4 | ~spl3_5),
% 0.21/0.28 inference(avatar_split_clause,[],[f13,f37,f34])).
% 0.21/0.28 thf(f42,definition,(
% 0.21/0.28 spl3_6 <=> ! [X1 : ($i > $o)] : (($true != ((cQ @ (sK1 @ X1)))) | ($true != ((X1 @ (sK1 @ X1)))))),
% 0.21/0.28 introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition])).
% 0.21/0.28 thf(f43,plain,(
% 0.21/0.28 ( ! [X1 : ($i > $o)] : (($true != ((cQ @ (sK1 @ X1)))) | ($true != ((X1 @ (sK1 @ X1))))) ) | ~spl3_6),
% 0.21/0.28 inference(avatar_component_clause,[],[f42])).
% 0.21/0.28 thf(f44,plain,(
% 0.21/0.28 spl3_6 | ~spl3_5),
% 0.21/0.28 inference(avatar_split_clause,[],[f14,f37,f42])).
% 0.21/0.28 thf(f50,definition,(
% 0.21/0.28 spl3_8 <=> ($true = ((cQ @ sK0)))),
% 0.21/0.28 introduced(definition,[new_symbols(definition,[spl3_8])],[avatar_definition])).
% 0.21/0.28 thf(f53,plain,(
% 0.21/0.28 spl3_4 | ~spl3_8),
% 0.21/0.28 inference(avatar_split_clause,[],[f17,f50,f34])).
% 0.21/0.28 thf(f54,plain,(
% 0.21/0.28 spl3_6 | ~spl3_8),
% 0.21/0.28 inference(avatar_split_clause,[],[f18,f50,f42])).
% 0.21/0.28 thf(f56,plain,(
% 0.21/0.28 ($true != $true) | ($true = ((cQ @ sK0))) | (~spl3_2 | spl3_5)),
% 0.21/0.28 inference(constrained_superposition,[],[f39,f27])).
% 0.21/0.28 thf(f60,plain,(
% 0.21/0.28 ( ! [X0 : ($i > $o)] : (($true != $true) | ($true = ((X0 @ (sK1 @ X0)))) | ($true = ((cQ @ (sK1 @ X0))))) ) | (~spl3_2 | ~spl3_4)),
% 0.21/0.28 inference(constrained_superposition,[],[f35,f27])).
% 0.21/0.28 thf(f61,plain,(
% 0.21/0.28 ( ! [X0 : ($i > $o)] : (($true = ((X0 @ (sK1 @ X0)))) | ($true = ((cQ @ (sK1 @ X0))))) ) | (~spl3_2 | ~spl3_4)),
% 0.21/0.28 inference(trivial_inequality_removal,[],[f60])).
% 0.21/0.28 thf(f107,definition,(
% 0.21/0.28 spl3_9 <=> ($true = ((cQ @ (sK1 @ cQ))))),
% 0.21/0.28 introduced(definition,[new_symbols(definition,[spl3_9])],[avatar_definition])).
% 0.21/0.28 thf(f108,plain,(
% 0.21/0.28 ($true != ((cQ @ (sK1 @ cQ)))) | spl3_9),
% 0.21/0.28 inference(avatar_component_clause,[],[f107])).
% 0.21/0.28 thf(f109,plain,(
% 0.21/0.28 ($true = ((cQ @ (sK1 @ cQ)))) | ~spl3_9),
% 0.21/0.28 inference(avatar_component_clause,[],[f107])).
% 0.21/0.28 thf(f126,plain,(
% 0.21/0.28 ( ! [X0 : $i] : (($true != $true) | ($true = ((cQ @ X0))) | ($true = ((cP @ X0)))) ) | (~spl3_1 | ~spl3_3)),
% 0.21/0.28 inference(constrained_superposition,[],[f31,f24])).
% 0.21/0.28 thf(f127,plain,(
% 0.21/0.28 ( ! [X0 : $i] : (($true = ((cQ @ X0))) | ($true = ((cP @ X0)))) ) | (~spl3_1 | ~spl3_3)),
% 0.21/0.28 inference(trivial_inequality_removal,[],[f126])).
% 0.21/0.28 thf(f128,plain,(
% 0.21/0.28 spl3_2 | ~spl3_1 | ~spl3_3),
% 0.21/0.28 inference(avatar_split_clause,[],[f127,f30,f23,f26])).
% 0.21/0.28 thf(f129,plain,(
% 0.21/0.28 ($true = ((cQ @ sK0))) | (~spl3_2 | spl3_5)),
% 0.21/0.28 inference(trivial_inequality_removal,[],[f56])).
% 0.21/0.28 thf(f174,plain,(
% 0.21/0.28 spl3_8 | ~spl3_2 | spl3_5),
% 0.21/0.28 inference(avatar_split_clause,[],[f129,f37,f26,f50])).
% 0.21/0.28 thf(f619,plain,(
% 0.21/0.28 ($true != $true) | ($true != $true) | (~spl3_6 | ~spl3_9)),
% 0.21/0.28 inference(constrained_superposition,[],[f43,f109])).
% 0.21/0.28 thf(f626,plain,(
% 0.21/0.28 ($true != $true) | (~spl3_6 | ~spl3_9)),
% 0.21/0.28 inference(duplicate_literal_removal,[],[f619])).
% 0.21/0.28 thf(f627,plain,(
% 0.21/0.28 $false | (~spl3_6 | ~spl3_9)),
% 0.21/0.28 inference(trivial_inequality_removal,[],[f626])).
% 0.21/0.28 thf(f628,plain,(
% 0.21/0.28 ~spl3_6 | ~spl3_9),
% 0.21/0.28 inference(avatar_contradiction_clause,[],[f627])).
% 0.21/0.28 thf(f635,plain,(
% 0.21/0.28 ($true != $true) | ($true = ((cQ @ (sK1 @ (^[Y0 : $i]: (cQ @ ((^[Y1 : $i]: (Y1)) @ Y0))))))) | (~spl3_2 | ~spl3_4 | spl3_9)),
% 0.21/0.28 inference(constrained_superposition,[],[f108,f61])).
% 0.21/0.28 thf(f639,plain,(
% 0.21/0.28 ($true = ((cQ @ (sK1 @ (^[Y0 : $i]: (cQ @ ((^[Y1 : $i]: (Y1)) @ Y0))))))) | (~spl3_2 | ~spl3_4 | spl3_9)),
% 0.21/0.28 inference(trivial_inequality_removal,[],[f635])).
% 0.21/0.28 thf(f640,plain,(
% 0.21/0.28 ($true = ((cQ @ (sK1 @ cQ)))) | (~spl3_2 | ~spl3_4 | spl3_9)),
% 0.21/0.28 inference(beta-eta_normalization,[],[f639])).
% 0.21/0.28 thf(f646,plain,(
% 0.21/0.28 $false | (~spl3_2 | ~spl3_4 | spl3_9)),
% 0.21/0.28 inference(forward_subsumption_resolution,[],[f640,f108])).
% 0.21/0.28 thf(f647,plain,(
% 0.21/0.28 ~spl3_2 | ~spl3_4 | spl3_9),
% 0.21/0.28 inference(avatar_contradiction_clause,[],[f646])).
% 0.21/0.28 cnf(s1, plain, spl3_1 | spl3_2, inference(sat_conversion,[],[f28])).
% 0.21/0.28 cnf(s2, plain, spl3_2 | spl3_3, inference(sat_conversion,[],[f32])).
% 0.21/0.28 cnf(s3, plain, spl3_4 | ~spl3_5, inference(sat_conversion,[],[f40])).
% 0.21/0.28 cnf(s4, plain, ~spl3_5 | spl3_6, inference(sat_conversion,[],[f44])).
% 0.21/0.28 cnf(s6, plain, spl3_4 | ~spl3_8, inference(sat_conversion,[],[f53])).
% 0.21/0.28 cnf(s7, plain, spl3_6 | ~spl3_8, inference(sat_conversion,[],[f54])).
% 0.21/0.28 cnf(s13, plain, ~spl3_1 | spl3_2 | ~spl3_3, inference(sat_conversion,[],[f128])).
% 0.21/0.28 cnf(s14, plain, ~spl3_2 | spl3_5 | spl3_8, inference(sat_conversion,[],[f174])).
% 0.21/0.28 cnf(s53, plain, ~spl3_6 | ~spl3_9, inference(sat_conversion,[],[f628])).
% 0.21/0.28 cnf(s56, plain, ~spl3_2 | ~spl3_4 | spl3_9, inference(sat_conversion,[],[f647])).
% 0.21/0.28 cnf(s59, plain, spl3_4 | ~spl3_2, inference(rat,[],[s14,s3,s6])).
% 0.21/0.28 cnf(s60, plain, ~spl3_4 | ~spl3_2, inference(rat,[],[s14,s4,s7,s53,s56])).
% 0.21/0.28 cnf(s61, plain, ~spl3_2, inference(rat,[],[s60,s59])).
% 0.21/0.28 cnf(s62, plain, spl3_3, inference(rat,[],[s2,s61])).
% 0.21/0.28 cnf(s63, plain, spl3_1, inference(rat,[],[s1,s61])).
% 0.21/0.28 cnf(s65, plain, $false, inference(rat,[],[s13,s61,s63,s62])).
% 0.21/0.28 thf(f650,plain,(
% 0.21/0.28 $false),
% 0.21/0.28 inference(avatar_sat_refutation,[],[s65])).
% 0.21/0.28 % SZS output end Proof for theBenchmark
% 0.21/0.28 % (325404)------------------------------
% 0.21/0.28 % (325404)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (325404)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (325404)CaDiCaL version: 2.1.3
% 0.21/0.28 % (325404)Termination reason: Refutation
% 0.21/0.28 % (325404)Time elapsed: 0.011 s
% 0.21/0.28 % (325404)Peak memory usage: 13 MB
% 0.21/0.28 % (325404)Instructions burned: 35 (million)
% 0.21/0.28 % (325398)Success in time 0.041 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------