%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO369^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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:49:48 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO369^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 % Computer : n007.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 16:47:11 UTC 2026
% 0.08/0.21 % CPUTime :
% 0.08/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.24 Running first-order model finding
% 0.08/0.24 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.20/0.28 % (3627064)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (3627081)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=234020594:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.28 % (3627081) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3627064-3627081"...
% 0.20/0.28 % (3627081)...printing done.
% 0.20/0.28 % (3627081)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% 0.20/0.28 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.28 thf(func_def_0, type, cB: $o).
% 0.20/0.28 thf(func_def_1, type, cA: $o).
% 0.20/0.28 thf(func_def_2, type, cP: ($o > $o)).
% 0.20/0.28 thf(func_def_4, type, vIMP: ($o > $o > $o)).
% 0.20/0.28 thf(func_def_7, type, vOR: ($o > $o > $o)).
% 0.20/0.28 thf(func_def_8, type, vNOT: ($o > $o)).
% 0.20/0.28 thf(f1,conjecture,(
% 0.20/0.28 (cP @ cA => cB) => (cP @ cB | ~cA)),
% 0.20/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTRIVEXT5)).
% 0.20/0.28 thf(f2,negated_conjecture,(
% 0.20/0.28 ~((cP @ cA => cB) => (cP @ cB | ~cA))),
% 0.20/0.28 inference(negated_conjecture,[status(cth)],[f1])).
% 0.20/0.28 thf(f3,plain,(
% 0.20/0.28 ~((cP @ cA => cB) => (cP @ cB | ~cA))),
% 0.20/0.28 inference(rectify,[],[f2])).
% 0.20/0.28 thf(f4,plain,(
% 0.20/0.28 ~((((cP @ (cA => cB))) = $true) => ($true = ((cP @ ((~ cA) | cB)))))),
% 0.20/0.28 inference(fool_elimination,[],[f3])).
% 0.20/0.28 thf(f5,plain,(
% 0.20/0.28 ($true != ((cP @ ((~ cA) | cB)))) & (((cP @ (cA => cB))) = $true)),
% 0.20/0.28 inference(ennf_transformation,[],[f4])).
% 0.20/0.28 thf(f6,plain,(
% 0.20/0.28 (((cP @ (cA => cB))) = $true)),
% 0.20/0.28 inference(cnf_transformation,[],[f5])).
% 0.20/0.28 thf(f7,plain,(
% 0.20/0.28 ($true != ((cP @ ((~ cA) | cB))))),
% 0.20/0.28 inference(cnf_transformation,[],[f5])).
% 0.20/0.28 thf(f9,definition,(
% 0.20/0.28 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.20/0.28 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.20/0.28 thf(f16,plain,(
% 0.20/0.28 ($true = ((cP @ $true))) | (((cA => cB)) = $false)),
% 0.20/0.28 inference(constrained_superposition,[],[f6,f9])).
% 0.20/0.28 thf(f19,plain,(
% 0.20/0.28 ($true != ((cP @ ($true | cB)))) | (((~ cA)) = $false)),
% 0.20/0.28 inference(constrained_superposition,[],[f7,f9])).
% 0.20/0.28 thf(f21,plain,(
% 0.20/0.28 ($true != ((cP @ ($true | cB)))) | (cA = $true)),
% 0.20/0.28 inference(not_proxy_clausification,[],[f19])).
% 0.20/0.28 thf(f22,plain,(
% 0.20/0.28 ($true != ((cP @ $true))) | (cA = $true)),
% 0.20/0.28 inference(boolean_simplification,[],[f21])).
% 0.20/0.28 thf(f28,plain,(
% 0.20/0.28 ($true = ((cP @ $true))) | (cA = $true)),
% 0.20/0.28 inference(imp_proxy_clausification,[],[f16])).
% 0.20/0.28 thf(f39,definition,(
% 0.20/0.28 spl0_1 <=> (cA = $true)),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.20/0.28 thf(f41,plain,(
% 0.20/0.28 (cA = $true) | ~spl0_1),
% 0.20/0.28 inference(avatar_component_clause,[],[f39])).
% 0.20/0.28 thf(f43,definition,(
% 0.20/0.28 spl0_2 <=> ($true = ((cP @ $true)))),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.20/0.28 thf(f46,plain,(
% 0.20/0.28 spl0_1 | ~spl0_2),
% 0.20/0.28 inference(avatar_split_clause,[],[f22,f43,f39])).
% 0.20/0.28 thf(f53,plain,(
% 0.20/0.28 spl0_1 | spl0_2),
% 0.20/0.28 inference(avatar_split_clause,[],[f28,f43,f39])).
% 0.20/0.28 thf(f60,definition,(
% 0.20/0.28 spl0_5 <=> ($true = ((cP @ cB)))),
% 0.20/0.28 introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition])).
% 0.20/0.28 thf(f67,plain,(
% 0.20/0.28 ($true != ((cP @ ((~ $true) | cB)))) | ~spl0_1),
% 0.20/0.28 inference(constrained_superposition,[],[f7,f41])).
% 0.20/0.28 thf(f68,plain,(
% 0.20/0.28 ($true = ((cP @ ($true => cB)))) | ~spl0_1),
% 0.20/0.28 inference(constrained_superposition,[],[f6,f41])).
% 0.20/0.28 thf(f69,plain,(
% 0.20/0.28 ($true = ((cP @ cB))) | ~spl0_1),
% 0.20/0.28 inference(boolean_simplification,[],[f68])).
% 0.20/0.28 thf(f70,plain,(
% 0.20/0.28 ($true != ((cP @ ($false | cB)))) | ~spl0_1),
% 0.20/0.28 inference(boolean_simplification,[],[f67])).
% 0.20/0.28 thf(f71,plain,(
% 0.20/0.28 ($true != ((cP @ cB))) | ~spl0_1),
% 0.20/0.28 inference(boolean_simplification,[],[f70])).
% 0.20/0.28 thf(f72,plain,(
% 0.20/0.28 ~spl0_5 | ~spl0_1),
% 0.20/0.28 inference(avatar_split_clause,[],[f71,f39,f60])).
% 0.20/0.28 thf(f73,plain,(
% 0.20/0.28 spl0_5 | ~spl0_1),
% 0.20/0.28 inference(avatar_split_clause,[],[f69,f39,f60])).
% 0.20/0.28 cnf(s1, plain, spl0_1 | ~spl0_2, inference(sat_conversion,[],[f46])).
% 0.20/0.28 cnf(s4, plain, spl0_1 | spl0_2, inference(sat_conversion,[],[f53])).
% 0.20/0.28 cnf(s10, plain, ~spl0_1 | ~spl0_5, inference(sat_conversion,[],[f72])).
% 0.20/0.28 cnf(s11, plain, ~spl0_1 | spl0_5, inference(sat_conversion,[],[f73])).
% 0.20/0.28 cnf(s12, plain, spl0_1, inference(rat,[],[s1,s4])).
% 0.20/0.28 cnf(s13, plain, spl0_5, inference(rat,[],[s11,s12])).
% 0.20/0.28 cnf(s14, plain, $false, inference(rat,[],[s10,s13,s12])).
% 0.20/0.28 thf(f74,plain,(
% 0.20/0.28 $false),
% 0.20/0.28 inference(avatar_sat_refutation,[],[s14])).
% 0.20/0.28 % SZS output end Proof for theBenchmark
% 0.20/0.28 % (3627081)------------------------------
% 0.20/0.28 % (3627081)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (3627081)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (3627081)CaDiCaL version: 2.1.3
% 0.20/0.28 % (3627081)Termination reason: Refutation
% 0.20/0.28 % (3627081)Time elapsed: 0.002 s
% 0.20/0.28 % (3627081)Peak memory usage: 13 MB
% 0.20/0.28 % (3627081)Instructions burned: 2 (million)
% 0.20/0.28 % (3627064)Success in time 0.031 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------