TSTP Solution File: SYO397^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO397^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/sandbox2/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:04:17 EDT 2024
% Result : Theorem 0.21s 0.39s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYO397^1 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.15 % 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.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 09:21:23 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.14/0.37 This is a TH0_THM_EQU_NAR problem
% 0.21/0.37 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.21/0.38 % (13362)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.21/0.39 % (13367)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.21/0.39 % (13369)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.21/0.39 % (13366)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.21/0.39 % (13368)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.39 % (13366)Instruction limit reached!
% 0.21/0.39 % (13366)------------------------------
% 0.21/0.39 % (13366)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (13366)Termination reason: Unknown
% 0.21/0.39 % (13366)Termination phase: shuffling
% 0.21/0.39
% 0.21/0.39 % (13366)Memory used [KB]: 1023
% 0.21/0.39 % (13366)Time elapsed: 0.003 s
% 0.21/0.39 % (13366)Instructions burned: 2 (million)
% 0.21/0.39 % (13366)------------------------------
% 0.21/0.39 % (13366)------------------------------
% 0.21/0.39 % (13369)Instruction limit reached!
% 0.21/0.39 % (13369)------------------------------
% 0.21/0.39 % (13369)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (13369)Termination reason: Unknown
% 0.21/0.39 % (13369)Termination phase: shuffling
% 0.21/0.39
% 0.21/0.39 % (13369)Memory used [KB]: 1023
% 0.21/0.39 % (13369)Time elapsed: 0.003 s
% 0.21/0.39 % (13369)Instructions burned: 3 (million)
% 0.21/0.39 % (13369)------------------------------
% 0.21/0.39 % (13369)------------------------------
% 0.21/0.39 % (13364)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.21/0.39 % (13365)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.39 % (13363)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.21/0.39 % (13365)Instruction limit reached!
% 0.21/0.39 % (13365)------------------------------
% 0.21/0.39 % (13365)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (13365)Termination reason: Unknown
% 0.21/0.39 % (13365)Termination phase: shuffling
% 0.21/0.39
% 0.21/0.39 % (13365)Memory used [KB]: 1023
% 0.21/0.39 % (13365)Time elapsed: 0.004 s
% 0.21/0.39 % (13365)Instructions burned: 2 (million)
% 0.21/0.39 % (13365)------------------------------
% 0.21/0.39 % (13365)------------------------------
% 0.21/0.39 % (13363)Instruction limit reached!
% 0.21/0.39 % (13363)------------------------------
% 0.21/0.39 % (13363)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (13363)Termination reason: Unknown
% 0.21/0.39 % (13363)Termination phase: Property scanning
% 0.21/0.39
% 0.21/0.39 % (13363)Memory used [KB]: 1023
% 0.21/0.39 % (13363)Time elapsed: 0.003 s
% 0.21/0.39 % (13363)Instructions burned: 5 (million)
% 0.21/0.39 % (13363)------------------------------
% 0.21/0.39 % (13363)------------------------------
% 0.21/0.39 % (13367)Refutation not found, incomplete strategy
% 0.21/0.39 % (13367)------------------------------
% 0.21/0.39 % (13367)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (13367)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.39
% 0.21/0.39
% 0.21/0.39 % (13367)Memory used [KB]: 5628
% 0.21/0.39 % (13367)Time elapsed: 0.006 s
% 0.21/0.39 % (13367)Instructions burned: 7 (million)
% 0.21/0.39 % (13367)------------------------------
% 0.21/0.39 % (13367)------------------------------
% 0.21/0.39 % (13362)First to succeed.
% 0.21/0.39 % (13368)Also succeeded, but the first one will report.
% 0.21/0.39 % (13362)Refutation found. Thanks to Tanya!
% 0.21/0.39 % SZS status Theorem for theBenchmark
% 0.21/0.39 % SZS output start Proof for theBenchmark
% 0.21/0.39 thf(type_def_5, type, mu: $tType).
% 0.21/0.39 thf(func_def_0, type, mu: $tType).
% 0.21/0.39 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.21/0.39 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.39 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.21/0.39 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.39 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.39 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.39 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.39 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.39 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.39 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.21/0.39 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.21/0.39 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.21/0.39 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.21/0.39 thf(func_def_15, type, mtrue: $i > $o).
% 0.21/0.39 thf(func_def_16, type, mfalse: $i > $o).
% 0.21/0.39 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.21/0.39 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.21/0.39 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.21/0.39 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.21/0.39 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.21/0.39 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.21/0.39 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.21/0.39 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.21/0.39 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.21/0.39 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.21/0.39 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.21/0.39 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.21/0.39 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.21/0.39 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.21/0.39 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.21/0.39 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.21/0.39 thf(func_def_33, type, rel_k: $i > $i > $o).
% 0.21/0.40 thf(func_def_34, type, mbox_k: ($i > $o) > $i > $o).
% 0.21/0.40 thf(func_def_35, type, mdia_k: ($i > $o) > $i > $o).
% 0.21/0.40 thf(func_def_36, type, p: $i > $o).
% 0.21/0.40 thf(func_def_37, type, q: $i > $o).
% 0.21/0.40 thf(f171,plain,(
% 0.21/0.40 $false),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f169])).
% 0.21/0.40 thf(f169,plain,(
% 0.21/0.40 ($false = $true)),
% 0.21/0.40 inference(superposition,[],[f168,f157])).
% 0.21/0.40 thf(f157,plain,(
% 0.21/0.40 ((p @ sK2) = $false)),
% 0.21/0.40 inference(binary_proxy_clausification,[],[f155])).
% 0.21/0.40 thf(f155,plain,(
% 0.21/0.40 (((p @ sK2) | (~ (q @ sK2))) = $false)),
% 0.21/0.40 inference(binary_proxy_clausification,[],[f153])).
% 0.21/0.40 thf(f153,plain,(
% 0.21/0.40 ($false = (((p @ sK2) | (~ (q @ sK2))) | (~ (rel_k @ sK1 @ sK2))))),
% 0.21/0.40 inference(beta_eta_normalization,[],[f152])).
% 0.21/0.40 thf(f152,plain,(
% 0.21/0.40 (((^[Y0 : $i]: (((p @ Y0) | (~ (q @ Y0))) | (~ (rel_k @ sK1 @ Y0)))) @ sK2) = $false)),
% 0.21/0.40 inference(sigma_clausification,[],[f151])).
% 0.21/0.40 thf(f151,plain,(
% 0.21/0.40 ($false = (!! @ $i @ (^[Y0 : $i]: (((p @ Y0) | (~ (q @ Y0))) | (~ (rel_k @ sK1 @ Y0))))))),
% 0.21/0.40 inference(binary_proxy_clausification,[],[f149])).
% 0.21/0.40 thf(f149,plain,(
% 0.21/0.40 (((!! @ $i @ (^[Y0 : $i]: (((p @ Y0) | (~ (q @ Y0))) | (~ (rel_k @ sK1 @ Y0))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_k @ sK1 @ Y0))))))) = $false)),
% 0.21/0.40 inference(beta_eta_normalization,[],[f148])).
% 0.21/0.40 thf(f148,plain,(
% 0.21/0.40 (((^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: (((p @ Y1) | (~ (q @ Y1))) | (~ (rel_k @ Y0 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_k @ Y0 @ Y1)))))))) @ sK1) = $false)),
% 0.21/0.40 inference(sigma_clausification,[],[f147])).
% 0.21/0.40 thf(f147,plain,(
% 0.21/0.40 ((!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: (((p @ Y1) | (~ (q @ Y1))) | (~ (rel_k @ Y0 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_k @ Y0 @ Y1))))))))) != $true)),
% 0.21/0.40 inference(beta_eta_normalization,[],[f146])).
% 0.21/0.40 thf(f146,plain,(
% 0.21/0.40 ($true != ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[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)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_k @ Y1 @ Y2)))))))) @ p) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_k @ Y1 @ Y2)))))))) @ ((^[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)))) @ q @ p)))))),
% 0.21/0.40 inference(definition_unfolding,[],[f117,f121,f137,f102,f102,f137])).
% 0.21/0.40 thf(f102,plain,(
% 0.21/0.40 (mbox_k = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_k @ Y1 @ Y2)))))))))),
% 0.21/0.40 inference(cnf_transformation,[],[f63])).
% 0.21/0.40 thf(f63,plain,(
% 0.21/0.40 (mbox_k = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_k @ Y1 @ Y2)))))))))),
% 0.21/0.40 inference(fool_elimination,[],[f62])).
% 0.21/0.40 thf(f62,plain,(
% 0.21/0.40 ((^[X0 : $i > $o, X1 : $i] : (! [X2] : (~(rel_k @ X1 @ X2) | (X0 @ X2)))) = mbox_k)),
% 0.21/0.40 inference(rectify,[],[f32])).
% 0.21/0.40 thf(f32,axiom,(
% 0.21/0.40 ((^[X3 : $i > $o, X2 : $i] : (! [X7] : (~(rel_k @ X2 @ X7) | (X3 @ X7)))) = mbox_k)),
% 0.21/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox_k)).
% 0.21/0.40 thf(f137,plain,(
% 0.21/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.21/0.40 inference(definition_unfolding,[],[f113,f129,f104])).
% 0.21/0.40 thf(f104,plain,(
% 0.21/0.40 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.21/0.40 inference(cnf_transformation,[],[f92])).
% 0.21/0.40 thf(f92,plain,(
% 0.21/0.40 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.21/0.40 inference(fool_elimination,[],[f91])).
% 0.21/0.40 thf(f91,plain,(
% 0.21/0.40 ((^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))) = mnot)),
% 0.21/0.40 inference(rectify,[],[f3])).
% 0.21/0.40 thf(f3,axiom,(
% 0.21/0.40 ((^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))) = mnot)),
% 0.21/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.21/0.40 thf(f129,plain,(
% 0.21/0.40 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.21/0.40 inference(cnf_transformation,[],[f70])).
% 0.21/0.40 thf(f70,plain,(
% 0.21/0.40 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.21/0.40 inference(fool_elimination,[],[f69])).
% 0.21/0.40 thf(f69,plain,(
% 0.21/0.40 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))) = mor)),
% 0.21/0.40 inference(rectify,[],[f4])).
% 0.21/0.40 thf(f4,axiom,(
% 0.21/0.40 ((^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X3 @ X2) | (X4 @ X2))) = mor)),
% 0.21/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.21/0.40 thf(f113,plain,(
% 0.21/0.40 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.21/0.40 inference(cnf_transformation,[],[f98])).
% 0.21/0.40 thf(f98,plain,(
% 0.21/0.40 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.21/0.40 inference(fool_elimination,[],[f97])).
% 0.21/0.40 thf(f97,plain,(
% 0.21/0.40 (mimplies = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.21/0.40 inference(rectify,[],[f6])).
% 0.21/0.40 thf(f6,axiom,(
% 0.21/0.40 (mimplies = (^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)))),
% 0.21/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies)).
% 0.21/0.40 thf(f121,plain,(
% 0.21/0.40 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.21/0.40 inference(cnf_transformation,[],[f40])).
% 0.21/0.40 thf(f40,plain,(
% 0.21/0.40 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.21/0.40 inference(fool_elimination,[],[f39])).
% 0.21/0.40 thf(f39,plain,(
% 0.21/0.40 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.21/0.40 inference(rectify,[],[f28])).
% 0.21/0.40 thf(f28,axiom,(
% 0.21/0.40 ((^[X3 : $i > $o] : (! [X2] : (X3 @ X2))) = mvalid)),
% 0.21/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.21/0.40 thf(f117,plain,(
% 0.21/0.40 ((mvalid @ (mimplies @ (mbox_k @ p) @ (mbox_k @ (mimplies @ q @ p)))) != $true)),
% 0.21/0.40 inference(cnf_transformation,[],[f101])).
% 0.21/0.40 thf(f101,plain,(
% 0.21/0.40 ((mvalid @ (mimplies @ (mbox_k @ p) @ (mbox_k @ (mimplies @ q @ p)))) != $true)),
% 0.21/0.40 inference(flattening,[],[f86])).
% 0.21/0.40 thf(f86,plain,(
% 0.21/0.40 ~((mvalid @ (mimplies @ (mbox_k @ p) @ (mbox_k @ (mimplies @ q @ p)))) = $true)),
% 0.21/0.40 inference(fool_elimination,[],[f85])).
% 0.21/0.40 thf(f85,plain,(
% 0.21/0.40 ~(mvalid @ (mimplies @ (mbox_k @ p) @ (mbox_k @ (mimplies @ q @ p))))),
% 0.21/0.40 inference(rectify,[],[f35])).
% 0.21/0.40 thf(f35,negated_conjecture,(
% 0.21/0.40 ~(mvalid @ (mimplies @ (mbox_k @ p) @ (mbox_k @ (mimplies @ q @ p))))),
% 0.21/0.40 inference(negated_conjecture,[],[f34])).
% 0.21/0.40 thf(f34,conjecture,(
% 0.21/0.40 (mvalid @ (mimplies @ (mbox_k @ p) @ (mbox_k @ (mimplies @ q @ p))))),
% 0.21/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove)).
% 0.21/0.40 thf(f168,plain,(
% 0.21/0.40 ((p @ sK2) = $true)),
% 0.21/0.40 inference(trivial_inequality_removal,[],[f165])).
% 0.21/0.40 thf(f165,plain,(
% 0.21/0.40 ($false = $true) | ((p @ sK2) = $true)),
% 0.21/0.40 inference(superposition,[],[f159,f164])).
% 0.21/0.40 thf(f164,plain,(
% 0.21/0.40 ( ! [X1 : $i] : (($false = (rel_k @ sK1 @ X1)) | ($true = (p @ X1))) )),
% 0.21/0.40 inference(not_proxy_clausification,[],[f163])).
% 0.21/0.40 thf(f163,plain,(
% 0.21/0.40 ( ! [X1 : $i] : (($true = (~ (rel_k @ sK1 @ X1))) | ($true = (p @ X1))) )),
% 0.21/0.40 inference(binary_proxy_clausification,[],[f162])).
% 0.21/0.40 thf(f162,plain,(
% 0.21/0.40 ( ! [X1 : $i] : (($true = ((p @ X1) | (~ (rel_k @ sK1 @ X1))))) )),
% 0.21/0.40 inference(beta_eta_normalization,[],[f161])).
% 0.21/0.40 thf(f161,plain,(
% 0.21/0.40 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((p @ Y0) | (~ (rel_k @ sK1 @ Y0)))) @ X1))) )),
% 0.21/0.40 inference(pi_clausification,[],[f160])).
% 0.21/0.40 thf(f160,plain,(
% 0.21/0.40 ($true = (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_k @ sK1 @ Y0))))))),
% 0.21/0.40 inference(not_proxy_clausification,[],[f150])).
% 0.21/0.40 thf(f150,plain,(
% 0.21/0.40 ((~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_k @ sK1 @ Y0)))))) = $false)),
% 0.21/0.40 inference(binary_proxy_clausification,[],[f149])).
% 0.21/0.40 thf(f159,plain,(
% 0.21/0.40 ((rel_k @ sK1 @ sK2) = $true)),
% 0.21/0.40 inference(not_proxy_clausification,[],[f154])).
% 0.21/0.40 thf(f154,plain,(
% 0.21/0.40 ($false = (~ (rel_k @ sK1 @ sK2)))),
% 0.21/0.40 inference(binary_proxy_clausification,[],[f153])).
% 0.21/0.40 % SZS output end Proof for theBenchmark
% 0.21/0.40 % (13362)------------------------------
% 0.21/0.40 % (13362)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (13362)Termination reason: Refutation
% 0.21/0.40
% 0.21/0.40 % (13362)Memory used [KB]: 5628
% 0.21/0.40 % (13362)Time elapsed: 0.008 s
% 0.21/0.40 % (13362)Instructions burned: 10 (million)
% 0.21/0.40 % (13362)------------------------------
% 0.21/0.40 % (13362)------------------------------
% 0.21/0.40 % (13361)Success in time 0.019 s
% 0.21/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------