%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO145^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 : n013.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:02 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO145^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.18 % Computer : n013.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 16:34:36 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22 Running first-order model finding
% 0.10/0.22 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.10/0.25 % (2342767)Will run a generic schedule for satisfiability detection.
% 0.10/0.25 % (2342777)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3955430829:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.25 % (2342777) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2342767-2342777"...
% 0.10/0.25 % (2342777)...printing done.
% 0.10/0.25 % (2342773)% WARNING: option uhcvi not known.
% 0.10/0.25 % (2342777)Refutation found. Thanks to Tanya!
% 0.10/0.25 % SZS status Theorem for theBenchmark
% 0.10/0.25 % SZS output start Proof for theBenchmark
% 0.10/0.25 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.10/0.25 thf(func_def_0, type, cP: ($i > $i > $o)).
% 0.10/0.25 thf(func_def_5, type, sK1: ($i > $i)).
% 0.10/0.25 thf(f1,conjecture,(
% 0.10/0.25 ! [X0 : $i] : ? [X1 : $i] : (cP @ X0 @ X1) => ! [X0 : $i] : ? [X1 : $i,X2 : $i] : ((cP @ X0 @ X1) & (cP @ X1 @ X2))),
% 0.10/0.25 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEXPVAR_BUG)).
% 0.10/0.25 thf(f2,negated_conjecture,(
% 0.10/0.25 ~(! [X0 : $i] : ? [X1 : $i] : (cP @ X0 @ X1) => ! [X0 : $i] : ? [X1 : $i,X2 : $i] : ((cP @ X0 @ X1) & (cP @ X1 @ X2)))),
% 0.10/0.25 inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.25 thf(f3,plain,(
% 0.10/0.25 ~(! [X0 : $i] : ? [X1 : $i] : (cP @ X0 @ X1) => ! [X2 : $i] : ? [X3 : $i,X4 : $i] : ((cP @ X2 @ X3) & (cP @ X3 @ X4)))),
% 0.10/0.25 inference(rectify,[],[f2])).
% 0.10/0.25 thf(f4,plain,(
% 0.10/0.25 ~(! [X0 : $i] : ? [X1 : $i] : (((cP @ X0 @ X1)) = $true) => ! [X2 : $i] : ? [X3 : $i,X4 : $i] : ((((cP @ X2 @ X3)) = $true) & (((cP @ X3 @ X4)) = $true)))),
% 0.10/0.25 inference(fool_elimination,[],[f3])).
% 0.10/0.25 thf(f5,plain,(
% 0.10/0.25 ? [X2 : $i] : ! [X3 : $i,X4 : $i] : ((((cP @ X2 @ X3)) != $true) | (((cP @ X3 @ X4)) != $true)) & ! [X0 : $i] : ? [X1 : $i] : (((cP @ X0 @ X1)) = $true)),
% 0.10/0.25 inference(ennf_transformation,[],[f4])).
% 0.10/0.25 thf(f6,plain,(
% 0.10/0.25 ? [X0 : $i] : ! [X1 : $i,X2 : $i] : ((((cP @ X0 @ X1)) != $true) | (((cP @ X1 @ X2)) != $true)) & ! [X3 : $i] : ? [X4 : $i] : (((cP @ X3 @ X4)) = $true)),
% 0.10/0.25 inference(rectify,[],[f5])).
% 0.10/0.25 thf(f7,plain,(
% 0.10/0.25 ! [X1 : $i,X2 : $i] : (($true != ((cP @ sK0 @ X1))) | (((cP @ X1 @ X2)) != $true)) & ! [X3 : $i] : ($true = ((cP @ X3 @ (sK1 @ X3))))),
% 0.10/0.25 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP]),skolemize(X0,sK0),skolemize(X4,sK1 @ X3)],[f6])).
% 0.10/0.25 thf(f8,plain,(
% 0.10/0.25 ( ! [X3 : $i] : (($true = ((cP @ X3 @ (sK1 @ X3))))) )),
% 0.10/0.25 inference(cnf_transformation,[],[f7])).
% 0.10/0.25 thf(f9,plain,(
% 0.10/0.25 ( ! [X2 : $i,X1 : $i] : (($true != ((cP @ sK0 @ X1))) | (((cP @ X1 @ X2)) != $true)) )),
% 0.10/0.25 inference(cnf_transformation,[],[f7])).
% 0.10/0.25 thf(f12,plain,(
% 0.10/0.25 ( ! [X0 : $i] : (($true != $true) | ($true != ((cP @ (sK1 @ sK0) @ X0)))) )),
% 0.10/0.25 inference(constrained_superposition,[],[f9,f8])).
% 0.10/0.25 thf(f13,plain,(
% 0.10/0.25 ( ! [X0 : $i] : (($true != ((cP @ (sK1 @ sK0) @ X0)))) )),
% 0.10/0.25 inference(trivial_inequality_removal,[],[f12])).
% 0.10/0.25 thf(f14,plain,(
% 0.10/0.25 ($true != $true)),
% 0.10/0.25 inference(constrained_superposition,[],[f13,f8])).
% 0.10/0.25 thf(f15,plain,(
% 0.10/0.25 $false),
% 0.10/0.25 inference(trivial_inequality_removal,[],[f14])).
% 0.10/0.25 % SZS output end Proof for theBenchmark
% 0.10/0.25 % (2342777)------------------------------
% 0.10/0.25 % (2342777)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25 % (2342777)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25 % (2342777)CaDiCaL version: 2.1.3
% 0.10/0.25 % (2342777)Termination reason: Refutation
% 0.10/0.25 % (2342777)Time elapsed: 0.001 s
% 0.10/0.25 % (2342777)Peak memory usage: 12 MB
% 0.10/0.25 % (2342777)Instructions burned: 1 (million)
% 0.10/0.25 % (2342767)Success in time 0.031 s
% 0.10/0.25 % Vampire exiting
%------------------------------------------------------------------------------