%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO253^5 : 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 : 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 : Wed Sep 30 08:49:36 AM UTC 2026
% Result : Theorem 0.26s 0.36s
% Output : Refutation 0.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYO253^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.26 % Computer : n004.cluster.edu
% 0.11/0.26 % Model : x86_64 x86_64
% 0.11/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.26 % Memory : 8046.5625MB
% 0.11/0.26 % OS : Linux 6.8.0-71-generic
% 0.11/0.26 % CPULimit : 300
% 0.11/0.26 % WCLimit : 300
% 0.11/0.26 % DateTime : Tue Sep 29 16:41:37 UTC 2026
% 0.11/0.27 % CPUTime :
% 0.11/0.27 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.26/0.31 Running first-order model finding
% 0.26/0.31 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.26/0.36 % (1536420)Will run a generic schedule for satisfiability detection.
% 0.26/0.36 % (1536430)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=618253260:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.26/0.36 % (1536430) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1536420-1536430"...
% 0.26/0.36 % (1536430)...printing done.
% 0.26/0.36 % (1536430)Refutation found. Thanks to Tanya!
% 0.26/0.36 % SZS status Theorem for theBenchmark
% 0.26/0.36 % SZS output start Proof for theBenchmark
% 0.26/0.36 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.26/0.36 thf(func_def_0, type, p: $o).
% 0.26/0.36 thf(func_def_2, type, vAND: ($o > $o > $o)).
% 0.26/0.36 thf(func_def_3, type, vNOT: ($o > $o)).
% 0.26/0.36 thf(func_def_6, type, vOR: ($o > $o > $o)).
% 0.26/0.36 thf(func_def_7, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.26/0.36 thf(func_def_8, type, db0: !>[X0: $tType]:(X0)).
% 0.26/0.36 thf(func_def_9, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.26/0.36 thf(f1,conjecture,(
% 0.26/0.36 ? [X0 : ($o > $o)] : (~(X0 @ ~p | p) & (X0 @ ~p & p))),
% 0.26/0.36 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM124)).
% 0.26/0.36 thf(f2,negated_conjecture,(
% 0.26/0.36 ~ ? [X0 : ($o > $o)] : (~(X0 @ ~p | p) & (X0 @ ~p & p))),
% 0.26/0.36 inference(negated_conjecture,[status(cth)],[f1])).
% 0.26/0.36 thf(f3,plain,(
% 0.26/0.36 ~ ? [X0 : ($o > $o)] : (~(X0 @ ~p | p) & (X0 @ ~p & p))),
% 0.26/0.36 inference(rectify,[],[f2])).
% 0.26/0.36 thf(f4,plain,(
% 0.26/0.36 ~ ? [X0 : ($o > $o)] : (~ ($true = ((X0 @ (p | (~ p))))) & (((X0 @ (p & (~ p)))) = $true))),
% 0.26/0.36 inference(fool_elimination,[],[f3])).
% 0.26/0.36 thf(f5,plain,(
% 0.26/0.36 ~ ? [X0 : ($o > $o)] : (($true != ((X0 @ (p | (~ p))))) & (((X0 @ (p & (~ p)))) = $true))),
% 0.26/0.36 inference(flattening,[],[f4])).
% 0.26/0.36 thf(f6,plain,(
% 0.26/0.36 ! [X0 : ($o > $o)] : (($true = ((X0 @ (p | (~ p))))) | (((X0 @ (p & (~ p)))) != $true))),
% 0.26/0.36 inference(ennf_transformation,[],[f5])).
% 0.26/0.36 thf(f7,plain,(
% 0.26/0.36 ( ! [X0 : ($o > $o)] : (($true = ((X0 @ (p | (~ p))))) | (((X0 @ (p & (~ p)))) != $true)) )),
% 0.26/0.36 inference(cnf_transformation,[],[f6])).
% 0.26/0.36 thf(f10,plain,(
% 0.26/0.36 ( ! [X0 : ($o > $o)] : (($true = ((X0 @ $true))) | (((X0 @ (p & (~ p)))) != $true)) )),
% 0.26/0.36 inference(boolean_simplification,[],[f7])).
% 0.26/0.36 thf(f11,plain,(
% 0.26/0.36 ( ! [X0 : ($o > $o)] : (($true != ((X0 @ $false))) | ($true = ((X0 @ $true)))) )),
% 0.26/0.36 inference(boolean_simplification,[],[f10])).
% 0.26/0.36 thf(f13,plain,(
% 0.26/0.36 ($true = $false)),
% 0.26/0.36 inference(leibniz_equality_elimination,[],[f11])).
% 0.26/0.36 thf(f26,plain,(
% 0.26/0.36 $false),
% 0.26/0.36 inference(trivial_inequality_removal,[],[f13])).
% 0.26/0.36 % SZS output end Proof for theBenchmark
% 0.26/0.36 % (1536430)------------------------------
% 0.26/0.36 % (1536430)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.36 % (1536430)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.36 % (1536430)CaDiCaL version: 2.1.3
% 0.26/0.36 % (1536430)Termination reason: Refutation
% 0.26/0.36 % (1536430)Time elapsed: 0.001 s
% 0.26/0.36 % (1536430)Peak memory usage: 12 MB
% 0.26/0.36 % (1536430)Instructions burned: 1 (million)
% 0.26/0.36 % (1536420)Success in time 0.032 s
% 0.26/0.36 % Vampire exiting
%------------------------------------------------------------------------------