TSTP Solution File: SYO045^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO045^1 : 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.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:02:26 EDT 2024
% Result : Theorem 0.22s 0.40s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYO045^1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 08:33:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/0.36 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/sandbox/benchmark/theBenchmark.p
% 0.22/0.39 % (16302)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.22/0.39 % (16304)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.22/0.39 % (16305)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.39 % (16306)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.22/0.39 % (16303)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.22/0.39 % (16307)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.22/0.39 % (16308)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.22/0.39 % (16309)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.22/0.39 % (16305)Instruction limit reached!
% 0.22/0.39 % (16305)------------------------------
% 0.22/0.39 % (16305)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (16305)Termination reason: Unknown
% 0.22/0.39 % (16306)Instruction limit reached!
% 0.22/0.39 % (16306)------------------------------
% 0.22/0.39 % (16306)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (16305)Termination phase: shuffling
% 0.22/0.39
% 0.22/0.39 % (16305)Memory used [KB]: 1023
% 0.22/0.39 % (16305)Time elapsed: 0.004 s
% 0.22/0.39 % (16305)Instructions burned: 3 (million)
% 0.22/0.39 % (16305)------------------------------
% 0.22/0.39 % (16305)------------------------------
% 0.22/0.39 % (16306)Termination reason: Unknown
% 0.22/0.39 % (16306)Termination phase: shuffling
% 0.22/0.39
% 0.22/0.39 % (16306)Memory used [KB]: 1023
% 0.22/0.39 % (16306)Time elapsed: 0.004 s
% 0.22/0.39 % (16306)Instructions burned: 3 (million)
% 0.22/0.39 % (16306)------------------------------
% 0.22/0.39 % (16306)------------------------------
% 0.22/0.39 % (16309)Instruction limit reached!
% 0.22/0.39 % (16309)------------------------------
% 0.22/0.39 % (16309)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (16309)Termination reason: Unknown
% 0.22/0.39 % (16309)Termination phase: shuffling
% 0.22/0.39
% 0.22/0.39 % (16309)Memory used [KB]: 1023
% 0.22/0.39 % (16309)Time elapsed: 0.004 s
% 0.22/0.39 % (16309)Instructions burned: 3 (million)
% 0.22/0.39 % (16309)------------------------------
% 0.22/0.39 % (16309)------------------------------
% 0.22/0.39 % (16303)Instruction limit reached!
% 0.22/0.39 % (16303)------------------------------
% 0.22/0.39 % (16303)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (16303)Termination reason: Unknown
% 0.22/0.39 % (16303)Termination phase: Property scanning
% 0.22/0.39
% 0.22/0.39 % (16303)Memory used [KB]: 1023
% 0.22/0.39 % (16303)Time elapsed: 0.004 s
% 0.22/0.39 % (16303)Instructions burned: 5 (million)
% 0.22/0.39 % (16303)------------------------------
% 0.22/0.39 % (16303)------------------------------
% 0.22/0.39 % (16307)First to succeed.
% 0.22/0.40 % (16308)Also succeeded, but the first one will report.
% 0.22/0.40 % (16307)Refutation found. Thanks to Tanya!
% 0.22/0.40 % SZS status Theorem for theBenchmark
% 0.22/0.40 % SZS output start Proof for theBenchmark
% 0.22/0.40 thf(type_def_5, type, mu: $tType).
% 0.22/0.40 thf(func_def_0, type, mu: $tType).
% 0.22/0.40 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.22/0.40 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_15, type, mtrue: $i > $o).
% 0.22/0.40 thf(func_def_16, type, mfalse: $i > $o).
% 0.22/0.40 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.22/0.40 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.22/0.40 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.22/0.40 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.22/0.40 thf(func_def_48, type, sK0: $i > $i > $o).
% 0.22/0.40 thf(func_def_51, type, sK3: $i > $o).
% 0.22/0.40 thf(func_def_52, type, sK4: $i > $o).
% 0.22/0.40 thf(f146,plain,(
% 0.22/0.40 $false),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f145])).
% 0.22/0.40 thf(f145,plain,(
% 0.22/0.40 ($true = $false)),
% 0.22/0.40 inference(forward_demodulation,[],[f144,f140])).
% 0.22/0.40 thf(f140,plain,(
% 0.22/0.40 ((sK3 @ sK5) = $false)),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f139])).
% 0.22/0.40 thf(f139,plain,(
% 0.22/0.40 ($true = $false) | ((sK3 @ sK5) = $false)),
% 0.22/0.40 inference(forward_demodulation,[],[f138,f121])).
% 0.22/0.40 thf(f121,plain,(
% 0.22/0.40 ((sK4 @ sK5) = $false)),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f119])).
% 0.22/0.40 thf(f119,plain,(
% 0.22/0.40 (((sK4 @ sK5) | (~ (sK0 @ sK2 @ sK5))) = $false)),
% 0.22/0.40 inference(beta_eta_normalization,[],[f118])).
% 0.22/0.40 thf(f118,plain,(
% 0.22/0.40 (((^[Y0 : $i]: ((sK4 @ Y0) | (~ (sK0 @ sK2 @ Y0)))) @ sK5) = $false)),
% 0.22/0.40 inference(sigma_clausification,[],[f117])).
% 0.22/0.40 thf(f117,plain,(
% 0.22/0.40 ((!! @ $i @ (^[Y0 : $i]: ((sK4 @ Y0) | (~ (sK0 @ sK2 @ Y0))))) = $false)),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f115])).
% 0.22/0.40 thf(f115,plain,(
% 0.22/0.40 (((!! @ $i @ (^[Y0 : $i]: ((sK4 @ Y0) | (~ (sK0 @ sK2 @ Y0))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((sK3 @ Y0) | (~ (sK0 @ sK2 @ Y0))))))) = $false)),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f113])).
% 0.22/0.40 thf(f113,plain,(
% 0.22/0.40 ($false = (((!! @ $i @ (^[Y0 : $i]: ((sK4 @ Y0) | (~ (sK0 @ sK2 @ Y0))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((sK3 @ Y0) | (~ (sK0 @ sK2 @ Y0))))))) | (~ (!! @ $i @ (^[Y0 : $i]: (((sK4 @ Y0) | (~ (sK3 @ Y0))) | (~ (sK0 @ sK2 @ Y0))))))))),
% 0.22/0.40 inference(beta_eta_normalization,[],[f112])).
% 0.22/0.40 thf(f112,plain,(
% 0.22/0.40 ($false = ((^[Y0 : $i > $o]: (((!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) | (~ (sK0 @ sK2 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((sK3 @ Y1) | (~ (sK0 @ sK2 @ Y1))))))) | (~ (!! @ $i @ (^[Y1 : $i]: (((Y0 @ Y1) | (~ (sK3 @ Y1))) | (~ (sK0 @ sK2 @ Y1)))))))) @ sK4))),
% 0.22/0.40 inference(sigma_clausification,[],[f111])).
% 0.22/0.40 thf(f111,plain,(
% 0.22/0.40 ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (((!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) | (~ (sK0 @ sK2 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((sK3 @ Y1) | (~ (sK0 @ sK2 @ Y1))))))) | (~ (!! @ $i @ (^[Y1 : $i]: (((Y0 @ Y1) | (~ (sK3 @ Y1))) | (~ (sK0 @ sK2 @ Y1))))))))) = $false)),
% 0.22/0.40 inference(beta_eta_normalization,[],[f110])).
% 0.22/0.40 thf(f110,plain,(
% 0.22/0.40 (((^[Y0 : $i > $o]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (((!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) | (~ (sK0 @ sK2 @ Y2))))) | (~ (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (sK0 @ sK2 @ Y2))))))) | (~ (!! @ $i @ (^[Y2 : $i]: (((Y1 @ Y2) | (~ (Y0 @ Y2))) | (~ (sK0 @ sK2 @ Y2)))))))))) @ sK3) = $false)),
% 0.22/0.40 inference(sigma_clausification,[],[f109])).
% 0.22/0.40 thf(f109,plain,(
% 0.22/0.40 ($false = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (((!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) | (~ (sK0 @ sK2 @ Y2))))) | (~ (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (sK0 @ sK2 @ Y2))))))) | (~ (!! @ $i @ (^[Y2 : $i]: (((Y1 @ Y2) | (~ (Y0 @ Y2))) | (~ (sK0 @ sK2 @ Y2))))))))))))),
% 0.22/0.40 inference(beta_eta_normalization,[],[f108])).
% 0.22/0.40 thf(f108,plain,(
% 0.22/0.40 (((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (((!! @ $i @ (^[Y3 : $i]: ((Y2 @ Y3) | (~ (sK0 @ Y0 @ Y3))))) | (~ (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (sK0 @ Y0 @ Y3))))))) | (~ (!! @ $i @ (^[Y3 : $i]: (((Y2 @ Y3) | (~ (Y1 @ Y3))) | (~ (sK0 @ Y0 @ Y3)))))))))))) @ sK2) = $false)),
% 0.22/0.40 inference(sigma_clausification,[],[f107])).
% 0.22/0.40 thf(f107,plain,(
% 0.22/0.40 ($true != (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (((!! @ $i @ (^[Y3 : $i]: ((Y2 @ Y3) | (~ (sK0 @ Y0 @ Y3))))) | (~ (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (sK0 @ Y0 @ Y3))))))) | (~ (!! @ $i @ (^[Y3 : $i]: (((Y2 @ Y3) | (~ (Y1 @ Y3))) | (~ (sK0 @ Y0 @ Y3))))))))))))))),
% 0.22/0.40 inference(beta_eta_normalization,[],[f106])).
% 0.22/0.40 thf(f106,plain,(
% 0.22/0.40 ($true != ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))) @ (^[Y0 : $i > $o]: ((^[Y1 : ($i > $o) > $i > $o]: ((^[Y2 : $i]: (!! @ ($i > $o) @ (^[Y3 : $i > $o]: (Y1 @ Y3 @ Y2)))))) @ (^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ Y3)))) @ ((^[Y2 : $i > $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (!! @ $i @ (^[Y5 : $i]: ((Y3 @ Y5) | (~ (Y2 @ Y4 @ Y5)))))))))) @ sK0 @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ Y3)))) @ Y0 @ Y1)) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i > $o]: ((^[Y6 : $i]: ((Y5 @ Y6) | (Y4 @ Y6))))))) @ ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (~ (Y4 @ Y5))))) @ Y2) @ Y3)))) @ ((^[Y2 : $i > $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (!! @ $i @ (^[Y5 : $i]: ((Y3 @ Y5) | (~ (Y2 @ Y4 @ Y5)))))))))) @ sK0 @ Y0) @ ((^[Y2 : $i > $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (!! @ $i @ (^[Y5 : $i]: ((Y3 @ Y5) | (~ (Y2 @ Y4 @ Y5)))))))))) @ sK0 @ Y1)))))))))),
% 0.22/0.40 inference(definition_unfolding,[],[f103,f99,f102,f102,f105,f100,f105,f105,f100,f100])).
% 0.22/0.40 thf(f100,plain,(
% 0.22/0.40 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (Y0 @ Y2 @ Y3)))))))))))),
% 0.22/0.40 inference(cnf_transformation,[],[f86])).
% 0.22/0.40 thf(f86,plain,(
% 0.22/0.40 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (Y0 @ Y2 @ Y3)))))))))))),
% 0.22/0.40 inference(fool_elimination,[],[f85])).
% 0.22/0.40 thf(f85,plain,(
% 0.22/0.40 (mbox = (^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : (~(X0 @ X2 @ X3) | (X1 @ X3)))))),
% 0.22/0.40 inference(rectify,[],[f16])).
% 0.22/0.40 thf(f16,axiom,(
% 0.22/0.40 (mbox = (^[X6 : $i > $i > $o, X3 : $i > $o, X2 : $i] : (! [X7] : (~(X6 @ X2 @ X7) | (X3 @ X7)))))),
% 0.22/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox)).
% 0.22/0.40 thf(f105,plain,(
% 0.22/0.40 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))))),
% 0.22/0.40 inference(definition_unfolding,[],[f98,f101,f104])).
% 0.22/0.40 thf(f104,plain,(
% 0.22/0.40 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.22/0.40 inference(cnf_transformation,[],[f42])).
% 0.22/0.40 thf(f42,plain,(
% 0.22/0.40 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.22/0.40 inference(fool_elimination,[],[f41])).
% 0.22/0.40 thf(f41,plain,(
% 0.22/0.40 ((^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))) = mnot)),
% 0.22/0.40 inference(rectify,[],[f3])).
% 0.22/0.40 thf(f3,axiom,(
% 0.22/0.40 ((^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))) = mnot)),
% 0.22/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mnot)).
% 0.22/0.40 thf(f101,plain,(
% 0.22/0.40 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.22/0.40 inference(cnf_transformation,[],[f61])).
% 0.22/0.40 thf(f61,plain,(
% 0.22/0.40 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.22/0.40 inference(fool_elimination,[],[f60])).
% 0.22/0.40 thf(f60,plain,(
% 0.22/0.40 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))) = mor)),
% 0.22/0.40 inference(rectify,[],[f4])).
% 0.22/0.40 thf(f4,axiom,(
% 0.22/0.40 ((^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X3 @ X2) | (X4 @ X2))) = mor)),
% 0.22/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mor)).
% 0.22/0.40 thf(f98,plain,(
% 0.22/0.40 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.22/0.40 inference(cnf_transformation,[],[f44])).
% 0.22/0.40 thf(f44,plain,(
% 0.22/0.40 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.22/0.40 inference(fool_elimination,[],[f43])).
% 0.22/0.40 thf(f43,plain,(
% 0.22/0.40 (mimplies = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.22/0.40 inference(rectify,[],[f6])).
% 0.22/0.40 thf(f6,axiom,(
% 0.22/0.40 (mimplies = (^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)))),
% 0.22/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimplies)).
% 0.22/0.40 thf(f102,plain,(
% 0.22/0.40 (mforall_prop = (^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))))),
% 0.22/0.40 inference(cnf_transformation,[],[f67])).
% 0.22/0.40 thf(f67,plain,(
% 0.22/0.40 (mforall_prop = (^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))))),
% 0.22/0.40 inference(fool_elimination,[],[f66])).
% 0.22/0.40 thf(f66,plain,(
% 0.22/0.40 ((^[X0 : ($i > $o) > $i > $o, X1 : $i] : (! [X2 : $i > $o] : (X0 @ X2 @ X1))) = mforall_prop)),
% 0.22/0.40 inference(rectify,[],[f11])).
% 0.22/0.40 thf(f11,axiom,(
% 0.22/0.40 ((^[X3 : ($i > $o) > $i > $o, X2 : $i] : (! [X5 : $i > $o] : (X3 @ X5 @ X2))) = mforall_prop)),
% 0.22/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mforall_prop)).
% 0.22/0.40 thf(f99,plain,(
% 0.22/0.40 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.22/0.40 inference(cnf_transformation,[],[f38])).
% 0.22/0.40 thf(f38,plain,(
% 0.22/0.40 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.22/0.40 inference(fool_elimination,[],[f37])).
% 0.22/0.40 thf(f37,plain,(
% 0.22/0.40 (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.22/0.40 inference(rectify,[],[f28])).
% 0.22/0.40 thf(f28,axiom,(
% 0.22/0.40 (mvalid = (^[X3 : $i > $o] : (! [X2] : (X3 @ X2))))),
% 0.22/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mvalid)).
% 0.22/0.40 thf(f103,plain,(
% 0.22/0.40 ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mforall_prop @ (^[Y1 : $i > $o]: (mimplies @ (mbox @ sK0 @ (mimplies @ Y0 @ Y1)) @ (mimplies @ (mbox @ sK0 @ Y0) @ (mbox @ sK0 @ Y1)))))))) != $true)),
% 0.22/0.40 inference(cnf_transformation,[],[f97])).
% 0.22/0.40 thf(f97,plain,(
% 0.22/0.40 ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mforall_prop @ (^[Y1 : $i > $o]: (mimplies @ (mbox @ sK0 @ (mimplies @ Y0 @ Y1)) @ (mimplies @ (mbox @ sK0 @ Y0) @ (mbox @ sK0 @ Y1)))))))) != $true)),
% 0.22/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f95,f96])).
% 0.22/0.40 thf(f96,plain,(
% 0.22/0.40 ? [X0 : $i > $i > $o] : ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mforall_prop @ (^[Y1 : $i > $o]: (mimplies @ (mbox @ X0 @ (mimplies @ Y0 @ Y1)) @ (mimplies @ (mbox @ X0 @ Y0) @ (mbox @ X0 @ Y1)))))))) != $true) => ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mforall_prop @ (^[Y1 : $i > $o]: (mimplies @ (mbox @ sK0 @ (mimplies @ Y0 @ Y1)) @ (mimplies @ (mbox @ sK0 @ Y0) @ (mbox @ sK0 @ Y1)))))))) != $true)),
% 0.22/0.40 introduced(choice_axiom,[])).
% 0.22/0.40 thf(f95,plain,(
% 0.22/0.40 ? [X0 : $i > $i > $o] : ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mforall_prop @ (^[Y1 : $i > $o]: (mimplies @ (mbox @ X0 @ (mimplies @ Y0 @ Y1)) @ (mimplies @ (mbox @ X0 @ Y0) @ (mbox @ X0 @ Y1)))))))) != $true)),
% 0.22/0.40 inference(ennf_transformation,[],[f84])).
% 0.22/0.40 thf(f84,plain,(
% 0.22/0.40 ~! [X0 : $i > $i > $o] : ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mforall_prop @ (^[Y1 : $i > $o]: (mimplies @ (mbox @ X0 @ (mimplies @ Y0 @ Y1)) @ (mimplies @ (mbox @ X0 @ Y0) @ (mbox @ X0 @ Y1)))))))) = $true)),
% 0.22/0.40 inference(fool_elimination,[],[f83])).
% 0.22/0.40 thf(f83,plain,(
% 0.22/0.40 ~! [X0 : $i > $i > $o] : (mvalid @ (mforall_prop @ (^[X1 : $i > $o] : (mforall_prop @ (^[X2 : $i > $o] : (mimplies @ (mbox @ X0 @ (mimplies @ X1 @ X2)) @ (mimplies @ (mbox @ X0 @ X1) @ (mbox @ X0 @ X2))))))))),
% 0.22/0.40 inference(rectify,[],[f33])).
% 0.22/0.40 thf(f33,negated_conjecture,(
% 0.22/0.40 ~! [X6 : $i > $i > $o] : (mvalid @ (mforall_prop @ (^[X11 : $i > $o] : (mforall_prop @ (^[X12 : $i > $o] : (mimplies @ (mbox @ X6 @ (mimplies @ X11 @ X12)) @ (mimplies @ (mbox @ X6 @ X11) @ (mbox @ X6 @ X12))))))))),
% 0.22/0.40 inference(negated_conjecture,[],[f32])).
% 0.22/0.40 thf(f32,conjecture,(
% 0.22/0.40 ! [X6 : $i > $i > $o] : (mvalid @ (mforall_prop @ (^[X11 : $i > $o] : (mforall_prop @ (^[X12 : $i > $o] : (mimplies @ (mbox @ X6 @ (mimplies @ X11 @ X12)) @ (mimplies @ (mbox @ X6 @ X11) @ (mbox @ X6 @ X12))))))))),
% 0.22/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)).
% 0.22/0.40 thf(f138,plain,(
% 0.22/0.40 ((sK3 @ sK5) = $false) | ($true = (sK4 @ sK5))),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f136])).
% 0.22/0.40 thf(f136,plain,(
% 0.22/0.40 ($true = (sK4 @ sK5)) | ((sK3 @ sK5) = $false) | ($true = $false)),
% 0.22/0.40 inference(superposition,[],[f134,f122])).
% 0.22/0.40 thf(f122,plain,(
% 0.22/0.40 ($true = (sK0 @ sK2 @ sK5))),
% 0.22/0.40 inference(not_proxy_clausification,[],[f120])).
% 0.22/0.40 thf(f120,plain,(
% 0.22/0.40 ((~ (sK0 @ sK2 @ sK5)) = $false)),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f119])).
% 0.22/0.40 thf(f134,plain,(
% 0.22/0.40 ( ! [X1 : $i] : (((sK0 @ sK2 @ X1) = $false) | ((sK3 @ X1) = $false) | ($true = (sK4 @ X1))) )),
% 0.22/0.40 inference(not_proxy_clausification,[],[f133])).
% 0.22/0.40 thf(f133,plain,(
% 0.22/0.40 ( ! [X1 : $i] : (((~ (sK0 @ sK2 @ X1)) = $true) | ((sK3 @ X1) = $false) | ($true = (sK4 @ X1))) )),
% 0.22/0.40 inference(not_proxy_clausification,[],[f132])).
% 0.22/0.40 thf(f132,plain,(
% 0.22/0.40 ( ! [X1 : $i] : (($true = (sK4 @ X1)) | ((~ (sK3 @ X1)) = $true) | ((~ (sK0 @ sK2 @ X1)) = $true)) )),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f131])).
% 0.22/0.40 thf(f131,plain,(
% 0.22/0.40 ( ! [X1 : $i] : (($true = ((sK4 @ X1) | (~ (sK3 @ X1)))) | ((~ (sK0 @ sK2 @ X1)) = $true)) )),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f130])).
% 0.22/0.40 thf(f130,plain,(
% 0.22/0.40 ( ! [X1 : $i] : (($true = (((sK4 @ X1) | (~ (sK3 @ X1))) | (~ (sK0 @ sK2 @ X1))))) )),
% 0.22/0.40 inference(beta_eta_normalization,[],[f129])).
% 0.22/0.40 thf(f129,plain,(
% 0.22/0.40 ( ! [X1 : $i] : ((((^[Y0 : $i]: (((sK4 @ Y0) | (~ (sK3 @ Y0))) | (~ (sK0 @ sK2 @ Y0)))) @ X1) = $true)) )),
% 0.22/0.40 inference(pi_clausification,[],[f128])).
% 0.22/0.40 thf(f128,plain,(
% 0.22/0.40 ((!! @ $i @ (^[Y0 : $i]: (((sK4 @ Y0) | (~ (sK3 @ Y0))) | (~ (sK0 @ sK2 @ Y0))))) = $true)),
% 0.22/0.40 inference(not_proxy_clausification,[],[f114])).
% 0.22/0.40 thf(f114,plain,(
% 0.22/0.40 ((~ (!! @ $i @ (^[Y0 : $i]: (((sK4 @ Y0) | (~ (sK3 @ Y0))) | (~ (sK0 @ sK2 @ Y0)))))) = $false)),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f113])).
% 0.22/0.40 thf(f144,plain,(
% 0.22/0.40 ((sK3 @ sK5) = $true)),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f142])).
% 0.22/0.40 thf(f142,plain,(
% 0.22/0.40 ((sK3 @ sK5) = $true) | ($true = $false)),
% 0.22/0.40 inference(superposition,[],[f122,f127])).
% 0.22/0.40 thf(f127,plain,(
% 0.22/0.40 ( ! [X1 : $i] : (((sK0 @ sK2 @ X1) = $false) | ($true = (sK3 @ X1))) )),
% 0.22/0.40 inference(not_proxy_clausification,[],[f126])).
% 0.22/0.40 thf(f126,plain,(
% 0.22/0.40 ( ! [X1 : $i] : (($true = (sK3 @ X1)) | ((~ (sK0 @ sK2 @ X1)) = $true)) )),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f125])).
% 0.22/0.40 thf(f125,plain,(
% 0.22/0.40 ( ! [X1 : $i] : (($true = ((sK3 @ X1) | (~ (sK0 @ sK2 @ X1))))) )),
% 0.22/0.40 inference(beta_eta_normalization,[],[f124])).
% 0.22/0.40 thf(f124,plain,(
% 0.22/0.40 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((sK3 @ Y0) | (~ (sK0 @ sK2 @ Y0)))) @ X1))) )),
% 0.22/0.40 inference(pi_clausification,[],[f123])).
% 0.22/0.40 thf(f123,plain,(
% 0.22/0.40 ((!! @ $i @ (^[Y0 : $i]: ((sK3 @ Y0) | (~ (sK0 @ sK2 @ Y0))))) = $true)),
% 0.22/0.40 inference(not_proxy_clausification,[],[f116])).
% 0.22/0.40 thf(f116,plain,(
% 0.22/0.40 ((~ (!! @ $i @ (^[Y0 : $i]: ((sK3 @ Y0) | (~ (sK0 @ sK2 @ Y0)))))) = $false)),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f115])).
% 0.22/0.40 % SZS output end Proof for theBenchmark
% 0.22/0.40 % (16307)------------------------------
% 0.22/0.40 % (16307)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (16307)Termination reason: Refutation
% 0.22/0.40
% 0.22/0.40 % (16307)Memory used [KB]: 5628
% 0.22/0.40 % (16307)Time elapsed: 0.011 s
% 0.22/0.40 % (16307)Instructions burned: 10 (million)
% 0.22/0.40 % (16307)------------------------------
% 0.22/0.40 % (16307)------------------------------
% 0.22/0.40 % (16301)Success in time 0.015 s
% 0.22/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------