%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV398^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 : n012.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:38:34 AM UTC 2026
% Result : Theorem 0.09s 0.17s
% Output : Refutation 0.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEV398^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Tue Sep 29 15:43:48 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.12 Running higher-order theorem proving
% 0.09/0.13 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.17 % (272371)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.09/0.17 % (272382)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.09/0.17 % (272382)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.09/0.17 % (272381)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3509061881:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.09/0.17 % (272379)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=1488155835: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.09/0.17 % (272378)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3726836249:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.09/0.17 % (272376)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=682026057:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.09/0.17 % (272377)lrs+10_16_si=on:nwc=1.5:random_seed=902566939:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.09/0.17 % (272380)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=281084925:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.09/0.17 % (272382)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=2633824340:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.09/0.17 % (272378)Instruction limit reached!
% 0.09/0.17 % (272378)------------------------------
% 0.09/0.17 % (272378)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.17 % (272378)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.17 % (272378)CaDiCaL version: 2.1.3
% 0.09/0.17 % (272378)Termination reason: Instruction limit
% 0.09/0.17 % (272378)Termination phase: Saturation
% 0.09/0.17 % (272378)Time elapsed: 0.004 s
% 0.09/0.17 % (272378)Peak memory usage: 12 MB
% 0.09/0.17 % (272378)Instructions burned: 8 (million)
% 0.09/0.17 % (272379) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-272371-272379"...
% 0.09/0.17 % (272379)...printing done.
% 0.09/0.17 % (272377)Instruction limit reached!
% 0.09/0.17 % (272377)------------------------------
% 0.09/0.17 % (272377)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.17 % (272377)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.17 % (272377)CaDiCaL version: 2.1.3
% 0.09/0.17 % (272377)Termination reason: Instruction limit
% 0.09/0.17 % (272377)Termination phase: Saturation
% 0.09/0.17 % (272377)Time elapsed: 0.006 s
% 0.09/0.17 % (272377)Peak memory usage: 12 MB
% 0.09/0.17 % (272377)Instructions burned: 20 (million)
% 0.09/0.17 % (272380)Instruction limit reached!
% 0.09/0.17 % (272380)------------------------------
% 0.09/0.17 % (272380)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.17 % (272380)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.17 % (272380)CaDiCaL version: 2.1.3
% 0.09/0.17 % (272380)Termination reason: Instruction limit
% 0.09/0.17 % (272380)Termination phase: Saturation
% 0.09/0.17 % (272380)Time elapsed: 0.007 s
% 0.09/0.17 % (272380)Peak memory usage: 11 MB
% 0.09/0.17 % (272380)Instructions burned: 25 (million)
% 0.09/0.17 % (272379)Refutation found. Thanks to Tanya!
% 0.09/0.17 % SZS status Theorem for theBenchmark
% 0.09/0.17 % SZS output start Proof for theBenchmark
% 0.09/0.17 thf(type_def_5, type, a: $tType).
% 0.09/0.17 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.09/0.17 thf(func_def_0, type, cF: ((a > $o) > a > $o)).
% 0.09/0.17 thf(func_def_1, type, cG: ((a > $o) > a > $o)).
% 0.09/0.17 thf(func_def_5, type, sK0: (a > $o)).
% 0.09/0.17 thf(func_def_6, type, sK1: a).
% 0.09/0.17 thf(func_def_7, type, sK2: ((a > $o) > (a > $o) > a)).
% 0.09/0.17 thf(func_def_8, type, vNOT: ($o > $o)).
% 0.09/0.17 thf(func_def_10, type, db0: !>[X0: $tType]:(X0)).
% 0.09/0.17 thf(func_def_11, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.09/0.17 thf(f1,conjecture,(
% 0.09/0.17 (! [X1 : (a > $o),X0 : (a > $o)] : (! [X2 : a] : ((X0 @ X2) => (X1 @ X2)) => ! [X2 : a] : ((cF @ X1 @ X2) => (cF @ X0 @ X2))) & ! [X0 : (a > $o)] : (! [X2 : a] : ((X0 @ X2) => (cG @ (cF @ X0) @ X2)) & ! [X2 : a] : ((X0 @ X2) => (cF @ (cG @ X0) @ X2)))) => ! [X2 : a,X0 : (a > $o)] : ((cF @ (cG @ (cF @ X0)) @ X2) <=> (cF @ X0 @ X2))),
% 0.09/0.17 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM67A_pme)).
% 0.09/0.17 thf(f2,negated_conjecture,(
% 0.09/0.17 ~((! [X1 : (a > $o),X0 : (a > $o)] : (! [X2 : a] : ((X0 @ X2) => (X1 @ X2)) => ! [X2 : a] : ((cF @ X1 @ X2) => (cF @ X0 @ X2))) & ! [X0 : (a > $o)] : (! [X2 : a] : ((X0 @ X2) => (cG @ (cF @ X0) @ X2)) & ! [X2 : a] : ((X0 @ X2) => (cF @ (cG @ X0) @ X2)))) => ! [X2 : a,X0 : (a > $o)] : ((cF @ (cG @ (cF @ X0)) @ X2) <=> (cF @ X0 @ X2)))),
% 0.09/0.17 inference(negated_conjecture,[status(cth)],[f1])).
% 0.09/0.17 thf(f3,plain,(
% 0.09/0.17 ~((! [X0 : (a > $o),X1 : (a > $o)] : (! [X2 : a] : ((X1 @ X2) => (X0 @ X2)) => ! [X3 : a] : ((cF @ X0 @ X3) => (cF @ X1 @ X3))) & ! [X4 : (a > $o)] : (! [X5 : a] : ((X4 @ X5) => (cG @ (cF @ X4) @ X5)) & ! [X6 : a] : ((X4 @ X6) => (cF @ (cG @ X4) @ X6)))) => ! [X7 : a,X8 : (a > $o)] : ((cF @ (cG @ (cF @ X8)) @ X7) <=> (cF @ X8 @ X7)))),
% 0.09/0.17 inference(rectify,[],[f2])).
% 0.09/0.17 thf(f4,plain,(
% 0.09/0.17 ~((! [X0 : (a > $o),X1 : (a > $o)] : (! [X2 : a] : ((((X1 @ X2)) = $true) => (((X0 @ X2)) = $true)) => ! [X3 : a] : (($true = ((cF @ X0 @ X3))) => (((cF @ X1 @ X3)) = $true))) & ! [X4 : (a > $o)] : (! [X5 : a] : ((((X4 @ X5)) = $true) => (((cG @ (cF @ X4) @ X5)) = $true)) & ! [X6 : a] : ((((X4 @ X6)) = $true) => (((cF @ (cG @ X4) @ X6)) = $true)))) => ! [X8 : (a > $o),X7 : a] : (((cF @ (cG @ (cF @ X8)) @ X7)) = ((cF @ X8 @ X7))))),
% 0.09/0.17 inference(fool_elimination,[],[f3])).
% 0.09/0.17 thf(f5,plain,(
% 0.09/0.17 ? [X8 : (a > $o),X7 : a] : (((cF @ (cG @ (cF @ X8)) @ X7)) != ((cF @ X8 @ X7))) & (! [X1 : (a > $o),X0 : (a > $o)] : (? [X2 : a] : ((((X1 @ X2)) = $true) & (((X0 @ X2)) != $true)) | ! [X3 : a] : (($true != ((cF @ X0 @ X3))) | (((cF @ X1 @ X3)) = $true))) & ! [X4 : (a > $o)] : (! [X6 : a] : ((((cF @ (cG @ X4) @ X6)) = $true) | (((X4 @ X6)) != $true)) & ! [X5 : a] : ((((cG @ (cF @ X4) @ X5)) = $true) | (((X4 @ X5)) != $true))))),
% 0.09/0.17 inference(ennf_transformation,[],[f4])).
% 0.09/0.17 thf(f6,plain,(
% 0.09/0.17 ? [X8 : (a > $o),X7 : a] : (((cF @ (cG @ (cF @ X8)) @ X7)) != ((cF @ X8 @ X7))) & ! [X1 : (a > $o),X0 : (a > $o)] : (? [X2 : a] : ((((X1 @ X2)) = $true) & (((X0 @ X2)) != $true)) | ! [X3 : a] : (($true != ((cF @ X0 @ X3))) | (((cF @ X1 @ X3)) = $true))) & ! [X4 : (a > $o)] : (! [X6 : a] : ((((cF @ (cG @ X4) @ X6)) = $true) | (((X4 @ X6)) != $true)) & ! [X5 : a] : ((((cG @ (cF @ X4) @ X5)) = $true) | (((X4 @ X5)) != $true)))),
% 0.09/0.17 inference(flattening,[],[f5])).
% 0.09/0.17 thf(f7,plain,(
% 0.09/0.17 ? [X0 : (a > $o),X1 : a] : (((cF @ (cG @ (cF @ X0)) @ X1)) != ((cF @ X0 @ X1))) & ! [X2 : (a > $o),X3 : (a > $o)] : (? [X4 : a] : (($true = ((X2 @ X4))) & (((X3 @ X4)) != $true)) | ! [X5 : a] : ((((cF @ X3 @ X5)) != $true) | (((cF @ X2 @ X5)) = $true))) & ! [X6 : (a > $o)] : (! [X7 : a] : ((((cF @ (cG @ X6) @ X7)) = $true) | (((X6 @ X7)) != $true)) & ! [X8 : a] : (($true = ((cG @ (cF @ X6) @ X8))) | ($true != ((X6 @ X8)))))),
% 0.09/0.17 inference(rectify,[],[f6])).
% 0.09/0.17 thf(f8,plain,(
% 0.09/0.17 (((cF @ sK0 @ sK1)) != ((cF @ (cG @ (cF @ sK0)) @ sK1))) & ! [X2 : (a > $o),X3 : (a > $o)] : (((((X2 @ (sK2 @ X3 @ X2))) = $true) & (((X3 @ (sK2 @ X3 @ X2))) != $true)) | ! [X5 : a] : ((((cF @ X3 @ X5)) != $true) | (((cF @ X2 @ X5)) = $true))) & ! [X6 : (a > $o)] : (! [X7 : a] : ((((cF @ (cG @ X6) @ X7)) = $true) | (((X6 @ X7)) != $true)) & ! [X8 : a] : (($true = ((cG @ (cF @ X6) @ X8))) | ($true != ((X6 @ X8)))))),
% 0.09/0.17 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,vAPP]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X4,sK2 @ X3 @ X2)],[f7])).
% 0.09/0.17 thf(f9,plain,(
% 0.09/0.17 ( ! [X8 : a,X6 : (a > $o)] : (($true = ((cG @ (cF @ X6) @ X8))) | ($true != ((X6 @ X8)))) )),
% 0.09/0.17 inference(cnf_transformation,[],[f8])).
% 0.09/0.17 thf(f10,plain,(
% 0.09/0.17 ( ! [X6 : (a > $o),X7 : a] : ((((cF @ (cG @ X6) @ X7)) = $true) | (((X6 @ X7)) != $true)) )),
% 0.09/0.17 inference(cnf_transformation,[],[f8])).
% 0.09/0.17 thf(f11,plain,(
% 0.09/0.17 ( ! [X2 : (a > $o),X3 : (a > $o),X5 : a] : ((((X3 @ (sK2 @ X3 @ X2))) != $true) | (((cF @ X3 @ X5)) != $true) | (((cF @ X2 @ X5)) = $true)) )),
% 0.09/0.17 inference(cnf_transformation,[],[f8])).
% 0.09/0.17 thf(f12,plain,(
% 0.09/0.17 ( ! [X2 : (a > $o),X3 : (a > $o),X5 : a] : ((((X2 @ (sK2 @ X3 @ X2))) = $true) | (((cF @ X3 @ X5)) != $true) | (((cF @ X2 @ X5)) = $true)) )),
% 0.09/0.17 inference(cnf_transformation,[],[f8])).
% 0.09/0.17 thf(f13,plain,(
% 0.09/0.17 (((cF @ sK0 @ sK1)) != ((cF @ (cG @ (cF @ sK0)) @ sK1)))),
% 0.09/0.17 inference(cnf_transformation,[],[f8])).
% 0.09/0.17 thf(f15,plain,(
% 0.09/0.17 (((cF @ (cG @ (cF @ sK0)) @ sK1)) = $true) | (((cF @ sK0 @ sK1)) = $true)),
% 0.09/0.17 inference(xor_proxy_clausification,[],[f13])).
% 0.09/0.17 thf(f16,plain,(
% 0.09/0.17 ($false = ((cF @ sK0 @ sK1))) | ($false = ((cF @ (cG @ (cF @ sK0)) @ sK1)))),
% 0.09/0.17 inference(xor_proxy_clausification,[],[f13])).
% 0.09/0.17 thf(f18,definition,(
% 0.09/0.17 spl3_1 <=> ($false = ((cF @ (cG @ (cF @ sK0)) @ sK1)))),
% 0.09/0.17 introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition])).
% 0.09/0.17 thf(f20,plain,(
% 0.09/0.17 ($false = ((cF @ (cG @ (cF @ sK0)) @ sK1))) | ~spl3_1),
% 0.09/0.17 inference(avatar_component_clause,[],[f18])).
% 0.09/0.17 thf(f22,definition,(
% 0.09/0.17 spl3_2 <=> ($false = ((cF @ sK0 @ sK1)))),
% 0.09/0.17 introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition])).
% 0.09/0.17 thf(f24,plain,(
% 0.09/0.17 ($false = ((cF @ sK0 @ sK1))) | ~spl3_2),
% 0.09/0.17 inference(avatar_component_clause,[],[f22])).
% 0.09/0.17 thf(f25,plain,(
% 0.09/0.17 spl3_1 | spl3_2),
% 0.09/0.17 inference(avatar_split_clause,[],[f16,f22,f18])).
% 0.09/0.17 thf(f27,definition,(
% 0.09/0.17 spl3_3 <=> (((cF @ sK0 @ sK1)) = $true)),
% 0.09/0.17 introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition])).
% 0.09/0.17 thf(f29,plain,(
% 0.09/0.17 (((cF @ sK0 @ sK1)) = $true) | ~spl3_3),
% 0.09/0.17 inference(avatar_component_clause,[],[f27])).
% 0.09/0.17 thf(f31,definition,(
% 0.09/0.17 spl3_4 <=> (((cF @ (cG @ (cF @ sK0)) @ sK1)) = $true)),
% 0.09/0.17 introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition])).
% 0.09/0.17 thf(f33,plain,(
% 0.09/0.17 (((cF @ (cG @ (cF @ sK0)) @ sK1)) = $true) | ~spl3_4),
% 0.09/0.17 inference(avatar_component_clause,[],[f31])).
% 0.09/0.17 thf(f34,plain,(
% 0.09/0.17 spl3_3 | spl3_4),
% 0.09/0.17 inference(avatar_split_clause,[],[f15,f31,f27])).
% 0.09/0.17 thf(f35,plain,(
% 0.09/0.17 ($false = $true) | (~spl3_2 | ~spl3_3)),
% 0.09/0.17 inference(forward_demodulation,[],[f29,f24])).
% 0.09/0.17 thf(f36,plain,(
% 0.09/0.17 $false | (~spl3_2 | ~spl3_3)),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f35])).
% 0.09/0.17 thf(f37,plain,(
% 0.09/0.17 ~spl3_2 | ~spl3_3),
% 0.09/0.17 inference(avatar_contradiction_clause,[],[f36])).
% 0.09/0.17 thf(f53,plain,(
% 0.09/0.17 ( ! [X2 : a,X0 : (a > $o),X1 : (a > $o)] : ((((cF @ (cG @ (cF @ X0)) @ X2)) != $true) | ($true != $true) | ($true != ((X0 @ (sK2 @ (cG @ (cF @ X0)) @ X1)))) | (((cF @ X1 @ X2)) = $true)) )),
% 0.09/0.17 inference(superposition,[],[f11,f9])).
% 0.09/0.17 thf(f56,plain,(
% 0.09/0.17 ( ! [X2 : a,X0 : (a > $o),X1 : (a > $o)] : (($true != ((X0 @ (sK2 @ (cG @ (cF @ X0)) @ X1)))) | (((cF @ X1 @ X2)) = $true) | (((cF @ (cG @ (cF @ X0)) @ X2)) != $true)) )),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f53])).
% 0.09/0.17 thf(f129,plain,(
% 0.09/0.17 ( ! [X2 : a,X0 : (a > $o),X1 : a] : ((((cF @ X0 @ X1)) = $true) | (((cF @ X0 @ X2)) = $true) | (((cF @ (cG @ (cF @ X0)) @ X2)) != $true) | (((cF @ (cG @ (cF @ X0)) @ X1)) != $true) | ($true != $true)) )),
% 0.09/0.17 inference(superposition,[],[f56,f12])).
% 0.09/0.17 thf(f136,plain,(
% 0.09/0.17 ( ! [X2 : a,X0 : (a > $o),X1 : a] : ((((cF @ (cG @ (cF @ X0)) @ X2)) != $true) | (((cF @ (cG @ (cF @ X0)) @ X1)) != $true) | (((cF @ X0 @ X2)) = $true) | (((cF @ X0 @ X1)) = $true)) )),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f129])).
% 0.09/0.17 thf(f143,plain,(
% 0.09/0.17 ( ! [X0 : a] : ((((cF @ sK0 @ X0)) = $true) | ($true != $true) | ($true != ((cF @ (cG @ (cF @ sK0)) @ X0))) | (((cF @ sK0 @ sK1)) = $true)) ) | ~spl3_4),
% 0.09/0.17 inference(superposition,[],[f136,f33])).
% 0.09/0.17 thf(f149,plain,(
% 0.09/0.17 ( ! [X0 : a] : (($true != ((cF @ (cG @ (cF @ sK0)) @ X0))) | (((cF @ sK0 @ sK1)) = $true) | (((cF @ sK0 @ X0)) = $true)) ) | ~spl3_4),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f143])).
% 0.09/0.17 thf(f150,plain,(
% 0.09/0.17 ( ! [X0 : a] : (($false = $true) | ($true != ((cF @ (cG @ (cF @ sK0)) @ X0))) | (((cF @ sK0 @ X0)) = $true)) ) | (~spl3_2 | ~spl3_4)),
% 0.09/0.17 inference(forward_demodulation,[],[f149,f24])).
% 0.09/0.17 thf(f151,plain,(
% 0.09/0.17 ( ! [X0 : a] : (($true != ((cF @ (cG @ (cF @ sK0)) @ X0))) | (((cF @ sK0 @ X0)) = $true)) ) | (~spl3_2 | ~spl3_4)),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f150])).
% 0.09/0.17 thf(f153,plain,(
% 0.09/0.17 (((cF @ sK0 @ sK1)) = $true) | ($true != $true) | (~spl3_2 | ~spl3_4)),
% 0.09/0.17 inference(superposition,[],[f151,f33])).
% 0.09/0.17 thf(f159,plain,(
% 0.09/0.17 (((cF @ sK0 @ sK1)) = $true) | (~spl3_2 | ~spl3_4)),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f153])).
% 0.09/0.17 thf(f160,plain,(
% 0.09/0.17 ($false = $true) | (~spl3_2 | ~spl3_4)),
% 0.09/0.17 inference(forward_demodulation,[],[f159,f24])).
% 0.09/0.17 thf(f161,plain,(
% 0.09/0.17 $false | (~spl3_2 | ~spl3_4)),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f160])).
% 0.09/0.17 thf(f162,plain,(
% 0.09/0.17 ~spl3_2 | ~spl3_4),
% 0.09/0.17 inference(avatar_contradiction_clause,[],[f161])).
% 0.09/0.17 thf(f167,plain,(
% 0.09/0.17 ($false = $true) | (~spl3_1 | ~spl3_4)),
% 0.09/0.17 inference(superposition,[],[f20,f33])).
% 0.09/0.17 thf(f171,plain,(
% 0.09/0.17 ($false = $true) | (((cF @ sK0 @ sK1)) != $true) | ~spl3_1),
% 0.09/0.17 inference(superposition,[],[f10,f20])).
% 0.09/0.17 thf(f172,plain,(
% 0.09/0.17 (((cF @ sK0 @ sK1)) != $true) | ~spl3_1),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f171])).
% 0.09/0.17 thf(f176,plain,(
% 0.09/0.17 $false | (~spl3_1 | ~spl3_4)),
% 0.09/0.17 inference(trivial_inequality_removal,[],[f167])).
% 0.09/0.17 thf(f177,plain,(
% 0.09/0.17 ~spl3_1 | ~spl3_4),
% 0.09/0.17 inference(avatar_contradiction_clause,[],[f176])).
% 0.09/0.17 thf(f178,plain,(
% 0.09/0.17 ~spl3_3 | ~spl3_1),
% 0.09/0.17 inference(avatar_split_clause,[],[f172,f18,f27])).
% 0.09/0.17 cnf(s1, plain, spl3_1 | spl3_2, inference(sat_conversion,[],[f25])).
% 0.09/0.17 cnf(s2, plain, spl3_3 | spl3_4, inference(sat_conversion,[],[f34])).
% 0.09/0.17 cnf(s3, plain, ~spl3_2 | ~spl3_3, inference(sat_conversion,[],[f37])).
% 0.09/0.17 cnf(s6, plain, ~spl3_2 | ~spl3_4, inference(sat_conversion,[],[f162])).
% 0.09/0.17 cnf(s9, plain, ~spl3_1 | ~spl3_4, inference(sat_conversion,[],[f177])).
% 0.09/0.17 cnf(s10, plain, ~spl3_1 | ~spl3_3, inference(sat_conversion,[],[f178])).
% 0.09/0.17 cnf(s12, plain, ~spl3_2, inference(rat,[],[s2,s3,s6])).
% 0.09/0.17 cnf(s13, plain, spl3_1, inference(rat,[],[s1,s12])).
% 0.09/0.17 cnf(s14, plain, ~spl3_3, inference(rat,[],[s10,s13])).
% 0.09/0.17 cnf(s15, plain, ~spl3_4, inference(rat,[],[s9,s13])).
% 0.09/0.17 cnf(s16, plain, $false, inference(rat,[],[s2,s15,s14])).
% 0.09/0.17 thf(f179,plain,(
% 0.09/0.17 $false),
% 0.09/0.17 inference(avatar_sat_refutation,[],[s16])).
% 0.09/0.17 % SZS output end Proof for theBenchmark
% 0.09/0.17 % (272379)------------------------------
% 0.09/0.17 % (272379)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.17 % (272379)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.17 % (272379)CaDiCaL version: 2.1.3
% 0.09/0.17 % (272379)Termination reason: Refutation
% 0.09/0.17 % (272379)Time elapsed: 0.006 s
% 0.09/0.17 % (272379)Peak memory usage: 13 MB
% 0.09/0.17 % (272379)Instructions burned: 16 (million)
% 0.09/0.17 % (272371)Success in time 0.031 s
% 0.09/0.17 % Vampire exiting
%------------------------------------------------------------------------------