%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM691^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:19:19 AM UTC 2026
% Result : Theorem 0.23s 0.30s
% Output : Refutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM691^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.22 % Computer : n008.cluster.edu
% 0.11/0.22 % Model : x86_64 x86_64
% 0.11/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.22 % Memory : 8046.5625MB
% 0.11/0.22 % OS : Linux 6.8.0-71-generic
% 0.11/0.22 % CPULimit : 300
% 0.11/0.22 % WCLimit : 300
% 0.11/0.22 % DateTime : Tue Sep 29 12:40:09 UTC 2026
% 0.11/0.22 % CPUTime :
% 0.11/0.22 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.25 Running first-order model finding
% 0.11/0.25 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.30 % (3086999)Will run a generic schedule for satisfiability detection.
% 0.23/0.30 % (3087009)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3427898141_2999 on theBenchmark for (2999ds/0Mi)
% 0.23/0.30 % Exception at run slice level
% 0.23/0.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.23/0.30 % (3087011)% WARNING: option uhcvi not known.
% 0.23/0.30 % (3087013)dis+10_1_sil=32000:sp=arity:random_seed=851042368:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.23/0.30 % (3087011)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3231307914:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.23/0.30 % (3087015)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2462256676:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.23/0.30 % (3087012)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3380338141:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.23/0.30 % (3087014)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=356541986:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.23/0.30 % (3087011)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.23/0.30 % (3087016)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=946298898:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.23/0.30 % (3087011)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.23/0.30 % (3087014)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.23/0.30 % (3087022)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=893428414:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.23/0.30 % Exception at run slice level
% 0.23/0.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.23/0.30 % (3087014) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3086999-3087014"...
% 0.23/0.30 % (3087015) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3086999-3087015"...
% 0.23/0.30 % (3087014)...printing done.
% 0.23/0.30 % (3087013) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3086999-3087013"...
% 0.23/0.30 % (3087014)Refutation found. Thanks to Tanya!
% 0.23/0.30 % SZS status Theorem for theBenchmark
% 0.23/0.30 % SZS output start Proof for theBenchmark
% 0.23/0.30 thf(type_def_5, type, nat: $tType).
% 0.23/0.30 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.23/0.30 thf(func_def_0, type, x: nat).
% 0.23/0.30 thf(func_def_1, type, y: nat).
% 0.23/0.30 thf(func_def_2, type, z: nat).
% 0.23/0.30 thf(func_def_3, type, u: nat).
% 0.23/0.30 thf(func_def_4, type, more: (nat > nat > $o)).
% 0.23/0.30 thf(func_def_6, type, pl: (nat > nat > nat)).
% 0.23/0.30 thf(func_def_9, type, vNOT: ($o > $o)).
% 0.23/0.30 thf(f1,axiom,(
% 0.23/0.30 ~(more @ x @ y) => (x = y)),
% 0.23/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m)).
% 0.23/0.30 thf(f2,axiom,(
% 0.23/0.30 ~(more @ z @ u) => (z = u)),
% 0.23/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n)).
% 0.23/0.30 thf(f4,axiom,(
% 0.23/0.30 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : ((~(more @ X0 @ X1) => (X0 = X1)) => ((more @ X2 @ X3) => (more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))))),
% 0.23/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz22a)).
% 0.23/0.30 thf(f5,axiom,(
% 0.23/0.30 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : ((more @ X0 @ X1) => ((~(more @ X2 @ X3) => (X2 = X3)) => (more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))))),
% 0.23/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz22b)).
% 0.23/0.30 thf(f6,conjecture,(
% 0.23/0.30 ~(more @ (pl @ x @ z) @ (pl @ y @ u)) => (((pl @ x @ z)) = ((pl @ y @ u)))),
% 0.23/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz23)).
% 0.23/0.30 thf(f7,negated_conjecture,(
% 0.23/0.30 ~(~(more @ (pl @ x @ z) @ (pl @ y @ u)) => (((pl @ x @ z)) = ((pl @ y @ u))))),
% 0.23/0.30 inference(negated_conjecture,[status(cth)],[f6])).
% 0.23/0.30 thf(f8,plain,(
% 0.23/0.30 ~(more @ x @ y) => (x = y)),
% 0.23/0.30 inference(rectify,[],[f1])).
% 0.23/0.30 thf(f9,plain,(
% 0.23/0.30 ~ (((more @ x @ y)) = $true) => (x = y)),
% 0.23/0.30 inference(fool_elimination,[],[f8])).
% 0.23/0.30 thf(f10,plain,(
% 0.23/0.30 ~(more @ z @ u) => (z = u)),
% 0.23/0.30 inference(rectify,[],[f2])).
% 0.23/0.30 thf(f11,plain,(
% 0.23/0.30 ~ (((more @ z @ u)) = $true) => (z = u)),
% 0.23/0.30 inference(fool_elimination,[],[f10])).
% 0.23/0.30 thf(f14,plain,(
% 0.23/0.30 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : ((~(more @ X0 @ X1) => (X0 = X1)) => ((more @ X2 @ X3) => (more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))))),
% 0.23/0.31 inference(rectify,[],[f4])).
% 0.23/0.31 thf(f15,plain,(
% 0.23/0.31 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : ((~ (((more @ X0 @ X1)) = $true) => (X0 = X1)) => ((((more @ X2 @ X3)) = $true) => (((more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))) = $true)))),
% 0.23/0.31 inference(fool_elimination,[],[f14])).
% 0.23/0.31 thf(f16,plain,(
% 0.23/0.31 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : ((more @ X0 @ X1) => ((~(more @ X2 @ X3) => (X2 = X3)) => (more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))))),
% 0.23/0.31 inference(rectify,[],[f5])).
% 0.23/0.31 thf(f17,plain,(
% 0.23/0.31 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : ((((more @ X0 @ X1)) = $true) => ((~ (((more @ X2 @ X3)) = $true) => (X2 = X3)) => (((more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))) = $true)))),
% 0.23/0.31 inference(fool_elimination,[],[f16])).
% 0.23/0.31 thf(f18,plain,(
% 0.23/0.31 ~(~(more @ (pl @ x @ z) @ (pl @ y @ u)) => (((pl @ x @ z)) = ((pl @ y @ u))))),
% 0.23/0.31 inference(rectify,[],[f7])).
% 0.23/0.31 thf(f19,plain,(
% 0.23/0.31 ~(~ (((more @ (pl @ x @ z) @ (pl @ y @ u))) = $true) => (((pl @ x @ z)) = ((pl @ y @ u))))),
% 0.23/0.31 inference(fool_elimination,[],[f18])).
% 0.23/0.31 thf(f20,plain,(
% 0.23/0.31 (((more @ x @ y)) != $true) => (x = y)),
% 0.23/0.31 inference(flattening,[],[f9])).
% 0.23/0.31 thf(f21,plain,(
% 0.23/0.31 (((more @ z @ u)) != $true) => (z = u)),
% 0.23/0.31 inference(flattening,[],[f11])).
% 0.23/0.31 thf(f23,plain,(
% 0.23/0.31 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : (((((more @ X0 @ X1)) != $true) => (X0 = X1)) => ((((more @ X2 @ X3)) = $true) => (((more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))) = $true)))),
% 0.23/0.31 inference(flattening,[],[f15])).
% 0.23/0.31 thf(f24,plain,(
% 0.23/0.31 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : ((((more @ X0 @ X1)) = $true) => (((((more @ X2 @ X3)) != $true) => (X2 = X3)) => (((more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))) = $true)))),
% 0.23/0.31 inference(flattening,[],[f17])).
% 0.23/0.31 thf(f25,plain,(
% 0.23/0.31 ~((((more @ (pl @ x @ z) @ (pl @ y @ u))) != $true) => (((pl @ x @ z)) = ((pl @ y @ u))))),
% 0.23/0.31 inference(flattening,[],[f19])).
% 0.23/0.31 thf(f26,plain,(
% 0.23/0.31 (x = y) | (((more @ x @ y)) = $true)),
% 0.23/0.31 inference(ennf_transformation,[],[f20])).
% 0.23/0.31 thf(f27,plain,(
% 0.23/0.31 (z = u) | (((more @ z @ u)) = $true)),
% 0.23/0.31 inference(ennf_transformation,[],[f21])).
% 0.23/0.31 thf(f29,plain,(
% 0.23/0.31 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : (((((more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))) = $true) | (((more @ X2 @ X3)) != $true)) | ((X0 != X1) & (((more @ X0 @ X1)) != $true)))),
% 0.23/0.31 inference(ennf_transformation,[],[f23])).
% 0.23/0.31 thf(f30,plain,(
% 0.23/0.31 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : ((((more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))) = $true) | (((more @ X2 @ X3)) != $true) | ((X0 != X1) & (((more @ X0 @ X1)) != $true)))),
% 0.23/0.31 inference(flattening,[],[f29])).
% 0.23/0.31 thf(f31,plain,(
% 0.23/0.31 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : (((((more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))) = $true) | ((X2 != X3) & (((more @ X2 @ X3)) != $true))) | (((more @ X0 @ X1)) != $true))),
% 0.23/0.31 inference(ennf_transformation,[],[f24])).
% 0.23/0.31 thf(f32,plain,(
% 0.23/0.31 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : ((((more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))) = $true) | ((X2 != X3) & (((more @ X2 @ X3)) != $true)) | (((more @ X0 @ X1)) != $true))),
% 0.23/0.31 inference(flattening,[],[f31])).
% 0.23/0.31 thf(f33,plain,(
% 0.23/0.31 (((pl @ x @ z)) != ((pl @ y @ u))) & (((more @ (pl @ x @ z) @ (pl @ y @ u))) != $true)),
% 0.23/0.31 inference(ennf_transformation,[],[f25])).
% 0.23/0.31 thf(f34,plain,(
% 0.23/0.31 (x = y) | (((more @ x @ y)) = $true)),
% 0.23/0.31 inference(cnf_transformation,[],[f26])).
% 0.23/0.31 thf(f35,plain,(
% 0.23/0.31 (z = u) | (((more @ z @ u)) = $true)),
% 0.23/0.31 inference(cnf_transformation,[],[f27])).
% 0.23/0.31 thf(f38,plain,(
% 0.23/0.31 ( ! [X2 : nat,X3 : nat,X0 : nat,X1 : nat] : ((((more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))) = $true) | (((more @ X2 @ X3)) != $true) | (X0 != X1)) )),
% 0.23/0.31 inference(cnf_transformation,[],[f30])).
% 0.23/0.31 thf(f39,plain,(
% 0.23/0.31 ( ! [X2 : nat,X3 : nat,X0 : nat,X1 : nat] : ((((more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))) = $true) | (((more @ X2 @ X3)) != $true) | (((more @ X0 @ X1)) != $true)) )),
% 0.23/0.31 inference(cnf_transformation,[],[f32])).
% 0.23/0.31 thf(f40,plain,(
% 0.23/0.31 ( ! [X2 : nat,X3 : nat,X0 : nat,X1 : nat] : ((((more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))) = $true) | (X2 != X3) | (((more @ X0 @ X1)) != $true)) )),
% 0.23/0.31 inference(cnf_transformation,[],[f32])).
% 0.23/0.31 thf(f41,plain,(
% 0.23/0.31 (((more @ (pl @ x @ z) @ (pl @ y @ u))) != $true)),
% 0.23/0.31 inference(cnf_transformation,[],[f33])).
% 0.23/0.31 thf(f42,plain,(
% 0.23/0.31 (((pl @ x @ z)) != ((pl @ y @ u)))),
% 0.23/0.31 inference(cnf_transformation,[],[f33])).
% 0.23/0.31 thf(f44,definition,(
% 0.23/0.31 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.23/0.31 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.23/0.31 thf(f46,plain,(
% 0.23/0.31 ( ! [X2 : nat,X3 : nat,X1 : nat] : (($true = ((more @ (pl @ X1 @ X2) @ (pl @ X1 @ X3)))) | (((more @ X2 @ X3)) != $true)) )),
% 0.23/0.31 inference(equality_resolution,[],[f38])).
% 0.23/0.31 thf(f47,plain,(
% 0.23/0.31 ( ! [X3 : nat,X0 : nat,X1 : nat] : (($true = ((more @ (pl @ X0 @ X3) @ (pl @ X1 @ X3)))) | (((more @ X0 @ X1)) != $true)) )),
% 0.23/0.31 inference(equality_resolution,[],[f40])).
% 0.23/0.31 thf(f49,definition,(
% 0.23/0.31 spl0_1 <=> (((more @ z @ u)) = $true)),
% 0.23/0.31 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.23/0.31 thf(f51,plain,(
% 0.23/0.31 (((more @ z @ u)) = $true) | ~spl0_1),
% 0.23/0.31 inference(avatar_component_clause,[],[f49])).
% 0.23/0.31 thf(f53,definition,(
% 0.23/0.31 spl0_2 <=> (z = u)),
% 0.23/0.31 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.23/0.31 thf(f55,plain,(
% 0.23/0.31 (z = u) | ~spl0_2),
% 0.23/0.31 inference(avatar_component_clause,[],[f53])).
% 0.23/0.31 thf(f56,plain,(
% 0.23/0.31 spl0_1 | spl0_2),
% 0.23/0.31 inference(avatar_split_clause,[],[f35,f53,f49])).
% 0.23/0.31 thf(f58,definition,(
% 0.23/0.31 spl0_3 <=> (((more @ x @ y)) = $true)),
% 0.23/0.31 introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition])).
% 0.23/0.31 thf(f60,plain,(
% 0.23/0.31 (((more @ x @ y)) = $true) | ~spl0_3),
% 0.23/0.31 inference(avatar_component_clause,[],[f58])).
% 0.23/0.31 thf(f62,definition,(
% 0.23/0.31 spl0_4 <=> (x = y)),
% 0.23/0.31 introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition])).
% 0.23/0.31 thf(f64,plain,(
% 0.23/0.31 (x = y) | ~spl0_4),
% 0.23/0.31 inference(avatar_component_clause,[],[f62])).
% 0.23/0.31 thf(f65,plain,(
% 0.23/0.31 spl0_3 | spl0_4),
% 0.23/0.31 inference(avatar_split_clause,[],[f34,f62,f58])).
% 0.23/0.31 thf(f70,plain,(
% 0.23/0.31 ($true != $true) | (((more @ (pl @ x @ z) @ (pl @ y @ u))) = $false)),
% 0.23/0.31 inference(constrained_superposition,[],[f41,f44])).
% 0.23/0.31 thf(f72,plain,(
% 0.23/0.31 (((more @ (pl @ x @ z) @ (pl @ y @ u))) = $false)),
% 0.23/0.31 inference(trivial_inequality_removal,[],[f70])).
% 0.23/0.31 thf(f77,plain,(
% 0.23/0.31 ($false = ((more @ (pl @ x @ z) @ (pl @ y @ z)))) | ~spl0_2),
% 0.23/0.31 inference(forward_demodulation,[],[f72,f55])).
% 0.23/0.31 thf(f83,plain,(
% 0.23/0.31 ($true = $false) | (((more @ x @ y)) != $true) | ~spl0_2),
% 0.23/0.31 inference(constrained_superposition,[],[f47,f77])).
% 0.23/0.31 thf(f88,plain,(
% 0.23/0.31 (((more @ x @ y)) != $true) | ~spl0_2),
% 0.23/0.31 inference(trivial_inequality_removal,[],[f83])).
% 0.23/0.31 thf(f93,plain,(
% 0.23/0.31 $false | (~spl0_2 | ~spl0_3)),
% 0.23/0.31 inference(forward_subsumption_resolution,[],[f88,f60])).
% 0.23/0.31 thf(f94,plain,(
% 0.23/0.31 ~spl0_2 | ~spl0_3),
% 0.23/0.31 inference(avatar_contradiction_clause,[],[f93])).
% 0.23/0.31 thf(f98,plain,(
% 0.23/0.31 ($true = $false) | (((more @ z @ u)) != $true) | (((more @ x @ y)) != $true)),
% 0.23/0.31 inference(constrained_superposition,[],[f39,f72])).
% 0.23/0.31 thf(f103,plain,(
% 0.23/0.31 (((more @ z @ u)) != $true) | (((more @ x @ y)) != $true)),
% 0.23/0.31 inference(trivial_inequality_removal,[],[f98])).
% 0.23/0.31 thf(f106,plain,(
% 0.23/0.31 (((more @ x @ y)) != $true) | ~spl0_1),
% 0.23/0.31 inference(forward_subsumption_resolution,[],[f103,f51])).
% 0.23/0.31 thf(f111,plain,(
% 0.23/0.31 $false | (~spl0_1 | ~spl0_3)),
% 0.23/0.31 inference(forward_subsumption_resolution,[],[f106,f60])).
% 0.23/0.31 thf(f112,plain,(
% 0.23/0.31 ~spl0_1 | ~spl0_3),
% 0.23/0.31 inference(avatar_contradiction_clause,[],[f111])).
% 0.23/0.31 thf(f115,plain,(
% 0.23/0.31 (((pl @ x @ z)) != ((pl @ y @ z))) | ~spl0_2),
% 0.23/0.31 inference(constrained_superposition,[],[f42,f55])).
% 0.23/0.31 thf(f116,plain,(
% 0.23/0.31 (((pl @ x @ z)) != ((pl @ x @ z))) | (~spl0_2 | ~spl0_4)),
% 0.23/0.31 inference(forward_demodulation,[],[f115,f64])).
% 0.23/0.31 thf(f117,plain,(
% 0.23/0.31 $false | (~spl0_2 | ~spl0_4)),
% 0.23/0.31 inference(trivial_inequality_removal,[],[f116])).
% 0.23/0.31 thf(f118,plain,(
% 0.23/0.31 ~spl0_2 | ~spl0_4),
% 0.23/0.31 inference(avatar_contradiction_clause,[],[f117])).
% 0.23/0.31 thf(f122,plain,(
% 0.23/0.31 ($true != ((more @ (pl @ x @ z) @ (pl @ x @ u)))) | ~spl0_4),
% 0.23/0.31 inference(constrained_superposition,[],[f41,f64])).
% 0.23/0.31 thf(f125,plain,(
% 0.23/0.31 ($true != $true) | (((more @ z @ u)) != $true) | ~spl0_4),
% 0.23/0.31 inference(constrained_superposition,[],[f122,f46])).
% 0.23/0.31 thf(f128,plain,(
% 0.23/0.31 (((more @ z @ u)) != $true) | ~spl0_4),
% 0.23/0.31 inference(trivial_inequality_removal,[],[f125])).
% 0.23/0.31 thf(f131,plain,(
% 0.23/0.31 $false | (~spl0_1 | ~spl0_4)),
% 0.23/0.31 inference(forward_subsumption_resolution,[],[f128,f51])).
% 0.23/0.31 thf(f132,plain,(
% 0.23/0.31 ~spl0_1 | ~spl0_4),
% 0.23/0.31 inference(avatar_contradiction_clause,[],[f131])).
% 0.23/0.31 cnf(s1, plain, spl0_1 | spl0_2, inference(sat_conversion,[],[f56])).
% 0.23/0.31 cnf(s2, plain, spl0_3 | spl0_4, inference(sat_conversion,[],[f65])).
% 0.23/0.31 cnf(s5, plain, ~spl0_2 | ~spl0_3, inference(sat_conversion,[],[f94])).
% 0.23/0.31 cnf(s8, plain, ~spl0_1 | ~spl0_3, inference(sat_conversion,[],[f112])).
% 0.23/0.31 cnf(s9, plain, ~spl0_2 | ~spl0_4, inference(sat_conversion,[],[f118])).
% 0.23/0.31 cnf(s10, plain, ~spl0_1 | ~spl0_4, inference(sat_conversion,[],[f132])).
% 0.23/0.31 cnf(s11, plain, ~spl0_2, inference(rat,[],[s2,s5,s9])).
% 0.23/0.31 cnf(s12, plain, spl0_1, inference(rat,[],[s1,s11])).
% 0.23/0.31 cnf(s13, plain, ~spl0_4, inference(rat,[],[s10,s12])).
% 0.23/0.31 cnf(s14, plain, ~spl0_3, inference(rat,[],[s8,s12])).
% 0.23/0.31 cnf(s15, plain, $false, inference(rat,[],[s2,s13,s14])).
% 0.23/0.31 thf(f133,plain,(
% 0.23/0.31 $false),
% 0.23/0.31 inference(avatar_sat_refutation,[],[s15])).
% 0.23/0.31 % SZS output end Proof for theBenchmark
% 0.23/0.31 % (3087014)------------------------------
% 0.23/0.31 % (3087014)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.31 % (3087014)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.31 % (3087014)CaDiCaL version: 2.1.3
% 0.23/0.31 % (3087014)Termination reason: Refutation
% 0.23/0.31 % (3087014)Time elapsed: 0.006 s
% 0.23/0.31 % (3087014)Peak memory usage: 12 MB
% 0.23/0.31 % (3087014)Instructions burned: 8 (million)
% 0.23/0.31 % (3086999)Success in time 0.044 s
% 0.23/0.31 % Vampire exiting
%------------------------------------------------------------------------------