TSTP Solution File: SYO419^1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO419^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 : n004.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:22 EDT 2024

% Result   : Theorem 0.22s 0.41s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYO419^1 : TPTP v8.2.0. Released v4.0.0.
% 0.14/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.15/0.35  % Computer : n004.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   : Mon May 20 09:04:23 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a TH0_THM_EQU_NAR problem
% 0.22/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.22/0.39  % (6715)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.22/0.39  % (6717)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.22/0.39  % (6716)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.22/0.39  % (6718)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.39  % (6719)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.22/0.39  % (6720)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.22/0.39  % (6721)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.22/0.39  % (6718)Instruction limit reached!
% 0.22/0.39  % (6718)------------------------------
% 0.22/0.39  % (6718)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39  % (6718)Termination reason: Unknown
% 0.22/0.39  % (6718)Termination phase: shuffling
% 0.22/0.39  % (6719)Instruction limit reached!
% 0.22/0.39  % (6719)------------------------------
% 0.22/0.39  % (6719)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39  % (6719)Termination reason: Unknown
% 0.22/0.39  % (6719)Termination phase: shuffling
% 0.22/0.39  
% 0.22/0.39  % (6719)Memory used [KB]: 1023
% 0.22/0.39  % (6719)Time elapsed: 0.004 s
% 0.22/0.39  % (6719)Instructions burned: 2 (million)
% 0.22/0.39  % (6722)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.22/0.39  % (6719)------------------------------
% 0.22/0.39  % (6719)------------------------------
% 0.22/0.39  
% 0.22/0.39  % (6718)Memory used [KB]: 1023
% 0.22/0.39  % (6718)Time elapsed: 0.004 s
% 0.22/0.39  % (6718)Instructions burned: 2 (million)
% 0.22/0.39  % (6718)------------------------------
% 0.22/0.39  % (6718)------------------------------
% 0.22/0.40  % (6716)Instruction limit reached!
% 0.22/0.40  % (6716)------------------------------
% 0.22/0.40  % (6716)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40  % (6716)Termination reason: Unknown
% 0.22/0.40  % (6716)Termination phase: shuffling
% 0.22/0.40  
% 0.22/0.40  % (6716)Memory used [KB]: 1023
% 0.22/0.40  % (6716)Time elapsed: 0.006 s
% 0.22/0.40  % (6716)Instructions burned: 4 (million)
% 0.22/0.40  % (6716)------------------------------
% 0.22/0.40  % (6716)------------------------------
% 0.22/0.40  % (6722)Instruction limit reached!
% 0.22/0.40  % (6722)------------------------------
% 0.22/0.40  % (6722)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40  % (6722)Termination reason: Unknown
% 0.22/0.40  % (6722)Termination phase: shuffling
% 0.22/0.40  
% 0.22/0.40  % (6722)Memory used [KB]: 1023
% 0.22/0.40  % (6722)Time elapsed: 0.005 s
% 0.22/0.40  % (6722)Instructions burned: 3 (million)
% 0.22/0.40  % (6722)------------------------------
% 0.22/0.40  % (6722)------------------------------
% 0.22/0.40  % (6720)Refutation not found, incomplete strategy
% 0.22/0.40  % (6720)------------------------------
% 0.22/0.40  % (6720)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40  % (6720)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.40  
% 0.22/0.40  
% 0.22/0.40  % (6720)Memory used [KB]: 5628
% 0.22/0.40  % (6720)Time elapsed: 0.010 s
% 0.22/0.40  % (6720)Instructions burned: 7 (million)
% 0.22/0.40  % (6720)------------------------------
% 0.22/0.40  % (6720)------------------------------
% 0.22/0.40  % (6715)First to succeed.
% 0.22/0.40  % (6717)Also succeeded, but the first one will report.
% 0.22/0.41  % (6715)Refutation found. Thanks to Tanya!
% 0.22/0.41  % SZS status Theorem for theBenchmark
% 0.22/0.41  % SZS output start Proof for theBenchmark
% 0.22/0.41  thf(type_def_5, type, mu: $tType).
% 0.22/0.41  thf(func_def_0, type, mu: $tType).
% 0.22/0.41  thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.22/0.41  thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_15, type, mtrue: $i > $o).
% 0.22/0.41  thf(func_def_16, type, mfalse: $i > $o).
% 0.22/0.41  thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.22/0.41  thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.22/0.41  thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.22/0.41  thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.22/0.41  thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.22/0.41  thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.22/0.41  thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.22/0.41  thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.22/0.41  thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.22/0.41  thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.22/0.41  thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.22/0.41  thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.22/0.41  thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.22/0.41  thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.22/0.41  thf(func_def_33, type, rel_d: $i > $i > $o).
% 0.22/0.41  thf(func_def_34, type, mbox_d: ($i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_35, type, mdia_d: ($i > $o) > $i > $o).
% 0.22/0.41  thf(func_def_36, type, p: $i > $o).
% 0.22/0.41  thf(func_def_53, type, sK1: $i > $i).
% 0.22/0.41  thf(f168,plain,(
% 0.22/0.41    $false),
% 0.22/0.41    inference(trivial_inequality_removal,[],[f167])).
% 0.22/0.41  thf(f167,plain,(
% 0.22/0.41    ($true = $false)),
% 0.22/0.41    inference(superposition,[],[f165,f155])).
% 0.22/0.41  thf(f155,plain,(
% 0.22/0.41    ( ! [X1 : $i] : (($true = (rel_d @ X1 @ (sK1 @ X1)))) )),
% 0.22/0.41    inference(sigma_clausification,[],[f154])).
% 0.22/0.41  thf(f154,plain,(
% 0.22/0.41    ( ! [X1 : $i] : (($true = (?? @ $i @ (rel_d @ X1)))) )),
% 0.22/0.41    inference(beta_eta_normalization,[],[f153])).
% 0.22/0.41  thf(f153,plain,(
% 0.22/0.41    ( ! [X1 : $i] : ((((^[Y0 : $i]: (?? @ $i @ (rel_d @ Y0))) @ X1) = $true)) )),
% 0.22/0.41    inference(pi_clausification,[],[f152])).
% 0.22/0.41  thf(f152,plain,(
% 0.22/0.41    ($true = (!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (rel_d @ Y0)))))),
% 0.22/0.41    inference(beta_eta_normalization,[],[f150])).
% 0.22/0.41  thf(f150,plain,(
% 0.22/0.41    ($true = ((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y1 @ Y2)))))) @ rel_d))),
% 0.22/0.41    inference(definition_unfolding,[],[f132,f124])).
% 0.22/0.41  thf(f124,plain,(
% 0.22/0.41    (mserial = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y1 @ Y2)))))))),
% 0.22/0.41    inference(cnf_transformation,[],[f95])).
% 0.22/0.41  thf(f95,plain,(
% 0.22/0.41    (mserial = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y1 @ Y2)))))))),
% 0.22/0.41    inference(fool_elimination,[],[f94])).
% 0.22/0.41  thf(f94,plain,(
% 0.22/0.41    (mserial = (^[X0 : $i > $i > $o] : (! [X1] : ? [X2] : (X0 @ X1 @ X2))))),
% 0.22/0.41    inference(rectify,[],[f20])).
% 0.22/0.41  thf(f20,axiom,(
% 0.22/0.41    (mserial = (^[X6 : $i > $i > $o] : (! [X8] : ? [X9] : (X6 @ X8 @ X9))))),
% 0.22/0.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mserial)).
% 0.22/0.41  thf(f132,plain,(
% 0.22/0.41    ((mserial @ rel_d) = $true)),
% 0.22/0.41    inference(cnf_transformation,[],[f45])).
% 0.22/0.41  thf(f45,plain,(
% 0.22/0.41    ((mserial @ rel_d) = $true)),
% 0.22/0.41    inference(fool_elimination,[],[f44])).
% 0.22/0.41  thf(f44,plain,(
% 0.22/0.41    (mserial @ rel_d)),
% 0.22/0.41    inference(rectify,[],[f34])).
% 0.22/0.41  thf(f34,axiom,(
% 0.22/0.41    (mserial @ rel_d)),
% 0.22/0.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1)).
% 0.22/0.41  thf(f165,plain,(
% 0.22/0.41    ( ! [X1 : $i] : (((rel_d @ sK2 @ X1) = $false)) )),
% 0.22/0.41    inference(not_proxy_clausification,[],[f164])).
% 0.22/0.41  thf(f164,plain,(
% 0.22/0.41    ( ! [X1 : $i] : (($true = (~ (rel_d @ sK2 @ X1)))) )),
% 0.22/0.41    inference(beta_eta_normalization,[],[f163])).
% 0.22/0.41  thf(f163,plain,(
% 0.22/0.41    ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (~ (rel_d @ sK2 @ Y0))) @ X1))) )),
% 0.22/0.41    inference(pi_clausification,[],[f162])).
% 0.22/0.41  thf(f162,plain,(
% 0.22/0.41    ($true = (!! @ $i @ (^[Y0 : $i]: (~ (rel_d @ sK2 @ Y0)))))),
% 0.22/0.41    inference(not_proxy_clausification,[],[f161])).
% 0.22/0.41  thf(f161,plain,(
% 0.22/0.41    ((~ (!! @ $i @ (^[Y0 : $i]: (~ (rel_d @ sK2 @ Y0))))) = $false)),
% 0.22/0.41    inference(beta_eta_normalization,[],[f160])).
% 0.22/0.41  thf(f160,plain,(
% 0.22/0.41    (((^[Y0 : $i]: (~ (!! @ $i @ (^[Y1 : $i]: (~ (rel_d @ Y0 @ Y1)))))) @ sK2) = $false)),
% 0.22/0.41    inference(sigma_clausification,[],[f159])).
% 0.22/0.41  thf(f159,plain,(
% 0.22/0.41    ($true != (!! @ $i @ (^[Y0 : $i]: (~ (!! @ $i @ (^[Y1 : $i]: (~ (rel_d @ Y0 @ Y1))))))))),
% 0.22/0.41    inference(boolean_simplification,[],[f158])).
% 0.22/0.41  thf(f158,plain,(
% 0.22/0.41    ($true != (!! @ $i @ (^[Y0 : $i]: (~ (!! @ $i @ (^[Y1 : $i]: ($false | (~ (rel_d @ Y0 @ Y1)))))))))),
% 0.22/0.41    inference(boolean_simplification,[],[f157])).
% 0.22/0.41  thf(f157,plain,(
% 0.22/0.41    ((!! @ $i @ (^[Y0 : $i]: (~ (!! @ $i @ (^[Y1 : $i]: ((~ $true) | (~ (rel_d @ Y0 @ Y1)))))))) != $true)),
% 0.22/0.41    inference(boolean_simplification,[],[f156])).
% 0.22/0.41  thf(f156,plain,(
% 0.22/0.41    ($true != (!! @ $i @ (^[Y0 : $i]: (~ (!! @ $i @ (^[Y1 : $i]: ((~ ((~ (~ (p @ Y1))) | (~ (p @ Y1)))) | (~ (rel_d @ Y0 @ Y1)))))))))),
% 0.22/0.41    inference(beta_eta_normalization,[],[f151])).
% 0.22/0.41  thf(f151,plain,(
% 0.22/0.41    ($true != ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_d @ 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)))))) @ p @ ((^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))) @ p))))))),
% 0.22/0.41    inference(definition_unfolding,[],[f135,f113,f125,f138,f140,f125])).
% 0.22/0.41  thf(f140,plain,(
% 0.22/0.41    (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.22/0.41    inference(definition_unfolding,[],[f110,f125,f107,f125,f125])).
% 0.22/0.41  thf(f107,plain,(
% 0.22/0.41    (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.22/0.41    inference(cnf_transformation,[],[f80])).
% 0.22/0.41  thf(f80,plain,(
% 0.22/0.41    (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.22/0.41    inference(fool_elimination,[],[f79])).
% 0.22/0.41  thf(f79,plain,(
% 0.22/0.41    ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))) = mor)),
% 0.22/0.41    inference(rectify,[],[f4])).
% 0.22/0.41  thf(f4,axiom,(
% 0.22/0.41    ((^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X3 @ X2) | (X4 @ X2))) = mor)),
% 0.22/0.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mor)).
% 0.22/0.41  thf(f110,plain,(
% 0.22/0.41    (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mor @ (mnot @ Y0) @ (mnot @ Y1)))))))),
% 0.22/0.41    inference(cnf_transformation,[],[f87])).
% 0.22/0.41  thf(f87,plain,(
% 0.22/0.41    (mand = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mor @ (mnot @ Y0) @ (mnot @ Y1)))))))),
% 0.22/0.41    inference(fool_elimination,[],[f86])).
% 0.22/0.41  thf(f86,plain,(
% 0.22/0.41    ((^[X0 : $i > $o, X1 : $i > $o] : (mnot @ (mor @ (mnot @ X0) @ (mnot @ X1)))) = mand)),
% 0.22/0.41    inference(rectify,[],[f5])).
% 0.22/0.41  thf(f5,axiom,(
% 0.22/0.41    ((^[X3 : $i > $o, X4 : $i > $o] : (mnot @ (mor @ (mnot @ X3) @ (mnot @ X4)))) = mand)),
% 0.22/0.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mand)).
% 0.22/0.41  thf(f138,plain,(
% 0.22/0.41    (mbox_d = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_d @ Y1 @ Y2)))))))))),
% 0.22/0.41    inference(cnf_transformation,[],[f78])).
% 0.22/0.41  thf(f78,plain,(
% 0.22/0.41    (mbox_d = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) | (~ (rel_d @ Y1 @ Y2)))))))))),
% 0.22/0.41    inference(fool_elimination,[],[f77])).
% 0.22/0.41  thf(f77,plain,(
% 0.22/0.41    ((^[X0 : $i > $o, X1 : $i] : (! [X2] : (~(rel_d @ X1 @ X2) | (X0 @ X2)))) = mbox_d)),
% 0.22/0.41    inference(rectify,[],[f32])).
% 0.22/0.41  thf(f32,axiom,(
% 0.22/0.41    ((^[X3 : $i > $o, X2 : $i] : (! [X7] : (~(rel_d @ X2 @ X7) | (X3 @ X7)))) = mbox_d)),
% 0.22/0.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox_d)).
% 0.22/0.41  thf(f125,plain,(
% 0.22/0.41    (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.22/0.41    inference(cnf_transformation,[],[f60])).
% 0.22/0.41  thf(f60,plain,(
% 0.22/0.41    (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.22/0.41    inference(fool_elimination,[],[f59])).
% 0.22/0.41  thf(f59,plain,(
% 0.22/0.41    (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.22/0.41    inference(rectify,[],[f3])).
% 0.22/0.41  thf(f3,axiom,(
% 0.22/0.41    (mnot = (^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))))),
% 0.22/0.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mnot)).
% 0.22/0.41  thf(f113,plain,(
% 0.22/0.41    (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.22/0.41    inference(cnf_transformation,[],[f103])).
% 0.22/0.41  thf(f103,plain,(
% 0.22/0.41    (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.22/0.41    inference(fool_elimination,[],[f102])).
% 0.22/0.41  thf(f102,plain,(
% 0.22/0.41    (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.22/0.41    inference(rectify,[],[f28])).
% 0.22/0.41  thf(f28,axiom,(
% 0.22/0.41    (mvalid = (^[X3 : $i > $o] : (! [X2] : (X3 @ X2))))),
% 0.22/0.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mvalid)).
% 0.22/0.41  thf(f135,plain,(
% 0.22/0.41    ((mvalid @ (mnot @ (mbox_d @ (mand @ p @ (mnot @ p))))) != $true)),
% 0.22/0.41    inference(cnf_transformation,[],[f104])).
% 0.22/0.41  thf(f104,plain,(
% 0.22/0.41    ((mvalid @ (mnot @ (mbox_d @ (mand @ p @ (mnot @ p))))) != $true)),
% 0.22/0.41    inference(flattening,[],[f101])).
% 0.22/0.41  thf(f101,plain,(
% 0.22/0.41    ~((mvalid @ (mnot @ (mbox_d @ (mand @ p @ (mnot @ p))))) = $true)),
% 0.22/0.41    inference(fool_elimination,[],[f100])).
% 0.22/0.41  thf(f100,plain,(
% 0.22/0.41    ~(mvalid @ (mnot @ (mbox_d @ (mand @ p @ (mnot @ p)))))),
% 0.22/0.41    inference(rectify,[],[f36])).
% 0.22/0.41  thf(f36,negated_conjecture,(
% 0.22/0.41    ~(mvalid @ (mnot @ (mbox_d @ (mand @ p @ (mnot @ p)))))),
% 0.22/0.41    inference(negated_conjecture,[],[f35])).
% 0.22/0.41  thf(f35,conjecture,(
% 0.22/0.41    (mvalid @ (mnot @ (mbox_d @ (mand @ p @ (mnot @ p)))))),
% 0.22/0.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove)).
% 0.22/0.41  % SZS output end Proof for theBenchmark
% 0.22/0.41  % (6715)------------------------------
% 0.22/0.41  % (6715)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.41  % (6715)Termination reason: Refutation
% 0.22/0.41  
% 0.22/0.41  % (6715)Memory used [KB]: 5628
% 0.22/0.41  % (6715)Time elapsed: 0.014 s
% 0.22/0.41  % (6715)Instructions burned: 10 (million)
% 0.22/0.41  % (6715)------------------------------
% 0.22/0.41  % (6715)------------------------------
% 0.22/0.41  % (6714)Success in time 0.028 s
% 0.22/0.41  % Vampire---4.8 exiting
%------------------------------------------------------------------------------