↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEV382^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 : 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:38:32 AM UTC 2026

% Result   : Theorem 0.21s 0.30s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV382^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.09/0.18  % Computer : n013.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Tue Sep 29 15:43:06 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  Running higher-order theorem proving
% 0.09/0.23  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.21/0.30  % (2273812)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.30  % (2273818)lrs+10_16_si=on:nwc=1.5:random_seed=380994158:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.30  % (2273823)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.30  % (2273823)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.21/0.30  % (2273818)Instruction limit reached! 
% 0.21/0.30  % (2273818)------------------------------
% 0.21/0.30  % (2273818)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30  % (2273818)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30  % (2273818)CaDiCaL version: 2.1.3
% 0.21/0.30  % (2273818)Termination reason: Instruction limit
% 0.21/0.30  % (2273818)Termination phase: Saturation
% 0.21/0.30  % (2273818)Time elapsed: 0.006 s
% 0.21/0.30  % (2273818)Peak memory usage: 12 MB
% 0.21/0.30  % (2273818)Instructions burned: 20 (million)
% 0.21/0.30  % (2273817)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2748052411:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.30  % (2273819)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1979152980:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.30  % (2273820)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=2327118126:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.21/0.30  % (2273821)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3124131915:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.30  % (2273823)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=628433659:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.30  % (2273819)Refutation not found, incomplete strategy
% 0.21/0.30  % (2273819)------------------------------
% 0.21/0.30  % (2273819)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30  % (2273819)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30  % (2273819)CaDiCaL version: 2.1.3
% 0.21/0.30  % (2273819)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.30  % (2273819)Time elapsed: 0.003 s
% 0.21/0.30  % (2273819)Peak memory usage: 12 MB
% 0.21/0.30  % (2273819)Instructions burned: 4 (million)
% 0.21/0.30  % (2273819)------------------------------
% 0.21/0.30  % (2273819)------------------------------
% 0.21/0.30  % (2273825)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3715170690:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.21/0.30  % (2273825)Instruction limit reached! 
% 0.21/0.30  % (2273825)------------------------------
% 0.21/0.30  % (2273825)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30  % (2273825)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30  % (2273825)CaDiCaL version: 2.1.3
% 0.21/0.30  % (2273825)Termination reason: Instruction limit
% 0.21/0.30  % (2273825)Termination phase: Saturation
% 0.21/0.30  % (2273825)Time elapsed: 0.001 s
% 0.21/0.30  % (2273825)Peak memory usage: 12 MB
% 0.21/0.30  % (2273825)Instructions burned: 2 (million)
% 0.21/0.30  % (2273821) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2273812-2273821"...
% 0.21/0.30  % (2273820)Refutation not found, incomplete strategy
% 0.21/0.30  % (2273820)------------------------------
% 0.21/0.30  % (2273820)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30  % (2273820)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30  % (2273820)CaDiCaL version: 2.1.3
% 0.21/0.30  % (2273820)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.30  % (2273820)Time elapsed: 0.012 s
% 0.21/0.30  % (2273820)Peak memory usage: 12 MB
% 0.21/0.30  % (2273820)Instructions burned: 19 (million)
% 0.21/0.30  % (2273822)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2393099010:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.30  % (2273820)------------------------------
% 0.21/0.30  % (2273820)------------------------------
% 0.21/0.30  % (2273821)...printing done.
% 0.21/0.30  % (2273821)Refutation found. Thanks to Tanya!
% 0.21/0.30  % SZS status Theorem for theBenchmark
% 0.21/0.30  % SZS output start Proof for theBenchmark
% 0.21/0.30  thf(type_def_5, type, a: $tType).
% 0.21/0.30  thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.21/0.30  thf(func_def_3, type, sK0: (a > a > $o)).
% 0.21/0.30  thf(func_def_4, type, sK1: (a > $o)).
% 0.21/0.30  thf(func_def_5, type, sK2: (a > a)).
% 0.21/0.30  thf(func_def_6, type, sK3: ((a > $o) > a)).
% 0.21/0.30  thf(func_def_7, type, sK4: a).
% 0.21/0.30  thf(func_def_8, type, vNOT: ($o > $o)).
% 0.21/0.30  thf(func_def_9, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.21/0.30  thf(func_def_10, type, db0: !>[X0: $tType]:(X0)).
% 0.21/0.30  thf(func_def_11, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.21/0.30  thf(f1,conjecture,(
% 0.21/0.30    ! [X1 : (a > $o),X0 : (a > a > $o)] : ((! [X2 : (a > $o)] : (? [X3 : a] : (X2 @ X3) => ? [X4 : a] : ((X2 @ X4) & ! [X5 : a] : ((X0 @ X5 @ X4) => ~(X2 @ X5)))) & ! [X6 : a] : (! [X4 : a] : ((X0 @ X4 @ X6) => (X1 @ X4)) => (X1 @ X6))) => ! [X6 : a] : (X1 @ X6))),
% 0.21/0.30    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTRANS_IND)).
% 0.21/0.30  thf(f2,negated_conjecture,(
% 0.21/0.30    ~ ! [X1 : (a > $o),X0 : (a > a > $o)] : ((! [X2 : (a > $o)] : (? [X3 : a] : (X2 @ X3) => ? [X4 : a] : ((X2 @ X4) & ! [X5 : a] : ((X0 @ X5 @ X4) => ~(X2 @ X5)))) & ! [X6 : a] : (! [X4 : a] : ((X0 @ X4 @ X6) => (X1 @ X4)) => (X1 @ X6))) => ! [X6 : a] : (X1 @ X6))),
% 0.21/0.30    inference(negated_conjecture,[status(cth)],[f1])).
% 0.21/0.30  thf(f3,plain,(
% 0.21/0.30    ~ ! [X0 : (a > $o),X1 : (a > a > $o)] : ((! [X2 : (a > $o)] : (? [X3 : a] : (X2 @ X3) => ? [X4 : a] : ((X2 @ X4) & ! [X5 : a] : ((X1 @ X5 @ X4) => ~(X2 @ X5)))) & ! [X6 : a] : (! [X7 : a] : ((X1 @ X7 @ X6) => (X0 @ X7)) => (X0 @ X6))) => ! [X8 : a] : (X0 @ X8))),
% 0.21/0.30    inference(rectify,[],[f2])).
% 0.21/0.30  thf(f4,plain,(
% 0.21/0.30    ~ ! [X0 : (a > $o),X1 : (a > a > $o)] : ((! [X2 : (a > $o)] : (? [X3 : a] : (((X2 @ X3)) = $true) => ? [X4 : a] : ((((X2 @ X4)) = $true) & ! [X5 : a] : (($true = ((X1 @ X5 @ X4))) => ~ (((X2 @ X5)) = $true)))) & ! [X6 : a] : (! [X7 : a] : ((((X1 @ X7 @ X6)) = $true) => (((X0 @ X7)) = $true)) => (((X0 @ X6)) = $true))) => ! [X8 : a] : ($true = ((X0 @ X8))))),
% 0.21/0.30    inference(fool_elimination,[],[f3])).
% 0.21/0.30  thf(f5,plain,(
% 0.21/0.30    ~ ! [X1 : (a > a > $o),X0 : (a > $o)] : ((! [X6 : a] : (! [X7 : a] : ((((X1 @ X7 @ X6)) = $true) => (((X0 @ X7)) = $true)) => (((X0 @ X6)) = $true)) & ! [X2 : (a > $o)] : (? [X3 : a] : (((X2 @ X3)) = $true) => ? [X4 : a] : (! [X5 : a] : (($true = ((X1 @ X5 @ X4))) => (((X2 @ X5)) != $true)) & (((X2 @ X4)) = $true)))) => ! [X8 : a] : ($true = ((X0 @ X8))))),
% 0.21/0.30    inference(flattening,[],[f4])).
% 0.21/0.30  thf(f6,plain,(
% 0.21/0.30    ? [X1 : (a > a > $o),X0 : (a > $o)] : (? [X8 : a] : ($true != ((X0 @ X8))) & (! [X6 : a] : (? [X7 : a] : ((((X1 @ X7 @ X6)) = $true) & (((X0 @ X7)) != $true)) | (((X0 @ X6)) = $true)) & ! [X2 : (a > $o)] : (? [X4 : a] : ((((X2 @ X4)) = $true) & ! [X5 : a] : (($true != ((X1 @ X5 @ X4))) | (((X2 @ X5)) != $true))) | ! [X3 : a] : (((X2 @ X3)) != $true))))),
% 0.21/0.30    inference(ennf_transformation,[],[f5])).
% 0.21/0.30  thf(f7,plain,(
% 0.21/0.30    ? [X1 : (a > a > $o),X0 : (a > $o)] : (! [X6 : a] : (? [X7 : a] : ((((X1 @ X7 @ X6)) = $true) & (((X0 @ X7)) != $true)) | (((X0 @ X6)) = $true)) & ! [X2 : (a > $o)] : (? [X4 : a] : ((((X2 @ X4)) = $true) & ! [X5 : a] : (($true != ((X1 @ X5 @ X4))) | (((X2 @ X5)) != $true))) | ! [X3 : a] : (((X2 @ X3)) != $true)) & ? [X8 : a] : ($true != ((X0 @ X8))))),
% 0.21/0.30    inference(flattening,[],[f6])).
% 0.21/0.30  thf(f8,plain,(
% 0.21/0.30    ? [X0 : (a > a > $o),X1 : (a > $o)] : (! [X2 : a] : (? [X3 : a] : ((((X0 @ X3 @ X2)) = $true) & (((X1 @ X3)) != $true)) | ($true = ((X1 @ X2)))) & ! [X4 : (a > $o)] : (? [X5 : a] : (($true = ((X4 @ X5))) & ! [X6 : a] : ((((X0 @ X6 @ X5)) != $true) | (((X4 @ X6)) != $true))) | ! [X7 : a] : (((X4 @ X7)) != $true)) & ? [X8 : a] : (((X1 @ X8)) != $true))),
% 0.21/0.30    inference(rectify,[],[f7])).
% 0.21/0.30  thf(f9,plain,(
% 0.21/0.30    ! [X2 : a] : (((((sK0 @ (sK2 @ X2) @ X2)) = $true) & (((sK1 @ (sK2 @ X2))) != $true)) | (((sK1 @ X2)) = $true)) & ! [X4 : (a > $o)] : (((((X4 @ (sK3 @ X4))) = $true) & ! [X6 : a] : (($true != ((sK0 @ X6 @ (sK3 @ X4)))) | (((X4 @ X6)) != $true))) | ! [X7 : a] : (((X4 @ X7)) != $true)) & ($true != ((sK1 @ sK4)))),
% 0.21/0.30    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,vAPP,vAPP,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X5,sK3 @ X4),skolemize(X5,sK3 @ X4),skolemize(X8,sK4)],[f8])).
% 0.21/0.30  thf(f10,plain,(
% 0.21/0.30    ($true != ((sK1 @ sK4)))),
% 0.21/0.30    inference(cnf_transformation,[],[f9])).
% 0.21/0.30  thf(f11,plain,(
% 0.21/0.30    ( ! [X6 : a,X7 : a,X4 : (a > $o)] : (($true != ((sK0 @ X6 @ (sK3 @ X4)))) | (((X4 @ X7)) != $true) | (((X4 @ X6)) != $true)) )),
% 0.21/0.30    inference(cnf_transformation,[],[f9])).
% 0.21/0.30  thf(f12,plain,(
% 0.21/0.30    ( ! [X7 : a,X4 : (a > $o)] : ((((X4 @ X7)) != $true) | (((X4 @ (sK3 @ X4))) = $true)) )),
% 0.21/0.30    inference(cnf_transformation,[],[f9])).
% 0.21/0.30  thf(f13,plain,(
% 0.21/0.30    ( ! [X2 : a] : ((((sK1 @ (sK2 @ X2))) != $true) | (((sK1 @ X2)) = $true)) )),
% 0.21/0.30    inference(cnf_transformation,[],[f9])).
% 0.21/0.30  thf(f14,plain,(
% 0.21/0.30    ( ! [X2 : a] : ((((sK0 @ (sK2 @ X2) @ X2)) = $true) | (((sK1 @ X2)) = $true)) )),
% 0.21/0.30    inference(cnf_transformation,[],[f9])).
% 0.21/0.30  thf(f19,plain,(
% 0.21/0.30    ( ! [X8 : (a > $o),X7 : a] : (((((^[Y0 : a]: (~ (X8 @ Y0))) @ X7)) != $true) | ((((^[Y0 : a]: (~ (X8 @ Y0))) @ (sK3 @ (^[Y0 : a]: (~ (X8 @ Y0)))))) = $true)) )),
% 0.21/0.30    inference(primitive_instantiation,[],[f12])).
% 0.21/0.30  thf(f21,plain,(
% 0.21/0.30    ( ! [X8 : (a > $o),X7 : a] : ((((~ (X8 @ X7))) != $true) | ($true = ((~ (X8 @ (sK3 @ (^[Y0 : a]: (~ (X8 @ Y0))))))))) )),
% 0.21/0.30    inference(beta-eta_normalization,[],[f19])).
% 0.21/0.30  thf(f22,plain,(
% 0.21/0.30    ( ! [X8 : (a > $o),X7 : a] : (($true = ((~ (X8 @ (sK3 @ (^[Y0 : a]: (~ (X8 @ Y0)))))))) | ($true = ((X8 @ X7)))) )),
% 0.21/0.30    inference(not_proxy_clausification,[],[f21])).
% 0.21/0.30  thf(f23,plain,(
% 0.21/0.30    ( ! [X8 : (a > $o),X7 : a] : ((((X8 @ (sK3 @ (^[Y0 : a]: (~ (X8 @ Y0)))))) = $false) | ($true = ((X8 @ X7)))) )),
% 0.21/0.30    inference(not_proxy_clausification,[],[f22])).
% 0.21/0.30  thf(f30,plain,(
% 0.21/0.30    ( ! [X0 : (a > $o),X1 : a] : (($true != $true) | ($true = ((sK1 @ (sK3 @ X0)))) | (((X0 @ (sK2 @ (sK3 @ X0)))) != $true) | (((X0 @ X1)) != $true)) )),
% 0.21/0.30    inference(superposition,[],[f11,f14])).
% 0.21/0.30  thf(f33,plain,(
% 0.21/0.30    ( ! [X0 : (a > $o),X1 : a] : ((((X0 @ (sK2 @ (sK3 @ X0)))) != $true) | ($true = ((sK1 @ (sK3 @ X0)))) | (((X0 @ X1)) != $true)) )),
% 0.21/0.30    inference(trivial_inequality_removal,[],[f30])).
% 0.21/0.30  thf(f135,plain,(
% 0.21/0.30    ( ! [X2 : (a > $o),X1 : a] : (($true != (((^[Y0 : a]: (~ (X2 @ Y0))) @ X1))) | ($true = ((sK1 @ (sK3 @ (^[Y0 : a]: (~ (X2 @ Y0))))))) | ($true != (((^[Y0 : a]: (~ (X2 @ Y0))) @ (sK2 @ (sK3 @ (^[Y0 : a]: (~ (X2 @ Y0))))))))) )),
% 0.21/0.30    inference(primitive_instantiation,[],[f33])).
% 0.21/0.30  thf(f141,plain,(
% 0.21/0.30    ( ! [X2 : (a > $o),X1 : a] : (($true != ((~ (X2 @ (sK2 @ (sK3 @ (^[Y0 : a]: (~ (X2 @ Y0))))))))) | ($true = ((sK1 @ (sK3 @ (^[Y0 : a]: (~ (X2 @ Y0))))))) | (((~ (X2 @ X1))) != $true)) )),
% 0.21/0.30    inference(beta-eta_normalization,[],[f135])).
% 0.21/0.30  thf(f142,plain,(
% 0.21/0.30    ( ! [X2 : (a > $o),X1 : a] : (($true = ((sK1 @ (sK3 @ (^[Y0 : a]: (~ (X2 @ Y0))))))) | (((X2 @ (sK2 @ (sK3 @ (^[Y0 : a]: (~ (X2 @ Y0))))))) = $true) | (((~ (X2 @ X1))) != $true)) )),
% 0.21/0.30    inference(not_proxy_clausification,[],[f141])).
% 0.21/0.30  thf(f143,plain,(
% 0.21/0.30    ( ! [X2 : (a > $o),X1 : a] : ((((X2 @ X1)) = $true) | (((X2 @ (sK2 @ (sK3 @ (^[Y0 : a]: (~ (X2 @ Y0))))))) = $true) | ($true = ((sK1 @ (sK3 @ (^[Y0 : a]: (~ (X2 @ Y0)))))))) )),
% 0.21/0.30    inference(not_proxy_clausification,[],[f142])).
% 0.21/0.30  thf(f235,plain,(
% 0.21/0.30    ( ! [X0 : a] : (($true = ((sK1 @ (sK3 @ (^[Y0 : a]: (~ (sK1 @ Y0))))))) | ($true = ((sK1 @ (sK3 @ (^[Y0 : a]: (~ (sK1 @ Y0))))))) | (((sK1 @ X0)) = $true) | ($true != $true)) )),
% 0.21/0.30    inference(superposition,[],[f13,f143])).
% 0.21/0.30  thf(f264,plain,(
% 0.21/0.30    ( ! [X0 : a] : ((((sK1 @ X0)) = $true) | ($true != $true) | ($true = ((sK1 @ (sK3 @ (^[Y0 : a]: (~ (sK1 @ Y0)))))))) )),
% 0.21/0.30    inference(duplicate_literal_removal,[],[f235])).
% 0.21/0.30  thf(f265,plain,(
% 0.21/0.30    ( ! [X0 : a] : ((((sK1 @ X0)) = $true) | ($true = ((sK1 @ (sK3 @ (^[Y0 : a]: (~ (sK1 @ Y0)))))))) )),
% 0.21/0.30    inference(trivial_inequality_removal,[],[f264])).
% 0.21/0.30  thf(f288,plain,(
% 0.21/0.30    ( ! [X0 : a] : (($false = $true) | (((sK1 @ X0)) = $true) | ($false = $true)) )),
% 0.21/0.30    inference(superposition,[],[f265,f23])).
% 0.21/0.30  thf(f302,plain,(
% 0.21/0.30    ( ! [X0 : a] : ((((sK1 @ X0)) = $true) | ($false = $true)) )),
% 0.21/0.30    inference(duplicate_literal_removal,[],[f288])).
% 0.21/0.30  thf(f303,plain,(
% 0.21/0.30    ( ! [X0 : a] : ((((sK1 @ X0)) = $true)) )),
% 0.21/0.30    inference(trivial_inequality_removal,[],[f302])).
% 0.21/0.30  thf(f316,plain,(
% 0.21/0.30    ($true != $true)),
% 0.21/0.30    inference(superposition,[],[f10,f303])).
% 0.21/0.30  thf(f329,plain,(
% 0.21/0.30    $false),
% 0.21/0.30    inference(trivial_inequality_removal,[],[f316])).
% 0.21/0.30  % SZS output end Proof for theBenchmark
% 0.21/0.30  % (2273821)------------------------------
% 0.21/0.30  % (2273821)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30  % (2273821)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30  % (2273821)CaDiCaL version: 2.1.3
% 0.21/0.30  % (2273821)Termination reason: Refutation
% 0.21/0.30  % (2273821)Time elapsed: 0.013 s
% 0.21/0.30  % (2273821)Peak memory usage: 12 MB
% 0.21/0.30  % (2273821)Instructions burned: 22 (million)
% 0.21/0.30  % (2273812)Success in time 0.059 s
% 0.21/0.30  % Vampire exiting
%------------------------------------------------------------------------------