TSTP Solution File: SYO403^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO403^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n028.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:18 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO403^1 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14 % 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.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 08:43:37 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a TH0_THM_EQU_NAR problem
% 0.14/0.35 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.14/0.37 % (5620)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.37 % (5621)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.14/0.37 % (5615)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.14/0.37 % (5614)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.14/0.37 % (5617)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.37 % (5621)Instruction limit reached!
% 0.14/0.37 % (5621)------------------------------
% 0.14/0.37 % (5621)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (5621)Termination reason: Unknown
% 0.14/0.37 % (5621)Termination phase: shuffling
% 0.14/0.37
% 0.14/0.37 % (5621)Memory used [KB]: 1023
% 0.14/0.37 % (5621)Time elapsed: 0.003 s
% 0.14/0.37 % (5621)Instructions burned: 3 (million)
% 0.14/0.37 % (5621)------------------------------
% 0.14/0.37 % (5621)------------------------------
% 0.14/0.37 % (5618)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.14/0.37 % (5617)Instruction limit reached!
% 0.14/0.37 % (5617)------------------------------
% 0.14/0.37 % (5617)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (5617)Termination reason: Unknown
% 0.14/0.37 % (5617)Termination phase: shuffling
% 0.14/0.37
% 0.14/0.37 % (5617)Memory used [KB]: 1023
% 0.14/0.37 % (5617)Time elapsed: 0.003 s
% 0.14/0.37 % (5617)Instructions burned: 2 (million)
% 0.14/0.37 % (5617)------------------------------
% 0.14/0.37 % (5617)------------------------------
% 0.14/0.37 % (5618)Instruction limit reached!
% 0.14/0.37 % (5618)------------------------------
% 0.14/0.37 % (5618)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (5618)Termination reason: Unknown
% 0.14/0.37 % (5618)Termination phase: shuffling
% 0.14/0.37
% 0.14/0.37 % (5618)Memory used [KB]: 1023
% 0.14/0.37 % (5618)Time elapsed: 0.003 s
% 0.14/0.37 % (5618)Instructions burned: 2 (million)
% 0.14/0.37 % (5618)------------------------------
% 0.14/0.37 % (5618)------------------------------
% 0.14/0.37 % (5615)Instruction limit reached!
% 0.14/0.37 % (5615)------------------------------
% 0.14/0.37 % (5615)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (5615)Termination reason: Unknown
% 0.14/0.37 % (5615)Termination phase: Property scanning
% 0.14/0.37
% 0.14/0.37 % (5615)Memory used [KB]: 1023
% 0.14/0.37 % (5615)Time elapsed: 0.004 s
% 0.14/0.37 % (5615)Instructions burned: 4 (million)
% 0.14/0.37 % (5615)------------------------------
% 0.14/0.37 % (5615)------------------------------
% 0.14/0.37 % (5616)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.14/0.37 % (5620)First to succeed.
% 0.14/0.37 % (5614)Also succeeded, but the first one will report.
% 0.14/0.37 % (5620)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% 0.14/0.37 thf(type_def_5, type, mu: $tType).
% 0.14/0.37 thf(func_def_0, type, mu: $tType).
% 0.14/0.37 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.14/0.37 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_15, type, mtrue: $i > $o).
% 0.14/0.37 thf(func_def_16, type, mfalse: $i > $o).
% 0.14/0.37 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.14/0.37 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.14/0.37 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.14/0.37 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.14/0.37 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.14/0.37 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.14/0.37 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.14/0.37 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.14/0.37 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.14/0.37 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.14/0.37 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.14/0.37 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.14/0.37 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.14/0.37 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.14/0.37 thf(func_def_33, type, rel_k: $i > $i > $o).
% 0.14/0.37 thf(func_def_34, type, mbox_k: ($i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_35, type, mdia_k: ($i > $o) > $i > $o).
% 0.14/0.37 thf(func_def_36, type, p: $i > $o).
% 0.14/0.37 thf(func_def_37, type, q: $i > $o).
% 0.14/0.37 thf(f196,plain,(
% 0.14/0.37 $false),
% 0.14/0.37 inference(avatar_sat_refutation,[],[f175,f185,f195])).
% 0.14/0.37 thf(f195,plain,(
% 0.14/0.37 ~spl0_1),
% 0.14/0.37 inference(avatar_contradiction_clause,[],[f194])).
% 0.14/0.37 thf(f194,plain,(
% 0.14/0.37 $false | ~spl0_1),
% 0.14/0.37 inference(trivial_inequality_removal,[],[f193])).
% 0.14/0.37 thf(f193,plain,(
% 0.14/0.37 ($false = $true) | ~spl0_1),
% 0.14/0.37 inference(forward_demodulation,[],[f188,f167])).
% 0.14/0.37 thf(f167,plain,(
% 0.14/0.37 ((q @ sK2) = $false)),
% 0.14/0.37 inference(binary_proxy_clausification,[],[f164])).
% 0.14/0.37 thf(f164,plain,(
% 0.14/0.37 ($false = ((p @ sK2) | (q @ sK2)))),
% 0.14/0.37 inference(binary_proxy_clausification,[],[f163])).
% 0.14/0.37 thf(f163,plain,(
% 0.14/0.37 ($false = ((~ (rel_k @ sK1 @ sK2)) | ((p @ sK2) | (q @ sK2))))),
% 0.14/0.37 inference(beta_eta_normalization,[],[f162])).
% 0.14/0.37 thf(f162,plain,(
% 0.14/0.37 ($false = ((^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | ((p @ Y0) | (q @ Y0)))) @ sK2))),
% 0.14/0.37 inference(sigma_clausification,[],[f150])).
% 0.14/0.37 thf(f150,plain,(
% 0.14/0.37 ($false = (!! @ $i @ (^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | ((p @ Y0) | (q @ Y0))))))),
% 0.14/0.37 inference(binary_proxy_clausification,[],[f149])).
% 0.14/0.37 thf(f149,plain,(
% 0.14/0.37 (((~ ((!! @ $i @ (^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | (p @ Y0)))) | (!! @ $i @ (^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | (q @ Y0)))))) | (!! @ $i @ (^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | ((p @ Y0) | (q @ Y0)))))) = $false)),
% 0.14/0.37 inference(beta_eta_normalization,[],[f148])).
% 0.14/0.37 thf(f148,plain,(
% 0.14/0.37 ($false = ((^[Y0 : $i]: ((~ ((!! @ $i @ (^[Y1 : $i]: ((~ (rel_k @ Y0 @ Y1)) | (p @ Y1)))) | (!! @ $i @ (^[Y1 : $i]: ((~ (rel_k @ Y0 @ Y1)) | (q @ Y1)))))) | (!! @ $i @ (^[Y1 : $i]: ((~ (rel_k @ Y0 @ Y1)) | ((p @ Y1) | (q @ Y1))))))) @ sK1))),
% 0.14/0.37 inference(sigma_clausification,[],[f147])).
% 0.14/0.37 thf(f147,plain,(
% 0.14/0.37 ((!! @ $i @ (^[Y0 : $i]: ((~ ((!! @ $i @ (^[Y1 : $i]: ((~ (rel_k @ Y0 @ Y1)) | (p @ Y1)))) | (!! @ $i @ (^[Y1 : $i]: ((~ (rel_k @ Y0 @ Y1)) | (q @ Y1)))))) | (!! @ $i @ (^[Y1 : $i]: ((~ (rel_k @ Y0 @ Y1)) | ((p @ Y1) | (q @ Y1)))))))) != $true)),
% 0.14/0.37 inference(beta_eta_normalization,[],[f146])).
% 0.14/0.37 thf(f146,plain,(
% 0.14/0.37 (((^[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]: ((Y0 @ Y2) | (Y1 @ Y2))))))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_k @ Y1 @ Y2)) | (Y0 @ Y2))))))) @ p) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_k @ Y1 @ Y2)) | (Y0 @ Y2))))))) @ q)) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_k @ Y1 @ Y2)) | (Y0 @ Y2))))))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))) @ p @ q)))) != $true)),
% 0.14/0.37 inference(definition_unfolding,[],[f124,f113,f137,f130,f126,f126,f126,f130])).
% 0.14/0.37 thf(f126,plain,(
% 0.14/0.37 (mbox_k = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_k @ Y1 @ Y2)) | (Y0 @ Y2))))))))),
% 0.14/0.37 inference(cnf_transformation,[],[f69])).
% 0.14/0.37 thf(f69,plain,(
% 0.14/0.37 (mbox_k = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_k @ Y1 @ Y2)) | (Y0 @ Y2))))))))),
% 0.14/0.37 inference(fool_elimination,[],[f68])).
% 0.14/0.37 thf(f68,plain,(
% 0.14/0.37 (mbox_k = (^[X0 : $i > $o, X1 : $i] : (! [X2] : ((X0 @ X2) | ~(rel_k @ X1 @ X2)))))),
% 0.14/0.37 inference(rectify,[],[f32])).
% 0.14/0.37 thf(f32,axiom,(
% 0.14/0.37 (mbox_k = (^[X3 : $i > $o, X2 : $i] : (! [X7] : ((X3 @ X7) | ~(rel_k @ X2 @ X7)))))),
% 0.14/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox_k)).
% 0.14/0.37 thf(f130,plain,(
% 0.14/0.37 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.14/0.37 inference(cnf_transformation,[],[f100])).
% 0.14/0.37 thf(f100,plain,(
% 0.14/0.37 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.14/0.37 inference(fool_elimination,[],[f99])).
% 0.14/0.37 thf(f99,plain,(
% 0.14/0.37 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X1 @ X2) | (X0 @ X2))) = mor)),
% 0.14/0.37 inference(rectify,[],[f4])).
% 0.14/0.37 thf(f4,axiom,(
% 0.14/0.37 ((^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X4 @ X2) | (X3 @ X2))) = mor)),
% 0.14/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mor)).
% 0.14/0.37 thf(f137,plain,(
% 0.14/0.37 (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.14/0.37 inference(definition_unfolding,[],[f108,f130,f102])).
% 0.14/0.37 thf(f102,plain,(
% 0.14/0.37 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.14/0.37 inference(cnf_transformation,[],[f90])).
% 0.14/0.37 thf(f90,plain,(
% 0.14/0.37 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.14/0.37 inference(fool_elimination,[],[f89])).
% 0.14/0.37 thf(f89,plain,(
% 0.14/0.37 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.14/0.37 inference(rectify,[],[f3])).
% 0.14/0.37 thf(f3,axiom,(
% 0.14/0.37 (mnot = (^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))))),
% 0.14/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mnot)).
% 0.14/0.37 thf(f108,plain,(
% 0.14/0.37 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.14/0.37 inference(cnf_transformation,[],[f52])).
% 0.14/0.37 thf(f52,plain,(
% 0.14/0.37 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.14/0.37 inference(fool_elimination,[],[f51])).
% 0.14/0.37 thf(f51,plain,(
% 0.14/0.37 ((^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)) = mimplies)),
% 0.14/0.37 inference(rectify,[],[f6])).
% 0.14/0.37 thf(f6,axiom,(
% 0.14/0.37 ((^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)) = mimplies)),
% 0.14/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimplies)).
% 0.14/0.37 thf(f113,plain,(
% 0.14/0.37 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.14/0.37 inference(cnf_transformation,[],[f46])).
% 0.14/0.37 thf(f46,plain,(
% 0.14/0.37 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.14/0.37 inference(fool_elimination,[],[f45])).
% 0.14/0.37 thf(f45,plain,(
% 0.14/0.37 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.14/0.37 inference(rectify,[],[f28])).
% 0.14/0.37 thf(f28,axiom,(
% 0.14/0.37 ((^[X3 : $i > $o] : (! [X2] : (X3 @ X2))) = mvalid)),
% 0.14/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mvalid)).
% 0.14/0.37 thf(f124,plain,(
% 0.14/0.37 ((mvalid @ (mimplies @ (mor @ (mbox_k @ p) @ (mbox_k @ q)) @ (mbox_k @ (mor @ p @ q)))) != $true)),
% 0.14/0.37 inference(cnf_transformation,[],[f101])).
% 0.14/0.37 thf(f101,plain,(
% 0.14/0.37 ((mvalid @ (mimplies @ (mor @ (mbox_k @ p) @ (mbox_k @ q)) @ (mbox_k @ (mor @ p @ q)))) != $true)),
% 0.14/0.37 inference(flattening,[],[f73])).
% 0.14/0.37 thf(f73,plain,(
% 0.14/0.37 ~((mvalid @ (mimplies @ (mor @ (mbox_k @ p) @ (mbox_k @ q)) @ (mbox_k @ (mor @ p @ q)))) = $true)),
% 0.14/0.37 inference(fool_elimination,[],[f72])).
% 0.14/0.37 thf(f72,plain,(
% 0.14/0.37 ~(mvalid @ (mimplies @ (mor @ (mbox_k @ p) @ (mbox_k @ q)) @ (mbox_k @ (mor @ p @ q))))),
% 0.14/0.37 inference(rectify,[],[f35])).
% 0.14/0.37 thf(f35,negated_conjecture,(
% 0.14/0.37 ~(mvalid @ (mimplies @ (mor @ (mbox_k @ p) @ (mbox_k @ q)) @ (mbox_k @ (mor @ p @ q))))),
% 0.14/0.37 inference(negated_conjecture,[],[f34])).
% 0.14/0.37 thf(f34,conjecture,(
% 0.14/0.37 (mvalid @ (mimplies @ (mor @ (mbox_k @ p) @ (mbox_k @ q)) @ (mbox_k @ (mor @ p @ q))))),
% 0.14/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove)).
% 0.14/0.37 thf(f188,plain,(
% 0.14/0.37 ((q @ sK2) = $true) | ~spl0_1),
% 0.14/0.37 inference(trivial_inequality_removal,[],[f186])).
% 0.14/0.37 thf(f186,plain,(
% 0.14/0.37 ($false = $true) | ((q @ sK2) = $true) | ~spl0_1),
% 0.14/0.37 inference(superposition,[],[f171,f166])).
% 0.14/0.37 thf(f166,plain,(
% 0.14/0.37 ($true = (rel_k @ sK1 @ sK2))),
% 0.14/0.37 inference(not_proxy_clausification,[],[f165])).
% 0.14/0.37 thf(f165,plain,(
% 0.14/0.37 ((~ (rel_k @ sK1 @ sK2)) = $false)),
% 0.14/0.37 inference(binary_proxy_clausification,[],[f163])).
% 0.14/0.37 thf(f171,plain,(
% 0.14/0.37 ( ! [X2 : $i] : (((rel_k @ sK1 @ X2) = $false) | ((q @ X2) = $true)) ) | ~spl0_1),
% 0.14/0.37 inference(avatar_component_clause,[],[f170])).
% 0.14/0.37 thf(f170,plain,(
% 0.14/0.37 spl0_1 <=> ! [X2] : (((rel_k @ sK1 @ X2) = $false) | ((q @ X2) = $true))),
% 0.14/0.37 introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.14/0.37 thf(f185,plain,(
% 0.14/0.37 ~spl0_2),
% 0.14/0.37 inference(avatar_contradiction_clause,[],[f184])).
% 0.14/0.37 thf(f184,plain,(
% 0.14/0.37 $false | ~spl0_2),
% 0.14/0.37 inference(trivial_inequality_removal,[],[f183])).
% 0.14/0.37 thf(f183,plain,(
% 0.14/0.37 ($false = $true) | ~spl0_2),
% 0.14/0.37 inference(forward_demodulation,[],[f178,f168])).
% 0.14/0.37 thf(f168,plain,(
% 0.14/0.37 ($false = (p @ sK2))),
% 0.14/0.37 inference(binary_proxy_clausification,[],[f164])).
% 0.14/0.37 thf(f178,plain,(
% 0.14/0.37 ((p @ sK2) = $true) | ~spl0_2),
% 0.14/0.37 inference(trivial_inequality_removal,[],[f176])).
% 0.14/0.37 thf(f176,plain,(
% 0.14/0.37 ($false = $true) | ((p @ sK2) = $true) | ~spl0_2),
% 0.14/0.37 inference(superposition,[],[f166,f174])).
% 0.14/0.37 thf(f174,plain,(
% 0.14/0.37 ( ! [X1 : $i] : (($false = (rel_k @ sK1 @ X1)) | ((p @ X1) = $true)) ) | ~spl0_2),
% 0.14/0.37 inference(avatar_component_clause,[],[f173])).
% 0.14/0.37 thf(f173,plain,(
% 0.14/0.37 spl0_2 <=> ! [X1] : (((p @ X1) = $true) | ($false = (rel_k @ sK1 @ X1)))),
% 0.14/0.37 introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.14/0.37 thf(f175,plain,(
% 0.14/0.37 spl0_1 | spl0_2),
% 0.14/0.37 inference(avatar_split_clause,[],[f161,f173,f170])).
% 0.14/0.37 thf(f161,plain,(
% 0.14/0.37 ( ! [X2 : $i,X1 : $i] : (((p @ X1) = $true) | ($false = (rel_k @ sK1 @ X1)) | ((rel_k @ sK1 @ X2) = $false) | ((q @ X2) = $true)) )),
% 0.14/0.37 inference(not_proxy_clausification,[],[f160])).
% 0.14/0.37 thf(f160,plain,(
% 0.14/0.37 ( ! [X2 : $i,X1 : $i] : (((q @ X2) = $true) | ((p @ X1) = $true) | ((~ (rel_k @ sK1 @ X2)) = $true) | ($false = (rel_k @ sK1 @ X1))) )),
% 0.14/0.37 inference(binary_proxy_clausification,[],[f159])).
% 0.14/0.37 thf(f159,plain,(
% 0.14/0.37 ( ! [X2 : $i,X1 : $i] : (($false = (rel_k @ sK1 @ X1)) | ((p @ X1) = $true) | (((~ (rel_k @ sK1 @ X2)) | (q @ X2)) = $true)) )),
% 0.14/0.38 inference(beta_eta_normalization,[],[f158])).
% 0.14/0.38 thf(f158,plain,(
% 0.14/0.38 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | (q @ Y0))) @ X2) = $true) | ($false = (rel_k @ sK1 @ X1)) | ((p @ X1) = $true)) )),
% 0.14/0.38 inference(pi_clausification,[],[f157])).
% 0.14/0.38 thf(f157,plain,(
% 0.14/0.38 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | (q @ Y0)))) = $true) | ($false = (rel_k @ sK1 @ X1)) | ((p @ X1) = $true)) )),
% 0.14/0.38 inference(not_proxy_clausification,[],[f156])).
% 0.14/0.38 thf(f156,plain,(
% 0.14/0.38 ( ! [X1 : $i] : (((p @ X1) = $true) | ($true = (~ (rel_k @ sK1 @ X1))) | ((!! @ $i @ (^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | (q @ Y0)))) = $true)) )),
% 0.14/0.38 inference(binary_proxy_clausification,[],[f155])).
% 0.14/0.38 thf(f155,plain,(
% 0.14/0.38 ( ! [X1 : $i] : (($true = ((~ (rel_k @ sK1 @ X1)) | (p @ X1))) | ((!! @ $i @ (^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | (q @ Y0)))) = $true)) )),
% 0.14/0.38 inference(beta_eta_normalization,[],[f154])).
% 0.14/0.38 thf(f154,plain,(
% 0.14/0.38 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | (p @ Y0))) @ X1) = $true) | ((!! @ $i @ (^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | (q @ Y0)))) = $true)) )),
% 0.14/0.38 inference(pi_clausification,[],[f153])).
% 0.14/0.38 thf(f153,plain,(
% 0.14/0.38 ((!! @ $i @ (^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | (p @ Y0)))) = $true) | ((!! @ $i @ (^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | (q @ Y0)))) = $true)),
% 0.14/0.38 inference(binary_proxy_clausification,[],[f152])).
% 0.14/0.38 thf(f152,plain,(
% 0.14/0.38 (((!! @ $i @ (^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | (p @ Y0)))) | (!! @ $i @ (^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | (q @ Y0))))) = $true)),
% 0.14/0.38 inference(not_proxy_clausification,[],[f151])).
% 0.14/0.38 thf(f151,plain,(
% 0.14/0.38 ($false = (~ ((!! @ $i @ (^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | (p @ Y0)))) | (!! @ $i @ (^[Y0 : $i]: ((~ (rel_k @ sK1 @ Y0)) | (q @ Y0)))))))),
% 0.14/0.38 inference(binary_proxy_clausification,[],[f149])).
% 0.14/0.38 % SZS output end Proof for theBenchmark
% 0.14/0.38 % (5620)------------------------------
% 0.14/0.38 % (5620)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (5620)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (5620)Memory used [KB]: 5628
% 0.14/0.38 % (5620)Time elapsed: 0.010 s
% 0.14/0.38 % (5620)Instructions burned: 10 (million)
% 0.14/0.38 % (5620)------------------------------
% 0.14/0.38 % (5620)------------------------------
% 0.14/0.38 % (5613)Success in time 0.01 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------