TSTP Solution File: SYO471^6 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO471^6 : 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 : n002.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:05:14 EDT 2024
% Result : Theorem 0.10s 0.35s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SYO471^6 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.12 % 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.10/0.32 % Computer : n002.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon May 20 10:56:23 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.32 This is a TH0_THM_EQU_NAR problem
% 0.10/0.32 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.10/0.34 % (17642)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.10/0.34 % (17641)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.10/0.34 % (17640)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.10/0.34 % (17641)Instruction limit reached!
% 0.10/0.34 % (17641)------------------------------
% 0.10/0.34 % (17641)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.34 % (17641)Termination reason: Unknown
% 0.10/0.34 % (17641)Termination phase: Property scanning
% 0.10/0.34
% 0.10/0.34 % (17641)Memory used [KB]: 1023
% 0.10/0.34 % (17641)Time elapsed: 0.004 s
% 0.10/0.34 % (17641)Instructions burned: 5 (million)
% 0.10/0.34 % (17641)------------------------------
% 0.10/0.34 % (17641)------------------------------
% 0.10/0.34 % (17644)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.10/0.34 % (17645)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.10/0.34 % (17647)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.10/0.34 % (17646)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.10/0.34 % (17643)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.10/0.34 % (17644)Instruction limit reached!
% 0.10/0.34 % (17644)------------------------------
% 0.10/0.34 % (17644)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.34 % (17644)Termination reason: Unknown
% 0.10/0.34 % (17644)Termination phase: shuffling
% 0.10/0.34
% 0.10/0.34 % (17644)Memory used [KB]: 1023
% 0.10/0.34 % (17644)Time elapsed: 0.002 s
% 0.10/0.34 % (17644)Instructions burned: 2 (million)
% 0.10/0.34 % (17644)------------------------------
% 0.10/0.34 % (17644)------------------------------
% 0.10/0.34 % (17647)Instruction limit reached!
% 0.10/0.34 % (17647)------------------------------
% 0.10/0.34 % (17647)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.34 % (17647)Termination reason: Unknown
% 0.10/0.34 % (17647)Termination phase: shuffling
% 0.10/0.34
% 0.10/0.34 % (17647)Memory used [KB]: 1023
% 0.10/0.34 % (17647)Time elapsed: 0.003 s
% 0.10/0.34 % (17647)Instructions burned: 3 (million)
% 0.10/0.34 % (17647)------------------------------
% 0.10/0.34 % (17647)------------------------------
% 0.10/0.34 % (17643)Instruction limit reached!
% 0.10/0.34 % (17643)------------------------------
% 0.10/0.34 % (17643)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.34 % (17643)Termination reason: Unknown
% 0.10/0.34 % (17643)Termination phase: shuffling
% 0.10/0.34
% 0.10/0.34 % (17643)Memory used [KB]: 1023
% 0.10/0.34 % (17643)Time elapsed: 0.003 s
% 0.10/0.34 % (17643)Instructions burned: 3 (million)
% 0.10/0.34 % (17643)------------------------------
% 0.10/0.34 % (17643)------------------------------
% 0.10/0.35 % (17645)Refutation not found, incomplete strategy
% 0.10/0.35 % (17645)------------------------------
% 0.10/0.35 % (17645)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.35 % (17645)Termination reason: Refutation not found, incomplete strategy
% 0.10/0.35
% 0.10/0.35
% 0.10/0.35 % (17645)Memory used [KB]: 5628
% 0.10/0.35 % (17645)Time elapsed: 0.006 s
% 0.10/0.35 % (17645)Instructions burned: 9 (million)
% 0.10/0.35 % (17645)------------------------------
% 0.10/0.35 % (17645)------------------------------
% 0.10/0.35 % (17640)First to succeed.
% 0.10/0.35 % (17642)Instruction limit reached!
% 0.10/0.35 % (17642)------------------------------
% 0.10/0.35 % (17642)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.35 % (17642)Termination reason: Unknown
% 0.10/0.35 % (17642)Termination phase: Saturation
% 0.10/0.35
% 0.10/0.35 % (17642)Memory used [KB]: 5628
% 0.10/0.35 % (17642)Time elapsed: 0.013 s
% 0.10/0.35 % (17642)Instructions burned: 28 (million)
% 0.10/0.35 % (17642)------------------------------
% 0.10/0.35 % (17642)------------------------------
% 0.10/0.35 % (17640)Refutation found. Thanks to Tanya!
% 0.10/0.35 % SZS status Theorem for theBenchmark
% 0.10/0.35 % SZS output start Proof for theBenchmark
% 0.10/0.35 thf(type_def_5, type, mu: $tType).
% 0.10/0.35 thf(func_def_0, type, mu: $tType).
% 0.10/0.35 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.10/0.35 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_15, type, mtrue: $i > $o).
% 0.10/0.35 thf(func_def_16, type, mfalse: $i > $o).
% 0.10/0.35 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.10/0.35 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.10/0.35 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.10/0.35 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.10/0.35 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.10/0.35 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.10/0.35 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.10/0.35 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.10/0.35 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.10/0.35 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.10/0.35 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.10/0.35 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.10/0.35 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.10/0.35 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.10/0.35 thf(func_def_33, type, rel_s5: $i > $i > $o).
% 0.10/0.35 thf(func_def_34, type, mbox_s5: ($i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_35, type, mdia_s5: ($i > $o) > $i > $o).
% 0.10/0.35 thf(func_def_36, type, p: $i > $o).
% 0.10/0.35 thf(f398,plain,(
% 0.10/0.35 $false),
% 0.10/0.35 inference(avatar_sat_refutation,[],[f384,f390,f397])).
% 0.10/0.35 thf(f397,plain,(
% 0.10/0.35 ~spl0_1),
% 0.10/0.35 inference(avatar_contradiction_clause,[],[f396])).
% 0.10/0.35 thf(f396,plain,(
% 0.10/0.35 $false | ~spl0_1),
% 0.10/0.35 inference(trivial_inequality_removal,[],[f393])).
% 0.10/0.35 thf(f393,plain,(
% 0.10/0.35 ($false = $true) | ~spl0_1),
% 0.10/0.35 inference(superposition,[],[f308,f378])).
% 0.10/0.35 thf(f378,plain,(
% 0.10/0.35 ($false = (rel_s5 @ sK4 @ sK2)) | ~spl0_1),
% 0.10/0.35 inference(avatar_component_clause,[],[f376])).
% 0.10/0.35 thf(f376,plain,(
% 0.10/0.35 spl0_1 <=> ($false = (rel_s5 @ sK4 @ sK2))),
% 0.10/0.35 introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.10/0.35 thf(f308,plain,(
% 0.10/0.35 ((rel_s5 @ sK4 @ sK2) = $true)),
% 0.10/0.35 inference(trivial_inequality_removal,[],[f301])).
% 0.10/0.35 thf(f301,plain,(
% 0.10/0.35 ($false = $true) | ((rel_s5 @ sK4 @ sK2) = $true)),
% 0.10/0.35 inference(superposition,[],[f226,f256])).
% 0.10/0.35 thf(f256,plain,(
% 0.10/0.35 ( ! [X0 : $i] : (($false = (rel_s5 @ X0 @ sK1)) | ((rel_s5 @ X0 @ sK2) = $true)) )),
% 0.10/0.35 inference(trivial_inequality_removal,[],[f239])).
% 0.10/0.35 thf(f239,plain,(
% 0.10/0.35 ( ! [X0 : $i] : (($false = (rel_s5 @ X0 @ sK1)) | ($false = $true) | ((rel_s5 @ X0 @ sK2) = $true)) )),
% 0.10/0.35 inference(superposition,[],[f173,f185])).
% 0.10/0.35 thf(f185,plain,(
% 0.10/0.35 ((rel_s5 @ sK1 @ sK2) = $true)),
% 0.10/0.35 inference(not_proxy_clausification,[],[f184])).
% 0.10/0.35 thf(f184,plain,(
% 0.10/0.35 ($false = (~ (rel_s5 @ sK1 @ sK2)))),
% 0.10/0.35 inference(binary_proxy_clausification,[],[f182])).
% 0.10/0.35 thf(f182,plain,(
% 0.10/0.35 ($false = ((~ (rel_s5 @ sK1 @ sK2)) | (!! @ $i @ (^[Y0 : $i]: ((~ (rel_s5 @ sK2 @ Y0)) | (~ (p @ Y0)))))))),
% 0.10/0.35 inference(beta_eta_normalization,[],[f181])).
% 0.10/0.35 thf(f181,plain,(
% 0.10/0.35 ($false = ((^[Y0 : $i]: ((~ (rel_s5 @ sK1 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (~ (p @ Y1))))))) @ sK2))),
% 0.10/0.35 inference(sigma_clausification,[],[f180])).
% 0.10/0.35 thf(f180,plain,(
% 0.10/0.35 ($false = (!! @ $i @ (^[Y0 : $i]: ((~ (rel_s5 @ sK1 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (~ (p @ Y1)))))))))),
% 0.10/0.35 inference(binary_proxy_clausification,[],[f178])).
% 0.10/0.35 thf(f178,plain,(
% 0.10/0.35 ($false = ((!! @ $i @ (^[Y0 : $i]: ((~ (rel_s5 @ sK1 @ Y0)) | (!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (~ (p @ Y1)))))))) | (!! @ $i @ (^[Y0 : $i]: ((~ (rel_s5 @ sK1 @ Y0)) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (~ (p @ Y1)))))))))))),
% 0.10/0.35 inference(beta_eta_normalization,[],[f177])).
% 0.10/0.35 thf(f177,plain,(
% 0.10/0.35 ($false = ((^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y1 @ Y2)) | (~ (p @ Y2)))))))) | (!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (~ (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y1 @ Y2)) | (~ (p @ Y2))))))))))) @ sK1))),
% 0.10/0.35 inference(sigma_clausification,[],[f176])).
% 0.10/0.35 thf(f176,plain,(
% 0.10/0.35 ((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y1 @ Y2)) | (~ (p @ Y2)))))))) | (!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (~ (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y1 @ Y2)) | (~ (p @ Y2)))))))))))) != $true)),
% 0.10/0.35 inference(boolean_simplification,[],[f175])).
% 0.10/0.35 thf(f175,plain,(
% 0.10/0.35 ((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (~ (~ (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y1 @ Y2)) | (~ (p @ Y2)))))))))) | (!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (~ (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y1 @ Y2)) | (~ (p @ Y2)))))))))))) != $true)),
% 0.10/0.35 inference(boolean_simplification,[],[f174])).
% 0.10/0.35 thf(f174,plain,(
% 0.10/0.35 ((!! @ $i @ (^[Y0 : $i]: ((~ (~ (!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (~ (~ (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y1 @ Y2)) | (~ (p @ Y2)))))))))))) | (!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (~ (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y1 @ Y2)) | (~ (p @ Y2)))))))))))) != $true)),
% 0.10/0.35 inference(beta_eta_normalization,[],[f159])).
% 0.10/0.35 thf(f159,plain,(
% 0.10/0.35 (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (rel_s5 @ Y2 @ Y3)) | (Y1 @ Y3))))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ Y0)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (rel_s5 @ Y2 @ Y3)) | (Y1 @ Y3))))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ Y0)))) @ p)) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y1 @ Y2)) | (Y0 @ Y2))))))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (rel_s5 @ Y2 @ Y3)) | (Y1 @ Y3))))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ Y0)))) @ p)))) != $true)),
% 0.10/0.35 inference(definition_unfolding,[],[f115,f134,f149,f157,f157,f127,f157])).
% 0.10/0.35 thf(f127,plain,(
% 0.10/0.35 (mbox_s5 = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y1 @ Y2)) | (Y0 @ Y2))))))))),
% 0.10/0.35 inference(cnf_transformation,[],[f52])).
% 0.10/0.35 thf(f52,plain,(
% 0.10/0.35 (mbox_s5 = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_s5 @ Y1 @ Y2)) | (Y0 @ Y2))))))))),
% 0.10/0.35 inference(fool_elimination,[],[f51])).
% 0.10/0.35 thf(f51,plain,(
% 0.10/0.35 (mbox_s5 = (^[X0 : $i > $o, X1 : $i] : (! [X2] : ((X0 @ X2) | ~(rel_s5 @ X1 @ X2)))))),
% 0.10/0.35 inference(rectify,[],[f32])).
% 0.10/0.35 thf(f32,axiom,(
% 0.10/0.35 (mbox_s5 = (^[X3 : $i > $o, X2 : $i] : (! [X7] : ((X3 @ X7) | ~(rel_s5 @ X2 @ X7)))))),
% 0.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox_s5)).
% 0.10/0.35 thf(f157,plain,(
% 0.10/0.35 (mdia_s5 = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (rel_s5 @ Y2 @ Y3)) | (Y1 @ Y3))))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ Y0)))))),
% 0.10/0.35 inference(definition_unfolding,[],[f122,f113,f127,f113])).
% 0.10/0.35 thf(f113,plain,(
% 0.10/0.35 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.10/0.35 inference(cnf_transformation,[],[f74])).
% 0.10/0.35 thf(f74,plain,(
% 0.10/0.35 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.10/0.35 inference(fool_elimination,[],[f73])).
% 0.10/0.35 thf(f73,plain,(
% 0.10/0.35 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.10/0.35 inference(rectify,[],[f3])).
% 0.10/0.35 thf(f3,axiom,(
% 0.10/0.35 (mnot = (^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))))),
% 0.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.10/0.35 thf(f122,plain,(
% 0.10/0.35 (mdia_s5 = (^[Y0 : $i > $o]: (mnot @ (mbox_s5 @ (mnot @ Y0)))))),
% 0.10/0.35 inference(cnf_transformation,[],[f68])).
% 0.10/0.35 thf(f68,plain,(
% 0.10/0.35 (mdia_s5 = (^[Y0 : $i > $o]: (mnot @ (mbox_s5 @ (mnot @ Y0)))))),
% 0.10/0.35 inference(fool_elimination,[],[f67])).
% 0.10/0.35 thf(f67,plain,(
% 0.10/0.35 ((^[X0 : $i > $o] : (mnot @ (mbox_s5 @ (mnot @ X0)))) = mdia_s5)),
% 0.10/0.35 inference(rectify,[],[f33])).
% 0.10/0.35 thf(f33,axiom,(
% 0.10/0.35 ((^[X3 : $i > $o] : (mnot @ (mbox_s5 @ (mnot @ X3)))) = mdia_s5)),
% 0.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mdia_s5)).
% 0.10/0.35 thf(f149,plain,(
% 0.10/0.35 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))))),
% 0.10/0.35 inference(definition_unfolding,[],[f147,f135,f113])).
% 0.10/0.35 thf(f135,plain,(
% 0.10/0.35 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.10/0.35 inference(cnf_transformation,[],[f76])).
% 0.10/0.35 thf(f76,plain,(
% 0.10/0.35 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.10/0.35 inference(fool_elimination,[],[f75])).
% 0.10/0.35 thf(f75,plain,(
% 0.10/0.35 (mor = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X1 @ X2) | (X0 @ X2))))),
% 0.10/0.35 inference(rectify,[],[f4])).
% 0.10/0.35 thf(f4,axiom,(
% 0.10/0.35 (mor = (^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X4 @ X2) | (X3 @ X2))))),
% 0.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.10/0.35 thf(f147,plain,(
% 0.10/0.35 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.10/0.35 inference(cnf_transformation,[],[f58])).
% 0.10/0.35 thf(f58,plain,(
% 0.10/0.35 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.10/0.35 inference(fool_elimination,[],[f57])).
% 0.10/0.35 thf(f57,plain,(
% 0.10/0.35 ((^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)) = mimplies)),
% 0.10/0.35 inference(rectify,[],[f6])).
% 0.10/0.35 thf(f6,axiom,(
% 0.10/0.35 ((^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)) = mimplies)),
% 0.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies)).
% 0.10/0.35 thf(f134,plain,(
% 0.10/0.35 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.10/0.35 inference(cnf_transformation,[],[f48])).
% 0.10/0.35 thf(f48,plain,(
% 0.10/0.35 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.10/0.35 inference(fool_elimination,[],[f47])).
% 0.10/0.35 thf(f47,plain,(
% 0.10/0.35 (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.10/0.35 inference(rectify,[],[f28])).
% 0.10/0.35 thf(f28,axiom,(
% 0.10/0.35 (mvalid = (^[X3 : $i > $o] : (! [X2] : (X3 @ X2))))),
% 0.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.10/0.35 thf(f115,plain,(
% 0.10/0.35 ((mvalid @ (mimplies @ (mdia_s5 @ (mdia_s5 @ p)) @ (mbox_s5 @ (mdia_s5 @ p)))) != $true)),
% 0.10/0.35 inference(cnf_transformation,[],[f110])).
% 0.10/0.35 thf(f110,plain,(
% 0.10/0.35 ((mvalid @ (mimplies @ (mdia_s5 @ (mdia_s5 @ p)) @ (mbox_s5 @ (mdia_s5 @ p)))) != $true)),
% 0.10/0.35 inference(flattening,[],[f99])).
% 0.10/0.35 thf(f99,plain,(
% 0.10/0.35 ~((mvalid @ (mimplies @ (mdia_s5 @ (mdia_s5 @ p)) @ (mbox_s5 @ (mdia_s5 @ p)))) = $true)),
% 0.10/0.35 inference(fool_elimination,[],[f98])).
% 0.10/0.35 thf(f98,plain,(
% 0.10/0.35 ~(mvalid @ (mimplies @ (mdia_s5 @ (mdia_s5 @ p)) @ (mbox_s5 @ (mdia_s5 @ p))))),
% 0.10/0.35 inference(rectify,[],[f38])).
% 0.10/0.35 thf(f38,negated_conjecture,(
% 0.10/0.35 ~(mvalid @ (mimplies @ (mdia_s5 @ (mdia_s5 @ p)) @ (mbox_s5 @ (mdia_s5 @ p))))),
% 0.10/0.35 inference(negated_conjecture,[],[f37])).
% 0.10/0.35 thf(f37,conjecture,(
% 0.10/0.35 (mvalid @ (mimplies @ (mdia_s5 @ (mdia_s5 @ p)) @ (mbox_s5 @ (mdia_s5 @ p))))),
% 0.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)).
% 0.10/0.35 thf(f173,plain,(
% 0.10/0.35 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($false = (rel_s5 @ X2 @ X3)) | ($false = (rel_s5 @ X1 @ X2)) | ((rel_s5 @ X1 @ X3) = $true)) )),
% 0.10/0.35 inference(binary_proxy_clausification,[],[f172])).
% 0.10/0.35 thf(f172,plain,(
% 0.10/0.35 ( ! [X2 : $i,X3 : $i,X1 : $i] : (((rel_s5 @ X1 @ X3) = $true) | ($false = ((rel_s5 @ X1 @ X2) & (rel_s5 @ X2 @ X3)))) )),
% 0.10/0.35 inference(binary_proxy_clausification,[],[f171])).
% 0.10/0.35 thf(f171,plain,(
% 0.10/0.35 ( ! [X2 : $i,X3 : $i,X1 : $i] : (((((rel_s5 @ X1 @ X2) & (rel_s5 @ X2 @ X3)) => (rel_s5 @ X1 @ X3)) = $true)) )),
% 0.10/0.35 inference(beta_eta_normalization,[],[f170])).
% 0.10/0.35 thf(f170,plain,(
% 0.10/0.35 ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((^[Y0 : $i]: (((rel_s5 @ X1 @ X2) & (rel_s5 @ X2 @ Y0)) => (rel_s5 @ X1 @ Y0))) @ X3) = $true)) )),
% 0.10/0.35 inference(pi_clausification,[],[f169])).
% 0.10/0.35 thf(f169,plain,(
% 0.10/0.35 ( ! [X2 : $i,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (((rel_s5 @ X1 @ X2) & (rel_s5 @ X2 @ Y0)) => (rel_s5 @ X1 @ Y0)))) = $true)) )),
% 0.10/0.35 inference(beta_eta_normalization,[],[f168])).
% 0.10/0.35 thf(f168,plain,(
% 0.10/0.35 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((rel_s5 @ X1 @ Y0) & (rel_s5 @ Y0 @ Y1)) => (rel_s5 @ X1 @ Y1))))) @ X2) = $true)) )),
% 0.10/0.35 inference(pi_clausification,[],[f167])).
% 0.10/0.35 thf(f167,plain,(
% 0.10/0.35 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((rel_s5 @ X1 @ Y0) & (rel_s5 @ Y0 @ Y1)) => (rel_s5 @ X1 @ Y1)))))) = $true)) )),
% 0.10/0.35 inference(beta_eta_normalization,[],[f166])).
% 0.10/0.35 thf(f166,plain,(
% 0.10/0.35 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((rel_s5 @ Y0 @ Y1) & (rel_s5 @ Y1 @ Y2)) => (rel_s5 @ Y0 @ Y2))))))) @ X1) = $true)) )),
% 0.10/0.35 inference(pi_clausification,[],[f165])).
% 0.10/0.35 thf(f165,plain,(
% 0.10/0.35 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((rel_s5 @ Y0 @ Y1) & (rel_s5 @ Y1 @ Y2)) => (rel_s5 @ Y0 @ Y2)))))))) = $true)),
% 0.10/0.35 inference(beta_eta_normalization,[],[f160])).
% 0.10/0.35 thf(f160,plain,(
% 0.10/0.35 ($true = ((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y1 @ Y2) & (Y0 @ Y2 @ Y3)) => (Y0 @ Y1 @ Y3))))))))) @ rel_s5))),
% 0.10/0.35 inference(definition_unfolding,[],[f123,f145])).
% 0.10/0.35 thf(f145,plain,(
% 0.10/0.35 (mtransitive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y1 @ Y2) & (Y0 @ Y2 @ Y3)) => (Y0 @ Y1 @ Y3))))))))))),
% 0.10/0.35 inference(cnf_transformation,[],[f90])).
% 0.10/0.35 thf(f90,plain,(
% 0.10/0.35 (mtransitive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y1 @ Y2) & (Y0 @ Y2 @ Y3)) => (Y0 @ Y1 @ Y3))))))))))),
% 0.10/0.35 inference(fool_elimination,[],[f89])).
% 0.10/0.35 thf(f89,plain,(
% 0.10/0.35 (mtransitive = (^[X0 : $i > $i > $o] : (! [X1,X2,X3] : (((X0 @ X2 @ X1) & (X0 @ X3 @ X2)) => (X0 @ X3 @ X1)))))),
% 0.10/0.35 inference(rectify,[],[f21])).
% 0.10/0.35 thf(f21,axiom,(
% 0.10/0.35 (mtransitive = (^[X6 : $i > $i > $o] : (! [X10,X9,X8] : (((X6 @ X9 @ X10) & (X6 @ X8 @ X9)) => (X6 @ X8 @ X10)))))),
% 0.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mtransitive)).
% 0.10/0.35 thf(f123,plain,(
% 0.10/0.35 ((mtransitive @ rel_s5) = $true)),
% 0.10/0.35 inference(cnf_transformation,[],[f66])).
% 0.10/0.35 thf(f66,plain,(
% 0.10/0.35 ((mtransitive @ rel_s5) = $true)),
% 0.10/0.35 inference(fool_elimination,[],[f65])).
% 0.10/0.35 thf(f65,plain,(
% 0.10/0.35 (mtransitive @ rel_s5)),
% 0.10/0.35 inference(rectify,[],[f35])).
% 0.10/0.35 thf(f35,axiom,(
% 0.10/0.35 (mtransitive @ rel_s5)),
% 0.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a2)).
% 0.10/0.35 thf(f226,plain,(
% 0.10/0.35 ((rel_s5 @ sK4 @ sK1) = $true)),
% 0.10/0.35 inference(trivial_inequality_removal,[],[f216])).
% 0.10/0.35 thf(f216,plain,(
% 0.10/0.35 ((rel_s5 @ sK4 @ sK1) = $true) | ($false = $true)),
% 0.10/0.35 inference(superposition,[],[f208,f196])).
% 0.10/0.35 thf(f196,plain,(
% 0.10/0.35 ((rel_s5 @ sK1 @ sK4) = $true)),
% 0.10/0.35 inference(not_proxy_clausification,[],[f195])).
% 0.10/0.35 thf(f195,plain,(
% 0.10/0.35 ($false = (~ (rel_s5 @ sK1 @ sK4)))),
% 0.10/0.35 inference(binary_proxy_clausification,[],[f193])).
% 0.10/0.35 thf(f193,plain,(
% 0.10/0.35 ($false = ((~ (rel_s5 @ sK1 @ sK4)) | (~ (!! @ $i @ (^[Y0 : $i]: ((~ (rel_s5 @ sK4 @ Y0)) | (~ (p @ Y0))))))))),
% 0.10/0.35 inference(beta_eta_normalization,[],[f192])).
% 0.10/0.35 thf(f192,plain,(
% 0.10/0.35 ($false = ((^[Y0 : $i]: ((~ (rel_s5 @ sK1 @ Y0)) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (~ (p @ Y1)))))))) @ sK4))),
% 0.10/0.35 inference(sigma_clausification,[],[f179])).
% 0.10/0.35 thf(f179,plain,(
% 0.10/0.35 ($false = (!! @ $i @ (^[Y0 : $i]: ((~ (rel_s5 @ sK1 @ Y0)) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ (rel_s5 @ Y0 @ Y1)) | (~ (p @ Y1))))))))))),
% 0.10/0.35 inference(binary_proxy_clausification,[],[f178])).
% 0.10/0.35 thf(f208,plain,(
% 0.10/0.35 ( ! [X2 : $i,X1 : $i] : (($false = (rel_s5 @ X1 @ X2)) | ((rel_s5 @ X2 @ X1) = $true)) )),
% 0.10/0.35 inference(binary_proxy_clausification,[],[f207])).
% 0.10/0.35 thf(f207,plain,(
% 0.10/0.35 ( ! [X2 : $i,X1 : $i] : ((((rel_s5 @ X1 @ X2) => (rel_s5 @ X2 @ X1)) = $true)) )),
% 0.10/0.35 inference(beta_eta_normalization,[],[f206])).
% 0.10/0.35 thf(f206,plain,(
% 0.10/0.35 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((rel_s5 @ X1 @ Y0) => (rel_s5 @ Y0 @ X1))) @ X2) = $true)) )),
% 0.10/0.35 inference(pi_clausification,[],[f205])).
% 0.10/0.35 thf(f205,plain,(
% 0.10/0.35 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((rel_s5 @ X1 @ Y0) => (rel_s5 @ Y0 @ X1)))) = $true)) )),
% 0.10/0.35 inference(beta_eta_normalization,[],[f204])).
% 0.10/0.35 thf(f204,plain,(
% 0.10/0.35 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((rel_s5 @ Y0 @ Y1) => (rel_s5 @ Y1 @ Y0))))) @ X1) = $true)) )),
% 0.10/0.35 inference(pi_clausification,[],[f203])).
% 0.10/0.35 thf(f203,plain,(
% 0.10/0.35 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((rel_s5 @ Y0 @ Y1) => (rel_s5 @ Y1 @ Y0)))))) = $true)),
% 0.10/0.35 inference(beta_eta_normalization,[],[f158])).
% 0.10/0.35 thf(f158,plain,(
% 0.10/0.35 (((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y1 @ Y2) => (Y0 @ Y2 @ Y1))))))) @ rel_s5) = $true)),
% 0.10/0.35 inference(definition_unfolding,[],[f114,f120])).
% 0.10/0.35 thf(f120,plain,(
% 0.10/0.35 (msymmetric = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y1 @ Y2) => (Y0 @ Y2 @ Y1))))))))),
% 0.10/0.35 inference(cnf_transformation,[],[f88])).
% 0.10/0.35 thf(f88,plain,(
% 0.10/0.35 (msymmetric = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y1 @ Y2) => (Y0 @ Y2 @ Y1))))))))),
% 0.10/0.35 inference(fool_elimination,[],[f87])).
% 0.10/0.35 thf(f87,plain,(
% 0.10/0.35 ((^[X0 : $i > $i > $o] : (! [X1,X2] : ((X0 @ X2 @ X1) => (X0 @ X1 @ X2)))) = msymmetric)),
% 0.10/0.35 inference(rectify,[],[f19])).
% 0.10/0.35 thf(f19,axiom,(
% 0.10/0.35 ((^[X6 : $i > $i > $o] : (! [X9,X8] : ((X6 @ X8 @ X9) => (X6 @ X9 @ X8)))) = msymmetric)),
% 0.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',msymmetric)).
% 0.10/0.35 thf(f114,plain,(
% 0.10/0.35 ((msymmetric @ rel_s5) = $true)),
% 0.10/0.35 inference(cnf_transformation,[],[f72])).
% 0.10/0.35 thf(f72,plain,(
% 0.10/0.35 ((msymmetric @ rel_s5) = $true)),
% 0.10/0.35 inference(fool_elimination,[],[f71])).
% 0.10/0.35 thf(f71,plain,(
% 0.10/0.35 (msymmetric @ rel_s5)),
% 0.10/0.35 inference(rectify,[],[f36])).
% 0.10/0.35 thf(f36,axiom,(
% 0.10/0.35 (msymmetric @ rel_s5)),
% 0.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3)).
% 0.10/0.35 thf(f390,plain,(
% 0.10/0.35 ~spl0_2),
% 0.10/0.35 inference(avatar_contradiction_clause,[],[f389])).
% 0.10/0.35 thf(f389,plain,(
% 0.10/0.35 $false | ~spl0_2),
% 0.10/0.35 inference(trivial_inequality_removal,[],[f385])).
% 0.10/0.35 thf(f385,plain,(
% 0.10/0.35 ($false = $true) | ~spl0_2),
% 0.10/0.35 inference(superposition,[],[f382,f191])).
% 0.10/0.35 thf(f191,plain,(
% 0.10/0.35 ((p @ sK3) = $true)),
% 0.10/0.35 inference(not_proxy_clausification,[],[f188])).
% 0.10/0.35 thf(f188,plain,(
% 0.10/0.35 ($false = (~ (p @ sK3)))),
% 0.10/0.35 inference(binary_proxy_clausification,[],[f187])).
% 0.10/0.35 thf(f187,plain,(
% 0.10/0.35 ($false = ((~ (rel_s5 @ sK2 @ sK3)) | (~ (p @ sK3))))),
% 0.10/0.35 inference(beta_eta_normalization,[],[f186])).
% 0.10/0.35 thf(f186,plain,(
% 0.10/0.35 ($false = ((^[Y0 : $i]: ((~ (rel_s5 @ sK2 @ Y0)) | (~ (p @ Y0)))) @ sK3))),
% 0.10/0.35 inference(sigma_clausification,[],[f183])).
% 0.10/0.35 thf(f183,plain,(
% 0.10/0.35 ($false = (!! @ $i @ (^[Y0 : $i]: ((~ (rel_s5 @ sK2 @ Y0)) | (~ (p @ Y0))))))),
% 0.10/0.35 inference(binary_proxy_clausification,[],[f182])).
% 0.10/0.35 thf(f382,plain,(
% 0.10/0.35 ($false = (p @ sK3)) | ~spl0_2),
% 0.10/0.35 inference(avatar_component_clause,[],[f380])).
% 0.10/0.35 thf(f380,plain,(
% 0.10/0.35 spl0_2 <=> ($false = (p @ sK3))),
% 0.10/0.35 introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.10/0.35 thf(f384,plain,(
% 0.10/0.35 spl0_2 | spl0_1),
% 0.10/0.35 inference(avatar_split_clause,[],[f368,f376,f380])).
% 0.10/0.35 thf(f368,plain,(
% 0.10/0.35 ($false = (rel_s5 @ sK4 @ sK2)) | ($false = (p @ sK3))),
% 0.10/0.35 inference(trivial_inequality_removal,[],[f360])).
% 0.10/0.35 thf(f360,plain,(
% 0.10/0.35 ($false = (rel_s5 @ sK4 @ sK2)) | ($false = $true) | ($false = (p @ sK3))),
% 0.10/0.35 inference(superposition,[],[f257,f202])).
% 0.10/0.35 thf(f202,plain,(
% 0.10/0.35 ( ! [X1 : $i] : (($false = (rel_s5 @ sK4 @ X1)) | ($false = (p @ X1))) )),
% 0.10/0.35 inference(not_proxy_clausification,[],[f201])).
% 0.10/0.35 thf(f201,plain,(
% 0.10/0.35 ( ! [X1 : $i] : (((~ (p @ X1)) = $true) | ($false = (rel_s5 @ sK4 @ X1))) )),
% 0.10/0.35 inference(not_proxy_clausification,[],[f200])).
% 0.10/0.35 thf(f200,plain,(
% 0.10/0.35 ( ! [X1 : $i] : (((~ (rel_s5 @ sK4 @ X1)) = $true) | ((~ (p @ X1)) = $true)) )),
% 0.10/0.35 inference(binary_proxy_clausification,[],[f199])).
% 0.10/0.35 thf(f199,plain,(
% 0.10/0.35 ( ! [X1 : $i] : ((((~ (rel_s5 @ sK4 @ X1)) | (~ (p @ X1))) = $true)) )),
% 0.10/0.35 inference(beta_eta_normalization,[],[f198])).
% 0.10/0.35 thf(f198,plain,(
% 0.10/0.35 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((~ (rel_s5 @ sK4 @ Y0)) | (~ (p @ Y0)))) @ X1))) )),
% 0.10/0.35 inference(pi_clausification,[],[f197])).
% 0.10/0.35 thf(f197,plain,(
% 0.10/0.35 ($true = (!! @ $i @ (^[Y0 : $i]: ((~ (rel_s5 @ sK4 @ Y0)) | (~ (p @ Y0))))))),
% 0.10/0.35 inference(not_proxy_clausification,[],[f194])).
% 0.10/0.35 thf(f194,plain,(
% 0.10/0.35 ($false = (~ (!! @ $i @ (^[Y0 : $i]: ((~ (rel_s5 @ sK4 @ Y0)) | (~ (p @ Y0)))))))),
% 0.10/0.35 inference(binary_proxy_clausification,[],[f193])).
% 0.10/0.35 thf(f257,plain,(
% 0.10/0.35 ( ! [X0 : $i] : (($true = (rel_s5 @ X0 @ sK3)) | ($false = (rel_s5 @ X0 @ sK2))) )),
% 0.10/0.35 inference(trivial_inequality_removal,[],[f245])).
% 0.10/0.35 thf(f245,plain,(
% 0.10/0.35 ( ! [X0 : $i] : (($false = (rel_s5 @ X0 @ sK2)) | ($true = (rel_s5 @ X0 @ sK3)) | ($false = $true)) )),
% 0.10/0.35 inference(superposition,[],[f190,f173])).
% 0.10/0.35 thf(f190,plain,(
% 0.10/0.35 ($true = (rel_s5 @ sK2 @ sK3))),
% 0.10/0.35 inference(not_proxy_clausification,[],[f189])).
% 0.10/0.35 thf(f189,plain,(
% 0.10/0.35 ($false = (~ (rel_s5 @ sK2 @ sK3)))),
% 0.10/0.35 inference(binary_proxy_clausification,[],[f187])).
% 0.10/0.35 % SZS output end Proof for theBenchmark
% 0.10/0.35 % (17640)------------------------------
% 0.10/0.35 % (17640)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.35 % (17640)Termination reason: Refutation
% 0.10/0.35
% 0.10/0.35 % (17640)Memory used [KB]: 5756
% 0.10/0.35 % (17640)Time elapsed: 0.011 s
% 0.10/0.35 % (17640)Instructions burned: 24 (million)
% 0.10/0.35 % (17640)------------------------------
% 0.10/0.35 % (17640)------------------------------
% 0.10/0.35 % (17639)Success in time 0.018 s
% 0.10/0.35 % Vampire---4.8 exiting
%------------------------------------------------------------------------------