TSTP Solution File: SYO434^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO434^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 : n016.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:25 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO434^1 : TPTP v8.2.0. Released v4.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 10:36:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/0.36 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 % (23950)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.37 % (23950)Instruction limit reached!
% 0.14/0.37 % (23950)------------------------------
% 0.14/0.37 % (23950)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (23950)Termination reason: Unknown
% 0.14/0.37 % (23950)Termination phase: shuffling
% 0.14/0.37
% 0.14/0.37 % (23950)Memory used [KB]: 1023
% 0.14/0.37 % (23950)Time elapsed: 0.002 s
% 0.14/0.37 % (23950)Instructions burned: 3 (million)
% 0.14/0.37 % (23950)------------------------------
% 0.14/0.37 % (23950)------------------------------
% 0.14/0.38 % (23947)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.38 % (23948)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.38 % (23951)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.38 % (23949)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.38 % (23952)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.14/0.38 % (23953)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.38 % (23954)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.38 % (23951)Instruction limit reached!
% 0.14/0.38 % (23951)------------------------------
% 0.14/0.38 % (23951)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (23951)Termination reason: Unknown
% 0.14/0.38 % (23951)Termination phase: shuffling
% 0.14/0.38
% 0.14/0.38 % (23951)Memory used [KB]: 1023
% 0.14/0.38 % (23951)Time elapsed: 0.003 s
% 0.14/0.38 % (23951)Instructions burned: 2 (million)
% 0.14/0.38 % (23951)------------------------------
% 0.14/0.38 % (23951)------------------------------
% 0.14/0.38 % (23954)Instruction limit reached!
% 0.14/0.38 % (23954)------------------------------
% 0.14/0.38 % (23954)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (23954)Termination reason: Unknown
% 0.14/0.38 % (23954)Termination phase: shuffling
% 0.14/0.38
% 0.14/0.38 % (23954)Memory used [KB]: 1023
% 0.14/0.38 % (23954)Time elapsed: 0.004 s
% 0.14/0.38 % (23954)Instructions burned: 3 (million)
% 0.14/0.38 % (23954)------------------------------
% 0.14/0.38 % (23954)------------------------------
% 0.14/0.38 % (23948)Instruction limit reached!
% 0.14/0.38 % (23948)------------------------------
% 0.14/0.38 % (23948)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (23948)Termination reason: Unknown
% 0.14/0.38 % (23948)Termination phase: Preprocessing 1
% 0.14/0.38
% 0.14/0.38 % (23948)Memory used [KB]: 1023
% 0.14/0.38 % (23948)Time elapsed: 0.005 s
% 0.14/0.38 % (23948)Instructions burned: 5 (million)
% 0.14/0.38 % (23948)------------------------------
% 0.14/0.38 % (23948)------------------------------
% 0.14/0.38 % (23955)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.14/0.38 % (23952)Refutation not found, incomplete strategy
% 0.14/0.38 % (23952)------------------------------
% 0.14/0.38 % (23952)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (23952)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (23952)Memory used [KB]: 5628
% 0.14/0.38 % (23952)Time elapsed: 0.009 s
% 0.14/0.38 % (23952)Instructions burned: 11 (million)
% 0.14/0.38 % (23952)------------------------------
% 0.14/0.38 % (23952)------------------------------
% 0.14/0.39 % (23953)Instruction limit reached!
% 0.14/0.39 % (23953)------------------------------
% 0.14/0.39 % (23953)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (23953)Termination reason: Unknown
% 0.14/0.39 % (23953)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (23953)Memory used [KB]: 5628
% 0.14/0.39 % (23953)Time elapsed: 0.013 s
% 0.14/0.39 % (23953)Instructions burned: 18 (million)
% 0.14/0.39 % (23953)------------------------------
% 0.14/0.39 % (23953)------------------------------
% 0.14/0.39 % (23949)First to succeed.
% 0.14/0.39 % (23955)Instruction limit reached!
% 0.14/0.39 % (23955)------------------------------
% 0.14/0.39 % (23955)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (23955)Termination reason: Unknown
% 0.14/0.39 % (23955)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (23955)Memory used [KB]: 5756
% 0.14/0.39 % (23955)Time elapsed: 0.014 s
% 0.14/0.39 % (23955)Instructions burned: 39 (million)
% 0.14/0.39 % (23955)------------------------------
% 0.14/0.39 % (23955)------------------------------
% 0.14/0.39 % (23956)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.14/0.39 % (23957)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.39 % (23958)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.14/0.39 % (23947)Also succeeded, but the first one will report.
% 0.14/0.39 % (23957)Instruction limit reached!
% 0.14/0.39 % (23957)------------------------------
% 0.14/0.39 % (23957)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (23957)Termination reason: Unknown
% 0.14/0.39 % (23957)Termination phase: shuffling
% 0.14/0.39
% 0.14/0.39 % (23957)Memory used [KB]: 1023
% 0.14/0.39 % (23957)Time elapsed: 0.004 s
% 0.14/0.39 % (23957)Instructions burned: 4 (million)
% 0.14/0.39 % (23957)------------------------------
% 0.14/0.39 % (23957)------------------------------
% 0.14/0.40 % (23949)Refutation found. Thanks to Tanya!
% 0.14/0.40 % SZS status Theorem for theBenchmark
% 0.14/0.40 % SZS output start Proof for theBenchmark
% 0.14/0.40 thf(type_def_5, type, mu: $tType).
% 0.14/0.40 thf(func_def_0, type, mu: $tType).
% 0.14/0.40 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.14/0.40 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_15, type, mtrue: $i > $o).
% 0.14/0.40 thf(func_def_16, type, mfalse: $i > $o).
% 0.14/0.40 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.14/0.40 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.14/0.40 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.14/0.40 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.14/0.40 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.14/0.40 thf(func_def_33, type, rel_s4: $i > $i > $o).
% 0.14/0.40 thf(func_def_34, type, mbox_s4: ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_35, type, mdia_s4: ($i > $o) > $i > $o).
% 0.14/0.40 thf(func_def_36, type, p: $i > $o).
% 0.14/0.40 thf(func_def_37, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.14/0.40 thf(func_def_56, type, sK3: $i > $i).
% 0.14/0.40 thf(f312,plain,(
% 0.14/0.40 $false),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f309])).
% 0.14/0.40 thf(f309,plain,(
% 0.14/0.40 ($true = $false)),
% 0.14/0.40 inference(superposition,[],[f159,f265])).
% 0.14/0.40 thf(f265,plain,(
% 0.14/0.40 ($false = (rel_s4 @ sK2 @ sK2))),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f264])).
% 0.14/0.40 thf(f264,plain,(
% 0.14/0.40 ($false = (rel_s4 @ sK2 @ sK2)) | ($true = $false)),
% 0.14/0.40 inference(forward_demodulation,[],[f253,f236])).
% 0.14/0.40 thf(f236,plain,(
% 0.14/0.40 ($false = (p @ (sK3 @ sK2)))),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f231])).
% 0.14/0.40 thf(f231,plain,(
% 0.14/0.40 ($false = (p @ (sK3 @ sK2))) | ($true = $false)),
% 0.14/0.40 inference(superposition,[],[f187,f159])).
% 0.14/0.40 thf(f187,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (((rel_s4 @ sK2 @ X1) = $false) | ((p @ (sK3 @ X1)) = $false)) )),
% 0.14/0.40 inference(binary_proxy_clausification,[],[f185])).
% 0.14/0.40 thf(f185,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (($false = ((p @ (sK3 @ X1)) | (~ (rel_s4 @ X1 @ (sK3 @ X1))))) | ((rel_s4 @ sK2 @ X1) = $false)) )),
% 0.14/0.40 inference(beta_eta_normalization,[],[f184])).
% 0.14/0.40 thf(f184,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (((rel_s4 @ sK2 @ X1) = $false) | (((^[Y0 : $i]: ((p @ Y0) | (~ (rel_s4 @ X1 @ Y0)))) @ (sK3 @ X1)) = $false)) )),
% 0.14/0.40 inference(sigma_clausification,[],[f183])).
% 0.14/0.40 thf(f183,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_s4 @ X1 @ Y0))))) = $false) | ((rel_s4 @ sK2 @ X1) = $false)) )),
% 0.14/0.40 inference(not_proxy_clausification,[],[f182])).
% 0.14/0.40 thf(f182,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (($true = (~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_s4 @ X1 @ Y0))))))) | ((rel_s4 @ sK2 @ X1) = $false)) )),
% 0.14/0.40 inference(not_proxy_clausification,[],[f181])).
% 0.14/0.40 thf(f181,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (($true = (~ (rel_s4 @ sK2 @ X1))) | ($true = (~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_s4 @ X1 @ Y0)))))))) )),
% 0.14/0.40 inference(binary_proxy_clausification,[],[f180])).
% 0.14/0.40 thf(f180,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (($true = ((~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_s4 @ X1 @ Y0)))))) | (~ (rel_s4 @ sK2 @ X1))))) )),
% 0.14/0.40 inference(beta_eta_normalization,[],[f179])).
% 0.14/0.40 thf(f179,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_s4 @ Y0 @ Y1)))))) | (~ (rel_s4 @ sK2 @ Y0)))) @ X1))) )),
% 0.14/0.40 inference(pi_clausification,[],[f178])).
% 0.14/0.40 thf(f178,plain,(
% 0.14/0.40 ($true = (!! @ $i @ (^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_s4 @ Y0 @ Y1)))))) | (~ (rel_s4 @ sK2 @ Y0))))))),
% 0.14/0.40 inference(not_proxy_clausification,[],[f177])).
% 0.14/0.40 thf(f177,plain,(
% 0.14/0.40 ($false = (~ (!! @ $i @ (^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_s4 @ Y0 @ Y1)))))) | (~ (rel_s4 @ sK2 @ Y0)))))))),
% 0.14/0.40 inference(binary_proxy_clausification,[],[f175])).
% 0.14/0.40 thf(f175,plain,(
% 0.14/0.40 (((~ (!! @ $i @ (^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_s4 @ Y0 @ Y1)))))) | (~ (rel_s4 @ sK2 @ Y0)))))) | (~ (rel_s4 @ sK1 @ sK2))) = $false)),
% 0.14/0.40 inference(beta_eta_normalization,[],[f174])).
% 0.14/0.40 thf(f174,plain,(
% 0.14/0.40 ($false = ((^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((~ (!! @ $i @ (^[Y2 : $i]: ((p @ Y2) | (~ (rel_s4 @ Y1 @ Y2)))))) | (~ (rel_s4 @ Y0 @ Y1)))))) | (~ (rel_s4 @ sK1 @ Y0)))) @ sK2))),
% 0.14/0.40 inference(sigma_clausification,[],[f173])).
% 0.14/0.40 thf(f173,plain,(
% 0.14/0.40 ($false = (!! @ $i @ (^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((~ (!! @ $i @ (^[Y2 : $i]: ((p @ Y2) | (~ (rel_s4 @ Y1 @ Y2)))))) | (~ (rel_s4 @ Y0 @ Y1)))))) | (~ (rel_s4 @ sK1 @ Y0))))))),
% 0.14/0.40 inference(binary_proxy_clausification,[],[f171])).
% 0.14/0.40 thf(f171,plain,(
% 0.14/0.40 ($false = ((!! @ $i @ (^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((~ (!! @ $i @ (^[Y2 : $i]: ((p @ Y2) | (~ (rel_s4 @ Y1 @ Y2)))))) | (~ (rel_s4 @ Y0 @ Y1)))))) | (~ (rel_s4 @ sK1 @ Y0))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_s4 @ sK1 @ Y0))))))))),
% 0.14/0.40 inference(beta_eta_normalization,[],[f170])).
% 0.14/0.40 thf(f170,plain,(
% 0.14/0.40 ($false = ((^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((~ (!! @ $i @ (^[Y2 : $i]: ((~ (!! @ $i @ (^[Y3 : $i]: ((p @ Y3) | (~ (rel_s4 @ Y2 @ Y3)))))) | (~ (rel_s4 @ Y1 @ Y2)))))) | (~ (rel_s4 @ Y0 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_s4 @ Y0 @ Y1)))))))) @ sK1))),
% 0.14/0.40 inference(sigma_clausification,[],[f169])).
% 0.14/0.40 thf(f169,plain,(
% 0.14/0.40 ($true != (!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((~ (!! @ $i @ (^[Y2 : $i]: ((~ (!! @ $i @ (^[Y3 : $i]: ((p @ Y3) | (~ (rel_s4 @ Y2 @ Y3)))))) | (~ (rel_s4 @ Y1 @ Y2)))))) | (~ (rel_s4 @ Y0 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((p @ Y1) | (~ (rel_s4 @ Y0 @ Y1))))))))))),
% 0.14/0.40 inference(beta_eta_normalization,[],[f155])).
% 0.14/0.40 thf(f155,plain,(
% 0.14/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_s4 @ Y1 @ Y2)))))))) @ p) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_s4 @ Y1 @ Y2)))))))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (rel_s4 @ Y2 @ Y3)))))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ Y0)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_s4 @ Y1 @ Y2)))))))) @ p))))))),
% 0.14/0.40 inference(definition_unfolding,[],[f129,f139,f145,f128,f128,f153,f128])).
% 0.14/0.40 thf(f153,plain,(
% 0.14/0.40 (mdia_s4 = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (rel_s4 @ Y2 @ Y3)))))))) @ ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ Y0)))))),
% 0.14/0.40 inference(definition_unfolding,[],[f131,f112,f128,f112])).
% 0.14/0.40 thf(f112,plain,(
% 0.14/0.40 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.14/0.40 inference(cnf_transformation,[],[f61])).
% 0.14/0.40 thf(f61,plain,(
% 0.14/0.40 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.14/0.40 inference(fool_elimination,[],[f60])).
% 0.14/0.40 thf(f60,plain,(
% 0.14/0.40 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.14/0.40 inference(rectify,[],[f3])).
% 0.14/0.40 thf(f3,axiom,(
% 0.14/0.40 (mnot = (^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))))),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mnot)).
% 0.14/0.40 thf(f131,plain,(
% 0.14/0.40 (mdia_s4 = (^[Y0 : $i > $o]: (mnot @ (mbox_s4 @ (mnot @ Y0)))))),
% 0.14/0.40 inference(cnf_transformation,[],[f53])).
% 0.14/0.40 thf(f53,plain,(
% 0.14/0.40 (mdia_s4 = (^[Y0 : $i > $o]: (mnot @ (mbox_s4 @ (mnot @ Y0)))))),
% 0.14/0.40 inference(fool_elimination,[],[f52])).
% 0.14/0.40 thf(f52,plain,(
% 0.14/0.40 (mdia_s4 = (^[X0 : $i > $o] : (mnot @ (mbox_s4 @ (mnot @ X0)))))),
% 0.14/0.40 inference(rectify,[],[f33])).
% 0.14/0.40 thf(f33,axiom,(
% 0.14/0.40 (mdia_s4 = (^[X3 : $i > $o] : (mnot @ (mbox_s4 @ (mnot @ X3)))))),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mdia_s4)).
% 0.14/0.40 thf(f128,plain,(
% 0.14/0.40 (mbox_s4 = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_s4 @ Y1 @ Y2)))))))))),
% 0.14/0.40 inference(cnf_transformation,[],[f59])).
% 0.14/0.40 thf(f59,plain,(
% 0.14/0.40 (mbox_s4 = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_s4 @ Y1 @ Y2)))))))))),
% 0.14/0.40 inference(fool_elimination,[],[f58])).
% 0.14/0.40 thf(f58,plain,(
% 0.14/0.40 ((^[X0 : $i > $o, X1 : $i] : (! [X2] : (~(rel_s4 @ X1 @ X2) | (X0 @ X2)))) = mbox_s4)),
% 0.14/0.40 inference(rectify,[],[f32])).
% 0.14/0.40 thf(f32,axiom,(
% 0.14/0.40 ((^[X3 : $i > $o, X2 : $i] : (! [X7] : (~(rel_s4 @ X2 @ X7) | (X3 @ X7)))) = mbox_s4)),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox_s4)).
% 0.14/0.40 thf(f145,plain,(
% 0.14/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.14/0.40 inference(definition_unfolding,[],[f126,f115,f112])).
% 0.14/0.40 thf(f115,plain,(
% 0.14/0.40 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.14/0.40 inference(cnf_transformation,[],[f84])).
% 0.14/0.40 thf(f84,plain,(
% 0.14/0.40 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.14/0.40 inference(fool_elimination,[],[f83])).
% 0.14/0.40 thf(f83,plain,(
% 0.14/0.40 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))) = mor)),
% 0.14/0.40 inference(rectify,[],[f4])).
% 0.14/0.40 thf(f4,axiom,(
% 0.14/0.40 ((^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X3 @ X2) | (X4 @ X2))) = mor)),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mor)).
% 0.14/0.40 thf(f126,plain,(
% 0.14/0.40 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.14/0.40 inference(cnf_transformation,[],[f55])).
% 0.14/0.40 thf(f55,plain,(
% 0.14/0.40 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.14/0.40 inference(fool_elimination,[],[f54])).
% 0.14/0.40 thf(f54,plain,(
% 0.14/0.40 (mimplies = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.14/0.40 inference(rectify,[],[f6])).
% 0.14/0.40 thf(f6,axiom,(
% 0.14/0.40 (mimplies = (^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)))),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimplies)).
% 0.14/0.40 thf(f139,plain,(
% 0.14/0.40 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.14/0.40 inference(cnf_transformation,[],[f68])).
% 0.14/0.40 thf(f68,plain,(
% 0.14/0.40 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.14/0.40 inference(fool_elimination,[],[f67])).
% 0.14/0.40 thf(f67,plain,(
% 0.14/0.40 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.14/0.40 inference(rectify,[],[f28])).
% 0.14/0.40 thf(f28,axiom,(
% 0.14/0.40 ((^[X3 : $i > $o] : (! [X2] : (X3 @ X2))) = mvalid)),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mvalid)).
% 0.14/0.40 thf(f129,plain,(
% 0.14/0.40 ((mvalid @ (mimplies @ (mbox_s4 @ p) @ (mbox_s4 @ (mdia_s4 @ (mbox_s4 @ p))))) != $true)),
% 0.14/0.40 inference(cnf_transformation,[],[f107])).
% 0.14/0.40 thf(f107,plain,(
% 0.14/0.40 ((mvalid @ (mimplies @ (mbox_s4 @ p) @ (mbox_s4 @ (mdia_s4 @ (mbox_s4 @ p))))) != $true)),
% 0.14/0.40 inference(flattening,[],[f104])).
% 0.14/0.40 thf(f104,plain,(
% 0.14/0.40 ~((mvalid @ (mimplies @ (mbox_s4 @ p) @ (mbox_s4 @ (mdia_s4 @ (mbox_s4 @ p))))) = $true)),
% 0.14/0.40 inference(fool_elimination,[],[f103])).
% 0.14/0.40 thf(f103,plain,(
% 0.14/0.40 ~(mvalid @ (mimplies @ (mbox_s4 @ p) @ (mbox_s4 @ (mdia_s4 @ (mbox_s4 @ p)))))),
% 0.14/0.40 inference(rectify,[],[f37])).
% 0.14/0.40 thf(f37,negated_conjecture,(
% 0.14/0.40 ~(mvalid @ (mimplies @ (mbox_s4 @ p) @ (mbox_s4 @ (mdia_s4 @ (mbox_s4 @ p)))))),
% 0.14/0.40 inference(negated_conjecture,[],[f36])).
% 0.14/0.40 thf(f36,conjecture,(
% 0.14/0.40 (mvalid @ (mimplies @ (mbox_s4 @ p) @ (mbox_s4 @ (mdia_s4 @ (mbox_s4 @ p)))))),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove)).
% 0.14/0.40 thf(f253,plain,(
% 0.14/0.40 ($false = (rel_s4 @ sK2 @ sK2)) | ($true = (p @ (sK3 @ sK2)))),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f242])).
% 0.14/0.40 thf(f242,plain,(
% 0.14/0.40 ($true = (p @ (sK3 @ sK2))) | ($false = (rel_s4 @ sK2 @ sK2)) | ($true = $false)),
% 0.14/0.40 inference(superposition,[],[f188,f217])).
% 0.14/0.40 thf(f217,plain,(
% 0.14/0.40 ( ! [X0 : $i] : (($false = (rel_s4 @ sK2 @ X0)) | ($true = (p @ X0))) )),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f209])).
% 0.14/0.40 thf(f209,plain,(
% 0.14/0.40 ( ! [X0 : $i] : (($true = (p @ X0)) | ($true = $false) | ($false = (rel_s4 @ sK2 @ X0))) )),
% 0.14/0.40 inference(superposition,[],[f203,f189])).
% 0.14/0.40 thf(f189,plain,(
% 0.14/0.40 ($true = (rel_s4 @ sK1 @ sK2))),
% 0.14/0.40 inference(not_proxy_clausification,[],[f176])).
% 0.14/0.40 thf(f176,plain,(
% 0.14/0.40 ($false = (~ (rel_s4 @ sK1 @ sK2)))),
% 0.14/0.40 inference(binary_proxy_clausification,[],[f175])).
% 0.14/0.40 thf(f203,plain,(
% 0.14/0.40 ( ! [X0 : $i,X1 : $i] : (($false = (rel_s4 @ sK1 @ X1)) | ($true = (p @ X0)) | ((rel_s4 @ X1 @ X0) = $false)) )),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f199])).
% 0.14/0.40 thf(f199,plain,(
% 0.14/0.40 ( ! [X0 : $i,X1 : $i] : (($false = (rel_s4 @ sK1 @ X1)) | ($true = $false) | ((rel_s4 @ X1 @ X0) = $false) | ($true = (p @ X0))) )),
% 0.14/0.40 inference(superposition,[],[f194,f168])).
% 0.14/0.40 thf(f168,plain,(
% 0.14/0.40 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (rel_s4 @ X3 @ X2)) | ((rel_s4 @ X3 @ X1) = $false) | ($false = (rel_s4 @ X1 @ X2))) )),
% 0.14/0.40 inference(binary_proxy_clausification,[],[f167])).
% 0.14/0.40 thf(f167,plain,(
% 0.14/0.40 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (rel_s4 @ X3 @ X2)) | ($false = ((rel_s4 @ X1 @ X2) & (rel_s4 @ X3 @ X1)))) )),
% 0.14/0.40 inference(binary_proxy_clausification,[],[f166])).
% 0.14/0.40 thf(f166,plain,(
% 0.14/0.40 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (((rel_s4 @ X1 @ X2) & (rel_s4 @ X3 @ X1)) => (rel_s4 @ X3 @ X2)))) )),
% 0.14/0.40 inference(beta_eta_normalization,[],[f165])).
% 0.14/0.40 thf(f165,plain,(
% 0.14/0.40 ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (((rel_s4 @ X1 @ X2) & (rel_s4 @ Y0 @ X1)) => (rel_s4 @ Y0 @ X2))) @ X3))) )),
% 0.14/0.40 inference(pi_clausification,[],[f164])).
% 0.14/0.40 thf(f164,plain,(
% 0.14/0.40 ( ! [X2 : $i,X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: (((rel_s4 @ X1 @ X2) & (rel_s4 @ Y0 @ X1)) => (rel_s4 @ Y0 @ X2)))))) )),
% 0.14/0.40 inference(beta_eta_normalization,[],[f163])).
% 0.14/0.40 thf(f163,plain,(
% 0.14/0.40 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((rel_s4 @ X1 @ Y0) & (rel_s4 @ Y1 @ X1)) => (rel_s4 @ Y1 @ Y0))))) @ X2))) )),
% 0.14/0.40 inference(pi_clausification,[],[f162])).
% 0.14/0.40 thf(f162,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((rel_s4 @ X1 @ Y0) & (rel_s4 @ Y1 @ X1)) => (rel_s4 @ Y1 @ Y0)))))) = $true)) )),
% 0.14/0.40 inference(beta_eta_normalization,[],[f161])).
% 0.14/0.40 thf(f161,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((rel_s4 @ Y0 @ Y1) & (rel_s4 @ Y2 @ Y0)) => (rel_s4 @ Y2 @ Y1))))))) @ X1))) )),
% 0.14/0.40 inference(pi_clausification,[],[f160])).
% 0.14/0.40 thf(f160,plain,(
% 0.14/0.40 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (((rel_s4 @ Y0 @ Y1) & (rel_s4 @ Y2 @ Y0)) => (rel_s4 @ Y2 @ Y1)))))))))),
% 0.14/0.40 inference(beta_eta_normalization,[],[f156])).
% 0.14/0.40 thf(f156,plain,(
% 0.14/0.40 ($true = ((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y1 @ Y2) & (Y0 @ Y3 @ Y1)) => (Y0 @ Y3 @ Y2))))))))) @ rel_s4))),
% 0.14/0.40 inference(definition_unfolding,[],[f143,f134])).
% 0.14/0.40 thf(f134,plain,(
% 0.14/0.40 (mtransitive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y1 @ Y2) & (Y0 @ Y3 @ Y1)) => (Y0 @ Y3 @ Y2))))))))))),
% 0.14/0.40 inference(cnf_transformation,[],[f63])).
% 0.14/0.40 thf(f63,plain,(
% 0.14/0.40 (mtransitive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: (((Y0 @ Y1 @ Y2) & (Y0 @ Y3 @ Y1)) => (Y0 @ Y3 @ Y2))))))))))),
% 0.14/0.40 inference(fool_elimination,[],[f62])).
% 0.14/0.40 thf(f62,plain,(
% 0.14/0.40 (mtransitive = (^[X0 : $i > $i > $o] : (! [X1,X2,X3] : (((X0 @ X1 @ X3) & (X0 @ X3 @ X2)) => (X0 @ X1 @ X2)))))),
% 0.14/0.40 inference(rectify,[],[f21])).
% 0.14/0.40 thf(f21,axiom,(
% 0.14/0.40 (mtransitive = (^[X6 : $i > $i > $o] : (! [X8,X10,X9] : (((X6 @ X8 @ X9) & (X6 @ X9 @ X10)) => (X6 @ X8 @ X10)))))),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mtransitive)).
% 0.14/0.40 thf(f143,plain,(
% 0.14/0.40 ((mtransitive @ rel_s4) = $true)),
% 0.14/0.40 inference(cnf_transformation,[],[f88])).
% 0.14/0.40 thf(f88,plain,(
% 0.14/0.40 ((mtransitive @ rel_s4) = $true)),
% 0.14/0.40 inference(fool_elimination,[],[f87])).
% 0.14/0.40 thf(f87,plain,(
% 0.14/0.40 (mtransitive @ rel_s4)),
% 0.14/0.40 inference(rectify,[],[f35])).
% 0.14/0.40 thf(f35,axiom,(
% 0.14/0.40 (mtransitive @ rel_s4)),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',a2)).
% 0.14/0.40 thf(f194,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (($false = (rel_s4 @ sK1 @ X1)) | ($true = (p @ X1))) )),
% 0.14/0.40 inference(not_proxy_clausification,[],[f193])).
% 0.14/0.40 thf(f193,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (($true = (p @ X1)) | ($true = (~ (rel_s4 @ sK1 @ X1)))) )),
% 0.14/0.40 inference(binary_proxy_clausification,[],[f192])).
% 0.14/0.40 thf(f192,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (($true = ((p @ X1) | (~ (rel_s4 @ sK1 @ X1))))) )),
% 0.14/0.40 inference(beta_eta_normalization,[],[f191])).
% 0.14/0.40 thf(f191,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((p @ Y0) | (~ (rel_s4 @ sK1 @ Y0)))) @ X1))) )),
% 0.14/0.40 inference(pi_clausification,[],[f190])).
% 0.14/0.40 thf(f190,plain,(
% 0.14/0.40 ($true = (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_s4 @ sK1 @ Y0))))))),
% 0.14/0.40 inference(not_proxy_clausification,[],[f172])).
% 0.14/0.40 thf(f172,plain,(
% 0.14/0.40 ($false = (~ (!! @ $i @ (^[Y0 : $i]: ((p @ Y0) | (~ (rel_s4 @ sK1 @ Y0)))))))),
% 0.14/0.40 inference(binary_proxy_clausification,[],[f171])).
% 0.14/0.40 thf(f188,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (((rel_s4 @ X1 @ (sK3 @ X1)) = $true) | ((rel_s4 @ sK2 @ X1) = $false)) )),
% 0.14/0.40 inference(not_proxy_clausification,[],[f186])).
% 0.14/0.40 thf(f186,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (((rel_s4 @ sK2 @ X1) = $false) | ((~ (rel_s4 @ X1 @ (sK3 @ X1))) = $false)) )),
% 0.14/0.40 inference(binary_proxy_clausification,[],[f185])).
% 0.14/0.40 thf(f159,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (((rel_s4 @ X1 @ X1) = $true)) )),
% 0.14/0.40 inference(beta_eta_normalization,[],[f158])).
% 0.14/0.40 thf(f158,plain,(
% 0.14/0.40 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (rel_s4 @ Y0 @ Y0)) @ X1))) )),
% 0.14/0.40 inference(pi_clausification,[],[f157])).
% 0.14/0.40 thf(f157,plain,(
% 0.14/0.40 ($true = (!! @ $i @ (^[Y0 : $i]: (rel_s4 @ Y0 @ Y0))))),
% 0.14/0.40 inference(beta_eta_normalization,[],[f154])).
% 0.14/0.40 thf(f154,plain,(
% 0.14/0.40 (((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))) @ rel_s4) = $true)),
% 0.14/0.40 inference(definition_unfolding,[],[f108,f117])).
% 0.14/0.40 thf(f117,plain,(
% 0.14/0.40 (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.14/0.40 inference(cnf_transformation,[],[f82])).
% 0.14/0.40 thf(f82,plain,(
% 0.14/0.40 (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.14/0.40 inference(fool_elimination,[],[f81])).
% 0.14/0.40 thf(f81,plain,(
% 0.14/0.40 (mreflexive = (^[X0 : $i > $i > $o] : (! [X1] : (X0 @ X1 @ X1))))),
% 0.14/0.40 inference(rectify,[],[f18])).
% 0.14/0.40 thf(f18,axiom,(
% 0.14/0.40 (mreflexive = (^[X6 : $i > $i > $o] : (! [X8] : (X6 @ X8 @ X8))))),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mreflexive)).
% 0.14/0.40 thf(f108,plain,(
% 0.14/0.40 ((mreflexive @ rel_s4) = $true)),
% 0.14/0.40 inference(cnf_transformation,[],[f98])).
% 0.14/0.40 thf(f98,plain,(
% 0.14/0.40 ((mreflexive @ rel_s4) = $true)),
% 0.14/0.40 inference(fool_elimination,[],[f97])).
% 0.14/0.40 thf(f97,plain,(
% 0.14/0.40 (mreflexive @ rel_s4)),
% 0.14/0.40 inference(rectify,[],[f34])).
% 0.14/0.40 thf(f34,axiom,(
% 0.14/0.40 (mreflexive @ rel_s4)),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1)).
% 0.14/0.40 % SZS output end Proof for theBenchmark
% 0.14/0.40 % (23949)------------------------------
% 0.14/0.40 % (23949)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (23949)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (23949)Memory used [KB]: 5756
% 0.14/0.40 % (23949)Time elapsed: 0.019 s
% 0.14/0.40 % (23949)Instructions burned: 23 (million)
% 0.14/0.40 % (23949)------------------------------
% 0.14/0.40 % (23949)------------------------------
% 0.14/0.40 % (23946)Success in time 0.023 s
% 0.14/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------