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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO223^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/sandbox/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:33 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYO223^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.15  % 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.36  % Computer : n006.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon May 20 08:36:53 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a TH0_THM_EQU_NAR problem
% 0.15/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.15/0.38  % (30835)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.15/0.38  % (30834)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.15/0.38  % (30833)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.15/0.38  % (30838)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.15/0.38  % (30836)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.38  % (30839)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.38  % (30837)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.15/0.38  % (30840)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.15/0.38  % (30836)Instruction limit reached!
% 0.15/0.38  % (30836)------------------------------
% 0.15/0.38  % (30836)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (30836)Termination reason: Unknown
% 0.15/0.38  % (30836)Termination phase: Saturation
% 0.15/0.38  % (30837)Instruction limit reached!
% 0.15/0.38  % (30837)------------------------------
% 0.15/0.38  % (30837)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (30837)Termination reason: Unknown
% 0.15/0.38  % (30837)Termination phase: Saturation
% 0.15/0.38  
% 0.15/0.38  % (30837)Memory used [KB]: 5500
% 0.15/0.38  % (30837)Time elapsed: 0.003 s
% 0.15/0.38  % (30837)Instructions burned: 2 (million)
% 0.15/0.38  % (30837)------------------------------
% 0.15/0.38  % (30837)------------------------------
% 0.15/0.38  
% 0.15/0.38  % (30836)Memory used [KB]: 5500
% 0.15/0.38  % (30836)Time elapsed: 0.003 s
% 0.15/0.38  % (30836)Instructions burned: 2 (million)
% 0.15/0.38  % (30836)------------------------------
% 0.15/0.38  % (30836)------------------------------
% 0.15/0.38  % (30840)Instruction limit reached!
% 0.15/0.38  % (30840)------------------------------
% 0.15/0.38  % (30840)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (30840)Termination reason: Unknown
% 0.15/0.38  % (30840)Termination phase: Saturation
% 0.15/0.38  
% 0.15/0.38  % (30840)Memory used [KB]: 5500
% 0.15/0.38  % (30840)Time elapsed: 0.005 s
% 0.15/0.38  % (30840)Instructions burned: 3 (million)
% 0.15/0.38  % (30840)------------------------------
% 0.15/0.38  % (30840)------------------------------
% 0.15/0.38  % (30834)Instruction limit reached!
% 0.15/0.38  % (30834)------------------------------
% 0.15/0.38  % (30834)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38  % (30834)Termination reason: Unknown
% 0.15/0.38  % (30834)Termination phase: Saturation
% 0.15/0.38  
% 0.15/0.38  % (30834)Memory used [KB]: 5500
% 0.15/0.38  % (30834)Time elapsed: 0.005 s
% 0.15/0.38  % (30834)Instructions burned: 4 (million)
% 0.15/0.38  % (30834)------------------------------
% 0.15/0.38  % (30834)------------------------------
% 0.15/0.39  % (30838)First to succeed.
% 0.15/0.39  % (30839)Instruction limit reached!
% 0.15/0.39  % (30839)------------------------------
% 0.15/0.39  % (30839)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39  % (30839)Termination reason: Unknown
% 0.15/0.39  % (30839)Termination phase: Saturation
% 0.15/0.39  
% 0.15/0.39  % (30839)Memory used [KB]: 5628
% 0.15/0.39  % (30839)Time elapsed: 0.016 s
% 0.15/0.39  % (30839)Instructions burned: 19 (million)
% 0.15/0.39  % (30839)------------------------------
% 0.15/0.39  % (30839)------------------------------
% 0.15/0.39  % (30838)Refutation found. Thanks to Tanya!
% 0.15/0.39  % SZS status Theorem for theBenchmark
% 0.15/0.39  % SZS output start Proof for theBenchmark
% 0.15/0.39  thf(func_def_1, type, cLIKE: $i > $i > $o).
% 0.15/0.39  thf(func_def_2, type, cUNIQUE: $i > $o).
% 0.15/0.39  thf(func_def_11, type, ph2: !>[X0: $tType]:(X0)).
% 0.15/0.39  thf(f316,plain,(
% 0.15/0.39    $false),
% 0.15/0.39    inference(avatar_sat_refutation,[],[f47,f59,f62,f127,f220,f242,f270,f313])).
% 0.15/0.39  thf(f313,plain,(
% 0.15/0.39    ~spl1_5 | ~spl1_6),
% 0.15/0.39    inference(avatar_contradiction_clause,[],[f312])).
% 0.15/0.39  thf(f312,plain,(
% 0.15/0.39    $false | (~spl1_5 | ~spl1_6)),
% 0.15/0.39    inference(trivial_inequality_removal,[],[f307])).
% 0.15/0.39  thf(f307,plain,(
% 0.15/0.39    ($true = $false) | (~spl1_5 | ~spl1_6)),
% 0.15/0.39    inference(superposition,[],[f273,f183])).
% 0.15/0.39  thf(f183,plain,(
% 0.15/0.39    ( ! [X0 : $i] : (((cLIKE @ X0 @ X0) = $false)) ) | ~spl1_5),
% 0.15/0.39    inference(superposition,[],[f176,f65])).
% 0.15/0.39  thf(f65,plain,(
% 0.15/0.39    ( ! [X0 : $i,X1 : $i] : ((X0 = X1)) )),
% 0.15/0.39    inference(superposition,[],[f64,f64])).
% 0.15/0.39  thf(f64,plain,(
% 0.15/0.39    ( ! [X0 : $i] : ((cS = X0)) )),
% 0.15/0.39    inference(trivial_inequality_removal,[],[f63])).
% 0.15/0.39  thf(f63,plain,(
% 0.15/0.39    ( ! [X0 : $i] : (($true != $true) | (cS = X0)) )),
% 0.15/0.39    inference(superposition,[],[f12,f16])).
% 0.15/0.39  thf(f16,plain,(
% 0.15/0.39    ((cUNIQUE @ cS) = $true)),
% 0.15/0.39    inference(cnf_transformation,[],[f11])).
% 0.15/0.39  thf(f11,plain,(
% 0.15/0.39    ((cUNIQUE @ cS) = $true) & ! [X0 : $i > $o] : (((cLIKE @ cP @ cS) != (X0 @ cP)) | ((! [X1] : (($true != (cLIKE @ cJ @ X1)) | ((cUNIQUE @ X1) != $true)) | ((X0 @ cJ) != $true)) & ((($true = (cLIKE @ cJ @ sK0)) & ($true = (cUNIQUE @ sK0))) | ((X0 @ cJ) = $true)))) & ! [X3] : (($true != (cUNIQUE @ X3)) | ! [X4] : (X3 = X4))),
% 0.15/0.39    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10])).
% 0.15/0.39  thf(f10,plain,(
% 0.15/0.39    ? [X2] : (((cLIKE @ cJ @ X2) = $true) & ((cUNIQUE @ X2) = $true)) => (($true = (cLIKE @ cJ @ sK0)) & ($true = (cUNIQUE @ sK0)))),
% 0.15/0.39    introduced(choice_axiom,[])).
% 0.15/0.39  thf(f9,plain,(
% 0.15/0.39    ((cUNIQUE @ cS) = $true) & ! [X0 : $i > $o] : (((cLIKE @ cP @ cS) != (X0 @ cP)) | ((! [X1] : (($true != (cLIKE @ cJ @ X1)) | ((cUNIQUE @ X1) != $true)) | ((X0 @ cJ) != $true)) & (? [X2] : (((cLIKE @ cJ @ X2) = $true) & ((cUNIQUE @ X2) = $true)) | ((X0 @ cJ) = $true)))) & ! [X3] : (($true != (cUNIQUE @ X3)) | ! [X4] : (X3 = X4))),
% 0.15/0.39    inference(rectify,[],[f8])).
% 0.15/0.39  thf(f8,plain,(
% 0.15/0.39    ((cUNIQUE @ cS) = $true) & ! [X2 : $i > $o] : (((X2 @ cP) != (cLIKE @ cP @ cS)) | ((! [X3] : (((cLIKE @ cJ @ X3) != $true) | ($true != (cUNIQUE @ X3))) | ((X2 @ cJ) != $true)) & (? [X3] : (((cLIKE @ cJ @ X3) = $true) & ($true = (cUNIQUE @ X3))) | ((X2 @ cJ) = $true)))) & ! [X0] : (((cUNIQUE @ X0) != $true) | ! [X1] : (X0 = X1))),
% 0.15/0.39    inference(nnf_transformation,[],[f7])).
% 0.15/0.39  thf(f7,plain,(
% 0.15/0.39    ((cUNIQUE @ cS) = $true) & ! [X2 : $i > $o] : (((X2 @ cP) != (cLIKE @ cP @ cS)) | (((X2 @ cJ) = $true) <~> ? [X3] : (((cLIKE @ cJ @ X3) = $true) & ($true = (cUNIQUE @ X3))))) & ! [X0] : (((cUNIQUE @ X0) != $true) | ! [X1] : (X0 = X1))),
% 0.15/0.39    inference(flattening,[],[f6])).
% 0.15/0.39  thf(f6,plain,(
% 0.15/0.39    ! [X2 : $i > $o] : (((X2 @ cP) != (cLIKE @ cP @ cS)) | (((X2 @ cJ) = $true) <~> ? [X3] : (((cLIKE @ cJ @ X3) = $true) & ($true = (cUNIQUE @ X3))))) & (((cUNIQUE @ cS) = $true) & ! [X0] : (((cUNIQUE @ X0) != $true) | ! [X1] : (X0 = X1)))),
% 0.15/0.39    inference(ennf_transformation,[],[f5])).
% 0.15/0.39  thf(f5,plain,(
% 0.15/0.39    ~((((cUNIQUE @ cS) = $true) & ! [X0] : (((cUNIQUE @ X0) = $true) => ! [X1] : (X0 = X1))) => ? [X2 : $i > $o] : (((X2 @ cP) = (cLIKE @ cP @ cS)) & (? [X3] : (((cLIKE @ cJ @ X3) = $true) & ($true = (cUNIQUE @ X3))) <=> ((X2 @ cJ) = $true))))),
% 0.15/0.39    inference(fool_elimination,[],[f4])).
% 0.15/0.39  thf(f4,plain,(
% 0.15/0.39    ~((! [X0] : ((cUNIQUE @ X0) => ! [X1] : (X0 = X1)) & (cUNIQUE @ cS)) => ? [X2 : $i > $o] : (((X2 @ cJ) = ? [X3] : ((cLIKE @ cJ @ X3) & (cUNIQUE @ X3))) & ((X2 @ cP) = (cLIKE @ cP @ cS))))),
% 0.15/0.39    inference(rectify,[],[f2])).
% 0.15/0.39  thf(f2,negated_conjecture,(
% 0.15/0.39    ~((! [X0] : ((cUNIQUE @ X0) => ! [X1] : (X0 = X1)) & (cUNIQUE @ cS)) => ? [X2 : $i > $o] : (((X2 @ cJ) = ? [X0] : ((cLIKE @ cJ @ X0) & (cUNIQUE @ X0))) & ((X2 @ cP) = (cLIKE @ cP @ cS))))),
% 0.15/0.39    inference(negated_conjecture,[],[f1])).
% 0.15/0.39  thf(f1,conjecture,(
% 0.15/0.39    (! [X0] : ((cUNIQUE @ X0) => ! [X1] : (X0 = X1)) & (cUNIQUE @ cS)) => ? [X2 : $i > $o] : (((X2 @ cJ) = ? [X0] : ((cLIKE @ cJ @ X0) & (cUNIQUE @ X0))) & ((X2 @ cP) = (cLIKE @ cP @ cS)))),
% 0.15/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cLING2)).
% 0.15/0.39  thf(f12,plain,(
% 0.15/0.39    ( ! [X3 : $i,X4 : $i] : (($true != (cUNIQUE @ X3)) | (X3 = X4)) )),
% 0.15/0.39    inference(cnf_transformation,[],[f11])).
% 0.15/0.39  thf(f176,plain,(
% 0.15/0.39    ($false = (cLIKE @ cS @ cS)) | ~spl1_5),
% 0.15/0.39    inference(forward_demodulation,[],[f41,f64])).
% 0.15/0.39  thf(f41,plain,(
% 0.15/0.39    ((cLIKE @ cP @ cS) = $false) | ~spl1_5),
% 0.15/0.39    inference(avatar_component_clause,[],[f39])).
% 0.15/0.39  thf(f39,plain,(
% 0.15/0.39    spl1_5 <=> ((cLIKE @ cP @ cS) = $false)),
% 0.15/0.39    introduced(avatar_definition,[new_symbols(naming,[spl1_5])])).
% 0.15/0.39  thf(f273,plain,(
% 0.15/0.39    ( ! [X0 : $i] : (((cLIKE @ cJ @ X0) = $true)) ) | ~spl1_6),
% 0.15/0.39    inference(superposition,[],[f272,f64])).
% 0.15/0.39  thf(f272,plain,(
% 0.15/0.39    ($true = (cLIKE @ cJ @ cS)) | ~spl1_6),
% 0.15/0.39    inference(forward_demodulation,[],[f46,f64])).
% 0.15/0.39  thf(f46,plain,(
% 0.15/0.39    ($true = (cLIKE @ cJ @ sK0)) | ~spl1_6),
% 0.15/0.39    inference(avatar_component_clause,[],[f44])).
% 0.15/0.39  thf(f44,plain,(
% 0.15/0.39    spl1_6 <=> ($true = (cLIKE @ cJ @ sK0))),
% 0.15/0.39    introduced(avatar_definition,[new_symbols(naming,[spl1_6])])).
% 0.15/0.39  thf(f270,plain,(
% 0.15/0.39    ~spl1_6 | ~spl1_7),
% 0.15/0.39    inference(avatar_contradiction_clause,[],[f269])).
% 0.15/0.39  thf(f269,plain,(
% 0.15/0.39    $false | (~spl1_6 | ~spl1_7)),
% 0.15/0.39    inference(subsumption_resolution,[],[f46,f177])).
% 0.15/0.39  thf(f177,plain,(
% 0.15/0.39    ( ! [X1 : $i] : (($true != (cLIKE @ cJ @ X1))) ) | ~spl1_7),
% 0.15/0.39    inference(subsumption_resolution,[],[f51,f66])).
% 0.15/0.39  thf(f66,plain,(
% 0.15/0.39    ( ! [X0 : $i] : (((cUNIQUE @ X0) = $true)) )),
% 0.15/0.39    inference(superposition,[],[f16,f64])).
% 0.15/0.39  thf(f51,plain,(
% 0.15/0.39    ( ! [X1 : $i] : (($true != (cLIKE @ cJ @ X1)) | ((cUNIQUE @ X1) != $true)) ) | ~spl1_7),
% 0.15/0.39    inference(avatar_component_clause,[],[f50])).
% 0.15/0.39  thf(f50,plain,(
% 0.15/0.39    spl1_7 <=> ! [X1] : (($true != (cLIKE @ cJ @ X1)) | ((cUNIQUE @ X1) != $true))),
% 0.15/0.39    introduced(avatar_definition,[new_symbols(naming,[spl1_7])])).
% 0.15/0.39  thf(f242,plain,(
% 0.15/0.39    ~spl1_3),
% 0.15/0.39    inference(avatar_contradiction_clause,[],[f241])).
% 0.15/0.39  thf(f241,plain,(
% 0.15/0.39    $false | ~spl1_3),
% 0.15/0.39    inference(trivial_inequality_removal,[],[f240])).
% 0.15/0.39  thf(f240,plain,(
% 0.15/0.39    ($true = $false) | ~spl1_3),
% 0.15/0.39    inference(duplicate_literal_removal,[],[f239])).
% 0.15/0.39  thf(f239,plain,(
% 0.15/0.39    ($true = $false) | ($true = $false) | ~spl1_3),
% 0.15/0.39    inference(beta_eta_normalization,[],[f225])).
% 0.15/0.39  thf(f225,plain,(
% 0.15/0.39    (((^[Y0 : $i]: ($false)) @ cS) = $true) | ($true = ((^[Y0 : $i]: ($false)) @ cJ)) | ~spl1_3),
% 0.15/0.39    inference(primitive_instantiation,[],[f174])).
% 0.15/0.39  thf(f174,plain,(
% 0.15/0.39    ( ! [X0 : $i > $o] : (($true = (X0 @ cS)) | ((X0 @ cJ) = $true)) ) | ~spl1_3),
% 0.15/0.39    inference(forward_demodulation,[],[f33,f64])).
% 0.15/0.39  thf(f33,plain,(
% 0.15/0.39    ( ! [X0 : $i > $o] : (((X0 @ cJ) = $true) | ($true = (X0 @ cP))) ) | ~spl1_3),
% 0.15/0.39    inference(avatar_component_clause,[],[f32])).
% 0.15/0.39  thf(f32,plain,(
% 0.15/0.39    spl1_3 <=> ! [X0 : $i > $o] : (($true = (X0 @ cP)) | ((X0 @ cJ) = $true))),
% 0.15/0.39    introduced(avatar_definition,[new_symbols(naming,[spl1_3])])).
% 0.15/0.39  thf(f220,plain,(
% 0.15/0.39    ~spl1_9),
% 0.15/0.39    inference(avatar_contradiction_clause,[],[f219])).
% 0.15/0.39  thf(f219,plain,(
% 0.15/0.39    $false | ~spl1_9),
% 0.15/0.39    inference(subsumption_resolution,[],[f205,f66])).
% 0.15/0.39  thf(f205,plain,(
% 0.15/0.39    ($true != (cUNIQUE @ cJ)) | ~spl1_9),
% 0.15/0.39    inference(trivial_inequality_removal,[],[f194])).
% 0.15/0.39  thf(f194,plain,(
% 0.15/0.39    ($true = $false) | ($true != (cUNIQUE @ cJ)) | ~spl1_9),
% 0.15/0.39    inference(superposition,[],[f173,f16])).
% 0.15/0.39  thf(f173,plain,(
% 0.15/0.39    ( ! [X0 : $i > $o] : (((X0 @ cS) = $false) | ((X0 @ cJ) != $true)) ) | ~spl1_9),
% 0.15/0.39    inference(forward_demodulation,[],[f58,f64])).
% 0.15/0.39  thf(f58,plain,(
% 0.15/0.39    ( ! [X0 : $i > $o] : (((X0 @ cP) = $false) | ((X0 @ cJ) != $true)) ) | ~spl1_9),
% 0.15/0.39    inference(avatar_component_clause,[],[f57])).
% 0.15/0.39  thf(f57,plain,(
% 0.15/0.39    spl1_9 <=> ! [X0 : $i > $o] : (((X0 @ cP) = $false) | ((X0 @ cJ) != $true))),
% 0.15/0.39    introduced(avatar_definition,[new_symbols(naming,[spl1_9])])).
% 0.15/0.39  thf(f127,plain,(
% 0.15/0.39    ~spl1_2 | ~spl1_7),
% 0.15/0.39    inference(avatar_contradiction_clause,[],[f126])).
% 0.15/0.39  thf(f126,plain,(
% 0.15/0.39    $false | (~spl1_2 | ~spl1_7)),
% 0.15/0.39    inference(subsumption_resolution,[],[f116,f114])).
% 0.15/0.39  thf(f114,plain,(
% 0.15/0.39    ( ! [X0 : $i,X1 : $i] : (((cLIKE @ X0 @ X1) != $true)) ) | ~spl1_7),
% 0.15/0.39    inference(subsumption_resolution,[],[f112,f66])).
% 0.15/0.39  thf(f112,plain,(
% 0.15/0.39    ( ! [X0 : $i,X1 : $i] : (((cLIKE @ X0 @ X1) != $true) | ((cUNIQUE @ X1) != $true)) ) | ~spl1_7),
% 0.15/0.39    inference(superposition,[],[f51,f65])).
% 0.15/0.39  thf(f116,plain,(
% 0.15/0.39    ( ! [X0 : $i,X1 : $i] : (((cLIKE @ X0 @ X1) = $true)) ) | ~spl1_2),
% 0.15/0.39    inference(superposition,[],[f69,f65])).
% 0.15/0.39  thf(f69,plain,(
% 0.15/0.39    ( ! [X0 : $i] : (((cLIKE @ cS @ X0) = $true)) ) | ~spl1_2),
% 0.15/0.39    inference(forward_demodulation,[],[f67,f64])).
% 0.15/0.39  thf(f67,plain,(
% 0.15/0.39    ( ! [X0 : $i] : (($true = (cLIKE @ cP @ X0))) ) | ~spl1_2),
% 0.15/0.39    inference(superposition,[],[f30,f64])).
% 0.15/0.39  thf(f30,plain,(
% 0.15/0.39    ((cLIKE @ cP @ cS) = $true) | ~spl1_2),
% 0.15/0.39    inference(avatar_component_clause,[],[f28])).
% 0.15/0.39  thf(f28,plain,(
% 0.15/0.39    spl1_2 <=> ((cLIKE @ cP @ cS) = $true)),
% 0.15/0.39    introduced(avatar_definition,[new_symbols(naming,[spl1_2])])).
% 0.15/0.39  thf(f62,plain,(
% 0.15/0.39    ~spl1_2 | ~spl1_5),
% 0.15/0.39    inference(avatar_contradiction_clause,[],[f61])).
% 0.15/0.39  thf(f61,plain,(
% 0.15/0.39    $false | (~spl1_2 | ~spl1_5)),
% 0.15/0.39    inference(trivial_inequality_removal,[],[f60])).
% 0.15/0.39  thf(f60,plain,(
% 0.15/0.39    ($true = $false) | (~spl1_2 | ~spl1_5)),
% 0.15/0.39    inference(forward_demodulation,[],[f30,f41])).
% 0.15/0.39  thf(f59,plain,(
% 0.15/0.39    spl1_5 | spl1_7 | spl1_9),
% 0.15/0.39    inference(avatar_split_clause,[],[f18,f57,f50,f39])).
% 0.15/0.39  thf(f18,plain,(
% 0.15/0.39    ( ! [X0 : $i > $o,X1 : $i] : (((cLIKE @ cP @ cS) = $false) | ((cUNIQUE @ X1) != $true) | ($true != (cLIKE @ cJ @ X1)) | ((X0 @ cP) = $false) | ((X0 @ cJ) != $true)) )),
% 0.15/0.39    inference(binary_proxy_clausification,[],[f15])).
% 0.15/0.39  thf(f15,plain,(
% 0.15/0.39    ( ! [X0 : $i > $o,X1 : $i] : (((X0 @ cJ) != $true) | ((cUNIQUE @ X1) != $true) | ($true != (cLIKE @ cJ @ X1)) | ((cLIKE @ cP @ cS) != (X0 @ cP))) )),
% 0.15/0.39    inference(cnf_transformation,[],[f11])).
% 0.15/0.39  thf(f47,plain,(
% 0.15/0.39    spl1_3 | spl1_2 | spl1_6),
% 0.15/0.39    inference(avatar_split_clause,[],[f19,f44,f28,f32])).
% 0.15/0.39  thf(f19,plain,(
% 0.15/0.39    ( ! [X0 : $i > $o] : (($true = (cLIKE @ cJ @ sK0)) | ((cLIKE @ cP @ cS) = $true) | ((X0 @ cJ) = $true) | ($true = (X0 @ cP))) )),
% 0.15/0.39    inference(binary_proxy_clausification,[],[f14])).
% 0.15/0.39  thf(f14,plain,(
% 0.15/0.39    ( ! [X0 : $i > $o] : (($true = (cLIKE @ cJ @ sK0)) | ((X0 @ cJ) = $true) | ((cLIKE @ cP @ cS) != (X0 @ cP))) )),
% 0.15/0.39    inference(cnf_transformation,[],[f11])).
% 0.15/0.39  % SZS output end Proof for theBenchmark
% 0.15/0.39  % (30838)------------------------------
% 0.15/0.39  % (30838)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39  % (30838)Termination reason: Refutation
% 0.15/0.39  
% 0.15/0.39  % (30838)Memory used [KB]: 5628
% 0.15/0.39  % (30838)Time elapsed: 0.016 s
% 0.15/0.39  % (30838)Instructions burned: 16 (million)
% 0.15/0.39  % (30838)------------------------------
% 0.15/0.39  % (30838)------------------------------
% 0.15/0.39  % (30832)Success in time 0.017 s
% 0.15/0.40  % Vampire---4.8 exiting
%------------------------------------------------------------------------------