%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PUZ083_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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 : Tue Sep 29 12:32:15 PM UTC 2026
% Result : Theorem 0.13s 0.42s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ083_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.35 % Computer : n008.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 27 22:41:24 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.37 Running first-order model finding
% 0.13/0.37 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.13/0.42 % (1673281)Will run a generic schedule for satisfiability detection.
% 0.13/0.42 % (1673288)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3995416281:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.13/0.42 % (1673288) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1673281-1673288"...
% 0.13/0.42 % (1673288)...printing done.
% 0.13/0.42 % (1673287)% WARNING: option uhcvi not known.
% 0.13/0.42 % (1673288)Refutation found. Thanks to Tanya!
% 0.13/0.42 % SZS status Theorem for theBenchmark
% 0.13/0.42 % SZS output start Proof for theBenchmark
% 0.13/0.42 tff(func_def_3, type, bG0: $o > $o).
% 0.13/0.42 tff(func_def_4, type, bG1: $o).
% 0.13/0.42 tff(func_def_5, type, bG2: $o > $o).
% 0.13/0.42 tff(func_def_6, type, sK3: $o).
% 0.13/0.42 tff(pred_def_1, type, says: ($i * $o) > $o).
% 0.13/0.42 tff(f1,axiom,(
% 0.13/0.42 says(peter,! [X0 : $o] : (says(peter,X0) => ~X0))),
% 0.13/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1)).
% 0.13/0.42 tff(f2,conjecture,(
% 0.13/0.42 ~ ! [X0 : $o] : (says(peter,X0) => X0)),
% 0.13/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm)).
% 0.13/0.42 tff(f3,negated_conjecture,(
% 0.13/0.42 ~ ~ ! [X0 : $o] : (says(peter,X0) => X0)),
% 0.13/0.42 inference(negated_conjecture,[status(cth)],[f2])).
% 0.13/0.42 tff(f4,plain,(
% 0.13/0.42 says(peter,! [X0 : $o] : (says(peter,X0) => ~X0))),
% 0.13/0.42 inference(rectify,[],[f1])).
% 0.13/0.42 tff(f5,definition,(
% 0.13/0.42 ! [X0 : $o] : (($true = X0) <=> ($true = bG0(X0)))),
% 0.13/0.42 introduced(definition,[new_symbols(definition,[bG0])],[fool_formula_definition])).
% 0.13/0.42 tff(f6,definition,(
% 0.13/0.42 ! [X0 : $o] : (says(peter,bG0(X0)) => ~ ($true = X0)) <=> ($true = bG1)),
% 0.13/0.42 introduced(definition,[new_symbols(definition,[bG1])],[fool_formula_definition])).
% 0.13/0.42 tff(f7,plain,(
% 0.13/0.42 says(peter,bG1)),
% 0.13/0.42 inference(fool_elimination,[],[f4,f6,f5])).
% 0.13/0.42 tff(f8,plain,(
% 0.13/0.42 ~ ~ ! [X0 : $o] : (says(peter,X0) => X0)),
% 0.13/0.42 inference(rectify,[],[f3])).
% 0.13/0.42 tff(f9,definition,(
% 0.13/0.42 ! [X0 : $o] : (($true = X0) <=> ($true = bG2(X0)))),
% 0.13/0.42 introduced(definition,[new_symbols(definition,[bG2])],[fool_formula_definition])).
% 0.13/0.42 tff(f10,plain,(
% 0.13/0.42 ~ ~ ! [X0 : $o] : (says(peter,bG2(X0)) => ($true = X0))),
% 0.13/0.42 inference(fool_elimination,[],[f8,f9])).
% 0.13/0.42 tff(f11,plain,(
% 0.13/0.42 ! [X0 : $o] : (says(peter,bG0(X0)) => ($true != X0)) <=> ($true = bG1)),
% 0.13/0.42 inference(flattening,[],[f6])).
% 0.13/0.42 tff(f12,plain,(
% 0.13/0.42 ! [X0 : $o] : (says(peter,bG2(X0)) => ($true = X0))),
% 0.13/0.42 inference(flattening,[],[f10])).
% 0.13/0.42 tff(f13,plain,(
% 0.13/0.42 ! [X0 : $o] : (($true != X0) | ~says(peter,bG0(X0))) <=> ($true = bG1)),
% 0.13/0.42 inference(ennf_transformation,[],[f11])).
% 0.13/0.42 tff(f14,plain,(
% 0.13/0.42 ! [X0 : $o] : (($true = X0) | ~says(peter,bG2(X0)))),
% 0.13/0.42 inference(ennf_transformation,[],[f12])).
% 0.13/0.42 tff(f15,plain,(
% 0.13/0.42 ! [X0 : $o] : ((($true = X0) | ($true != bG2(X0))) & (($true = bG2(X0)) | ($true != X0)))),
% 0.13/0.42 inference(nnf_transformation,[],[f9])).
% 0.13/0.42 tff(f16,plain,(
% 0.13/0.42 (! [X0 : $o] : (($true != X0) | ~says(peter,bG0(X0))) | ($true != bG1)) & (($true = bG1) | ? [X0 : $o] : (($true = X0) & says(peter,bG0(X0))))),
% 0.13/0.42 inference(nnf_transformation,[],[f13])).
% 0.13/0.42 tff(f17,plain,(
% 0.13/0.42 (! [X0 : $o] : (($true != X0) | ~says(peter,bG0(X0))) | ($true != bG1)) & (($true = bG1) | ? [X1 : $o] : (($true = X1) & says(peter,bG0(X1))))),
% 0.13/0.42 inference(rectify,[],[f16])).
% 0.13/0.42 tff(f18,plain,(
% 0.13/0.42 (! [X0 : $o] : (($true != X0) | ~says(peter,bG0(X0))) | ($true != bG1)) & (($true = bG1) | (($true = sK3) & says(peter,bG0(sK3))))),
% 0.13/0.42 inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X1,sK3)],[f17])).
% 0.13/0.42 tff(f19,plain,(
% 0.13/0.42 ! [X0 : $o] : ((($true = X0) | ($true != bG0(X0))) & (($true = bG0(X0)) | ($true != X0)))),
% 0.13/0.42 inference(nnf_transformation,[],[f5])).
% 0.13/0.42 tff(f21,plain,(
% 0.13/0.42 ( ! [X0 : $o] : (($true != bG2(X0)) | ($true = X0)) )),
% 0.13/0.42 inference(cnf_transformation,[],[f15])).
% 0.13/0.42 tff(f24,plain,(
% 0.13/0.42 ( ! [X0 : $o] : (($true != X0) | ~says(peter,bG0(X0)) | ($true != bG1)) )),
% 0.13/0.42 inference(cnf_transformation,[],[f18])).
% 0.13/0.42 tff(f25,plain,(
% 0.13/0.42 ( ! [X0 : $o] : (($true = bG0(X0)) | ($true != X0)) )),
% 0.13/0.42 inference(cnf_transformation,[],[f19])).
% 0.13/0.42 tff(f27,plain,(
% 0.13/0.42 says(peter,bG1)),
% 0.13/0.42 inference(cnf_transformation,[],[f7])).
% 0.13/0.42 tff(f28,plain,(
% 0.13/0.42 ( ! [X0 : $o] : (~says(peter,bG2(X0)) | ($true = X0)) )),
% 0.13/0.42 inference(cnf_transformation,[],[f14])).
% 0.13/0.42 tff(f30,definition,(
% 0.13/0.42 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.13/0.42 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.13/0.42 tff(f32,plain,(
% 0.13/0.42 ~says(peter,bG0($true)) | ($true != bG1)),
% 0.13/0.42 inference(equality_resolution,[],[f24])).
% 0.13/0.42 tff(f33,plain,(
% 0.13/0.42 ($true = bG0($true))),
% 0.13/0.42 inference(equality_resolution,[],[f25])).
% 0.13/0.42 tff(f35,definition,(
% 0.13/0.42 spl4_1 <=> ($true = bG1)),
% 0.13/0.42 introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition])).
% 0.13/0.42 tff(f36,plain,(
% 0.13/0.42 ($true = bG1) | ~spl4_1),
% 0.13/0.42 inference(avatar_component_clause,[],[f35])).
% 0.13/0.42 tff(f37,plain,(
% 0.13/0.42 ($true != bG1) | spl4_1),
% 0.13/0.42 inference(avatar_component_clause,[],[f35])).
% 0.13/0.42 tff(f39,definition,(
% 0.13/0.42 spl4_2 <=> says(peter,bG0($true))),
% 0.13/0.42 introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition])).
% 0.13/0.42 tff(f41,plain,(
% 0.13/0.42 ~says(peter,bG0($true)) | spl4_2),
% 0.13/0.42 inference(avatar_component_clause,[],[f39])).
% 0.13/0.42 tff(f42,plain,(
% 0.13/0.42 ~spl4_1 | ~spl4_2),
% 0.13/0.42 inference(avatar_split_clause,[],[f32,f39,f35])).
% 0.13/0.42 tff(f44,definition,(
% 0.13/0.42 spl4_3 <=> ! [X0 : $o] : ($true = X0)),
% 0.13/0.42 introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition])).
% 0.13/0.42 tff(f45,plain,(
% 0.13/0.42 ( ! [X0 : $o] : (($true = X0)) ) | ~spl4_3),
% 0.13/0.42 inference(avatar_component_clause,[],[f44])).
% 0.13/0.42 tff(f51,plain,(
% 0.13/0.42 ($true != $true) | (spl4_1 | ~spl4_3)),
% 0.13/0.42 inference(superposition,[],[f37,f45])).
% 0.13/0.42 tff(f54,plain,(
% 0.13/0.42 $false | (spl4_1 | ~spl4_3)),
% 0.13/0.42 inference(trivial_inequality_removal,[],[f51])).
% 0.13/0.42 tff(f55,plain,(
% 0.13/0.42 spl4_1 | ~spl4_3),
% 0.13/0.42 inference(avatar_contradiction_clause,[],[f54])).
% 0.13/0.42 tff(f67,plain,(
% 0.13/0.42 ($true != $true) | (bG1 = $false) | spl4_1),
% 0.13/0.42 inference(superposition,[],[f37,f30])).
% 0.13/0.42 tff(f71,plain,(
% 0.13/0.42 (bG1 = $false) | spl4_1),
% 0.13/0.42 inference(trivial_inequality_removal,[],[f67])).
% 0.13/0.42 tff(f118,plain,(
% 0.13/0.42 ( ! [X0 : $o] : (($true != $true) | ($true = X0) | (bG2(X0) = $false)) )),
% 0.13/0.42 inference(superposition,[],[f21,f30])).
% 0.13/0.42 tff(f119,plain,(
% 0.13/0.42 ( ! [X0 : $o] : (($true = X0) | (bG2(X0) = $false)) )),
% 0.13/0.42 inference(trivial_inequality_removal,[],[f118])).
% 0.13/0.42 tff(f130,plain,(
% 0.13/0.42 ( ! [X0 : $o] : ((bG2(X0) = $false) | ($true = X0)) )),
% 0.13/0.42 inference(global_subsumption,[],[f119])).
% 0.13/0.42 tff(f136,plain,(
% 0.13/0.42 ( ! [X0 : $o] : (~says(peter,$false) | ($true = X0) | ($true = X0)) )),
% 0.13/0.42 inference(superposition,[],[f28,f130])).
% 0.13/0.42 tff(f137,plain,(
% 0.13/0.42 ( ! [X0 : $o] : (~says(peter,$false) | ($true = X0)) )),
% 0.13/0.42 inference(duplicate_literal_removal,[],[f136])).
% 0.13/0.42 tff(f151,definition,(
% 0.13/0.42 spl4_9 <=> says(peter,$false)),
% 0.13/0.42 introduced(definition,[new_symbols(definition,[spl4_9])],[avatar_definition])).
% 0.13/0.42 tff(f153,plain,(
% 0.13/0.42 ~says(peter,$false) | spl4_9),
% 0.13/0.42 inference(avatar_component_clause,[],[f151])).
% 0.13/0.42 tff(f154,plain,(
% 0.13/0.42 spl4_3 | ~spl4_9),
% 0.13/0.42 inference(avatar_split_clause,[],[f137,f151,f44])).
% 0.13/0.42 tff(f157,plain,(
% 0.13/0.42 says(peter,$false) | spl4_1),
% 0.13/0.42 inference(superposition,[],[f27,f71])).
% 0.13/0.42 tff(f160,plain,(
% 0.13/0.42 $false | (spl4_1 | spl4_9)),
% 0.13/0.42 inference(forward_subsumption_resolution,[],[f157,f153])).
% 0.13/0.42 tff(f161,plain,(
% 0.13/0.42 spl4_1 | spl4_9),
% 0.13/0.42 inference(avatar_contradiction_clause,[],[f160])).
% 0.13/0.42 tff(f162,plain,(
% 0.13/0.42 ~says(peter,$true) | spl4_2),
% 0.13/0.42 inference(forward_demodulation,[],[f41,f33])).
% 0.13/0.42 tff(f164,plain,(
% 0.13/0.42 says(peter,$true) | ~spl4_1),
% 0.13/0.42 inference(superposition,[],[f27,f36])).
% 0.13/0.42 tff(f165,plain,(
% 0.13/0.42 $false | (~spl4_1 | spl4_2)),
% 0.13/0.42 inference(forward_subsumption_resolution,[],[f164,f162])).
% 0.13/0.42 tff(f166,plain,(
% 0.13/0.42 ~spl4_1 | spl4_2),
% 0.13/0.42 inference(avatar_contradiction_clause,[],[f165])).
% 0.13/0.42 cnf(s14, plain, ~spl4_1 | ~spl4_2, inference(sat_conversion,[],[f42])).
% 0.13/0.42 cnf(s22, plain, spl4_1 | ~spl4_3, inference(sat_conversion,[],[f55])).
% 0.13/0.42 cnf(s78, plain, spl4_3 | ~spl4_9, inference(sat_conversion,[],[f154])).
% 0.13/0.42 cnf(s84, plain, spl4_1 | spl4_9, inference(sat_conversion,[],[f161])).
% 0.13/0.42 cnf(s92, plain, ~spl4_1 | spl4_2, inference(sat_conversion,[],[f166])).
% 0.13/0.42 cnf(s93, plain, spl4_1, inference(rat,[],[s78,s22,s84])).
% 0.13/0.42 cnf(s94, plain, spl4_2, inference(rat,[],[s92,s93])).
% 0.13/0.42 cnf(s95, plain, $false, inference(rat,[],[s14,s94,s93])).
% 0.13/0.42 tff(f167,plain,(
% 0.13/0.42 $false),
% 0.13/0.42 inference(avatar_sat_refutation,[],[s95])).
% 0.13/0.42 % SZS output end Proof for theBenchmark
% 0.13/0.42 % (1673288)------------------------------
% 0.13/0.42 % (1673288)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.42 % (1673288)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.42 % (1673288)CaDiCaL version: 2.1.3
% 0.13/0.42 % (1673288)Termination reason: Refutation
% 0.13/0.42 % (1673288)Time elapsed: 0.003 s
% 0.13/0.42 % (1673288)Peak memory usage: 12 MB
% 0.13/0.42 % (1673288)Instructions burned: 5 (million)
% 0.13/0.42 % (1673281)Success in time 0.034 s
% 0.13/0.42 % Vampire exiting
%------------------------------------------------------------------------------