%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO221^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:33 AM UTC 2026
% Result : Theorem 0.07s 0.26s
% Output : Refutation 0.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO221^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n004.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:39:52 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.26 % (1531550)Will run a generic schedule for satisfiability detection.
% 0.07/0.26 % (1531556)% WARNING: option uhcvi not known.
% 0.07/0.26 % (1531556)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3070547995:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.26 % (1531556)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.07/0.26 % (1531556)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.07/0.26 % (1531556) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1531550-1531556"...
% 0.07/0.26 % (1531556)...printing done.
% 0.07/0.26 % (1531556)Refutation found. Thanks to Tanya!
% 0.07/0.26 % SZS status Theorem for theBenchmark
% 0.07/0.26 % SZS output start Proof for theBenchmark
% 0.07/0.26 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.07/0.26 thf(func_def_1, type, cP: ($i > $o)).
% 0.07/0.26 thf(func_def_6, type, sK0: (($i > $o) > $i)).
% 0.07/0.26 thf(func_def_7, type, vNOT: ($o > $o)).
% 0.07/0.26 thf(func_def_8, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.07/0.26 thf(func_def_9, type, db0: !>[X0: $tType]:(X0)).
% 0.07/0.26 thf(func_def_10, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.07/0.26 thf(f1,conjecture,(
% 0.07/0.26 ? [X0 : ($i > $o)] : (((a != b) & (cP @ a)) => (~(X0 @ b) & ? [X2 : $i] : (X0 @ X2) & ! [X1 : $i] : ((X0 @ X1) => (cP @ X1))))),
% 0.07/0.26 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBLEDSOE6)).
% 0.07/0.26 thf(f2,negated_conjecture,(
% 0.07/0.26 ~ ? [X0 : ($i > $o)] : (((a != b) & (cP @ a)) => (~(X0 @ b) & ? [X2 : $i] : (X0 @ X2) & ! [X1 : $i] : ((X0 @ X1) => (cP @ X1))))),
% 0.07/0.26 inference(negated_conjecture,[status(cth)],[f1])).
% 0.07/0.26 thf(f3,plain,(
% 0.07/0.26 ~ ? [X0 : ($i > $o)] : (((a != b) & (cP @ a)) => (~(X0 @ b) & ? [X1 : $i] : (X0 @ X1) & ! [X2 : $i] : ((X0 @ X2) => (cP @ X2))))),
% 0.07/0.26 inference(rectify,[],[f2])).
% 0.07/0.26 thf(f4,plain,(
% 0.07/0.26 ~ ? [X0 : ($i > $o)] : (((a != b) & (((cP @ a)) = $true)) => (~ (((X0 @ b)) = $true) & ? [X1 : $i] : (((X0 @ X1)) = $true) & ! [X2 : $i] : ((((X0 @ X2)) = $true) => (((cP @ X2)) = $true))))),
% 0.07/0.26 inference(fool_elimination,[],[f3])).
% 0.07/0.26 thf(f5,plain,(
% 0.07/0.26 ~ ? [X0 : ($i > $o)] : (((a != b) & (((cP @ a)) = $true)) => ((((X0 @ b)) != $true) & ? [X1 : $i] : (((X0 @ X1)) = $true) & ! [X2 : $i] : ((((X0 @ X2)) = $true) => (((cP @ X2)) = $true))))),
% 0.07/0.26 inference(flattening,[],[f4])).
% 0.07/0.26 thf(f6,plain,(
% 0.07/0.26 ! [X0 : ($i > $o)] : (((((X0 @ b)) = $true) | ! [X1 : $i] : (((X0 @ X1)) != $true) | ? [X2 : $i] : ((((cP @ X2)) != $true) & (((X0 @ X2)) = $true))) & ((a != b) & (((cP @ a)) = $true)))),
% 0.07/0.26 inference(ennf_transformation,[],[f5])).
% 0.07/0.26 thf(f7,plain,(
% 0.07/0.26 ! [X0 : ($i > $o)] : (((((X0 @ b)) = $true) | ! [X1 : $i] : (((X0 @ X1)) != $true) | ? [X2 : $i] : ((((cP @ X2)) != $true) & (((X0 @ X2)) = $true))) & (a != b) & (((cP @ a)) = $true))),
% 0.07/0.26 inference(flattening,[],[f6])).
% 0.07/0.26 thf(f8,plain,(
% 0.07/0.26 ! [X0 : ($i > $o)] : (((((X0 @ b)) = $true) | ! [X1 : $i] : (((X0 @ X1)) != $true) | (($true != ((cP @ (sK0 @ X0)))) & ($true = ((X0 @ (sK0 @ X0)))))) & (a != b) & (((cP @ a)) = $true))),
% 0.07/0.26 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X2,sK0 @ X0)],[f7])).
% 0.07/0.26 thf(f9,plain,(
% 0.07/0.26 (((cP @ a)) = $true)),
% 0.07/0.26 inference(cnf_transformation,[],[f8])).
% 0.07/0.26 thf(f10,plain,(
% 0.07/0.26 (a != b)),
% 0.07/0.26 inference(cnf_transformation,[],[f8])).
% 0.07/0.26 thf(f11,plain,(
% 0.07/0.26 ( ! [X0 : ($i > $o),X1 : $i] : ((((X0 @ X1)) != $true) | (((X0 @ b)) = $true) | ($true = ((X0 @ (sK0 @ X0))))) )),
% 0.07/0.26 inference(cnf_transformation,[],[f8])).
% 0.07/0.26 thf(f12,plain,(
% 0.07/0.26 ( ! [X0 : ($i > $o),X1 : $i] : (($true != ((cP @ (sK0 @ X0)))) | (((X0 @ X1)) != $true) | (((X0 @ b)) = $true)) )),
% 0.07/0.26 inference(cnf_transformation,[],[f8])).
% 0.07/0.26 thf(f15,plain,(
% 0.07/0.26 ( ! [X0 : $i] : ((b = X0) | ($true = ((X0 = (sK0 @ (= @ X0)))))) )),
% 0.07/0.26 inference(leibniz_equality_elimination,[],[f11])).
% 0.07/0.26 thf(f41,plain,(
% 0.07/0.26 ( ! [X0 : $i] : ((((sK0 @ (= @ X0))) = X0) | (b = X0)) )),
% 0.07/0.26 inference(equality_proxy_clausification,[],[f15])).
% 0.07/0.26 thf(f62,plain,(
% 0.07/0.26 ( ! [X0 : $i] : (($true != ((cP @ (sK0 @ (= @ X0))))) | (b = X0)) )),
% 0.07/0.26 inference(leibniz_equality_elimination,[],[f12])).
% 0.07/0.26 thf(f110,plain,(
% 0.07/0.26 ( ! [X0 : $i] : (($true != ((cP @ X0))) | (b = X0) | (b = X0)) )),
% 0.07/0.26 inference(constrained_superposition,[],[f62,f41])).
% 0.07/0.26 thf(f113,plain,(
% 0.07/0.26 ( ! [X0 : $i] : (($true != ((cP @ X0))) | (b = X0)) )),
% 0.07/0.26 inference(duplicate_literal_removal,[],[f110])).
% 0.07/0.26 thf(f257,plain,(
% 0.07/0.26 ($true != $true) | (a = b)),
% 0.07/0.26 inference(constrained_superposition,[],[f113,f9])).
% 0.07/0.26 thf(f265,plain,(
% 0.07/0.26 (a = b)),
% 0.07/0.26 inference(trivial_inequality_removal,[],[f257])).
% 0.07/0.26 thf(f266,plain,(
% 0.07/0.26 $false),
% 0.07/0.26 inference(forward_subsumption_resolution,[],[f265,f10])).
% 0.07/0.26 % SZS output end Proof for theBenchmark
% 0.07/0.26 % (1531556)------------------------------
% 0.07/0.26 % (1531556)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.26 % (1531556)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.26 % (1531556)CaDiCaL version: 2.1.3
% 0.07/0.26 % (1531556)Termination reason: Refutation
% 0.07/0.26 % (1531556)Time elapsed: 0.004 s
% 0.07/0.26 % (1531556)Peak memory usage: 12 MB
% 0.07/0.26 % (1531556)Instructions burned: 12 (million)
% 0.07/0.26 % (1531550)Success in time 0.034 s
% 0.07/0.26 % Vampire exiting
%------------------------------------------------------------------------------