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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO263^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 : n012.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:42 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYO263^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.34  % Computer : n012.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.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 20 08:31:52 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/sandbox/benchmark/theBenchmark.p
% 0.14/0.37  % (32751)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.37  % (32745)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.14/0.37  % (32747)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.14/0.37  % (32746)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.14/0.37  % (32748)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37  % (32750)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.14/0.37  % (32748)Instruction limit reached!
% 0.14/0.37  % (32748)------------------------------
% 0.14/0.37  % (32748)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (32748)Termination reason: Unknown
% 0.14/0.37  % (32748)Termination phase: Property scanning
% 0.14/0.37  
% 0.14/0.37  % (32748)Memory used [KB]: 895
% 0.14/0.37  % (32748)Time elapsed: 0.003 s
% 0.14/0.37  % (32748)Instructions burned: 2 (million)
% 0.14/0.37  % (32748)------------------------------
% 0.14/0.37  % (32748)------------------------------
% 0.14/0.37  % (32746)Instruction limit reached!
% 0.14/0.37  % (32746)------------------------------
% 0.14/0.37  % (32746)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (32746)Termination reason: Unknown
% 0.14/0.37  % (32746)Termination phase: Saturation
% 0.14/0.37  
% 0.14/0.37  % (32746)Memory used [KB]: 5500
% 0.14/0.37  % (32746)Time elapsed: 0.005 s
% 0.14/0.37  % (32746)Instructions burned: 4 (million)
% 0.14/0.37  % (32746)------------------------------
% 0.14/0.37  % (32746)------------------------------
% 0.14/0.37  % (32747)Refutation not found, incomplete strategy
% 0.14/0.37  % (32747)------------------------------
% 0.14/0.37  % (32747)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (32747)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37  
% 0.14/0.37  
% 0.14/0.37  % (32747)Memory used [KB]: 5500
% 0.14/0.37  % (32747)Time elapsed: 0.006 s
% 0.14/0.37  % (32747)Instructions burned: 6 (million)
% 0.14/0.37  % (32747)------------------------------
% 0.14/0.37  % (32747)------------------------------
% 0.14/0.37  % (32749)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.14/0.37  % (32749)Instruction limit reached!
% 0.14/0.37  % (32749)------------------------------
% 0.14/0.37  % (32749)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (32749)Termination reason: Unknown
% 0.14/0.37  % (32749)Termination phase: Property scanning
% 0.14/0.37  
% 0.14/0.37  % (32749)Memory used [KB]: 895
% 0.14/0.37  % (32749)Time elapsed: 0.003 s
% 0.14/0.37  % (32749)Instructions burned: 2 (million)
% 0.14/0.37  % (32749)------------------------------
% 0.14/0.37  % (32749)------------------------------
% 0.14/0.38  % (32751)Instruction limit reached!
% 0.14/0.38  % (32751)------------------------------
% 0.14/0.38  % (32751)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (32751)Termination reason: Unknown
% 0.14/0.38  % (32751)Termination phase: Saturation
% 0.14/0.38  
% 0.14/0.38  % (32751)Memory used [KB]: 5628
% 0.14/0.38  % (32751)Time elapsed: 0.011 s
% 0.14/0.38  % (32751)Instructions burned: 18 (million)
% 0.14/0.38  % (32751)------------------------------
% 0.14/0.38  % (32751)------------------------------
% 0.14/0.38  % (32752)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.14/0.38  % (32752)Instruction limit reached!
% 0.14/0.38  % (32752)------------------------------
% 0.14/0.38  % (32752)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (32752)Termination reason: Unknown
% 0.14/0.38  % (32752)Termination phase: Saturation
% 0.14/0.38  
% 0.14/0.38  % (32752)Memory used [KB]: 5500
% 0.14/0.38  % (32752)Time elapsed: 0.004 s
% 0.14/0.38  % (32752)Instructions burned: 3 (million)
% 0.14/0.38  % (32752)------------------------------
% 0.14/0.38  % (32752)------------------------------
% 0.14/0.38  % (32753)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.14/0.38  % (32750)First to succeed.
% 0.14/0.39  % (32754)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.14/0.39  % (32755)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.14/0.39  % (32756)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.14/0.39  % (32757)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.14/0.39  % (32750)Refutation found. Thanks to Tanya!
% 0.14/0.39  % SZS status Theorem for theBenchmark
% 0.14/0.39  % SZS output start Proof for theBenchmark
% 0.14/0.39  thf(func_def_3, type, sP0: ($i > $o) > ($i > $o) > $i > $o).
% 0.14/0.39  thf(func_def_4, type, sK1: $i > $o).
% 0.14/0.39  thf(func_def_8, type, sK5: ($i > $o) > $i).
% 0.14/0.39  thf(func_def_11, type, ph7: !>[X0: $tType]:(X0)).
% 0.14/0.39  thf(f349,plain,(
% 0.14/0.39    $false),
% 0.14/0.39    inference(avatar_sat_refutation,[],[f37,f41,f60,f68,f174,f234,f346,f348])).
% 0.14/0.39  thf(f348,plain,(
% 0.14/0.39    ~spl6_3 | ~spl6_4 | spl6_20),
% 0.14/0.39    inference(avatar_contradiction_clause,[],[f347])).
% 0.14/0.39  thf(f347,plain,(
% 0.14/0.39    $false | (~spl6_3 | ~spl6_4 | spl6_20)),
% 0.14/0.39    inference(subsumption_resolution,[],[f314,f216])).
% 0.14/0.39  thf(f216,plain,(
% 0.14/0.39    ($true != (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | spl6_20),
% 0.14/0.39    inference(avatar_component_clause,[],[f215])).
% 0.14/0.39  thf(f215,plain,(
% 0.14/0.39    spl6_20 <=> ($true = (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0))))))),
% 0.14/0.39    introduced(avatar_definition,[new_symbols(naming,[spl6_20])])).
% 0.14/0.39  thf(f314,plain,(
% 0.14/0.39    ($true = (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (~spl6_3 | ~spl6_4)),
% 0.14/0.39    inference(not_proxy_clausification,[],[f313])).
% 0.14/0.39  thf(f313,plain,(
% 0.14/0.39    ((~ (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) != $true) | (~spl6_3 | ~spl6_4)),
% 0.14/0.39    inference(beta_eta_normalization,[],[f312])).
% 0.14/0.39  thf(f312,plain,(
% 0.14/0.39    ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (~spl6_3 | ~spl6_4)),
% 0.14/0.39    inference(trivial_inequality_removal,[],[f300])).
% 0.14/0.39  thf(f300,plain,(
% 0.14/0.39    ($true != $true) | ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | ($true = $false) | (~spl6_3 | ~spl6_4)),
% 0.14/0.39    inference(superposition,[],[f250,f40])).
% 0.14/0.39  thf(f40,plain,(
% 0.14/0.39    ( ! [X4 : $i > $o] : (($true = (sK1 @ (sK5 @ X4))) | ($true != (X4 @ (sK5 @ X4)))) ) | ~spl6_4),
% 0.14/0.39    inference(avatar_component_clause,[],[f39])).
% 0.14/0.39  thf(f39,plain,(
% 0.14/0.39    spl6_4 <=> ! [X4 : $i > $o] : (($true != (X4 @ (sK5 @ X4))) | ($true = (sK1 @ (sK5 @ X4))))),
% 0.14/0.39    introduced(avatar_definition,[new_symbols(naming,[spl6_4])])).
% 0.14/0.39  thf(f250,plain,(
% 0.14/0.39    ( ! [X7 : $i > $o] : (((X7 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))) = $false) | ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))) != $true)) ) | ~spl6_3),
% 0.14/0.39    inference(not_proxy_clausification,[],[f249])).
% 0.14/0.39  thf(f249,plain,(
% 0.14/0.39    ( ! [X7 : $i > $o] : (($true = (~ (X7 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))))) | ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))) != $true)) ) | ~spl6_3),
% 0.14/0.39    inference(beta_eta_normalization,[],[f242])).
% 0.14/0.39  thf(f242,plain,(
% 0.14/0.39    ( ! [X7 : $i > $o] : (((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))) != $true) | ($true = ((^[Y0 : $i]: (~ (X7 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))))) ) | ~spl6_3),
% 0.14/0.39    inference(primitive_instantiation,[],[f36])).
% 0.14/0.39  thf(f36,plain,(
% 0.14/0.39    ( ! [X4 : $i > $o] : (($true = (X4 @ (sK5 @ X4))) | ($true != (sK1 @ (sK5 @ X4)))) ) | ~spl6_3),
% 0.14/0.39    inference(avatar_component_clause,[],[f35])).
% 0.14/0.39  thf(f35,plain,(
% 0.14/0.39    spl6_3 <=> ! [X4 : $i > $o] : (($true = (X4 @ (sK5 @ X4))) | ($true != (sK1 @ (sK5 @ X4))))),
% 0.14/0.39    introduced(avatar_definition,[new_symbols(naming,[spl6_3])])).
% 0.14/0.39  thf(f346,plain,(
% 0.14/0.39    ~spl6_3 | ~spl6_20),
% 0.14/0.39    inference(avatar_contradiction_clause,[],[f345])).
% 0.14/0.39  thf(f345,plain,(
% 0.14/0.39    $false | (~spl6_3 | ~spl6_20)),
% 0.14/0.39    inference(subsumption_resolution,[],[f329,f217])).
% 0.14/0.39  thf(f217,plain,(
% 0.14/0.39    ($true = (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | ~spl6_20),
% 0.14/0.39    inference(avatar_component_clause,[],[f215])).
% 0.14/0.39  thf(f329,plain,(
% 0.14/0.39    ($true != (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (~spl6_3 | ~spl6_20)),
% 0.14/0.39    inference(trivial_inequality_removal,[],[f305])).
% 0.14/0.39  thf(f305,plain,(
% 0.14/0.39    ($true != (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | ($true = $false) | (~spl6_3 | ~spl6_20)),
% 0.14/0.39    inference(superposition,[],[f217,f250])).
% 0.14/0.39  thf(f234,plain,(
% 0.14/0.39    ~spl6_1),
% 0.14/0.39    inference(avatar_contradiction_clause,[],[f233])).
% 0.14/0.39  thf(f233,plain,(
% 0.14/0.39    $false | ~spl6_1),
% 0.14/0.39    inference(trivial_inequality_removal,[],[f232])).
% 0.14/0.39  thf(f232,plain,(
% 0.14/0.39    ($true != $true) | ~spl6_1),
% 0.14/0.39    inference(duplicate_literal_removal,[],[f231])).
% 0.14/0.39  thf(f231,plain,(
% 0.14/0.39    ($true != $true) | ($true != $true) | ~spl6_1),
% 0.14/0.39    inference(beta_eta_normalization,[],[f219])).
% 0.14/0.39  thf(f219,plain,(
% 0.14/0.39    ($true != ((^[Y0 : $i]: ($true)) @ sK2)) | ($true != ((^[Y0 : $i]: ($true)) @ sK4)) | ~spl6_1),
% 0.14/0.39    inference(primitive_instantiation,[],[f177])).
% 0.14/0.39  thf(f177,plain,(
% 0.14/0.39    ( ! [X0 : $i > $o] : (((X0 @ sK4) != $true) | ((X0 @ sK2) != $true)) ) | ~spl6_1),
% 0.14/0.39    inference(trivial_inequality_removal,[],[f175])).
% 0.14/0.39  thf(f175,plain,(
% 0.14/0.39    ( ! [X0 : $i > $o] : (((X0 @ sK2) != $true) | ((X0 @ sK4) != $true) | ($true != $true)) ) | ~spl6_1),
% 0.14/0.39    inference(superposition,[],[f17,f29])).
% 0.14/0.39  thf(f29,plain,(
% 0.14/0.39    ( ! [X5 : $i > $o] : (($true = (sP0 @ X5 @ sK1 @ sK4)) | ($true != (X5 @ sK2))) ) | ~spl6_1),
% 0.14/0.39    inference(avatar_component_clause,[],[f28])).
% 0.14/0.39  thf(f28,plain,(
% 0.14/0.39    spl6_1 <=> ! [X5 : $i > $o] : (($true = (sP0 @ X5 @ sK1 @ sK4)) | ($true != (X5 @ sK2)))),
% 0.14/0.39    introduced(avatar_definition,[new_symbols(naming,[spl6_1])])).
% 0.14/0.39  thf(f17,plain,(
% 0.14/0.39    ( ! [X2 : $i > $o,X0 : $i,X1 : $i > $o] : (($true != (sP0 @ X2 @ X1 @ X0)) | ((X2 @ X0) != $true)) )),
% 0.14/0.39    inference(cnf_transformation,[],[f11])).
% 0.14/0.39  thf(f11,plain,(
% 0.14/0.39    ! [X0,X1 : $i > $o,X2 : $i > $o] : ((((X1 @ X0) = $true) & ((X2 @ X0) != $true)) | ($true != (sP0 @ X2 @ X1 @ X0)))),
% 0.14/0.39    inference(rectify,[],[f10])).
% 0.14/0.39  thf(f10,plain,(
% 0.14/0.39    ! [X2,X3 : $i > $o,X4 : $i > $o] : ((((X3 @ X2) = $true) & ((X4 @ X2) != $true)) | ($true != (sP0 @ X4 @ X3 @ X2)))),
% 0.14/0.39    inference(nnf_transformation,[],[f8])).
% 0.14/0.39  thf(f8,plain,(
% 0.14/0.39    ! [X2,X3 : $i > $o,X4 : $i > $o] : ((((X3 @ X2) = $true) & ((X4 @ X2) != $true)) | ~($true = (sP0 @ X4 @ X3 @ X2)))),
% 0.14/0.39    introduced(predicate_definition_introduction,[new_symbols(naming,[=])])).
% 0.14/0.39  thf(f174,plain,(
% 0.14/0.39    spl6_2 | ~spl6_9 | ~spl6_11),
% 0.14/0.39    inference(avatar_contradiction_clause,[],[f173])).
% 0.14/0.39  thf(f173,plain,(
% 0.14/0.39    $false | (spl6_2 | ~spl6_9 | ~spl6_11)),
% 0.14/0.39    inference(subsumption_resolution,[],[f172,f33])).
% 0.14/0.39  thf(f33,plain,(
% 0.14/0.39    ($true != (sK1 @ sK3)) | spl6_2),
% 0.14/0.39    inference(avatar_component_clause,[],[f31])).
% 0.14/0.39  thf(f31,plain,(
% 0.14/0.39    spl6_2 <=> ($true = (sK1 @ sK3))),
% 0.14/0.39    introduced(avatar_definition,[new_symbols(naming,[spl6_2])])).
% 0.14/0.39  thf(f172,plain,(
% 0.14/0.39    ($true = (sK1 @ sK3)) | (spl6_2 | ~spl6_9 | ~spl6_11)),
% 0.14/0.39    inference(subsumption_resolution,[],[f168,f147])).
% 0.14/0.39  thf(f147,plain,(
% 0.14/0.39    ($true = (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (spl6_2 | ~spl6_9 | ~spl6_11)),
% 0.14/0.39    inference(subsumption_resolution,[],[f115,f33])).
% 0.14/0.39  thf(f115,plain,(
% 0.14/0.39    ($true = (sK1 @ sK3)) | ($true = (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (~spl6_9 | ~spl6_11)),
% 0.14/0.39    inference(duplicate_literal_removal,[],[f114])).
% 0.14/0.39  thf(f114,plain,(
% 0.14/0.39    ($true = (sK1 @ sK3)) | ($true = (sK1 @ sK3)) | ($true = (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (~spl6_9 | ~spl6_11)),
% 0.14/0.39    inference(not_proxy_clausification,[],[f113])).
% 0.14/0.39  thf(f113,plain,(
% 0.14/0.39    ($true = (sK1 @ sK3)) | ((~ (sK1 @ sK3)) != $true) | ($true = (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (~spl6_9 | ~spl6_11)),
% 0.14/0.39    inference(not_proxy_clausification,[],[f112])).
% 0.14/0.39  thf(f112,plain,(
% 0.14/0.39    ($true = (sK1 @ sK3)) | ((~ (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) != $true) | ((~ (sK1 @ sK3)) != $true) | (~spl6_9 | ~spl6_11)),
% 0.14/0.39    inference(beta_eta_normalization,[],[f111])).
% 0.14/0.39  thf(f111,plain,(
% 0.14/0.39    ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ sK3)) | ($true = (sK1 @ sK3)) | ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (~spl6_9 | ~spl6_11)),
% 0.14/0.39    inference(trivial_inequality_removal,[],[f107])).
% 0.14/0.39  thf(f107,plain,(
% 0.14/0.39    ($true = (sK1 @ sK3)) | ($true = $false) | ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | ($true != $true) | ($true != ((^[Y0 : $i]: (~ (sK1 @ Y0))) @ sK3)) | (~spl6_9 | ~spl6_11)),
% 0.14/0.39    inference(superposition,[],[f83,f59])).
% 0.14/0.39  thf(f59,plain,(
% 0.14/0.39    ( ! [X4 : $i > $o] : (($true = (sK1 @ (sK5 @ X4))) | ((X4 @ sK3) != $true) | ($true != (X4 @ (sK5 @ X4)))) ) | ~spl6_9),
% 0.14/0.39    inference(avatar_component_clause,[],[f58])).
% 0.14/0.39  thf(f58,plain,(
% 0.14/0.39    spl6_9 <=> ! [X4 : $i > $o] : (((X4 @ sK3) != $true) | ($true != (X4 @ (sK5 @ X4))) | ($true = (sK1 @ (sK5 @ X4))))),
% 0.14/0.39    introduced(avatar_definition,[new_symbols(naming,[spl6_9])])).
% 0.14/0.39  thf(f83,plain,(
% 0.14/0.39    ( ! [X7 : $i > $o] : (((X7 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))) = $false) | ($true = (X7 @ sK3)) | ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))) != $true)) ) | ~spl6_11),
% 0.14/0.39    inference(not_proxy_clausification,[],[f82])).
% 0.14/0.39  thf(f82,plain,(
% 0.14/0.39    ( ! [X7 : $i > $o] : (($true = (X7 @ sK3)) | ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))) != $true) | ($true = (~ (X7 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0)))))))) ) | ~spl6_11),
% 0.14/0.39    inference(not_proxy_clausification,[],[f81])).
% 0.14/0.39  thf(f81,plain,(
% 0.14/0.39    ( ! [X7 : $i > $o] : (($true != (~ (X7 @ sK3))) | ($true = (~ (X7 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))))) | ((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))) != $true)) ) | ~spl6_11),
% 0.14/0.39    inference(beta_eta_normalization,[],[f78])).
% 0.14/0.39  thf(f78,plain,(
% 0.14/0.39    ( ! [X7 : $i > $o] : (((sK1 @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))) != $true) | ($true != ((^[Y0 : $i]: (~ (X7 @ Y0))) @ sK3)) | ($true = ((^[Y0 : $i]: (~ (X7 @ Y0))) @ (sK5 @ (^[Y0 : $i]: (~ (X7 @ Y0))))))) ) | ~spl6_11),
% 0.14/0.39    inference(primitive_instantiation,[],[f67])).
% 0.14/0.39  thf(f67,plain,(
% 0.14/0.39    ( ! [X4 : $i > $o] : (($true = (X4 @ (sK5 @ X4))) | ($true != (sK1 @ (sK5 @ X4))) | ((X4 @ sK3) != $true)) ) | ~spl6_11),
% 0.14/0.39    inference(avatar_component_clause,[],[f66])).
% 0.14/0.39  thf(f66,plain,(
% 0.14/0.39    spl6_11 <=> ! [X4 : $i > $o] : (($true = (X4 @ (sK5 @ X4))) | ((X4 @ sK3) != $true) | ($true != (sK1 @ (sK5 @ X4))))),
% 0.14/0.39    introduced(avatar_definition,[new_symbols(naming,[spl6_11])])).
% 0.14/0.39  thf(f168,plain,(
% 0.14/0.39    ($true != (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | ($true = (sK1 @ sK3)) | (spl6_2 | ~spl6_9 | ~spl6_11)),
% 0.14/0.39    inference(trivial_inequality_removal,[],[f166])).
% 0.14/0.39  thf(f166,plain,(
% 0.14/0.39    ($true = $false) | ($true = (sK1 @ sK3)) | ($true != (sK1 @ (sK5 @ (^[Y0 : $i]: (~ (sK1 @ Y0)))))) | (spl6_2 | ~spl6_9 | ~spl6_11)),
% 0.14/0.39    inference(superposition,[],[f147,f83])).
% 0.14/0.39  thf(f68,plain,(
% 0.14/0.39    spl6_1 | spl6_11),
% 0.14/0.39    inference(avatar_split_clause,[],[f25,f66,f28])).
% 0.14/0.39  thf(f25,plain,(
% 0.14/0.39    ( ! [X4 : $i > $o,X5 : $i > $o] : (($true != (X5 @ sK2)) | ($true = (X4 @ (sK5 @ X4))) | ($true != (sK1 @ (sK5 @ X4))) | ($true = (sP0 @ X5 @ sK1 @ sK4)) | ((X4 @ sK3) != $true)) )),
% 0.14/0.39    inference(cnf_transformation,[],[f16])).
% 0.14/0.39  thf(f16,plain,(
% 0.14/0.39    ! [X4 : $i > $o,X5 : $i > $o] : ((($true != (X5 @ sK2)) & ((X4 @ sK2) != $true)) | (((X4 @ sK3) != $true) & ($true != (sK1 @ sK3))) | ((($true != (X4 @ (sK5 @ X4))) | ($true = (sK1 @ (sK5 @ X4)))) & (($true = (X4 @ (sK5 @ X4))) | ($true != (sK1 @ (sK5 @ X4))))) | ($true = (sP0 @ X5 @ sK1 @ sK4)))),
% 0.14/0.39    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5])],[f13,f15,f14])).
% 0.14/0.39  thf(f14,plain,(
% 0.14/0.39    ? [X0 : $i > $o,X1,X2,X3] : ! [X4 : $i > $o,X5 : $i > $o] : ((((X5 @ X1) != $true) & ((X4 @ X1) != $true)) | (((X4 @ X2) != $true) & ((X0 @ X2) != $true)) | ? [X6] : ((($true != (X4 @ X6)) | ($true = (X0 @ X6))) & (($true = (X4 @ X6)) | ($true != (X0 @ X6)))) | ($true = (sP0 @ X5 @ X0 @ X3))) => ! [X5 : $i > $o,X4 : $i > $o] : ((($true != (X5 @ sK2)) & ((X4 @ sK2) != $true)) | (((X4 @ sK3) != $true) & ($true != (sK1 @ sK3))) | ? [X6] : ((($true != (X4 @ X6)) | ((sK1 @ X6) = $true)) & (($true = (X4 @ X6)) | ((sK1 @ X6) != $true))) | ($true = (sP0 @ X5 @ sK1 @ sK4)))),
% 0.14/0.39    introduced(choice_axiom,[])).
% 0.14/0.39  thf(f15,plain,(
% 0.14/0.39    ! [X4 : $i > $o] : (? [X6] : ((($true != (X4 @ X6)) | ((sK1 @ X6) = $true)) & (($true = (X4 @ X6)) | ((sK1 @ X6) != $true))) => ((($true != (X4 @ (sK5 @ X4))) | ($true = (sK1 @ (sK5 @ X4)))) & (($true = (X4 @ (sK5 @ X4))) | ($true != (sK1 @ (sK5 @ X4))))))),
% 0.14/0.39    introduced(choice_axiom,[])).
% 0.14/0.39  thf(f13,plain,(
% 0.14/0.39    ? [X0 : $i > $o,X1,X2,X3] : ! [X4 : $i > $o,X5 : $i > $o] : ((((X5 @ X1) != $true) & ((X4 @ X1) != $true)) | (((X4 @ X2) != $true) & ((X0 @ X2) != $true)) | ? [X6] : ((($true != (X4 @ X6)) | ($true = (X0 @ X6))) & (($true = (X4 @ X6)) | ($true != (X0 @ X6)))) | ($true = (sP0 @ X5 @ X0 @ X3)))),
% 0.14/0.39    inference(rectify,[],[f12])).
% 0.14/0.39  thf(f12,plain,(
% 0.14/0.39    ? [X3 : $i > $o,X0,X1,X2] : ! [X5 : $i > $o,X4 : $i > $o] : ((((X4 @ X0) != $true) & ((X5 @ X0) != $true)) | (((X5 @ X1) != $true) & ((X3 @ X1) != $true)) | ? [X6] : ((((X5 @ X6) != $true) | ((X3 @ X6) = $true)) & (((X5 @ X6) = $true) | ((X3 @ X6) != $true))) | ($true = (sP0 @ X4 @ X3 @ X2)))),
% 0.14/0.39    inference(nnf_transformation,[],[f9])).
% 0.14/0.39  thf(f9,plain,(
% 0.14/0.39    ? [X3 : $i > $o,X0,X1,X2] : ! [X5 : $i > $o,X4 : $i > $o] : ((((X4 @ X0) != $true) & ((X5 @ X0) != $true)) | (((X5 @ X1) != $true) & ((X3 @ X1) != $true)) | ? [X6] : (((X3 @ X6) != $true) <~> ((X5 @ X6) = $true)) | ($true = (sP0 @ X4 @ X3 @ X2)))),
% 0.14/0.39    inference(definition_folding,[],[f7,f8])).
% 0.14/0.39  thf(f7,plain,(
% 0.14/0.39    ? [X3 : $i > $o,X0,X1,X2] : ! [X5 : $i > $o,X4 : $i > $o] : ((((X4 @ X0) != $true) & ((X5 @ X0) != $true)) | (((X5 @ X1) != $true) & ((X3 @ X1) != $true)) | ? [X6] : (((X3 @ X6) != $true) <~> ((X5 @ X6) = $true)) | (((X3 @ X2) = $true) & ((X4 @ X2) != $true)))),
% 0.14/0.39    inference(ennf_transformation,[],[f6])).
% 0.14/0.39  thf(f6,plain,(
% 0.14/0.39    ~! [X2,X3 : $i > $o,X1,X0] : ? [X5 : $i > $o,X4 : $i > $o] : (! [X6] : (((X3 @ X6) != $true) <=> ((X5 @ X6) = $true)) & (((X3 @ X1) = $true) | ((X5 @ X1) = $true)) & (((X3 @ X2) != $true) | ((X4 @ X2) = $true)) & (((X4 @ X0) = $true) | ((X5 @ X0) = $true)))),
% 0.14/0.39    inference(flattening,[],[f5])).
% 0.14/0.39  thf(f5,plain,(
% 0.14/0.39    ~! [X0,X1,X2,X3 : $i > $o] : ? [X4 : $i > $o,X5 : $i > $o] : ((~((X3 @ X2) = $true) | ((X4 @ X2) = $true)) & (((X4 @ X0) = $true) | ((X5 @ X0) = $true)) & ! [X6] : (((X5 @ X6) = $true) <=> ~((X3 @ X6) = $true)) & (((X3 @ X1) = $true) | ((X5 @ X1) = $true)))),
% 0.14/0.39    inference(fool_elimination,[],[f4])).
% 0.14/0.39  thf(f4,plain,(
% 0.14/0.39    ~! [X0,X1,X2,X3 : $i > $o] : ? [X4 : $i > $o,X5 : $i > $o] : ((~(X3 @ X2) | (X4 @ X2)) & ((X4 @ X0) | (X5 @ X0)) & ! [X6] : ((X5 @ X6) <=> ~(X3 @ X6)) & ((X3 @ X1) | (X5 @ X1)))),
% 0.14/0.39    inference(rectify,[],[f2])).
% 0.14/0.39  thf(f2,negated_conjecture,(
% 0.14/0.39    ~! [X0,X1,X2,X3 : $i > $o] : ? [X4 : $i > $o,X5 : $i > $o] : ((~(X3 @ X2) | (X4 @ X2)) & ((X4 @ X0) | (X5 @ X0)) & ! [X6] : ((X5 @ X6) <=> ~(X3 @ X6)) & ((X3 @ X1) | (X5 @ X1)))),
% 0.14/0.39    inference(negated_conjecture,[],[f1])).
% 0.14/0.39  thf(f1,conjecture,(
% 0.14/0.39    ! [X0,X1,X2,X3 : $i > $o] : ? [X4 : $i > $o,X5 : $i > $o] : ((~(X3 @ X2) | (X4 @ X2)) & ((X4 @ X0) | (X5 @ X0)) & ! [X6] : ((X5 @ X6) <=> ~(X3 @ X6)) & ((X3 @ X1) | (X5 @ X1)))),
% 0.14/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM125D)).
% 0.14/0.39  thf(f60,plain,(
% 0.14/0.39    spl6_9 | spl6_1),
% 0.14/0.39    inference(avatar_split_clause,[],[f26,f28,f58])).
% 0.14/0.39  thf(f26,plain,(
% 0.14/0.39    ( ! [X4 : $i > $o,X5 : $i > $o] : (($true != (X5 @ sK2)) | ((X4 @ sK3) != $true) | ($true = (sK1 @ (sK5 @ X4))) | ($true = (sP0 @ X5 @ sK1 @ sK4)) | ($true != (X4 @ (sK5 @ X4)))) )),
% 0.14/0.39    inference(cnf_transformation,[],[f16])).
% 0.14/0.39  thf(f41,plain,(
% 0.14/0.39    spl6_4 | ~spl6_2 | spl6_1),
% 0.14/0.39    inference(avatar_split_clause,[],[f24,f28,f31,f39])).
% 0.14/0.39  thf(f24,plain,(
% 0.14/0.39    ( ! [X4 : $i > $o,X5 : $i > $o] : (($true != (X4 @ (sK5 @ X4))) | ($true = (sP0 @ X5 @ sK1 @ sK4)) | ($true != (X5 @ sK2)) | ($true != (sK1 @ sK3)) | ($true = (sK1 @ (sK5 @ X4)))) )),
% 0.14/0.39    inference(cnf_transformation,[],[f16])).
% 0.14/0.39  thf(f37,plain,(
% 0.14/0.39    spl6_1 | ~spl6_2 | spl6_3),
% 0.14/0.39    inference(avatar_split_clause,[],[f23,f35,f31,f28])).
% 0.14/0.39  thf(f23,plain,(
% 0.14/0.39    ( ! [X4 : $i > $o,X5 : $i > $o] : (($true = (sP0 @ X5 @ sK1 @ sK4)) | ($true = (X4 @ (sK5 @ X4))) | ($true != (sK1 @ sK3)) | ($true != (sK1 @ (sK5 @ X4))) | ($true != (X5 @ sK2))) )),
% 0.14/0.39    inference(cnf_transformation,[],[f16])).
% 0.14/0.39  % SZS output end Proof for theBenchmark
% 0.14/0.39  % (32750)------------------------------
% 0.14/0.39  % (32750)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39  % (32750)Termination reason: Refutation
% 0.14/0.39  
% 0.14/0.39  % (32750)Memory used [KB]: 5628
% 0.14/0.39  % (32750)Time elapsed: 0.022 s
% 0.14/0.39  % (32750)Instructions burned: 26 (million)
% 0.14/0.39  % (32750)------------------------------
% 0.14/0.39  % (32750)------------------------------
% 0.14/0.39  % (32744)Success in time 0.032 s
% 0.14/0.39  % Vampire---4.8 exiting
%------------------------------------------------------------------------------