%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN059^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 : n013.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:41:50 AM UTC 2026
% Result : Theorem 0.21s 0.26s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN059^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 : n013.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 16:14:06 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.21/0.26 % (2305353)Will run a generic schedule for satisfiability detection.
% 0.21/0.26 % (2305358)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1467730841_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.26 % Exception at run slice level
% 0.21/0.26 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.26 % (2305359)% WARNING: option uhcvi not known.
% 0.21/0.26 % (2305359)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=486899352:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.26 % (2305360)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3635092250:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.26 % (2305361)dis+10_1_sil=32000:sp=arity:random_seed=1838585172:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.26 % (2305363)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=725278716:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.26 % (2305362)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3331760863:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.26 % (2305359)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.26 % (2305362)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.26 % (2305359)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.21/0.26 % (2305363) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2305353-2305363"...
% 0.21/0.26 % (2305361) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2305353-2305361"...
% 0.21/0.26 % (2305359) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2305353-2305359"...
% 0.21/0.26 % (2305362) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2305353-2305362"...
% 0.21/0.26 % (2305363)...printing done.
% 0.21/0.26 % (2305363)Refutation found. Thanks to Tanya!
% 0.21/0.26 % SZS status Theorem for theBenchmark
% 0.21/0.26 % SZS output start Proof for theBenchmark
% 0.21/0.26 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.21/0.26 thf(func_def_0, type, cJ: ($i > $o)).
% 0.21/0.26 thf(func_def_1, type, cG: ($i > $o)).
% 0.21/0.26 thf(func_def_2, type, cH: ($i > $o)).
% 0.21/0.26 thf(func_def_3, type, cF: ($i > $o)).
% 0.21/0.26 thf(func_def_7, type, sP0: $o).
% 0.21/0.26 thf(f1,conjecture,(
% 0.21/0.26 (? [X0 : $i] : (cG @ X0) & ? [X0 : $i] : (cF @ X0)) => ((! [X0 : $i,X1 : $i] : (((cG @ X1) & (cF @ X0)) => ((cJ @ X1) & (cH @ X0))) => ! [X0 : $i] : ((cG @ X0) => (cJ @ X0))) & ((! [X0 : $i] : ((cG @ X0) => (cJ @ X0)) & ! [X0 : $i] : ((cF @ X0) => (cH @ X0))) => ! [X0 : $i,X1 : $i] : (((cG @ X1) & (cF @ X0)) => ((cJ @ X1) & (cH @ X0)))))),
% 0.21/0.26 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cPELL29)).
% 0.21/0.26 thf(f2,negated_conjecture,(
% 0.21/0.26 ~((? [X0 : $i] : (cG @ X0) & ? [X0 : $i] : (cF @ X0)) => ((! [X0 : $i,X1 : $i] : (((cG @ X1) & (cF @ X0)) => ((cJ @ X1) & (cH @ X0))) => ! [X0 : $i] : ((cG @ X0) => (cJ @ X0))) & ((! [X0 : $i] : ((cG @ X0) => (cJ @ X0)) & ! [X0 : $i] : ((cF @ X0) => (cH @ X0))) => ! [X0 : $i,X1 : $i] : (((cG @ X1) & (cF @ X0)) => ((cJ @ X1) & (cH @ X0))))))),
% 0.21/0.26 inference(negated_conjecture,[status(cth)],[f1])).
% 0.21/0.26 thf(f3,plain,(
% 0.21/0.26 ~((? [X0 : $i] : (cG @ X0) & ? [X1 : $i] : (cF @ X1)) => ((! [X2 : $i,X3 : $i] : (((cG @ X3) & (cF @ X2)) => ((cJ @ X3) & (cH @ X2))) => ! [X4 : $i] : ((cG @ X4) => (cJ @ X4))) & ((! [X5 : $i] : ((cG @ X5) => (cJ @ X5)) & ! [X6 : $i] : ((cF @ X6) => (cH @ X6))) => ! [X7 : $i,X8 : $i] : (((cG @ X8) & (cF @ X7)) => ((cJ @ X8) & (cH @ X7))))))),
% 0.21/0.26 inference(rectify,[],[f2])).
% 0.21/0.26 thf(f4,plain,(
% 0.21/0.26 ~((? [X0 : $i] : (((cG @ X0)) = $true) & ? [X1 : $i] : (((cF @ X1)) = $true)) => ((! [X2 : $i,X3 : $i] : (((((cG @ X3)) = $true) & (((cF @ X2)) = $true)) => ((((cJ @ X3)) = $true) & (((cH @ X2)) = $true))) => ! [X4 : $i] : ((((cG @ X4)) = $true) => (((cJ @ X4)) = $true))) & ((! [X5 : $i] : ((((cG @ X5)) = $true) => (((cJ @ X5)) = $true)) & ! [X6 : $i] : ((((cF @ X6)) = $true) => (((cH @ X6)) = $true))) => ! [X7 : $i,X8 : $i] : (((((cG @ X8)) = $true) & (((cF @ X7)) = $true)) => ((((cJ @ X8)) = $true) & (((cH @ X7)) = $true))))))),
% 0.21/0.26 inference(fool_elimination,[],[f3])).
% 0.21/0.26 thf(f5,plain,(
% 0.21/0.26 ((? [X4 : $i] : ((((cJ @ X4)) != $true) & (((cG @ X4)) = $true)) & ! [X2 : $i,X3 : $i] : (((((cJ @ X3)) = $true) & (((cH @ X2)) = $true)) | ((((cG @ X3)) != $true) | (((cF @ X2)) != $true)))) | (? [X7 : $i,X8 : $i] : (((((cJ @ X8)) != $true) | (((cH @ X7)) != $true)) & ((((cG @ X8)) = $true) & (((cF @ X7)) = $true))) & (! [X5 : $i] : ((((cJ @ X5)) = $true) | (((cG @ X5)) != $true)) & ! [X6 : $i] : ((((cH @ X6)) = $true) | (((cF @ X6)) != $true))))) & (? [X0 : $i] : (((cG @ X0)) = $true) & ? [X1 : $i] : (((cF @ X1)) = $true))),
% 0.21/0.26 inference(ennf_transformation,[],[f4])).
% 0.21/0.26 thf(f6,plain,(
% 0.21/0.26 ((? [X4 : $i] : ((((cJ @ X4)) != $true) & (((cG @ X4)) = $true)) & ! [X2 : $i,X3 : $i] : (((((cJ @ X3)) = $true) & (((cH @ X2)) = $true)) | (((cG @ X3)) != $true) | (((cF @ X2)) != $true))) | (? [X7 : $i,X8 : $i] : (((((cJ @ X8)) != $true) | (((cH @ X7)) != $true)) & (((cG @ X8)) = $true) & (((cF @ X7)) = $true)) & ! [X5 : $i] : ((((cJ @ X5)) = $true) | (((cG @ X5)) != $true)) & ! [X6 : $i] : ((((cH @ X6)) = $true) | (((cF @ X6)) != $true)))) & ? [X0 : $i] : (((cG @ X0)) = $true) & ? [X1 : $i] : (((cF @ X1)) = $true)),
% 0.21/0.26 inference(flattening,[],[f5])).
% 0.21/0.26 thf(f7,definition,(
% 0.21/0.26 (? [X7 : $i,X8 : $i] : (((((cJ @ X8)) != $true) | (((cH @ X7)) != $true)) & (((cG @ X8)) = $true) & (((cF @ X7)) = $true)) & ! [X5 : $i] : ((((cJ @ X5)) = $true) | (((cG @ X5)) != $true)) & ! [X6 : $i] : ((((cH @ X6)) = $true) | (((cF @ X6)) != $true))) | ~ ($true = sP0)),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[=])],[predicate_definition_introduction])).
% 0.21/0.26 thf(f8,plain,(
% 0.21/0.26 ((? [X4 : $i] : ((((cJ @ X4)) != $true) & (((cG @ X4)) = $true)) & ! [X2 : $i,X3 : $i] : (((((cJ @ X3)) = $true) & (((cH @ X2)) = $true)) | (((cG @ X3)) != $true) | (((cF @ X2)) != $true))) | ($true = sP0)) & ? [X0 : $i] : (((cG @ X0)) = $true) & ? [X1 : $i] : (((cF @ X1)) = $true)),
% 0.21/0.26 inference(definition_folding,[],[f6,f7])).
% 0.21/0.26 thf(f9,plain,(
% 0.21/0.26 (? [X7 : $i,X8 : $i] : (((((cJ @ X8)) != $true) | (((cH @ X7)) != $true)) & (((cG @ X8)) = $true) & (((cF @ X7)) = $true)) & ! [X5 : $i] : ((((cJ @ X5)) = $true) | (((cG @ X5)) != $true)) & ! [X6 : $i] : ((((cH @ X6)) = $true) | (((cF @ X6)) != $true))) | ($true != sP0)),
% 0.21/0.26 inference(nnf_transformation,[],[f7])).
% 0.21/0.26 thf(f10,plain,(
% 0.21/0.26 (? [X0 : $i,X1 : $i] : (((((cJ @ X1)) != $true) | (((cH @ X0)) != $true)) & (((cG @ X1)) = $true) & (((cF @ X0)) = $true)) & ! [X2 : $i] : (($true = ((cJ @ X2))) | ($true != ((cG @ X2)))) & ! [X3 : $i] : (($true = ((cH @ X3))) | ($true != ((cF @ X3))))) | ($true != sP0)),
% 0.21/0.26 inference(rectify,[],[f9])).
% 0.21/0.26 thf(f11,plain,(
% 0.21/0.26 (((($true != ((cJ @ sK2))) | ($true != ((cH @ sK1)))) & ($true = ((cG @ sK2))) & ($true = ((cF @ sK1)))) & ! [X2 : $i] : (($true = ((cJ @ X2))) | ($true != ((cG @ X2)))) & ! [X3 : $i] : (($true = ((cH @ X3))) | ($true != ((cF @ X3))))) | ($true != sP0)),
% 0.21/0.26 inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f10])).
% 0.21/0.26 thf(f12,plain,(
% 0.21/0.26 ((? [X0 : $i] : ((((cJ @ X0)) != $true) & (((cG @ X0)) = $true)) & ! [X1 : $i,X2 : $i] : ((($true = ((cJ @ X2))) & ($true = ((cH @ X1)))) | ($true != ((cG @ X2))) | (((cF @ X1)) != $true))) | ($true = sP0)) & ? [X3 : $i] : (((cG @ X3)) = $true) & ? [X4 : $i] : ($true = ((cF @ X4)))),
% 0.21/0.26 inference(rectify,[],[f8])).
% 0.21/0.26 thf(f13,plain,(
% 0.21/0.26 (((($true != ((cJ @ sK3))) & ($true = ((cG @ sK3)))) & ! [X1 : $i,X2 : $i] : ((($true = ((cJ @ X2))) & ($true = ((cH @ X1)))) | ($true != ((cG @ X2))) | (((cF @ X1)) != $true))) | ($true = sP0)) & ($true = ((cG @ sK4))) & ($true = ((cF @ sK5)))),
% 0.21/0.26 inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X0,sK3),skolemize(X3,sK4),skolemize(X4,sK5)],[f12])).
% 0.21/0.26 thf(f14,plain,(
% 0.21/0.26 ( ! [X3 : $i] : (($true = ((cH @ X3))) | ($true != ((cF @ X3))) | ($true != sP0)) )),
% 0.21/0.26 inference(cnf_transformation,[],[f11])).
% 0.21/0.26 thf(f15,plain,(
% 0.21/0.26 ( ! [X2 : $i] : (($true = ((cJ @ X2))) | ($true != ((cG @ X2))) | ($true != sP0)) )),
% 0.21/0.26 inference(cnf_transformation,[],[f11])).
% 0.21/0.26 thf(f16,plain,(
% 0.21/0.26 ($true = ((cF @ sK1))) | ($true != sP0)),
% 0.21/0.26 inference(cnf_transformation,[],[f11])).
% 0.21/0.26 thf(f17,plain,(
% 0.21/0.26 ($true = ((cG @ sK2))) | ($true != sP0)),
% 0.21/0.26 inference(cnf_transformation,[],[f11])).
% 0.21/0.26 thf(f18,plain,(
% 0.21/0.26 ($true != ((cJ @ sK2))) | ($true != ((cH @ sK1))) | ($true != sP0)),
% 0.21/0.26 inference(cnf_transformation,[],[f11])).
% 0.21/0.26 thf(f19,plain,(
% 0.21/0.26 ($true = ((cF @ sK5)))),
% 0.21/0.26 inference(cnf_transformation,[],[f13])).
% 0.21/0.26 thf(f22,plain,(
% 0.21/0.26 ( ! [X2 : $i,X1 : $i] : (($true = ((cJ @ X2))) | ($true != ((cG @ X2))) | (((cF @ X1)) != $true) | ($true = sP0)) )),
% 0.21/0.26 inference(cnf_transformation,[],[f13])).
% 0.21/0.26 thf(f23,plain,(
% 0.21/0.26 ($true = ((cG @ sK3))) | ($true = sP0)),
% 0.21/0.26 inference(cnf_transformation,[],[f13])).
% 0.21/0.26 thf(f24,plain,(
% 0.21/0.26 ($true != ((cJ @ sK3))) | ($true = sP0)),
% 0.21/0.26 inference(cnf_transformation,[],[f13])).
% 0.21/0.26 thf(f26,definition,(
% 0.21/0.26 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.21/0.26 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.21/0.26 thf(f28,definition,(
% 0.21/0.26 spl6_1 <=> ($true = sP0)),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition])).
% 0.21/0.26 thf(f35,definition,(
% 0.21/0.26 spl6_3 <=> ! [X1 : $i] : (($true = ((cH @ X1))) | (((cF @ X1)) != $true))),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition])).
% 0.21/0.26 thf(f36,plain,(
% 0.21/0.26 ( ! [X1 : $i] : ((((cF @ X1)) != $true) | ($true = ((cH @ X1)))) ) | ~spl6_3),
% 0.21/0.26 inference(avatar_component_clause,[],[f35])).
% 0.21/0.26 thf(f39,definition,(
% 0.21/0.26 spl6_4 <=> ! [X1 : $i] : (((cF @ X1)) != $true)),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition])).
% 0.21/0.26 thf(f40,plain,(
% 0.21/0.26 ( ! [X1 : $i] : ((((cF @ X1)) != $true)) ) | ~spl6_4),
% 0.21/0.26 inference(avatar_component_clause,[],[f39])).
% 0.21/0.26 thf(f42,definition,(
% 0.21/0.26 spl6_5 <=> ! [X2 : $i] : (($true = ((cJ @ X2))) | ($true != ((cG @ X2))))),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition])).
% 0.21/0.26 thf(f43,plain,(
% 0.21/0.26 ( ! [X2 : $i] : (($true != ((cG @ X2))) | ($true = ((cJ @ X2)))) ) | ~spl6_5),
% 0.21/0.26 inference(avatar_component_clause,[],[f42])).
% 0.21/0.26 thf(f44,plain,(
% 0.21/0.26 spl6_1 | spl6_4 | spl6_5),
% 0.21/0.26 inference(avatar_split_clause,[],[f22,f42,f39,f28])).
% 0.21/0.26 thf(f46,definition,(
% 0.21/0.26 spl6_6 <=> ($true = ((cG @ sK3)))),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition])).
% 0.21/0.26 thf(f48,plain,(
% 0.21/0.26 ($true = ((cG @ sK3))) | ~spl6_6),
% 0.21/0.26 inference(avatar_component_clause,[],[f46])).
% 0.21/0.26 thf(f49,plain,(
% 0.21/0.26 spl6_1 | spl6_6),
% 0.21/0.26 inference(avatar_split_clause,[],[f23,f46,f28])).
% 0.21/0.26 thf(f51,definition,(
% 0.21/0.26 spl6_7 <=> ($true = ((cJ @ sK3)))),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition])).
% 0.21/0.26 thf(f53,plain,(
% 0.21/0.26 ($true != ((cJ @ sK3))) | spl6_7),
% 0.21/0.26 inference(avatar_component_clause,[],[f51])).
% 0.21/0.26 thf(f54,plain,(
% 0.21/0.26 spl6_1 | ~spl6_7),
% 0.21/0.26 inference(avatar_split_clause,[],[f24,f51,f28])).
% 0.21/0.26 thf(f55,plain,(
% 0.21/0.26 ~spl6_1 | spl6_3),
% 0.21/0.26 inference(avatar_split_clause,[],[f14,f35,f28])).
% 0.21/0.26 thf(f56,plain,(
% 0.21/0.26 ~spl6_1 | spl6_5),
% 0.21/0.26 inference(avatar_split_clause,[],[f15,f42,f28])).
% 0.21/0.26 thf(f58,definition,(
% 0.21/0.26 spl6_8 <=> ($true = ((cF @ sK1)))),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[spl6_8])],[avatar_definition])).
% 0.21/0.26 thf(f60,plain,(
% 0.21/0.26 ($true = ((cF @ sK1))) | ~spl6_8),
% 0.21/0.26 inference(avatar_component_clause,[],[f58])).
% 0.21/0.26 thf(f61,plain,(
% 0.21/0.26 ~spl6_1 | spl6_8),
% 0.21/0.26 inference(avatar_split_clause,[],[f16,f58,f28])).
% 0.21/0.26 thf(f63,definition,(
% 0.21/0.26 spl6_9 <=> ($true = ((cG @ sK2)))),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[spl6_9])],[avatar_definition])).
% 0.21/0.26 thf(f65,plain,(
% 0.21/0.26 ($true = ((cG @ sK2))) | ~spl6_9),
% 0.21/0.26 inference(avatar_component_clause,[],[f63])).
% 0.21/0.26 thf(f66,plain,(
% 0.21/0.26 ~spl6_1 | spl6_9),
% 0.21/0.26 inference(avatar_split_clause,[],[f17,f63,f28])).
% 0.21/0.26 thf(f68,definition,(
% 0.21/0.26 spl6_10 <=> ($true = ((cH @ sK1)))),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[spl6_10])],[avatar_definition])).
% 0.21/0.26 thf(f72,definition,(
% 0.21/0.26 spl6_11 <=> ($true = ((cJ @ sK2)))),
% 0.21/0.26 introduced(definition,[new_symbols(definition,[spl6_11])],[avatar_definition])).
% 0.21/0.26 thf(f74,plain,(
% 0.21/0.26 ($true != ((cJ @ sK2))) | spl6_11),
% 0.21/0.26 inference(avatar_component_clause,[],[f72])).
% 0.21/0.26 thf(f75,plain,(
% 0.21/0.26 ~spl6_1 | ~spl6_10 | ~spl6_11),
% 0.21/0.26 inference(avatar_split_clause,[],[f18,f72,f68,f28])).
% 0.21/0.26 thf(f82,plain,(
% 0.21/0.26 ($true != $true) | ~spl6_4),
% 0.21/0.26 inference(constrained_superposition,[],[f40,f19])).
% 0.21/0.26 thf(f83,plain,(
% 0.21/0.26 $false | ~spl6_4),
% 0.21/0.26 inference(trivial_inequality_removal,[],[f82])).
% 0.21/0.26 thf(f84,plain,(
% 0.21/0.26 ~spl6_4),
% 0.21/0.26 inference(avatar_contradiction_clause,[],[f83])).
% 0.21/0.26 thf(f88,plain,(
% 0.21/0.26 ($true != $true) | ($true = ((cJ @ sK3))) | (~spl6_5 | ~spl6_6)),
% 0.21/0.26 inference(constrained_superposition,[],[f43,f48])).
% 0.21/0.26 thf(f89,plain,(
% 0.21/0.26 ($true = ((cJ @ sK3))) | (~spl6_5 | ~spl6_6)),
% 0.21/0.26 inference(trivial_inequality_removal,[],[f88])).
% 0.21/0.26 thf(f91,plain,(
% 0.21/0.26 $false | (~spl6_5 | ~spl6_6 | spl6_7)),
% 0.21/0.26 inference(forward_subsumption_resolution,[],[f89,f53])).
% 0.21/0.26 thf(f92,plain,(
% 0.21/0.26 ~spl6_5 | ~spl6_6 | spl6_7),
% 0.21/0.26 inference(avatar_contradiction_clause,[],[f91])).
% 0.21/0.26 thf(f95,plain,(
% 0.21/0.26 ( ! [X0 : $i] : (($true != $true) | (((cJ @ X0)) = $true) | (((cG @ X0)) = $false)) ) | ~spl6_5),
% 0.21/0.26 inference(constrained_superposition,[],[f43,f26])).
% 0.21/0.26 thf(f99,plain,(
% 0.21/0.26 ( ! [X0 : $i] : ((((cG @ X0)) = $false) | (((cJ @ X0)) = $true)) ) | ~spl6_5),
% 0.21/0.26 inference(trivial_inequality_removal,[],[f95])).
% 0.21/0.26 thf(f114,plain,(
% 0.21/0.26 ($true != $true) | ($true = ((cH @ sK1))) | (~spl6_3 | ~spl6_8)),
% 0.21/0.26 inference(constrained_superposition,[],[f36,f60])).
% 0.21/0.26 thf(f115,plain,(
% 0.21/0.26 ($true = ((cH @ sK1))) | (~spl6_3 | ~spl6_8)),
% 0.21/0.26 inference(trivial_inequality_removal,[],[f114])).
% 0.21/0.26 thf(f118,plain,(
% 0.21/0.26 spl6_10 | ~spl6_3 | ~spl6_8),
% 0.21/0.26 inference(avatar_split_clause,[],[f115,f58,f35,f68])).
% 0.21/0.26 thf(f131,plain,(
% 0.21/0.26 ($true = $false) | ($true = ((cJ @ sK2))) | (~spl6_5 | ~spl6_9)),
% 0.21/0.26 inference(constrained_superposition,[],[f65,f99])).
% 0.21/0.26 thf(f136,plain,(
% 0.21/0.26 ($true = ((cJ @ sK2))) | (~spl6_5 | ~spl6_9)),
% 0.21/0.26 inference(trivial_inequality_removal,[],[f131])).
% 0.21/0.26 thf(f141,plain,(
% 0.21/0.26 $false | (~spl6_5 | ~spl6_9 | spl6_11)),
% 0.21/0.26 inference(forward_subsumption_resolution,[],[f136,f74])).
% 0.21/0.26 thf(f142,plain,(
% 0.21/0.26 ~spl6_5 | ~spl6_9 | spl6_11),
% 0.21/0.26 inference(avatar_contradiction_clause,[],[f141])).
% 0.21/0.26 cnf(s2, plain, spl6_1 | spl6_4 | spl6_5, inference(sat_conversion,[],[f44])).
% 0.21/0.26 cnf(s3, plain, spl6_1 | spl6_6, inference(sat_conversion,[],[f49])).
% 0.21/0.26 cnf(s4, plain, spl6_1 | ~spl6_7, inference(sat_conversion,[],[f54])).
% 0.21/0.26 cnf(s5, plain, ~spl6_1 | spl6_3, inference(sat_conversion,[],[f55])).
% 0.21/0.26 cnf(s6, plain, ~spl6_1 | spl6_5, inference(sat_conversion,[],[f56])).
% 0.21/0.26 cnf(s7, plain, ~spl6_1 | spl6_8, inference(sat_conversion,[],[f61])).
% 0.21/0.26 cnf(s8, plain, ~spl6_1 | spl6_9, inference(sat_conversion,[],[f66])).
% 0.21/0.26 cnf(s9, plain, ~spl6_1 | ~spl6_10 | ~spl6_11, inference(sat_conversion,[],[f75])).
% 0.21/0.26 cnf(s13, plain, ~spl6_4, inference(sat_conversion,[],[f84])).
% 0.21/0.26 cnf(s14, plain, ~spl6_5 | ~spl6_6 | spl6_7, inference(sat_conversion,[],[f92])).
% 0.21/0.26 cnf(s15, plain, ~spl6_3 | ~spl6_8 | spl6_10, inference(sat_conversion,[],[f118])).
% 0.21/0.26 cnf(s20, plain, ~spl6_5 | ~spl6_9 | spl6_11, inference(sat_conversion,[],[f142])).
% 0.21/0.26 cnf(s21, plain, spl6_1 | spl6_5, inference(rat,[],[s2,s13])).
% 0.21/0.26 cnf(s22, plain, spl6_1, inference(rat,[],[s14,s21,s3,s4])).
% 0.21/0.26 cnf(s23, plain, spl6_9, inference(rat,[],[s8,s22])).
% 0.21/0.26 cnf(s24, plain, spl6_8, inference(rat,[],[s7,s22])).
% 0.21/0.26 cnf(s25, plain, spl6_5, inference(rat,[],[s6,s22])).
% 0.21/0.26 cnf(s26, plain, spl6_3, inference(rat,[],[s5,s22])).
% 0.21/0.26 cnf(s28, plain, spl6_11, inference(rat,[],[s20,s23,s25])).
% 0.21/0.26 cnf(s29, plain, spl6_10, inference(rat,[],[s15,s24,s26])).
% 0.21/0.26 cnf(s30, plain, $false, inference(rat,[],[s9,s22,s28,s29])).
% 0.21/0.26 thf(f143,plain,(
% 0.21/0.26 $false),
% 0.21/0.26 inference(avatar_sat_refutation,[],[s30])).
% 0.21/0.26 % SZS output end Proof for theBenchmark
% 0.21/0.26 % (2305363)------------------------------
% 0.21/0.26 % (2305363)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.26 % (2305363)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.26 % (2305363)CaDiCaL version: 2.1.3
% 0.21/0.26 % (2305363)Termination reason: Refutation
% 0.21/0.26 % (2305363)Time elapsed: 0.003 s
% 0.21/0.26 % (2305363)Peak memory usage: 13 MB
% 0.21/0.26 % (2305363)Instructions burned: 7 (million)
% 0.21/0.26 % (2305353)Success in time 0.045 s
% 0.21/0.26 % Vampire exiting
%------------------------------------------------------------------------------