%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO367_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 : n004.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 02:30:45 PM UTC 2026
% Result : Theorem 0.06s 0.24s
% Output : Refutation 0.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO367_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.06/0.17 % Computer : n004.cluster.edu
% 0.06/0.17 % Model : x86_64 x86_64
% 0.06/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17 % Memory : 8046.5625MB
% 0.06/0.17 % OS : Linux 6.8.0-71-generic
% 0.06/0.17 % CPULimit : 300
% 0.06/0.17 % WCLimit : 300
% 0.06/0.17 % DateTime : Mon Sep 28 17:36:22 UTC 2026
% 0.06/0.17 % CPUTime :
% 0.06/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.06/0.20 Running first-order model finding
% 0.06/0.20 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.06/0.24 % (566411)Will run a generic schedule for satisfiability detection.
% 0.06/0.24 % (566418)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1874229640:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.06/0.24 % (566418) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-566411-566418"...
% 0.06/0.24 % (566418)...printing done.
% 0.06/0.24 % (566417)% WARNING: option uhcvi not known.
% 0.06/0.24 % (566418)Refutation found. Thanks to Tanya!
% 0.06/0.24 % SZS status Theorem for theBenchmark
% 0.06/0.24 % SZS output start Proof for theBenchmark
% 0.06/0.24 tff(func_def_0, type, bG0: $o).
% 0.06/0.24 tff(func_def_3, type, bG1: $o).
% 0.06/0.24 tff(pred_def_2, type, cC: $o > $o).
% 0.06/0.24 tff(f1,conjecture,(
% 0.06/0.24 cC(cA) => cC(cA)),
% 0.06/0.24 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEXT2)).
% 0.06/0.24 tff(f2,negated_conjecture,(
% 0.06/0.24 ~(cC(cA) => cC(cA))),
% 0.06/0.24 inference(negated_conjecture,[status(cth)],[f1])).
% 0.06/0.24 tff(f3,definition,(
% 0.06/0.24 cA <=> (bG0 = $true)),
% 0.06/0.24 introduced(definition,[new_symbols(definition,[bG0])],[fool_formula_definition])).
% 0.06/0.24 tff(f4,definition,(
% 0.06/0.24 cA <=> ($true = bG1)),
% 0.06/0.24 introduced(definition,[new_symbols(definition,[bG1])],[fool_formula_definition])).
% 0.06/0.24 tff(f5,plain,(
% 0.06/0.24 ~(cC(bG0) => cC(bG1))),
% 0.06/0.24 inference(fool_elimination,[],[f2,f4,f3])).
% 0.06/0.24 tff(f6,plain,(
% 0.06/0.24 ~cC(bG1) & cC(bG0)),
% 0.06/0.24 inference(ennf_transformation,[],[f5])).
% 0.06/0.24 tff(f7,plain,(
% 0.06/0.24 (cA | ($true != bG1)) & (($true = bG1) | ~cA)),
% 0.06/0.24 inference(nnf_transformation,[],[f4])).
% 0.06/0.24 tff(f8,plain,(
% 0.06/0.24 (cA | (bG0 != $true)) & ((bG0 = $true) | ~cA)),
% 0.06/0.24 inference(nnf_transformation,[],[f3])).
% 0.06/0.24 tff(f9,plain,(
% 0.06/0.24 ($true = bG1) | ~cA),
% 0.06/0.24 inference(cnf_transformation,[],[f7])).
% 0.06/0.24 tff(f10,plain,(
% 0.06/0.24 cA | ($true != bG1)),
% 0.06/0.24 inference(cnf_transformation,[],[f7])).
% 0.06/0.24 tff(f11,plain,(
% 0.06/0.24 (bG0 = $true) | ~cA),
% 0.06/0.24 inference(cnf_transformation,[],[f8])).
% 0.06/0.24 tff(f12,plain,(
% 0.06/0.24 cA | (bG0 != $true)),
% 0.06/0.24 inference(cnf_transformation,[],[f8])).
% 0.06/0.24 tff(f13,plain,(
% 0.06/0.24 cC(bG0)),
% 0.06/0.24 inference(cnf_transformation,[],[f6])).
% 0.06/0.24 tff(f14,plain,(
% 0.06/0.24 ~cC(bG1)),
% 0.06/0.24 inference(cnf_transformation,[],[f6])).
% 0.06/0.24 tff(f16,definition,(
% 0.06/0.24 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.06/0.24 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.06/0.24 tff(f18,definition,(
% 0.06/0.24 spl2_1 <=> cA),
% 0.06/0.24 introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition])).
% 0.06/0.24 tff(f19,plain,(
% 0.06/0.24 cA | ~spl2_1),
% 0.06/0.24 inference(avatar_component_clause,[],[f18])).
% 0.06/0.24 tff(f20,plain,(
% 0.06/0.24 ~cA | spl2_1),
% 0.06/0.24 inference(avatar_component_clause,[],[f18])).
% 0.06/0.24 tff(f22,definition,(
% 0.06/0.24 spl2_2 <=> ($true = bG1)),
% 0.06/0.24 introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition])).
% 0.06/0.24 tff(f23,plain,(
% 0.06/0.24 ($true != bG1) | spl2_2),
% 0.06/0.24 inference(avatar_component_clause,[],[f22])).
% 0.06/0.24 tff(f24,plain,(
% 0.06/0.24 ($true = bG1) | ~spl2_2),
% 0.06/0.24 inference(avatar_component_clause,[],[f22])).
% 0.06/0.24 tff(f25,plain,(
% 0.06/0.24 ~spl2_1 | spl2_2),
% 0.06/0.24 inference(avatar_split_clause,[],[f9,f22,f18])).
% 0.06/0.24 tff(f26,plain,(
% 0.06/0.24 ($true != bG1) | spl2_1),
% 0.06/0.24 inference(forward_subsumption_resolution,[],[f10,f20])).
% 0.06/0.24 tff(f27,plain,(
% 0.06/0.24 ~spl2_2 | spl2_1),
% 0.06/0.24 inference(avatar_split_clause,[],[f26,f18,f22])).
% 0.06/0.24 tff(f28,plain,(
% 0.06/0.24 ~cC($true) | ~spl2_2),
% 0.06/0.24 inference(superposition,[],[f14,f24])).
% 0.06/0.24 tff(f29,plain,(
% 0.06/0.24 (bG0 = $true) | ~spl2_1),
% 0.06/0.24 inference(forward_subsumption_resolution,[],[f11,f19])).
% 0.06/0.24 tff(f30,plain,(
% 0.06/0.24 cC($true) | ~spl2_1),
% 0.06/0.24 inference(superposition,[],[f13,f29])).
% 0.06/0.24 tff(f31,plain,(
% 0.06/0.24 $false | (~spl2_1 | ~spl2_2)),
% 0.06/0.24 inference(forward_subsumption_resolution,[],[f30,f28])).
% 0.06/0.24 tff(f32,plain,(
% 0.06/0.24 ~spl2_1 | ~spl2_2),
% 0.06/0.24 inference(avatar_contradiction_clause,[],[f31])).
% 0.06/0.24 tff(f33,plain,(
% 0.06/0.24 (bG0 != $true) | spl2_1),
% 0.06/0.24 inference(forward_subsumption_resolution,[],[f12,f20])).
% 0.06/0.24 tff(f42,plain,(
% 0.06/0.24 ($true != $true) | (bG1 = $false) | spl2_2),
% 0.06/0.24 inference(superposition,[],[f23,f16])).
% 0.06/0.24 tff(f44,plain,(
% 0.06/0.24 ($true != $true) | (bG0 = $false) | spl2_1),
% 0.06/0.24 inference(superposition,[],[f33,f16])).
% 0.06/0.24 tff(f47,plain,(
% 0.06/0.24 (bG0 = $false) | spl2_1),
% 0.06/0.24 inference(trivial_inequality_removal,[],[f44])).
% 0.06/0.24 tff(f48,plain,(
% 0.06/0.24 (bG1 = $false) | spl2_2),
% 0.06/0.24 inference(trivial_inequality_removal,[],[f42])).
% 0.06/0.24 tff(f50,definition,(
% 0.06/0.24 spl2_5 <=> (bG1 = $false)),
% 0.06/0.24 introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition])).
% 0.06/0.24 tff(f51,plain,(
% 0.06/0.24 (bG1 != $false) | spl2_5),
% 0.06/0.24 inference(avatar_component_clause,[],[f50])).
% 0.06/0.24 tff(f52,plain,(
% 0.06/0.24 (bG1 = $false) | ~spl2_5),
% 0.06/0.24 inference(avatar_component_clause,[],[f50])).
% 0.06/0.24 tff(f60,plain,(
% 0.06/0.24 ~cC($false) | ~spl2_5),
% 0.06/0.24 inference(superposition,[],[f14,f52])).
% 0.06/0.24 tff(f88,definition,(
% 0.06/0.24 spl2_7 <=> (bG0 = $false)),
% 0.06/0.24 introduced(definition,[new_symbols(definition,[spl2_7])],[avatar_definition])).
% 0.06/0.24 tff(f89,plain,(
% 0.06/0.24 (bG0 != $false) | spl2_7),
% 0.06/0.24 inference(avatar_component_clause,[],[f88])).
% 0.06/0.24 tff(f90,plain,(
% 0.06/0.24 (bG0 = $false) | ~spl2_7),
% 0.06/0.24 inference(avatar_component_clause,[],[f88])).
% 0.06/0.24 tff(f94,plain,(
% 0.06/0.24 cC($false) | ~spl2_7),
% 0.06/0.24 inference(superposition,[],[f13,f90])).
% 0.06/0.24 tff(f96,plain,(
% 0.06/0.24 $false | (~spl2_5 | ~spl2_7)),
% 0.06/0.24 inference(forward_subsumption_resolution,[],[f94,f60])).
% 0.06/0.24 tff(f97,plain,(
% 0.06/0.24 ~spl2_5 | ~spl2_7),
% 0.06/0.24 inference(avatar_contradiction_clause,[],[f96])).
% 0.06/0.24 tff(f128,plain,(
% 0.06/0.24 $false | (spl2_2 | spl2_5)),
% 0.06/0.24 inference(forward_subsumption_resolution,[],[f48,f51])).
% 0.06/0.24 tff(f129,plain,(
% 0.06/0.24 spl2_2 | spl2_5),
% 0.06/0.24 inference(avatar_contradiction_clause,[],[f128])).
% 0.06/0.24 tff(f145,plain,(
% 0.06/0.24 $false | (spl2_1 | spl2_7)),
% 0.06/0.24 inference(forward_subsumption_resolution,[],[f47,f89])).
% 0.06/0.24 tff(f146,plain,(
% 0.06/0.24 spl2_1 | spl2_7),
% 0.06/0.24 inference(avatar_contradiction_clause,[],[f145])).
% 0.06/0.24 cnf(s13, plain, ~spl2_1 | spl2_2, inference(sat_conversion,[],[f25])).
% 0.06/0.24 cnf(s18, plain, spl2_1 | ~spl2_2, inference(sat_conversion,[],[f27])).
% 0.06/0.24 cnf(s28, plain, ~spl2_1 | ~spl2_2, inference(sat_conversion,[],[f32])).
% 0.06/0.24 cnf(s70, plain, ~spl2_5 | ~spl2_7, inference(sat_conversion,[],[f97])).
% 0.06/0.24 cnf(s90, plain, spl2_2 | spl2_5, inference(sat_conversion,[],[f129])).
% 0.06/0.24 cnf(s107, plain, spl2_1 | spl2_7, inference(sat_conversion,[],[f146])).
% 0.06/0.24 cnf(s108, plain, spl2_1, inference(rat,[],[s90,s70,s18,s107])).
% 0.06/0.24 cnf(s109, plain, ~spl2_2, inference(rat,[],[s28,s108])).
% 0.06/0.24 cnf(s110, plain, $false, inference(rat,[],[s13,s109,s108])).
% 0.06/0.24 tff(f147,plain,(
% 0.06/0.24 $false),
% 0.06/0.24 inference(avatar_sat_refutation,[],[s110])).
% 0.06/0.24 % SZS output end Proof for theBenchmark
% 0.06/0.24 % (566418)------------------------------
% 0.06/0.24 % (566418)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.24 % (566418)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.24 % (566418)CaDiCaL version: 2.1.3
% 0.06/0.24 % (566418)Termination reason: Refutation
% 0.06/0.24 % (566418)Time elapsed: 0.002 s
% 0.06/0.24 % (566418)Peak memory usage: 12 MB
% 0.06/0.24 % (566418)Instructions burned: 3 (million)
% 0.06/0.24 % (566411)Success in time 0.028 s
% 0.06/0.24 % Vampire exiting
%------------------------------------------------------------------------------