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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO327^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 : n006.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:03:59 EDT 2024

% Result   : Theorem 0.20s 0.39s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYO327^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/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.34  % Computer : n006.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon May 20 09:50:23 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TH0_THM_NEQ_NAR problem
% 0.14/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.20/0.37  % (11399)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.20/0.37  % (11392)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.20/0.37  % (11394)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.20/0.37  % (11396)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.20/0.37  % (11395)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.37  % (11397)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.20/0.37  % (11399)Instruction limit reached!
% 0.20/0.37  % (11399)------------------------------
% 0.20/0.37  % (11399)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37  % (11399)Termination reason: Unknown
% 0.20/0.37  % (11399)Termination phase: Saturation
% 0.20/0.37  
% 0.20/0.37  % (11398)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.20/0.37  % (11399)Memory used [KB]: 5500
% 0.20/0.37  % (11399)Time elapsed: 0.003 s
% 0.20/0.37  % (11399)Instructions burned: 3 (million)
% 0.20/0.37  % (11399)------------------------------
% 0.20/0.37  % (11399)------------------------------
% 0.20/0.37  % (11393)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.20/0.37  % (11395)Instruction limit reached!
% 0.20/0.37  % (11395)------------------------------
% 0.20/0.37  % (11395)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37  % (11395)Termination reason: Unknown
% 0.20/0.37  % (11396)Instruction limit reached!
% 0.20/0.37  % (11396)------------------------------
% 0.20/0.37  % (11396)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37  % (11395)Termination phase: Property scanning
% 0.20/0.37  
% 0.20/0.37  % (11395)Memory used [KB]: 895
% 0.20/0.37  % (11395)Time elapsed: 0.003 s
% 0.20/0.37  % (11395)Instructions burned: 2 (million)
% 0.20/0.37  % (11395)------------------------------
% 0.20/0.37  % (11395)------------------------------
% 0.20/0.37  % (11396)Termination reason: Unknown
% 0.20/0.37  % (11396)Termination phase: Saturation
% 0.20/0.37  
% 0.20/0.37  % (11396)Memory used [KB]: 895
% 0.20/0.37  % (11396)Time elapsed: 0.003 s
% 0.20/0.37  % (11396)Instructions burned: 2 (million)
% 0.20/0.37  % (11396)------------------------------
% 0.20/0.37  % (11396)------------------------------
% 0.20/0.37  % (11393)Instruction limit reached!
% 0.20/0.37  % (11393)------------------------------
% 0.20/0.37  % (11393)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37  % (11393)Termination reason: Unknown
% 0.20/0.37  % (11393)Termination phase: Saturation
% 0.20/0.37  
% 0.20/0.37  % (11393)Memory used [KB]: 5500
% 0.20/0.37  % (11393)Time elapsed: 0.005 s
% 0.20/0.37  % (11393)Instructions burned: 5 (million)
% 0.20/0.37  % (11393)------------------------------
% 0.20/0.37  % (11393)------------------------------
% 0.20/0.38  % (11398)Instruction limit reached!
% 0.20/0.38  % (11398)------------------------------
% 0.20/0.38  % (11398)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38  % (11398)Termination reason: Unknown
% 0.20/0.38  % (11398)Termination phase: Saturation
% 0.20/0.38  
% 0.20/0.38  % (11398)Memory used [KB]: 5628
% 0.20/0.38  % (11398)Time elapsed: 0.013 s
% 0.20/0.38  % (11398)Instructions burned: 18 (million)
% 0.20/0.38  % (11398)------------------------------
% 0.20/0.38  % (11398)------------------------------
% 0.20/0.38  % (11400)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.20/0.38  % (11402)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.20/0.38  % (11392)First to succeed.
% 0.20/0.38  % (11402)Instruction limit reached!
% 0.20/0.38  % (11402)------------------------------
% 0.20/0.38  % (11402)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38  % (11402)Termination reason: Unknown
% 0.20/0.38  % (11402)Termination phase: Saturation
% 0.20/0.38  
% 0.20/0.38  % (11402)Memory used [KB]: 5500
% 0.20/0.38  % (11402)Time elapsed: 0.004 s
% 0.20/0.38  % (11402)Instructions burned: 3 (million)
% 0.20/0.38  % (11402)------------------------------
% 0.20/0.38  % (11402)------------------------------
% 0.20/0.38  % (11394)Instruction limit reached!
% 0.20/0.38  % (11394)------------------------------
% 0.20/0.38  % (11394)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38  % (11394)Termination reason: Unknown
% 0.20/0.38  % (11394)Termination phase: Saturation
% 0.20/0.38  
% 0.20/0.38  % (11394)Memory used [KB]: 5628
% 0.20/0.38  % (11394)Time elapsed: 0.020 s
% 0.20/0.38  % (11394)Instructions burned: 27 (million)
% 0.20/0.38  % (11394)------------------------------
% 0.20/0.38  % (11394)------------------------------
% 0.20/0.38  % (11403)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.20/0.39  % (11392)Refutation found. Thanks to Tanya!
% 0.20/0.39  % SZS status Theorem for theBenchmark
% 0.20/0.39  % SZS output start Proof for theBenchmark
% 0.20/0.39  thf(func_def_0, type, cHALF: $i > $i > $o).
% 0.20/0.39  thf(func_def_1, type, cDOUBLE: $i > $i > $o).
% 0.20/0.39  thf(func_def_2, type, cS: $i > $i).
% 0.20/0.39  thf(func_def_7, type, sK0: ($i > $i > $o) > $i).
% 0.20/0.39  thf(func_def_8, type, sK1: ($i > $i > $o) > $i).
% 0.20/0.39  thf(func_def_13, type, ph5: !>[X0: $tType]:(X0)).
% 0.20/0.39  thf(f152,plain,(
% 0.20/0.39    $false),
% 0.20/0.39    inference(avatar_sat_refutation,[],[f123,f138,f151])).
% 0.20/0.39  thf(f151,plain,(
% 0.20/0.39    ~spl4_4),
% 0.20/0.39    inference(avatar_contradiction_clause,[],[f150])).
% 0.20/0.39  thf(f150,plain,(
% 0.20/0.39    $false | ~spl4_4),
% 0.20/0.39    inference(subsumption_resolution,[],[f143,f14])).
% 0.20/0.39  thf(f14,plain,(
% 0.20/0.39    ($true = (cDOUBLE @ sK2 @ sK3))),
% 0.20/0.39    inference(cnf_transformation,[],[f11])).
% 0.20/0.39  thf(f11,plain,(
% 0.20/0.39    ((cHALF @ c0 @ c0) = $true) & ! [X0,X1] : (($true != (cHALF @ X0 @ X1)) | ((cHALF @ (cS @ (cS @ X0)) @ (cS @ X1)) = $true)) & ! [X2 : $i > $i > $o,X3,X4] : (($true != (cDOUBLE @ X3 @ X4)) | ($true != (X2 @ c0 @ c0)) | (($true = (X2 @ (sK0 @ X2) @ (sK1 @ X2))) & ($true != (X2 @ (cS @ (sK0 @ X2)) @ (cS @ (cS @ (sK1 @ X2)))))) | ($true = (X2 @ X3 @ X4))) & (($true = (cDOUBLE @ sK2 @ sK3)) & ($true != (cHALF @ sK3 @ sK2))) & ((cHALF @ c0 @ (cS @ c0)) = $true)),
% 0.20/0.39    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f10,f9])).
% 0.20/0.39  thf(f9,plain,(
% 0.20/0.39    ! [X2 : $i > $i > $o] : (? [X5,X6] : (($true = (X2 @ X5 @ X6)) & ($true != (X2 @ (cS @ X5) @ (cS @ (cS @ X6))))) => (($true = (X2 @ (sK0 @ X2) @ (sK1 @ X2))) & ($true != (X2 @ (cS @ (sK0 @ X2)) @ (cS @ (cS @ (sK1 @ X2)))))))),
% 0.20/0.39    introduced(choice_axiom,[])).
% 0.20/0.39  thf(f10,plain,(
% 0.20/0.39    ? [X7,X8] : (($true = (cDOUBLE @ X7 @ X8)) & ((cHALF @ X8 @ X7) != $true)) => (($true = (cDOUBLE @ sK2 @ sK3)) & ($true != (cHALF @ sK3 @ sK2)))),
% 0.20/0.39    introduced(choice_axiom,[])).
% 0.20/0.39  thf(f8,plain,(
% 0.20/0.39    ((cHALF @ c0 @ c0) = $true) & ! [X0,X1] : (($true != (cHALF @ X0 @ X1)) | ((cHALF @ (cS @ (cS @ X0)) @ (cS @ X1)) = $true)) & ! [X2 : $i > $i > $o,X3,X4] : (($true != (cDOUBLE @ X3 @ X4)) | ($true != (X2 @ c0 @ c0)) | ? [X5,X6] : (($true = (X2 @ X5 @ X6)) & ($true != (X2 @ (cS @ X5) @ (cS @ (cS @ X6))))) | ($true = (X2 @ X3 @ X4))) & ? [X7,X8] : (($true = (cDOUBLE @ X7 @ X8)) & ((cHALF @ X8 @ X7) != $true)) & ((cHALF @ c0 @ (cS @ c0)) = $true)),
% 0.20/0.39    inference(rectify,[],[f7])).
% 0.20/0.39  thf(f7,plain,(
% 0.20/0.39    ((cHALF @ c0 @ c0) = $true) & ! [X6,X5] : (((cHALF @ X6 @ X5) != $true) | ($true = (cHALF @ (cS @ (cS @ X6)) @ (cS @ X5)))) & ! [X1 : $i > $i > $o,X0,X2] : (($true != (cDOUBLE @ X0 @ X2)) | ($true != (X1 @ c0 @ c0)) | ? [X3,X4] : (((X1 @ X3 @ X4) = $true) & ($true != (X1 @ (cS @ X3) @ (cS @ (cS @ X4))))) | ($true = (X1 @ X0 @ X2))) & ? [X8,X7] : (((cDOUBLE @ X8 @ X7) = $true) & ($true != (cHALF @ X7 @ X8))) & ((cHALF @ c0 @ (cS @ c0)) = $true)),
% 0.20/0.39    inference(flattening,[],[f6])).
% 0.20/0.39  thf(f6,plain,(
% 0.20/0.39    ? [X8,X7] : (((cDOUBLE @ X8 @ X7) = $true) & ($true != (cHALF @ X7 @ X8))) & (((cHALF @ c0 @ (cS @ c0)) = $true) & ((cHALF @ c0 @ c0) = $true) & ! [X6,X5] : (((cHALF @ X6 @ X5) != $true) | ($true = (cHALF @ (cS @ (cS @ X6)) @ (cS @ X5)))) & ! [X0,X2,X1 : $i > $i > $o] : (($true = (X1 @ X0 @ X2)) | (($true != (cDOUBLE @ X0 @ X2)) | ($true != (X1 @ c0 @ c0)) | ? [X3,X4] : (((X1 @ X3 @ X4) = $true) & ($true != (X1 @ (cS @ X3) @ (cS @ (cS @ X4))))))))),
% 0.20/0.39    inference(ennf_transformation,[],[f5])).
% 0.20/0.39  thf(f5,plain,(
% 0.20/0.39    ~((((cHALF @ c0 @ (cS @ c0)) = $true) & ((cHALF @ c0 @ c0) = $true) & ! [X5,X6] : (((cHALF @ X6 @ X5) = $true) => ($true = (cHALF @ (cS @ (cS @ X6)) @ (cS @ X5)))) & ! [X0,X2,X1 : $i > $i > $o] : ((($true = (cDOUBLE @ X0 @ X2)) & ($true = (X1 @ c0 @ c0)) & ! [X4,X3] : (((X1 @ X3 @ X4) = $true) => ($true = (X1 @ (cS @ X3) @ (cS @ (cS @ X4)))))) => ($true = (X1 @ X0 @ X2)))) => ! [X7,X8] : (((cDOUBLE @ X8 @ X7) = $true) => ($true = (cHALF @ X7 @ X8))))),
% 0.20/0.39    inference(fool_elimination,[],[f4])).
% 0.20/0.39  thf(f4,plain,(
% 0.20/0.39    ~((! [X0,X1 : $i > $i > $o,X2] : (((cDOUBLE @ X0 @ X2) & (X1 @ c0 @ c0) & ! [X3,X4] : ((X1 @ X3 @ X4) => (X1 @ (cS @ X3) @ (cS @ (cS @ X4))))) => (X1 @ X0 @ X2)) & ! [X5,X6] : ((cHALF @ X6 @ X5) => (cHALF @ (cS @ (cS @ X6)) @ (cS @ X5))) & (cHALF @ c0 @ c0) & (cHALF @ c0 @ (cS @ c0))) => ! [X7,X8] : ((cDOUBLE @ X8 @ X7) => (cHALF @ X7 @ X8)))),
% 0.20/0.39    inference(rectify,[],[f2])).
% 0.20/0.39  thf(f2,negated_conjecture,(
% 0.20/0.39    ~((! [X1,X0 : $i > $i > $o,X2] : (((cDOUBLE @ X1 @ X2) & (X0 @ c0 @ c0) & ! [X3,X4] : ((X0 @ X3 @ X4) => (X0 @ (cS @ X3) @ (cS @ (cS @ X4))))) => (X0 @ X1 @ X2)) & ! [X4,X3] : ((cHALF @ X3 @ X4) => (cHALF @ (cS @ (cS @ X3)) @ (cS @ X4))) & (cHALF @ c0 @ c0) & (cHALF @ c0 @ (cS @ c0))) => ! [X2,X1] : ((cDOUBLE @ X1 @ X2) => (cHALF @ X2 @ X1)))),
% 0.20/0.39    inference(negated_conjecture,[],[f1])).
% 0.20/0.39  thf(f1,conjecture,(
% 0.20/0.39    (! [X1,X0 : $i > $i > $o,X2] : (((cDOUBLE @ X1 @ X2) & (X0 @ c0 @ c0) & ! [X3,X4] : ((X0 @ X3 @ X4) => (X0 @ (cS @ X3) @ (cS @ (cS @ X4))))) => (X0 @ X1 @ X2)) & ! [X4,X3] : ((cHALF @ X3 @ X4) => (cHALF @ (cS @ (cS @ X3)) @ (cS @ X4))) & (cHALF @ c0 @ c0) & (cHALF @ c0 @ (cS @ c0))) => ! [X2,X1] : ((cDOUBLE @ X1 @ X2) => (cHALF @ X2 @ X1))),
% 0.20/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cDOUBLE_TO_HALF_6)).
% 0.20/0.39  thf(f143,plain,(
% 0.20/0.39    ($true != (cDOUBLE @ sK2 @ sK3)) | ~spl4_4),
% 0.20/0.39    inference(trivial_inequality_removal,[],[f141])).
% 0.20/0.39  thf(f141,plain,(
% 0.20/0.39    ($true != $true) | ($true != (cDOUBLE @ sK2 @ sK3)) | ~spl4_4),
% 0.20/0.39    inference(superposition,[],[f13,f122])).
% 0.20/0.39  thf(f122,plain,(
% 0.20/0.39    ( ! [X0 : $i,X1 : $i] : (($true = (cHALF @ X1 @ X0)) | ($true != (cDOUBLE @ X0 @ X1))) ) | ~spl4_4),
% 0.20/0.39    inference(avatar_component_clause,[],[f121])).
% 0.20/0.39  thf(f121,plain,(
% 0.20/0.39    spl4_4 <=> ! [X0,X1] : (($true != (cDOUBLE @ X0 @ X1)) | ($true = (cHALF @ X1 @ X0)))),
% 0.20/0.39    introduced(avatar_definition,[new_symbols(naming,[spl4_4])])).
% 0.20/0.39  thf(f13,plain,(
% 0.20/0.39    ($true != (cHALF @ sK3 @ sK2))),
% 0.20/0.39    inference(cnf_transformation,[],[f11])).
% 0.20/0.39  thf(f138,plain,(
% 0.20/0.39    spl4_4 | spl4_3),
% 0.20/0.39    inference(avatar_split_clause,[],[f137,f117,f121])).
% 0.20/0.39  thf(f117,plain,(
% 0.20/0.39    spl4_3 <=> ($true = (cHALF @ (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ Y1 @ Y0))))) @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ Y1 @ Y0)))))))),
% 0.20/0.39    introduced(avatar_definition,[new_symbols(naming,[spl4_3])])).
% 0.20/0.39  thf(f137,plain,(
% 0.20/0.39    ( ! [X0 : $i,X1 : $i] : (($true != (cDOUBLE @ X0 @ X1)) | ($true = (cHALF @ X1 @ X0))) ) | spl4_3),
% 0.20/0.39    inference(subsumption_resolution,[],[f136,f18])).
% 0.20/0.39  thf(f18,plain,(
% 0.20/0.39    ((cHALF @ c0 @ c0) = $true)),
% 0.20/0.39    inference(cnf_transformation,[],[f11])).
% 0.20/0.39  thf(f136,plain,(
% 0.20/0.39    ( ! [X0 : $i,X1 : $i] : (($true = (cHALF @ X1 @ X0)) | ((cHALF @ c0 @ c0) != $true) | ($true != (cDOUBLE @ X0 @ X1))) ) | spl4_3),
% 0.20/0.39    inference(beta_eta_normalization,[],[f135])).
% 0.20/0.39  thf(f135,plain,(
% 0.20/0.39    ( ! [X0 : $i,X1 : $i] : (($true != ((^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2)))) @ Y0 @ Y1))))) @ c0 @ c0)) | ($true != (cDOUBLE @ X0 @ X1)) | ($true = ((^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2)))) @ Y0 @ Y1))))) @ X0 @ X1))) ) | spl4_3),
% 0.20/0.39    inference(trivial_inequality_removal,[],[f134])).
% 0.20/0.39  thf(f134,plain,(
% 0.20/0.39    ( ! [X0 : $i,X1 : $i] : (($true != ((^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2)))) @ Y0 @ Y1))))) @ c0 @ c0)) | ($true = ((^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2)))) @ Y0 @ Y1))))) @ X0 @ X1)) | ($true != (cDOUBLE @ X0 @ X1)) | ($true != $true)) ) | spl4_3),
% 0.20/0.39    inference(superposition,[],[f119,f16])).
% 0.20/0.39  thf(f16,plain,(
% 0.20/0.39    ( ! [X2 : $i > $i > $o,X3 : $i,X4 : $i] : (($true = (X2 @ (sK0 @ X2) @ (sK1 @ X2))) | ($true = (X2 @ X3 @ X4)) | ($true != (cDOUBLE @ X3 @ X4)) | ($true != (X2 @ c0 @ c0))) )),
% 0.20/0.39    inference(cnf_transformation,[],[f11])).
% 0.20/0.39  thf(f119,plain,(
% 0.20/0.39    ($true != (cHALF @ (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ Y1 @ Y0))))) @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ Y1 @ Y0))))))) | spl4_3),
% 0.20/0.39    inference(avatar_component_clause,[],[f117])).
% 0.20/0.39  thf(f123,plain,(
% 0.20/0.39    ~spl4_3 | spl4_4),
% 0.20/0.39    inference(avatar_split_clause,[],[f115,f121,f117])).
% 0.20/0.39  thf(f115,plain,(
% 0.20/0.39    ( ! [X0 : $i,X1 : $i] : (($true != (cDOUBLE @ X0 @ X1)) | ($true = (cHALF @ X1 @ X0)) | ($true != (cHALF @ (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ Y1 @ Y0))))) @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ Y1 @ Y0)))))))) )),
% 0.20/0.39    inference(subsumption_resolution,[],[f112,f18])).
% 0.20/0.39  thf(f112,plain,(
% 0.20/0.39    ( ! [X0 : $i,X1 : $i] : (((cHALF @ c0 @ c0) != $true) | ($true != (cHALF @ (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ Y1 @ Y0))))) @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ Y1 @ Y0))))))) | ($true = (cHALF @ X1 @ X0)) | ($true != (cDOUBLE @ X0 @ X1))) )),
% 0.20/0.39    inference(beta_eta_normalization,[],[f111])).
% 0.20/0.39  thf(f111,plain,(
% 0.20/0.39    ( ! [X0 : $i,X1 : $i] : (($true != ((^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2)))) @ Y0 @ Y1))))) @ c0 @ c0)) | ($true = ((^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2)))) @ Y0 @ Y1))))) @ X0 @ X1)) | ($true != (cDOUBLE @ X0 @ X1)) | ($true != (cHALF @ (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2)))) @ Y0 @ Y1)))))) @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2)))) @ Y0 @ Y1))))))))) )),
% 0.20/0.39    inference(trivial_inequality_removal,[],[f78])).
% 0.20/0.39  thf(f78,plain,(
% 0.20/0.39    ( ! [X0 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2)))) @ Y0 @ Y1))))) @ X0 @ X1)) | ($true != $true) | ($true != (cDOUBLE @ X0 @ X1)) | ($true != ((^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2)))) @ Y0 @ Y1))))) @ c0 @ c0)) | ($true != (cHALF @ (sK1 @ (^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2)))) @ Y0 @ Y1)))))) @ (sK0 @ (^[Y0 : $i]: ((^[Y1 : $i]: (cHALF @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y3)))) @ Y0 @ Y1) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (Y2)))) @ Y0 @ Y1))))))))) )),
% 0.20/0.39    inference(superposition,[],[f15,f17])).
% 0.20/0.39  thf(f17,plain,(
% 0.20/0.39    ( ! [X0 : $i,X1 : $i] : (((cHALF @ (cS @ (cS @ X0)) @ (cS @ X1)) = $true) | ($true != (cHALF @ X0 @ X1))) )),
% 0.20/0.39    inference(cnf_transformation,[],[f11])).
% 0.20/0.39  thf(f15,plain,(
% 0.20/0.39    ( ! [X2 : $i > $i > $o,X3 : $i,X4 : $i] : (($true != (X2 @ (cS @ (sK0 @ X2)) @ (cS @ (cS @ (sK1 @ X2))))) | ($true != (cDOUBLE @ X3 @ X4)) | ($true != (X2 @ c0 @ c0)) | ($true = (X2 @ X3 @ X4))) )),
% 0.20/0.39    inference(cnf_transformation,[],[f11])).
% 0.20/0.39  % SZS output end Proof for theBenchmark
% 0.20/0.39  % (11392)------------------------------
% 0.20/0.39  % (11392)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39  % (11392)Termination reason: Refutation
% 0.20/0.39  
% 0.20/0.39  % (11392)Memory used [KB]: 5756
% 0.20/0.39  % (11392)Time elapsed: 0.021 s
% 0.20/0.39  % (11392)Instructions burned: 25 (million)
% 0.20/0.39  % (11392)------------------------------
% 0.20/0.39  % (11392)------------------------------
% 0.20/0.39  % (11391)Success in time 0.022 s
% 0.20/0.39  % Vampire---4.8 exiting
%------------------------------------------------------------------------------