%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO266^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:47:19 AM UTC 2026
% Result : Theorem 0.09s 0.27s
% Output : Refutation 0.09s
% 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/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n003.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:44:14 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.27 % (2728226)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.09/0.27 % (2728231)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3675762535:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.09/0.27 % (2728231) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2728226-2728231"...
% 0.09/0.27 % (2728231)...printing done.
% 0.09/0.27 % (2728231)Refutation found. Thanks to Tanya!
% 0.09/0.27 % SZS status Theorem for theBenchmark
% 0.09/0.27 % SZS output start Proof for theBenchmark
% 0.09/0.27 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.09/0.27 thf(func_def_0, type, cQ: ($i > $o)).
% 0.09/0.27 thf(func_def_1, type, cP: ($i > $o)).
% 0.09/0.27 thf(func_def_6, type, sK1: (($i > $o) > $i)).
% 0.09/0.27 thf(func_def_7, type, sK2: ($i > $o)).
% 0.09/0.27 thf(func_def_8, type, vNOT: ($o > $o)).
% 0.09/0.27 thf(func_def_10, type, db0: !>[X0: $tType]:(X0)).
% 0.09/0.27 thf(func_def_11, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.09/0.27 thf(f1,conjecture,(
% 0.09/0.27 ! [X2 : $i] : ((cP @ X2) | (cQ @ X2)) <=> ? [X0 : ($i > $o)] : ! [X1 : $i] : (((X0 @ X1) | (cP @ X1)) & ((cQ @ X1) | ~(X0 @ X1)))),
% 0.09/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM44)).
% 0.09/0.27 thf(f2,negated_conjecture,(
% 0.09/0.27 ~(! [X2 : $i] : ((cP @ X2) | (cQ @ X2)) <=> ? [X0 : ($i > $o)] : ! [X1 : $i] : (((X0 @ X1) | (cP @ X1)) & ((cQ @ X1) | ~(X0 @ X1))))),
% 0.09/0.27 inference(negated_conjecture,[status(cth)],[f1])).
% 0.09/0.27 thf(f3,plain,(
% 0.09/0.27 ~(! [X0 : $i] : ((cP @ X0) | (cQ @ X0)) <=> ? [X1 : ($i > $o)] : ! [X2 : $i] : (((X1 @ X2) | (cP @ X2)) & ((cQ @ X2) | ~(X1 @ X2))))),
% 0.09/0.27 inference(rectify,[],[f2])).
% 0.09/0.27 thf(f4,plain,(
% 0.09/0.27 ~(! [X0 : $i] : ((((cP @ X0)) = $true) | ($true = ((cQ @ X0)))) <=> ? [X1 : ($i > $o)] : ! [X2 : $i] : (((((cP @ X2)) = $true) | ($true = ((X1 @ X2)))) & ((((cQ @ X2)) = $true) | ~ ($true = ((X1 @ X2))))))),
% 0.09/0.27 inference(fool_elimination,[],[f3])).
% 0.09/0.27 thf(f5,plain,(
% 0.09/0.27 ~(! [X0 : $i] : ((((cP @ X0)) = $true) | ($true = ((cQ @ X0)))) <=> ? [X1 : ($i > $o)] : ! [X2 : $i] : (((((cP @ X2)) = $true) | ($true = ((X1 @ X2)))) & (($true != ((X1 @ X2))) | (((cQ @ X2)) = $true))))),
% 0.09/0.27 inference(flattening,[],[f4])).
% 0.09/0.27 thf(f6,plain,(
% 0.09/0.27 ? [X1 : ($i > $o)] : ! [X2 : $i] : (((((cP @ X2)) = $true) | ($true = ((X1 @ X2)))) & (($true != ((X1 @ X2))) | (((cQ @ X2)) = $true))) <~> ! [X0 : $i] : ((((cP @ X0)) = $true) | ($true = ((cQ @ X0))))),
% 0.09/0.27 inference(ennf_transformation,[],[f5])).
% 0.09/0.27 thf(f7,plain,(
% 0.09/0.27 (? [X0 : $i] : ((((cP @ X0)) != $true) & ($true != ((cQ @ X0)))) | ! [X1 : ($i > $o)] : ? [X2 : $i] : (((((cP @ X2)) != $true) & ($true != ((X1 @ X2)))) | (($true = ((X1 @ X2))) & (((cQ @ X2)) != $true)))) & (! [X0 : $i] : ((((cP @ X0)) = $true) | ($true = ((cQ @ X0)))) | ? [X1 : ($i > $o)] : ! [X2 : $i] : (((((cP @ X2)) = $true) | ($true = ((X1 @ X2)))) & (($true != ((X1 @ X2))) | (((cQ @ X2)) = $true))))),
% 0.09/0.27 inference(nnf_transformation,[],[f6])).
% 0.09/0.27 thf(f8,plain,(
% 0.09/0.27 (? [X0 : $i] : ((((cP @ X0)) != $true) & ($true != ((cQ @ X0)))) | ! [X1 : ($i > $o)] : ? [X2 : $i] : (((((cP @ X2)) != $true) & ($true != ((X1 @ X2)))) | (($true = ((X1 @ X2))) & (((cQ @ X2)) != $true)))) & (! [X3 : $i] : (($true = ((cP @ X3))) | ($true = ((cQ @ X3)))) | ? [X4 : ($i > $o)] : ! [X5 : $i] : (((((cP @ X5)) = $true) | ($true = ((X4 @ X5)))) & (($true != ((X4 @ X5))) | ($true = ((cQ @ X5))))))),
% 0.09/0.27 inference(rectify,[],[f7])).
% 0.09/0.27 thf(f9,plain,(
% 0.09/0.27 ((($true != ((cP @ sK0))) & ($true != ((cQ @ sK0)))) | ! [X1 : ($i > $o)] : ((($true != ((cP @ (sK1 @ X1)))) & ($true != ((X1 @ (sK1 @ X1))))) | (($true = ((X1 @ (sK1 @ X1)))) & ($true != ((cQ @ (sK1 @ X1))))))) & (! [X3 : $i] : (($true = ((cP @ X3))) | ($true = ((cQ @ X3)))) | ! [X5 : $i] : (((((cP @ X5)) = $true) | (((sK2 @ X5)) = $true)) & ((((sK2 @ X5)) != $true) | ($true = ((cQ @ X5))))))),
% 0.09/0.27 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP,sK2]),skolemize(X0,sK0),skolemize(X2,sK1 @ X1),skolemize(X4,sK2)],[f8])).
% 0.09/0.27 thf(f10,plain,(
% 0.09/0.27 ( ! [X3 : $i,X5 : $i] : (($true = ((cQ @ X3))) | (((sK2 @ X5)) != $true) | ($true = ((cQ @ X5))) | ($true = ((cP @ X3)))) )),
% 0.09/0.27 inference(cnf_transformation,[],[f9])).
% 0.09/0.27 thf(f11,plain,(
% 0.09/0.27 ( ! [X3 : $i,X5 : $i] : (($true = ((cQ @ X3))) | (((cP @ X5)) = $true) | ($true = ((cP @ X3))) | (((sK2 @ X5)) = $true)) )),
% 0.09/0.28 inference(cnf_transformation,[],[f9])).
% 0.09/0.28 thf(f12,plain,(
% 0.09/0.28 ( ! [X1 : ($i > $o)] : (($true != ((cQ @ sK0))) | ($true != ((X1 @ (sK1 @ X1)))) | ($true != ((cQ @ (sK1 @ X1))))) )),
% 0.09/0.28 inference(cnf_transformation,[],[f9])).
% 0.09/0.28 thf(f14,plain,(
% 0.09/0.28 ( ! [X1 : ($i > $o)] : (($true != ((cP @ (sK1 @ X1)))) | ($true != ((cQ @ (sK1 @ X1)))) | ($true != ((cQ @ sK0)))) )),
% 0.09/0.28 inference(cnf_transformation,[],[f9])).
% 0.09/0.28 thf(f15,plain,(
% 0.09/0.28 ( ! [X1 : ($i > $o)] : (($true != ((cQ @ sK0))) | ($true = ((X1 @ (sK1 @ X1)))) | ($true != ((cP @ (sK1 @ X1))))) )),
% 0.09/0.28 inference(cnf_transformation,[],[f9])).
% 0.09/0.28 thf(f16,plain,(
% 0.09/0.28 ( ! [X1 : ($i > $o)] : (($true != ((X1 @ (sK1 @ X1)))) | ($true != ((cP @ sK0))) | ($true != ((cQ @ (sK1 @ X1))))) )),
% 0.09/0.28 inference(cnf_transformation,[],[f9])).
% 0.09/0.28 thf(f18,plain,(
% 0.09/0.28 ( ! [X1 : ($i > $o)] : (($true != ((cQ @ (sK1 @ X1)))) | ($true != ((cP @ (sK1 @ X1)))) | ($true != ((cP @ sK0)))) )),
% 0.09/0.28 inference(cnf_transformation,[],[f9])).
% 0.09/0.28 thf(f19,plain,(
% 0.09/0.28 ( ! [X1 : ($i > $o)] : (($true != ((cP @ (sK1 @ X1)))) | ($true = ((X1 @ (sK1 @ X1)))) | ($true != ((cP @ sK0)))) )),
% 0.09/0.28 inference(cnf_transformation,[],[f9])).
% 0.09/0.28 thf(f23,definition,(
% 0.09/0.28 spl3_1 <=> ! [X1 : ($i > $o)] : (($true != ((cP @ (sK1 @ X1)))) | ($true != ((cQ @ (sK1 @ X1)))))),
% 0.09/0.28 introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition])).
% 0.09/0.28 thf(f24,plain,(
% 0.09/0.28 ( ! [X1 : ($i > $o)] : (($true != ((cP @ (sK1 @ X1)))) | ($true != ((cQ @ (sK1 @ X1))))) ) | ~spl3_1),
% 0.09/0.28 inference(avatar_component_clause,[],[f23])).
% 0.09/0.28 thf(f26,definition,(
% 0.09/0.28 spl3_2 <=> ($true = ((cQ @ sK0)))),
% 0.09/0.28 introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition])).
% 0.09/0.28 thf(f28,plain,(
% 0.09/0.28 ($true != ((cQ @ sK0))) | spl3_2),
% 0.09/0.28 inference(avatar_component_clause,[],[f26])).
% 0.09/0.28 thf(f29,plain,(
% 0.09/0.28 spl3_1 | ~spl3_2),
% 0.09/0.28 inference(avatar_split_clause,[],[f14,f26,f23])).
% 0.09/0.28 thf(f31,definition,(
% 0.09/0.28 spl3_3 <=> ! [X1 : ($i > $o)] : (($true != ((X1 @ (sK1 @ X1)))) | ($true != ((cQ @ (sK1 @ X1)))))),
% 0.09/0.28 introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition])).
% 0.09/0.28 thf(f32,plain,(
% 0.09/0.28 ( ! [X1 : ($i > $o)] : (($true != ((cQ @ (sK1 @ X1)))) | ($true != ((X1 @ (sK1 @ X1))))) ) | ~spl3_3),
% 0.09/0.28 inference(avatar_component_clause,[],[f31])).
% 0.09/0.28 thf(f34,definition,(
% 0.09/0.28 spl3_4 <=> ($true = ((cP @ sK0)))),
% 0.09/0.28 introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition])).
% 0.09/0.28 thf(f36,plain,(
% 0.09/0.28 ($true != ((cP @ sK0))) | spl3_4),
% 0.09/0.28 inference(avatar_component_clause,[],[f34])).
% 0.09/0.28 thf(f37,plain,(
% 0.09/0.28 spl3_3 | ~spl3_4),
% 0.09/0.28 inference(avatar_split_clause,[],[f16,f34,f31])).
% 0.09/0.28 thf(f39,definition,(
% 0.09/0.28 spl3_5 <=> ! [X3 : $i] : (($true = ((cQ @ X3))) | ($true = ((cP @ X3))))),
% 0.09/0.28 introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition])).
% 0.09/0.28 thf(f40,plain,(
% 0.09/0.28 ( ! [X3 : $i] : (($true = ((cQ @ X3))) | ($true = ((cP @ X3)))) ) | ~spl3_5),
% 0.09/0.28 inference(avatar_component_clause,[],[f39])).
% 0.09/0.28 thf(f42,definition,(
% 0.09/0.28 spl3_6 <=> ! [X5 : $i] : ((((cP @ X5)) = $true) | (((sK2 @ X5)) = $true))),
% 0.09/0.28 introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition])).
% 0.09/0.28 thf(f43,plain,(
% 0.09/0.28 ( ! [X5 : $i] : ((((sK2 @ X5)) = $true) | (((cP @ X5)) = $true)) ) | ~spl3_6),
% 0.09/0.28 inference(avatar_component_clause,[],[f42])).
% 0.09/0.28 thf(f44,plain,(
% 0.09/0.28 spl3_5 | spl3_6),
% 0.09/0.28 inference(avatar_split_clause,[],[f11,f42,f39])).
% 0.09/0.28 thf(f45,plain,(
% 0.09/0.28 spl3_3 | ~spl3_2),
% 0.09/0.28 inference(avatar_split_clause,[],[f12,f26,f31])).
% 0.09/0.28 thf(f47,definition,(
% 0.09/0.28 spl3_7 <=> ! [X1 : ($i > $o)] : (($true != ((cP @ (sK1 @ X1)))) | ($true = ((X1 @ (sK1 @ X1)))))),
% 0.09/0.28 introduced(definition,[new_symbols(definition,[spl3_7])],[avatar_definition])).
% 0.09/0.28 thf(f48,plain,(
% 0.09/0.28 ( ! [X1 : ($i > $o)] : (($true != ((cP @ (sK1 @ X1)))) | ($true = ((X1 @ (sK1 @ X1))))) ) | ~spl3_7),
% 0.09/0.28 inference(avatar_component_clause,[],[f47])).
% 0.09/0.28 thf(f49,plain,(
% 0.09/0.28 ~spl3_4 | spl3_7),
% 0.09/0.28 inference(avatar_split_clause,[],[f19,f47,f34])).
% 0.09/0.28 thf(f50,plain,(
% 0.09/0.28 spl3_1 | ~spl3_4),
% 0.09/0.28 inference(avatar_split_clause,[],[f18,f34,f23])).
% 0.09/0.28 thf(f52,definition,(
% 0.09/0.28 spl3_8 <=> ! [X5 : $i] : ((((sK2 @ X5)) != $true) | ($true = ((cQ @ X5))))),
% 0.09/0.28 introduced(definition,[new_symbols(definition,[spl3_8])],[avatar_definition])).
% 0.09/0.28 thf(f53,plain,(
% 0.09/0.28 ( ! [X5 : $i] : ((((sK2 @ X5)) != $true) | ($true = ((cQ @ X5)))) ) | ~spl3_8),
% 0.09/0.28 inference(avatar_component_clause,[],[f52])).
% 0.09/0.28 thf(f54,plain,(
% 0.09/0.28 spl3_5 | spl3_8),
% 0.09/0.28 inference(avatar_split_clause,[],[f10,f52,f39])).
% 0.09/0.28 thf(f55,plain,(
% 0.09/0.28 spl3_7 | ~spl3_2),
% 0.09/0.28 inference(avatar_split_clause,[],[f15,f26,f47])).
% 0.09/0.28 thf(f56,plain,(
% 0.09/0.28 ($true = ((cP @ sK0))) | ($true != $true) | (spl3_2 | ~spl3_5)),
% 0.09/0.28 inference(constrained_superposition,[],[f28,f40])).
% 0.09/0.28 thf(f57,plain,(
% 0.09/0.28 ($true = ((cP @ sK0))) | (spl3_2 | ~spl3_5)),
% 0.09/0.28 inference(trivial_inequality_removal,[],[f56])).
% 0.09/0.28 thf(f58,plain,(
% 0.09/0.28 $false | (spl3_2 | spl3_4 | ~spl3_5)),
% 0.09/0.28 inference(forward_subsumption_resolution,[],[f57,f36])).
% 0.09/0.28 thf(f59,plain,(
% 0.09/0.28 spl3_2 | spl3_4 | ~spl3_5),
% 0.09/0.28 inference(avatar_contradiction_clause,[],[f58])).
% 0.09/0.28 thf(f60,plain,(
% 0.09/0.28 ( ! [X0 : $i] : (($true = ((cQ @ X0))) | ($true != $true) | (((cP @ X0)) = $true)) ) | (~spl3_6 | ~spl3_8)),
% 0.09/0.28 inference(constrained_superposition,[],[f53,f43])).
% 0.09/0.28 thf(f61,plain,(
% 0.09/0.28 ( ! [X0 : $i] : (($true = ((cQ @ X0))) | (((cP @ X0)) = $true)) ) | (~spl3_6 | ~spl3_8)),
% 0.09/0.28 inference(trivial_inequality_removal,[],[f60])).
% 0.09/0.28 thf(f62,plain,(
% 0.09/0.28 spl3_5 | ~spl3_6 | ~spl3_8),
% 0.09/0.28 inference(avatar_split_clause,[],[f61,f52,f42,f39])).
% 0.09/0.28 thf(f63,plain,(
% 0.09/0.28 ( ! [X0 : ($i > $o)] : (($true != $true) | (((cP @ (sK1 @ X0))) = $true) | ($true != ((X0 @ (sK1 @ X0))))) ) | (~spl3_3 | ~spl3_5)),
% 0.09/0.28 inference(constrained_superposition,[],[f32,f40])).
% 0.09/0.28 thf(f64,plain,(
% 0.09/0.28 ( ! [X0 : ($i > $o)] : (($true != ((X0 @ (sK1 @ X0)))) | (((cP @ (sK1 @ X0))) = $true)) ) | (~spl3_3 | ~spl3_5)),
% 0.09/0.28 inference(trivial_inequality_removal,[],[f63])).
% 0.09/0.28 thf(f70,plain,(
% 0.09/0.28 (((cP @ (sK1 @ cQ))) = $true) | (((cP @ (sK1 @ cQ))) = $true) | ($true != $true) | (~spl3_3 | ~spl3_5)),
% 0.09/0.28 inference(constrained_superposition,[],[f64,f40])).
% 0.09/0.28 thf(f72,plain,(
% 0.09/0.28 (((cP @ (sK1 @ cQ))) = $true) | ($true != $true) | (~spl3_3 | ~spl3_5)),
% 0.09/0.28 inference(duplicate_literal_removal,[],[f70])).
% 0.09/0.28 thf(f73,plain,(
% 0.09/0.28 (((cP @ (sK1 @ cQ))) = $true) | (~spl3_3 | ~spl3_5)),
% 0.09/0.28 inference(trivial_inequality_removal,[],[f72])).
% 0.09/0.28 thf(f82,plain,(
% 0.09/0.28 ($true != $true) | (((cQ @ (sK1 @ cQ))) = $true) | (~spl3_3 | ~spl3_5 | ~spl3_7)),
% 0.09/0.28 inference(constrained_superposition,[],[f48,f73])).
% 0.09/0.28 thf(f83,plain,(
% 0.09/0.28 ($true != $true) | (((cQ @ (sK1 @ cQ))) != $true) | (~spl3_1 | ~spl3_3 | ~spl3_5)),
% 0.09/0.28 inference(constrained_superposition,[],[f24,f73])).
% 0.09/0.28 thf(f84,plain,(
% 0.09/0.28 (((cQ @ (sK1 @ cQ))) = $true) | (~spl3_3 | ~spl3_5 | ~spl3_7)),
% 0.09/0.28 inference(trivial_inequality_removal,[],[f82])).
% 0.09/0.28 thf(f85,plain,(
% 0.09/0.28 (((cQ @ (sK1 @ cQ))) != $true) | (~spl3_1 | ~spl3_3 | ~spl3_5)),
% 0.09/0.28 inference(trivial_inequality_removal,[],[f83])).
% 0.09/0.28 thf(f86,plain,(
% 0.09/0.28 $false | (~spl3_1 | ~spl3_3 | ~spl3_5 | ~spl3_7)),
% 0.09/0.28 inference(forward_subsumption_resolution,[],[f85,f84])).
% 0.09/0.28 thf(f87,plain,(
% 0.09/0.28 ~spl3_1 | ~spl3_3 | ~spl3_5 | ~spl3_7),
% 0.09/0.28 inference(avatar_contradiction_clause,[],[f86])).
% 0.09/0.28 cnf(s1, plain, spl3_1 | ~spl3_2, inference(sat_conversion,[],[f29])).
% 0.09/0.28 cnf(s2, plain, spl3_3 | ~spl3_4, inference(sat_conversion,[],[f37])).
% 0.09/0.28 cnf(s3, plain, spl3_5 | spl3_6, inference(sat_conversion,[],[f44])).
% 0.09/0.28 cnf(s4, plain, ~spl3_2 | spl3_3, inference(sat_conversion,[],[f45])).
% 0.09/0.28 cnf(s5, plain, ~spl3_4 | spl3_7, inference(sat_conversion,[],[f49])).
% 0.09/0.28 cnf(s6, plain, spl3_1 | ~spl3_4, inference(sat_conversion,[],[f50])).
% 0.09/0.28 cnf(s7, plain, spl3_5 | spl3_8, inference(sat_conversion,[],[f54])).
% 0.09/0.28 cnf(s8, plain, ~spl3_2 | spl3_7, inference(sat_conversion,[],[f55])).
% 0.09/0.28 cnf(s9, plain, spl3_2 | spl3_4 | ~spl3_5, inference(sat_conversion,[],[f59])).
% 0.09/0.28 cnf(s10, plain, spl3_5 | ~spl3_6 | ~spl3_8, inference(sat_conversion,[],[f62])).
% 0.09/0.28 cnf(s11, plain, ~spl3_1 | ~spl3_3 | ~spl3_5 | ~spl3_7, inference(sat_conversion,[],[f87])).
% 0.09/0.28 cnf(s12, plain, spl3_5, inference(rat,[],[s10,s3,s7])).
% 0.09/0.28 cnf(s13, plain, spl3_1, inference(rat,[],[s9,s1,s6,s12])).
% 0.09/0.28 cnf(s14, plain, ~spl3_4, inference(rat,[],[s11,s2,s5,s12,s13])).
% 0.09/0.28 cnf(s15, plain, spl3_2, inference(rat,[],[s9,s12,s14])).
% 0.09/0.28 cnf(s16, plain, spl3_7, inference(rat,[],[s8,s15])).
% 0.09/0.28 cnf(s17, plain, spl3_3, inference(rat,[],[s4,s15])).
% 0.09/0.28 cnf(s18, plain, $false, inference(rat,[],[s11,s13,s12,s16,s17])).
% 0.09/0.28 thf(f88,plain,(
% 0.09/0.28 $false),
% 0.09/0.28 inference(avatar_sat_refutation,[],[s18])).
% 0.09/0.28 % SZS output end Proof for theBenchmark
% 0.09/0.28 % (2728231)------------------------------
% 0.09/0.28 % (2728231)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.28 % (2728231)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.28 % (2728231)CaDiCaL version: 2.1.3
% 0.09/0.28 % (2728231)Termination reason: Refutation
% 0.09/0.28 % (2728231)Time elapsed: 0.003 s
% 0.09/0.28 % (2728231)Peak memory usage: 13 MB
% 0.09/0.28 % (2728231)Instructions burned: 5 (million)
% 0.09/0.28 % (2728226)Success in time 0.036 s
% 0.09/0.28 % Vampire exiting
%------------------------------------------------------------------------------