%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN374^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 : 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:41:51 AM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : Refutation 0.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN374^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.07/0.18 % Computer : n003.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 16:17:14 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/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.07/0.25 % (2690631)Will run a generic schedule for satisfiability detection.
% 0.07/0.25 % (2690641)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1884838273:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.25 % (2690641) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2690631-2690641"...
% 0.07/0.25 % (2690637)% WARNING: option uhcvi not known.
% 0.07/0.25 % (2690641)...printing done.
% 0.07/0.25 % (2690641)Refutation found. Thanks to Tanya!
% 0.07/0.25 % SZS status Theorem for theBenchmark
% 0.07/0.25 % SZS output start Proof for theBenchmark
% 0.07/0.25 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.07/0.25 thf(func_def_0, type, cP: ($i > $o)).
% 0.07/0.25 thf(func_def_6, type, sK2: ($i > $i)).
% 0.07/0.25 thf(f1,conjecture,(
% 0.07/0.25 ? [X0 : $i] : ! [X1 : $i] : ((cP @ X0) <=> (cP @ X1)) <=> (? [X0 : $i] : (cP @ X0) <=> ! [X1 : $i] : (cP @ X1))),
% 0.07/0.25 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX2125)).
% 0.07/0.25 thf(f2,negated_conjecture,(
% 0.07/0.25 ~(? [X0 : $i] : ! [X1 : $i] : ((cP @ X0) <=> (cP @ X1)) <=> (? [X0 : $i] : (cP @ X0) <=> ! [X1 : $i] : (cP @ X1)))),
% 0.07/0.25 inference(negated_conjecture,[status(cth)],[f1])).
% 0.07/0.25 thf(f3,plain,(
% 0.07/0.25 ~(? [X0 : $i] : ! [X1 : $i] : ((cP @ X0) <=> (cP @ X1)) <=> (? [X2 : $i] : (cP @ X2) <=> ! [X3 : $i] : (cP @ X3)))),
% 0.07/0.25 inference(rectify,[],[f2])).
% 0.07/0.25 thf(f4,plain,(
% 0.07/0.25 ~(? [X0 : $i] : ! [X1 : $i] : (((cP @ X0)) = ((cP @ X1))) <=> (? [X2 : $i] : (((cP @ X2)) = $true) <=> ! [X3 : $i] : (((cP @ X3)) = $true)))),
% 0.07/0.25 inference(fool_elimination,[],[f3])).
% 0.07/0.25 thf(f5,plain,(
% 0.07/0.25 ? [X0 : $i] : ! [X1 : $i] : (((cP @ X0)) = ((cP @ X1))) <~> (? [X2 : $i] : (((cP @ X2)) = $true) <=> ! [X3 : $i] : (((cP @ X3)) = $true))),
% 0.07/0.25 inference(ennf_transformation,[],[f4])).
% 0.07/0.25 thf(f6,plain,(
% 0.07/0.25 (((? [X3 : $i] : (((cP @ X3)) != $true) | ! [X2 : $i] : (((cP @ X2)) != $true)) & (! [X3 : $i] : (((cP @ X3)) = $true) | ? [X2 : $i] : (((cP @ X2)) = $true))) | ! [X0 : $i] : ? [X1 : $i] : (((cP @ X0)) != ((cP @ X1)))) & (((? [X2 : $i] : (((cP @ X2)) = $true) | ? [X3 : $i] : (((cP @ X3)) != $true)) & (! [X3 : $i] : (((cP @ X3)) = $true) | ! [X2 : $i] : (((cP @ X2)) != $true))) | ? [X0 : $i] : ! [X1 : $i] : (((cP @ X0)) = ((cP @ X1))))),
% 0.07/0.25 inference(nnf_transformation,[],[f5])).
% 0.07/0.25 thf(f7,plain,(
% 0.07/0.25 (((? [X0 : $i] : (((cP @ X0)) != $true) | ! [X1 : $i] : (((cP @ X1)) != $true)) & (! [X2 : $i] : (((cP @ X2)) = $true) | ? [X3 : $i] : (((cP @ X3)) = $true))) | ! [X4 : $i] : ? [X5 : $i] : (((cP @ X4)) != ((cP @ X5)))) & (((? [X6 : $i] : ($true = ((cP @ X6))) | ? [X7 : $i] : ($true != ((cP @ X7)))) & (! [X8 : $i] : ($true = ((cP @ X8))) | ! [X9 : $i] : ($true != ((cP @ X9))))) | ? [X10 : $i] : ! [X11 : $i] : (((cP @ X10)) = ((cP @ X11))))),
% 0.07/0.25 inference(rectify,[],[f6])).
% 0.07/0.25 thf(f8,plain,(
% 0.07/0.25 (((($true != ((cP @ sK0))) | ! [X1 : $i] : (((cP @ X1)) != $true)) & (! [X2 : $i] : (((cP @ X2)) = $true) | ($true = ((cP @ sK1))))) | ! [X4 : $i] : (((cP @ X4)) != ((cP @ (sK2 @ X4))))) & (((($true = ((cP @ sK3))) | ($true != ((cP @ sK4)))) & (! [X8 : $i] : ($true = ((cP @ X8))) | ! [X9 : $i] : ($true != ((cP @ X9))))) | ! [X11 : $i] : (((cP @ X11)) = ((cP @ sK5))))),
% 0.07/0.25 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,vAPP,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X3,sK1),skolemize(X5,sK2 @ X4),skolemize(X6,sK3),skolemize(X7,sK4),skolemize(X10,sK5)],[f7])).
% 0.07/0.25 thf(f9,plain,(
% 0.07/0.25 ( ! [X11 : $i,X8 : $i,X9 : $i] : (($true = ((cP @ X8))) | ($true != ((cP @ X9))) | (((cP @ X11)) = ((cP @ sK5)))) )),
% 0.07/0.25 inference(cnf_transformation,[],[f8])).
% 0.07/0.25 thf(f11,plain,(
% 0.07/0.25 ( ! [X2 : $i,X4 : $i] : ((((cP @ X2)) = $true) | ($true = ((cP @ sK1))) | (((cP @ X4)) != ((cP @ (sK2 @ X4))))) )),
% 0.07/0.25 inference(cnf_transformation,[],[f8])).
% 0.07/0.25 thf(f12,plain,(
% 0.07/0.25 ( ! [X1 : $i,X4 : $i] : (($true != ((cP @ sK0))) | (((cP @ X1)) != $true) | (((cP @ X4)) != ((cP @ (sK2 @ X4))))) )),
% 0.07/0.25 inference(cnf_transformation,[],[f8])).
% 0.07/0.25 thf(f15,plain,(
% 0.07/0.25 ( ! [X11 : $i,X8 : $i,X9 : $i] : (($true = ((cP @ X8))) | ($true != ((cP @ X9))) | ($true = ((cP @ X11))) | (((cP @ sK5)) = $false)) )),
% 0.07/0.25 inference(iff_proxy_clausification,[],[f9])).
% 0.07/0.25 thf(f16,plain,(
% 0.07/0.25 ( ! [X11 : $i,X8 : $i,X9 : $i] : (($true = ((cP @ X8))) | ($true != ((cP @ X9))) | (((cP @ X11)) = $false) | ($true = ((cP @ sK5)))) )),
% 0.07/0.25 inference(iff_proxy_clausification,[],[f9])).
% 0.07/0.25 thf(f19,plain,(
% 0.07/0.25 ( ! [X2 : $i,X4 : $i] : ((((cP @ X2)) = $true) | ($true = ((cP @ sK1))) | ($true = ((cP @ X4))) | ($true = ((cP @ (sK2 @ X4))))) )),
% 0.07/0.25 inference(xor_proxy_clausification,[],[f11])).
% 0.07/0.25 thf(f22,plain,(
% 0.07/0.25 ( ! [X1 : $i,X4 : $i] : (($true != ((cP @ sK0))) | (((cP @ X1)) != $true) | (((cP @ X4)) = $false) | (((cP @ (sK2 @ X4))) = $false)) )),
% 0.07/0.25 inference(xor_proxy_clausification,[],[f12])).
% 0.07/0.25 thf(f24,definition,(
% 0.07/0.25 spl6_1 <=> ($true = ((cP @ sK5)))),
% 0.07/0.25 introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition])).
% 0.07/0.25 thf(f25,plain,(
% 0.07/0.25 ($true != ((cP @ sK5))) | spl6_1),
% 0.07/0.25 inference(avatar_component_clause,[],[f24])).
% 0.07/0.25 thf(f26,plain,(
% 0.07/0.25 ($true = ((cP @ sK5))) | ~spl6_1),
% 0.07/0.25 inference(avatar_component_clause,[],[f24])).
% 0.07/0.25 thf(f28,definition,(
% 0.07/0.25 spl6_2 <=> ! [X11 : $i] : (((cP @ X11)) = $false)),
% 0.07/0.25 introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition])).
% 0.07/0.25 thf(f29,plain,(
% 0.07/0.25 ( ! [X11 : $i] : ((((cP @ X11)) = $false)) ) | ~spl6_2),
% 0.07/0.25 inference(avatar_component_clause,[],[f28])).
% 0.07/0.25 thf(f31,definition,(
% 0.07/0.25 spl6_3 <=> ! [X9 : $i] : ($true != ((cP @ X9)))),
% 0.07/0.25 introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition])).
% 0.07/0.25 thf(f32,plain,(
% 0.07/0.25 ( ! [X9 : $i] : (($true != ((cP @ X9)))) ) | ~spl6_3),
% 0.07/0.25 inference(avatar_component_clause,[],[f31])).
% 0.07/0.25 thf(f34,definition,(
% 0.07/0.25 spl6_4 <=> ! [X8 : $i] : ($true = ((cP @ X8)))),
% 0.07/0.25 introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition])).
% 0.07/0.25 thf(f35,plain,(
% 0.07/0.25 ( ! [X8 : $i] : (($true = ((cP @ X8)))) ) | ~spl6_4),
% 0.07/0.25 inference(avatar_component_clause,[],[f34])).
% 0.07/0.25 thf(f36,plain,(
% 0.07/0.25 spl6_1 | spl6_2 | spl6_3 | spl6_4),
% 0.07/0.25 inference(avatar_split_clause,[],[f16,f34,f31,f28,f24])).
% 0.07/0.25 thf(f38,definition,(
% 0.07/0.25 spl6_5 <=> (((cP @ sK5)) = $false)),
% 0.07/0.25 introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition])).
% 0.07/0.25 thf(f40,plain,(
% 0.07/0.25 (((cP @ sK5)) = $false) | ~spl6_5),
% 0.07/0.25 inference(avatar_component_clause,[],[f38])).
% 0.07/0.25 thf(f41,plain,(
% 0.07/0.25 spl6_5 | spl6_4 | spl6_3 | spl6_4),
% 0.07/0.25 inference(avatar_split_clause,[],[f15,f34,f31,f34,f38])).
% 0.07/0.25 thf(f53,definition,(
% 0.07/0.25 spl6_8 <=> ! [X4 : $i] : ((((cP @ X4)) = $false) | (((cP @ (sK2 @ X4))) = $false))),
% 0.07/0.25 introduced(definition,[new_symbols(definition,[spl6_8])],[avatar_definition])).
% 0.07/0.25 thf(f54,plain,(
% 0.07/0.25 ( ! [X4 : $i] : ((((cP @ (sK2 @ X4))) = $false) | (((cP @ X4)) = $false)) ) | ~spl6_8),
% 0.07/0.25 inference(avatar_component_clause,[],[f53])).
% 0.07/0.25 thf(f56,definition,(
% 0.07/0.25 spl6_9 <=> ($true = ((cP @ sK1)))),
% 0.07/0.25 introduced(definition,[new_symbols(definition,[spl6_9])],[avatar_definition])).
% 0.07/0.25 thf(f57,plain,(
% 0.07/0.25 ($true != ((cP @ sK1))) | spl6_9),
% 0.07/0.25 inference(avatar_component_clause,[],[f56])).
% 0.07/0.25 thf(f58,plain,(
% 0.07/0.25 ($true = ((cP @ sK1))) | ~spl6_9),
% 0.07/0.25 inference(avatar_component_clause,[],[f56])).
% 0.07/0.25 thf(f61,definition,(
% 0.07/0.25 spl6_10 <=> ! [X4 : $i] : (($true = ((cP @ X4))) | ($true = ((cP @ (sK2 @ X4)))))),
% 0.07/0.25 introduced(definition,[new_symbols(definition,[spl6_10])],[avatar_definition])).
% 0.07/0.25 thf(f62,plain,(
% 0.07/0.25 ( ! [X4 : $i] : (($true = ((cP @ (sK2 @ X4)))) | ($true = ((cP @ X4)))) ) | ~spl6_10),
% 0.07/0.25 inference(avatar_component_clause,[],[f61])).
% 0.07/0.25 thf(f63,plain,(
% 0.07/0.25 spl6_10 | spl6_9 | spl6_4),
% 0.07/0.25 inference(avatar_split_clause,[],[f19,f34,f56,f61])).
% 0.07/0.25 thf(f65,definition,(
% 0.07/0.25 spl6_11 <=> ($true = ((cP @ sK0)))),
% 0.07/0.25 introduced(definition,[new_symbols(definition,[spl6_11])],[avatar_definition])).
% 0.07/0.25 thf(f67,plain,(
% 0.07/0.25 ($true != ((cP @ sK0))) | spl6_11),
% 0.07/0.25 inference(avatar_component_clause,[],[f65])).
% 0.07/0.25 thf(f68,plain,(
% 0.07/0.25 spl6_8 | spl6_3 | ~spl6_11),
% 0.07/0.25 inference(avatar_split_clause,[],[f22,f65,f31,f53])).
% 0.07/0.25 thf(f72,plain,(
% 0.07/0.25 $false | (~spl6_4 | spl6_11)),
% 0.07/0.25 inference(forward_subsumption_resolution,[],[f67,f35])).
% 0.07/0.25 thf(f73,plain,(
% 0.07/0.25 ~spl6_4 | spl6_11),
% 0.07/0.25 inference(avatar_contradiction_clause,[],[f72])).
% 0.07/0.25 thf(f74,plain,(
% 0.07/0.25 $false | (~spl6_3 | ~spl6_9)),
% 0.07/0.25 inference(forward_subsumption_resolution,[],[f58,f32])).
% 0.07/0.25 thf(f75,plain,(
% 0.07/0.25 ~spl6_3 | ~spl6_9),
% 0.07/0.25 inference(avatar_contradiction_clause,[],[f74])).
% 0.07/0.25 thf(f76,plain,(
% 0.07/0.25 ( ! [X4 : $i] : (($true = ((cP @ (sK2 @ X4))))) ) | (~spl6_3 | ~spl6_10)),
% 0.07/0.25 inference(forward_subsumption_resolution,[],[f62,f32])).
% 0.07/0.25 thf(f77,plain,(
% 0.07/0.25 $false | (~spl6_3 | ~spl6_10)),
% 0.07/0.25 inference(forward_subsumption_resolution,[],[f76,f32])).
% 0.07/0.25 thf(f78,plain,(
% 0.07/0.25 ~spl6_3 | ~spl6_10),
% 0.07/0.25 inference(avatar_contradiction_clause,[],[f77])).
% 0.07/0.25 thf(f79,plain,(
% 0.07/0.25 ($true = $false) | (~spl6_2 | ~spl6_9)),
% 0.07/0.25 inference(forward_demodulation,[],[f58,f29])).
% 0.07/0.25 thf(f80,plain,(
% 0.07/0.25 $false | (~spl6_2 | ~spl6_9)),
% 0.07/0.25 inference(trivial_inequality_removal,[],[f79])).
% 0.07/0.25 thf(f81,plain,(
% 0.07/0.25 ~spl6_2 | ~spl6_9),
% 0.07/0.25 inference(avatar_contradiction_clause,[],[f80])).
% 0.07/0.25 thf(f84,plain,(
% 0.07/0.25 ($true = $false) | (~spl6_1 | ~spl6_5)),
% 0.07/0.25 inference(constrained_superposition,[],[f40,f26])).
% 0.07/0.25 thf(f88,plain,(
% 0.07/0.25 $false | (~spl6_1 | ~spl6_5)),
% 0.07/0.25 inference(trivial_inequality_removal,[],[f84])).
% 0.07/0.25 thf(f89,plain,(
% 0.07/0.25 ~spl6_1 | ~spl6_5),
% 0.07/0.25 inference(avatar_contradiction_clause,[],[f88])).
% 0.07/0.25 thf(f91,plain,(
% 0.07/0.25 $false | (~spl6_3 | ~spl6_4)),
% 0.07/0.25 inference(forward_subsumption_resolution,[],[f35,f32])).
% 0.07/0.25 thf(f92,plain,(
% 0.07/0.25 ~spl6_3 | ~spl6_4),
% 0.07/0.25 inference(avatar_contradiction_clause,[],[f91])).
% 0.07/0.25 thf(f99,plain,(
% 0.07/0.25 $false | (~spl6_4 | spl6_9)),
% 0.07/0.25 inference(forward_subsumption_resolution,[],[f57,f35])).
% 0.07/0.25 thf(f100,plain,(
% 0.07/0.25 ~spl6_4 | spl6_9),
% 0.07/0.25 inference(avatar_contradiction_clause,[],[f99])).
% 0.07/0.25 thf(f117,plain,(
% 0.07/0.25 $false | (spl6_1 | ~spl6_4)),
% 0.07/0.25 inference(forward_subsumption_resolution,[],[f25,f35])).
% 0.07/0.25 thf(f118,plain,(
% 0.07/0.25 spl6_1 | ~spl6_4),
% 0.07/0.25 inference(avatar_contradiction_clause,[],[f117])).
% 0.07/0.25 thf(f121,plain,(
% 0.07/0.25 ( ! [X0 : $i] : (($true = $false) | (((cP @ X0)) = $false)) ) | (~spl6_4 | ~spl6_8)),
% 0.07/0.25 inference(constrained_superposition,[],[f35,f54])).
% 0.07/0.25 thf(f122,plain,(
% 0.07/0.25 ( ! [X0 : $i] : ((((cP @ X0)) = $false)) ) | (~spl6_4 | ~spl6_8)),
% 0.07/0.25 inference(trivial_inequality_removal,[],[f121])).
% 0.07/0.25 thf(f125,plain,(
% 0.07/0.25 spl6_2 | ~spl6_4 | ~spl6_8),
% 0.07/0.25 inference(avatar_split_clause,[],[f122,f53,f34,f28])).
% 0.07/0.25 thf(f145,plain,(
% 0.07/0.25 ( ! [X0 : $i] : (($true = $false) | (((cP @ X0)) = $true)) ) | (~spl6_2 | ~spl6_10)),
% 0.07/0.25 inference(constrained_superposition,[],[f62,f29])).
% 0.07/0.25 thf(f150,plain,(
% 0.07/0.25 ( ! [X0 : $i] : ((((cP @ X0)) = $true)) ) | (~spl6_2 | ~spl6_10)),
% 0.07/0.25 inference(trivial_inequality_removal,[],[f145])).
% 0.07/0.25 thf(f155,plain,(
% 0.07/0.25 ($true = $false) | (~spl6_2 | ~spl6_10)),
% 0.07/0.25 inference(forward_demodulation,[],[f150,f29])).
% 0.07/0.25 thf(f156,plain,(
% 0.07/0.25 $false | (~spl6_2 | ~spl6_10)),
% 0.07/0.25 inference(trivial_inequality_removal,[],[f155])).
% 0.07/0.25 thf(f157,plain,(
% 0.07/0.25 ~spl6_2 | ~spl6_10),
% 0.07/0.25 inference(avatar_contradiction_clause,[],[f156])).
% 0.07/0.25 cnf(s1, plain, spl6_1 | spl6_2 | spl6_3 | spl6_4, inference(sat_conversion,[],[f36])).
% 0.07/0.25 cnf(s2, plain, spl6_4 | spl6_3 | spl6_4 | spl6_5, inference(sat_conversion,[],[f41])).
% 0.07/0.25 cnf(s3, plain, spl6_3 | spl6_4 | spl6_5, inference(rat,[],[s2])).
% 0.07/0.25 cnf(s7, plain, spl6_4 | spl6_9 | spl6_10, inference(sat_conversion,[],[f63])).
% 0.07/0.25 cnf(s8, plain, spl6_3 | spl6_8 | ~spl6_11, inference(sat_conversion,[],[f68])).
% 0.07/0.25 cnf(s11, plain, ~spl6_4 | spl6_11, inference(sat_conversion,[],[f73])).
% 0.07/0.25 cnf(s12, plain, ~spl6_3 | ~spl6_9, inference(sat_conversion,[],[f75])).
% 0.07/0.25 cnf(s13, plain, ~spl6_3 | ~spl6_10, inference(sat_conversion,[],[f78])).
% 0.07/0.25 cnf(s14, plain, ~spl6_2 | ~spl6_9, inference(sat_conversion,[],[f81])).
% 0.07/0.25 cnf(s16, plain, ~spl6_1 | ~spl6_5, inference(sat_conversion,[],[f89])).
% 0.07/0.25 cnf(s17, plain, ~spl6_3 | ~spl6_4, inference(sat_conversion,[],[f92])).
% 0.07/0.25 cnf(s21, plain, ~spl6_4 | spl6_9, inference(sat_conversion,[],[f100])).
% 0.07/0.25 cnf(s24, plain, spl6_1 | ~spl6_4, inference(sat_conversion,[],[f118])).
% 0.07/0.25 cnf(s25, plain, spl6_2 | ~spl6_4 | ~spl6_8, inference(sat_conversion,[],[f125])).
% 0.07/0.25 cnf(s31, plain, ~spl6_2 | ~spl6_10, inference(sat_conversion,[],[f157])).
% 0.07/0.25 cnf(s32, plain, ~spl6_3 | spl6_4, inference(rat,[],[s7,s12,s13])).
% 0.07/0.25 cnf(s33, plain, spl6_3 | spl6_4 | spl6_1, inference(rat,[],[s7,s14,s31,s1])).
% 0.07/0.25 cnf(s34, plain, spl6_1, inference(rat,[],[s33,s32,s24])).
% 0.07/0.25 cnf(s35, plain, ~spl6_5, inference(rat,[],[s16,s34])).
% 0.07/0.25 cnf(s36, plain, ~spl6_3, inference(rat,[],[s32,s17])).
% 0.07/0.25 cnf(s37, plain, spl6_4, inference(rat,[],[s3,s35,s36])).
% 0.07/0.25 cnf(s38, plain, spl6_9, inference(rat,[],[s21,s37])).
% 0.07/0.25 cnf(s39, plain, spl6_11, inference(rat,[],[s11,s37])).
% 0.07/0.25 cnf(s41, plain, spl6_8, inference(rat,[],[s8,s36,s39])).
% 0.07/0.25 cnf(s42, plain, ~spl6_2, inference(rat,[],[s14,s38])).
% 0.07/0.25 cnf(s44, plain, $false, inference(rat,[],[s25,s37,s42,s41])).
% 0.07/0.25 thf(f158,plain,(
% 0.07/0.25 $false),
% 0.07/0.25 inference(avatar_sat_refutation,[],[s44])).
% 0.07/0.25 % SZS output end Proof for theBenchmark
% 0.07/0.25 % (2690641)------------------------------
% 0.07/0.25 % (2690641)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (2690641)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (2690641)CaDiCaL version: 2.1.3
% 0.07/0.25 % (2690641)Termination reason: Refutation
% 0.07/0.25 % (2690641)Time elapsed: 0.003 s
% 0.07/0.25 % (2690641)Peak memory usage: 12 MB
% 0.07/0.25 % (2690641)Instructions burned: 5 (million)
% 0.07/0.25 % (2690631)Success in time 0.028 s
% 0.07/0.25 % Vampire exiting
%------------------------------------------------------------------------------