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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEV088^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 : 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 04:11:56 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SEV088^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/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.35  % Computer : n012.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % 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   : Sun May 19 19:18: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.14/0.37  % (20237)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  % (20231)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  % (20232)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  % (20234)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37  % (20236)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  % (20233)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  % (20235)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  % (20238)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.37  % (20234)Instruction limit reached!
% 0.14/0.37  % (20234)------------------------------
% 0.14/0.37  % (20234)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (20234)Termination reason: Unknown
% 0.14/0.37  % (20235)Instruction limit reached!
% 0.14/0.37  % (20235)------------------------------
% 0.14/0.37  % (20235)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (20234)Termination phase: Preprocessing 3
% 0.14/0.37  
% 0.14/0.37  % (20234)Memory used [KB]: 895
% 0.14/0.37  % (20234)Time elapsed: 0.003 s
% 0.14/0.37  % (20234)Instructions burned: 2 (million)
% 0.14/0.37  % (20234)------------------------------
% 0.14/0.37  % (20234)------------------------------
% 0.14/0.37  % (20235)Termination reason: Unknown
% 0.14/0.37  % (20235)Termination phase: Property scanning
% 0.14/0.37  
% 0.14/0.37  % (20235)Memory used [KB]: 895
% 0.14/0.37  % (20235)Time elapsed: 0.003 s
% 0.14/0.37  % (20235)Instructions burned: 2 (million)
% 0.14/0.37  % (20235)------------------------------
% 0.14/0.37  % (20235)------------------------------
% 0.14/0.37  % (20238)Instruction limit reached!
% 0.14/0.37  % (20238)------------------------------
% 0.14/0.37  % (20238)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (20238)Termination reason: Unknown
% 0.14/0.37  % (20238)Termination phase: Saturation
% 0.14/0.37  
% 0.14/0.37  % (20238)Memory used [KB]: 5500
% 0.14/0.37  % (20238)Time elapsed: 0.004 s
% 0.14/0.37  % (20238)Instructions burned: 3 (million)
% 0.14/0.37  % (20238)------------------------------
% 0.14/0.37  % (20238)------------------------------
% 0.14/0.37  % (20237)First to succeed.
% 0.14/0.37  % (20232)Instruction limit reached!
% 0.14/0.37  % (20232)------------------------------
% 0.14/0.37  % (20232)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (20232)Termination reason: Unknown
% 0.14/0.37  % (20232)Termination phase: Saturation
% 0.14/0.37  
% 0.14/0.37  % (20232)Memory used [KB]: 5500
% 0.14/0.37  % (20232)Time elapsed: 0.005 s
% 0.14/0.37  % (20232)Instructions burned: 5 (million)
% 0.14/0.37  % (20232)------------------------------
% 0.14/0.37  % (20232)------------------------------
% 0.14/0.37  % (20233)Refutation not found, incomplete strategy
% 0.14/0.37  % (20233)------------------------------
% 0.14/0.37  % (20233)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (20233)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37  
% 0.14/0.37  
% 0.14/0.37  % (20233)Memory used [KB]: 5500
% 0.14/0.37  % (20233)Time elapsed: 0.005 s
% 0.14/0.37  % (20233)Instructions burned: 4 (million)
% 0.14/0.37  % (20233)------------------------------
% 0.14/0.37  % (20233)------------------------------
% 0.14/0.37  % (20231)Also succeeded, but the first one will report.
% 0.14/0.37  % (20237)Refutation found. Thanks to Tanya!
% 0.14/0.37  % SZS status Theorem for theBenchmark
% 0.14/0.37  % SZS output start Proof for theBenchmark
% 0.14/0.37  thf(func_def_3, type, sK0: (($i > $o) > ($i > $o) > $i > $o) > (($i > $o) > ($i > $o) > $i > $o) > $i > $o).
% 0.14/0.37  thf(func_def_4, type, sK1: (($i > $o) > ($i > $o) > $i > $o) > (($i > $o) > ($i > $o) > $i > $o) > $i > $o).
% 0.14/0.37  thf(func_def_5, type, sK2: (($i > $o) > ($i > $o) > $i > $o) > (($i > $o) > ($i > $o) > $i > $o) > $i > $o).
% 0.14/0.37  thf(func_def_6, type, sK3: (($i > $o) > ($i > $o) > $i > $o) > (($i > $o) > ($i > $o) > $i > $o) > $i).
% 0.14/0.37  thf(func_def_7, type, sK4: (($i > $o) > ($i > $o) > $i > $o) > (($i > $o) > ($i > $o) > $i > $o) > $i).
% 0.14/0.37  thf(func_def_8, type, sK5: (($i > $o) > ($i > $o) > $i > $o) > (($i > $o) > ($i > $o) > $i > $o) > $i > $o).
% 0.14/0.37  thf(func_def_11, type, ph7: !>[X0: $tType]:(X0)).
% 0.14/0.37  thf(f31,plain,(
% 0.14/0.37    $false),
% 0.14/0.37    inference(trivial_inequality_removal,[],[f30])).
% 0.14/0.37  thf(f30,plain,(
% 0.14/0.37    ($true != $true)),
% 0.14/0.37    inference(beta_eta_normalization,[],[f26])).
% 0.14/0.37  thf(f26,plain,(
% 0.14/0.37    ( ! [X0 : ($i > $o) > ($i > $o) > $i > $o] : (($true != ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ($true)))))) @ (sK0 @ X0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ($true))))))) @ (sK1 @ X0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ($true))))))) @ (sK3 @ X0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ($true)))))))))) )),
% 0.14/0.37    inference(equality_resolution,[],[f13])).
% 0.14/0.37  thf(f13,plain,(
% 0.14/0.37    ( ! [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (($true != (X0 @ (sK5 @ X1 @ X0) @ (sK5 @ X1 @ X0) @ (sK4 @ X1 @ X0))) | ($true != (X0 @ (sK0 @ X1 @ X0) @ (sK1 @ X1 @ X0) @ (sK3 @ X1 @ X0)))) )),
% 0.14/0.37    inference(cnf_transformation,[],[f12])).
% 0.14/0.37  thf(f12,plain,(
% 0.14/0.37    ! [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : ((! [X5] : (((X1 @ (sK2 @ X1 @ X0) @ (sK1 @ X1 @ X0) @ X5) = $true) | ($true = (X0 @ (sK2 @ X1 @ X0) @ (sK1 @ X1 @ X0) @ X5))) & ! [X6] : (($true = (X0 @ (sK0 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ X6)) | ((X1 @ (sK0 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ X6) = $true)) & (((X1 @ (sK0 @ X1 @ X0) @ (sK1 @ X1 @ X0) @ (sK3 @ X1 @ X0)) != $true) & ($true != (X0 @ (sK0 @ X1 @ X0) @ (sK1 @ X1 @ X0) @ (sK3 @ X1 @ X0))))) | (((X1 @ (sK5 @ X1 @ X0) @ (sK5 @ X1 @ X0) @ (sK4 @ X1 @ X0)) != $true) & ($true != (X0 @ (sK5 @ X1 @ X0) @ (sK5 @ X1 @ X0) @ (sK4 @ X1 @ X0)))))),
% 0.14/0.37    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f8,f11,f10,f9])).
% 0.14/0.37  thf(f9,plain,(
% 0.14/0.37    ! [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (? [X2 : $i > $o,X3 : $i > $o,X4 : $i > $o] : (! [X5] : (($true = (X1 @ X4 @ X3 @ X5)) | ($true = (X0 @ X4 @ X3 @ X5))) & ! [X6] : (($true = (X0 @ X2 @ X4 @ X6)) | ($true = (X1 @ X2 @ X4 @ X6))) & ? [X7] : (($true != (X1 @ X2 @ X3 @ X7)) & ((X0 @ X2 @ X3 @ X7) != $true))) => (! [X5] : (((X1 @ (sK2 @ X1 @ X0) @ (sK1 @ X1 @ X0) @ X5) = $true) | ($true = (X0 @ (sK2 @ X1 @ X0) @ (sK1 @ X1 @ X0) @ X5))) & ! [X6] : (($true = (X0 @ (sK0 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ X6)) | ((X1 @ (sK0 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ X6) = $true)) & ? [X7] : (($true != (X1 @ (sK0 @ X1 @ X0) @ (sK1 @ X1 @ X0) @ X7)) & ($true != (X0 @ (sK0 @ X1 @ X0) @ (sK1 @ X1 @ X0) @ X7)))))),
% 0.14/0.37    introduced(choice_axiom,[])).
% 0.14/0.37  thf(f10,plain,(
% 0.14/0.37    ! [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (? [X7] : (($true != (X1 @ (sK0 @ X1 @ X0) @ (sK1 @ X1 @ X0) @ X7)) & ($true != (X0 @ (sK0 @ X1 @ X0) @ (sK1 @ X1 @ X0) @ X7))) => (((X1 @ (sK0 @ X1 @ X0) @ (sK1 @ X1 @ X0) @ (sK3 @ X1 @ X0)) != $true) & ($true != (X0 @ (sK0 @ X1 @ X0) @ (sK1 @ X1 @ X0) @ (sK3 @ X1 @ X0)))))),
% 0.14/0.37    introduced(choice_axiom,[])).
% 0.14/0.37  thf(f11,plain,(
% 0.14/0.37    ! [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (? [X8,X9 : $i > $o] : (($true != (X1 @ X9 @ X9 @ X8)) & ($true != (X0 @ X9 @ X9 @ X8))) => (((X1 @ (sK5 @ X1 @ X0) @ (sK5 @ X1 @ X0) @ (sK4 @ X1 @ X0)) != $true) & ($true != (X0 @ (sK5 @ X1 @ X0) @ (sK5 @ X1 @ X0) @ (sK4 @ X1 @ X0)))))),
% 0.14/0.37    introduced(choice_axiom,[])).
% 0.14/0.37  thf(f8,plain,(
% 0.14/0.37    ! [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (? [X2 : $i > $o,X3 : $i > $o,X4 : $i > $o] : (! [X5] : (($true = (X1 @ X4 @ X3 @ X5)) | ($true = (X0 @ X4 @ X3 @ X5))) & ! [X6] : (($true = (X0 @ X2 @ X4 @ X6)) | ($true = (X1 @ X2 @ X4 @ X6))) & ? [X7] : (($true != (X1 @ X2 @ X3 @ X7)) & ((X0 @ X2 @ X3 @ X7) != $true))) | ? [X8,X9 : $i > $o] : (($true != (X1 @ X9 @ X9 @ X8)) & ($true != (X0 @ X9 @ X9 @ X8))))),
% 0.14/0.37    inference(rectify,[],[f7])).
% 0.14/0.37  thf(f7,plain,(
% 0.14/0.37    ! [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (? [X4 : $i > $o,X2 : $i > $o,X3 : $i > $o] : (! [X6] : (($true = (X1 @ X3 @ X2 @ X6)) | ((X0 @ X3 @ X2 @ X6) = $true)) & ! [X5] : (($true = (X0 @ X4 @ X3 @ X5)) | ($true = (X1 @ X4 @ X3 @ X5))) & ? [X7] : (($true != (X1 @ X4 @ X2 @ X7)) & ($true != (X0 @ X4 @ X2 @ X7)))) | ? [X9,X8 : $i > $o] : (((X1 @ X8 @ X8 @ X9) != $true) & ($true != (X0 @ X8 @ X8 @ X9))))),
% 0.14/0.37    inference(flattening,[],[f6])).
% 0.14/0.37  thf(f6,plain,(
% 0.14/0.37    ! [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (? [X9,X8 : $i > $o] : (((X1 @ X8 @ X8 @ X9) != $true) & ($true != (X0 @ X8 @ X8 @ X9))) | ? [X2 : $i > $o,X3 : $i > $o,X4 : $i > $o] : (? [X7] : (($true != (X1 @ X4 @ X2 @ X7)) & ($true != (X0 @ X4 @ X2 @ X7))) & (! [X6] : (($true = (X1 @ X3 @ X2 @ X6)) | ((X0 @ X3 @ X2 @ X6) = $true)) & ! [X5] : (($true = (X0 @ X4 @ X3 @ X5)) | ($true = (X1 @ X4 @ X3 @ X5))))))),
% 0.14/0.37    inference(ennf_transformation,[],[f5])).
% 0.14/0.37  thf(f5,plain,(
% 0.14/0.37    ~? [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (! [X9,X8 : $i > $o] : (((X1 @ X8 @ X8 @ X9) = $true) | ($true = (X0 @ X8 @ X8 @ X9))) & ! [X2 : $i > $o,X3 : $i > $o,X4 : $i > $o] : ((! [X6] : (($true = (X1 @ X3 @ X2 @ X6)) | ((X0 @ X3 @ X2 @ X6) = $true)) & ! [X5] : (($true = (X0 @ X4 @ X3 @ X5)) | ($true = (X1 @ X4 @ X3 @ X5)))) => ! [X7] : (($true = (X0 @ X4 @ X2 @ X7)) | ($true = (X1 @ X4 @ X2 @ X7)))))),
% 0.14/0.37    inference(fool_elimination,[],[f4])).
% 0.14/0.37  thf(f4,plain,(
% 0.14/0.37    ~? [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (! [X2 : $i > $o,X3 : $i > $o,X4 : $i > $o] : ((! [X5] : ((X0 @ X4 @ X3 @ X5) | (X1 @ X4 @ X3 @ X5)) & ! [X6] : ((X0 @ X3 @ X2 @ X6) | (X1 @ X3 @ X2 @ X6))) => ! [X7] : ((X1 @ X4 @ X2 @ X7) | (X0 @ X4 @ X2 @ X7))) & ! [X8 : $i > $o,X9] : ((X1 @ X8 @ X8 @ X9) | (X0 @ X8 @ X8 @ X9)))),
% 0.14/0.37    inference(rectify,[],[f2])).
% 0.14/0.37  thf(f2,negated_conjecture,(
% 0.14/0.37    ~? [X1 : ($i > $o) > ($i > $o) > $i > $o,X0 : ($i > $o) > ($i > $o) > $i > $o] : (! [X4 : $i > $o,X3 : $i > $o,X2 : $i > $o] : ((! [X5] : ((X1 @ X2 @ X3 @ X5) | (X0 @ X2 @ X3 @ X5)) & ! [X5] : ((X1 @ X3 @ X4 @ X5) | (X0 @ X3 @ X4 @ X5))) => ! [X5] : ((X0 @ X2 @ X4 @ X5) | (X1 @ X2 @ X4 @ X5))) & ! [X2 : $i > $o,X5] : ((X0 @ X2 @ X2 @ X5) | (X1 @ X2 @ X2 @ X5)))),
% 0.14/0.37    inference(negated_conjecture,[],[f1])).
% 0.14/0.37  thf(f1,conjecture,(
% 0.14/0.37    ? [X1 : ($i > $o) > ($i > $o) > $i > $o,X0 : ($i > $o) > ($i > $o) > $i > $o] : (! [X4 : $i > $o,X3 : $i > $o,X2 : $i > $o] : ((! [X5] : ((X1 @ X2 @ X3 @ X5) | (X0 @ X2 @ X3 @ X5)) & ! [X5] : ((X1 @ X3 @ X4 @ X5) | (X0 @ X3 @ X4 @ X5))) => ! [X5] : ((X0 @ X2 @ X4 @ X5) | (X1 @ X2 @ X4 @ X5))) & ! [X2 : $i > $o,X5] : ((X0 @ X2 @ X2 @ X5) | (X1 @ X2 @ X2 @ X5)))),
% 0.14/0.37    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM120G_pme)).
% 0.14/0.37  % SZS output end Proof for theBenchmark
% 0.14/0.37  % (20237)------------------------------
% 0.14/0.37  % (20237)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (20237)Termination reason: Refutation
% 0.14/0.37  
% 0.14/0.37  % (20237)Memory used [KB]: 5500
% 0.14/0.37  % (20237)Time elapsed: 0.007 s
% 0.14/0.37  % (20237)Instructions burned: 6 (million)
% 0.14/0.37  % (20237)------------------------------
% 0.14/0.37  % (20237)------------------------------
% 0.14/0.37  % (20230)Success in time 0.017 s
% 0.14/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------