%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV056^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 : n009.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:38:55 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 : SEV056^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19 % Computer : n009.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 15:05:45 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21 Running first-order model finding
% 0.10/0.21 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.10/0.25 % (4114347)Will run a generic schedule for satisfiability detection.
% 0.10/0.25 % (4114357)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3098932724:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.25 % (4114357) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4114347-4114357"...
% 0.10/0.25 % (4114353)% WARNING: option uhcvi not known.
% 0.10/0.25 % (4114357)...printing done.
% 0.10/0.25 % (4114357)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, a: $tType).
% 0.10/0.25 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.10/0.25 thf(func_def_3, type, sK0: (a > a > $o)).
% 0.10/0.25 thf(func_def_4, type, sK1: ((a > a > $o) > a)).
% 0.10/0.25 thf(func_def_5, type, sK2: ((a > a > $o) > a)).
% 0.10/0.25 thf(func_def_6, type, sK3: ((a > a > $o) > a)).
% 0.10/0.25 thf(func_def_7, type, sK4: ((a > a > $o) > a)).
% 0.10/0.25 thf(func_def_8, type, sK5: ((a > a > $o) > a)).
% 0.10/0.25 thf(func_def_9, type, vNOT: ($o > $o)).
% 0.10/0.25 thf(func_def_10, type, db0: !>[X0: $tType]:(X0)).
% 0.10/0.25 thf(func_def_11, type, db1: !>[X0: $tType]:(X0)).
% 0.10/0.25 thf(func_def_12, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.10/0.25 thf(func_def_13, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.10/0.25 thf(func_def_14, type, db2: !>[X0: $tType]:(X0)).
% 0.10/0.25 thf(f1,conjecture,(
% 0.10/0.25 ! [X0 : (a > a > $o)] : ? [X1 : (a > a > $o)] : (! [X2 : a,X3 : a,X4 : a] : (((X1 @ X3 @ X4) & (X1 @ X2 @ X3)) => (X1 @ X2 @ X4)) & ! [X2 : a,X3 : a] : ((X0 @ X2 @ X3) => (X1 @ X2 @ X3)))),
% 0.10/0.25 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM275_pme)).
% 0.10/0.25 thf(f2,negated_conjecture,(
% 0.10/0.25 ~ ! [X0 : (a > a > $o)] : ? [X1 : (a > a > $o)] : (! [X2 : a,X3 : a,X4 : a] : (((X1 @ X3 @ X4) & (X1 @ X2 @ X3)) => (X1 @ X2 @ X4)) & ! [X2 : a,X3 : a] : ((X0 @ X2 @ X3) => (X1 @ X2 @ X3)))),
% 0.10/0.25 inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.25 thf(f3,plain,(
% 0.10/0.25 ~ ! [X0 : (a > a > $o)] : ? [X1 : (a > a > $o)] : (! [X2 : a,X3 : a,X4 : a] : (((X1 @ X3 @ X4) & (X1 @ X2 @ X3)) => (X1 @ X2 @ X4)) & ! [X5 : a,X6 : a] : ((X0 @ X5 @ X6) => (X1 @ X5 @ X6)))),
% 0.10/0.25 inference(rectify,[],[f2])).
% 0.10/0.25 thf(f4,plain,(
% 0.10/0.25 ~ ! [X0 : (a > a > $o)] : ? [X1 : (a > a > $o)] : (! [X2 : a,X3 : a,X4 : a] : (((((X1 @ X3 @ X4)) = $true) & (((X1 @ X2 @ X3)) = $true)) => (((X1 @ X2 @ X4)) = $true)) & ! [X5 : a,X6 : a] : ((((X0 @ X5 @ X6)) = $true) => (((X1 @ X5 @ X6)) = $true)))),
% 0.10/0.25 inference(fool_elimination,[],[f3])).
% 0.10/0.25 thf(f5,plain,(
% 0.10/0.25 ? [X0 : (a > a > $o)] : ! [X1 : (a > a > $o)] : (? [X2 : a,X3 : a,X4 : a] : ((((X1 @ X2 @ X4)) != $true) & ((((X1 @ X3 @ X4)) = $true) & (((X1 @ X2 @ X3)) = $true))) | ? [X5 : a,X6 : a] : ((((X1 @ X5 @ X6)) != $true) & (((X0 @ X5 @ X6)) = $true)))),
% 0.10/0.25 inference(ennf_transformation,[],[f4])).
% 0.10/0.25 thf(f6,plain,(
% 0.10/0.25 ? [X0 : (a > a > $o)] : ! [X1 : (a > a > $o)] : (? [X2 : a,X3 : a,X4 : a] : ((((X1 @ X2 @ X4)) != $true) & (((X1 @ X3 @ X4)) = $true) & (((X1 @ X2 @ X3)) = $true)) | ? [X5 : a,X6 : a] : ((((X1 @ X5 @ X6)) != $true) & (((X0 @ X5 @ X6)) = $true)))),
% 0.10/0.25 inference(flattening,[],[f5])).
% 0.10/0.25 thf(f7,plain,(
% 0.10/0.25 ! [X1 : (a > a > $o)] : ((($true != ((X1 @ (sK1 @ X1) @ (sK3 @ X1)))) & ($true = ((X1 @ (sK2 @ X1) @ (sK3 @ X1)))) & ($true = ((X1 @ (sK1 @ X1) @ (sK2 @ X1))))) | (($true != ((X1 @ (sK4 @ X1) @ (sK5 @ X1)))) & ($true = ((sK0 @ (sK4 @ X1) @ (sK5 @ X1))))))),
% 0.10/0.26 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,vAPP,vAPP,vAPP,vAPP,vAPP]),skolemize(X0,sK0),skolemize(X6,sK5 @ X1),skolemize(X6,sK5 @ X1),skolemize(X6,sK5 @ X1),skolemize(X6,sK5 @ X1),skolemize(X6,sK5 @ X1)],[f6])).
% 0.10/0.26 thf(f13,plain,(
% 0.10/0.26 ( ! [X1 : (a > a > $o)] : (($true != ((X1 @ (sK4 @ X1) @ (sK5 @ X1)))) | ($true != ((X1 @ (sK1 @ X1) @ (sK3 @ X1))))) )),
% 0.10/0.26 inference(cnf_transformation,[],[f7])).
% 0.10/0.26 thf(f164,plain,(
% 0.10/0.26 ($true != (((^[Y0 : a]: ((^[Y1 : a]: ($true)))) @ (sK1 @ (^[Y0 : a]: ((^[Y1 : a]: ($true))))) @ (sK3 @ (^[Y0 : a]: ((^[Y1 : a]: ($true))))))))),
% 0.10/0.26 inference(equality_resolution,[],[f13])).
% 0.10/0.26 thf(f165,plain,(
% 0.10/0.26 ($true != $true)),
% 0.10/0.26 inference(beta-eta_normalization,[],[f164])).
% 0.10/0.26 thf(f166,plain,(
% 0.10/0.26 $false),
% 0.10/0.26 inference(trivial_inequality_removal,[],[f165])).
% 0.10/0.26 % SZS output end Proof for theBenchmark
% 0.10/0.26 % (4114357)------------------------------
% 0.10/0.26 % (4114357)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.26 % (4114357)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.26 % (4114357)CaDiCaL version: 2.1.3
% 0.10/0.26 % (4114357)Termination reason: Refutation
% 0.10/0.26 % (4114357)Time elapsed: 0.005 s
% 0.10/0.26 % (4114357)Peak memory usage: 12 MB
% 0.10/0.26 % (4114357)Instructions burned: 16 (million)
% 0.10/0.26 % (4114347)Success in time 0.032 s
% 0.10/0.26 % Vampire exiting
%------------------------------------------------------------------------------