TSTP Solution File: SEV384^5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEV384^5 : 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n011.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 04:13:38 EDT 2024

% Result   : Theorem 0.19s 0.37s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEV384^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/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.14/0.33  % Computer : n011.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Sun May 19 19:13:08 EDT 2024
% 0.14/0.33  % CPUTime    : 
% 0.14/0.33  This is a TH0_THM_NEQ_NAR problem
% 0.14/0.33  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.19/0.34  % (13121)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 (3000ds/2Mi)
% 0.19/0.34  % (13121)Instruction limit reached!
% 0.19/0.34  % (13121)------------------------------
% 0.19/0.34  % (13121)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.34  % (13121)Termination reason: Unknown
% 0.19/0.35  % (13121)Termination phase: Saturation
% 0.19/0.35  
% 0.19/0.35  % (13121)Memory used [KB]: 5500
% 0.19/0.35  % (13121)Time elapsed: 0.002 s
% 0.19/0.35  % (13121)Instructions burned: 2 (million)
% 0.19/0.35  % (13121)------------------------------
% 0.19/0.35  % (13121)------------------------------
% 0.19/0.35  % (13117)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.19/0.35  % (13119)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 (3000ds/27Mi)
% 0.19/0.35  % (13118)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 (3000ds/4Mi)
% 0.19/0.35  % (13120)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.19/0.35  % (13122)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 (3000ds/275Mi)
% 0.19/0.35  % (13123)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.19/0.35  % (13124)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.19/0.35  % (13120)Instruction limit reached!
% 0.19/0.35  % (13120)------------------------------
% 0.19/0.35  % (13120)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.35  % (13120)Termination reason: Unknown
% 0.19/0.35  % (13120)Termination phase: Saturation
% 0.19/0.35  
% 0.19/0.35  % (13120)Memory used [KB]: 5500
% 0.19/0.35  % (13120)Time elapsed: 0.004 s
% 0.19/0.35  % (13120)Instructions burned: 2 (million)
% 0.19/0.35  % (13120)------------------------------
% 0.19/0.35  % (13120)------------------------------
% 0.19/0.35  % (13125)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.19/0.35  % (13124)Instruction limit reached!
% 0.19/0.35  % (13124)------------------------------
% 0.19/0.35  % (13124)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.35  % (13124)Termination reason: Unknown
% 0.19/0.35  % (13124)Termination phase: Saturation
% 0.19/0.35  
% 0.19/0.35  % (13124)Memory used [KB]: 5500
% 0.19/0.35  % (13124)Time elapsed: 0.005 s
% 0.19/0.35  % (13124)Instructions burned: 4 (million)
% 0.19/0.35  % (13124)------------------------------
% 0.19/0.35  % (13124)------------------------------
% 0.19/0.35  % (13118)Instruction limit reached!
% 0.19/0.35  % (13118)------------------------------
% 0.19/0.35  % (13118)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.35  % (13118)Termination reason: Unknown
% 0.19/0.35  % (13118)Termination phase: Saturation
% 0.19/0.35  
% 0.19/0.35  % (13118)Memory used [KB]: 5500
% 0.19/0.35  % (13118)Time elapsed: 0.006 s
% 0.19/0.35  % (13118)Instructions burned: 5 (million)
% 0.19/0.35  % (13118)------------------------------
% 0.19/0.35  % (13118)------------------------------
% 0.19/0.35  % (13119)Refutation not found, incomplete strategy
% 0.19/0.35  % (13119)------------------------------
% 0.19/0.35  % (13119)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.35  % (13119)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.35  
% 0.19/0.35  
% 0.19/0.35  % (13119)Memory used [KB]: 5500
% 0.19/0.35  % (13119)Time elapsed: 0.006 s
% 0.19/0.35  % (13119)Instructions burned: 4 (million)
% 0.19/0.35  % (13119)------------------------------
% 0.19/0.35  % (13119)------------------------------
% 0.19/0.36  % (13123)Instruction limit reached!
% 0.19/0.36  % (13123)------------------------------
% 0.19/0.36  % (13123)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36  % (13123)Termination reason: Unknown
% 0.19/0.36  % (13123)Termination phase: Saturation
% 0.19/0.36  
% 0.19/0.36  % (13123)Memory used [KB]: 5628
% 0.19/0.36  % (13123)Time elapsed: 0.015 s
% 0.19/0.36  % (13123)Instructions burned: 18 (million)
% 0.19/0.36  % (13123)------------------------------
% 0.19/0.36  % (13123)------------------------------
% 0.19/0.37  % (13125)Instruction limit reached!
% 0.19/0.37  % (13125)------------------------------
% 0.19/0.37  % (13125)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37  % (13125)Termination reason: Unknown
% 0.19/0.37  % (13125)Termination phase: Saturation
% 0.19/0.37  
% 0.19/0.37  % (13125)Memory used [KB]: 5884
% 0.19/0.37  % (13125)Time elapsed: 0.014 s
% 0.19/0.37  % (13125)Instructions burned: 39 (million)
% 0.19/0.37  % (13125)------------------------------
% 0.19/0.37  % (13125)------------------------------
% 0.19/0.37  % (13126)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.19/0.37  % (13127)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.19/0.37  % (13128)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.19/0.37  % (13129)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.37  % (13122)First to succeed.
% 0.19/0.37  % (13127)Instruction limit reached!
% 0.19/0.37  % (13127)------------------------------
% 0.19/0.37  % (13127)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37  % (13127)Termination reason: Unknown
% 0.19/0.37  % (13127)Termination phase: Saturation
% 0.19/0.37  
% 0.19/0.37  % (13127)Memory used [KB]: 5500
% 0.19/0.37  % (13127)Time elapsed: 0.004 s
% 0.19/0.37  % (13127)Instructions burned: 3 (million)
% 0.19/0.37  % (13127)------------------------------
% 0.19/0.37  % (13127)------------------------------
% 0.19/0.37  % (13122)Refutation found. Thanks to Tanya!
% 0.19/0.37  % SZS status Theorem for theBenchmark
% 0.19/0.37  % SZS output start Proof for theBenchmark
% 0.19/0.37  thf(func_def_0, type, cP: $i > $o).
% 0.19/0.37  thf(func_def_1, type, s: $i > $o).
% 0.19/0.37  thf(func_def_2, type, cR: $i > $i > $o).
% 0.19/0.37  thf(func_def_7, type, sK1: ($i > $o) > $i).
% 0.19/0.37  thf(func_def_8, type, sK2: $i > $i).
% 0.19/0.37  thf(func_def_11, type, ph4: !>[X0: $tType]:(X0)).
% 0.19/0.37  thf(f299,plain,(
% 0.19/0.37    $false),
% 0.19/0.37    inference(avatar_sat_refutation,[],[f247,f258,f298])).
% 0.19/0.37  thf(f298,plain,(
% 0.19/0.37    spl3_7 | ~spl3_16),
% 0.19/0.37    inference(avatar_split_clause,[],[f295,f244,f136])).
% 0.19/0.37  thf(f136,plain,(
% 0.19/0.37    spl3_7 <=> ! [X0] : ($true = (cP @ X0))),
% 0.19/0.37    introduced(avatar_definition,[new_symbols(naming,[spl3_7])])).
% 0.19/0.37  thf(f244,plain,(
% 0.19/0.37    spl3_16 <=> ((cP @ (sK1 @ (^[Y0 : $i]: (~ (cP @ Y0))))) = $true)),
% 0.19/0.37    introduced(avatar_definition,[new_symbols(naming,[spl3_16])])).
% 0.19/0.37  thf(f295,plain,(
% 0.19/0.37    ( ! [X0 : $i] : (($true = (cP @ X0))) ) | ~spl3_16),
% 0.19/0.37    inference(trivial_inequality_removal,[],[f294])).
% 0.19/0.37  thf(f294,plain,(
% 0.19/0.37    ( ! [X0 : $i] : (($false = $true) | ($true = (cP @ X0))) ) | ~spl3_16),
% 0.19/0.37    inference(superposition,[],[f29,f246])).
% 0.19/0.37  thf(f246,plain,(
% 0.19/0.37    ((cP @ (sK1 @ (^[Y0 : $i]: (~ (cP @ Y0))))) = $true) | ~spl3_16),
% 0.19/0.37    inference(avatar_component_clause,[],[f244])).
% 0.19/0.37  thf(f29,plain,(
% 0.19/0.37    ( ! [X2 : $i,X5 : $i > $o] : (($false = (X5 @ (sK1 @ (^[Y0 : $i]: (~ (X5 @ Y0)))))) | ((X5 @ X2) = $true)) )),
% 0.19/0.37    inference(not_proxy_clausification,[],[f28])).
% 0.19/0.37  thf(f28,plain,(
% 0.19/0.37    ( ! [X2 : $i,X5 : $i > $o] : (($false = (X5 @ (sK1 @ (^[Y0 : $i]: (~ (X5 @ Y0)))))) | ((~ (X5 @ X2)) != $true)) )),
% 0.19/0.37    inference(not_proxy_clausification,[],[f27])).
% 0.19/0.37  thf(f27,plain,(
% 0.19/0.37    ( ! [X2 : $i,X5 : $i > $o] : (((~ (X5 @ (sK1 @ (^[Y0 : $i]: (~ (X5 @ Y0)))))) = $true) | ((~ (X5 @ X2)) != $true)) )),
% 0.19/0.37    inference(beta_eta_normalization,[],[f24])).
% 0.19/0.37  thf(f24,plain,(
% 0.19/0.37    ( ! [X2 : $i,X5 : $i > $o] : ((((^[Y0 : $i]: (~ (X5 @ Y0))) @ (sK1 @ (^[Y0 : $i]: (~ (X5 @ Y0))))) = $true) | (((^[Y0 : $i]: (~ (X5 @ Y0))) @ X2) != $true)) )),
% 0.19/0.37    inference(primitive_instantiation,[],[f17])).
% 0.19/0.37  thf(f17,plain,(
% 0.19/0.37    ( ! [X2 : $i,X1 : $i > $o] : (((X1 @ (sK1 @ X1)) = $true) | ($true != (X1 @ X2))) )),
% 0.19/0.37    inference(cnf_transformation,[],[f13])).
% 0.19/0.37  thf(f13,plain,(
% 0.19/0.37    (((cP @ sK0) != $true) & ((s @ sK0) = $true)) & ! [X1 : $i > $o,X2] : ((! [X4] : (($true != (cR @ (sK1 @ X1) @ X4)) | ((X1 @ X4) != $true)) & ((X1 @ (sK1 @ X1)) = $true)) | ($true != (X1 @ X2))) & ! [X5] : (((cP @ X5) = $true) | (((s @ (sK2 @ X5)) = $true) & ((cR @ X5 @ (sK2 @ X5)) = $true) & ((cP @ (sK2 @ X5)) != $true)))),
% 0.19/0.37    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f9,f12,f11,f10])).
% 0.19/0.37  thf(f10,plain,(
% 0.19/0.37    ? [X0] : (($true != (cP @ X0)) & ($true = (s @ X0))) => (((cP @ sK0) != $true) & ((s @ sK0) = $true))),
% 0.19/0.37    introduced(choice_axiom,[])).
% 0.19/0.37  thf(f11,plain,(
% 0.19/0.37    ! [X1 : $i > $o] : (? [X3] : (! [X4] : (($true != (cR @ X3 @ X4)) | ((X1 @ X4) != $true)) & ($true = (X1 @ X3))) => (! [X4] : (($true != (cR @ (sK1 @ X1) @ X4)) | ((X1 @ X4) != $true)) & ((X1 @ (sK1 @ X1)) = $true)))),
% 0.19/0.37    introduced(choice_axiom,[])).
% 0.19/0.37  thf(f12,plain,(
% 0.19/0.37    ! [X5] : (? [X6] : (((s @ X6) = $true) & ((cR @ X5 @ X6) = $true) & ((cP @ X6) != $true)) => (((s @ (sK2 @ X5)) = $true) & ((cR @ X5 @ (sK2 @ X5)) = $true) & ((cP @ (sK2 @ X5)) != $true)))),
% 0.19/0.37    introduced(choice_axiom,[])).
% 0.19/0.37  thf(f9,plain,(
% 0.19/0.37    ? [X0] : (($true != (cP @ X0)) & ($true = (s @ X0))) & ! [X1 : $i > $o,X2] : (? [X3] : (! [X4] : (($true != (cR @ X3 @ X4)) | ((X1 @ X4) != $true)) & ($true = (X1 @ X3))) | ($true != (X1 @ X2))) & ! [X5] : (((cP @ X5) = $true) | ? [X6] : (((s @ X6) = $true) & ((cR @ X5 @ X6) = $true) & ((cP @ X6) != $true)))),
% 0.19/0.37    inference(rectify,[],[f8])).
% 0.19/0.37  thf(f8,plain,(
% 0.19/0.37    ? [X6] : (((cP @ X6) != $true) & ((s @ X6) = $true)) & ! [X1 : $i > $o,X0] : (? [X2] : (! [X3] : (((cR @ X2 @ X3) != $true) | ($true != (X1 @ X3))) & ($true = (X1 @ X2))) | ((X1 @ X0) != $true)) & ! [X4] : (((cP @ X4) = $true) | ? [X5] : (((s @ X5) = $true) & ((cR @ X4 @ X5) = $true) & ((cP @ X5) != $true)))),
% 0.19/0.37    inference(flattening,[],[f7])).
% 0.19/0.37  thf(f7,plain,(
% 0.19/0.37    ? [X6] : (((cP @ X6) != $true) & ((s @ X6) = $true)) & (! [X1 : $i > $o,X0] : (? [X2] : (! [X3] : (((cR @ X2 @ X3) != $true) | ($true != (X1 @ X3))) & ($true = (X1 @ X2))) | ((X1 @ X0) != $true)) & ! [X4] : (((cP @ X4) = $true) | ? [X5] : (((cP @ X5) != $true) & (((cR @ X4 @ X5) = $true) & ((s @ X5) = $true)))))),
% 0.19/0.37    inference(ennf_transformation,[],[f6])).
% 0.19/0.37  thf(f6,plain,(
% 0.19/0.37    ~((! [X1 : $i > $o,X0] : (((X1 @ X0) = $true) => ? [X2] : (($true = (X1 @ X2)) & ! [X3] : (((cR @ X2 @ X3) = $true) => ($true != (X1 @ X3))))) & ! [X4] : (! [X5] : ((((cR @ X4 @ X5) = $true) & ((s @ X5) = $true)) => ((cP @ X5) = $true)) => ((cP @ X4) = $true))) => ! [X6] : (((s @ X6) = $true) => ((cP @ X6) = $true)))),
% 0.19/0.37    inference(flattening,[],[f5])).
% 0.19/0.37  thf(f5,plain,(
% 0.19/0.37    ~((! [X0,X1 : $i > $o] : (((X1 @ X0) = $true) => ? [X2] : (! [X3] : (((cR @ X2 @ X3) = $true) => ~($true = (X1 @ X3))) & ($true = (X1 @ X2)))) & ! [X4] : (! [X5] : ((((cR @ X4 @ X5) = $true) & ((s @ X5) = $true)) => ((cP @ X5) = $true)) => ((cP @ X4) = $true))) => ! [X6] : (((s @ X6) = $true) => ((cP @ X6) = $true)))),
% 0.19/0.37    inference(fool_elimination,[],[f4])).
% 0.19/0.37  thf(f4,plain,(
% 0.19/0.37    ~((! [X0,X1 : $i > $o] : ((X1 @ X0) => ? [X2] : (! [X3] : ((cR @ X2 @ X3) => ~(X1 @ X3)) & (X1 @ X2))) & ! [X4] : (! [X5] : (((s @ X5) & (cR @ X4 @ X5)) => (cP @ X5)) => (cP @ X4))) => ! [X6] : ((s @ X6) => (cP @ X6)))),
% 0.19/0.37    inference(rectify,[],[f2])).
% 0.19/0.37  thf(f2,negated_conjecture,(
% 0.19/0.37    ~((! [X1,X0 : $i > $o] : ((X0 @ X1) => ? [X2] : (! [X3] : ((cR @ X2 @ X3) => ~(X0 @ X3)) & (X0 @ X2))) & ! [X4] : (! [X5] : (((s @ X5) & (cR @ X4 @ X5)) => (cP @ X5)) => (cP @ X4))) => ! [X6] : ((s @ X6) => (cP @ X6)))),
% 0.19/0.37    inference(negated_conjecture,[],[f1])).
% 0.19/0.37  thf(f1,conjecture,(
% 0.19/0.37    (! [X1,X0 : $i > $o] : ((X0 @ X1) => ? [X2] : (! [X3] : ((cR @ X2 @ X3) => ~(X0 @ X3)) & (X0 @ X2))) & ! [X4] : (! [X5] : (((s @ X5) & (cR @ X4 @ X5)) => (cP @ X5)) => (cP @ X4))) => ! [X6] : ((s @ X6) => (cP @ X6))),
% 0.19/0.37    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM117B)).
% 0.19/0.37  thf(f258,plain,(
% 0.19/0.37    ~spl3_7),
% 0.19/0.37    inference(avatar_contradiction_clause,[],[f257])).
% 0.19/0.37  thf(f257,plain,(
% 0.19/0.37    $false | ~spl3_7),
% 0.19/0.37    inference(trivial_inequality_removal,[],[f251])).
% 0.19/0.37  thf(f251,plain,(
% 0.19/0.37    ($true != $true) | ~spl3_7),
% 0.19/0.37    inference(superposition,[],[f20,f137])).
% 0.19/0.37  thf(f137,plain,(
% 0.19/0.37    ( ! [X0 : $i] : (($true = (cP @ X0))) ) | ~spl3_7),
% 0.19/0.37    inference(avatar_component_clause,[],[f136])).
% 0.19/0.37  thf(f20,plain,(
% 0.19/0.37    ((cP @ sK0) != $true)),
% 0.19/0.37    inference(cnf_transformation,[],[f13])).
% 0.19/0.37  thf(f247,plain,(
% 0.19/0.37    spl3_16 | spl3_7),
% 0.19/0.37    inference(avatar_split_clause,[],[f232,f136,f244])).
% 0.19/0.37  thf(f232,plain,(
% 0.19/0.37    ( ! [X0 : $i] : (($true = (cP @ X0)) | ((cP @ (sK1 @ (^[Y0 : $i]: (~ (cP @ Y0))))) = $true)) )),
% 0.19/0.37    inference(trivial_inequality_removal,[],[f231])).
% 0.19/0.37  thf(f231,plain,(
% 0.19/0.37    ( ! [X0 : $i] : (($true = (cP @ X0)) | ($true != $true) | ((cP @ (sK1 @ (^[Y0 : $i]: (~ (cP @ Y0))))) = $true)) )),
% 0.19/0.37    inference(duplicate_literal_removal,[],[f220])).
% 0.19/0.37  thf(f220,plain,(
% 0.19/0.37    ( ! [X0 : $i] : (($true != $true) | ((cP @ (sK1 @ (^[Y0 : $i]: (~ (cP @ Y0))))) = $true) | ((cP @ (sK1 @ (^[Y0 : $i]: (~ (cP @ Y0))))) = $true) | ($true = (cP @ X0))) )),
% 0.19/0.37    inference(superposition,[],[f14,f92])).
% 0.19/0.37  thf(f92,plain,(
% 0.19/0.37    ( ! [X1 : $i,X4 : $i > $o] : (((X4 @ (sK2 @ (sK1 @ (^[Y0 : $i]: (~ (X4 @ Y0)))))) = $true) | ($true = (X4 @ X1)) | ((cP @ (sK1 @ (^[Y0 : $i]: (~ (X4 @ Y0))))) = $true)) )),
% 0.19/0.37    inference(not_proxy_clausification,[],[f91])).
% 0.19/0.37  thf(f91,plain,(
% 0.19/0.37    ( ! [X1 : $i,X4 : $i > $o] : (((~ (X4 @ X1)) != $true) | ((X4 @ (sK2 @ (sK1 @ (^[Y0 : $i]: (~ (X4 @ Y0)))))) = $true) | ((cP @ (sK1 @ (^[Y0 : $i]: (~ (X4 @ Y0))))) = $true)) )),
% 0.19/0.37    inference(not_proxy_clausification,[],[f90])).
% 0.19/0.37  thf(f90,plain,(
% 0.19/0.37    ( ! [X1 : $i,X4 : $i > $o] : (((cP @ (sK1 @ (^[Y0 : $i]: (~ (X4 @ Y0))))) = $true) | ((~ (X4 @ (sK2 @ (sK1 @ (^[Y0 : $i]: (~ (X4 @ Y0))))))) != $true) | ((~ (X4 @ X1)) != $true)) )),
% 0.19/0.37    inference(beta_eta_normalization,[],[f78])).
% 0.19/0.37  thf(f78,plain,(
% 0.19/0.37    ( ! [X1 : $i,X4 : $i > $o] : (($true != ((^[Y0 : $i]: (~ (X4 @ Y0))) @ (sK2 @ (sK1 @ (^[Y0 : $i]: (~ (X4 @ Y0))))))) | ($true != ((^[Y0 : $i]: (~ (X4 @ Y0))) @ X1)) | ((cP @ (sK1 @ (^[Y0 : $i]: (~ (X4 @ Y0))))) = $true)) )),
% 0.19/0.37    inference(primitive_instantiation,[],[f38])).
% 0.19/0.37  thf(f38,plain,(
% 0.19/0.37    ( ! [X0 : $i > $o,X1 : $i] : (((X0 @ (sK2 @ (sK1 @ X0))) != $true) | ((X0 @ X1) != $true) | ((cP @ (sK1 @ X0)) = $true)) )),
% 0.19/0.37    inference(trivial_inequality_removal,[],[f33])).
% 0.19/0.37  thf(f33,plain,(
% 0.19/0.37    ( ! [X0 : $i > $o,X1 : $i] : (((X0 @ X1) != $true) | ($true != $true) | ((cP @ (sK1 @ X0)) = $true) | ((X0 @ (sK2 @ (sK1 @ X0))) != $true)) )),
% 0.19/0.37    inference(superposition,[],[f18,f15])).
% 0.19/0.37  thf(f15,plain,(
% 0.19/0.37    ( ! [X5 : $i] : (((cR @ X5 @ (sK2 @ X5)) = $true) | ((cP @ X5) = $true)) )),
% 0.19/0.37    inference(cnf_transformation,[],[f13])).
% 0.19/0.37  thf(f18,plain,(
% 0.19/0.37    ( ! [X2 : $i,X1 : $i > $o,X4 : $i] : (($true != (cR @ (sK1 @ X1) @ X4)) | ($true != (X1 @ X2)) | ((X1 @ X4) != $true)) )),
% 0.19/0.37    inference(cnf_transformation,[],[f13])).
% 0.19/0.37  thf(f14,plain,(
% 0.19/0.37    ( ! [X5 : $i] : (((cP @ (sK2 @ X5)) != $true) | ((cP @ X5) = $true)) )),
% 0.19/0.37    inference(cnf_transformation,[],[f13])).
% 0.19/0.37  % SZS output end Proof for theBenchmark
% 0.19/0.37  % (13122)------------------------------
% 0.19/0.37  % (13122)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37  % (13122)Termination reason: Refutation
% 0.19/0.37  
% 0.19/0.37  % (13122)Memory used [KB]: 5756
% 0.19/0.37  % (13122)Time elapsed: 0.023 s
% 0.19/0.37  % (13122)Instructions burned: 27 (million)
% 0.19/0.37  % (13122)------------------------------
% 0.19/0.37  % (13122)------------------------------
% 0.19/0.37  % (13116)Success in time 0.025 s
% 0.19/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------