TSTP Solution File: SEV299^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV299^5 : TPTP v8.2.0. Bugfixed v6.2.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 : n004.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 04:12:42 EDT 2024
% Result : Theorem 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.15 % Problem : SEV299^5 : TPTP v8.2.0. Bugfixed v6.2.0.
% 0.03/0.16 % 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.38 % Computer : n004.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8042.1875MB
% 0.13/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun May 19 18:55:53 EDT 2024
% 0.13/0.38 % CPUTime :
% 0.13/0.38 This is a TH0_THM_EQU_NAR problem
% 0.13/0.38 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.40 % (11859)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 (3000ds/27Mi)
% 0.20/0.40 % (11857)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.20/0.40 % (11858)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 (3000ds/4Mi)
% 0.20/0.40 % (11860)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.40 % (11861)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 (3000ds/2Mi)
% 0.20/0.40 % (11862)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 (3000ds/275Mi)
% 0.20/0.40 % (11863)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.20/0.40 % (11864)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.20/0.40 % (11860)Instruction limit reached!
% 0.20/0.40 % (11860)------------------------------
% 0.20/0.40 % (11860)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (11860)Termination reason: Unknown
% 0.20/0.40 % (11860)Termination phase: Property scanning
% 0.20/0.40
% 0.20/0.40 % (11861)Instruction limit reached!
% 0.20/0.40 % (11861)------------------------------
% 0.20/0.40 % (11861)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (11860)Memory used [KB]: 1023
% 0.20/0.40 % (11860)Time elapsed: 0.003 s
% 0.20/0.40 % (11860)Instructions burned: 3 (million)
% 0.20/0.40 % (11860)------------------------------
% 0.20/0.40 % (11860)------------------------------
% 0.20/0.40 % (11861)Termination reason: Unknown
% 0.20/0.40 % (11861)Termination phase: Saturation
% 0.20/0.40
% 0.20/0.40 % (11861)Memory used [KB]: 1023
% 0.20/0.40 % (11861)Time elapsed: 0.003 s
% 0.20/0.40 % (11861)Instructions burned: 3 (million)
% 0.20/0.40 % (11861)------------------------------
% 0.20/0.40 % (11861)------------------------------
% 0.20/0.40 % (11862)Refutation not found, incomplete strategy
% 0.20/0.40 % (11862)------------------------------
% 0.20/0.40 % (11862)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (11862)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 % (11862)Memory used [KB]: 5500
% 0.20/0.40 % (11862)Time elapsed: 0.003 s
% 0.20/0.40 % (11862)Instructions burned: 2 (million)
% 0.20/0.40 % (11858)Instruction limit reached!
% 0.20/0.40 % (11858)------------------------------
% 0.20/0.40 % (11858)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (11858)Termination reason: Unknown
% 0.20/0.40 % (11858)Termination phase: Saturation
% 0.20/0.40
% 0.20/0.40 % (11858)Memory used [KB]: 5500
% 0.20/0.40 % (11858)Time elapsed: 0.004 s
% 0.20/0.40 % (11858)Instructions burned: 4 (million)
% 0.20/0.40 % (11858)------------------------------
% 0.20/0.40 % (11858)------------------------------
% 0.20/0.40 % (11862)------------------------------
% 0.20/0.40 % (11862)------------------------------
% 0.20/0.40 % (11864)Instruction limit reached!
% 0.20/0.40 % (11864)------------------------------
% 0.20/0.40 % (11864)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (11864)Termination reason: Unknown
% 0.20/0.40 % (11864)Termination phase: Saturation
% 0.20/0.40
% 0.20/0.40 % (11864)Memory used [KB]: 5500
% 0.20/0.40 % (11864)Time elapsed: 0.004 s
% 0.20/0.40 % (11864)Instructions burned: 3 (million)
% 0.20/0.40 % (11864)------------------------------
% 0.20/0.40 % (11864)------------------------------
% 0.20/0.41 % (11859)First to succeed.
% 0.20/0.41 % (11859)Refutation found. Thanks to Tanya!
% 0.20/0.41 % SZS status Theorem for theBenchmark
% 0.20/0.41 % SZS output start Proof for theBenchmark
% 0.20/0.41 thf(func_def_0, type, cNAT: (($i > $o) > $o) > $o).
% 0.20/0.41 thf(func_def_1, type, cSUCC: (($i > $o) > $o) > ($i > $o) > $o).
% 0.20/0.41 thf(func_def_2, type, cZERO: ($i > $o) > $o).
% 0.20/0.41 thf(func_def_4, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.20/0.41 thf(func_def_17, type, sK0: (($i > $o) > $o) > $o).
% 0.20/0.41 thf(func_def_18, type, sK1: ($i > $o) > $o).
% 0.20/0.41 thf(func_def_20, type, sK3: ((($i > $o) > $o) > $o) > ($i > $o) > $o).
% 0.20/0.41 thf(func_def_21, type, ph4: !>[X0: $tType]:(X0)).
% 0.20/0.41 thf(f91,plain,(
% 0.20/0.41 $false),
% 0.20/0.41 inference(avatar_sat_refutation,[],[f60,f80,f85,f89])).
% 0.20/0.41 thf(f89,plain,(
% 0.20/0.41 ~spl2_3),
% 0.20/0.41 inference(avatar_contradiction_clause,[],[f88])).
% 0.20/0.41 thf(f88,plain,(
% 0.20/0.41 $false | ~spl2_3),
% 0.20/0.41 inference(trivial_inequality_removal,[],[f86])).
% 0.20/0.41 thf(f86,plain,(
% 0.20/0.41 ($true = $false) | ~spl2_3),
% 0.20/0.41 inference(backward_demodulation,[],[f41,f78])).
% 0.20/0.41 thf(f78,plain,(
% 0.20/0.41 ($false = (sK0 @ (^[Y0 : $i > $o]: (~ (?? @ $i @ Y0))))) | ~spl2_3),
% 0.20/0.41 inference(avatar_component_clause,[],[f76])).
% 0.20/0.41 thf(f76,plain,(
% 0.20/0.41 spl2_3 <=> ($false = (sK0 @ (^[Y0 : $i > $o]: (~ (?? @ $i @ Y0)))))),
% 0.20/0.41 introduced(avatar_definition,[new_symbols(naming,[spl2_3])])).
% 0.20/0.41 thf(f41,plain,(
% 0.20/0.41 ($true = (sK0 @ (^[Y0 : $i > $o]: (~ (?? @ $i @ Y0)))))),
% 0.20/0.41 inference(beta_eta_normalization,[],[f28])).
% 0.20/0.41 thf(f28,plain,(
% 0.20/0.41 ($true = (sK0 @ (^[Y0 : $i > $o]: (~ (?? @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))))),
% 0.20/0.41 inference(definition_unfolding,[],[f23,f26])).
% 0.20/0.41 thf(f26,plain,(
% 0.20/0.41 (cZERO = (^[Y0 : $i > $o]: (~ (?? @ $i @ (^[Y1 : $i]: (Y0 @ Y1))))))),
% 0.20/0.41 inference(cnf_transformation,[],[f12])).
% 0.20/0.41 thf(f12,plain,(
% 0.20/0.41 (cZERO = (^[Y0 : $i > $o]: (~ (?? @ $i @ (^[Y1 : $i]: (Y0 @ Y1))))))),
% 0.20/0.41 inference(fool_elimination,[],[f11])).
% 0.20/0.41 thf(f11,plain,(
% 0.20/0.41 (cZERO = (^[X0 : $i > $o] : (~? [X1] : (X0 @ X1))))),
% 0.20/0.41 inference(rectify,[],[f1])).
% 0.20/0.41 thf(f1,axiom,(
% 0.20/0.41 (cZERO = (^[X0 : $i > $o] : (~? [X1] : (X0 @ X1))))),
% 0.20/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cZERO_def)).
% 0.20/0.41 thf(f23,plain,(
% 0.20/0.41 ($true = (sK0 @ cZERO))),
% 0.20/0.41 inference(cnf_transformation,[],[f19])).
% 0.20/0.41 thf(f19,plain,(
% 0.20/0.41 ($true = (sK0 @ cZERO)) & ! [X1 : ($i > $o) > $o] : (($true != (sK0 @ X1)) | ($true = (sK0 @ (cSUCC @ X1)))) & (($true = (cNAT @ sK1)) & ($true != (sK0 @ sK1)))),
% 0.20/0.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f16,f18,f17])).
% 0.20/0.41 thf(f17,plain,(
% 0.20/0.41 ? [X0 : (($i > $o) > $o) > $o] : (((X0 @ cZERO) = $true) & ! [X1 : ($i > $o) > $o] : (((X0 @ X1) != $true) | ((X0 @ (cSUCC @ X1)) = $true)) & ? [X2 : ($i > $o) > $o] : (($true = (cNAT @ X2)) & ((X0 @ X2) != $true))) => (($true = (sK0 @ cZERO)) & ! [X1 : ($i > $o) > $o] : (($true != (sK0 @ X1)) | ($true = (sK0 @ (cSUCC @ X1)))) & ? [X2 : ($i > $o) > $o] : (($true = (cNAT @ X2)) & ($true != (sK0 @ X2))))),
% 0.20/0.41 introduced(choice_axiom,[])).
% 0.20/0.41 thf(f18,plain,(
% 0.20/0.41 ? [X2 : ($i > $o) > $o] : (($true = (cNAT @ X2)) & ($true != (sK0 @ X2))) => (($true = (cNAT @ sK1)) & ($true != (sK0 @ sK1)))),
% 0.20/0.41 introduced(choice_axiom,[])).
% 0.20/0.41 thf(f16,plain,(
% 0.20/0.41 ? [X0 : (($i > $o) > $o) > $o] : (((X0 @ cZERO) = $true) & ! [X1 : ($i > $o) > $o] : (((X0 @ X1) != $true) | ((X0 @ (cSUCC @ X1)) = $true)) & ? [X2 : ($i > $o) > $o] : (($true = (cNAT @ X2)) & ((X0 @ X2) != $true)))),
% 0.20/0.41 inference(flattening,[],[f15])).
% 0.20/0.41 thf(f15,plain,(
% 0.20/0.41 ? [X0 : (($i > $o) > $o) > $o] : (? [X2 : ($i > $o) > $o] : (($true = (cNAT @ X2)) & ((X0 @ X2) != $true)) & (((X0 @ cZERO) = $true) & ! [X1 : ($i > $o) > $o] : (((X0 @ X1) != $true) | ((X0 @ (cSUCC @ X1)) = $true))))),
% 0.20/0.41 inference(ennf_transformation,[],[f14])).
% 0.20/0.41 thf(f14,plain,(
% 0.20/0.41 ~! [X0 : (($i > $o) > $o) > $o] : ((((X0 @ cZERO) = $true) & ! [X1 : ($i > $o) > $o] : (((X0 @ X1) = $true) => ((X0 @ (cSUCC @ X1)) = $true))) => ! [X2 : ($i > $o) > $o] : (($true = (cNAT @ X2)) => ((X0 @ X2) = $true)))),
% 0.20/0.41 inference(fool_elimination,[],[f13])).
% 0.20/0.41 thf(f13,plain,(
% 0.20/0.41 ~! [X0 : (($i > $o) > $o) > $o] : (((X0 @ cZERO) & ! [X1 : ($i > $o) > $o] : ((X0 @ X1) => (X0 @ (cSUCC @ X1)))) => ! [X2 : ($i > $o) > $o] : ((cNAT @ X2) => (X0 @ X2)))),
% 0.20/0.41 inference(rectify,[],[f5])).
% 0.20/0.41 thf(f5,negated_conjecture,(
% 0.20/0.41 ~! [X4 : (($i > $o) > $o) > $o] : (((X4 @ cZERO) & ! [X5 : ($i > $o) > $o] : ((X4 @ X5) => (X4 @ (cSUCC @ X5)))) => ! [X6 : ($i > $o) > $o] : ((cNAT @ X6) => (X4 @ X6)))),
% 0.20/0.41 inference(negated_conjecture,[],[f4])).
% 0.20/0.41 thf(f4,conjecture,(
% 0.20/0.41 ! [X4 : (($i > $o) > $o) > $o] : (((X4 @ cZERO) & ! [X5 : ($i > $o) > $o] : ((X4 @ X5) => (X4 @ (cSUCC @ X5)))) => ! [X6 : ($i > $o) > $o] : ((cNAT @ X6) => (X4 @ X6)))),
% 0.20/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cINDUCTION)).
% 0.20/0.41 thf(f85,plain,(
% 0.20/0.41 ~spl2_1),
% 0.20/0.41 inference(avatar_contradiction_clause,[],[f84])).
% 0.20/0.41 thf(f84,plain,(
% 0.20/0.41 $false | ~spl2_1),
% 0.20/0.41 inference(trivial_inequality_removal,[],[f81])).
% 0.20/0.41 thf(f81,plain,(
% 0.20/0.41 ($true != $true) | ~spl2_1),
% 0.20/0.41 inference(superposition,[],[f20,f54])).
% 0.20/0.41 thf(f54,plain,(
% 0.20/0.41 ($true = (sK0 @ sK1)) | ~spl2_1),
% 0.20/0.41 inference(avatar_component_clause,[],[f52])).
% 0.20/0.41 thf(f52,plain,(
% 0.20/0.41 spl2_1 <=> ($true = (sK0 @ sK1))),
% 0.20/0.41 introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
% 0.20/0.41 thf(f20,plain,(
% 0.20/0.41 ($true != (sK0 @ sK1))),
% 0.20/0.41 inference(cnf_transformation,[],[f19])).
% 0.20/0.41 thf(f80,plain,(
% 0.20/0.41 spl2_3 | spl2_1 | ~spl2_2),
% 0.20/0.41 inference(avatar_split_clause,[],[f73,f56,f52,f76])).
% 0.20/0.41 thf(f56,plain,(
% 0.20/0.41 spl2_2 <=> ($true = (sK0 @ (sK3 @ sK0)))),
% 0.20/0.41 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
% 0.20/0.41 thf(f73,plain,(
% 0.20/0.41 ($false = (sK0 @ (^[Y0 : $i > $o]: (~ (?? @ $i @ Y0))))) | ($true = (sK0 @ sK1)) | ~spl2_2),
% 0.20/0.41 inference(trivial_inequality_removal,[],[f70])).
% 0.20/0.41 thf(f70,plain,(
% 0.20/0.41 ($true = $false) | ($false = (sK0 @ (^[Y0 : $i > $o]: (~ (?? @ $i @ Y0))))) | ($true = (sK0 @ sK1)) | ~spl2_2),
% 0.20/0.41 inference(superposition,[],[f62,f39])).
% 0.20/0.41 thf(f39,plain,(
% 0.20/0.41 ( ! [X1 : (($i > $o) > $o) > $o] : (($false = (X1 @ (^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (sK3 @ X1 @ (^[Y2 : $i]: ((~ (Y1 = Y2)) & (Y0 @ Y2)))))))))) | ($false = (X1 @ (^[Y0 : $i > $o]: (~ (?? @ $i @ Y0))))) | ($true = (X1 @ sK1))) )),
% 0.20/0.41 inference(binary_proxy_clausification,[],[f38])).
% 0.20/0.41 thf(f38,plain,(
% 0.20/0.41 ( ! [X1 : (($i > $o) > $o) > $o] : (($false = ((X1 @ (sK3 @ X1)) => (X1 @ (^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (sK3 @ X1 @ (^[Y2 : $i]: ((~ (Y1 = Y2)) & (Y0 @ Y2))))))))))) | ($false = (X1 @ (^[Y0 : $i > $o]: (~ (?? @ $i @ Y0))))) | ($true = (X1 @ sK1))) )),
% 0.20/0.41 inference(beta_eta_normalization,[],[f37])).
% 0.20/0.41 thf(f37,plain,(
% 0.20/0.41 ( ! [X1 : (($i > $o) > $o) > $o] : (($true = (X1 @ sK1)) | ($false = ((^[Y0 : ($i > $o) > $o]: ((X1 @ Y0) => (X1 @ (^[Y1 : $i > $o]: (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ (^[Y3 : $i]: ((~ (Y2 = Y3)) & (Y1 @ Y3))))))))))) @ (sK3 @ X1))) | ($false = (X1 @ (^[Y0 : $i > $o]: (~ (?? @ $i @ Y0)))))) )),
% 0.20/0.41 inference(sigma_clausification,[],[f36])).
% 0.20/0.41 thf(f36,plain,(
% 0.20/0.41 ( ! [X1 : (($i > $o) > $o) > $o] : (($true = (X1 @ sK1)) | ($false = (!! @ (($i > $o) > $o) @ (^[Y0 : ($i > $o) > $o]: ((X1 @ Y0) => (X1 @ (^[Y1 : $i > $o]: (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ (^[Y3 : $i]: ((~ (Y2 = Y3)) & (Y1 @ Y3))))))))))))) | ($false = (X1 @ (^[Y0 : $i > $o]: (~ (?? @ $i @ Y0)))))) )),
% 0.20/0.41 inference(binary_proxy_clausification,[],[f35])).
% 0.20/0.41 thf(f35,plain,(
% 0.20/0.41 ( ! [X1 : (($i > $o) > $o) > $o] : (($false = ((X1 @ (^[Y0 : $i > $o]: (~ (?? @ $i @ Y0)))) & (!! @ (($i > $o) > $o) @ (^[Y0 : ($i > $o) > $o]: ((X1 @ Y0) => (X1 @ (^[Y1 : $i > $o]: (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ (^[Y3 : $i]: ((~ (Y2 = Y3)) & (Y1 @ Y3)))))))))))))) | ($true = (X1 @ sK1))) )),
% 0.20/0.41 inference(binary_proxy_clausification,[],[f34])).
% 0.20/0.41 thf(f34,plain,(
% 0.20/0.41 ( ! [X1 : (($i > $o) > $o) > $o] : (($true = (((X1 @ (^[Y0 : $i > $o]: (~ (?? @ $i @ Y0)))) & (!! @ (($i > $o) > $o) @ (^[Y0 : ($i > $o) > $o]: ((X1 @ Y0) => (X1 @ (^[Y1 : $i > $o]: (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ (^[Y3 : $i]: ((~ (Y2 = Y3)) & (Y1 @ Y3))))))))))))) => (X1 @ sK1)))) )),
% 0.20/0.41 inference(beta_eta_normalization,[],[f33])).
% 0.20/0.41 thf(f33,plain,(
% 0.20/0.41 ( ! [X1 : (($i > $o) > $o) > $o] : (($true = ((^[Y0 : (($i > $o) > $o) > $o]: (((Y0 @ (^[Y1 : $i > $o]: (~ (?? @ $i @ Y1)))) & (!! @ (($i > $o) > $o) @ (^[Y1 : ($i > $o) > $o]: ((Y0 @ Y1) => (Y0 @ (^[Y2 : $i > $o]: (?? @ $i @ (^[Y3 : $i]: ((Y2 @ Y3) & (Y1 @ (^[Y4 : $i]: ((~ (Y3 = Y4)) & (Y2 @ Y4))))))))))))) => (Y0 @ sK1))) @ X1))) )),
% 0.20/0.41 inference(pi_clausification,[],[f32])).
% 0.20/0.41 thf(f32,plain,(
% 0.20/0.41 ($true = (!! @ ((($i > $o) > $o) > $o) @ (^[Y0 : (($i > $o) > $o) > $o]: (((Y0 @ (^[Y1 : $i > $o]: (~ (?? @ $i @ Y1)))) & (!! @ (($i > $o) > $o) @ (^[Y1 : ($i > $o) > $o]: ((Y0 @ Y1) => (Y0 @ (^[Y2 : $i > $o]: (?? @ $i @ (^[Y3 : $i]: ((Y2 @ Y3) & (Y1 @ (^[Y4 : $i]: ((~ (Y3 = Y4)) & (Y2 @ Y4))))))))))))) => (Y0 @ sK1)))))),
% 0.20/0.41 inference(beta_eta_normalization,[],[f30])).
% 0.20/0.41 thf(f30,plain,(
% 0.20/0.41 ($true = ((^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((Y1 @ (^[Y2 : $i > $o]: (~ (?? @ $i @ (^[Y3 : $i]: (Y2 @ Y3)))))) & (!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ ((^[Y3 : ($i > $o) > $o]: ((^[Y4 : $i > $o]: (?? @ $i @ (^[Y5 : $i]: ((Y4 @ Y5) & (Y3 @ (^[Y6 : $i]: ((~ (Y5 = Y6)) & (Y4 @ Y6)))))))))) @ Y2)))))) => (Y1 @ Y0))))) @ sK1))),
% 0.20/0.41 inference(definition_unfolding,[],[f21,f27])).
% 0.20/0.41 thf(f27,plain,(
% 0.20/0.41 (cNAT = (^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((Y1 @ (^[Y2 : $i > $o]: (~ (?? @ $i @ (^[Y3 : $i]: (Y2 @ Y3)))))) & (!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ ((^[Y3 : ($i > $o) > $o]: ((^[Y4 : $i > $o]: (?? @ $i @ (^[Y5 : $i]: ((Y4 @ Y5) & (Y3 @ (^[Y6 : $i]: ((~ (Y5 = Y6)) & (Y4 @ Y6)))))))))) @ Y2)))))) => (Y1 @ Y0))))))),
% 0.20/0.41 inference(definition_unfolding,[],[f25,f26,f24])).
% 0.20/0.41 thf(f24,plain,(
% 0.20/0.41 (cSUCC = (^[Y0 : ($i > $o) > $o]: ((^[Y1 : $i > $o]: (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ (^[Y3 : $i]: ((~ (Y2 = Y3)) & (Y1 @ Y3)))))))))))),
% 0.20/0.41 inference(cnf_transformation,[],[f8])).
% 0.20/0.41 thf(f8,plain,(
% 0.20/0.41 (cSUCC = (^[Y0 : ($i > $o) > $o]: ((^[Y1 : $i > $o]: (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ (^[Y3 : $i]: ((~ (Y2 = Y3)) & (Y1 @ Y3)))))))))))),
% 0.20/0.41 inference(fool_elimination,[],[f7])).
% 0.20/0.41 thf(f7,plain,(
% 0.20/0.41 ((^[X0 : ($i > $o) > $o, X1 : $i > $o] : (? [X2] : ((X0 @ (^[X3 : $i] : ((X1 @ X3) & (X2 != X3)))) & (X1 @ X2)))) = cSUCC)),
% 0.20/0.41 inference(rectify,[],[f2])).
% 0.20/0.41 thf(f2,axiom,(
% 0.20/0.41 ((^[X2 : ($i > $o) > $o, X0 : $i > $o] : (? [X1] : ((X2 @ (^[X3 : $i] : ((X0 @ X3) & (X1 != X3)))) & (X0 @ X1)))) = cSUCC)),
% 0.20/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cSUCC_def)).
% 0.20/0.41 thf(f25,plain,(
% 0.20/0.41 (cNAT = (^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((Y1 @ cZERO) & (!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ (cSUCC @ Y2)))))) => (Y1 @ Y0))))))),
% 0.20/0.41 inference(cnf_transformation,[],[f10])).
% 0.20/0.41 thf(f10,plain,(
% 0.20/0.41 (cNAT = (^[Y0 : ($i > $o) > $o]: (!! @ ((($i > $o) > $o) > $o) @ (^[Y1 : (($i > $o) > $o) > $o]: (((Y1 @ cZERO) & (!! @ (($i > $o) > $o) @ (^[Y2 : ($i > $o) > $o]: ((Y1 @ Y2) => (Y1 @ (cSUCC @ Y2)))))) => (Y1 @ Y0))))))),
% 0.20/0.41 inference(fool_elimination,[],[f9])).
% 0.20/0.41 thf(f9,plain,(
% 0.20/0.41 ((^[X0 : ($i > $o) > $o] : (! [X1 : (($i > $o) > $o) > $o] : ((! [X2 : ($i > $o) > $o] : ((X1 @ X2) => (X1 @ (cSUCC @ X2))) & (X1 @ cZERO)) => (X1 @ X0)))) = cNAT)),
% 0.20/0.41 inference(rectify,[],[f3])).
% 0.20/0.41 thf(f3,axiom,(
% 0.20/0.41 ((^[X2 : ($i > $o) > $o] : (! [X0 : (($i > $o) > $o) > $o] : ((! [X1 : ($i > $o) > $o] : ((X0 @ X1) => (X0 @ (cSUCC @ X1))) & (X0 @ cZERO)) => (X0 @ X2)))) = cNAT)),
% 0.20/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cNAT_def)).
% 0.20/0.41 thf(f21,plain,(
% 0.20/0.41 ($true = (cNAT @ sK1))),
% 0.20/0.41 inference(cnf_transformation,[],[f19])).
% 0.20/0.41 thf(f62,plain,(
% 0.20/0.41 ($true = (sK0 @ (^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (sK3 @ sK0 @ (^[Y2 : $i]: ((~ (Y1 = Y2)) & (Y0 @ Y2)))))))))) | ~spl2_2),
% 0.20/0.41 inference(trivial_inequality_removal,[],[f61])).
% 0.20/0.41 thf(f61,plain,(
% 0.20/0.41 ($true = (sK0 @ (^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (sK3 @ sK0 @ (^[Y2 : $i]: ((~ (Y1 = Y2)) & (Y0 @ Y2)))))))))) | ($true != $true) | ~spl2_2),
% 0.20/0.41 inference(superposition,[],[f31,f58])).
% 0.20/0.41 thf(f58,plain,(
% 0.20/0.41 ($true = (sK0 @ (sK3 @ sK0))) | ~spl2_2),
% 0.20/0.41 inference(avatar_component_clause,[],[f56])).
% 0.20/0.41 thf(f31,plain,(
% 0.20/0.41 ( ! [X1 : ($i > $o) > $o] : (($true != (sK0 @ X1)) | ($true = (sK0 @ (^[Y0 : $i > $o]: (?? @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) & (X1 @ (^[Y2 : $i]: ((~ (Y1 = Y2)) & (Y0 @ Y2))))))))))) )),
% 0.20/0.41 inference(beta_eta_normalization,[],[f29])).
% 0.20/0.41 thf(f29,plain,(
% 0.20/0.41 ( ! [X1 : ($i > $o) > $o] : (($true != (sK0 @ X1)) | ($true = (sK0 @ ((^[Y0 : ($i > $o) > $o]: ((^[Y1 : $i > $o]: (?? @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ (^[Y3 : $i]: ((~ (Y2 = Y3)) & (Y1 @ Y3)))))))))) @ X1)))) )),
% 0.20/0.41 inference(definition_unfolding,[],[f22,f24])).
% 0.20/0.41 thf(f22,plain,(
% 0.20/0.41 ( ! [X1 : ($i > $o) > $o] : (($true != (sK0 @ X1)) | ($true = (sK0 @ (cSUCC @ X1)))) )),
% 0.20/0.41 inference(cnf_transformation,[],[f19])).
% 0.20/0.41 thf(f60,plain,(
% 0.20/0.41 spl2_1 | spl2_2),
% 0.20/0.41 inference(avatar_split_clause,[],[f48,f56,f52])).
% 0.20/0.41 thf(f48,plain,(
% 0.20/0.41 ($true = (sK0 @ sK1)) | ($true = (sK0 @ (sK3 @ sK0)))),
% 0.20/0.41 inference(trivial_inequality_removal,[],[f45])).
% 0.20/0.41 thf(f45,plain,(
% 0.20/0.41 ($true = $false) | ($true = (sK0 @ (sK3 @ sK0))) | ($true = (sK0 @ sK1))),
% 0.20/0.41 inference(superposition,[],[f40,f41])).
% 0.20/0.41 thf(f40,plain,(
% 0.20/0.41 ( ! [X1 : (($i > $o) > $o) > $o] : (($false = (X1 @ (^[Y0 : $i > $o]: (~ (?? @ $i @ Y0))))) | ($true = (X1 @ (sK3 @ X1))) | ($true = (X1 @ sK1))) )),
% 0.20/0.41 inference(binary_proxy_clausification,[],[f38])).
% 0.20/0.41 % SZS output end Proof for theBenchmark
% 0.20/0.41 % (11859)------------------------------
% 0.20/0.41 % (11859)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.41 % (11859)Termination reason: Refutation
% 0.20/0.41
% 0.20/0.41 % (11859)Memory used [KB]: 5628
% 0.20/0.41 % (11859)Time elapsed: 0.010 s
% 0.20/0.41 % (11859)Instructions burned: 9 (million)
% 0.20/0.41 % (11859)------------------------------
% 0.20/0.41 % (11859)------------------------------
% 0.20/0.41 % (11856)Success in time 0.018 s
% 0.20/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------