%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO554^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:24 AM UTC 2026
% Result : Unsatisfiable 0.22s 0.28s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO554^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n002.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 17:17:22 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.28 % (1589921)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.28 % (1589929)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=2497892162:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.22/0.28 % (1589929) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1589921-1589929"...
% 0.22/0.28 % (1589929)...printing done.
% 0.22/0.28 % (1589929)Refutation found. Thanks to Tanya!
% 0.22/0.28 % SZS status Unsatisfiable for theBenchmark
% 0.22/0.28 % SZS output start Proof for theBenchmark
% 0.22/0.28 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.22/0.28 thf(func_def_0, type, p: ($i > $o)).
% 0.22/0.28 thf(f1,axiom,(
% 0.22/0.28 (p @ t) | (p @ s)),
% 0.22/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pst)).
% 0.22/0.28 thf(f2,axiom,(
% 0.22/0.28 ~(p @ t) | ~(p @ u)),
% 0.22/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',puv)).
% 0.22/0.28 thf(f3,axiom,(
% 0.22/0.28 (s = t)),
% 0.22/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',st)).
% 0.22/0.28 thf(f4,axiom,(
% 0.22/0.28 (t = u)),
% 0.22/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tu)).
% 0.22/0.28 thf(f5,plain,(
% 0.22/0.28 ~(p @ t) | ~(p @ u)),
% 0.22/0.28 inference(rectify,[],[f2])).
% 0.22/0.28 thf(f6,plain,(
% 0.22/0.28 ~ (((p @ t)) = $true) | ~ (((p @ u)) = $true)),
% 0.22/0.28 inference(fool_elimination,[],[f5])).
% 0.22/0.28 thf(f7,plain,(
% 0.22/0.28 (p @ t) | (p @ s)),
% 0.22/0.28 inference(rectify,[],[f1])).
% 0.22/0.28 thf(f8,plain,(
% 0.22/0.28 (((p @ s)) = $true) | (((p @ t)) = $true)),
% 0.22/0.28 inference(fool_elimination,[],[f7])).
% 0.22/0.28 thf(f9,plain,(
% 0.22/0.28 (((p @ u)) != $true) | (((p @ t)) != $true)),
% 0.22/0.28 inference(flattening,[],[f6])).
% 0.22/0.28 thf(f10,plain,(
% 0.22/0.28 (s = t)),
% 0.22/0.28 inference(cnf_transformation,[],[f3])).
% 0.22/0.28 thf(f11,plain,(
% 0.22/0.28 (t = u)),
% 0.22/0.28 inference(cnf_transformation,[],[f4])).
% 0.22/0.28 thf(f12,plain,(
% 0.22/0.28 (((p @ s)) = $true) | (((p @ t)) = $true)),
% 0.22/0.28 inference(cnf_transformation,[],[f8])).
% 0.22/0.28 thf(f13,plain,(
% 0.22/0.28 (((p @ u)) != $true) | (((p @ t)) != $true)),
% 0.22/0.28 inference(cnf_transformation,[],[f9])).
% 0.22/0.28 thf(f16,definition,(
% 0.22/0.28 spl0_1 <=> (((p @ t)) = $true)),
% 0.22/0.28 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.22/0.28 thf(f20,definition,(
% 0.22/0.28 spl0_2 <=> (((p @ u)) = $true)),
% 0.22/0.28 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.22/0.28 thf(f23,plain,(
% 0.22/0.28 ~spl0_1 | ~spl0_2),
% 0.22/0.28 inference(avatar_split_clause,[],[f13,f20,f16])).
% 0.22/0.28 thf(f25,definition,(
% 0.22/0.28 spl0_3 <=> (t = u)),
% 0.22/0.28 introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition])).
% 0.22/0.28 thf(f28,plain,(
% 0.22/0.28 spl0_3),
% 0.22/0.28 inference(avatar_split_clause,[],[f11,f25])).
% 0.22/0.28 thf(f30,definition,(
% 0.22/0.28 spl0_4 <=> (s = t)),
% 0.22/0.28 introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition])).
% 0.22/0.28 thf(f33,plain,(
% 0.22/0.28 spl0_4),
% 0.22/0.28 inference(avatar_split_clause,[],[f10,f30])).
% 0.22/0.28 thf(f35,definition,(
% 0.22/0.28 spl0_5 <=> (((p @ s)) = $true)),
% 0.22/0.28 introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition])).
% 0.22/0.28 thf(f38,plain,(
% 0.22/0.28 spl0_5 | spl0_1),
% 0.22/0.28 inference(avatar_split_clause,[],[f12,f16,f35])).
% 0.22/0.28 thf(f39,definition,(
% 0.22/0.28 (s != t) | (((p @ s)) != $true) | (((p @ t)) = $true)),
% 0.22/0.28 introduced(theory,[theory_tautology_sat_conflict])).
% 0.22/0.28 thf(f40,definition,(
% 0.22/0.28 (t != u) | (((p @ t)) != $true) | (((p @ u)) = $true)),
% 0.22/0.28 introduced(theory,[theory_tautology_sat_conflict])).
% 0.22/0.28 cnf(s1, plain, ~spl0_1 | ~spl0_2, inference(sat_conversion,[],[f23])).
% 0.22/0.28 cnf(s2, plain, spl0_3, inference(sat_conversion,[],[f28])).
% 0.22/0.28 cnf(s3, plain, spl0_4, inference(sat_conversion,[],[f33])).
% 0.22/0.28 cnf(s4, plain, spl0_1 | spl0_5, inference(sat_conversion,[],[f38])).
% 0.22/0.28 cnf(s5, plain, spl0_1 | ~spl0_4 | ~spl0_5, inference(sat_conversion,[],[f39])).
% 0.22/0.28 cnf(s6, plain, ~spl0_1 | spl0_2 | ~spl0_3, inference(sat_conversion,[],[f40])).
% 0.22/0.28 cnf(s7, plain, spl0_1, inference(rat,[],[s4,s5,s3])).
% 0.22/0.28 cnf(s8, plain, spl0_2, inference(rat,[],[s6,s2,s7])).
% 0.22/0.28 cnf(s9, plain, $false, inference(rat,[],[s1,s8,s7])).
% 0.22/0.28 thf(f41,plain,(
% 0.22/0.28 $false),
% 0.22/0.28 inference(avatar_sat_refutation,[],[s9])).
% 0.22/0.28 % SZS output end Proof for theBenchmark
% 0.22/0.28 % (1589929)------------------------------
% 0.22/0.28 % (1589929)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.28 % (1589929)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.28 % (1589929)CaDiCaL version: 2.1.3
% 0.22/0.28 % (1589929)Termination reason: Refutation
% 0.22/0.28 % (1589929)Time elapsed: 0.001 s
% 0.22/0.28 % (1589929)Peak memory usage: 13 MB
% 0.22/0.28 % (1589929)Instructions burned: 1 (million)
% 0.22/0.28 % (1589921)Success in time 0.036 s
% 0.22/0.28 % Vampire exiting
%------------------------------------------------------------------------------