TSTP Solution File: KRS275^7 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : KRS275^7 : TPTP v8.2.0. Released v5.5.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 : n021.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 : Mon May 20 23:20:57 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KRS275^7 : TPTP v8.2.0. Released v5.5.0.
% 0.10/0.14 % 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.15/0.35 % Computer : n021.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat May 18 22:27:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_EQU_NAR problem
% 0.15/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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.38 % (20377)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.15/0.38 % (20372)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.15/0.38 % (20373)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.38 % (20371)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.15/0.38 % (20374)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.15/0.38 % (20370)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.15/0.38 % (20375)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.15/0.38 % (20373)Instruction limit reached!
% 0.15/0.38 % (20373)------------------------------
% 0.15/0.38 % (20373)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (20373)Termination reason: Unknown
% 0.15/0.38 % (20373)Termination phase: shuffling
% 0.15/0.38 % (20374)Instruction limit reached!
% 0.15/0.38 % (20374)------------------------------
% 0.15/0.38 % (20374)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (20374)Termination reason: Unknown
% 0.15/0.38 % (20374)Termination phase: shuffling
% 0.15/0.38
% 0.15/0.38 % (20374)Memory used [KB]: 1023
% 0.15/0.38 % (20374)Time elapsed: 0.003 s
% 0.15/0.38 % (20374)Instructions burned: 2 (million)
% 0.15/0.38 % (20374)------------------------------
% 0.15/0.38 % (20374)------------------------------
% 0.15/0.38
% 0.15/0.38 % (20373)Memory used [KB]: 1023
% 0.15/0.38 % (20373)Time elapsed: 0.003 s
% 0.15/0.38 % (20373)Instructions burned: 2 (million)
% 0.15/0.38 % (20373)------------------------------
% 0.15/0.38 % (20373)------------------------------
% 0.15/0.38 % (20377)Instruction limit reached!
% 0.15/0.38 % (20377)------------------------------
% 0.15/0.38 % (20377)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (20377)Termination reason: Unknown
% 0.15/0.38 % (20377)Termination phase: shuffling
% 0.15/0.38
% 0.15/0.38 % (20377)Memory used [KB]: 1023
% 0.15/0.38 % (20377)Time elapsed: 0.004 s
% 0.15/0.38 % (20377)Instructions burned: 4 (million)
% 0.15/0.38 % (20377)------------------------------
% 0.15/0.38 % (20377)------------------------------
% 0.15/0.38 % (20371)Instruction limit reached!
% 0.15/0.38 % (20371)------------------------------
% 0.15/0.38 % (20371)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (20371)Termination reason: Unknown
% 0.15/0.38 % (20371)Termination phase: shuffling
% 0.15/0.38
% 0.15/0.38 % (20371)Memory used [KB]: 1023
% 0.15/0.38 % (20371)Time elapsed: 0.004 s
% 0.15/0.38 % (20371)Instructions burned: 4 (million)
% 0.15/0.38 % (20371)------------------------------
% 0.15/0.38 % (20371)------------------------------
% 0.15/0.38 % (20376)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.38 % (20375)Refutation not found, incomplete strategy
% 0.15/0.38 % (20375)------------------------------
% 0.15/0.38 % (20375)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (20375)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % (20375)Memory used [KB]: 5628
% 0.15/0.38 % (20375)Time elapsed: 0.008 s
% 0.15/0.38 % (20375)Instructions burned: 11 (million)
% 0.15/0.38 % (20375)------------------------------
% 0.15/0.38 % (20375)------------------------------
% 0.15/0.39 % (20376)Instruction limit reached!
% 0.15/0.39 % (20376)------------------------------
% 0.15/0.39 % (20376)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (20370)First to succeed.
% 0.15/0.39 % (20376)Termination reason: Unknown
% 0.15/0.39 % (20376)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (20376)Memory used [KB]: 5628
% 0.15/0.39 % (20376)Time elapsed: 0.012 s
% 0.15/0.39 % (20376)Instructions burned: 18 (million)
% 0.15/0.39 % (20376)------------------------------
% 0.15/0.39 % (20376)------------------------------
% 0.15/0.39 % (20380)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.15/0.39 % (20378)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.15/0.39 % (20379)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.15/0.39 % (20380)Instruction limit reached!
% 0.15/0.39 % (20380)------------------------------
% 0.15/0.39 % (20380)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (20372)Also succeeded, but the first one will report.
% 0.15/0.39 % (20380)Termination reason: Unknown
% 0.15/0.39 % (20380)Termination phase: shuffling
% 0.15/0.39
% 0.15/0.39 % (20380)Memory used [KB]: 1023
% 0.15/0.39 % (20380)Time elapsed: 0.003 s
% 0.15/0.39 % (20380)Instructions burned: 3 (million)
% 0.15/0.39 % (20380)------------------------------
% 0.15/0.39 % (20380)------------------------------
% 0.15/0.39 % (20381)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.15/0.39 % (20370)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% 0.15/0.39 thf(type_def_5, type, mu: $tType).
% 0.15/0.39 thf(func_def_0, type, mu: $tType).
% 0.15/0.39 thf(func_def_1, type, qmltpeq: mu > mu > $i > $o).
% 0.15/0.39 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_6, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_7, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_8, type, mtrue: $i > $o).
% 0.15/0.39 thf(func_def_9, type, mfalse: $i > $o).
% 0.15/0.39 thf(func_def_10, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_11, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_12, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_13, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_14, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_15, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_16, type, exists_in_world: mu > $i > $o).
% 0.15/0.39 thf(func_def_17, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_18, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_19, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_20, type, mreflexive: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_21, type, msymmetric: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_22, type, mserial: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_23, type, mtransitive: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_24, type, meuclidean: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_25, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_26, type, mfunctional: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_27, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_28, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_29, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.15/0.39 thf(func_def_30, type, mvalid: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_33, type, minvalid: ($i > $o) > $o).
% 0.15/0.39 thf(func_def_34, type, rel_s4: $i > $i > $o).
% 0.15/0.39 thf(func_def_35, type, mbox_s4: ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_36, type, mdia_s4: ($i > $o) > $i > $o).
% 0.15/0.39 thf(func_def_37, type, teach: mu > mu > $i > $o).
% 0.15/0.39 thf(func_def_38, type, sue: mu).
% 0.15/0.39 thf(func_def_39, type, psych: mu).
% 0.15/0.39 thf(func_def_40, type, mary: mu).
% 0.15/0.39 thf(func_def_41, type, cs: mu).
% 0.15/0.39 thf(func_def_42, type, math: mu).
% 0.15/0.39 thf(func_def_43, type, john: mu).
% 0.15/0.39 thf(func_def_59, type, sK0: $i > mu).
% 0.15/0.39 thf(func_def_61, type, sK2: $i > mu).
% 0.15/0.39 thf(func_def_63, type, sK4: mu > $i).
% 0.15/0.39 thf(f281,plain,(
% 0.15/0.39 $false),
% 0.15/0.39 inference(avatar_sat_refutation,[],[f257,f269,f279])).
% 0.15/0.39 thf(f279,plain,(
% 0.15/0.39 ~spl1_1),
% 0.15/0.39 inference(avatar_contradiction_clause,[],[f278])).
% 0.15/0.39 thf(f278,plain,(
% 0.15/0.39 $false | ~spl1_1),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f270])).
% 0.15/0.39 thf(f270,plain,(
% 0.15/0.39 ($true = $false) | ~spl1_1),
% 0.15/0.39 inference(superposition,[],[f252,f164])).
% 0.15/0.39 thf(f164,plain,(
% 0.15/0.39 ( ! [X0 : $i] : (($true = (exists_in_world @ math @ X0))) )),
% 0.15/0.39 inference(cnf_transformation,[],[f127])).
% 0.15/0.39 thf(f127,plain,(
% 0.15/0.39 ! [X0] : ($true = (exists_in_world @ math @ X0))),
% 0.15/0.39 inference(fool_elimination,[],[f126])).
% 0.15/0.39 thf(f126,plain,(
% 0.15/0.39 ! [X0] : (exists_in_world @ math @ X0)),
% 0.15/0.39 inference(rectify,[],[f41])).
% 0.15/0.39 thf(f41,axiom,(
% 0.15/0.39 ! [X6] : (exists_in_world @ math @ X6)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_math_ax)).
% 0.15/0.39 thf(f252,plain,(
% 0.15/0.39 ((exists_in_world @ math @ sK3) = $false) | ~spl1_1),
% 0.15/0.39 inference(avatar_component_clause,[],[f250])).
% 0.15/0.39 thf(f250,plain,(
% 0.15/0.39 spl1_1 <=> ((exists_in_world @ math @ sK3) = $false)),
% 0.15/0.39 introduced(avatar_definition,[new_symbols(naming,[spl1_1])])).
% 0.15/0.39 thf(f269,plain,(
% 0.15/0.39 spl1_1 | ~spl1_2),
% 0.15/0.39 inference(avatar_split_clause,[],[f262,f254,f250])).
% 0.15/0.39 thf(f254,plain,(
% 0.15/0.39 spl1_2 <=> ! [X0] : ((rel_s4 @ X0 @ (sK4 @ math)) = $false)),
% 0.15/0.39 introduced(avatar_definition,[new_symbols(naming,[spl1_2])])).
% 0.15/0.39 thf(f262,plain,(
% 0.15/0.39 ((exists_in_world @ math @ sK3) = $false) | ~spl1_2),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f260])).
% 0.15/0.39 thf(f260,plain,(
% 0.15/0.39 ((exists_in_world @ math @ sK3) = $false) | ($true = $false) | ~spl1_2),
% 0.15/0.39 inference(superposition,[],[f232,f255])).
% 0.15/0.39 thf(f255,plain,(
% 0.15/0.39 ( ! [X0 : $i] : (((rel_s4 @ X0 @ (sK4 @ math)) = $false)) ) | ~spl1_2),
% 0.15/0.39 inference(avatar_component_clause,[],[f254])).
% 0.15/0.39 thf(f232,plain,(
% 0.15/0.39 ( ! [X1 : mu] : (($true = (rel_s4 @ sK3 @ (sK4 @ X1))) | ((exists_in_world @ X1 @ sK3) = $false)) )),
% 0.15/0.39 inference(not_proxy_clausification,[],[f230])).
% 0.15/0.39 thf(f230,plain,(
% 0.15/0.39 ( ! [X1 : mu] : (((exists_in_world @ X1 @ sK3) = $false) | ((~ (rel_s4 @ sK3 @ (sK4 @ X1))) = $false)) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f229])).
% 0.15/0.39 thf(f229,plain,(
% 0.15/0.39 ( ! [X1 : mu] : ((((teach @ john @ X1 @ (sK4 @ X1)) | (~ (rel_s4 @ sK3 @ (sK4 @ X1)))) = $false) | ((exists_in_world @ X1 @ sK3) = $false)) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f228])).
% 0.15/0.39 thf(f228,plain,(
% 0.15/0.39 ( ! [X1 : mu] : ((((^[Y0 : $i]: ((teach @ john @ X1 @ Y0) | (~ (rel_s4 @ sK3 @ Y0)))) @ (sK4 @ X1)) = $false) | ((exists_in_world @ X1 @ sK3) = $false)) )),
% 0.15/0.39 inference(sigma_clausification,[],[f227])).
% 0.15/0.39 thf(f227,plain,(
% 0.15/0.39 ( ! [X1 : mu] : (((!! @ $i @ (^[Y0 : $i]: ((teach @ john @ X1 @ Y0) | (~ (rel_s4 @ sK3 @ Y0))))) = $false) | ((exists_in_world @ X1 @ sK3) = $false)) )),
% 0.15/0.39 inference(not_proxy_clausification,[],[f226])).
% 0.15/0.39 thf(f226,plain,(
% 0.15/0.39 ( ! [X1 : mu] : (((exists_in_world @ X1 @ sK3) = $false) | ($true = (~ (!! @ $i @ (^[Y0 : $i]: ((teach @ john @ X1 @ Y0) | (~ (rel_s4 @ sK3 @ Y0)))))))) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f225])).
% 0.15/0.39 thf(f225,plain,(
% 0.15/0.39 ( ! [X1 : mu] : ((((exists_in_world @ X1 @ sK3) => (~ (!! @ $i @ (^[Y0 : $i]: ((teach @ john @ X1 @ Y0) | (~ (rel_s4 @ sK3 @ Y0))))))) = $true)) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f224])).
% 0.15/0.39 thf(f224,plain,(
% 0.15/0.39 ( ! [X1 : mu] : (($true = ((^[Y0 : mu]: ((exists_in_world @ Y0 @ sK3) => (~ (!! @ $i @ (^[Y1 : $i]: ((teach @ john @ Y0 @ Y1) | (~ (rel_s4 @ sK3 @ Y1)))))))) @ X1))) )),
% 0.15/0.39 inference(pi_clausification,[],[f223])).
% 0.15/0.39 thf(f223,plain,(
% 0.15/0.39 ($true = (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ sK3) => (~ (!! @ $i @ (^[Y1 : $i]: ((teach @ john @ Y0 @ Y1) | (~ (rel_s4 @ sK3 @ Y1))))))))))),
% 0.15/0.39 inference(not_proxy_clausification,[],[f222])).
% 0.15/0.39 thf(f222,plain,(
% 0.15/0.39 ($false = (~ (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ sK3) => (~ (!! @ $i @ (^[Y1 : $i]: ((teach @ john @ Y0 @ Y1) | (~ (rel_s4 @ sK3 @ Y1)))))))))))),
% 0.15/0.39 inference(beta_eta_normalization,[],[f221])).
% 0.15/0.39 thf(f221,plain,(
% 0.15/0.39 ($false = ((^[Y0 : $i]: (~ (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (~ (!! @ $i @ (^[Y2 : $i]: ((teach @ john @ Y1 @ Y2) | (~ (rel_s4 @ Y0 @ Y2))))))))))) @ sK3))),
% 0.15/0.39 inference(sigma_clausification,[],[f220])).
% 0.15/0.39 thf(f220,plain,(
% 0.15/0.39 ($true != (!! @ $i @ (^[Y0 : $i]: (~ (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (~ (!! @ $i @ (^[Y2 : $i]: ((teach @ john @ Y1 @ Y2) | (~ (rel_s4 @ Y0 @ Y2)))))))))))))),
% 0.15/0.39 inference(beta_eta_normalization,[],[f191])).
% 0.15/0.39 thf(f191,plain,(
% 0.15/0.39 ($true != ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : mu > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : mu > $i > $o]: ((^[Y2 : $i]: (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y2) => (Y1 @ Y3 @ Y2))))))) @ (^[Y1 : mu]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ (Y0 @ Y1)))))) @ (^[Y0 : mu]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (rel_s4 @ Y2 @ Y3)))))))) @ (teach @ john @ Y0))))))),
% 0.15/0.39 inference(definition_unfolding,[],[f137,f165,f188,f151])).
% 0.15/0.39 thf(f151,plain,(
% 0.15/0.39 (mbox_s4 = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_s4 @ Y1 @ Y2)))))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f111])).
% 0.15/0.39 thf(f111,plain,(
% 0.15/0.39 (mbox_s4 = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_s4 @ Y1 @ Y2)))))))))),
% 0.15/0.39 inference(fool_elimination,[],[f110])).
% 0.15/0.39 thf(f110,plain,(
% 0.15/0.39 ((^[X0 : $i > $o, X1 : $i] : (! [X2] : (~(rel_s4 @ X1 @ X2) | (X0 @ X2)))) = mbox_s4)),
% 0.15/0.39 inference(rectify,[],[f32])).
% 0.15/0.39 thf(f32,axiom,(
% 0.15/0.39 ((^[X3 : $i > $o, X2 : $i] : (! [X6] : (~(rel_s4 @ X2 @ X6) | (X3 @ X6)))) = mbox_s4)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox_s4)).
% 0.15/0.39 thf(f188,plain,(
% 0.15/0.39 (mexists_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : mu > $i > $o]: ((^[Y2 : $i]: (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y2) => (Y1 @ Y3 @ Y2))))))) @ (^[Y1 : mu]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ (Y0 @ Y1)))))))),
% 0.15/0.39 inference(definition_unfolding,[],[f174,f166,f171,f166])).
% 0.15/0.39 thf(f171,plain,(
% 0.15/0.39 (mforall_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (Y0 @ Y2 @ Y1))))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f65])).
% 0.15/0.39 thf(f65,plain,(
% 0.15/0.39 (mforall_ind = (^[Y0 : mu > $i > $o]: ((^[Y1 : $i]: (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (Y0 @ Y2 @ Y1))))))))),
% 0.15/0.39 inference(fool_elimination,[],[f64])).
% 0.15/0.39 thf(f64,plain,(
% 0.15/0.39 (mforall_ind = (^[X0 : mu > $i > $o, X1 : $i] : (! [X2 : mu] : ((exists_in_world @ X2 @ X1) => (X0 @ X2 @ X1)))))),
% 0.15/0.39 inference(rectify,[],[f15])).
% 0.15/0.39 thf(f15,axiom,(
% 0.15/0.39 (mforall_ind = (^[X3 : mu > $i > $o, X2 : $i] : (! [X0 : mu] : ((exists_in_world @ X0 @ X2) => (X3 @ X0 @ X2)))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mforall_ind)).
% 0.15/0.39 thf(f166,plain,(
% 0.15/0.39 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f117])).
% 0.15/0.39 thf(f117,plain,(
% 0.15/0.39 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.15/0.39 inference(fool_elimination,[],[f116])).
% 0.15/0.39 thf(f116,plain,(
% 0.15/0.39 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.15/0.39 inference(rectify,[],[f2])).
% 0.15/0.39 thf(f2,axiom,(
% 0.15/0.39 (mnot = (^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.15/0.39 thf(f174,plain,(
% 0.15/0.39 (mexists_ind = (^[Y0 : mu > $i > $o]: (mnot @ (mforall_ind @ (^[Y1 : mu]: (mnot @ (Y0 @ Y1)))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f85])).
% 0.15/0.39 thf(f85,plain,(
% 0.15/0.39 (mexists_ind = (^[Y0 : mu > $i > $o]: (mnot @ (mforall_ind @ (^[Y1 : mu]: (mnot @ (Y0 @ Y1)))))))),
% 0.15/0.39 inference(fool_elimination,[],[f84])).
% 0.15/0.39 thf(f84,plain,(
% 0.15/0.39 (mexists_ind = (^[X0 : mu > $i > $o] : (mnot @ (mforall_ind @ (^[X1 : mu] : (mnot @ (X0 @ X1)))))))),
% 0.15/0.39 inference(rectify,[],[f16])).
% 0.15/0.39 thf(f16,axiom,(
% 0.15/0.39 (mexists_ind = (^[X3 : mu > $i > $o] : (mnot @ (mforall_ind @ (^[X0 : mu] : (mnot @ (X3 @ X0)))))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mexists_ind)).
% 0.15/0.39 thf(f165,plain,(
% 0.15/0.39 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.15/0.39 inference(cnf_transformation,[],[f131])).
% 0.15/0.39 thf(f131,plain,(
% 0.15/0.39 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.15/0.39 inference(fool_elimination,[],[f130])).
% 0.15/0.39 thf(f130,plain,(
% 0.15/0.39 (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.15/0.39 inference(rectify,[],[f28])).
% 0.15/0.39 thf(f28,axiom,(
% 0.15/0.39 (mvalid = (^[X3 : $i > $o] : (! [X2] : (X3 @ X2))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.15/0.39 thf(f137,plain,(
% 0.15/0.39 ($true != (mvalid @ (mexists_ind @ (^[Y0 : mu]: (mbox_s4 @ (teach @ john @ Y0))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f132])).
% 0.15/0.39 thf(f132,plain,(
% 0.15/0.39 ($true != (mvalid @ (mexists_ind @ (^[Y0 : mu]: (mbox_s4 @ (teach @ john @ Y0))))))),
% 0.15/0.39 inference(flattening,[],[f107])).
% 0.15/0.39 thf(f107,plain,(
% 0.15/0.39 ~($true = (mvalid @ (mexists_ind @ (^[Y0 : mu]: (mbox_s4 @ (teach @ john @ Y0))))))),
% 0.15/0.39 inference(fool_elimination,[],[f106])).
% 0.15/0.39 thf(f106,plain,(
% 0.15/0.39 ~(mvalid @ (mexists_ind @ (^[X0 : mu] : (mbox_s4 @ (teach @ john @ X0)))))),
% 0.15/0.39 inference(rectify,[],[f45])).
% 0.15/0.39 thf(f45,negated_conjecture,(
% 0.15/0.39 ~(mvalid @ (mexists_ind @ (^[X0 : mu] : (mbox_s4 @ (teach @ john @ X0)))))),
% 0.15/0.39 inference(negated_conjecture,[],[f44])).
% 0.15/0.39 thf(f44,conjecture,(
% 0.15/0.39 (mvalid @ (mexists_ind @ (^[X0 : mu] : (mbox_s4 @ (teach @ john @ X0)))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query)).
% 0.15/0.39 thf(f257,plain,(
% 0.15/0.39 spl1_2 | spl1_1),
% 0.15/0.39 inference(avatar_split_clause,[],[f247,f250,f254])).
% 0.15/0.39 thf(f247,plain,(
% 0.15/0.39 ( ! [X0 : $i] : (((exists_in_world @ math @ sK3) = $false) | ((rel_s4 @ X0 @ (sK4 @ math)) = $false)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f246])).
% 0.15/0.39 thf(f246,plain,(
% 0.15/0.39 ( ! [X0 : $i] : (((exists_in_world @ math @ sK3) = $false) | ($true = $false) | ((rel_s4 @ X0 @ (sK4 @ math)) = $false)) )),
% 0.15/0.39 inference(superposition,[],[f219,f231])).
% 0.15/0.39 thf(f231,plain,(
% 0.15/0.39 ( ! [X1 : mu] : (((teach @ john @ X1 @ (sK4 @ X1)) = $false) | ((exists_in_world @ X1 @ sK3) = $false)) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f229])).
% 0.15/0.39 thf(f219,plain,(
% 0.15/0.39 ( ! [X2 : $i,X1 : $i] : (($true = (teach @ john @ math @ X2)) | ((rel_s4 @ X1 @ X2) = $false)) )),
% 0.15/0.39 inference(not_proxy_clausification,[],[f206])).
% 0.15/0.39 thf(f206,plain,(
% 0.15/0.39 ( ! [X2 : $i,X1 : $i] : (((~ (teach @ john @ math @ X2)) = $false) | ((rel_s4 @ X1 @ X2) = $false)) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f205])).
% 0.15/0.39 thf(f205,plain,(
% 0.15/0.39 ( ! [X2 : $i,X1 : $i] : (((rel_s4 @ X1 @ X2) = $false) | (((((~ (teach @ sue @ psych @ X2)) | (~ (teach @ mary @ psych @ X2))) | (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X2) => (~ (teach @ Y0 @ cs @ X2)))))) | (~ (teach @ john @ math @ X2))) = $false)) )),
% 0.15/0.39 inference(not_proxy_clausification,[],[f204])).
% 0.15/0.39 thf(f204,plain,(
% 0.15/0.39 ( ! [X2 : $i,X1 : $i] : (((rel_s4 @ X1 @ X2) = $false) | ($true = (~ ((((~ (teach @ sue @ psych @ X2)) | (~ (teach @ mary @ psych @ X2))) | (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X2) => (~ (teach @ Y0 @ cs @ X2)))))) | (~ (teach @ john @ math @ X2)))))) )),
% 0.15/0.39 inference(not_proxy_clausification,[],[f203])).
% 0.15/0.39 thf(f203,plain,(
% 0.15/0.39 ( ! [X2 : $i,X1 : $i] : (($true = (~ (rel_s4 @ X1 @ X2))) | ($true = (~ ((((~ (teach @ sue @ psych @ X2)) | (~ (teach @ mary @ psych @ X2))) | (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X2) => (~ (teach @ Y0 @ cs @ X2)))))) | (~ (teach @ john @ math @ X2)))))) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f202])).
% 0.15/0.39 thf(f202,plain,(
% 0.15/0.39 ( ! [X2 : $i,X1 : $i] : (($true = ((~ ((((~ (teach @ sue @ psych @ X2)) | (~ (teach @ mary @ psych @ X2))) | (!! @ mu @ (^[Y0 : mu]: ((exists_in_world @ Y0 @ X2) => (~ (teach @ Y0 @ cs @ X2)))))) | (~ (teach @ john @ math @ X2)))) | (~ (rel_s4 @ X1 @ X2))))) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f201])).
% 0.15/0.39 thf(f201,plain,(
% 0.15/0.39 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((~ ((((~ (teach @ sue @ psych @ Y0)) | (~ (teach @ mary @ psych @ Y0))) | (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (~ (teach @ Y1 @ cs @ Y0)))))) | (~ (teach @ john @ math @ Y0)))) | (~ (rel_s4 @ X1 @ Y0)))) @ X2))) )),
% 0.15/0.39 inference(pi_clausification,[],[f200])).
% 0.15/0.39 thf(f200,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((~ ((((~ (teach @ sue @ psych @ Y0)) | (~ (teach @ mary @ psych @ Y0))) | (!! @ mu @ (^[Y1 : mu]: ((exists_in_world @ Y1 @ Y0) => (~ (teach @ Y1 @ cs @ Y0)))))) | (~ (teach @ john @ math @ Y0)))) | (~ (rel_s4 @ X1 @ Y0))))))) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f199])).
% 0.15/0.39 thf(f199,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ ((((~ (teach @ sue @ psych @ Y1)) | (~ (teach @ mary @ psych @ Y1))) | (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (~ (teach @ Y2 @ cs @ Y1)))))) | (~ (teach @ john @ math @ Y1)))) | (~ (rel_s4 @ Y0 @ Y1)))))) @ X1))) )),
% 0.15/0.39 inference(pi_clausification,[],[f198])).
% 0.15/0.39 thf(f198,plain,(
% 0.15/0.39 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ ((((~ (teach @ sue @ psych @ Y1)) | (~ (teach @ mary @ psych @ Y1))) | (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (~ (teach @ Y2 @ cs @ Y1)))))) | (~ (teach @ john @ math @ Y1)))) | (~ (rel_s4 @ Y0 @ Y1))))))))),
% 0.15/0.39 inference(boolean_simplification,[],[f197])).
% 0.15/0.39 thf(f197,plain,(
% 0.15/0.39 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (((~ (~ ((~ (teach @ sue @ psych @ Y1)) | (~ (teach @ mary @ psych @ Y1))))) | (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (~ (teach @ Y2 @ cs @ Y1)))))) | (~ (teach @ john @ math @ Y1)))) | (~ (rel_s4 @ Y0 @ Y1))))))))),
% 0.15/0.39 inference(boolean_simplification,[],[f196])).
% 0.15/0.39 thf(f196,plain,(
% 0.15/0.39 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ (((~ (~ ((~ (teach @ sue @ psych @ Y1)) | (~ (teach @ mary @ psych @ Y1))))) | (~ (~ (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (~ (teach @ Y2 @ cs @ Y1)))))))) | (~ (teach @ john @ math @ Y1)))) | (~ (rel_s4 @ Y0 @ Y1))))))))),
% 0.15/0.39 inference(boolean_simplification,[],[f195])).
% 0.15/0.39 thf(f195,plain,(
% 0.15/0.39 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((~ ((~ (~ ((~ (~ ((~ (teach @ sue @ psych @ Y1)) | (~ (teach @ mary @ psych @ Y1))))) | (~ (~ (!! @ mu @ (^[Y2 : mu]: ((exists_in_world @ Y2 @ Y1) => (~ (teach @ Y2 @ cs @ Y1)))))))))) | (~ (teach @ john @ math @ Y1)))) | (~ (rel_s4 @ Y0 @ Y1))))))))),
% 0.15/0.39 inference(beta_eta_normalization,[],[f194])).
% 0.15/0.39 thf(f194,plain,(
% 0.15/0.39 ($true = ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_s4 @ Y1 @ Y2)))))))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))) @ (teach @ john @ math) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))) @ ((^[Y0 : mu > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (~ (Y1 @ Y2))))) @ ((^[Y1 : mu > $i > $o]: ((^[Y2 : $i]: (!! @ mu @ (^[Y3 : mu]: ((exists_in_world @ Y3 @ Y2) => (Y1 @ Y3 @ Y2))))))) @ (^[Y1 : mu]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ (Y0 @ Y1)))))) @ (^[Y0 : mu]: (teach @ Y0 @ cs))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))) @ (teach @ mary @ psych) @ (teach @ sue @ psych)))))))),
% 0.15/0.39 inference(definition_unfolding,[],[f150,f165,f151,f182,f182,f188,f182])).
% 0.15/0.39 thf(f182,plain,(
% 0.15/0.39 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))))),
% 0.15/0.39 inference(definition_unfolding,[],[f180,f166,f179,f166,f166])).
% 0.15/0.39 thf(f179,plain,(
% 0.15/0.39 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f101])).
% 0.15/0.39 thf(f101,plain,(
% 0.15/0.39 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.15/0.39 inference(fool_elimination,[],[f100])).
% 0.15/0.39 thf(f100,plain,(
% 0.15/0.39 (mor = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))))),
% 0.15/0.39 inference(rectify,[],[f3])).
% 0.15/0.39 thf(f3,axiom,(
% 0.15/0.39 (mor = (^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X3 @ X2) | (X4 @ X2))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.15/0.39 thf(f180,plain,(
% 0.15/0.39 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mor @ (mnot @ Y0) @ (mnot @ Y1)))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f63])).
% 0.15/0.39 thf(f63,plain,(
% 0.15/0.39 (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mor @ (mnot @ Y0) @ (mnot @ Y1)))))))),
% 0.15/0.39 inference(fool_elimination,[],[f62])).
% 0.15/0.39 thf(f62,plain,(
% 0.15/0.39 ((^[X0 : $i > $o, X1 : $i > $o] : (mnot @ (mor @ (mnot @ X0) @ (mnot @ X1)))) = mand)),
% 0.15/0.39 inference(rectify,[],[f8])).
% 0.15/0.39 thf(f8,axiom,(
% 0.15/0.39 ((^[X3 : $i > $o, X4 : $i > $o] : (mnot @ (mor @ (mnot @ X3) @ (mnot @ X4)))) = mand)),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mand)).
% 0.15/0.39 thf(f150,plain,(
% 0.15/0.39 ($true = (mvalid @ (mbox_s4 @ (mand @ (teach @ john @ math) @ (mand @ (mexists_ind @ (^[Y0 : mu]: (teach @ Y0 @ cs))) @ (mand @ (teach @ mary @ psych) @ (teach @ sue @ psych)))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f77])).
% 0.15/0.39 thf(f77,plain,(
% 0.15/0.39 ($true = (mvalid @ (mbox_s4 @ (mand @ (teach @ john @ math) @ (mand @ (mexists_ind @ (^[Y0 : mu]: (teach @ Y0 @ cs))) @ (mand @ (teach @ mary @ psych) @ (teach @ sue @ psych)))))))),
% 0.15/0.39 inference(fool_elimination,[],[f76])).
% 0.15/0.39 thf(f76,plain,(
% 0.15/0.39 (mvalid @ (mbox_s4 @ (mand @ (teach @ john @ math) @ (mand @ (mexists_ind @ (^[X0 : mu] : (teach @ X0 @ cs))) @ (mand @ (teach @ mary @ psych) @ (teach @ sue @ psych))))))),
% 0.15/0.39 inference(rectify,[],[f43])).
% 0.15/0.39 thf(f43,axiom,(
% 0.15/0.39 (mvalid @ (mbox_s4 @ (mand @ (teach @ john @ math) @ (mand @ (mexists_ind @ (^[X0 : mu] : (teach @ X0 @ cs))) @ (mand @ (teach @ mary @ psych) @ (teach @ sue @ psych))))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',db)).
% 0.15/0.39 % SZS output end Proof for theBenchmark
% 0.15/0.39 % (20370)------------------------------
% 0.15/0.39 % (20370)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (20370)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (20370)Memory used [KB]: 5756
% 0.15/0.39 % (20370)Time elapsed: 0.017 s
% 0.15/0.39 % (20370)Instructions burned: 20 (million)
% 0.15/0.39 % (20370)------------------------------
% 0.15/0.39 % (20370)------------------------------
% 0.15/0.39 % (20369)Success in time 0.031 s
% 0.15/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------