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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU484^1 : TPTP v8.2.0. Released v3.6.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 : 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 03:49:06 EDT 2024

% Result   : Theorem 0.11s 0.28s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem    : SEU484^1 : TPTP v8.2.0. Released v3.6.0.
% 0.00/0.08  % 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.07/0.26  % Computer : n016.cluster.edu
% 0.07/0.26  % Model    : x86_64 x86_64
% 0.07/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26  % Memory   : 8042.1875MB
% 0.07/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26  % CPULimit   : 300
% 0.07/0.26  % WCLimit    : 300
% 0.07/0.26  % DateTime   : Sun May 19 16:23:07 EDT 2024
% 0.07/0.26  % CPUTime    : 
% 0.07/0.26  This is a TH0_THM_EQU_NAR problem
% 0.07/0.27  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.07/0.28  % (1459)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.07/0.28  % (1460)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.07/0.28  % (1462)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.07/0.28  % (1461)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.07/0.28  % (1457)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.07/0.28  % (1463)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.07/0.28  % (1464)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.07/0.28  % (1465)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.07/0.28  % (1461)Instruction limit reached!
% 0.07/0.28  % (1461)------------------------------
% 0.07/0.28  % (1461)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.07/0.28  % (1461)Termination reason: Unknown
% 0.07/0.28  % (1461)Termination phase: shuffling
% 0.07/0.28  
% 0.07/0.28  % (1461)Memory used [KB]: 1023
% 0.07/0.28  % (1462)Instruction limit reached!
% 0.07/0.28  % (1462)------------------------------
% 0.07/0.28  % (1462)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.07/0.28  % (1461)Time elapsed: 0.002 s
% 0.07/0.28  % (1461)Instructions burned: 3 (million)
% 0.07/0.28  % (1461)------------------------------
% 0.07/0.28  % (1461)------------------------------
% 0.07/0.28  % (1462)Termination reason: Unknown
% 0.07/0.28  % (1462)Termination phase: shuffling
% 0.07/0.28  
% 0.07/0.28  % (1462)Memory used [KB]: 1023
% 0.07/0.28  % (1462)Time elapsed: 0.002 s
% 0.07/0.28  % (1462)Instructions burned: 3 (million)
% 0.07/0.28  % (1462)------------------------------
% 0.07/0.28  % (1462)------------------------------
% 0.07/0.28  % (1465)Instruction limit reached!
% 0.07/0.28  % (1465)------------------------------
% 0.07/0.28  % (1465)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.07/0.28  % (1465)Termination reason: Unknown
% 0.07/0.28  % (1465)Termination phase: shuffling
% 0.07/0.28  
% 0.07/0.28  % (1465)Memory used [KB]: 1023
% 0.07/0.28  % (1465)Time elapsed: 0.002 s
% 0.07/0.28  % (1465)Instructions burned: 4 (million)
% 0.07/0.28  % (1465)------------------------------
% 0.07/0.28  % (1465)------------------------------
% 0.07/0.28  % (1459)Instruction limit reached!
% 0.07/0.28  % (1459)------------------------------
% 0.07/0.28  % (1459)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.07/0.28  % (1459)Termination reason: Unknown
% 0.07/0.28  % (1459)Termination phase: Preprocessing 1
% 0.07/0.28  
% 0.07/0.28  % (1459)Memory used [KB]: 1023
% 0.07/0.28  % (1459)Time elapsed: 0.003 s
% 0.07/0.28  % (1459)Instructions burned: 6 (million)
% 0.07/0.28  % (1459)------------------------------
% 0.07/0.28  % (1459)------------------------------
% 0.07/0.28  % (1460)Refutation not found, incomplete strategy
% 0.07/0.28  % (1460)------------------------------
% 0.07/0.28  % (1460)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.07/0.28  % (1460)Termination reason: Refutation not found, incomplete strategy
% 0.07/0.28  
% 0.07/0.28  
% 0.07/0.28  % (1460)Memory used [KB]: 5628
% 0.07/0.28  % (1460)Time elapsed: 0.005 s
% 0.07/0.28  % (1460)Instructions burned: 12 (million)
% 0.07/0.28  % (1463)First to succeed.
% 0.07/0.28  % (1460)------------------------------
% 0.07/0.28  % (1460)------------------------------
% 0.11/0.28  % (1463)Refutation found. Thanks to Tanya!
% 0.11/0.28  % SZS status Theorem for theBenchmark
% 0.11/0.28  % SZS output start Proof for theBenchmark
% 0.11/0.28  thf(func_def_0, type, subrel: ($i > $i > $o) > ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_2, type, inv: ($i > $i > $o) > $i > $i > $o).
% 0.11/0.28  thf(func_def_3, type, idem: (($i > $i > $o) > $i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_4, type, infl: (($i > $i > $o) > $i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_5, type, mono: (($i > $i > $o) > $i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_6, type, refl: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_7, type, irrefl: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_8, type, rc: ($i > $i > $o) > $i > $i > $o).
% 0.11/0.28  thf(func_def_9, type, symm: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_10, type, antisymm: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_11, type, asymm: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_12, type, sc: ($i > $i > $o) > $i > $i > $o).
% 0.11/0.28  thf(func_def_13, type, trans: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_14, type, tc: ($i > $i > $o) > $i > $i > $o).
% 0.11/0.28  thf(func_def_15, type, trc: ($i > $i > $o) > $i > $i > $o).
% 0.11/0.28  thf(func_def_16, type, trsc: ($i > $i > $o) > $i > $i > $o).
% 0.11/0.28  thf(func_def_17, type, po: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_18, type, so: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_19, type, total: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_20, type, term: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_21, type, ind: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_22, type, innf: ($i > $i > $o) > $i > $o).
% 0.11/0.28  thf(func_def_23, type, nfof: ($i > $i > $o) > $i > $i > $o).
% 0.11/0.28  thf(func_def_24, type, norm: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_25, type, join: ($i > $i > $o) > $i > $i > $o).
% 0.11/0.28  thf(func_def_26, type, lconfl: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_27, type, sconfl: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_28, type, confl: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_29, type, cr: ($i > $i > $o) > $o).
% 0.11/0.28  thf(func_def_44, type, sK0: $i > $i > $o).
% 0.11/0.28  thf(func_def_46, type, sK2: ($i > $o) > $i).
% 0.11/0.28  thf(func_def_47, type, ph3: !>[X0: $tType]:(X0)).
% 0.11/0.28  thf(f158,plain,(
% 0.11/0.28    $false),
% 0.11/0.28    inference(trivial_inequality_removal,[],[f157])).
% 0.11/0.28  thf(f157,plain,(
% 0.11/0.28    ($true = $false)),
% 0.11/0.28    inference(duplicate_literal_removal,[],[f156])).
% 0.11/0.28  thf(f156,plain,(
% 0.11/0.28    ($true = $false) | ($true = $false)),
% 0.11/0.28    inference(beta_eta_normalization,[],[f149])).
% 0.11/0.28  thf(f149,plain,(
% 0.11/0.28    ( ! [X1 : $i] : ((((^[Y0 : $i]: ($true)) @ X1) = $false) | (((^[Y0 : $i]: ($true)) @ (sK2 @ (^[Y0 : $i]: ($true)))) = $false)) )),
% 0.11/0.28    inference(primitive_instantiation,[],[f143])).
% 0.11/0.28  thf(f143,plain,(
% 0.11/0.28    ( ! [X0 : $i > $o,X1 : $i] : (((X0 @ (sK2 @ X0)) = $false) | ((X0 @ X1) = $false)) )),
% 0.11/0.28    inference(trivial_inequality_removal,[],[f136])).
% 0.11/0.28  thf(f136,plain,(
% 0.11/0.28    ( ! [X0 : $i > $o,X1 : $i] : (((X0 @ (sK2 @ X0)) = $false) | ($true = $false) | ((X0 @ X1) = $false)) )),
% 0.11/0.28    inference(superposition,[],[f117,f104])).
% 0.11/0.28  thf(f104,plain,(
% 0.11/0.28    ( ! [X1 : $i] : (((sK0 @ X1 @ X1) = $true)) )),
% 0.11/0.28    inference(beta_eta_normalization,[],[f103])).
% 0.11/0.28  thf(f103,plain,(
% 0.11/0.28    ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (sK0 @ Y0 @ Y0)) @ X1))) )),
% 0.11/0.28    inference(pi_clausification,[],[f102])).
% 0.11/0.28  thf(f102,plain,(
% 0.11/0.28    ($true = (!! @ $i @ (^[Y0 : $i]: (sK0 @ Y0 @ Y0))))),
% 0.11/0.28    inference(beta_eta_normalization,[],[f101])).
% 0.11/0.28  thf(f101,plain,(
% 0.11/0.28    ($true = ((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))) @ sK0))),
% 0.11/0.28    inference(definition_unfolding,[],[f97,f99])).
% 0.11/0.28  thf(f99,plain,(
% 0.11/0.28    (refl = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.11/0.28    inference(cnf_transformation,[],[f86])).
% 0.11/0.28  thf(f86,plain,(
% 0.11/0.28    (refl = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1 @ Y1)))))),
% 0.11/0.28    inference(fool_elimination,[],[f85])).
% 0.11/0.28  thf(f85,plain,(
% 0.11/0.28    (refl = (^[X0 : $i > $i > $o] : (! [X1] : (X0 @ X1 @ X1))))),
% 0.11/0.28    inference(rectify,[],[f6])).
% 0.11/0.28  thf(f6,axiom,(
% 0.11/0.28    (refl = (^[X0 : $i > $i > $o] : (! [X2] : (X0 @ X2 @ X2))))),
% 0.11/0.28    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexive)).
% 0.11/0.28  thf(f97,plain,(
% 0.11/0.28    ($true = (refl @ sK0))),
% 0.11/0.28    inference(cnf_transformation,[],[f94])).
% 0.11/0.28  thf(f94,plain,(
% 0.11/0.28    ($true = (term @ sK0)) & ($true = (refl @ sK0))),
% 0.11/0.28    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f92,f93])).
% 0.11/0.28  thf(f93,plain,(
% 0.11/0.28    ? [X0 : $i > $i > $o] : (((term @ X0) = $true) & ((refl @ X0) = $true)) => (($true = (term @ sK0)) & ($true = (refl @ sK0)))),
% 0.11/0.28    introduced(choice_axiom,[])).
% 0.11/0.28  thf(f92,plain,(
% 0.11/0.28    ? [X0 : $i > $i > $o] : (((term @ X0) = $true) & ((refl @ X0) = $true))),
% 0.11/0.28    inference(ennf_transformation,[],[f91])).
% 0.11/0.28  thf(f91,plain,(
% 0.11/0.28    ~! [X0 : $i > $i > $o] : (((refl @ X0) = $true) => ((term @ X0) != $true))),
% 0.11/0.28    inference(flattening,[],[f49])).
% 0.11/0.28  thf(f49,plain,(
% 0.11/0.28    ~! [X0 : $i > $i > $o] : (((refl @ X0) = $true) => ~((term @ X0) = $true))),
% 0.11/0.28    inference(fool_elimination,[],[f48])).
% 0.11/0.28  thf(f48,plain,(
% 0.11/0.28    ~! [X0 : $i > $i > $o] : ((refl @ X0) => ~(term @ X0))),
% 0.11/0.28    inference(rectify,[],[f31])).
% 0.11/0.28  thf(f31,negated_conjecture,(
% 0.11/0.28    ~! [X0 : $i > $i > $o] : ((refl @ X0) => ~(term @ X0))),
% 0.11/0.28    inference(negated_conjecture,[],[f30])).
% 0.11/0.28  thf(f30,conjecture,(
% 0.11/0.28    ! [X0 : $i > $i > $o] : ((refl @ X0) => ~(term @ X0))),
% 0.11/0.28    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexive_implies_non_terminating)).
% 0.11/0.28  thf(f117,plain,(
% 0.11/0.28    ( ! [X2 : $i,X3 : $i,X1 : $i > $o] : (((sK0 @ (sK2 @ X1) @ X3) = $false) | ((X1 @ X2) = $false) | ((X1 @ X3) = $false)) )),
% 0.11/0.28    inference(not_proxy_clausification,[],[f116])).
% 0.11/0.28  thf(f116,plain,(
% 0.11/0.28    ( ! [X2 : $i,X3 : $i,X1 : $i > $o] : (((~ (sK0 @ (sK2 @ X1) @ X3)) = $true) | ((X1 @ X2) = $false) | ((X1 @ X3) = $false)) )),
% 0.11/0.28    inference(binary_proxy_clausification,[],[f115])).
% 0.11/0.28  thf(f115,plain,(
% 0.11/0.28    ( ! [X2 : $i,X3 : $i,X1 : $i > $o] : (((X1 @ X2) = $false) | ($true = ((X1 @ X3) => (~ (sK0 @ (sK2 @ X1) @ X3))))) )),
% 0.11/0.28    inference(beta_eta_normalization,[],[f114])).
% 0.11/0.28  thf(f114,plain,(
% 0.11/0.28    ( ! [X2 : $i,X3 : $i,X1 : $i > $o] : (((X1 @ X2) = $false) | ($true = ((^[Y0 : $i]: ((X1 @ Y0) => (~ (sK0 @ (sK2 @ X1) @ Y0)))) @ X3))) )),
% 0.11/0.28    inference(pi_clausification,[],[f113])).
% 0.11/0.28  thf(f113,plain,(
% 0.11/0.28    ( ! [X2 : $i,X1 : $i > $o] : (($true = (!! @ $i @ (^[Y0 : $i]: ((X1 @ Y0) => (~ (sK0 @ (sK2 @ X1) @ Y0)))))) | ((X1 @ X2) = $false)) )),
% 0.11/0.28    inference(binary_proxy_clausification,[],[f111])).
% 0.11/0.28  thf(f111,plain,(
% 0.11/0.28    ( ! [X2 : $i,X1 : $i > $o] : (((X1 @ X2) = $false) | (((!! @ $i @ (^[Y0 : $i]: ((X1 @ Y0) => (~ (sK0 @ (sK2 @ X1) @ Y0))))) & (X1 @ (sK2 @ X1))) = $true)) )),
% 0.11/0.28    inference(beta_eta_normalization,[],[f110])).
% 0.11/0.28  thf(f110,plain,(
% 0.11/0.28    ( ! [X2 : $i,X1 : $i > $o] : (($true = ((^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((X1 @ Y1) => (~ (sK0 @ Y0 @ Y1))))) & (X1 @ Y0))) @ (sK2 @ X1))) | ((X1 @ X2) = $false)) )),
% 0.11/0.28    inference(sigma_clausification,[],[f109])).
% 0.11/0.28  thf(f109,plain,(
% 0.11/0.28    ( ! [X2 : $i,X1 : $i > $o] : (($true = (?? @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((X1 @ Y1) => (~ (sK0 @ Y0 @ Y1))))) & (X1 @ Y0))))) | ((X1 @ X2) = $false)) )),
% 0.11/0.28    inference(pi_clausification,[],[f108])).
% 0.11/0.28  thf(f108,plain,(
% 0.11/0.28    ( ! [X1 : $i > $o] : (((?? @ $i @ X1) = $false) | ($true = (?? @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((X1 @ Y1) => (~ (sK0 @ Y0 @ Y1))))) & (X1 @ Y0)))))) )),
% 0.11/0.28    inference(binary_proxy_clausification,[],[f107])).
% 0.11/0.28  thf(f107,plain,(
% 0.11/0.28    ( ! [X1 : $i > $o] : (($true = ((?? @ $i @ X1) => (?? @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((X1 @ Y1) => (~ (sK0 @ Y0 @ Y1))))) & (X1 @ Y0))))))) )),
% 0.11/0.28    inference(beta_eta_normalization,[],[f106])).
% 0.11/0.28  thf(f106,plain,(
% 0.11/0.28    ( ! [X1 : $i > $o] : (($true = ((^[Y0 : $i > $o]: ((?? @ $i @ Y0) => (?? @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (~ (sK0 @ Y1 @ Y2))))) & (Y0 @ Y1)))))) @ X1))) )),
% 0.11/0.28    inference(pi_clausification,[],[f105])).
% 0.11/0.28  thf(f105,plain,(
% 0.11/0.28    ($true = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((?? @ $i @ Y0) => (?? @ $i @ (^[Y1 : $i]: ((!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (~ (sK0 @ Y1 @ Y2))))) & (Y0 @ Y1))))))))),
% 0.11/0.28    inference(beta_eta_normalization,[],[f100])).
% 0.11/0.28  thf(f100,plain,(
% 0.11/0.28    (((^[Y0 : $i > $i > $o]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((?? @ $i @ (^[Y2 : $i]: (Y1 @ Y2))) => (?? @ $i @ (^[Y2 : $i]: ((!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) => (~ (Y0 @ Y2 @ Y3))))) & (Y1 @ Y2)))))))) @ sK0) = $true)),
% 0.11/0.28    inference(definition_unfolding,[],[f98,f96])).
% 0.11/0.28  thf(f96,plain,(
% 0.11/0.28    (term = (^[Y0 : $i > $i > $o]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((?? @ $i @ (^[Y2 : $i]: (Y1 @ Y2))) => (?? @ $i @ (^[Y2 : $i]: ((!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) => (~ (Y0 @ Y2 @ Y3))))) & (Y1 @ Y2)))))))))),
% 0.11/0.28    inference(cnf_transformation,[],[f73])).
% 0.11/0.28  thf(f73,plain,(
% 0.11/0.28    (term = (^[Y0 : $i > $i > $o]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((?? @ $i @ (^[Y2 : $i]: (Y1 @ Y2))) => (?? @ $i @ (^[Y2 : $i]: ((!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) => (~ (Y0 @ Y2 @ Y3))))) & (Y1 @ Y2)))))))))),
% 0.11/0.28    inference(fool_elimination,[],[f72])).
% 0.11/0.28  thf(f72,plain,(
% 0.11/0.28    ((^[X0 : $i > $i > $o] : (! [X1 : $i > $o] : (? [X2] : (X1 @ X2) => ? [X3] : ((X1 @ X3) & ! [X4] : ((X1 @ X4) => ~(X0 @ X3 @ X4)))))) = term)),
% 0.11/0.28    inference(rectify,[],[f20])).
% 0.11/0.28  thf(f20,axiom,(
% 0.11/0.28    ((^[X0 : $i > $i > $o] : (! [X6 : $i > $o] : (? [X2] : (X6 @ X2) => ? [X2] : ((X6 @ X2) & ! [X3] : ((X6 @ X3) => ~(X0 @ X2 @ X3)))))) = term)),
% 0.11/0.28    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',terminating)).
% 0.11/0.28  thf(f98,plain,(
% 0.11/0.28    ($true = (term @ sK0))),
% 0.11/0.28    inference(cnf_transformation,[],[f94])).
% 0.11/0.28  % SZS output end Proof for theBenchmark
% 0.11/0.28  % (1463)------------------------------
% 0.11/0.28  % (1463)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.28  % (1463)Termination reason: Refutation
% 0.11/0.28  
% 0.11/0.28  % (1463)Memory used [KB]: 5628
% 0.11/0.28  % (1463)Time elapsed: 0.006 s
% 0.11/0.28  % (1463)Instructions burned: 11 (million)
% 0.11/0.28  % (1463)------------------------------
% 0.11/0.28  % (1463)------------------------------
% 0.11/0.28  % (1455)Success in time 0.007 s
% 0.11/0.28  % Vampire---4.8 exiting
%------------------------------------------------------------------------------