%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV126^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 : n005.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:37:51 AM UTC 2026
% Result : Theorem 0.20s 0.29s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV126^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n005.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 15:12:31 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.24 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.20/0.29 % (1783990)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.29 % (1783998)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=2827979170: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.29 % (1783998) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1783990-1783998"...
% 0.20/0.29 % (1783998)...printing done.
% 0.20/0.29 % (1783995)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1536458657:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.29 % (1783996)lrs+10_16_si=on:nwc=1.5:random_seed=2349403681:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.29 % (1783998)Refutation found. Thanks to Tanya!
% 0.20/0.29 % SZS status Theorem for theBenchmark
% 0.20/0.29 % SZS output start Proof for theBenchmark
% 0.20/0.29 thf(type_def_5, type, a: $tType).
% 0.20/0.29 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.29 thf(func_def_3, type, sK0: (a > a > $o)).
% 0.20/0.29 thf(func_def_4, type, sK1: ((a > a > $o) > $o)).
% 0.20/0.29 thf(func_def_5, type, sK2: a).
% 0.20/0.29 thf(func_def_6, type, sK3: a).
% 0.20/0.29 thf(func_def_7, type, sK4: (a > a > $o)).
% 0.20/0.29 thf(func_def_8, type, sK5: ((a > a > $o) > a)).
% 0.20/0.29 thf(func_def_9, type, sK6: ((a > a > $o) > a)).
% 0.20/0.29 thf(func_def_10, type, sK7: (a > a > $o)).
% 0.20/0.29 thf(func_def_11, type, sK8: (a > a > a > a > $o)).
% 0.20/0.29 thf(func_def_12, type, sK9: (a > a > a > a > $o)).
% 0.20/0.29 thf(func_def_13, type, vNOT: ($o > $o)).
% 0.20/0.29 thf(func_def_15, type, db0: !>[X0: $tType]:(X0)).
% 0.20/0.29 thf(func_def_16, type, db1: !>[X0: $tType]:(X0)).
% 0.20/0.29 thf(func_def_17, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.20/0.29 thf(func_def_18, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.20/0.29 thf(func_def_19, type, db2: !>[X0: $tType]:(X0)).
% 0.20/0.29 thf(f1,conjecture,(
% 0.20/0.29 ! [X3 : a,X4 : a,X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o)] : (! [X5 : (a > a > $o)] : ((! [X7 : a,X6 : a] : (((X2 @ X6 @ X7) | (X1 @ X6 @ X7)) => (X5 @ X6 @ X7)) & (X0 @ X5)) => (X5 @ X3 @ X4)) => ! [X5 : (a > a > $o)] : (((X0 @ X5) & ! [X7 : a,X6 : a] : ((! [X8 : (a > a > $o)] : (((X0 @ X8) & ! [X9 : a,X10 : a] : ((X2 @ X9 @ X10) => (X8 @ X9 @ X10))) => (X8 @ X6 @ X7)) | ! [X8 : (a > a > $o)] : ((! [X9 : a,X10 : a] : ((X1 @ X9 @ X10) => (X8 @ X9 @ X10)) & (X0 @ X8)) => (X8 @ X6 @ X7))) => (X5 @ X6 @ X7))) => (X5 @ X3 @ X4)))),
% 0.20/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM252B_pme)).
% 0.20/0.29 thf(f2,negated_conjecture,(
% 0.20/0.29 ~ ! [X3 : a,X4 : a,X0 : ((a > a > $o) > $o),X1 : (a > a > $o),X2 : (a > a > $o)] : (! [X5 : (a > a > $o)] : ((! [X7 : a,X6 : a] : (((X2 @ X6 @ X7) | (X1 @ X6 @ X7)) => (X5 @ X6 @ X7)) & (X0 @ X5)) => (X5 @ X3 @ X4)) => ! [X5 : (a > a > $o)] : (((X0 @ X5) & ! [X7 : a,X6 : a] : ((! [X8 : (a > a > $o)] : (((X0 @ X8) & ! [X9 : a,X10 : a] : ((X2 @ X9 @ X10) => (X8 @ X9 @ X10))) => (X8 @ X6 @ X7)) | ! [X8 : (a > a > $o)] : ((! [X9 : a,X10 : a] : ((X1 @ X9 @ X10) => (X8 @ X9 @ X10)) & (X0 @ X8)) => (X8 @ X6 @ X7))) => (X5 @ X6 @ X7))) => (X5 @ X3 @ X4)))),
% 0.20/0.29 inference(negated_conjecture,[status(cth)],[f1])).
% 0.20/0.29 thf(f3,plain,(
% 0.20/0.29 ~ ! [X0 : a,X1 : a,X2 : ((a > a > $o) > $o),X3 : (a > a > $o),X4 : (a > a > $o)] : (! [X5 : (a > a > $o)] : ((! [X6 : a,X7 : a] : (((X4 @ X7 @ X6) | (X3 @ X7 @ X6)) => (X5 @ X7 @ X6)) & (X2 @ X5)) => (X5 @ X0 @ X1)) => ! [X8 : (a > a > $o)] : (((X2 @ X8) & ! [X9 : a,X10 : a] : ((! [X11 : (a > a > $o)] : (((X2 @ X11) & ! [X12 : a,X13 : a] : ((X4 @ X12 @ X13) => (X11 @ X12 @ X13))) => (X11 @ X10 @ X9)) | ! [X14 : (a > a > $o)] : ((! [X15 : a,X16 : a] : ((X3 @ X15 @ X16) => (X14 @ X15 @ X16)) & (X2 @ X14)) => (X14 @ X10 @ X9))) => (X8 @ X10 @ X9))) => (X8 @ X0 @ X1)))),
% 0.20/0.29 inference(rectify,[],[f2])).
% 0.20/0.29 thf(f4,plain,(
% 0.20/0.29 ~ ! [X0 : a,X3 : (a > a > $o),X2 : ((a > a > $o) > $o),X1 : a,X4 : (a > a > $o)] : (! [X5 : (a > a > $o)] : (((((X2 @ X5)) = $true) & ! [X6 : a,X7 : a] : (((((X4 @ X7 @ X6)) = $true) | (((X3 @ X7 @ X6)) = $true)) => (((X5 @ X7 @ X6)) = $true))) => (((X5 @ X0 @ X1)) = $true)) => ! [X8 : (a > a > $o)] : ((! [X10 : a,X9 : a] : ((! [X14 : (a > a > $o)] : ((! [X15 : a,X16 : a] : ((((X3 @ X15 @ X16)) = $true) => (((X14 @ X15 @ X16)) = $true)) & ($true = ((X2 @ X14)))) => (((X14 @ X10 @ X9)) = $true)) | ! [X11 : (a > a > $o)] : ((! [X12 : a,X13 : a] : ((((X4 @ X12 @ X13)) = $true) => (((X11 @ X12 @ X13)) = $true)) & (((X2 @ X11)) = $true)) => (((X11 @ X10 @ X9)) = $true))) => (((X8 @ X10 @ X9)) = $true)) & (((X2 @ X8)) = $true)) => (((X8 @ X0 @ X1)) = $true)))),
% 0.20/0.29 inference(fool_elimination,[],[f3])).
% 0.20/0.29 thf(f5,plain,(
% 0.20/0.29 ? [X0 : a,X3 : (a > a > $o),X2 : ((a > a > $o) > $o),X1 : a,X4 : (a > a > $o)] : (? [X8 : (a > a > $o)] : ((((X8 @ X0 @ X1)) != $true) & (! [X10 : a,X9 : a] : ((((X8 @ X10 @ X9)) = $true) | (? [X14 : (a > a > $o)] : ((((X14 @ X10 @ X9)) != $true) & (! [X15 : a,X16 : a] : ((((X14 @ X15 @ X16)) = $true) | (((X3 @ X15 @ X16)) != $true)) & ($true = ((X2 @ X14))))) & ? [X11 : (a > a > $o)] : ((((X11 @ X10 @ X9)) != $true) & (! [X13 : a,X12 : a] : ((((X11 @ X12 @ X13)) = $true) | (((X4 @ X12 @ X13)) != $true)) & (((X2 @ X11)) = $true))))) & (((X2 @ X8)) = $true))) & ! [X5 : (a > a > $o)] : ((((X5 @ X0 @ X1)) = $true) | ((((X2 @ X5)) != $true) | ? [X6 : a,X7 : a] : ((((X5 @ X7 @ X6)) != $true) & ((((X4 @ X7 @ X6)) = $true) | (((X3 @ X7 @ X6)) = $true))))))),
% 0.20/0.29 inference(ennf_transformation,[],[f4])).
% 0.20/0.29 thf(f6,plain,(
% 0.20/0.29 ? [X4 : (a > a > $o),X2 : ((a > a > $o) > $o),X0 : a,X1 : a,X3 : (a > a > $o)] : (! [X5 : (a > a > $o)] : (? [X6 : a,X7 : a] : ((((X5 @ X7 @ X6)) != $true) & ((((X4 @ X7 @ X6)) = $true) | (((X3 @ X7 @ X6)) = $true))) | (((X5 @ X0 @ X1)) = $true) | (((X2 @ X5)) != $true)) & ? [X8 : (a > a > $o)] : (! [X10 : a,X9 : a] : ((((X8 @ X10 @ X9)) = $true) | (? [X14 : (a > a > $o)] : ((((X14 @ X10 @ X9)) != $true) & ! [X15 : a,X16 : a] : ((((X14 @ X15 @ X16)) = $true) | (((X3 @ X15 @ X16)) != $true)) & ($true = ((X2 @ X14)))) & ? [X11 : (a > a > $o)] : ((((X11 @ X10 @ X9)) != $true) & (((X2 @ X11)) = $true) & ! [X13 : a,X12 : a] : ((((X11 @ X12 @ X13)) = $true) | (((X4 @ X12 @ X13)) != $true))))) & (((X2 @ X8)) = $true) & (((X8 @ X0 @ X1)) != $true)))),
% 0.20/0.29 inference(flattening,[],[f5])).
% 0.20/0.29 thf(f7,plain,(
% 0.20/0.29 ? [X0 : (a > a > $o),X1 : ((a > a > $o) > $o),X2 : a,X3 : a,X4 : (a > a > $o)] : (! [X5 : (a > a > $o)] : (? [X6 : a,X7 : a] : ((((X5 @ X7 @ X6)) != $true) & ((((X0 @ X7 @ X6)) = $true) | (((X4 @ X7 @ X6)) = $true))) | (((X5 @ X2 @ X3)) = $true) | (((X1 @ X5)) != $true)) & ? [X8 : (a > a > $o)] : (! [X9 : a,X10 : a] : ((((X8 @ X9 @ X10)) = $true) | (? [X11 : (a > a > $o)] : ((((X11 @ X9 @ X10)) != $true) & ! [X12 : a,X13 : a] : ((((X11 @ X12 @ X13)) = $true) | (((X4 @ X12 @ X13)) != $true)) & (((X1 @ X11)) = $true)) & ? [X14 : (a > a > $o)] : ((((X14 @ X9 @ X10)) != $true) & (((X1 @ X14)) = $true) & ! [X15 : a,X16 : a] : ((((X14 @ X16 @ X15)) = $true) | (((X0 @ X16 @ X15)) != $true))))) & (((X1 @ X8)) = $true) & (((X8 @ X2 @ X3)) != $true)))),
% 0.20/0.29 inference(rectify,[],[f6])).
% 0.20/0.29 thf(f8,plain,(
% 0.20/0.29 ! [X5 : (a > a > $o)] : (((((X5 @ (sK6 @ X5) @ (sK5 @ X5))) != $true) & ((((sK0 @ (sK6 @ X5) @ (sK5 @ X5))) = $true) | (((sK4 @ (sK6 @ X5) @ (sK5 @ X5))) = $true))) | (((X5 @ sK2 @ sK3)) = $true) | (((sK1 @ X5)) != $true)) & (! [X9 : a,X10 : a] : (($true = ((sK7 @ X9 @ X10))) | (((((sK8 @ X10 @ X9 @ X9 @ X10)) != $true) & ! [X12 : a,X13 : a] : (($true = ((sK8 @ X10 @ X9 @ X12 @ X13))) | (((sK4 @ X12 @ X13)) != $true)) & ($true = ((sK1 @ (sK8 @ X10 @ X9))))) & ((((sK9 @ X10 @ X9 @ X9 @ X10)) != $true) & (((sK1 @ (sK9 @ X10 @ X9))) = $true) & ! [X15 : a,X16 : a] : ((((sK9 @ X10 @ X9 @ X16 @ X15)) = $true) | (((sK0 @ X16 @ X15)) != $true))))) & (((sK1 @ sK7)) = $true) & ($true != ((sK7 @ sK2 @ sK3))))),
% 0.20/0.29 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,vAPP,vAPP,sK7,vAPP,vAPP]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X14,sK9 @ X10 @ X9),skolemize(X14,sK9 @ X10 @ X9),skolemize(X8,sK7),skolemize(X14,sK9 @ X10 @ X9),skolemize(X14,sK9 @ X10 @ X9)],[f7])).
% 0.20/0.29 thf(f9,plain,(
% 0.20/0.29 ($true != ((sK7 @ sK2 @ sK3)))),
% 0.20/0.29 inference(cnf_transformation,[],[f8])).
% 0.20/0.29 thf(f10,plain,(
% 0.20/0.29 (((sK1 @ sK7)) = $true)),
% 0.20/0.29 inference(cnf_transformation,[],[f8])).
% 0.20/0.29 thf(f11,plain,(
% 0.20/0.29 ( ! [X10 : a,X9 : a,X16 : a,X15 : a] : ((((sK9 @ X10 @ X9 @ X16 @ X15)) = $true) | ($true = ((sK7 @ X9 @ X10))) | (((sK0 @ X16 @ X15)) != $true)) )),
% 0.20/0.29 inference(cnf_transformation,[],[f8])).
% 0.20/0.29 thf(f13,plain,(
% 0.20/0.29 ( ! [X10 : a,X9 : a] : ((((sK9 @ X10 @ X9 @ X9 @ X10)) != $true) | ($true = ((sK7 @ X9 @ X10)))) )),
% 0.20/0.29 inference(cnf_transformation,[],[f8])).
% 0.20/0.29 thf(f15,plain,(
% 0.20/0.29 ( ! [X10 : a,X9 : a,X12 : a,X13 : a] : (($true = ((sK8 @ X10 @ X9 @ X12 @ X13))) | ($true = ((sK7 @ X9 @ X10))) | (((sK4 @ X12 @ X13)) != $true)) )),
% 0.20/0.29 inference(cnf_transformation,[],[f8])).
% 0.20/0.29 thf(f16,plain,(
% 0.20/0.29 ( ! [X10 : a,X9 : a] : ((((sK8 @ X10 @ X9 @ X9 @ X10)) != $true) | ($true = ((sK7 @ X9 @ X10)))) )),
% 0.20/0.29 inference(cnf_transformation,[],[f8])).
% 0.20/0.29 thf(f17,plain,(
% 0.20/0.29 ( ! [X5 : (a > a > $o)] : ((((sK4 @ (sK6 @ X5) @ (sK5 @ X5))) = $true) | (((sK0 @ (sK6 @ X5) @ (sK5 @ X5))) = $true) | (((sK1 @ X5)) != $true) | (((X5 @ sK2 @ sK3)) = $true)) )),
% 0.20/0.29 inference(cnf_transformation,[],[f8])).
% 0.20/0.29 thf(f18,plain,(
% 0.20/0.29 ( ! [X5 : (a > a > $o)] : ((((X5 @ (sK6 @ X5) @ (sK5 @ X5))) != $true) | (((sK1 @ X5)) != $true) | (((X5 @ sK2 @ sK3)) = $true)) )),
% 0.20/0.29 inference(cnf_transformation,[],[f8])).
% 0.20/0.29 thf(f21,definition,(
% 0.20/0.29 spl10_1 <=> ($true = ((sK7 @ sK2 @ sK3)))),
% 0.20/0.29 introduced(definition,[new_symbols(definition,[spl10_1])],[avatar_definition])).
% 0.20/0.29 thf(f23,plain,(
% 0.20/0.29 ($true != ((sK7 @ sK2 @ sK3))) | spl10_1),
% 0.20/0.29 inference(avatar_component_clause,[],[f21])).
% 0.20/0.29 thf(f24,plain,(
% 0.20/0.29 ~spl10_1),
% 0.20/0.29 inference(avatar_split_clause,[],[f9,f21])).
% 0.20/0.29 thf(f26,definition,(
% 0.20/0.29 spl10_2 <=> (((sK1 @ sK7)) = $true)),
% 0.20/0.29 introduced(definition,[new_symbols(definition,[spl10_2])],[avatar_definition])).
% 0.20/0.29 thf(f28,plain,(
% 0.20/0.29 (((sK1 @ sK7)) = $true) | ~spl10_2),
% 0.20/0.29 inference(avatar_component_clause,[],[f26])).
% 0.20/0.29 thf(f29,plain,(
% 0.20/0.29 spl10_2),
% 0.20/0.29 inference(avatar_split_clause,[],[f10,f26])).
% 0.20/0.29 thf(f30,plain,(
% 0.20/0.29 ( ! [X0 : a,X1 : a] : ((((sK7 @ X1 @ X0)) = $true) | (((sK7 @ X1 @ X0)) = $true) | (((sK0 @ X1 @ X0)) != $true) | ($true != $true)) )),
% 0.20/0.29 inference(superposition,[],[f13,f11])).
% 0.20/0.29 thf(f31,plain,(
% 0.20/0.29 ( ! [X0 : a,X1 : a] : (($true != $true) | (((sK7 @ X1 @ X0)) = $true) | (((sK0 @ X1 @ X0)) != $true)) )),
% 0.20/0.29 inference(duplicate_literal_removal,[],[f30])).
% 0.20/0.29 thf(f32,plain,(
% 0.20/0.29 ( ! [X0 : a,X1 : a] : ((((sK7 @ X1 @ X0)) = $true) | (((sK0 @ X1 @ X0)) != $true)) )),
% 0.20/0.29 inference(trivial_inequality_removal,[],[f31])).
% 0.20/0.29 thf(f33,plain,(
% 0.20/0.29 ( ! [X0 : a,X1 : a] : ((((sK7 @ X1 @ X0)) = $true) | (((sK7 @ X1 @ X0)) = $true) | ($true != ((sK4 @ X1 @ X0))) | ($true != $true)) )),
% 0.20/0.29 inference(superposition,[],[f16,f15])).
% 0.20/0.29 thf(f34,plain,(
% 0.20/0.29 ( ! [X0 : a,X1 : a] : (($true != ((sK4 @ X1 @ X0))) | ($true != $true) | (((sK7 @ X1 @ X0)) = $true)) )),
% 0.20/0.29 inference(duplicate_literal_removal,[],[f33])).
% 0.20/0.29 thf(f35,plain,(
% 0.20/0.29 ( ! [X0 : a,X1 : a] : ((((sK7 @ X1 @ X0)) = $true) | ($true != ((sK4 @ X1 @ X0)))) )),
% 0.20/0.29 inference(trivial_inequality_removal,[],[f34])).
% 0.20/0.29 thf(f58,plain,(
% 0.20/0.29 ($true = ((sK7 @ sK2 @ sK3))) | (((sK4 @ (sK6 @ sK7) @ (sK5 @ sK7))) != $true) | (((sK1 @ sK7)) != $true) | ($true != $true)),
% 0.20/0.29 inference(superposition,[],[f18,f35])).
% 0.20/0.29 thf(f59,plain,(
% 0.20/0.29 (((sK0 @ (sK6 @ sK7) @ (sK5 @ sK7))) != $true) | ($true = ((sK7 @ sK2 @ sK3))) | (((sK1 @ sK7)) != $true) | ($true != $true)),
% 0.20/0.29 inference(superposition,[],[f18,f32])).
% 0.20/0.29 thf(f66,plain,(
% 0.20/0.29 (((sK4 @ (sK6 @ sK7) @ (sK5 @ sK7))) != $true) | (((sK1 @ sK7)) != $true) | ($true = ((sK7 @ sK2 @ sK3)))),
% 0.20/0.29 inference(trivial_inequality_removal,[],[f58])).
% 0.20/0.29 thf(f76,plain,(
% 0.20/0.29 (((sK0 @ (sK6 @ sK7) @ (sK5 @ sK7))) != $true) | (((sK1 @ sK7)) != $true) | ($true = ((sK7 @ sK2 @ sK3)))),
% 0.20/0.29 inference(trivial_inequality_removal,[],[f59])).
% 0.20/0.29 thf(f92,plain,(
% 0.20/0.29 ($true = ((sK7 @ sK2 @ sK3))) | (((sK4 @ (sK6 @ sK7) @ (sK5 @ sK7))) != $true) | ~spl10_2),
% 0.20/0.29 inference(forward_subsumption_resolution,[],[f66,f28])).
% 0.20/0.29 thf(f102,plain,(
% 0.20/0.29 (((sK0 @ (sK6 @ sK7) @ (sK5 @ sK7))) != $true) | ($true = ((sK7 @ sK2 @ sK3))) | ~spl10_2),
% 0.20/0.29 inference(forward_subsumption_resolution,[],[f76,f28])).
% 0.20/0.29 thf(f104,plain,(
% 0.20/0.29 (((sK4 @ (sK6 @ sK7) @ (sK5 @ sK7))) != $true) | (spl10_1 | ~spl10_2)),
% 0.20/0.29 inference(forward_subsumption_resolution,[],[f92,f23])).
% 0.20/0.29 thf(f105,plain,(
% 0.20/0.29 (((sK0 @ (sK6 @ sK7) @ (sK5 @ sK7))) != $true) | (spl10_1 | ~spl10_2)),
% 0.20/0.29 inference(forward_subsumption_resolution,[],[f102,f23])).
% 0.20/0.29 thf(f107,definition,(
% 0.20/0.29 spl10_10 <=> (((sK4 @ (sK6 @ sK7) @ (sK5 @ sK7))) = $true)),
% 0.20/0.29 introduced(definition,[new_symbols(definition,[spl10_10])],[avatar_definition])).
% 0.20/0.29 thf(f109,plain,(
% 0.20/0.29 (((sK4 @ (sK6 @ sK7) @ (sK5 @ sK7))) != $true) | spl10_10),
% 0.20/0.29 inference(avatar_component_clause,[],[f107])).
% 0.20/0.29 thf(f110,plain,(
% 0.20/0.29 ~spl10_10 | spl10_1 | ~spl10_2),
% 0.20/0.29 inference(avatar_split_clause,[],[f104,f26,f21,f107])).
% 0.20/0.29 thf(f112,definition,(
% 0.20/0.29 spl10_11 <=> (((sK0 @ (sK6 @ sK7) @ (sK5 @ sK7))) = $true)),
% 0.20/0.29 introduced(definition,[new_symbols(definition,[spl10_11])],[avatar_definition])).
% 0.20/0.29 thf(f115,plain,(
% 0.20/0.29 ~spl10_11 | spl10_1 | ~spl10_2),
% 0.20/0.29 inference(avatar_split_clause,[],[f105,f26,f21,f112])).
% 0.20/0.29 thf(f208,plain,(
% 0.20/0.29 ($true = ((sK7 @ sK2 @ sK3))) | (((sK1 @ sK7)) != $true) | ($true != $true) | (((sK0 @ (sK6 @ sK7) @ (sK5 @ sK7))) = $true) | spl10_10),
% 0.20/0.29 inference(superposition,[],[f109,f17])).
% 0.20/0.29 thf(f209,plain,(
% 0.20/0.29 ($true = ((sK7 @ sK2 @ sK3))) | (((sK1 @ sK7)) != $true) | (((sK0 @ (sK6 @ sK7) @ (sK5 @ sK7))) = $true) | spl10_10),
% 0.20/0.29 inference(trivial_inequality_removal,[],[f208])).
% 0.20/0.29 thf(f210,plain,(
% 0.20/0.29 (((sK0 @ (sK6 @ sK7) @ (sK5 @ sK7))) = $true) | (((sK1 @ sK7)) != $true) | (spl10_1 | spl10_10)),
% 0.20/0.29 inference(forward_subsumption_resolution,[],[f209,f23])).
% 0.20/0.29 thf(f211,plain,(
% 0.20/0.29 (((sK0 @ (sK6 @ sK7) @ (sK5 @ sK7))) = $true) | (spl10_1 | ~spl10_2 | spl10_10)),
% 0.20/0.29 inference(forward_subsumption_resolution,[],[f210,f28])).
% 0.20/0.29 thf(f212,plain,(
% 0.20/0.29 spl10_11 | spl10_1 | ~spl10_2 | spl10_10),
% 0.20/0.29 inference(avatar_split_clause,[],[f211,f107,f26,f21,f112])).
% 0.20/0.29 cnf(s1, plain, ~spl10_1, inference(sat_conversion,[],[f24])).
% 0.20/0.29 cnf(s2, plain, spl10_2, inference(sat_conversion,[],[f29])).
% 0.20/0.29 cnf(s7, plain, spl10_1 | ~spl10_2 | ~spl10_10, inference(sat_conversion,[],[f110])).
% 0.20/0.29 cnf(s8, plain, spl10_1 | ~spl10_2 | ~spl10_11, inference(sat_conversion,[],[f115])).
% 0.20/0.29 cnf(s14, plain, spl10_1 | ~spl10_2 | spl10_10 | spl10_11, inference(sat_conversion,[],[f212])).
% 0.20/0.29 cnf(s15, plain, ~spl10_11, inference(rat,[],[s8,s2,s1])).
% 0.20/0.29 cnf(s16, plain, ~spl10_10, inference(rat,[],[s7,s2,s1])).
% 0.20/0.29 cnf(s19, plain, $false, inference(rat,[],[s14,s1,s2,s15,s16])).
% 0.20/0.29 thf(f213,plain,(
% 0.20/0.29 $false),
% 0.20/0.29 inference(avatar_sat_refutation,[],[s19])).
% 0.20/0.29 % SZS output end Proof for theBenchmark
% 0.20/0.29 % (1783998)------------------------------
% 0.20/0.29 % (1783998)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (1783998)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (1783998)CaDiCaL version: 2.1.3
% 0.20/0.29 % (1783998)Termination reason: Refutation
% 0.20/0.29 % (1783998)Time elapsed: 0.006 s
% 0.20/0.29 % (1783998)Peak memory usage: 13 MB
% 0.20/0.29 % (1783998)Instructions burned: 17 (million)
% 0.20/0.29 % (1783990)Success in time 0.036 s
% 0.20/0.29 % Vampire exiting
%------------------------------------------------------------------------------