%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO043^1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:48:47 AM UTC 2026
% Result : Unsatisfiable 0.07s 0.25s
% Output : Refutation 0.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO043^1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n014.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 16:24:15 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 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.07/0.25 % (2875974)Will run a generic schedule for satisfiability detection.
% 0.07/0.25 % (2875981)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4052589599:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.25 % (2875981) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2875974-2875981"...
% 0.07/0.25 % (2875981)...printing done.
% 0.07/0.25 % (2875981)Refutation found. Thanks to Tanya!
% 0.07/0.25 % SZS status Unsatisfiable for theBenchmark
% 0.07/0.25 % SZS output start Proof for theBenchmark
% 0.07/0.25 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.07/0.25 thf(func_def_0, type, f: ($o > $o)).
% 0.07/0.25 thf(func_def_1, type, q: (($o > $o) > $o > $o)).
% 0.07/0.25 thf(func_def_2, type, x: $o).
% 0.07/0.25 thf(f1,axiom,(
% 0.07/0.25 (((f @ (q @ f @ x))) != ((f @ x))) & (f @ (f @ x)) & (q @ f @ x)),
% 0.07/0.25 file('/export/starexec/sandbox/benchmark/theBenchmark.p',5)).
% 0.07/0.25 thf(f2,plain,(
% 0.07/0.25 (((f @ (q @ f @ x))) != ((f @ x))) & (f @ (f @ x)) & (q @ f @ x)),
% 0.07/0.25 inference(rectify,[],[f1])).
% 0.07/0.25 thf(f3,plain,(
% 0.07/0.25 (((f @ x)) != ((f @ (q @ f @ x)))) & (((f @ (f @ x))) = $true) & (((q @ f @ x)) = $true)),
% 0.07/0.25 inference(fool_elimination,[],[f2])).
% 0.07/0.25 thf(f4,plain,(
% 0.07/0.25 (((q @ f @ x)) = $true)),
% 0.07/0.25 inference(cnf_transformation,[],[f3])).
% 0.07/0.25 thf(f5,plain,(
% 0.07/0.25 (((f @ (f @ x))) = $true)),
% 0.07/0.25 inference(cnf_transformation,[],[f3])).
% 0.07/0.25 thf(f6,plain,(
% 0.07/0.25 (((f @ x)) != ((f @ (q @ f @ x))))),
% 0.07/0.25 inference(cnf_transformation,[],[f3])).
% 0.07/0.25 thf(f8,definition,(
% 0.07/0.25 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.07/0.25 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.07/0.25 thf(f9,plain,(
% 0.07/0.25 (((f @ x)) = $true) | (((f @ (q @ f @ x))) = $true)),
% 0.07/0.25 inference(xor_proxy_clausification,[],[f6])).
% 0.07/0.25 thf(f10,plain,(
% 0.07/0.25 (((f @ x)) = $false) | (((f @ (q @ f @ x))) = $false)),
% 0.07/0.25 inference(xor_proxy_clausification,[],[f6])).
% 0.07/0.25 thf(f50,definition,(
% 0.07/0.25 spl0_3 <=> (x = $false)),
% 0.07/0.25 introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition])).
% 0.07/0.25 thf(f51,plain,(
% 0.07/0.25 (x != $false) | spl0_3),
% 0.07/0.25 inference(avatar_component_clause,[],[f50])).
% 0.07/0.25 thf(f52,plain,(
% 0.07/0.25 (x = $false) | ~spl0_3),
% 0.07/0.25 inference(avatar_component_clause,[],[f50])).
% 0.07/0.25 thf(f60,plain,(
% 0.07/0.25 ($true = ((f @ (f @ $false)))) | ~spl0_3),
% 0.07/0.25 inference(constrained_superposition,[],[f5,f52])).
% 0.07/0.25 thf(f65,definition,(
% 0.07/0.25 spl0_5 <=> ($true = ((f @ $true)))),
% 0.07/0.25 introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition])).
% 0.07/0.25 thf(f66,plain,(
% 0.07/0.25 ($true != ((f @ $true))) | spl0_5),
% 0.07/0.25 inference(avatar_component_clause,[],[f65])).
% 0.07/0.25 thf(f67,plain,(
% 0.07/0.25 ($true = ((f @ $true))) | ~spl0_5),
% 0.07/0.25 inference(avatar_component_clause,[],[f65])).
% 0.07/0.25 thf(f69,definition,(
% 0.07/0.25 spl0_6 <=> ($false = ((f @ $false)))),
% 0.07/0.25 introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition])).
% 0.07/0.25 thf(f71,plain,(
% 0.07/0.25 ($false = ((f @ $false))) | ~spl0_6),
% 0.07/0.25 inference(avatar_component_clause,[],[f69])).
% 0.07/0.25 thf(f73,plain,(
% 0.07/0.25 ( ! [X0 : $o] : ((((f @ X0)) = X0) | ($false = X0)) ) | ~spl0_5),
% 0.07/0.25 inference(constrained_superposition,[],[f67,f8])).
% 0.07/0.25 thf(f74,plain,(
% 0.07/0.25 ( ! [X0 : $o] : (($true = ((f @ X0))) | ($false = X0) | ($false = X0)) ) | ~spl0_5),
% 0.07/0.25 inference(iff_proxy_clausification,[],[f73])).
% 0.07/0.25 thf(f76,plain,(
% 0.07/0.25 ( ! [X0 : $o] : (($true = ((f @ X0))) | ($false = X0)) ) | ~spl0_5),
% 0.07/0.25 inference(duplicate_literal_removal,[],[f74])).
% 0.07/0.25 thf(f89,plain,(
% 0.07/0.25 ($false = ((f @ $false))) | (((f @ (q @ f @ x))) = $false) | ~spl0_3),
% 0.07/0.25 inference(forward_demodulation,[],[f10,f52])).
% 0.07/0.25 thf(f91,plain,(
% 0.07/0.25 ($false = ((f @ $true))) | ($false = ((f @ $false))) | ~spl0_3),
% 0.07/0.25 inference(forward_demodulation,[],[f89,f4])).
% 0.07/0.25 thf(f92,plain,(
% 0.07/0.25 ($true = $false) | ($false = ((f @ $false))) | (~spl0_3 | ~spl0_5)),
% 0.07/0.25 inference(forward_demodulation,[],[f91,f67])).
% 0.07/0.25 thf(f93,plain,(
% 0.07/0.25 ($false = ((f @ $false))) | (~spl0_3 | ~spl0_5)),
% 0.07/0.25 inference(trivial_inequality_removal,[],[f92])).
% 0.07/0.25 thf(f94,plain,(
% 0.07/0.25 spl0_6 | ~spl0_3 | ~spl0_5),
% 0.07/0.25 inference(avatar_split_clause,[],[f93,f65,f50,f69])).
% 0.07/0.25 thf(f96,plain,(
% 0.07/0.25 ($true = ((f @ $false))) | (~spl0_3 | ~spl0_6)),
% 0.07/0.25 inference(constrained_superposition,[],[f60,f71])).
% 0.07/0.25 thf(f98,plain,(
% 0.07/0.25 ($true = $false) | (~spl0_3 | ~spl0_6)),
% 0.07/0.25 inference(forward_demodulation,[],[f96,f71])).
% 0.07/0.25 thf(f99,plain,(
% 0.07/0.25 $false | (~spl0_3 | ~spl0_6)),
% 0.07/0.25 inference(trivial_inequality_removal,[],[f98])).
% 0.07/0.25 thf(f100,plain,(
% 0.07/0.25 ~spl0_3 | ~spl0_6),
% 0.07/0.25 inference(avatar_contradiction_clause,[],[f99])).
% 0.07/0.25 thf(f102,plain,(
% 0.07/0.25 ($true = ((f @ $true))) | (((f @ x)) = $true)),
% 0.07/0.25 inference(forward_demodulation,[],[f9,f4])).
% 0.07/0.25 thf(f103,plain,(
% 0.07/0.25 ($false = ((f @ $true))) | (((f @ x)) = $false)),
% 0.07/0.25 inference(forward_demodulation,[],[f10,f4])).
% 0.07/0.25 thf(f104,plain,(
% 0.07/0.25 ($true = $false) | (((f @ x)) = $false) | ~spl0_5),
% 0.07/0.25 inference(forward_demodulation,[],[f103,f67])).
% 0.07/0.25 thf(f105,plain,(
% 0.07/0.25 (((f @ x)) = $false) | ~spl0_5),
% 0.07/0.25 inference(trivial_inequality_removal,[],[f104])).
% 0.07/0.25 thf(f109,plain,(
% 0.07/0.25 ($true = $false) | (x = $false) | ~spl0_5),
% 0.07/0.25 inference(constrained_superposition,[],[f105,f76])).
% 0.07/0.25 thf(f113,plain,(
% 0.07/0.25 (x = $false) | ~spl0_5),
% 0.07/0.25 inference(trivial_inequality_removal,[],[f109])).
% 0.07/0.25 thf(f117,plain,(
% 0.07/0.25 $false | (spl0_3 | ~spl0_5)),
% 0.07/0.25 inference(forward_subsumption_resolution,[],[f113,f51])).
% 0.07/0.25 thf(f118,plain,(
% 0.07/0.25 spl0_3 | ~spl0_5),
% 0.07/0.25 inference(avatar_contradiction_clause,[],[f117])).
% 0.07/0.25 thf(f120,plain,(
% 0.07/0.25 ( ! [X0 : $o] : ((((f @ X0)) != X0) | ($false = X0)) ) | spl0_5),
% 0.07/0.25 inference(constrained_superposition,[],[f66,f8])).
% 0.07/0.25 thf(f124,plain,(
% 0.07/0.25 ( ! [X0 : $o] : (($false = ((f @ X0))) | ($false = X0) | ($false = X0)) ) | spl0_5),
% 0.07/0.25 inference(xor_proxy_clausification,[],[f120])).
% 0.07/0.25 thf(f125,plain,(
% 0.07/0.25 ( ! [X0 : $o] : (($false = ((f @ X0))) | ($false = X0)) ) | spl0_5),
% 0.07/0.25 inference(duplicate_literal_removal,[],[f124])).
% 0.07/0.25 thf(f136,plain,(
% 0.07/0.25 ($true = $false) | (((f @ x)) = $false) | spl0_5),
% 0.07/0.25 inference(constrained_superposition,[],[f5,f125])).
% 0.07/0.25 thf(f138,plain,(
% 0.07/0.25 (((f @ x)) = $false) | spl0_5),
% 0.07/0.25 inference(trivial_inequality_removal,[],[f136])).
% 0.07/0.25 thf(f160,plain,(
% 0.07/0.25 (((f @ x)) = $true) | spl0_5),
% 0.07/0.25 inference(forward_subsumption_resolution,[],[f102,f66])).
% 0.07/0.25 thf(f161,plain,(
% 0.07/0.25 ($true = $false) | spl0_5),
% 0.07/0.25 inference(forward_demodulation,[],[f160,f138])).
% 0.07/0.25 thf(f162,plain,(
% 0.07/0.25 $false | spl0_5),
% 0.07/0.25 inference(trivial_inequality_removal,[],[f161])).
% 0.07/0.25 thf(f163,plain,(
% 0.07/0.25 spl0_5),
% 0.07/0.25 inference(avatar_contradiction_clause,[],[f162])).
% 0.07/0.25 cnf(s43, plain, ~spl0_3 | ~spl0_5 | spl0_6, inference(sat_conversion,[],[f94])).
% 0.07/0.25 cnf(s46, plain, ~spl0_3 | ~spl0_6, inference(sat_conversion,[],[f100])).
% 0.07/0.25 cnf(s54, plain, spl0_3 | ~spl0_5, inference(sat_conversion,[],[f118])).
% 0.07/0.25 cnf(s78, plain, spl0_5, inference(sat_conversion,[],[f163])).
% 0.07/0.25 cnf(s79, plain, spl0_3, inference(rat,[],[s54,s78])).
% 0.07/0.25 cnf(s80, plain, ~spl0_6, inference(rat,[],[s46,s79])).
% 0.07/0.25 cnf(s81, plain, $false, inference(rat,[],[s43,s80,s78,s79])).
% 0.07/0.25 thf(f164,plain,(
% 0.07/0.25 $false),
% 0.07/0.25 inference(avatar_sat_refutation,[],[s81])).
% 0.07/0.25 % SZS output end Proof for theBenchmark
% 0.07/0.25 % (2875981)------------------------------
% 0.07/0.25 % (2875981)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (2875981)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (2875981)CaDiCaL version: 2.1.3
% 0.07/0.25 % (2875981)Termination reason: Refutation
% 0.07/0.25 % (2875981)Time elapsed: 0.004 s
% 0.07/0.25 % (2875981)Peak memory usage: 13 MB
% 0.07/0.25 % (2875981)Instructions burned: 7 (million)
% 0.07/0.25 % (2875974)Success in time 0.031 s
% 0.07/0.25 % Vampire exiting
%------------------------------------------------------------------------------