TSTP Solution File: SYO224^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO224^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n003.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 : Tue May 21 09:03:33 EDT 2024
% Result : Theorem 0.20s 0.39s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO224^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 09:20:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_NAR problem
% 0.13/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.37 % (9460)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.20/0.37 % (9464)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.20/0.37 % (9463)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.20/0.37 % (9459)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.20/0.37 % (9465)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.20/0.37 % (9463)Instruction limit reached!
% 0.20/0.37 % (9463)------------------------------
% 0.20/0.37 % (9463)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (9463)Termination reason: Unknown
% 0.20/0.37 % (9463)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (9463)Memory used [KB]: 895
% 0.20/0.37 % (9463)Time elapsed: 0.003 s
% 0.20/0.37 % (9463)Instructions burned: 2 (million)
% 0.20/0.37 % (9463)------------------------------
% 0.20/0.37 % (9463)------------------------------
% 0.20/0.37 % (9462)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.37 % (9460)Instruction limit reached!
% 0.20/0.37 % (9460)------------------------------
% 0.20/0.37 % (9460)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (9460)Termination reason: Unknown
% 0.20/0.37 % (9460)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (9460)Memory used [KB]: 5500
% 0.20/0.37 % (9460)Time elapsed: 0.005 s
% 0.20/0.37 % (9460)Instructions burned: 4 (million)
% 0.20/0.37 % (9460)------------------------------
% 0.20/0.37 % (9460)------------------------------
% 0.20/0.37 % (9462)Instruction limit reached!
% 0.20/0.37 % (9462)------------------------------
% 0.20/0.37 % (9462)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (9462)Termination reason: Unknown
% 0.20/0.37 % (9462)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (9462)Memory used [KB]: 5373
% 0.20/0.37 % (9462)Time elapsed: 0.003 s
% 0.20/0.37 % (9462)Instructions burned: 2 (million)
% 0.20/0.37 % (9462)------------------------------
% 0.20/0.37 % (9462)------------------------------
% 0.20/0.37 % (9466)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.20/0.37 % (9466)Instruction limit reached!
% 0.20/0.37 % (9466)------------------------------
% 0.20/0.37 % (9466)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (9466)Termination reason: Unknown
% 0.20/0.37 % (9466)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.38 % (9466)Memory used [KB]: 5500
% 0.20/0.38 % (9466)Time elapsed: 0.004 s
% 0.20/0.38 % (9466)Instructions burned: 3 (million)
% 0.20/0.38 % (9466)------------------------------
% 0.20/0.38 % (9466)------------------------------
% 0.20/0.38 % (9461)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.20/0.38 % (9465)Instruction limit reached!
% 0.20/0.38 % (9465)------------------------------
% 0.20/0.38 % (9465)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (9464)First to succeed.
% 0.20/0.38 % (9465)Termination reason: Unknown
% 0.20/0.38 % (9465)Termination phase: Saturation
% 0.20/0.38 % (9461)Refutation not found, incomplete strategy
% 0.20/0.38 % (9461)------------------------------
% 0.20/0.38 % (9461)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (9461)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 % (9461)Memory used [KB]: 5500
% 0.20/0.38 % (9461)Time elapsed: 0.006 s
% 0.20/0.38 % (9461)Instructions burned: 5 (million)
% 0.20/0.38 % (9461)------------------------------
% 0.20/0.38 % (9461)------------------------------
% 0.20/0.38
% 0.20/0.38 % (9465)Memory used [KB]: 5628
% 0.20/0.38 % (9465)Time elapsed: 0.015 s
% 0.20/0.38 % (9465)Instructions burned: 19 (million)
% 0.20/0.38 % (9465)------------------------------
% 0.20/0.38 % (9465)------------------------------
% 0.20/0.39 % (9464)Refutation found. Thanks to Tanya!
% 0.20/0.39 % SZS status Theorem for theBenchmark
% 0.20/0.39 % SZS output start Proof for theBenchmark
% 0.20/0.39 thf(func_def_1, type, cLIKE: $i > $i > $o).
% 0.20/0.39 thf(func_def_2, type, cWRH: $i > $o).
% 0.20/0.39 thf(func_def_3, type, cW: $i > $o).
% 0.20/0.39 thf(func_def_4, type, cUNIQUE: $i > $o).
% 0.20/0.39 thf(func_def_13, type, ph2: !>[X0: $tType]:(X0)).
% 0.20/0.39 thf(f312,plain,(
% 0.20/0.39 $false),
% 0.20/0.39 inference(avatar_sat_refutation,[],[f41,f49,f66,f67,f72,f73,f78,f79,f82,f186,f208,f231,f267,f281])).
% 0.20/0.39 thf(f281,plain,(
% 0.20/0.39 ~spl1_7),
% 0.20/0.39 inference(avatar_contradiction_clause,[],[f280])).
% 0.20/0.39 thf(f280,plain,(
% 0.20/0.39 $false | ~spl1_7),
% 0.20/0.39 inference(trivial_inequality_removal,[],[f279])).
% 0.20/0.39 thf(f279,plain,(
% 0.20/0.39 ($false = $true) | ~spl1_7),
% 0.20/0.39 inference(duplicate_literal_removal,[],[f278])).
% 0.20/0.39 thf(f278,plain,(
% 0.20/0.39 ($false = $true) | ($false = $true) | ~spl1_7),
% 0.20/0.39 inference(beta_eta_normalization,[],[f272])).
% 0.20/0.39 thf(f272,plain,(
% 0.20/0.39 (((^[Y0 : $i]: ($false)) @ cP) = $true) | (((^[Y0 : $i]: ($false)) @ cJ) = $true) | ~spl1_7),
% 0.20/0.39 inference(primitive_instantiation,[],[f56])).
% 0.20/0.39 thf(f56,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o] : (((X2 @ cP) = $true) | ((X2 @ cJ) = $true)) ) | ~spl1_7),
% 0.20/0.39 inference(avatar_component_clause,[],[f55])).
% 0.20/0.39 thf(f55,plain,(
% 0.20/0.39 spl1_7 <=> ! [X2 : $i > $o] : (((X2 @ cJ) = $true) | ((X2 @ cP) = $true))),
% 0.20/0.39 introduced(avatar_definition,[new_symbols(naming,[spl1_7])])).
% 0.20/0.39 thf(f267,plain,(
% 0.20/0.39 ~spl1_1 | ~spl1_9 | ~spl1_10 | ~spl1_11),
% 0.20/0.39 inference(avatar_contradiction_clause,[],[f266])).
% 0.20/0.39 thf(f266,plain,(
% 0.20/0.39 $false | (~spl1_1 | ~spl1_9 | ~spl1_10 | ~spl1_11)),
% 0.20/0.39 inference(subsumption_resolution,[],[f265,f19])).
% 0.20/0.39 thf(f19,plain,(
% 0.20/0.39 ((cUNIQUE @ cS) = $true)),
% 0.20/0.39 inference(cnf_transformation,[],[f11])).
% 0.20/0.39 thf(f11,plain,(
% 0.20/0.39 ! [X0] : (((cUNIQUE @ X0) != $true) | ! [X1] : (((cWRH @ X1) != $true) | ((cW @ X1) != $true) | (X0 = X1))) & ((cUNIQUE @ cS) = $true) & ((cW @ cS) = $true) & ((cWRH @ cS) = $true) & ! [X2 : $i > $o] : (((X2 @ cP) != (cLIKE @ cP @ cS)) | ((! [X3] : (((cW @ X3) != $true) | ((cLIKE @ cJ @ X3) != $true) | ((cUNIQUE @ X3) != $true) | ($true != (cWRH @ X3))) | ((X2 @ cJ) != $true)) & ((((cW @ sK0) = $true) & ($true = (cLIKE @ cJ @ sK0)) & ((cUNIQUE @ sK0) = $true) & ($true = (cWRH @ sK0))) | ((X2 @ cJ) = $true))))),
% 0.20/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10])).
% 0.20/0.39 thf(f10,plain,(
% 0.20/0.39 ? [X4] : (((cW @ X4) = $true) & ((cLIKE @ cJ @ X4) = $true) & ((cUNIQUE @ X4) = $true) & ((cWRH @ X4) = $true)) => (((cW @ sK0) = $true) & ($true = (cLIKE @ cJ @ sK0)) & ((cUNIQUE @ sK0) = $true) & ($true = (cWRH @ sK0)))),
% 0.20/0.39 introduced(choice_axiom,[])).
% 0.20/0.39 thf(f9,plain,(
% 0.20/0.39 ! [X0] : (((cUNIQUE @ X0) != $true) | ! [X1] : (((cWRH @ X1) != $true) | ((cW @ X1) != $true) | (X0 = X1))) & ((cUNIQUE @ cS) = $true) & ((cW @ cS) = $true) & ((cWRH @ cS) = $true) & ! [X2 : $i > $o] : (((X2 @ cP) != (cLIKE @ cP @ cS)) | ((! [X3] : (((cW @ X3) != $true) | ((cLIKE @ cJ @ X3) != $true) | ((cUNIQUE @ X3) != $true) | ($true != (cWRH @ X3))) | ((X2 @ cJ) != $true)) & (? [X4] : (((cW @ X4) = $true) & ((cLIKE @ cJ @ X4) = $true) & ((cUNIQUE @ X4) = $true) & ((cWRH @ X4) = $true)) | ((X2 @ cJ) = $true))))),
% 0.20/0.39 inference(rectify,[],[f8])).
% 0.20/0.39 thf(f8,plain,(
% 0.20/0.39 ! [X0] : (((cUNIQUE @ X0) != $true) | ! [X1] : (((cWRH @ X1) != $true) | ((cW @ X1) != $true) | (X0 = X1))) & ((cUNIQUE @ cS) = $true) & ((cW @ cS) = $true) & ((cWRH @ cS) = $true) & ! [X2 : $i > $o] : (((X2 @ cP) != (cLIKE @ cP @ cS)) | ((! [X3] : (((cW @ X3) != $true) | ((cLIKE @ cJ @ X3) != $true) | ((cUNIQUE @ X3) != $true) | ($true != (cWRH @ X3))) | ((X2 @ cJ) != $true)) & (? [X3] : (((cW @ X3) = $true) & ((cLIKE @ cJ @ X3) = $true) & ((cUNIQUE @ X3) = $true) & ($true = (cWRH @ X3))) | ((X2 @ cJ) = $true))))),
% 0.20/0.39 inference(nnf_transformation,[],[f7])).
% 0.20/0.39 thf(f7,plain,(
% 0.20/0.39 ! [X0] : (((cUNIQUE @ X0) != $true) | ! [X1] : (((cWRH @ X1) != $true) | ((cW @ X1) != $true) | (X0 = X1))) & ((cUNIQUE @ cS) = $true) & ((cW @ cS) = $true) & ((cWRH @ cS) = $true) & ! [X2 : $i > $o] : (((X2 @ cP) != (cLIKE @ cP @ cS)) | (((X2 @ cJ) = $true) <~> ? [X3] : (((cW @ X3) = $true) & ((cLIKE @ cJ @ X3) = $true) & ((cUNIQUE @ X3) = $true) & ($true = (cWRH @ X3)))))),
% 0.20/0.39 inference(flattening,[],[f6])).
% 0.20/0.39 thf(f6,plain,(
% 0.20/0.39 ! [X2 : $i > $o] : (((X2 @ cP) != (cLIKE @ cP @ cS)) | (((X2 @ cJ) = $true) <~> ? [X3] : (((cW @ X3) = $true) & ((cLIKE @ cJ @ X3) = $true) & ((cUNIQUE @ X3) = $true) & ($true = (cWRH @ X3))))) & (((cWRH @ cS) = $true) & ! [X0] : (! [X1] : ((X0 = X1) | (((cW @ X1) != $true) | ((cWRH @ X1) != $true))) | ((cUNIQUE @ X0) != $true)) & ((cW @ cS) = $true) & ((cUNIQUE @ cS) = $true))),
% 0.20/0.39 inference(ennf_transformation,[],[f5])).
% 0.20/0.39 thf(f5,plain,(
% 0.20/0.39 ~((((cWRH @ cS) = $true) & ! [X0] : (((cUNIQUE @ X0) = $true) => ! [X1] : ((((cW @ X1) = $true) & ((cWRH @ X1) = $true)) => (X0 = X1))) & ((cW @ cS) = $true) & ((cUNIQUE @ cS) = $true)) => ? [X2 : $i > $o] : ((? [X3] : (((cW @ X3) = $true) & ((cLIKE @ cJ @ X3) = $true) & ((cUNIQUE @ X3) = $true) & ($true = (cWRH @ X3))) <=> ((X2 @ cJ) = $true)) & ((X2 @ cP) = (cLIKE @ cP @ cS))))),
% 0.20/0.39 inference(fool_elimination,[],[f4])).
% 0.20/0.39 thf(f4,plain,(
% 0.20/0.39 ~((! [X0] : ((cUNIQUE @ X0) => ! [X1] : (((cWRH @ X1) & (cW @ X1)) => (X0 = X1))) & (cW @ cS) & (cUNIQUE @ cS) & (cWRH @ cS)) => ? [X2 : $i > $o] : (((X2 @ cP) = (cLIKE @ cP @ cS)) & (? [X3] : ((cUNIQUE @ X3) & (cWRH @ X3) & (cLIKE @ cJ @ X3) & (cW @ X3)) = (X2 @ cJ))))),
% 0.20/0.39 inference(rectify,[],[f2])).
% 0.20/0.39 thf(f2,negated_conjecture,(
% 0.20/0.39 ~((! [X0] : ((cUNIQUE @ X0) => ! [X1] : (((cWRH @ X1) & (cW @ X1)) => (X0 = X1))) & (cW @ cS) & (cUNIQUE @ cS) & (cWRH @ cS)) => ? [X2 : $i > $o] : (((X2 @ cP) = (cLIKE @ cP @ cS)) & (? [X0] : ((cUNIQUE @ X0) & (cWRH @ X0) & (cLIKE @ cJ @ X0) & (cW @ X0)) = (X2 @ cJ))))),
% 0.20/0.39 inference(negated_conjecture,[],[f1])).
% 0.20/0.39 thf(f1,conjecture,(
% 0.20/0.39 (! [X0] : ((cUNIQUE @ X0) => ! [X1] : (((cWRH @ X1) & (cW @ X1)) => (X0 = X1))) & (cW @ cS) & (cUNIQUE @ cS) & (cWRH @ cS)) => ? [X2 : $i > $o] : (((X2 @ cP) = (cLIKE @ cP @ cS)) & (? [X0] : ((cUNIQUE @ X0) & (cWRH @ X0) & (cLIKE @ cJ @ X0) & (cW @ X0)) = (X2 @ cJ)))),
% 0.20/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cLING1)).
% 0.20/0.39 thf(f265,plain,(
% 0.20/0.39 ((cUNIQUE @ cS) != $true) | (~spl1_1 | ~spl1_9 | ~spl1_10 | ~spl1_11)),
% 0.20/0.39 inference(forward_demodulation,[],[f264,f253])).
% 0.20/0.39 thf(f253,plain,(
% 0.20/0.39 (cS = sK0) | (~spl1_9 | ~spl1_10)),
% 0.20/0.39 inference(subsumption_resolution,[],[f252,f65])).
% 0.20/0.39 thf(f65,plain,(
% 0.20/0.39 ($true = (cWRH @ sK0)) | ~spl1_9),
% 0.20/0.39 inference(avatar_component_clause,[],[f63])).
% 0.20/0.39 thf(f63,plain,(
% 0.20/0.39 spl1_9 <=> ($true = (cWRH @ sK0))),
% 0.20/0.39 introduced(avatar_definition,[new_symbols(naming,[spl1_9])])).
% 0.20/0.39 thf(f252,plain,(
% 0.20/0.39 (cS = sK0) | ($true != (cWRH @ sK0)) | ~spl1_10),
% 0.20/0.39 inference(trivial_inequality_removal,[],[f251])).
% 0.20/0.39 thf(f251,plain,(
% 0.20/0.39 ($true != (cWRH @ sK0)) | (cS = sK0) | ($true != $true) | ~spl1_10),
% 0.20/0.39 inference(superposition,[],[f85,f71])).
% 0.20/0.39 thf(f71,plain,(
% 0.20/0.39 ((cW @ sK0) = $true) | ~spl1_10),
% 0.20/0.39 inference(avatar_component_clause,[],[f69])).
% 0.20/0.39 thf(f69,plain,(
% 0.20/0.39 spl1_10 <=> ((cW @ sK0) = $true)),
% 0.20/0.39 introduced(avatar_definition,[new_symbols(naming,[spl1_10])])).
% 0.20/0.39 thf(f85,plain,(
% 0.20/0.39 ( ! [X0 : $i] : (((cW @ X0) != $true) | ((cWRH @ X0) != $true) | (cS = X0)) )),
% 0.20/0.39 inference(trivial_inequality_removal,[],[f84])).
% 0.20/0.39 thf(f84,plain,(
% 0.20/0.39 ( ! [X0 : $i] : (((cWRH @ X0) != $true) | ($true != $true) | ((cW @ X0) != $true) | (cS = X0)) )),
% 0.20/0.39 inference(superposition,[],[f20,f19])).
% 0.20/0.39 thf(f20,plain,(
% 0.20/0.39 ( ! [X0 : $i,X1 : $i] : (((cUNIQUE @ X0) != $true) | ((cWRH @ X1) != $true) | ((cW @ X1) != $true) | (X0 = X1)) )),
% 0.20/0.39 inference(cnf_transformation,[],[f11])).
% 0.20/0.39 thf(f264,plain,(
% 0.20/0.39 ((cUNIQUE @ sK0) != $true) | (~spl1_1 | ~spl1_9 | ~spl1_10 | ~spl1_11)),
% 0.20/0.39 inference(subsumption_resolution,[],[f260,f71])).
% 0.20/0.39 thf(f260,plain,(
% 0.20/0.39 ((cW @ sK0) != $true) | ((cUNIQUE @ sK0) != $true) | (~spl1_1 | ~spl1_9 | ~spl1_11)),
% 0.20/0.39 inference(subsumption_resolution,[],[f259,f65])).
% 0.20/0.39 thf(f259,plain,(
% 0.20/0.39 ($true != (cWRH @ sK0)) | ((cUNIQUE @ sK0) != $true) | ((cW @ sK0) != $true) | (~spl1_1 | ~spl1_11)),
% 0.20/0.39 inference(trivial_inequality_removal,[],[f258])).
% 0.20/0.39 thf(f258,plain,(
% 0.20/0.39 ((cW @ sK0) != $true) | ($true != (cWRH @ sK0)) | ((cUNIQUE @ sK0) != $true) | ($true != $true) | (~spl1_1 | ~spl1_11)),
% 0.20/0.39 inference(superposition,[],[f33,f77])).
% 0.20/0.39 thf(f77,plain,(
% 0.20/0.39 ($true = (cLIKE @ cJ @ sK0)) | ~spl1_11),
% 0.20/0.39 inference(avatar_component_clause,[],[f75])).
% 0.20/0.39 thf(f75,plain,(
% 0.20/0.39 spl1_11 <=> ($true = (cLIKE @ cJ @ sK0))),
% 0.20/0.39 introduced(avatar_definition,[new_symbols(naming,[spl1_11])])).
% 0.20/0.39 thf(f33,plain,(
% 0.20/0.39 ( ! [X3 : $i] : (((cLIKE @ cJ @ X3) != $true) | ($true != (cWRH @ X3)) | ((cUNIQUE @ X3) != $true) | ((cW @ X3) != $true)) ) | ~spl1_1),
% 0.20/0.39 inference(avatar_component_clause,[],[f32])).
% 0.20/0.39 thf(f32,plain,(
% 0.20/0.39 spl1_1 <=> ! [X3] : (((cW @ X3) != $true) | ((cLIKE @ cJ @ X3) != $true) | ((cUNIQUE @ X3) != $true) | ($true != (cWRH @ X3)))),
% 0.20/0.39 introduced(avatar_definition,[new_symbols(naming,[spl1_1])])).
% 0.20/0.39 thf(f231,plain,(
% 0.20/0.39 spl1_2 | ~spl1_3 | ~spl1_9 | ~spl1_10 | ~spl1_11),
% 0.20/0.39 inference(avatar_contradiction_clause,[],[f230])).
% 0.20/0.39 thf(f230,plain,(
% 0.20/0.39 $false | (spl1_2 | ~spl1_3 | ~spl1_9 | ~spl1_10 | ~spl1_11)),
% 0.20/0.39 inference(subsumption_resolution,[],[f229,f192])).
% 0.20/0.39 thf(f192,plain,(
% 0.20/0.39 ($true = (cLIKE @ cJ @ cS)) | (~spl1_9 | ~spl1_10 | ~spl1_11)),
% 0.20/0.39 inference(superposition,[],[f77,f191])).
% 0.20/0.39 thf(f191,plain,(
% 0.20/0.39 (cS = sK0) | (~spl1_9 | ~spl1_10)),
% 0.20/0.39 inference(subsumption_resolution,[],[f190,f65])).
% 0.20/0.39 thf(f190,plain,(
% 0.20/0.39 (cS = sK0) | ($true != (cWRH @ sK0)) | ~spl1_10),
% 0.20/0.39 inference(trivial_inequality_removal,[],[f189])).
% 0.20/0.39 thf(f189,plain,(
% 0.20/0.39 ($true != $true) | ($true != (cWRH @ sK0)) | (cS = sK0) | ~spl1_10),
% 0.20/0.39 inference(superposition,[],[f85,f71])).
% 0.20/0.39 thf(f229,plain,(
% 0.20/0.39 ($true != (cLIKE @ cJ @ cS)) | (spl1_2 | ~spl1_3)),
% 0.20/0.39 inference(superposition,[],[f36,f210])).
% 0.20/0.39 thf(f210,plain,(
% 0.20/0.39 (cP = cJ) | ~spl1_3),
% 0.20/0.39 inference(leibniz_equality_elimination,[],[f40])).
% 0.20/0.39 thf(f40,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o] : (((X2 @ cP) = $true) | ((X2 @ cJ) != $true)) ) | ~spl1_3),
% 0.20/0.39 inference(avatar_component_clause,[],[f39])).
% 0.20/0.39 thf(f39,plain,(
% 0.20/0.39 spl1_3 <=> ! [X2 : $i > $o] : (((X2 @ cJ) != $true) | ((X2 @ cP) = $true))),
% 0.20/0.39 introduced(avatar_definition,[new_symbols(naming,[spl1_3])])).
% 0.20/0.39 thf(f36,plain,(
% 0.20/0.39 ((cLIKE @ cP @ cS) != $true) | spl1_2),
% 0.20/0.39 inference(avatar_component_clause,[],[f35])).
% 0.20/0.39 thf(f35,plain,(
% 0.20/0.39 spl1_2 <=> ((cLIKE @ cP @ cS) = $true)),
% 0.20/0.39 introduced(avatar_definition,[new_symbols(naming,[spl1_2])])).
% 0.20/0.39 thf(f208,plain,(
% 0.20/0.39 spl1_7 | ~spl1_4),
% 0.20/0.39 inference(avatar_split_clause,[],[f207,f43,f55])).
% 0.20/0.39 thf(f43,plain,(
% 0.20/0.39 spl1_4 <=> ! [X2 : $i > $o] : (((X2 @ cJ) != $true) | ((X2 @ cP) = $false))),
% 0.20/0.39 introduced(avatar_definition,[new_symbols(naming,[spl1_4])])).
% 0.20/0.39 thf(f207,plain,(
% 0.20/0.39 ( ! [X5 : $i > $o] : (((X5 @ cP) = $true) | ($true = (X5 @ cJ))) ) | ~spl1_4),
% 0.20/0.39 inference(not_proxy_clausification,[],[f206])).
% 0.20/0.39 thf(f206,plain,(
% 0.20/0.39 ( ! [X5 : $i > $o] : (($true != (~ (X5 @ cJ))) | ((X5 @ cP) = $true)) ) | ~spl1_4),
% 0.20/0.39 inference(not_proxy_clausification,[],[f205])).
% 0.20/0.39 thf(f205,plain,(
% 0.20/0.39 ( ! [X5 : $i > $o] : (($false = (~ (X5 @ cP))) | ($true != (~ (X5 @ cJ)))) ) | ~spl1_4),
% 0.20/0.39 inference(beta_eta_normalization,[],[f198])).
% 0.20/0.39 thf(f198,plain,(
% 0.20/0.39 ( ! [X5 : $i > $o] : ((((^[Y0 : $i]: (~ (X5 @ Y0))) @ cP) = $false) | ($true != ((^[Y0 : $i]: (~ (X5 @ Y0))) @ cJ))) ) | ~spl1_4),
% 0.20/0.39 inference(primitive_instantiation,[],[f44])).
% 0.20/0.39 thf(f44,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o] : (((X2 @ cP) = $false) | ((X2 @ cJ) != $true)) ) | ~spl1_4),
% 0.20/0.39 inference(avatar_component_clause,[],[f43])).
% 0.20/0.39 thf(f186,plain,(
% 0.20/0.39 ~spl1_1 | ~spl1_2 | ~spl1_8),
% 0.20/0.39 inference(avatar_contradiction_clause,[],[f185])).
% 0.20/0.39 thf(f185,plain,(
% 0.20/0.39 $false | (~spl1_1 | ~spl1_2 | ~spl1_8)),
% 0.20/0.39 inference(subsumption_resolution,[],[f184,f18])).
% 0.20/0.39 thf(f18,plain,(
% 0.20/0.39 ((cW @ cS) = $true)),
% 0.20/0.39 inference(cnf_transformation,[],[f11])).
% 0.20/0.39 thf(f184,plain,(
% 0.20/0.39 ((cW @ cS) != $true) | (~spl1_1 | ~spl1_2 | ~spl1_8)),
% 0.20/0.39 inference(subsumption_resolution,[],[f183,f17])).
% 0.20/0.39 thf(f17,plain,(
% 0.20/0.39 ((cWRH @ cS) = $true)),
% 0.20/0.39 inference(cnf_transformation,[],[f11])).
% 0.20/0.39 thf(f183,plain,(
% 0.20/0.39 ((cWRH @ cS) != $true) | ((cW @ cS) != $true) | (~spl1_1 | ~spl1_2 | ~spl1_8)),
% 0.20/0.39 inference(subsumption_resolution,[],[f182,f19])).
% 0.20/0.39 thf(f182,plain,(
% 0.20/0.39 ((cUNIQUE @ cS) != $true) | ((cWRH @ cS) != $true) | ((cW @ cS) != $true) | (~spl1_1 | ~spl1_2 | ~spl1_8)),
% 0.20/0.39 inference(trivial_inequality_removal,[],[f181])).
% 0.20/0.39 thf(f181,plain,(
% 0.20/0.39 ((cW @ cS) != $true) | ((cUNIQUE @ cS) != $true) | ((cWRH @ cS) != $true) | ($true != $true) | (~spl1_1 | ~spl1_2 | ~spl1_8)),
% 0.20/0.39 inference(superposition,[],[f33,f125])).
% 0.20/0.39 thf(f125,plain,(
% 0.20/0.39 ($true = (cLIKE @ cJ @ cS)) | (~spl1_2 | ~spl1_8)),
% 0.20/0.39 inference(superposition,[],[f37,f109])).
% 0.20/0.39 thf(f109,plain,(
% 0.20/0.39 (cP = cJ) | ~spl1_8),
% 0.20/0.39 inference(leibniz_equality_elimination,[],[f60])).
% 0.20/0.39 thf(f60,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o] : (((X2 @ cP) = $false) | ((X2 @ cJ) = $true)) ) | ~spl1_8),
% 0.20/0.39 inference(avatar_component_clause,[],[f59])).
% 0.20/0.39 thf(f59,plain,(
% 0.20/0.39 spl1_8 <=> ! [X2 : $i > $o] : (((X2 @ cP) = $false) | ((X2 @ cJ) = $true))),
% 0.20/0.39 introduced(avatar_definition,[new_symbols(naming,[spl1_8])])).
% 0.20/0.39 thf(f37,plain,(
% 0.20/0.39 ((cLIKE @ cP @ cS) = $true) | ~spl1_2),
% 0.20/0.39 inference(avatar_component_clause,[],[f35])).
% 0.20/0.39 thf(f82,plain,(
% 0.20/0.39 ~spl1_2 | ~spl1_5),
% 0.20/0.39 inference(avatar_contradiction_clause,[],[f81])).
% 0.20/0.39 thf(f81,plain,(
% 0.20/0.39 $false | (~spl1_2 | ~spl1_5)),
% 0.20/0.39 inference(trivial_inequality_removal,[],[f80])).
% 0.20/0.39 thf(f80,plain,(
% 0.20/0.39 ($false = $true) | (~spl1_2 | ~spl1_5)),
% 0.20/0.39 inference(forward_demodulation,[],[f37,f48])).
% 0.20/0.39 thf(f48,plain,(
% 0.20/0.39 ((cLIKE @ cP @ cS) = $false) | ~spl1_5),
% 0.20/0.39 inference(avatar_component_clause,[],[f46])).
% 0.20/0.39 thf(f46,plain,(
% 0.20/0.39 spl1_5 <=> ((cLIKE @ cP @ cS) = $false)),
% 0.20/0.39 introduced(avatar_definition,[new_symbols(naming,[spl1_5])])).
% 0.20/0.39 thf(f79,plain,(
% 0.20/0.39 spl1_11 | spl1_8 | spl1_5),
% 0.20/0.39 inference(avatar_split_clause,[],[f22,f46,f59,f75])).
% 0.20/0.39 thf(f22,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o] : (((X2 @ cP) = $false) | ((cLIKE @ cP @ cS) = $false) | ($true = (cLIKE @ cJ @ sK0)) | ((X2 @ cJ) = $true)) )),
% 0.20/0.39 inference(binary_proxy_clausification,[],[f14])).
% 0.20/0.39 thf(f14,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o] : (((X2 @ cJ) = $true) | ((X2 @ cP) != (cLIKE @ cP @ cS)) | ($true = (cLIKE @ cJ @ sK0))) )),
% 0.20/0.39 inference(cnf_transformation,[],[f11])).
% 0.20/0.39 thf(f78,plain,(
% 0.20/0.39 spl1_2 | spl1_7 | spl1_11),
% 0.20/0.39 inference(avatar_split_clause,[],[f21,f75,f55,f35])).
% 0.20/0.39 thf(f21,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o] : (((X2 @ cP) = $true) | ((cLIKE @ cP @ cS) = $true) | ($true = (cLIKE @ cJ @ sK0)) | ((X2 @ cJ) = $true)) )),
% 0.20/0.39 inference(binary_proxy_clausification,[],[f14])).
% 0.20/0.39 thf(f73,plain,(
% 0.20/0.39 spl1_8 | spl1_10 | spl1_5),
% 0.20/0.39 inference(avatar_split_clause,[],[f24,f46,f69,f59])).
% 0.20/0.39 thf(f24,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o] : (((X2 @ cP) = $false) | ((X2 @ cJ) = $true) | ((cLIKE @ cP @ cS) = $false) | ((cW @ sK0) = $true)) )),
% 0.20/0.39 inference(binary_proxy_clausification,[],[f15])).
% 0.20/0.39 thf(f15,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o] : (((X2 @ cP) != (cLIKE @ cP @ cS)) | ((cW @ sK0) = $true) | ((X2 @ cJ) = $true)) )),
% 0.20/0.39 inference(cnf_transformation,[],[f11])).
% 0.20/0.39 thf(f72,plain,(
% 0.20/0.39 spl1_2 | spl1_10 | spl1_7),
% 0.20/0.39 inference(avatar_split_clause,[],[f23,f55,f69,f35])).
% 0.20/0.39 thf(f23,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o] : (((cLIKE @ cP @ cS) = $true) | ((X2 @ cP) = $true) | ((X2 @ cJ) = $true) | ((cW @ sK0) = $true)) )),
% 0.20/0.39 inference(binary_proxy_clausification,[],[f15])).
% 0.20/0.39 thf(f67,plain,(
% 0.20/0.39 spl1_9 | spl1_8 | spl1_5),
% 0.20/0.39 inference(avatar_split_clause,[],[f26,f46,f59,f63])).
% 0.20/0.39 thf(f26,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o] : (($true = (cWRH @ sK0)) | ((cLIKE @ cP @ cS) = $false) | ((X2 @ cP) = $false) | ((X2 @ cJ) = $true)) )),
% 0.20/0.39 inference(binary_proxy_clausification,[],[f12])).
% 0.20/0.39 thf(f12,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o] : (((X2 @ cJ) = $true) | ($true = (cWRH @ sK0)) | ((X2 @ cP) != (cLIKE @ cP @ cS))) )),
% 0.20/0.39 inference(cnf_transformation,[],[f11])).
% 0.20/0.39 thf(f66,plain,(
% 0.20/0.39 spl1_7 | spl1_9 | spl1_2),
% 0.20/0.39 inference(avatar_split_clause,[],[f25,f35,f63,f55])).
% 0.20/0.39 thf(f25,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o] : (($true = (cWRH @ sK0)) | ((X2 @ cJ) = $true) | ((cLIKE @ cP @ cS) = $true) | ((X2 @ cP) = $true)) )),
% 0.20/0.39 inference(binary_proxy_clausification,[],[f12])).
% 0.20/0.39 thf(f49,plain,(
% 0.20/0.39 spl1_4 | spl1_1 | spl1_5),
% 0.20/0.39 inference(avatar_split_clause,[],[f30,f46,f32,f43])).
% 0.20/0.39 thf(f30,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o,X3 : $i] : (((cLIKE @ cJ @ X3) != $true) | ($true != (cWRH @ X3)) | ((cUNIQUE @ X3) != $true) | ((cLIKE @ cP @ cS) = $false) | ((X2 @ cJ) != $true) | ((cW @ X3) != $true) | ((X2 @ cP) = $false)) )),
% 0.20/0.39 inference(binary_proxy_clausification,[],[f16])).
% 0.20/0.39 thf(f16,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o,X3 : $i] : (((X2 @ cP) != (cLIKE @ cP @ cS)) | ((X2 @ cJ) != $true) | ((cUNIQUE @ X3) != $true) | ((cLIKE @ cJ @ X3) != $true) | ($true != (cWRH @ X3)) | ((cW @ X3) != $true)) )),
% 0.20/0.39 inference(cnf_transformation,[],[f11])).
% 0.20/0.39 thf(f41,plain,(
% 0.20/0.39 spl1_1 | spl1_2 | spl1_3),
% 0.20/0.39 inference(avatar_split_clause,[],[f29,f39,f35,f32])).
% 0.20/0.39 thf(f29,plain,(
% 0.20/0.39 ( ! [X2 : $i > $o,X3 : $i] : (((cLIKE @ cP @ cS) = $true) | ((X2 @ cJ) != $true) | ((X2 @ cP) = $true) | ((cW @ X3) != $true) | ($true != (cWRH @ X3)) | ((cUNIQUE @ X3) != $true) | ((cLIKE @ cJ @ X3) != $true)) )),
% 0.20/0.39 inference(binary_proxy_clausification,[],[f16])).
% 0.20/0.39 % SZS output end Proof for theBenchmark
% 0.20/0.39 % (9464)------------------------------
% 0.20/0.39 % (9464)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39 % (9464)Termination reason: Refutation
% 0.20/0.39
% 0.20/0.39 % (9464)Memory used [KB]: 5628
% 0.20/0.39 % (9464)Time elapsed: 0.017 s
% 0.20/0.39 % (9464)Instructions burned: 18 (million)
% 0.20/0.39 % (9464)------------------------------
% 0.20/0.39 % (9464)------------------------------
% 0.20/0.39 % (9458)Success in time 0.016 s
% 0.20/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------