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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : LCL722^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n015.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 00:22:22 EDT 2024

% Result   : Theorem 0.21s 0.38s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : LCL722^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.03/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.13/0.35  % Computer : n015.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon May 20 02:44:53 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  This is a TH0_THM_EQU_NAR problem
% 0.13/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/sandbox2/benchmark/theBenchmark.p
% 0.21/0.37  % (29103)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.37  % (29102)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.37  % (29096)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.21/0.37  % (29097)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.21/0.37  % (29098)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.21/0.37  % (29099)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.37  % (29103)Instruction limit reached!
% 0.21/0.37  % (29103)------------------------------
% 0.21/0.37  % (29103)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37  % (29103)Termination reason: Unknown
% 0.21/0.37  % (29103)Termination phase: shuffling
% 0.21/0.37  
% 0.21/0.37  % (29103)Memory used [KB]: 1023
% 0.21/0.37  % (29103)Time elapsed: 0.003 s
% 0.21/0.37  % (29103)Instructions burned: 3 (million)
% 0.21/0.37  % (29103)------------------------------
% 0.21/0.37  % (29103)------------------------------
% 0.21/0.37  % (29100)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.37  % (29101)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.21/0.37  % (29099)Instruction limit reached!
% 0.21/0.37  % (29099)------------------------------
% 0.21/0.37  % (29099)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37  % (29099)Termination reason: Unknown
% 0.21/0.37  % (29099)Termination phase: shuffling
% 0.21/0.37  
% 0.21/0.37  % (29099)Memory used [KB]: 1023
% 0.21/0.37  % (29099)Time elapsed: 0.003 s
% 0.21/0.37  % (29099)Instructions burned: 2 (million)
% 0.21/0.37  % (29099)------------------------------
% 0.21/0.37  % (29099)------------------------------
% 0.21/0.37  % (29097)Instruction limit reached!
% 0.21/0.37  % (29097)------------------------------
% 0.21/0.37  % (29097)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37  % (29097)Termination reason: Unknown
% 0.21/0.37  % (29097)Termination phase: Property scanning
% 0.21/0.37  
% 0.21/0.37  % (29097)Memory used [KB]: 1023
% 0.21/0.37  % (29097)Time elapsed: 0.004 s
% 0.21/0.37  % (29097)Instructions burned: 4 (million)
% 0.21/0.37  % (29097)------------------------------
% 0.21/0.37  % (29097)------------------------------
% 0.21/0.37  % (29100)Instruction limit reached!
% 0.21/0.37  % (29100)------------------------------
% 0.21/0.37  % (29100)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37  % (29100)Termination reason: Unknown
% 0.21/0.37  % (29100)Termination phase: shuffling
% 0.21/0.37  
% 0.21/0.37  % (29100)Memory used [KB]: 1023
% 0.21/0.37  % (29100)Time elapsed: 0.003 s
% 0.21/0.37  % (29100)Instructions burned: 3 (million)
% 0.21/0.37  % (29100)------------------------------
% 0.21/0.37  % (29100)------------------------------
% 0.21/0.38  % (29102)First to succeed.
% 0.21/0.38  % (29101)Refutation not found, incomplete strategy
% 0.21/0.38  % (29101)------------------------------
% 0.21/0.38  % (29101)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38  % (29101)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.38  
% 0.21/0.38  
% 0.21/0.38  % (29101)Memory used [KB]: 5628
% 0.21/0.38  % (29101)Time elapsed: 0.006 s
% 0.21/0.38  % (29101)Instructions burned: 7 (million)
% 0.21/0.38  % (29101)------------------------------
% 0.21/0.38  % (29101)------------------------------
% 0.21/0.38  % (29096)Also succeeded, but the first one will report.
% 0.21/0.38  % (29102)Refutation found. Thanks to Tanya!
% 0.21/0.38  % SZS status Theorem for theBenchmark
% 0.21/0.38  % SZS output start Proof for theBenchmark
% 0.21/0.38  thf(type_def_5, type, mu: $tType).
% 0.21/0.38  thf(func_def_0, type, mu: $tType).
% 0.21/0.38  thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.21/0.38  thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_15, type, mtrue: $i > $o).
% 0.21/0.38  thf(func_def_16, type, mfalse: $i > $o).
% 0.21/0.38  thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.21/0.38  thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.21/0.38  thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.21/0.38  thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.21/0.38  thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.21/0.38  thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.21/0.38  thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.21/0.38  thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.21/0.38  thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.21/0.38  thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.21/0.38  thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.21/0.38  thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.21/0.38  thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.21/0.38  thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.21/0.38  thf(func_def_33, type, rel_m: $i > $i > $o).
% 0.21/0.38  thf(func_def_34, type, mbox_m: ($i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_35, type, mdia_m: ($i > $o) > $i > $o).
% 0.21/0.38  thf(func_def_36, type, phi: $i > $o).
% 0.21/0.38  thf(f170,plain,(
% 0.21/0.38    $false),
% 0.21/0.38    inference(trivial_inequality_removal,[],[f169])).
% 0.21/0.38  thf(f169,plain,(
% 0.21/0.38    ($true = $false)),
% 0.21/0.38    inference(forward_demodulation,[],[f168,f155])).
% 0.21/0.38  thf(f155,plain,(
% 0.21/0.38    ((phi @ sK1) = $false)),
% 0.21/0.38    inference(binary_proxy_clausification,[],[f154])).
% 0.21/0.38  thf(f154,plain,(
% 0.21/0.38    (((~ (!! @ $i @ (^[Y0 : $i]: ((~ (rel_m @ sK1 @ Y0)) | (phi @ Y0))))) | (phi @ sK1)) = $false)),
% 0.21/0.38    inference(beta_eta_normalization,[],[f153])).
% 0.21/0.38  thf(f153,plain,(
% 0.21/0.38    (((^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((~ (rel_m @ Y0 @ Y1)) | (phi @ Y1))))) | (phi @ Y0))) @ sK1) = $false)),
% 0.21/0.38    inference(sigma_clausification,[],[f152])).
% 0.21/0.38  thf(f152,plain,(
% 0.21/0.38    ((!! @ $i @ (^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((~ (rel_m @ Y0 @ Y1)) | (phi @ Y1))))) | (phi @ Y0)))) != $true)),
% 0.21/0.38    inference(beta_eta_normalization,[],[f150])).
% 0.21/0.38  thf(f150,plain,(
% 0.21/0.38    (((^[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]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_m @ Y1 @ Y2)) | (Y0 @ Y2))))))) @ phi) @ phi)) != $true)),
% 0.21/0.38    inference(definition_unfolding,[],[f112,f135,f141,f113])).
% 0.21/0.38  thf(f113,plain,(
% 0.21/0.38    (mbox_m = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_m @ Y1 @ Y2)) | (Y0 @ Y2))))))))),
% 0.21/0.38    inference(cnf_transformation,[],[f60])).
% 0.21/0.38  thf(f60,plain,(
% 0.21/0.38    (mbox_m = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((~ (rel_m @ Y1 @ Y2)) | (Y0 @ Y2))))))))),
% 0.21/0.38    inference(fool_elimination,[],[f59])).
% 0.21/0.38  thf(f59,plain,(
% 0.21/0.38    (mbox_m = (^[X0 : $i > $o, X1 : $i] : (! [X2] : ((X0 @ X2) | ~(rel_m @ X1 @ X2)))))),
% 0.21/0.38    inference(rectify,[],[f32])).
% 0.21/0.38  thf(f32,axiom,(
% 0.21/0.38    (mbox_m = (^[X3 : $i > $o, X2 : $i] : (! [X7] : ((X3 @ X7) | ~(rel_m @ X2 @ X7)))))),
% 0.21/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox_m)).
% 0.21/0.38  thf(f141,plain,(
% 0.21/0.38    (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.21/0.38    inference(definition_unfolding,[],[f108,f130,f134])).
% 0.21/0.38  thf(f134,plain,(
% 0.21/0.38    (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.21/0.38    inference(cnf_transformation,[],[f78])).
% 0.21/0.38  thf(f78,plain,(
% 0.21/0.38    (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.21/0.38    inference(fool_elimination,[],[f77])).
% 0.21/0.38  thf(f77,plain,(
% 0.21/0.38    ((^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))) = mnot)),
% 0.21/0.38    inference(rectify,[],[f3])).
% 0.21/0.38  thf(f3,axiom,(
% 0.21/0.38    ((^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))) = mnot)),
% 0.21/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.21/0.38  thf(f130,plain,(
% 0.21/0.38    (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.21/0.38    inference(cnf_transformation,[],[f62])).
% 0.21/0.38  thf(f62,plain,(
% 0.21/0.38    (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.21/0.38    inference(fool_elimination,[],[f61])).
% 0.21/0.38  thf(f61,plain,(
% 0.21/0.38    ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X1 @ X2) | (X0 @ X2))) = mor)),
% 0.21/0.38    inference(rectify,[],[f4])).
% 0.21/0.38  thf(f4,axiom,(
% 0.21/0.38    ((^[X3 : $i > $o, X4 : $i > $o, X2 : $i] : ((X4 @ X2) | (X3 @ X2))) = mor)),
% 0.21/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.21/0.38  thf(f108,plain,(
% 0.21/0.38    (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.21/0.38    inference(cnf_transformation,[],[f41])).
% 0.21/0.38  thf(f41,plain,(
% 0.21/0.38    (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.21/0.38    inference(fool_elimination,[],[f40])).
% 0.21/0.38  thf(f40,plain,(
% 0.21/0.38    (mimplies = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.21/0.38    inference(rectify,[],[f6])).
% 0.21/0.38  thf(f6,axiom,(
% 0.21/0.38    (mimplies = (^[X3 : $i > $o, X4 : $i > $o] : (mor @ (mnot @ X3) @ X4)))),
% 0.21/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies)).
% 0.21/0.38  thf(f135,plain,(
% 0.21/0.38    (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.21/0.38    inference(cnf_transformation,[],[f66])).
% 0.21/0.38  thf(f66,plain,(
% 0.21/0.38    (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.21/0.38    inference(fool_elimination,[],[f65])).
% 0.21/0.38  thf(f65,plain,(
% 0.21/0.38    ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.21/0.38    inference(rectify,[],[f28])).
% 0.21/0.38  thf(f28,axiom,(
% 0.21/0.38    ((^[X3 : $i > $o] : (! [X2] : (X3 @ X2))) = mvalid)),
% 0.21/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.21/0.38  thf(f112,plain,(
% 0.21/0.38    ((mvalid @ (mimplies @ (mbox_m @ phi) @ phi)) != $true)),
% 0.21/0.38    inference(cnf_transformation,[],[f104])).
% 0.21/0.38  thf(f104,plain,(
% 0.21/0.38    ((mvalid @ (mimplies @ (mbox_m @ phi) @ phi)) != $true)),
% 0.21/0.38    inference(flattening,[],[f74])).
% 0.21/0.38  thf(f74,plain,(
% 0.21/0.38    ~((mvalid @ (mimplies @ (mbox_m @ phi) @ phi)) = $true)),
% 0.21/0.38    inference(fool_elimination,[],[f73])).
% 0.21/0.38  thf(f73,plain,(
% 0.21/0.38    ~(mvalid @ (mimplies @ (mbox_m @ phi) @ phi))),
% 0.21/0.38    inference(rectify,[],[f36])).
% 0.21/0.38  thf(f36,negated_conjecture,(
% 0.21/0.38    ~(mvalid @ (mimplies @ (mbox_m @ phi) @ phi))),
% 0.21/0.38    inference(negated_conjecture,[],[f35])).
% 0.21/0.38  thf(f35,conjecture,(
% 0.21/0.38    (mvalid @ (mimplies @ (mbox_m @ phi) @ phi))),
% 0.21/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)).
% 0.21/0.38  thf(f168,plain,(
% 0.21/0.38    ($true = (phi @ sK1))),
% 0.21/0.38    inference(trivial_inequality_removal,[],[f166])).
% 0.21/0.38  thf(f166,plain,(
% 0.21/0.38    ($true = $false) | ($true = (phi @ sK1))),
% 0.21/0.38    inference(superposition,[],[f164,f161])).
% 0.21/0.38  thf(f161,plain,(
% 0.21/0.38    ( ! [X1 : $i] : (((rel_m @ sK1 @ X1) = $false) | ((phi @ X1) = $true)) )),
% 0.21/0.38    inference(not_proxy_clausification,[],[f160])).
% 0.21/0.38  thf(f160,plain,(
% 0.21/0.38    ( ! [X1 : $i] : (($true = (~ (rel_m @ sK1 @ X1))) | ((phi @ X1) = $true)) )),
% 0.21/0.38    inference(binary_proxy_clausification,[],[f159])).
% 0.21/0.38  thf(f159,plain,(
% 0.21/0.38    ( ! [X1 : $i] : (($true = ((~ (rel_m @ sK1 @ X1)) | (phi @ X1)))) )),
% 0.21/0.38    inference(beta_eta_normalization,[],[f158])).
% 0.21/0.38  thf(f158,plain,(
% 0.21/0.38    ( ! [X1 : $i] : ((((^[Y0 : $i]: ((~ (rel_m @ sK1 @ Y0)) | (phi @ Y0))) @ X1) = $true)) )),
% 0.21/0.38    inference(pi_clausification,[],[f157])).
% 0.21/0.38  thf(f157,plain,(
% 0.21/0.38    ((!! @ $i @ (^[Y0 : $i]: ((~ (rel_m @ sK1 @ Y0)) | (phi @ Y0)))) = $true)),
% 0.21/0.38    inference(not_proxy_clausification,[],[f156])).
% 0.21/0.38  thf(f156,plain,(
% 0.21/0.38    ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (rel_m @ sK1 @ Y0)) | (phi @ Y0))))) = $false)),
% 0.21/0.38    inference(binary_proxy_clausification,[],[f154])).
% 0.21/0.38  thf(f164,plain,(
% 0.21/0.38    ( ! [X1 : $i] : (((rel_m @ X1 @ X1) = $true)) )),
% 0.21/0.38    inference(beta_eta_normalization,[],[f163])).
% 0.21/0.38  thf(f163,plain,(
% 0.21/0.38    ( ! [X1 : $i] : ((((^[Y0 : $i]: (rel_m @ Y0 @ Y0)) @ X1) = $true)) )),
% 0.21/0.38    inference(pi_clausification,[],[f162])).
% 0.21/0.38  thf(f162,plain,(
% 0.21/0.38    ((!! @ $i @ (^[Y0 : $i]: (rel_m @ Y0 @ Y0))) = $true)),
% 0.21/0.38    inference(beta_eta_normalization,[],[f151])).
% 0.21/0.38  thf(f151,plain,(
% 0.21/0.38    (((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))) @ rel_m) = $true)),
% 0.21/0.38    inference(definition_unfolding,[],[f131,f138])).
% 0.21/0.38  thf(f138,plain,(
% 0.21/0.38    (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.21/0.38    inference(cnf_transformation,[],[f45])).
% 0.21/0.38  thf(f45,plain,(
% 0.21/0.38    (mreflexive = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.21/0.38    inference(fool_elimination,[],[f44])).
% 0.21/0.38  thf(f44,plain,(
% 0.21/0.38    (mreflexive = (^[X0 : $i > $i > $o] : (! [X1] : (X0 @ X1 @ X1))))),
% 0.21/0.38    inference(rectify,[],[f18])).
% 0.21/0.38  thf(f18,axiom,(
% 0.21/0.38    (mreflexive = (^[X6 : $i > $i > $o] : (! [X8] : (X6 @ X8 @ X8))))),
% 0.21/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mreflexive)).
% 0.21/0.38  thf(f131,plain,(
% 0.21/0.38    ((mreflexive @ rel_m) = $true)),
% 0.21/0.38    inference(cnf_transformation,[],[f58])).
% 0.21/0.38  thf(f58,plain,(
% 0.21/0.38    ((mreflexive @ rel_m) = $true)),
% 0.21/0.38    inference(fool_elimination,[],[f57])).
% 0.21/0.38  thf(f57,plain,(
% 0.21/0.38    (mreflexive @ rel_m)),
% 0.21/0.38    inference(rectify,[],[f34])).
% 0.21/0.38  thf(f34,axiom,(
% 0.21/0.38    (mreflexive @ rel_m)),
% 0.21/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1)).
% 0.21/0.38  % SZS output end Proof for theBenchmark
% 0.21/0.38  % (29102)------------------------------
% 0.21/0.38  % (29102)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38  % (29102)Termination reason: Refutation
% 0.21/0.38  
% 0.21/0.38  % (29102)Memory used [KB]: 5628
% 0.21/0.38  % (29102)Time elapsed: 0.008 s
% 0.21/0.38  % (29102)Instructions burned: 9 (million)
% 0.21/0.38  % (29102)------------------------------
% 0.21/0.38  % (29102)------------------------------
% 0.21/0.38  % (29095)Success in time 0.008 s
% 0.21/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------