%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU652^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:30:32 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU652^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n001.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 14:08:50 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running higher-order theorem proving
% 0.08/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.27 % (1297968)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.27 % (1297976)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=1991974596:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.20/0.27 % (1297976) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1297968-1297976"...
% 0.20/0.27 % (1297976)...printing done.
% 0.20/0.27 % (1297976)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% 0.20/0.27 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.27 thf(func_def_0, type, in: ($i > $i > $o)).
% 0.20/0.27 thf(func_def_2, type, setadjoin: ($i > $i > $i)).
% 0.20/0.27 thf(func_def_3, type, setadjoinIL: $o).
% 0.20/0.27 thf(func_def_5, type, uniqinunit: $o).
% 0.20/0.27 thf(func_def_6, type, secondinupair: $o).
% 0.20/0.27 thf(f1,axiom,(
% 0.20/0.27 (! [X1 : $i,X0 : $i] : (in @ X0 @ (setadjoin @ X0 @ X1)) = setadjoinIL)),
% 0.20/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinIL)).
% 0.20/0.27 thf(f2,axiom,(
% 0.20/0.27 (! [X1 : $i,X0 : $i] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)) = uniqinunit)),
% 0.20/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p',uniqinunit)).
% 0.20/0.27 thf(f3,axiom,(
% 0.20/0.27 (secondinupair = ! [X0 : $i,X1 : $i] : (in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))))),
% 0.20/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p',secondinupair)).
% 0.20/0.27 thf(f4,conjecture,(
% 0.20/0.27 setadjoinIL => (uniqinunit => (secondinupair => ! [X2 : $i,X0 : $i,X1 : $i] : ((((setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) = ((setadjoin @ X2 @ emptyset))) => (X0 = X1))))),
% 0.20/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p',upairequniteq)).
% 0.20/0.27 thf(f5,negated_conjecture,(
% 0.20/0.27 ~(setadjoinIL => (uniqinunit => (secondinupair => ! [X2 : $i,X0 : $i,X1 : $i] : ((((setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) = ((setadjoin @ X2 @ emptyset))) => (X0 = X1)))))),
% 0.20/0.27 inference(negated_conjecture,[status(cth)],[f4])).
% 0.20/0.27 thf(f6,plain,(
% 0.20/0.27 (secondinupair = ! [X0 : $i,X1 : $i] : (in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))))),
% 0.20/0.27 inference(rectify,[],[f3])).
% 0.20/0.27 thf(f7,plain,(
% 0.20/0.27 ! [X1 : $i,X0 : $i] : (((in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)))) = $true) <=> (secondinupair = $true)),
% 0.20/0.27 inference(fool_elimination,[],[f6])).
% 0.20/0.27 thf(f8,plain,(
% 0.20/0.27 (! [X0 : $i,X1 : $i] : (in @ X1 @ (setadjoin @ X1 @ X0)) = setadjoinIL)),
% 0.20/0.27 inference(rectify,[],[f1])).
% 0.20/0.27 thf(f9,plain,(
% 0.20/0.27 (setadjoinIL = $true) <=> ! [X0 : $i,X1 : $i] : (((in @ X1 @ (setadjoin @ X1 @ X0))) = $true)),
% 0.20/0.27 inference(fool_elimination,[],[f8])).
% 0.20/0.27 thf(f10,plain,(
% 0.20/0.27 ~(setadjoinIL => (uniqinunit => (secondinupair => ! [X0 : $i,X1 : $i,X2 : $i] : ((((setadjoin @ X1 @ (setadjoin @ X2 @ emptyset))) = ((setadjoin @ X0 @ emptyset))) => (X1 = X2)))))),
% 0.20/0.27 inference(rectify,[],[f5])).
% 0.20/0.27 thf(f11,plain,(
% 0.20/0.27 ~((setadjoinIL = $true) => ((uniqinunit = $true) => ((secondinupair = $true) => ! [X2 : $i,X1 : $i,X0 : $i] : ((((setadjoin @ X1 @ (setadjoin @ X2 @ emptyset))) = ((setadjoin @ X0 @ emptyset))) => (X1 = X2)))))),
% 0.20/0.27 inference(fool_elimination,[],[f10])).
% 0.20/0.27 thf(f12,plain,(
% 0.20/0.27 (! [X0 : $i,X1 : $i] : ((in @ X1 @ (setadjoin @ X0 @ emptyset)) => (X0 = X1)) = uniqinunit)),
% 0.20/0.27 inference(rectify,[],[f2])).
% 0.20/0.27 thf(f13,plain,(
% 0.20/0.27 (uniqinunit = $true) <=> ! [X1 : $i,X0 : $i] : ((((in @ X1 @ (setadjoin @ X0 @ emptyset))) = $true) => (X0 = X1))),
% 0.20/0.27 inference(fool_elimination,[],[f12])).
% 0.20/0.27 thf(f14,plain,(
% 0.20/0.27 ((? [X2 : $i,X0 : $i,X1 : $i] : ((((setadjoin @ X1 @ (setadjoin @ X2 @ emptyset))) = ((setadjoin @ X0 @ emptyset))) & (X1 != X2)) & (secondinupair = $true)) & (uniqinunit = $true)) & (setadjoinIL = $true)),
% 0.20/0.27 inference(ennf_transformation,[],[f11])).
% 0.20/0.27 thf(f15,plain,(
% 0.20/0.27 (uniqinunit = $true) & (setadjoinIL = $true) & ? [X2 : $i,X0 : $i,X1 : $i] : ((((setadjoin @ X1 @ (setadjoin @ X2 @ emptyset))) = ((setadjoin @ X0 @ emptyset))) & (X1 != X2)) & (secondinupair = $true)),
% 0.20/0.27 inference(flattening,[],[f14])).
% 0.20/0.27 thf(f16,plain,(
% 0.20/0.27 (uniqinunit = $true) <=> ! [X1 : $i,X0 : $i] : ((((in @ X1 @ (setadjoin @ X0 @ emptyset))) != $true) | (X0 = X1))),
% 0.20/0.28 inference(ennf_transformation,[],[f13])).
% 0.20/0.28 thf(f17,plain,(
% 0.20/0.28 ((setadjoinIL = $true) | ? [X0 : $i,X1 : $i] : (((in @ X1 @ (setadjoin @ X1 @ X0))) != $true)) & (! [X0 : $i,X1 : $i] : (((in @ X1 @ (setadjoin @ X1 @ X0))) = $true) | (setadjoinIL != $true))),
% 0.20/0.28 inference(nnf_transformation,[],[f9])).
% 0.20/0.28 thf(f18,plain,(
% 0.20/0.28 ((setadjoinIL = $true) | ? [X0 : $i,X1 : $i] : (((in @ X1 @ (setadjoin @ X1 @ X0))) != $true)) & (! [X2 : $i,X3 : $i] : (((in @ X3 @ (setadjoin @ X3 @ X2))) = $true) | (setadjoinIL != $true))),
% 0.20/0.28 inference(rectify,[],[f17])).
% 0.20/0.28 thf(f19,plain,(
% 0.20/0.28 ((setadjoinIL = $true) | (((in @ sK1 @ (setadjoin @ sK1 @ sK0))) != $true)) & (! [X2 : $i,X3 : $i] : (((in @ X3 @ (setadjoin @ X3 @ X2))) = $true) | (setadjoinIL != $true))),
% 0.20/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f18])).
% 0.20/0.28 thf(f20,plain,(
% 0.20/0.28 ((uniqinunit = $true) | ? [X1 : $i,X0 : $i] : ((((in @ X1 @ (setadjoin @ X0 @ emptyset))) = $true) & (X0 != X1))) & (! [X1 : $i,X0 : $i] : ((((in @ X1 @ (setadjoin @ X0 @ emptyset))) != $true) | (X0 = X1)) | (uniqinunit != $true))),
% 0.20/0.28 inference(nnf_transformation,[],[f16])).
% 0.20/0.28 thf(f21,plain,(
% 0.20/0.28 ((uniqinunit = $true) | ? [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X1 @ emptyset))) = $true) & (X0 != X1))) & (! [X2 : $i,X3 : $i] : ((((in @ X2 @ (setadjoin @ X3 @ emptyset))) != $true) | (X2 = X3)) | (uniqinunit != $true))),
% 0.20/0.28 inference(rectify,[],[f20])).
% 0.20/0.28 thf(f22,plain,(
% 0.20/0.28 ((uniqinunit = $true) | (($true = ((in @ sK2 @ (setadjoin @ sK3 @ emptyset)))) & (sK3 != sK2))) & (! [X2 : $i,X3 : $i] : ((((in @ X2 @ (setadjoin @ X3 @ emptyset))) != $true) | (X2 = X3)) | (uniqinunit != $true))),
% 0.20/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f21])).
% 0.20/0.28 thf(f23,plain,(
% 0.20/0.28 (! [X1 : $i,X0 : $i] : (((in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)))) = $true) | (secondinupair != $true)) & ((secondinupair = $true) | ? [X1 : $i,X0 : $i] : (((in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)))) != $true))),
% 0.20/0.28 inference(nnf_transformation,[],[f7])).
% 0.20/0.28 thf(f24,plain,(
% 0.20/0.28 (! [X0 : $i,X1 : $i] : (((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)))) = $true) | (secondinupair != $true)) & ((secondinupair = $true) | ? [X2 : $i,X3 : $i] : (((in @ X2 @ (setadjoin @ X3 @ (setadjoin @ X2 @ emptyset)))) != $true))),
% 0.20/0.28 inference(rectify,[],[f23])).
% 0.20/0.28 thf(f25,plain,(
% 0.20/0.28 (! [X0 : $i,X1 : $i] : (((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)))) = $true) | (secondinupair != $true)) & ((secondinupair = $true) | (((in @ sK4 @ (setadjoin @ sK5 @ (setadjoin @ sK4 @ emptyset)))) != $true))),
% 0.20/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X2,sK4),skolemize(X3,sK5)],[f24])).
% 0.20/0.28 thf(f26,plain,(
% 0.20/0.28 (uniqinunit = $true) & (setadjoinIL = $true) & ? [X0 : $i,X1 : $i,X2 : $i] : ((((setadjoin @ X1 @ emptyset)) = ((setadjoin @ X2 @ (setadjoin @ X0 @ emptyset)))) & (X0 != X2)) & (secondinupair = $true)),
% 0.20/0.28 inference(rectify,[],[f15])).
% 0.20/0.28 thf(f27,plain,(
% 0.20/0.28 (uniqinunit = $true) & (setadjoinIL = $true) & ((((setadjoin @ sK7 @ emptyset)) = ((setadjoin @ sK8 @ (setadjoin @ sK6 @ emptyset)))) & (sK6 != sK8)) & (secondinupair = $true)),
% 0.20/0.28 inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8)],[f26])).
% 0.20/0.28 thf(f28,plain,(
% 0.20/0.28 ( ! [X2 : $i,X3 : $i] : ((setadjoinIL != $true) | (((in @ X3 @ (setadjoin @ X3 @ X2))) = $true)) )),
% 0.20/0.28 inference(cnf_transformation,[],[f19])).
% 0.20/0.28 thf(f30,plain,(
% 0.20/0.28 ( ! [X2 : $i,X3 : $i] : ((((in @ X2 @ (setadjoin @ X3 @ emptyset))) != $true) | (X2 = X3) | (uniqinunit != $true)) )),
% 0.20/0.28 inference(cnf_transformation,[],[f22])).
% 0.20/0.28 thf(f34,plain,(
% 0.20/0.28 ( ! [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)))) = $true) | (secondinupair != $true)) )),
% 0.20/0.28 inference(cnf_transformation,[],[f25])).
% 0.20/0.28 thf(f35,plain,(
% 0.20/0.28 (secondinupair = $true)),
% 0.20/0.28 inference(cnf_transformation,[],[f27])).
% 0.20/0.28 thf(f36,plain,(
% 0.20/0.28 (sK6 != sK8)),
% 0.20/0.28 inference(cnf_transformation,[],[f27])).
% 0.20/0.28 thf(f37,plain,(
% 0.20/0.28 (((setadjoin @ sK7 @ emptyset)) = ((setadjoin @ sK8 @ (setadjoin @ sK6 @ emptyset))))),
% 0.20/0.28 inference(cnf_transformation,[],[f27])).
% 0.20/0.28 thf(f38,plain,(
% 0.20/0.28 (setadjoinIL = $true)),
% 0.20/0.28 inference(cnf_transformation,[],[f27])).
% 0.20/0.28 thf(f39,plain,(
% 0.20/0.28 (uniqinunit = $true)),
% 0.20/0.28 inference(cnf_transformation,[],[f27])).
% 0.20/0.28 thf(f46,definition,(
% 0.20/0.28 spl9_2 <=> (uniqinunit = $true)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition])).
% 0.20/0.28 thf(f55,definition,(
% 0.20/0.28 spl9_4 <=> (secondinupair = $true)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl9_4])],[avatar_definition])).
% 0.20/0.28 thf(f60,definition,(
% 0.20/0.28 spl9_5 <=> (((setadjoin @ sK7 @ emptyset)) = ((setadjoin @ sK8 @ (setadjoin @ sK6 @ emptyset))))),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl9_5])],[avatar_definition])).
% 0.20/0.28 thf(f62,plain,(
% 0.20/0.28 (((setadjoin @ sK7 @ emptyset)) = ((setadjoin @ sK8 @ (setadjoin @ sK6 @ emptyset)))) | ~spl9_5),
% 0.20/0.28 inference(avatar_component_clause,[],[f60])).
% 0.20/0.28 thf(f63,plain,(
% 0.20/0.28 spl9_5),
% 0.20/0.28 inference(avatar_split_clause,[],[f37,f60])).
% 0.20/0.28 thf(f65,definition,(
% 0.20/0.28 spl9_6 <=> ! [X2 : $i,X3 : $i] : ((((in @ X2 @ (setadjoin @ X3 @ emptyset))) != $true) | (X2 = X3))),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl9_6])],[avatar_definition])).
% 0.20/0.28 thf(f66,plain,(
% 0.20/0.28 ( ! [X2 : $i,X3 : $i] : ((((in @ X2 @ (setadjoin @ X3 @ emptyset))) != $true) | (X2 = X3)) ) | ~spl9_6),
% 0.20/0.28 inference(avatar_component_clause,[],[f65])).
% 0.20/0.28 thf(f67,plain,(
% 0.20/0.28 spl9_6 | ~spl9_2),
% 0.20/0.28 inference(avatar_split_clause,[],[f30,f46,f65])).
% 0.20/0.28 thf(f69,definition,(
% 0.20/0.28 spl9_7 <=> (setadjoinIL = $true)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl9_7])],[avatar_definition])).
% 0.20/0.28 thf(f73,definition,(
% 0.20/0.28 spl9_8 <=> ! [X2 : $i,X3 : $i] : (((in @ X3 @ (setadjoin @ X3 @ X2))) = $true)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl9_8])],[avatar_definition])).
% 0.20/0.28 thf(f74,plain,(
% 0.20/0.28 ( ! [X2 : $i,X3 : $i] : ((((in @ X3 @ (setadjoin @ X3 @ X2))) = $true)) ) | ~spl9_8),
% 0.20/0.28 inference(avatar_component_clause,[],[f73])).
% 0.20/0.28 thf(f75,plain,(
% 0.20/0.28 ~spl9_7 | spl9_8),
% 0.20/0.28 inference(avatar_split_clause,[],[f28,f73,f69])).
% 0.20/0.28 thf(f76,plain,(
% 0.20/0.28 spl9_7),
% 0.20/0.28 inference(avatar_split_clause,[],[f38,f69])).
% 0.20/0.28 thf(f78,definition,(
% 0.20/0.28 spl9_9 <=> ! [X0 : $i,X1 : $i] : (((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)))) = $true)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl9_9])],[avatar_definition])).
% 0.20/0.28 thf(f79,plain,(
% 0.20/0.28 ( ! [X0 : $i,X1 : $i] : ((((in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)))) = $true)) ) | ~spl9_9),
% 0.20/0.28 inference(avatar_component_clause,[],[f78])).
% 0.20/0.28 thf(f80,plain,(
% 0.20/0.28 ~spl9_4 | spl9_9),
% 0.20/0.28 inference(avatar_split_clause,[],[f34,f78,f55])).
% 0.20/0.28 thf(f91,plain,(
% 0.20/0.28 spl9_4),
% 0.20/0.28 inference(avatar_split_clause,[],[f35,f55])).
% 0.20/0.28 thf(f93,definition,(
% 0.20/0.28 spl9_12 <=> (sK6 = sK8)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl9_12])],[avatar_definition])).
% 0.20/0.28 thf(f96,plain,(
% 0.20/0.28 ~spl9_12),
% 0.20/0.28 inference(avatar_split_clause,[],[f36,f93])).
% 0.20/0.28 thf(f97,plain,(
% 0.20/0.28 spl9_2),
% 0.20/0.28 inference(avatar_split_clause,[],[f39,f46])).
% 0.20/0.28 thf(f107,plain,(
% 0.20/0.28 ( ! [X0 : $i] : ((((in @ X0 @ (setadjoin @ sK8 @ (setadjoin @ sK6 @ emptyset)))) != $true) | (sK7 = X0)) ) | (~spl9_5 | ~spl9_6)),
% 0.20/0.28 inference(superposition,[],[f66,f62])).
% 0.20/0.28 thf(f109,plain,(
% 0.20/0.28 (sK7 = sK8) | ($true != $true) | (~spl9_5 | ~spl9_6 | ~spl9_8)),
% 0.20/0.28 inference(superposition,[],[f107,f74])).
% 0.20/0.28 thf(f110,plain,(
% 0.20/0.28 ($true != $true) | (sK6 = sK7) | (~spl9_5 | ~spl9_6 | ~spl9_9)),
% 0.20/0.28 inference(superposition,[],[f107,f79])).
% 0.20/0.28 thf(f111,plain,(
% 0.20/0.28 (sK6 = sK7) | (~spl9_5 | ~spl9_6 | ~spl9_9)),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f110])).
% 0.20/0.28 thf(f112,plain,(
% 0.20/0.28 (sK7 = sK8) | (~spl9_5 | ~spl9_6 | ~spl9_8)),
% 0.20/0.28 inference(trivial_inequality_removal,[],[f109])).
% 0.20/0.28 thf(f114,definition,(
% 0.20/0.28 spl9_14 <=> (sK6 = sK7)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl9_14])],[avatar_definition])).
% 0.20/0.28 thf(f117,plain,(
% 0.20/0.28 spl9_14 | ~spl9_5 | ~spl9_6 | ~spl9_9),
% 0.20/0.28 inference(avatar_split_clause,[],[f111,f78,f65,f60,f114])).
% 0.20/0.28 thf(f119,definition,(
% 0.20/0.28 spl9_15 <=> (sK7 = sK8)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl9_15])],[avatar_definition])).
% 0.20/0.28 thf(f122,plain,(
% 0.20/0.28 spl9_15 | ~spl9_5 | ~spl9_6 | ~spl9_8),
% 0.20/0.28 inference(avatar_split_clause,[],[f112,f73,f65,f60,f119])).
% 0.20/0.28 thf(f123,definition,(
% 0.20/0.28 (sK6 != sK7) | (sK7 != sK8) | (sK6 = sK8)),
% 0.20/0.28 introduced(theory,[theory_tautology_sat_conflict])).
% 0.20/0.28 cnf(s3, plain, spl9_5, inference(sat_conversion,[],[f63])).
% 0.20/0.28 cnf(s4, plain, ~spl9_2 | spl9_6, inference(sat_conversion,[],[f67])).
% 0.20/0.28 cnf(s5, plain, ~spl9_7 | spl9_8, inference(sat_conversion,[],[f75])).
% 0.20/0.28 cnf(s6, plain, spl9_7, inference(sat_conversion,[],[f76])).
% 0.20/0.28 cnf(s7, plain, ~spl9_4 | spl9_9, inference(sat_conversion,[],[f80])).
% 0.20/0.28 cnf(s10, plain, spl9_4, inference(sat_conversion,[],[f91])).
% 0.20/0.28 cnf(s11, plain, ~spl9_12, inference(sat_conversion,[],[f96])).
% 0.20/0.28 cnf(s12, plain, spl9_2, inference(sat_conversion,[],[f97])).
% 0.20/0.28 cnf(s14, plain, ~spl9_5 | ~spl9_6 | ~spl9_9 | spl9_14, inference(sat_conversion,[],[f117])).
% 0.20/0.28 cnf(s15, plain, ~spl9_5 | ~spl9_6 | ~spl9_8 | spl9_15, inference(sat_conversion,[],[f122])).
% 0.20/0.28 cnf(s16, plain, spl9_12 | ~spl9_14 | ~spl9_15, inference(sat_conversion,[],[f123])).
% 0.20/0.28 cnf(s17, plain, spl9_9, inference(rat,[],[s7,s10])).
% 0.20/0.28 cnf(s18, plain, spl9_8, inference(rat,[],[s5,s6])).
% 0.20/0.28 cnf(s19, plain, spl9_6, inference(rat,[],[s4,s12])).
% 0.20/0.28 cnf(s20, plain, spl9_15, inference(rat,[],[s15,s19,s18,s3])).
% 0.20/0.28 cnf(s21, plain, spl9_14, inference(rat,[],[s14,s19,s17,s3])).
% 0.20/0.28 cnf(s23, plain, $false, inference(rat,[],[s16,s11,s20,s21])).
% 0.20/0.28 thf(f124,plain,(
% 0.20/0.28 $false),
% 0.20/0.28 inference(avatar_sat_refutation,[],[s23])).
% 0.20/0.28 % SZS output end Proof for theBenchmark
% 0.20/0.28 % (1297976)------------------------------
% 0.20/0.28 % (1297976)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (1297976)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (1297976)CaDiCaL version: 2.1.3
% 0.20/0.28 % (1297976)Termination reason: Refutation
% 0.20/0.28 % (1297976)Time elapsed: 0.003 s
% 0.20/0.28 % (1297976)Peak memory usage: 13 MB
% 0.20/0.28 % (1297976)Instructions burned: 6 (million)
% 0.20/0.28 % (1297968)Success in time 0.039 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------