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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO317^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 : n027.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:57 EDT 2024

% Result   : Theorem 0.11s 0.34s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SYO317^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.11  % 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.11/0.32  % Computer : n027.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Mon May 20 09:35:53 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.11/0.32  This is a TH0_THM_NEQ_NAR problem
% 0.11/0.32  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.11/0.34  % (6285)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.11/0.34  % (6284)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.11/0.34  % (6283)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.11/0.34  % (6286)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.11/0.34  % (6288)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.11/0.34  % (6287)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.11/0.34  % (6285)Instruction limit reached!
% 0.11/0.34  % (6285)------------------------------
% 0.11/0.34  % (6285)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34  % (6289)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.11/0.34  % (6285)Termination reason: Unknown
% 0.11/0.34  % (6286)Instruction limit reached!
% 0.11/0.34  % (6286)------------------------------
% 0.11/0.34  % (6286)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34  % (6286)Termination reason: Unknown
% 0.11/0.34  % (6286)Termination phase: Saturation
% 0.11/0.34  
% 0.11/0.34  % (6286)Memory used [KB]: 5373
% 0.11/0.34  % (6286)Time elapsed: 0.003 s
% 0.11/0.34  % (6286)Instructions burned: 2 (million)
% 0.11/0.34  % (6286)------------------------------
% 0.11/0.34  % (6286)------------------------------
% 0.11/0.34  % (6285)Termination phase: Saturation
% 0.11/0.34  
% 0.11/0.34  % (6285)Memory used [KB]: 5373
% 0.11/0.34  % (6285)Time elapsed: 0.003 s
% 0.11/0.34  % (6285)Instructions burned: 2 (million)
% 0.11/0.34  % (6285)------------------------------
% 0.11/0.34  % (6285)------------------------------
% 0.11/0.34  % (6282)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.11/0.34  % (6283)Instruction limit reached!
% 0.11/0.34  % (6283)------------------------------
% 0.11/0.34  % (6283)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34  % (6283)Termination reason: Unknown
% 0.11/0.34  % (6283)Termination phase: Saturation
% 0.11/0.34  
% 0.11/0.34  % (6283)Memory used [KB]: 5500
% 0.11/0.34  % (6283)Time elapsed: 0.005 s
% 0.11/0.34  % (6283)Instructions burned: 4 (million)
% 0.11/0.34  % (6283)------------------------------
% 0.11/0.34  % (6283)------------------------------
% 0.11/0.34  % (6289)Instruction limit reached!
% 0.11/0.34  % (6289)------------------------------
% 0.11/0.34  % (6289)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34  % (6289)Termination reason: Unknown
% 0.11/0.34  % (6289)Termination phase: Saturation
% 0.11/0.34  
% 0.11/0.34  % (6289)Memory used [KB]: 5500
% 0.11/0.34  % (6289)Time elapsed: 0.004 s
% 0.11/0.34  % (6289)Instructions burned: 4 (million)
% 0.11/0.34  % (6289)------------------------------
% 0.11/0.34  % (6289)------------------------------
% 0.11/0.34  % (6284)First to succeed.
% 0.11/0.34  % (6287)Also succeeded, but the first one will report.
% 0.11/0.34  % (6284)Refutation found. Thanks to Tanya!
% 0.11/0.34  % SZS status Theorem for theBenchmark
% 0.11/0.34  % SZS output start Proof for theBenchmark
% 0.11/0.34  thf(func_def_0, type, cP: $i > $o).
% 0.11/0.34  thf(func_def_1, type, f: $i > $i).
% 0.11/0.34  thf(func_def_2, type, cEQ: $i > $i > $o).
% 0.11/0.34  thf(func_def_5, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.11/0.34  thf(func_def_8, type, sK0: ($i > $o) > $i).
% 0.11/0.34  thf(func_def_10, type, ph2: !>[X0: $tType]:(X0)).
% 0.11/0.34  thf(f59,plain,(
% 0.11/0.34    $false),
% 0.11/0.34    inference(trivial_inequality_removal,[],[f58])).
% 0.11/0.34  thf(f58,plain,(
% 0.11/0.34    ($true != $true)),
% 0.11/0.34    inference(superposition,[],[f54,f28])).
% 0.11/0.34  thf(f28,plain,(
% 0.11/0.34    ( ! [X0 : $i] : (((cEQ @ X0 @ (sK0 @ (cEQ @ (f @ X0)))) = $true)) )),
% 0.11/0.34    inference(trivial_inequality_removal,[],[f26])).
% 0.11/0.34  thf(f26,plain,(
% 0.11/0.34    ( ! [X0 : $i] : (($true != $true) | ((cEQ @ X0 @ (sK0 @ (cEQ @ (f @ X0)))) = $true)) )),
% 0.11/0.34    inference(superposition,[],[f12,f22])).
% 0.11/0.34  thf(f22,plain,(
% 0.11/0.34    ( ! [X0 : $i] : (($true = (cEQ @ X0 @ (f @ (sK0 @ (cEQ @ X0)))))) )),
% 0.11/0.34    inference(trivial_inequality_removal,[],[f21])).
% 0.11/0.34  thf(f21,plain,(
% 0.11/0.34    ( ! [X0 : $i] : (($true = (cEQ @ X0 @ (f @ (sK0 @ (cEQ @ X0))))) | ($true != $true)) )),
% 0.11/0.34    inference(superposition,[],[f15,f14])).
% 0.11/0.34  thf(f14,plain,(
% 0.11/0.34    ( ! [X3 : $i] : (((cEQ @ X3 @ X3) = $true)) )),
% 0.11/0.34    inference(cnf_transformation,[],[f10])).
% 0.11/0.34  thf(f10,plain,(
% 0.11/0.34    ! [X0 : $i > $o] : (! [X1] : ($true != (X0 @ X1)) | (((cP @ (sK0 @ X0)) != $true) & ($true = (X0 @ (f @ (sK0 @ X0)))))) & ! [X3] : ((cEQ @ X3 @ X3) = $true) & ((cP @ a) = $true) & ! [X4,X5] : (($true != (cEQ @ (f @ X4) @ (f @ X5))) | ($true = (cEQ @ X4 @ X5))) & ! [X6,X7] : (($true != (cEQ @ X7 @ X6)) | ($true != (cP @ X7)) | ((cP @ X6) = $true))),
% 0.11/0.34    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9])).
% 0.11/0.34  thf(f9,plain,(
% 0.11/0.34    ! [X0 : $i > $o] : (? [X2] : (($true != (cP @ X2)) & ((X0 @ (f @ X2)) = $true)) => (((cP @ (sK0 @ X0)) != $true) & ($true = (X0 @ (f @ (sK0 @ X0))))))),
% 0.11/0.34    introduced(choice_axiom,[])).
% 0.11/0.34  thf(f8,plain,(
% 0.11/0.34    ! [X0 : $i > $o] : (! [X1] : ($true != (X0 @ X1)) | ? [X2] : (($true != (cP @ X2)) & ((X0 @ (f @ X2)) = $true))) & ! [X3] : ((cEQ @ X3 @ X3) = $true) & ((cP @ a) = $true) & ! [X4,X5] : (($true != (cEQ @ (f @ X4) @ (f @ X5))) | ($true = (cEQ @ X4 @ X5))) & ! [X6,X7] : (($true != (cEQ @ X7 @ X6)) | ($true != (cP @ X7)) | ((cP @ X6) = $true))),
% 0.11/0.34    inference(rectify,[],[f7])).
% 0.11/0.34  thf(f7,plain,(
% 0.11/0.34    ! [X5 : $i > $o] : (! [X6] : ($true != (X5 @ X6)) | ? [X7] : (($true != (cP @ X7)) & ($true = (X5 @ (f @ X7))))) & ! [X2] : ((cEQ @ X2 @ X2) = $true) & ((cP @ a) = $true) & ! [X4,X3] : (($true != (cEQ @ (f @ X4) @ (f @ X3))) | ($true = (cEQ @ X4 @ X3))) & ! [X0,X1] : (($true != (cEQ @ X1 @ X0)) | ((cP @ X1) != $true) | ((cP @ X0) = $true))),
% 0.11/0.34    inference(flattening,[],[f6])).
% 0.11/0.34  thf(f6,plain,(
% 0.11/0.34    ! [X5 : $i > $o] : (! [X6] : ($true != (X5 @ X6)) | ? [X7] : (($true != (cP @ X7)) & ($true = (X5 @ (f @ X7))))) & (((cP @ a) = $true) & ! [X2] : ((cEQ @ X2 @ X2) = $true) & ! [X1,X0] : (((cP @ X0) = $true) | (((cP @ X1) != $true) | ($true != (cEQ @ X1 @ X0)))) & ! [X4,X3] : (($true != (cEQ @ (f @ X4) @ (f @ X3))) | ($true = (cEQ @ X4 @ X3))))),
% 0.11/0.34    inference(ennf_transformation,[],[f5])).
% 0.11/0.34  thf(f5,plain,(
% 0.11/0.34    ~((((cP @ a) = $true) & ! [X2] : ((cEQ @ X2 @ X2) = $true) & ! [X1,X0] : ((((cP @ X1) = $true) & ($true = (cEQ @ X1 @ X0))) => ((cP @ X0) = $true)) & ! [X3,X4] : (($true = (cEQ @ (f @ X4) @ (f @ X3))) => ($true = (cEQ @ X4 @ X3)))) => ? [X5 : $i > $o] : (? [X6] : ($true = (X5 @ X6)) & ! [X7] : (($true = (X5 @ (f @ X7))) => ($true = (cP @ X7)))))),
% 0.11/0.34    inference(fool_elimination,[],[f4])).
% 0.11/0.34  thf(f4,plain,(
% 0.11/0.34    ~((! [X0,X1] : (((cP @ X1) & (cEQ @ X1 @ X0)) => (cP @ X0)) & ! [X2] : (cEQ @ X2 @ X2) & ! [X3,X4] : ((cEQ @ (f @ X4) @ (f @ X3)) => (cEQ @ X4 @ X3)) & (cP @ a)) => ? [X5 : $i > $o] : (? [X6] : (X5 @ X6) & ! [X7] : ((X5 @ (f @ X7)) => (cP @ X7))))),
% 0.11/0.34    inference(rectify,[],[f2])).
% 0.11/0.34  thf(f2,negated_conjecture,(
% 0.11/0.34    ~((! [X1,X0] : (((cP @ X0) & (cEQ @ X0 @ X1)) => (cP @ X1)) & ! [X0] : (cEQ @ X0 @ X0) & ! [X2,X1] : ((cEQ @ (f @ X1) @ (f @ X2)) => (cEQ @ X1 @ X2)) & (cP @ a)) => ? [X3 : $i > $o] : (? [X2] : (X3 @ X2) & ! [X0] : ((X3 @ (f @ X0)) => (cP @ X0))))),
% 0.11/0.34    inference(negated_conjecture,[],[f1])).
% 0.11/0.34  thf(f1,conjecture,(
% 0.11/0.34    (! [X1,X0] : (((cP @ X0) & (cEQ @ X0 @ X1)) => (cP @ X1)) & ! [X0] : (cEQ @ X0 @ X0) & ! [X2,X1] : ((cEQ @ (f @ X1) @ (f @ X2)) => (cEQ @ X1 @ X2)) & (cP @ a)) => ? [X3 : $i > $o] : (? [X2] : (X3 @ X2) & ! [X0] : ((X3 @ (f @ X0)) => (cP @ X0)))),
% 0.11/0.34    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM304)).
% 0.11/0.34  thf(f15,plain,(
% 0.11/0.34    ( ! [X0 : $i > $o,X1 : $i] : (($true != (X0 @ X1)) | ($true = (X0 @ (f @ (sK0 @ X0))))) )),
% 0.11/0.34    inference(cnf_transformation,[],[f10])).
% 0.11/0.34  thf(f12,plain,(
% 0.11/0.34    ( ! [X4 : $i,X5 : $i] : (($true != (cEQ @ (f @ X4) @ (f @ X5))) | ($true = (cEQ @ X4 @ X5))) )),
% 0.11/0.34    inference(cnf_transformation,[],[f10])).
% 0.11/0.34  thf(f54,plain,(
% 0.11/0.34    ( ! [X0 : $i] : (($true != (cEQ @ (f @ a) @ X0))) )),
% 0.11/0.34    inference(trivial_inequality_removal,[],[f48])).
% 0.11/0.34  thf(f48,plain,(
% 0.11/0.34    ( ! [X0 : $i] : (($true != (cEQ @ (f @ a) @ X0)) | ($true != $true)) )),
% 0.11/0.34    inference(superposition,[],[f16,f46])).
% 0.11/0.34  thf(f46,plain,(
% 0.11/0.34    ((cP @ (sK0 @ (cEQ @ (f @ a)))) = $true)),
% 0.11/0.34    inference(trivial_inequality_removal,[],[f42])).
% 0.11/0.34  thf(f42,plain,(
% 0.11/0.34    ($true != $true) | ((cP @ (sK0 @ (cEQ @ (f @ a)))) = $true)),
% 0.11/0.34    inference(superposition,[],[f32,f13])).
% 0.11/0.34  thf(f13,plain,(
% 0.11/0.34    ((cP @ a) = $true)),
% 0.11/0.34    inference(cnf_transformation,[],[f10])).
% 0.11/0.34  thf(f32,plain,(
% 0.11/0.34    ( ! [X0 : $i] : (((cP @ X0) != $true) | ($true = (cP @ (sK0 @ (cEQ @ (f @ X0)))))) )),
% 0.11/0.34    inference(trivial_inequality_removal,[],[f30])).
% 0.11/0.34  thf(f30,plain,(
% 0.11/0.34    ( ! [X0 : $i] : (($true = (cP @ (sK0 @ (cEQ @ (f @ X0))))) | ((cP @ X0) != $true) | ($true != $true)) )),
% 0.11/0.34    inference(superposition,[],[f11,f28])).
% 0.11/0.34  thf(f11,plain,(
% 0.11/0.34    ( ! [X6 : $i,X7 : $i] : (($true != (cEQ @ X7 @ X6)) | ((cP @ X6) = $true) | ($true != (cP @ X7))) )),
% 0.11/0.34    inference(cnf_transformation,[],[f10])).
% 0.11/0.34  thf(f16,plain,(
% 0.11/0.34    ( ! [X0 : $i > $o,X1 : $i] : (((cP @ (sK0 @ X0)) != $true) | ($true != (X0 @ X1))) )),
% 0.11/0.34    inference(cnf_transformation,[],[f10])).
% 0.11/0.34  % SZS output end Proof for theBenchmark
% 0.11/0.34  % (6284)------------------------------
% 0.11/0.34  % (6284)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34  % (6284)Termination reason: Refutation
% 0.11/0.34  
% 0.11/0.34  % (6284)Memory used [KB]: 5500
% 0.11/0.34  % (6284)Time elapsed: 0.008 s
% 0.11/0.34  % (6284)Instructions burned: 8 (million)
% 0.11/0.34  % (6284)------------------------------
% 0.11/0.34  % (6284)------------------------------
% 0.11/0.34  % (6281)Success in time 0.011 s
% 0.11/0.34  % Vampire---4.8 exiting
%------------------------------------------------------------------------------