TSTP Solution File: SWV435^3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV435^3 : TPTP v8.2.0. Released v3.6.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 : n032.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 06:01:16 EDT 2024
% Result : Theorem 0.08s 0.30s
% Output : Refutation 0.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08 % Problem : SWV435^3 : TPTP v8.2.0. Released v3.6.0.
% 0.04/0.09 % 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.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Sun May 19 09:33:22 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.08/0.28 This is a TH0_THM_EQU_NAR problem
% 0.08/0.28 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.08/0.30 % (22960)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.08/0.30 % (22964)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.08/0.30 % (22962)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.08/0.30 % (22960)Instruction limit reached!
% 0.08/0.30 % (22960)------------------------------
% 0.08/0.30 % (22960)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.30 % (22960)Termination reason: Unknown
% 0.08/0.30 % (22960)Termination phase: Saturation
% 0.08/0.30
% 0.08/0.30 % (22960)Memory used [KB]: 1023
% 0.08/0.30 % (22960)Time elapsed: 0.003 s
% 0.08/0.30 % (22960)Instructions burned: 4 (million)
% 0.08/0.30 % (22960)------------------------------
% 0.08/0.30 % (22960)------------------------------
% 0.08/0.30 % (22964)Instruction limit reached!
% 0.08/0.30 % (22964)------------------------------
% 0.08/0.30 % (22964)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.30 % (22964)Termination reason: Unknown
% 0.08/0.30 % (22964)Termination phase: Saturation
% 0.08/0.30
% 0.08/0.30 % (22964)Memory used [KB]: 5500
% 0.08/0.30 % (22964)Time elapsed: 0.003 s
% 0.08/0.30 % (22964)Instructions burned: 5 (million)
% 0.08/0.30 % (22964)------------------------------
% 0.08/0.30 % (22964)------------------------------
% 0.08/0.30 % (22961)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.08/0.30 % (22962)Refutation not found, incomplete strategy
% 0.08/0.30 % (22962)------------------------------
% 0.08/0.30 % (22962)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.30 % (22962)Termination reason: Refutation not found, incomplete strategy
% 0.08/0.30
% 0.08/0.30
% 0.08/0.30 % (22962)Memory used [KB]: 5500
% 0.08/0.30 % (22962)Time elapsed: 0.003 s
% 0.08/0.30 % (22962)Instructions burned: 4 (million)
% 0.08/0.30 % (22962)------------------------------
% 0.08/0.30 % (22962)------------------------------
% 0.08/0.30 % (22961)Instruction limit reached!
% 0.08/0.30 % (22961)------------------------------
% 0.08/0.30 % (22961)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.30 % (22961)Termination reason: Unknown
% 0.08/0.30 % (22961)Termination phase: Naming
% 0.08/0.30 % (22958)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.08/0.30
% 0.08/0.30 % (22961)Memory used [KB]: 1023
% 0.08/0.30 % (22963)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.08/0.30 % (22961)Time elapsed: 0.003 s
% 0.08/0.30 % (22961)Instructions burned: 3 (million)
% 0.08/0.30 % (22961)------------------------------
% 0.08/0.30 % (22961)------------------------------
% 0.08/0.30 % (22957)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.08/0.30 % (22958)Instruction limit reached!
% 0.08/0.30 % (22958)------------------------------
% 0.08/0.30 % (22958)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.30 % (22958)Termination reason: Unknown
% 0.08/0.30 % (22958)Termination phase: Saturation
% 0.08/0.30
% 0.08/0.30 % (22958)Memory used [KB]: 5500
% 0.08/0.30 % (22958)Time elapsed: 0.003 s
% 0.08/0.30 % (22959)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.08/0.30 % (22958)Instructions burned: 4 (million)
% 0.08/0.30 % (22958)------------------------------
% 0.08/0.30 % (22958)------------------------------
% 0.08/0.30 % (22963)First to succeed.
% 0.08/0.30 % (22957)Also succeeded, but the first one will report.
% 0.08/0.30 % (22963)Refutation found. Thanks to Tanya!
% 0.08/0.30 % SZS status Theorem for theBenchmark
% 0.08/0.30 % SZS output start Proof for theBenchmark
% 0.08/0.30 thf(type_def_6, type, individuals: $tType).
% 0.08/0.30 thf(func_def_1, type, prop_a: $i > $o).
% 0.08/0.30 thf(func_def_2, type, prop_b: $i > $o).
% 0.08/0.30 thf(func_def_3, type, prop_c: $i > $o).
% 0.08/0.30 thf(func_def_4, type, mfalse: $i > $o).
% 0.08/0.30 thf(func_def_5, type, mtrue: $i > $o).
% 0.08/0.30 thf(func_def_6, type, mnot: ($i > $o) > $i > $o).
% 0.08/0.30 thf(func_def_8, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.08/0.30 thf(func_def_9, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.08/0.30 thf(func_def_10, type, mimpl: ($i > $o) > ($i > $o) > $i > $o).
% 0.08/0.30 thf(func_def_11, type, miff: ($i > $o) > ($i > $o) > $i > $o).
% 0.08/0.30 thf(func_def_12, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.08/0.30 thf(func_def_13, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.08/0.30 thf(func_def_14, type, individuals: $tType).
% 0.08/0.30 thf(func_def_15, type, mall: (individuals > $i > $o) > $i > $o).
% 0.08/0.30 thf(func_def_16, type, mexists: (individuals > $i > $o) > $i > $o).
% 0.08/0.30 thf(func_def_17, type, mvalid: ($i > $o) > $o).
% 0.08/0.30 thf(func_def_18, type, msatisfiable: ($i > $o) > $o).
% 0.08/0.30 thf(func_def_19, type, mcountersatisfiable: ($i > $o) > $o).
% 0.08/0.30 thf(func_def_20, type, minvalid: ($i > $o) > $o).
% 0.08/0.30 thf(func_def_21, type, rel: $i > $i > $o).
% 0.08/0.30 thf(func_def_22, type, icl_atom: ($i > $o) > $i > $o).
% 0.08/0.30 thf(func_def_23, type, icl_princ: ($i > $o) > $i > $o).
% 0.08/0.30 thf(func_def_24, type, icl_and: ($i > $o) > ($i > $o) > $i > $o).
% 0.08/0.30 thf(func_def_25, type, icl_or: ($i > $o) > ($i > $o) > $i > $o).
% 0.08/0.30 thf(func_def_26, type, icl_impl: ($i > $o) > ($i > $o) > $i > $o).
% 0.08/0.30 thf(func_def_27, type, icl_true: $i > $o).
% 0.08/0.30 thf(func_def_28, type, icl_false: $i > $o).
% 0.08/0.30 thf(func_def_29, type, icl_says: ($i > $o) > ($i > $o) > $i > $o).
% 0.08/0.30 thf(func_def_30, type, iclval: ($i > $o) > $o).
% 0.08/0.30 thf(func_def_31, type, a: $i > $o).
% 0.08/0.30 thf(func_def_48, type, ph3: !>[X0: $tType]:(X0)).
% 0.08/0.30 thf(f125,plain,(
% 0.08/0.30 $false),
% 0.08/0.30 inference(trivial_inequality_removal,[],[f124])).
% 0.08/0.30 thf(f124,plain,(
% 0.08/0.30 ($true = $false)),
% 0.08/0.30 inference(superposition,[],[f118,f122])).
% 0.08/0.30 thf(f122,plain,(
% 0.08/0.30 ( ! [X1 : $i] : (($true = (a @ X1))) )),
% 0.08/0.30 inference(beta_eta_normalization,[],[f121])).
% 0.08/0.30 thf(f121,plain,(
% 0.08/0.30 ( ! [X1 : $i] : ((((^[Y0 : $i]: ($true)) @ X1) = (a @ X1))) )),
% 0.08/0.30 inference(argument_congruence,[],[f120])).
% 0.08/0.30 thf(f120,plain,(
% 0.08/0.30 (a = (^[Y0 : $i]: ($true)))),
% 0.08/0.30 inference(beta_eta_normalization,[],[f111])).
% 0.08/0.30 thf(f111,plain,(
% 0.08/0.30 (((^[Y0 : $i > $o]: (Y0)) @ a) = (^[Y0 : $i]: ($true)))),
% 0.08/0.30 inference(definition_unfolding,[],[f96,f100])).
% 0.08/0.30 thf(f100,plain,(
% 0.08/0.30 (mtrue = ((^[Y0 : $i > $o]: (Y0)) @ a))),
% 0.08/0.30 inference(definition_unfolding,[],[f89,f99])).
% 0.08/0.30 thf(f99,plain,(
% 0.08/0.30 (icl_true = ((^[Y0 : $i > $o]: (Y0)) @ a))),
% 0.08/0.30 inference(definition_unfolding,[],[f91,f87])).
% 0.08/0.30 thf(f87,plain,(
% 0.08/0.30 (icl_princ = (^[Y0 : $i > $o]: (Y0)))),
% 0.08/0.30 inference(cnf_transformation,[],[f63])).
% 0.08/0.30 thf(f63,plain,(
% 0.08/0.30 (icl_princ = (^[Y0 : $i > $o]: (Y0)))),
% 0.08/0.30 inference(fool_elimination,[],[f62])).
% 0.08/0.30 thf(f62,plain,(
% 0.08/0.30 ((^[X0 : $i > $o] : (X0)) = icl_princ)),
% 0.08/0.30 inference(rectify,[],[f17])).
% 0.08/0.30 thf(f17,axiom,(
% 0.08/0.30 ((^[X5 : $i > $o] : (X5)) = icl_princ)),
% 0.08/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',icl_princ)).
% 0.08/0.30 thf(f91,plain,(
% 0.08/0.30 (icl_true = (icl_princ @ a))),
% 0.08/0.30 inference(cnf_transformation,[],[f25])).
% 0.08/0.30 thf(f25,axiom,(
% 0.08/0.30 (icl_true = (icl_princ @ a))),
% 0.08/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1)).
% 0.08/0.30 thf(f89,plain,(
% 0.08/0.30 (mtrue = icl_true)),
% 0.08/0.30 inference(cnf_transformation,[],[f21])).
% 0.08/0.30 thf(f21,axiom,(
% 0.08/0.30 (mtrue = icl_true)),
% 0.08/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',icl_true)).
% 0.08/0.30 thf(f96,plain,(
% 0.08/0.30 (mtrue = (^[Y0 : $i]: ($true)))),
% 0.08/0.30 inference(cnf_transformation,[],[f57])).
% 0.08/0.30 thf(f57,plain,(
% 0.08/0.30 (mtrue = (^[Y0 : $i]: ($true)))),
% 0.08/0.30 inference(fool_elimination,[],[f2])).
% 0.08/0.30 thf(f2,axiom,(
% 0.08/0.30 (mtrue = (^[X0 : $i] : ($true)))),
% 0.08/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mtrue)).
% 0.08/0.30 thf(f118,plain,(
% 0.08/0.30 ($false = (a @ sK2))),
% 0.08/0.30 inference(binary_proxy_clausification,[],[f117])).
% 0.08/0.30 thf(f117,plain,(
% 0.08/0.30 ($false = ((rel @ sK1 @ sK2) => (a @ sK2)))),
% 0.08/0.30 inference(beta_eta_normalization,[],[f116])).
% 0.08/0.30 thf(f116,plain,(
% 0.08/0.30 ($false = ((^[Y0 : $i]: ((rel @ sK1 @ Y0) => (a @ Y0))) @ sK2))),
% 0.08/0.30 inference(sigma_clausification,[],[f115])).
% 0.08/0.30 thf(f115,plain,(
% 0.08/0.30 ($false = (!! @ $i @ (^[Y0 : $i]: ((rel @ sK1 @ Y0) => (a @ Y0)))))),
% 0.08/0.30 inference(beta_eta_normalization,[],[f114])).
% 0.08/0.30 thf(f114,plain,(
% 0.08/0.30 ($false = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((rel @ Y0 @ Y1) => (a @ Y1))))) @ sK1))),
% 0.08/0.30 inference(sigma_clausification,[],[f113])).
% 0.08/0.30 thf(f113,plain,(
% 0.08/0.30 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((rel @ Y0 @ Y1) => (a @ Y1)))))) != $true)),
% 0.08/0.30 inference(boolean_simplification,[],[f112])).
% 0.08/0.30 thf(f112,plain,(
% 0.08/0.30 ($true != (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((rel @ Y0 @ Y1) => ($false | (a @ Y1))))))))),
% 0.08/0.30 inference(beta_eta_normalization,[],[f110])).
% 0.08/0.30 thf(f110,plain,(
% 0.08/0.30 ($true != ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: (Y1 @ Y2)))) @ Y0)) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (!! @ $i @ (^[Y5 : $i]: ((Y2 @ Y4 @ Y5) => (Y3 @ Y5))))))))) @ rel @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ Y0 @ Y1))))) @ ((^[Y0 : $i > $o]: (Y0)) @ a) @ (^[Y0 : $i]: ($false)))))),
% 0.08/0.30 inference(definition_unfolding,[],[f79,f109,f108,f87,f107])).
% 0.08/0.30 thf(f107,plain,(
% 0.08/0.30 (icl_false = (^[Y0 : $i]: ($false)))),
% 0.08/0.30 inference(definition_unfolding,[],[f80,f97])).
% 0.08/0.30 thf(f97,plain,(
% 0.08/0.30 (mfalse = (^[Y0 : $i]: ($false)))),
% 0.08/0.30 inference(cnf_transformation,[],[f33])).
% 0.08/0.30 thf(f33,plain,(
% 0.08/0.30 (mfalse = (^[Y0 : $i]: ($false)))),
% 0.08/0.30 inference(fool_elimination,[],[f1])).
% 0.08/0.30 thf(f1,axiom,(
% 0.08/0.30 (mfalse = (^[X0 : $i] : ($false)))),
% 0.08/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mfalse)).
% 0.08/0.30 thf(f80,plain,(
% 0.08/0.30 (mfalse = icl_false)),
% 0.08/0.30 inference(cnf_transformation,[],[f22])).
% 0.08/0.30 thf(f22,axiom,(
% 0.08/0.30 (mfalse = icl_false)),
% 0.08/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',icl_false)).
% 0.08/0.30 thf(f108,plain,(
% 0.08/0.30 (icl_says = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (!! @ $i @ (^[Y5 : $i]: ((Y2 @ Y4 @ Y5) => (Y3 @ Y5))))))))) @ rel @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ Y0 @ Y1))))))),
% 0.08/0.30 inference(definition_unfolding,[],[f94,f95,f74])).
% 0.08/0.30 thf(f74,plain,(
% 0.08/0.30 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.08/0.30 inference(cnf_transformation,[],[f30])).
% 0.08/0.30 thf(f30,plain,(
% 0.08/0.30 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.08/0.30 inference(fool_elimination,[],[f29])).
% 0.08/0.30 thf(f29,plain,(
% 0.08/0.30 (mor = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))))),
% 0.08/0.30 inference(rectify,[],[f4])).
% 0.08/0.30 thf(f4,axiom,(
% 0.08/0.30 (mor = (^[X0 : $i > $o, X2 : $i > $o, X1 : $i] : ((X0 @ X1) | (X2 @ X1))))),
% 0.08/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mor)).
% 0.08/0.30 thf(f95,plain,(
% 0.08/0.30 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.08/0.30 inference(cnf_transformation,[],[f37])).
% 0.08/0.30 thf(f37,plain,(
% 0.08/0.30 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.08/0.30 inference(fool_elimination,[],[f36])).
% 0.08/0.30 thf(f36,plain,(
% 0.08/0.30 (mbox = (^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : ((X0 @ X2 @ X3) => (X1 @ X3)))))),
% 0.08/0.30 inference(rectify,[],[f8])).
% 0.08/0.30 thf(f8,axiom,(
% 0.08/0.30 (mbox = (^[X4 : $i > $i > $o, X5 : $i > $o, X0 : $i] : (! [X2] : ((X4 @ X0 @ X2) => (X5 @ X2)))))),
% 0.08/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox)).
% 0.08/0.30 thf(f94,plain,(
% 0.08/0.30 (icl_says = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mbox @ rel @ (mor @ Y0 @ Y1))))))),
% 0.08/0.30 inference(cnf_transformation,[],[f51])).
% 0.08/0.30 thf(f51,plain,(
% 0.08/0.30 (icl_says = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mbox @ rel @ (mor @ Y0 @ Y1))))))),
% 0.08/0.30 inference(fool_elimination,[],[f50])).
% 0.08/0.30 thf(f50,plain,(
% 0.08/0.30 ((^[X0 : $i > $o, X1 : $i > $o] : (mbox @ rel @ (mor @ X0 @ X1))) = icl_says)),
% 0.08/0.30 inference(rectify,[],[f23])).
% 0.08/0.30 thf(f23,axiom,(
% 0.08/0.30 ((^[X7 : $i > $o, X9 : $i > $o] : (mbox @ rel @ (mor @ X7 @ X9))) = icl_says)),
% 0.08/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',icl_says)).
% 0.08/0.30 thf(f109,plain,(
% 0.08/0.30 (iclval = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: (Y1 @ Y2)))) @ Y0)))),
% 0.08/0.30 inference(definition_unfolding,[],[f81,f83])).
% 0.08/0.30 thf(f83,plain,(
% 0.08/0.30 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.08/0.30 inference(cnf_transformation,[],[f47])).
% 0.08/0.30 thf(f47,plain,(
% 0.08/0.30 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.08/0.30 inference(fool_elimination,[],[f46])).
% 0.08/0.30 thf(f46,plain,(
% 0.08/0.30 (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.08/0.30 inference(rectify,[],[f12])).
% 0.08/0.30 thf(f12,axiom,(
% 0.08/0.30 (mvalid = (^[X5 : $i > $o] : (! [X6] : (X5 @ X6))))),
% 0.08/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mvalid)).
% 0.08/0.30 thf(f81,plain,(
% 0.08/0.30 (iclval = (^[Y0 : $i > $o]: (mvalid @ Y0)))),
% 0.08/0.30 inference(cnf_transformation,[],[f52])).
% 0.08/0.30 thf(f52,plain,(
% 0.08/0.30 (iclval = (^[Y0 : $i > $o]: (mvalid @ Y0)))),
% 0.08/0.30 inference(fool_elimination,[],[f24])).
% 0.08/0.30 thf(f24,axiom,(
% 0.08/0.30 (iclval = (^[X0 : $i > $o] : (mvalid @ X0)))),
% 0.08/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',icl_s4_valid)).
% 0.08/0.30 thf(f79,plain,(
% 0.08/0.30 ((iclval @ (icl_says @ (icl_princ @ a) @ icl_false)) != $true)),
% 0.08/0.30 inference(cnf_transformation,[],[f72])).
% 0.08/0.30 thf(f72,plain,(
% 0.08/0.30 ((iclval @ (icl_says @ (icl_princ @ a) @ icl_false)) != $true)),
% 0.08/0.30 inference(flattening,[],[f71])).
% 0.08/0.30 thf(f71,plain,(
% 0.08/0.30 ~((iclval @ (icl_says @ (icl_princ @ a) @ icl_false)) = $true)),
% 0.08/0.30 inference(fool_elimination,[],[f70])).
% 0.08/0.30 thf(f70,plain,(
% 0.08/0.30 ~(iclval @ (icl_says @ (icl_princ @ a) @ icl_false))),
% 0.08/0.30 inference(rectify,[],[f27])).
% 0.08/0.30 thf(f27,negated_conjecture,(
% 0.08/0.30 ~(iclval @ (icl_says @ (icl_princ @ a) @ icl_false))),
% 0.08/0.30 inference(negated_conjecture,[],[f26])).
% 0.08/0.30 thf(f26,conjecture,(
% 0.08/0.30 (iclval @ (icl_says @ (icl_princ @ a) @ icl_false))),
% 0.08/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',untrust)).
% 0.08/0.30 % SZS output end Proof for theBenchmark
% 0.08/0.30 % (22963)------------------------------
% 0.08/0.30 % (22963)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.30 % (22963)Termination reason: Refutation
% 0.08/0.30
% 0.08/0.30 % (22963)Memory used [KB]: 5500
% 0.08/0.30 % (22963)Time elapsed: 0.005 s
% 0.08/0.30 % (22963)Instructions burned: 5 (million)
% 0.08/0.30 % (22963)------------------------------
% 0.08/0.30 % (22963)------------------------------
% 0.08/0.30 % (22956)Success in time 0.007 s
% 0.08/0.30 % Vampire---4.8 exiting
%------------------------------------------------------------------------------