TSTP Solution File: SEV384^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV384^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 16:03:39 EDT 2024
% Result : Theorem 0.19s 0.39s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEV384^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.11 % Command : run_vampire %s %d THM
% 0.10/0.32 % Computer : n017.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Fri Jun 21 19:32:09 EDT 2024
% 0.10/0.33 % CPUTime :
% 0.19/0.34 This is a TH0_THM_NEQ_NAR problem
% 0.19/0.35 Running higher-order theorem proving
% 0.19/0.35 Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/benchmark/theBenchmark.p -m 16384 -t 300
% 0.19/0.36 % (21118)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.19/0.37 % (21112)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.19/0.37 % (21114)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.19/0.37 % (21113)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.19/0.37 % (21116)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.37 % (21117)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.19/0.37 % (21115)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.37 % (21115)Instruction limit reached!
% 0.19/0.37 % (21115)------------------------------
% 0.19/0.37 % (21115)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.37 % (21115)Termination reason: Unknown
% 0.19/0.37 % (21115)Termination phase: Saturation
% 0.19/0.37
% 0.19/0.37 % (21115)Memory used [KB]: 5500
% 0.19/0.37 % (21115)Time elapsed: 0.004 s
% 0.19/0.37 % (21115)Instructions burned: 2 (million)
% 0.19/0.37 % (21115)------------------------------
% 0.19/0.37 % (21115)------------------------------
% 0.19/0.37 % (21116)Instruction limit reached!
% 0.19/0.37 % (21116)------------------------------
% 0.19/0.37 % (21116)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.37 % (21116)Termination reason: Unknown
% 0.19/0.37 % (21116)Termination phase: Saturation
% 0.19/0.37
% 0.19/0.37 % (21116)Memory used [KB]: 5500
% 0.19/0.37 % (21116)Time elapsed: 0.004 s
% 0.19/0.37 % (21116)Instructions burned: 2 (million)
% 0.19/0.37 % (21116)------------------------------
% 0.19/0.37 % (21116)------------------------------
% 0.19/0.37 % (21113)Instruction limit reached!
% 0.19/0.37 % (21113)------------------------------
% 0.19/0.37 % (21113)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.37 % (21113)Termination reason: Unknown
% 0.19/0.37 % (21113)Termination phase: Saturation
% 0.19/0.37
% 0.19/0.37 % (21113)Memory used [KB]: 5500
% 0.19/0.37 % (21113)Time elapsed: 0.006 s
% 0.19/0.37 % (21113)Instructions burned: 4 (million)
% 0.19/0.37 % (21113)------------------------------
% 0.19/0.37 % (21113)------------------------------
% 0.19/0.37 % (21114)Refutation not found, incomplete strategy
% 0.19/0.37 % (21114)------------------------------
% 0.19/0.37 % (21114)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.37 % (21114)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37 % (21114)Memory used [KB]: 5500
% 0.19/0.37 % (21114)Time elapsed: 0.006 s
% 0.19/0.37 % (21114)Instructions burned: 4 (million)
% 0.19/0.37 % (21114)------------------------------
% 0.19/0.37 % (21114)------------------------------
% 0.19/0.38 % (21118)Instruction limit reached!
% 0.19/0.38 % (21118)------------------------------
% 0.19/0.38 % (21118)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.38 % (21118)Termination reason: Unknown
% 0.19/0.38 % (21118)Termination phase: Saturation
% 0.19/0.38
% 0.19/0.38 % (21118)Memory used [KB]: 5628
% 0.19/0.38 % (21118)Time elapsed: 0.012 s
% 0.19/0.38 % (21118)Instructions burned: 18 (million)
% 0.19/0.38 % (21118)------------------------------
% 0.19/0.38 % (21118)------------------------------
% 0.19/0.38 % (21119)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.38 % (21120)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.39 % (21117)First to succeed.
% 0.19/0.39 % (21121)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.39 % (21122)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.39 % (21119)Instruction limit reached!
% 0.19/0.39 % (21119)------------------------------
% 0.19/0.39 % (21119)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.39 % (21119)Termination reason: Unknown
% 0.19/0.39 % (21119)Termination phase: Saturation
% 0.19/0.39
% 0.19/0.39 % (21119)Memory used [KB]: 5500
% 0.19/0.39 % (21119)Time elapsed: 0.005 s
% 0.19/0.39 % (21119)Instructions burned: 4 (million)
% 0.19/0.39 % (21119)------------------------------
% 0.19/0.39 % (21119)------------------------------
% 0.19/0.39 % (21117)Refutation found. Thanks to Tanya!
% 0.19/0.39 % SZS status Theorem for theBenchmark
% 0.19/0.39 % SZS output start Proof for theBenchmark
% 0.19/0.39 thf(func_def_0, type, cP: $i > $o).
% 0.19/0.39 thf(func_def_1, type, s: $i > $o).
% 0.19/0.39 thf(func_def_2, type, cR: $i > $i > $o).
% 0.19/0.39 thf(func_def_6, type, sK0: $i > $i).
% 0.19/0.39 thf(func_def_8, type, sK2: ($i > $o) > $i).
% 0.19/0.39 thf(func_def_11, type, ph4: !>[X0: $tType]:(X0)).
% 0.19/0.39 thf(f291,plain,(
% 0.19/0.39 $false),
% 0.19/0.39 inference(avatar_sat_refutation,[],[f215,f226,f290])).
% 0.19/0.39 thf(f290,plain,(
% 0.19/0.39 spl3_8 | ~spl3_16),
% 0.19/0.39 inference(avatar_split_clause,[],[f287,f212,f148])).
% 0.19/0.39 thf(f148,plain,(
% 0.19/0.39 spl3_8 <=> ! [X0] : ((cP @ X0) = $true)),
% 0.19/0.39 introduced(avatar_definition,[new_symbols(naming,[spl3_8])])).
% 0.19/0.39 thf(f212,plain,(
% 0.19/0.39 spl3_16 <=> ($true = (cP @ (sK2 @ (^[Y0 : $i]: (~ (cP @ Y0))))))),
% 0.19/0.39 introduced(avatar_definition,[new_symbols(naming,[spl3_16])])).
% 0.19/0.39 thf(f287,plain,(
% 0.19/0.39 ( ! [X0 : $i] : (((cP @ X0) = $true)) ) | ~spl3_16),
% 0.19/0.39 inference(trivial_inequality_removal,[],[f286])).
% 0.19/0.39 thf(f286,plain,(
% 0.19/0.39 ( ! [X0 : $i] : (((cP @ X0) = $true) | ($false = $true)) ) | ~spl3_16),
% 0.19/0.39 inference(superposition,[],[f29,f214])).
% 0.19/0.39 thf(f214,plain,(
% 0.19/0.39 ($true = (cP @ (sK2 @ (^[Y0 : $i]: (~ (cP @ Y0)))))) | ~spl3_16),
% 0.19/0.39 inference(avatar_component_clause,[],[f212])).
% 0.19/0.39 thf(f29,plain,(
% 0.19/0.39 ( ! [X7 : $i > $o,X4 : $i] : (($false = (X7 @ (sK2 @ (^[Y0 : $i]: (~ (X7 @ Y0)))))) | ((X7 @ X4) = $true)) )),
% 0.19/0.39 inference(not_proxy_clausification,[],[f28])).
% 0.19/0.39 thf(f28,plain,(
% 0.19/0.39 ( ! [X7 : $i > $o,X4 : $i] : (((~ (X7 @ (sK2 @ (^[Y0 : $i]: (~ (X7 @ Y0)))))) = $true) | ((X7 @ X4) = $true)) )),
% 0.19/0.39 inference(not_proxy_clausification,[],[f27])).
% 0.19/0.39 thf(f27,plain,(
% 0.19/0.39 ( ! [X7 : $i > $o,X4 : $i] : (((~ (X7 @ X4)) != $true) | ((~ (X7 @ (sK2 @ (^[Y0 : $i]: (~ (X7 @ Y0)))))) = $true)) )),
% 0.19/0.39 inference(beta_eta_normalization,[],[f24])).
% 0.19/0.39 thf(f24,plain,(
% 0.19/0.39 ( ! [X7 : $i > $o,X4 : $i] : (($true = ((^[Y0 : $i]: (~ (X7 @ Y0))) @ (sK2 @ (^[Y0 : $i]: (~ (X7 @ Y0)))))) | (((^[Y0 : $i]: (~ (X7 @ Y0))) @ X4) != $true)) )),
% 0.19/0.39 inference(primitive_instantiation,[],[f15])).
% 0.19/0.39 thf(f15,plain,(
% 0.19/0.39 ( ! [X3 : $i > $o,X4 : $i] : (((X3 @ (sK2 @ X3)) = $true) | ((X3 @ X4) != $true)) )),
% 0.19/0.39 inference(cnf_transformation,[],[f13])).
% 0.19/0.39 thf(f13,plain,(
% 0.19/0.39 ! [X0] : (((cP @ X0) = $true) | (((s @ (sK0 @ X0)) = $true) & ($true = (cR @ X0 @ (sK0 @ X0))) & ($true != (cP @ (sK0 @ X0))))) & (((s @ sK1) = $true) & ($true != (cP @ sK1))) & ! [X3 : $i > $o,X4] : (((X3 @ X4) != $true) | (((X3 @ (sK2 @ X3)) = $true) & ! [X6] : (($true != (X3 @ X6)) | ($true != (cR @ (sK2 @ X3) @ X6)))))),
% 0.19/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f9,f12,f11,f10])).
% 0.19/0.39 thf(f10,plain,(
% 0.19/0.39 ! [X0] : (? [X1] : (((s @ X1) = $true) & ((cR @ X0 @ X1) = $true) & ((cP @ X1) != $true)) => (((s @ (sK0 @ X0)) = $true) & ($true = (cR @ X0 @ (sK0 @ X0))) & ($true != (cP @ (sK0 @ X0)))))),
% 0.19/0.39 introduced(choice_axiom,[])).
% 0.19/0.39 thf(f11,plain,(
% 0.19/0.39 ? [X2] : (((s @ X2) = $true) & ((cP @ X2) != $true)) => (((s @ sK1) = $true) & ($true != (cP @ sK1)))),
% 0.19/0.39 introduced(choice_axiom,[])).
% 0.19/0.39 thf(f12,plain,(
% 0.19/0.39 ! [X3 : $i > $o] : (? [X5] : (((X3 @ X5) = $true) & ! [X6] : (($true != (X3 @ X6)) | ((cR @ X5 @ X6) != $true))) => (((X3 @ (sK2 @ X3)) = $true) & ! [X6] : (($true != (X3 @ X6)) | ($true != (cR @ (sK2 @ X3) @ X6)))))),
% 0.19/0.39 introduced(choice_axiom,[])).
% 0.19/0.39 thf(f9,plain,(
% 0.19/0.39 ! [X0] : (((cP @ X0) = $true) | ? [X1] : (((s @ X1) = $true) & ((cR @ X0 @ X1) = $true) & ((cP @ X1) != $true))) & ? [X2] : (((s @ X2) = $true) & ((cP @ X2) != $true)) & ! [X3 : $i > $o,X4] : (((X3 @ X4) != $true) | ? [X5] : (((X3 @ X5) = $true) & ! [X6] : (($true != (X3 @ X6)) | ((cR @ X5 @ X6) != $true))))),
% 0.19/0.39 inference(rectify,[],[f8])).
% 0.19/0.39 thf(f8,plain,(
% 0.19/0.39 ! [X4] : (((cP @ X4) = $true) | ? [X5] : (((s @ X5) = $true) & ((cR @ X4 @ X5) = $true) & ((cP @ X5) != $true))) & ? [X6] : (((s @ X6) = $true) & ((cP @ X6) != $true)) & ! [X1 : $i > $o,X0] : (($true != (X1 @ X0)) | ? [X2] : (((X1 @ X2) = $true) & ! [X3] : (((X1 @ X3) != $true) | ((cR @ X2 @ X3) != $true))))),
% 0.19/0.39 inference(flattening,[],[f7])).
% 0.19/0.39 thf(f7,plain,(
% 0.19/0.39 ? [X6] : (((s @ X6) = $true) & ((cP @ X6) != $true)) & (! [X4] : (((cP @ X4) = $true) | ? [X5] : (((cP @ X5) != $true) & (((cR @ X4 @ X5) = $true) & ((s @ X5) = $true)))) & ! [X1 : $i > $o,X0] : (($true != (X1 @ X0)) | ? [X2] : (((X1 @ X2) = $true) & ! [X3] : (((X1 @ X3) != $true) | ((cR @ X2 @ X3) != $true)))))),
% 0.19/0.39 inference(ennf_transformation,[],[f6])).
% 0.19/0.39 thf(f6,plain,(
% 0.19/0.39 ~((! [X4] : (! [X5] : ((((cR @ X4 @ X5) = $true) & ((s @ X5) = $true)) => ((cP @ X5) = $true)) => ((cP @ X4) = $true)) & ! [X0,X1 : $i > $o] : (($true = (X1 @ X0)) => ? [X2] : (! [X3] : (((cR @ X2 @ X3) = $true) => ((X1 @ X3) != $true)) & ((X1 @ X2) = $true)))) => ! [X6] : (((s @ X6) = $true) => ((cP @ X6) = $true)))),
% 0.19/0.39 inference(flattening,[],[f5])).
% 0.19/0.39 thf(f5,plain,(
% 0.19/0.39 ~((! [X0,X1 : $i > $o] : (($true = (X1 @ X0)) => ? [X2] : (((X1 @ X2) = $true) & ! [X3] : (((cR @ X2 @ X3) = $true) => ~((X1 @ X3) = $true)))) & ! [X4] : (! [X5] : ((((cR @ X4 @ X5) = $true) & ((s @ X5) = $true)) => ((cP @ X5) = $true)) => ((cP @ X4) = $true))) => ! [X6] : (((s @ X6) = $true) => ((cP @ X6) = $true)))),
% 0.19/0.39 inference(fool_elimination,[],[f4])).
% 0.19/0.39 thf(f4,plain,(
% 0.19/0.39 ~((! [X0,X1 : $i > $o] : ((X1 @ X0) => ? [X2] : ((X1 @ X2) & ! [X3] : ((cR @ X2 @ X3) => ~(X1 @ X3)))) & ! [X4] : (! [X5] : (((cR @ X4 @ X5) & (s @ X5)) => (cP @ X5)) => (cP @ X4))) => ! [X6] : ((s @ X6) => (cP @ X6)))),
% 0.19/0.39 inference(rectify,[],[f2])).
% 0.19/0.39 thf(f2,negated_conjecture,(
% 0.19/0.39 ~((! [X1,X0 : $i > $o] : ((X0 @ X1) => ? [X2] : ((X0 @ X2) & ! [X3] : ((cR @ X2 @ X3) => ~(X0 @ X3)))) & ! [X4] : (! [X5] : (((cR @ X4 @ X5) & (s @ X5)) => (cP @ X5)) => (cP @ X4))) => ! [X6] : ((s @ X6) => (cP @ X6)))),
% 0.19/0.39 inference(negated_conjecture,[],[f1])).
% 0.19/0.39 thf(f1,conjecture,(
% 0.19/0.39 (! [X1,X0 : $i > $o] : ((X0 @ X1) => ? [X2] : ((X0 @ X2) & ! [X3] : ((cR @ X2 @ X3) => ~(X0 @ X3)))) & ! [X4] : (! [X5] : (((cR @ X4 @ X5) & (s @ X5)) => (cP @ X5)) => (cP @ X4))) => ! [X6] : ((s @ X6) => (cP @ X6))),
% 0.19/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM117B)).
% 0.19/0.39 thf(f226,plain,(
% 0.19/0.39 ~spl3_8),
% 0.19/0.39 inference(avatar_contradiction_clause,[],[f225])).
% 0.19/0.39 thf(f225,plain,(
% 0.19/0.39 $false | ~spl3_8),
% 0.19/0.39 inference(trivial_inequality_removal,[],[f219])).
% 0.19/0.39 thf(f219,plain,(
% 0.19/0.39 ($true != $true) | ~spl3_8),
% 0.19/0.39 inference(superposition,[],[f16,f149])).
% 0.19/0.39 thf(f149,plain,(
% 0.19/0.39 ( ! [X0 : $i] : (((cP @ X0) = $true)) ) | ~spl3_8),
% 0.19/0.39 inference(avatar_component_clause,[],[f148])).
% 0.19/0.39 thf(f16,plain,(
% 0.19/0.39 ($true != (cP @ sK1))),
% 0.19/0.39 inference(cnf_transformation,[],[f13])).
% 0.19/0.39 thf(f215,plain,(
% 0.19/0.39 spl3_16 | spl3_8),
% 0.19/0.39 inference(avatar_split_clause,[],[f209,f148,f212])).
% 0.19/0.39 thf(f209,plain,(
% 0.19/0.39 ( ! [X0 : $i] : (((cP @ X0) = $true) | ($true = (cP @ (sK2 @ (^[Y0 : $i]: (~ (cP @ Y0))))))) )),
% 0.19/0.39 inference(trivial_inequality_removal,[],[f208])).
% 0.19/0.39 thf(f208,plain,(
% 0.19/0.39 ( ! [X0 : $i] : (((cP @ X0) = $true) | ($true = (cP @ (sK2 @ (^[Y0 : $i]: (~ (cP @ Y0)))))) | ($true != $true)) )),
% 0.19/0.39 inference(duplicate_literal_removal,[],[f190])).
% 0.19/0.39 thf(f190,plain,(
% 0.19/0.39 ( ! [X0 : $i] : (((cP @ X0) = $true) | ($true = (cP @ (sK2 @ (^[Y0 : $i]: (~ (cP @ Y0)))))) | ($true != $true) | ($true = (cP @ (sK2 @ (^[Y0 : $i]: (~ (cP @ Y0))))))) )),
% 0.19/0.39 inference(superposition,[],[f18,f88])).
% 0.19/0.39 thf(f88,plain,(
% 0.19/0.39 ( ! [X1 : $i,X4 : $i > $o] : (((X4 @ (sK0 @ (sK2 @ (^[Y0 : $i]: (~ (X4 @ Y0)))))) = $true) | ($true = (cP @ (sK2 @ (^[Y0 : $i]: (~ (X4 @ Y0)))))) | ((X4 @ X1) = $true)) )),
% 0.19/0.39 inference(not_proxy_clausification,[],[f87])).
% 0.19/0.39 thf(f87,plain,(
% 0.19/0.39 ( ! [X1 : $i,X4 : $i > $o] : (((~ (X4 @ X1)) != $true) | ($true = (cP @ (sK2 @ (^[Y0 : $i]: (~ (X4 @ Y0)))))) | ((X4 @ (sK0 @ (sK2 @ (^[Y0 : $i]: (~ (X4 @ Y0)))))) = $true)) )),
% 0.19/0.39 inference(not_proxy_clausification,[],[f86])).
% 0.19/0.39 thf(f86,plain,(
% 0.19/0.39 ( ! [X1 : $i,X4 : $i > $o] : (((~ (X4 @ (sK0 @ (sK2 @ (^[Y0 : $i]: (~ (X4 @ Y0))))))) != $true) | ((~ (X4 @ X1)) != $true) | ($true = (cP @ (sK2 @ (^[Y0 : $i]: (~ (X4 @ Y0))))))) )),
% 0.19/0.39 inference(beta_eta_normalization,[],[f78])).
% 0.19/0.39 thf(f78,plain,(
% 0.19/0.39 ( ! [X1 : $i,X4 : $i > $o] : (($true = (cP @ (sK2 @ (^[Y0 : $i]: (~ (X4 @ Y0)))))) | (((^[Y0 : $i]: (~ (X4 @ Y0))) @ X1) != $true) | ($true != ((^[Y0 : $i]: (~ (X4 @ Y0))) @ (sK0 @ (sK2 @ (^[Y0 : $i]: (~ (X4 @ Y0)))))))) )),
% 0.19/0.39 inference(primitive_instantiation,[],[f35])).
% 0.19/0.39 thf(f35,plain,(
% 0.19/0.39 ( ! [X0 : $i > $o,X1 : $i] : (((X0 @ (sK0 @ (sK2 @ X0))) != $true) | ((X0 @ X1) != $true) | ((cP @ (sK2 @ X0)) = $true)) )),
% 0.19/0.39 inference(trivial_inequality_removal,[],[f33])).
% 0.19/0.39 thf(f33,plain,(
% 0.19/0.39 ( ! [X0 : $i > $o,X1 : $i] : (((X0 @ (sK0 @ (sK2 @ X0))) != $true) | ((X0 @ X1) != $true) | ($true != $true) | ((cP @ (sK2 @ X0)) = $true)) )),
% 0.19/0.39 inference(superposition,[],[f14,f19])).
% 0.19/0.39 thf(f19,plain,(
% 0.19/0.39 ( ! [X0 : $i] : (($true = (cR @ X0 @ (sK0 @ X0))) | ((cP @ X0) = $true)) )),
% 0.19/0.39 inference(cnf_transformation,[],[f13])).
% 0.19/0.39 thf(f14,plain,(
% 0.19/0.39 ( ! [X3 : $i > $o,X6 : $i,X4 : $i] : (($true != (cR @ (sK2 @ X3) @ X6)) | ((X3 @ X4) != $true) | ($true != (X3 @ X6))) )),
% 0.19/0.39 inference(cnf_transformation,[],[f13])).
% 0.19/0.39 thf(f18,plain,(
% 0.19/0.39 ( ! [X0 : $i] : (($true != (cP @ (sK0 @ X0))) | ((cP @ X0) = $true)) )),
% 0.19/0.39 inference(cnf_transformation,[],[f13])).
% 0.19/0.39 % SZS output end Proof for theBenchmark
% 0.19/0.39 % (21117)------------------------------
% 0.19/0.39 % (21117)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.39 % (21117)Termination reason: Refutation
% 0.19/0.39
% 0.19/0.39 % (21117)Memory used [KB]: 5756
% 0.19/0.39 % (21117)Time elapsed: 0.023 s
% 0.19/0.39 % (21117)Instructions burned: 27 (million)
% 0.19/0.39 % (21117)------------------------------
% 0.19/0.39 % (21117)------------------------------
% 0.19/0.39 % (21111)Success in time 0.034 s
%------------------------------------------------------------------------------