TSTP Solution File: LCL704^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL704^1 : TPTP v8.2.0. Bugfixed v5.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 : n024.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 00:22:18 EDT 2024
% Result : Theorem 0.25s 0.42s
% Output : Refutation 0.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL704^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.11/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.15/0.38 % Computer : n024.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.39 % CPULimit : 300
% 0.15/0.39 % WCLimit : 300
% 0.15/0.39 % DateTime : Mon May 20 01:08:53 EDT 2024
% 0.15/0.39 % CPUTime :
% 0.15/0.39 This is a TH0_THM_EQU_NAR problem
% 0.15/0.39 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.15/0.41 % (7463)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.15/0.41 % (7462)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.15/0.41 % (7461)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.15/0.41 % (7464)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.41 % (7465)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.15/0.41 % (7466)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.15/0.41 % (7467)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.41 % (7464)Instruction limit reached!
% 0.15/0.41 % (7464)------------------------------
% 0.15/0.41 % (7464)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (7464)Termination reason: Unknown
% 0.15/0.41 % (7464)Termination phase: shuffling
% 0.15/0.41 % (7465)Instruction limit reached!
% 0.15/0.41 % (7465)------------------------------
% 0.15/0.41 % (7465)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41
% 0.15/0.41 % (7464)Memory used [KB]: 1023
% 0.15/0.41 % (7464)Time elapsed: 0.003 s
% 0.15/0.41 % (7464)Instructions burned: 2 (million)
% 0.15/0.41 % (7464)------------------------------
% 0.15/0.41 % (7464)------------------------------
% 0.15/0.41 % (7465)Termination reason: Unknown
% 0.15/0.41 % (7465)Termination phase: shuffling
% 0.15/0.41
% 0.15/0.41 % (7465)Memory used [KB]: 1023
% 0.15/0.41 % (7465)Time elapsed: 0.003 s
% 0.15/0.41 % (7465)Instructions burned: 2 (million)
% 0.15/0.41 % (7465)------------------------------
% 0.15/0.41 % (7465)------------------------------
% 0.15/0.41 % (7468)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.15/0.41 % (7462)Instruction limit reached!
% 0.15/0.41 % (7462)------------------------------
% 0.15/0.41 % (7462)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (7462)Termination reason: Unknown
% 0.15/0.41 % (7462)Termination phase: shuffling
% 0.15/0.41
% 0.15/0.41 % (7462)Memory used [KB]: 1023
% 0.15/0.41 % (7462)Time elapsed: 0.004 s
% 0.15/0.41 % (7462)Instructions burned: 4 (million)
% 0.15/0.41 % (7462)------------------------------
% 0.15/0.41 % (7462)------------------------------
% 0.15/0.41 % (7468)Instruction limit reached!
% 0.15/0.41 % (7468)------------------------------
% 0.15/0.41 % (7468)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (7468)Termination reason: Unknown
% 0.15/0.41 % (7468)Termination phase: Property scanning
% 0.15/0.41
% 0.15/0.41 % (7468)Memory used [KB]: 1023
% 0.15/0.41 % (7468)Time elapsed: 0.004 s
% 0.15/0.41 % (7468)Instructions burned: 4 (million)
% 0.15/0.41 % (7468)------------------------------
% 0.15/0.41 % (7468)------------------------------
% 0.15/0.41 % (7466)First to succeed.
% 0.25/0.42 % (7467)Also succeeded, but the first one will report.
% 0.25/0.42 % (7461)Also succeeded, but the first one will report.
% 0.25/0.42 % (7466)Refutation found. Thanks to Tanya!
% 0.25/0.42 % SZS status Theorem for theBenchmark
% 0.25/0.42 % SZS output start Proof for theBenchmark
% 0.25/0.42 thf(type_def_5, type, mu: $tType).
% 0.25/0.42 thf(func_def_0, type, mu: $tType).
% 0.25/0.42 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.25/0.42 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.42 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.25/0.42 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.42 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.42 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.42 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.42 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.42 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.25/0.42 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.25/0.42 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.25/0.42 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.25/0.42 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.25/0.42 thf(func_def_15, type, mtrue: $i > $o).
% 0.25/0.42 thf(func_def_16, type, mfalse: $i > $o).
% 0.25/0.42 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.25/0.42 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.25/0.42 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.25/0.42 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.25/0.42 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.25/0.42 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.25/0.42 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.25/0.42 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.25/0.42 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.25/0.42 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.25/0.42 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.25/0.42 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.25/0.42 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.25/0.42 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.25/0.42 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.25/0.42 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.25/0.42 thf(func_def_48, type, sK0: $i > $i > $o).
% 0.25/0.42 thf(func_def_51, type, sK3: $i > $o).
% 0.25/0.42 thf(f159,plain,(
% 0.25/0.42 $false),
% 0.25/0.42 inference(trivial_inequality_removal,[],[f158])).
% 0.25/0.42 thf(f158,plain,(
% 0.25/0.42 ($true = $false)),
% 0.25/0.42 inference(forward_demodulation,[],[f157,f123])).
% 0.25/0.42 thf(f123,plain,(
% 0.25/0.42 ((sK3 @ sK4) = $false)),
% 0.25/0.42 inference(binary_proxy_clausification,[],[f121])).
% 0.25/0.42 thf(f121,plain,(
% 0.25/0.42 (((sK3 @ sK4) | (~ (sK0 @ sK2 @ sK4))) = $false)),
% 0.25/0.42 inference(beta_eta_normalization,[],[f120])).
% 0.25/0.42 thf(f120,plain,(
% 0.25/0.42 (((^[Y0 : $i]: ((sK3 @ Y0) | (~ (sK0 @ sK2 @ Y0)))) @ sK4) = $false)),
% 0.25/0.42 inference(sigma_clausification,[],[f119])).
% 0.25/0.42 thf(f119,plain,(
% 0.25/0.42 ((!! @ $i @ (^[Y0 : $i]: ((sK3 @ Y0) | (~ (sK0 @ sK2 @ Y0))))) = $false)),
% 0.25/0.42 inference(binary_proxy_clausification,[],[f117])).
% 0.25/0.42 thf(f117,plain,(
% 0.25/0.42 (((!! @ $i @ (^[Y0 : $i]: ((sK3 @ Y0) | (~ (sK0 @ sK2 @ Y0))))) | (!! @ $i @ (^[Y0 : $i]: ((~ (sK3 @ Y0)) | (~ (sK0 @ sK2 @ Y0)))))) = $false)),
% 0.25/0.42 inference(beta_eta_normalization,[],[f116])).
% 0.25/0.42 thf(f116,plain,(
% 0.25/0.42 (((^[Y0 : $i > $o]: ((!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) | (~ (sK0 @ sK2 @ Y1))))) | (!! @ $i @ (^[Y1 : $i]: ((~ (Y0 @ Y1)) | (~ (sK0 @ sK2 @ Y1))))))) @ sK3) = $false)),
% 0.25/0.42 inference(sigma_clausification,[],[f115])).
% 0.25/0.42 thf(f115,plain,(
% 0.25/0.42 ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) | (~ (sK0 @ sK2 @ Y1))))) | (!! @ $i @ (^[Y1 : $i]: ((~ (Y0 @ Y1)) | (~ (sK0 @ sK2 @ Y1)))))))) = $false)),
% 0.25/0.42 inference(beta_eta_normalization,[],[f114])).
% 0.25/0.42 thf(f114,plain,(
% 0.25/0.42 ($false = ((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) | (~ (sK0 @ Y0 @ Y2))))) | (!! @ $i @ (^[Y2 : $i]: ((~ (Y1 @ Y2)) | (~ (sK0 @ Y0 @ Y2))))))))) @ sK2))),
% 0.25/0.42 inference(sigma_clausification,[],[f113])).
% 0.25/0.42 thf(f113,plain,(
% 0.25/0.42 ($true != (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) | (~ (sK0 @ Y0 @ Y2))))) | (!! @ $i @ (^[Y2 : $i]: ((~ (Y1 @ Y2)) | (~ (sK0 @ Y0 @ Y2)))))))))))),
% 0.25/0.42 inference(boolean_simplification,[],[f112])).
% 0.25/0.42 thf(f112,plain,(
% 0.25/0.42 ($true != (!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) | (~ (sK0 @ Y0 @ Y2))))) | (~ (~ (!! @ $i @ (^[Y2 : $i]: ((~ (Y1 @ Y2)) | (~ (sK0 @ Y0 @ Y2)))))))))))))),
% 0.25/0.42 inference(beta_eta_normalization,[],[f111])).
% 0.25/0.42 thf(f111,plain,(
% 0.25/0.42 ($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]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i]: ((Y4 @ Y5) | (Y3 @ Y5))))))) @ ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ Y1) @ Y2)))) @ ((^[Y1 : $i > $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ ((^[Y3 : $i > $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (!! @ $i @ (^[Y6 : $i]: ((Y4 @ Y6) | (~ (Y3 @ Y5 @ Y6)))))))))) @ Y1 @ ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ Y2)))))) @ sK0 @ Y0) @ ((^[Y1 : $i > $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y2 @ Y4) | (~ (Y1 @ Y3 @ Y4)))))))))) @ sK0 @ Y0))))))),
% 0.25/0.42 inference(definition_unfolding,[],[f102,f106,f99,f109,f108,f100])).
% 0.25/0.42 thf(f100,plain,(
% 0.25/0.42 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (Y0 @ Y2 @ Y3)))))))))))),
% 0.25/0.42 inference(cnf_transformation,[],[f81])).
% 0.25/0.42 thf(f81,plain,(
% 0.25/0.42 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (Y0 @ Y2 @ Y3)))))))))))),
% 0.25/0.42 inference(fool_elimination,[],[f80])).
% 0.25/0.42 thf(f80,plain,(
% 0.25/0.42 (mbox = (^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : (~(X0 @ X2 @ X3) | (X1 @ X3)))))),
% 0.25/0.42 inference(rectify,[],[f16])).
% 0.25/0.42 thf(f16,axiom,(
% 0.25/0.42 (mbox = (^[X6 : $i > $i > $o, X3 : $i > $o, X2 : $i] : (! [X7] : (~(X6 @ X2 @ X7) | (X3 @ X7)))))),
% 0.25/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox)).
% 0.25/0.42 thf(f108,plain,(
% 0.25/0.42 (mdia = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : $i > $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (!! @ $i @ (^[Y5 : $i]: ((Y3 @ Y5) | (~ (Y2 @ Y4 @ Y5)))))))))) @ Y0 @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))))),
% 0.25/0.42 inference(definition_unfolding,[],[f98,f107,f100,f107])).
% 0.25/0.42 thf(f107,plain,(
% 0.25/0.42 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.25/0.42 inference(cnf_transformation,[],[f48])).
% 0.25/0.42 thf(f48,plain,(
% 0.25/0.42 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.25/0.42 inference(fool_elimination,[],[f47])).
% 0.25/0.42 thf(f47,plain,(
% 0.25/0.42 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.25/0.42 inference(rectify,[],[f3])).
% 0.25/0.42 thf(f3,axiom,(
% 0.25/0.42 (mnot = (^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))))),
% 0.25/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.25/0.42 thf(f98,plain,(
% 0.25/0.42 (mdia = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mbox @ Y0 @ (mnot @ Y1)))))))),
% 0.25/0.42 inference(cnf_transformation,[],[f38])).
% 0.25/0.42 thf(f38,plain,(
% 0.25/0.42 (mdia = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mbox @ Y0 @ (mnot @ Y1)))))))),
% 0.25/0.42 inference(fool_elimination,[],[f37])).
% 0.25/0.42 thf(f37,plain,(
% 0.25/0.42 (mdia = (^[X0 : $i > $i > $o, X1 : $i > $o] : (mnot @ (mbox @ X0 @ (mnot @ X1)))))),
% 0.25/0.42 inference(rectify,[],[f17])).
% 0.25/0.42 thf(f17,axiom,(
% 0.25/0.42 (mdia = (^[X6 : $i > $i > $o, X3 : $i > $o] : (mnot @ (mbox @ X6 @ (mnot @ X3)))))),
% 0.25/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mdia)).
% 0.25/0.42 thf(f109,plain,(
% 0.25/0.42 (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.25/0.42 inference(definition_unfolding,[],[f104,f101,f107])).
% 0.25/0.42 thf(f101,plain,(
% 0.25/0.42 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.25/0.42 inference(cnf_transformation,[],[f83])).
% 0.25/0.42 thf(f83,plain,(
% 0.25/0.42 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.25/0.42 inference(fool_elimination,[],[f82])).
% 0.25/0.42 thf(f82,plain,(
% 0.25/0.42 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))) = mor)),
% 0.25/0.42 inference(rectify,[],[f4])).
% 0.25/0.42 thf(f4,axiom,(
% 0.25/0.42 ((^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X3 @ X2) | (X4 @ X2))) = mor)),
% 0.25/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.25/0.42 thf(f104,plain,(
% 0.25/0.42 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.25/0.42 inference(cnf_transformation,[],[f92])).
% 0.25/0.42 thf(f92,plain,(
% 0.25/0.42 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.25/0.42 inference(fool_elimination,[],[f91])).
% 0.25/0.42 thf(f91,plain,(
% 0.25/0.42 (mimplies = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.25/0.42 inference(rectify,[],[f6])).
% 0.25/0.42 thf(f6,axiom,(
% 0.25/0.42 (mimplies = (^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)))),
% 0.25/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies)).
% 0.25/0.42 thf(f99,plain,(
% 0.25/0.42 (mforall_prop = (^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))))),
% 0.25/0.42 inference(cnf_transformation,[],[f73])).
% 0.25/0.42 thf(f73,plain,(
% 0.25/0.42 (mforall_prop = (^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))))),
% 0.25/0.42 inference(fool_elimination,[],[f72])).
% 0.25/0.42 thf(f72,plain,(
% 0.25/0.42 (mforall_prop = (^[X0 : ($i > $o) > $i > $o, X1 : $i] : (! [X2 : $i > $o] : (X0 @ X2 @ X1))))),
% 0.25/0.42 inference(rectify,[],[f11])).
% 0.25/0.42 thf(f11,axiom,(
% 0.25/0.42 (mforall_prop = (^[X3 : ($i > $o) > $i > $o, X2 : $i] : (! [X5 : $i > $o] : (X3 @ X5 @ X2))))),
% 0.25/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mforall_prop)).
% 0.25/0.42 thf(f106,plain,(
% 0.25/0.42 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.25/0.42 inference(cnf_transformation,[],[f90])).
% 0.25/0.42 thf(f90,plain,(
% 0.25/0.42 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.25/0.42 inference(fool_elimination,[],[f89])).
% 0.25/0.42 thf(f89,plain,(
% 0.25/0.42 (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.25/0.42 inference(rectify,[],[f28])).
% 0.25/0.42 thf(f28,axiom,(
% 0.25/0.42 (mvalid = (^[X3 : $i > $o] : (! [X2] : (X3 @ X2))))),
% 0.25/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.25/0.42 thf(f102,plain,(
% 0.25/0.42 ($true != (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mdia @ sK0 @ Y0) @ (mbox @ sK0 @ Y0))))))),
% 0.25/0.42 inference(cnf_transformation,[],[f97])).
% 0.25/0.42 thf(f97,plain,(
% 0.25/0.42 ($true = (mpartially_functional @ sK0)) & ($true != (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mdia @ sK0 @ Y0) @ (mbox @ sK0 @ Y0))))))),
% 0.25/0.42 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f95,f96])).
% 0.25/0.42 thf(f96,plain,(
% 0.25/0.42 ? [X0 : $i > $i > $o] : (($true = (mpartially_functional @ X0)) & ($true != (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mdia @ X0 @ Y0) @ (mbox @ X0 @ Y0))))))) => (($true = (mpartially_functional @ sK0)) & ($true != (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mdia @ sK0 @ Y0) @ (mbox @ sK0 @ Y0)))))))),
% 0.25/0.42 introduced(choice_axiom,[])).
% 0.25/0.42 thf(f95,plain,(
% 0.25/0.42 ? [X0 : $i > $i > $o] : (($true = (mpartially_functional @ X0)) & ($true != (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mdia @ X0 @ Y0) @ (mbox @ X0 @ Y0)))))))),
% 0.25/0.42 inference(ennf_transformation,[],[f87])).
% 0.25/0.42 thf(f87,plain,(
% 0.25/0.42 ~! [X0 : $i > $i > $o] : (($true = (mpartially_functional @ X0)) => ($true = (mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mdia @ X0 @ Y0) @ (mbox @ X0 @ Y0)))))))),
% 0.25/0.42 inference(fool_elimination,[],[f86])).
% 0.25/0.42 thf(f86,plain,(
% 0.25/0.42 ~! [X0 : $i > $i > $o] : ((mpartially_functional @ X0) => (mvalid @ (mforall_prop @ (^[X1 : $i > $o] : (mimplies @ (mdia @ X0 @ X1) @ (mbox @ X0 @ X1))))))),
% 0.25/0.42 inference(rectify,[],[f33])).
% 0.25/0.42 thf(f33,negated_conjecture,(
% 0.25/0.42 ~! [X6 : $i > $i > $o] : ((mpartially_functional @ X6) => (mvalid @ (mforall_prop @ (^[X11 : $i > $o] : (mimplies @ (mdia @ X6 @ X11) @ (mbox @ X6 @ X11))))))),
% 0.25/0.42 inference(negated_conjecture,[],[f32])).
% 0.25/0.42 thf(f32,conjecture,(
% 0.25/0.42 ! [X6 : $i > $i > $o] : ((mpartially_functional @ X6) => (mvalid @ (mforall_prop @ (^[X11 : $i > $o] : (mimplies @ (mdia @ X6 @ X11) @ (mbox @ X6 @ X11))))))),
% 0.25/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)).
% 0.25/0.42 thf(f157,plain,(
% 0.25/0.42 ($true = (sK3 @ sK4))),
% 0.25/0.42 inference(superposition,[],[f129,f155])).
% 0.25/0.42 thf(f155,plain,(
% 0.25/0.42 (sK5 = sK4)),
% 0.25/0.42 inference(trivial_inequality_removal,[],[f151])).
% 0.25/0.42 thf(f151,plain,(
% 0.25/0.42 ($true = $false) | (sK5 = sK4)),
% 0.25/0.42 inference(superposition,[],[f145,f130])).
% 0.25/0.42 thf(f130,plain,(
% 0.25/0.42 ($true = (sK0 @ sK2 @ sK5))),
% 0.25/0.42 inference(not_proxy_clausification,[],[f127])).
% 0.25/0.42 thf(f127,plain,(
% 0.25/0.42 ((~ (sK0 @ sK2 @ sK5)) = $false)),
% 0.25/0.42 inference(binary_proxy_clausification,[],[f126])).
% 0.25/0.42 thf(f126,plain,(
% 0.25/0.42 (((~ (sK3 @ sK5)) | (~ (sK0 @ sK2 @ sK5))) = $false)),
% 0.25/0.42 inference(beta_eta_normalization,[],[f125])).
% 0.25/0.42 thf(f125,plain,(
% 0.25/0.42 (((^[Y0 : $i]: ((~ (sK3 @ Y0)) | (~ (sK0 @ sK2 @ Y0)))) @ sK5) = $false)),
% 0.25/0.42 inference(sigma_clausification,[],[f118])).
% 0.25/0.42 thf(f118,plain,(
% 0.25/0.42 ((!! @ $i @ (^[Y0 : $i]: ((~ (sK3 @ Y0)) | (~ (sK0 @ sK2 @ Y0))))) = $false)),
% 0.25/0.42 inference(binary_proxy_clausification,[],[f117])).
% 0.25/0.42 thf(f145,plain,(
% 0.25/0.42 ( ! [X0 : $i] : (((sK0 @ sK2 @ X0) = $false) | (sK4 = X0)) )),
% 0.25/0.42 inference(trivial_inequality_removal,[],[f143])).
% 0.25/0.42 thf(f143,plain,(
% 0.25/0.42 ( ! [X0 : $i] : (((sK0 @ sK2 @ X0) = $false) | ($true = $false) | (sK4 = X0)) )),
% 0.25/0.42 inference(superposition,[],[f140,f124])).
% 0.25/0.42 thf(f124,plain,(
% 0.25/0.42 ($true = (sK0 @ sK2 @ sK4))),
% 0.25/0.42 inference(not_proxy_clausification,[],[f122])).
% 0.25/0.42 thf(f122,plain,(
% 0.25/0.42 ($false = (~ (sK0 @ sK2 @ sK4)))),
% 0.25/0.42 inference(binary_proxy_clausification,[],[f121])).
% 0.25/0.42 thf(f140,plain,(
% 0.25/0.42 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($false = (sK0 @ X3 @ X2)) | ((sK0 @ X3 @ X1) = $false) | (X1 = X2)) )),
% 0.25/0.42 inference(binary_proxy_clausification,[],[f139])).
% 0.25/0.42 thf(f139,plain,(
% 0.25/0.42 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((sK0 @ X3 @ X2) & (sK0 @ X3 @ X1)) = $false) | (X1 = X2)) )),
% 0.25/0.42 inference(equality_proxy_clausification,[],[f138])).
% 0.25/0.42 thf(f138,plain,(
% 0.25/0.42 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (X2 = X1)) | (((sK0 @ X3 @ X2) & (sK0 @ X3 @ X1)) = $false)) )),
% 0.25/0.42 inference(binary_proxy_clausification,[],[f137])).
% 0.25/0.42 thf(f137,plain,(
% 0.25/0.42 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (((sK0 @ X3 @ X2) & (sK0 @ X3 @ X1)) => (X2 = X1)))) )),
% 0.25/0.42 inference(beta_eta_normalization,[],[f136])).
% 0.25/0.42 thf(f136,plain,(
% 0.25/0.42 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (((sK0 @ Y0 @ X2) & (sK0 @ Y0 @ X1)) => (X2 = X1))) @ X3))) )),
% 0.25/0.42 inference(pi_clausification,[],[f135])).
% 0.25/0.42 thf(f135,plain,(
% 0.25/0.42 ( ! [X2 : $i,X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: (((sK0 @ Y0 @ X2) & (sK0 @ Y0 @ X1)) => (X2 = X1)))))) )),
% 0.25/0.42 inference(beta_eta_normalization,[],[f134])).
% 0.25/0.42 thf(f134,plain,(
% 0.25/0.42 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK0 @ Y1 @ Y0) & (sK0 @ Y1 @ X1)) => (Y0 = X1))))) @ X2))) )),
% 0.25/0.42 inference(pi_clausification,[],[f133])).
% 0.25/0.42 thf(f133,plain,(
% 0.25/0.42 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK0 @ Y1 @ Y0) & (sK0 @ Y1 @ X1)) => (Y0 = X1)))))))) )),
% 0.25/0.42 inference(beta_eta_normalization,[],[f132])).
% 0.25/0.42 thf(f132,plain,(
% 0.25/0.42 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK0 @ Y2 @ Y1) & (sK0 @ Y2 @ Y0)) => (Y1 = Y0))))))) @ X1))) )),
% 0.25/0.42 inference(pi_clausification,[],[f131])).
% 0.25/0.42 thf(f131,plain,(
% 0.25/0.42 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((sK0 @ Y2 @ Y1) & (sK0 @ Y2 @ Y0)) => (Y1 = Y0)))))))))),
% 0.25/0.42 inference(beta_eta_normalization,[],[f110])).
% 0.25/0.42 thf(f110,plain,(
% 0.25/0.42 ($true = ((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y3 @ Y2) & (Y0 @ Y3 @ Y1)) => (Y2 = Y1))))))))) @ sK0))),
% 0.25/0.42 inference(definition_unfolding,[],[f103,f105])).
% 0.25/0.42 thf(f105,plain,(
% 0.25/0.42 (mpartially_functional = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y3 @ Y2) & (Y0 @ Y3 @ Y1)) => (Y2 = Y1))))))))))),
% 0.25/0.42 inference(cnf_transformation,[],[f52])).
% 0.25/0.42 thf(f52,plain,(
% 0.25/0.42 (mpartially_functional = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y3 @ Y2) & (Y0 @ Y3 @ Y1)) => (Y2 = Y1))))))))))),
% 0.25/0.42 inference(fool_elimination,[],[f51])).
% 0.25/0.42 thf(f51,plain,(
% 0.25/0.42 (mpartially_functional = (^[X0 : $i > $i > $o] : (! [X1,X2,X3] : (((X0 @ X1 @ X3) & (X0 @ X1 @ X2)) => (X2 = X3)))))),
% 0.25/0.42 inference(rectify,[],[f23])).
% 0.25/0.42 thf(f23,axiom,(
% 0.25/0.42 (mpartially_functional = (^[X6 : $i > $i > $o] : (! [X8,X10,X9] : (((X6 @ X8 @ X9) & (X6 @ X8 @ X10)) => (X9 = X10)))))),
% 0.25/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mpartially_functional)).
% 0.25/0.42 thf(f103,plain,(
% 0.25/0.42 ($true = (mpartially_functional @ sK0))),
% 0.25/0.42 inference(cnf_transformation,[],[f97])).
% 0.25/0.42 thf(f129,plain,(
% 0.25/0.42 ($true = (sK3 @ sK5))),
% 0.25/0.42 inference(not_proxy_clausification,[],[f128])).
% 0.25/0.42 thf(f128,plain,(
% 0.25/0.42 ((~ (sK3 @ sK5)) = $false)),
% 0.25/0.42 inference(binary_proxy_clausification,[],[f126])).
% 0.25/0.42 % SZS output end Proof for theBenchmark
% 0.25/0.42 % (7466)------------------------------
% 0.25/0.42 % (7466)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.42 % (7466)Termination reason: Refutation
% 0.25/0.42
% 0.25/0.42 % (7466)Memory used [KB]: 5628
% 0.25/0.42 % (7466)Time elapsed: 0.010 s
% 0.25/0.42 % (7466)Instructions burned: 11 (million)
% 0.25/0.42 % (7466)------------------------------
% 0.25/0.42 % (7466)------------------------------
% 0.25/0.42 % (7460)Success in time 0.013 s
% 0.25/0.42 % Vampire---4.8 exiting
%------------------------------------------------------------------------------