%------------------------------------------------------------------------------
% File : Vampire---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 THM
% 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:47:32 AM UTC 2026
% Result : Theorem 0.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % 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 THM
% 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:49:00 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/0.24 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.19/0.27 % (2914790)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.19/0.27 % (2914799)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1043394178:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.19/0.27 % (2914799) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2914790-2914799"...
% 0.19/0.27 % (2914799)...printing done.
% 0.19/0.27 % (2914799)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% 0.19/0.27 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.19/0.27 thf(func_def_0, type, cB: $o).
% 0.19/0.27 thf(func_def_1, type, cA: $o).
% 0.19/0.27 thf(func_def_2, type, cP: ($o > $o)).
% 0.19/0.27 thf(func_def_4, type, vIMP: ($o > $o > $o)).
% 0.19/0.27 thf(func_def_7, type, vOR: ($o > $o > $o)).
% 0.19/0.27 thf(func_def_8, type, vNOT: ($o > $o)).
% 0.19/0.27 thf(f1,conjecture,(
% 0.19/0.27 (cP @ cA => cB) => (cP @ ~cA | cB)),
% 0.19/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTRIVEXT5)).
% 0.19/0.27 thf(f2,negated_conjecture,(
% 0.19/0.27 ~((cP @ cA => cB) => (cP @ ~cA | cB))),
% 0.19/0.27 inference(negated_conjecture,[status(cth)],[f1])).
% 0.19/0.27 thf(f3,plain,(
% 0.19/0.27 ~((cP @ cA => cB) => (cP @ ~cA | cB))),
% 0.19/0.27 inference(rectify,[],[f2])).
% 0.19/0.27 thf(f4,plain,(
% 0.19/0.27 ~(($true = ((cP @ (cA => cB)))) => ($true = ((cP @ (cB | (~ cA))))))),
% 0.19/0.27 inference(fool_elimination,[],[f3])).
% 0.19/0.27 thf(f5,plain,(
% 0.19/0.27 ($true = ((cP @ (cA => cB)))) & ($true != ((cP @ (cB | (~ cA)))))),
% 0.19/0.27 inference(ennf_transformation,[],[f4])).
% 0.19/0.27 thf(f6,plain,(
% 0.19/0.27 ($true != ((cP @ (cB | (~ cA)))))),
% 0.19/0.27 inference(cnf_transformation,[],[f5])).
% 0.19/0.27 thf(f7,plain,(
% 0.19/0.27 ($true = ((cP @ (cA => cB))))),
% 0.19/0.27 inference(cnf_transformation,[],[f5])).
% 0.19/0.27 thf(f9,plain,(
% 0.19/0.27 (cB = $false) | ($true = ((cP @ (cA => $true))))),
% 0.19/0.27 inference(fool_paramodulation,[],[f7])).
% 0.19/0.27 thf(f10,plain,(
% 0.19/0.27 ($true = ((cP @ $true))) | (cB = $false)),
% 0.19/0.27 inference(boolean_simplification,[],[f9])).
% 0.19/0.27 thf(f11,plain,(
% 0.19/0.27 ($true != ((cP @ (cB | (~ $true))))) | (cA = $false)),
% 0.19/0.27 inference(fool_paramodulation,[],[f6])).
% 0.19/0.27 thf(f12,plain,(
% 0.19/0.27 (cA = $false) | ($true != ((cP @ (cB | $false))))),
% 0.19/0.27 inference(boolean_simplification,[],[f11])).
% 0.19/0.27 thf(f13,plain,(
% 0.19/0.27 (((cP @ cB)) != $true) | (cA = $false)),
% 0.19/0.27 inference(boolean_simplification,[],[f12])).
% 0.19/0.27 thf(f14,plain,(
% 0.19/0.27 (cB = $false) | (cA = $false) | ($true != ((cP @ $true)))),
% 0.19/0.27 inference(fool_paramodulation,[],[f13])).
% 0.19/0.27 thf(f15,plain,(
% 0.19/0.27 (cB = $false) | (cA = $false)),
% 0.19/0.27 inference(forward_subsumption_resolution,[],[f14,f10])).
% 0.19/0.27 thf(f16,plain,(
% 0.19/0.27 (cA = $false) | ($true != ((cP @ $false))) | (cA = $false)),
% 0.19/0.27 inference(superposition,[],[f13,f15])).
% 0.19/0.27 thf(f18,plain,(
% 0.19/0.27 (cA = $false) | ($true = ((cP @ (cA => $false))))),
% 0.19/0.27 inference(superposition,[],[f7,f15])).
% 0.19/0.27 thf(f19,plain,(
% 0.19/0.27 ($true = ((cP @ (~ cA)))) | (cA = $false)),
% 0.19/0.27 inference(boolean_simplification,[],[f18])).
% 0.19/0.27 thf(f21,plain,(
% 0.19/0.27 ($true != ((cP @ $false))) | (cA = $false)),
% 0.19/0.27 inference(duplicate_literal_removal,[],[f16])).
% 0.19/0.27 thf(f22,plain,(
% 0.19/0.27 (cA = $false) | ($true = ((cP @ (~ $true)))) | (cA = $false)),
% 0.19/0.27 inference(fool_paramodulation,[],[f19])).
% 0.19/0.27 thf(f23,plain,(
% 0.19/0.27 ($true = ((cP @ (~ $true)))) | (cA = $false)),
% 0.19/0.27 inference(duplicate_literal_removal,[],[f22])).
% 0.19/0.27 thf(f24,plain,(
% 0.19/0.27 (cA = $false) | ($true = ((cP @ $false)))),
% 0.19/0.27 inference(boolean_simplification,[],[f23])).
% 0.19/0.27 thf(f25,plain,(
% 0.19/0.27 (cA = $false)),
% 0.19/0.27 inference(forward_subsumption_resolution,[],[f24,f21])).
% 0.19/0.27 thf(f26,plain,(
% 0.19/0.27 (((cP @ (cB | (~ $false)))) != $true)),
% 0.19/0.27 inference(superposition,[],[f6,f25])).
% 0.19/0.27 thf(f27,plain,(
% 0.19/0.27 ($true = ((cP @ ($false => cB))))),
% 0.19/0.27 inference(superposition,[],[f7,f25])).
% 0.19/0.27 thf(f28,plain,(
% 0.19/0.27 ($true = ((cP @ $true)))),
% 0.19/0.27 inference(boolean_simplification,[],[f27])).
% 0.19/0.27 thf(f29,plain,(
% 0.19/0.27 ($true != ((cP @ (cB | $true))))),
% 0.19/0.27 inference(boolean_simplification,[],[f26])).
% 0.19/0.27 thf(f30,plain,(
% 0.19/0.27 ($true != ((cP @ $true)))),
% 0.19/0.27 inference(boolean_simplification,[],[f29])).
% 0.19/0.27 thf(f31,plain,(
% 0.19/0.27 $false),
% 0.19/0.27 inference(forward_subsumption_resolution,[],[f30,f28])).
% 0.19/0.27 % SZS output end Proof for theBenchmark
% 0.19/0.27 % (2914799)------------------------------
% 0.19/0.27 % (2914799)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (2914799)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (2914799)CaDiCaL version: 2.1.3
% 0.19/0.27 % (2914799)Termination reason: Refutation
% 0.19/0.27 % (2914799)Time elapsed: 0.001 s
% 0.19/0.27 % (2914799)Peak memory usage: 12 MB
% 0.19/0.27 % (2914799)Instructions burned: 2 (million)
% 0.19/0.27 % (2914790)Success in time 0.027 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------