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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN381^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 : n020.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 08:22:08 EDT 2024

% Result   : Theorem 0.19s 0.36s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12  % Problem    : SYN381^5 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.13  % 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.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon May 20 15:25:38 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.13/0.34  This is a TH0_THM_NEQ_NAR problem
% 0.13/0.34  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.19/0.36  % (21695)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.19/0.36  % (21690)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.19/0.36  % (21696)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.19/0.36  % (21691)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.19/0.36  % (21692)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.19/0.36  % (21693)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.19/0.36  % (21694)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.19/0.36  % (21697)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.19/0.36  % (21693)Instruction limit reached!
% 0.19/0.36  % (21693)------------------------------
% 0.19/0.36  % (21693)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36  % (21693)Termination reason: Unknown
% 0.19/0.36  % (21693)Termination phase: Saturation
% 0.19/0.36  % (21694)Instruction limit reached!
% 0.19/0.36  % (21694)------------------------------
% 0.19/0.36  % (21694)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36  % (21694)Termination reason: Unknown
% 0.19/0.36  % (21694)Termination phase: Saturation
% 0.19/0.36  
% 0.19/0.36  % (21694)Memory used [KB]: 5500
% 0.19/0.36  % (21694)Time elapsed: 0.003 s
% 0.19/0.36  % (21694)Instructions burned: 2 (million)
% 0.19/0.36  % (21694)------------------------------
% 0.19/0.36  % (21694)------------------------------
% 0.19/0.36  
% 0.19/0.36  % (21693)Memory used [KB]: 5500
% 0.19/0.36  % (21693)Time elapsed: 0.003 s
% 0.19/0.36  % (21693)Instructions burned: 2 (million)
% 0.19/0.36  % (21693)------------------------------
% 0.19/0.36  % (21693)------------------------------
% 0.19/0.36  % (21695)First to succeed.
% 0.19/0.36  % (21697)Instruction limit reached!
% 0.19/0.36  % (21697)------------------------------
% 0.19/0.36  % (21697)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36  % (21697)Termination reason: Unknown
% 0.19/0.36  % (21697)Termination phase: Saturation
% 0.19/0.36  
% 0.19/0.36  % (21697)Memory used [KB]: 5500
% 0.19/0.36  % (21697)Time elapsed: 0.004 s
% 0.19/0.36  % (21697)Instructions burned: 3 (million)
% 0.19/0.36  % (21697)------------------------------
% 0.19/0.36  % (21697)------------------------------
% 0.19/0.36  % (21691)Instruction limit reached!
% 0.19/0.36  % (21691)------------------------------
% 0.19/0.36  % (21691)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.36  % (21691)Termination reason: Unknown
% 0.19/0.36  % (21691)Termination phase: Saturation
% 0.19/0.36  
% 0.19/0.36  % (21691)Memory used [KB]: 5500
% 0.19/0.36  % (21691)Time elapsed: 0.005 s
% 0.19/0.36  % (21691)Instructions burned: 5 (million)
% 0.19/0.36  % (21691)------------------------------
% 0.19/0.36  % (21691)------------------------------
% 0.19/0.36  % (21696)Also succeeded, but the first one will report.
% 0.19/0.36  % (21690)Also succeeded, but the first one will report.
% 0.19/0.36  % (21695)Refutation found. Thanks to Tanya!
% 0.19/0.36  % SZS status Theorem for theBenchmark
% 0.19/0.36  % SZS output start Proof for theBenchmark
% 0.19/0.36  thf(func_def_0, type, cP: $i > $o).
% 0.19/0.36  thf(func_def_1, type, cQ: $i > $i > $o).
% 0.19/0.36  thf(func_def_5, type, sK0: $i > $i).
% 0.19/0.36  thf(f27,plain,(
% 0.19/0.36    $false),
% 0.19/0.36    inference(trivial_inequality_removal,[],[f26])).
% 0.19/0.36  thf(f26,plain,(
% 0.19/0.36    ($true != $true)),
% 0.19/0.36    inference(superposition,[],[f13,f24])).
% 0.19/0.36  thf(f24,plain,(
% 0.19/0.36    ( ! [X0 : $i] : (((cP @ X0) = $true)) )),
% 0.19/0.36    inference(trivial_inequality_removal,[],[f22])).
% 0.19/0.36  thf(f22,plain,(
% 0.19/0.36    ( ! [X0 : $i] : (($true != $true) | ((cP @ X0) = $true)) )),
% 0.19/0.36    inference(superposition,[],[f21,f15])).
% 0.19/0.36  thf(f15,plain,(
% 0.19/0.36    ( ! [X0 : $i] : (((cQ @ (sK0 @ X0) @ X0) = $true)) )),
% 0.19/0.36    inference(cnf_transformation,[],[f11])).
% 0.19/0.36  thf(f11,plain,(
% 0.19/0.36    ! [X0] : ((cQ @ (sK0 @ X0) @ X0) = $true) & ! [X2,X3] : (($true != (cQ @ X2 @ X3)) | ((cQ @ X3 @ X2) = $true) | ($true = (cQ @ X3 @ X3))) & ($true != (cP @ sK1)) & ! [X5] : (((cP @ X5) = $true) | ! [X6] : ((cQ @ X5 @ X6) != $true))),
% 0.19/0.36    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f10,f9])).
% 0.19/0.37  thf(f9,plain,(
% 0.19/0.37    ! [X0] : (? [X1] : ($true = (cQ @ X1 @ X0)) => ((cQ @ (sK0 @ X0) @ X0) = $true))),
% 0.19/0.37    introduced(choice_axiom,[])).
% 0.19/0.37  thf(f10,plain,(
% 0.19/0.37    ? [X4] : ($true != (cP @ X4)) => ($true != (cP @ sK1))),
% 0.19/0.37    introduced(choice_axiom,[])).
% 0.19/0.37  thf(f8,plain,(
% 0.19/0.37    ! [X0] : ? [X1] : ($true = (cQ @ X1 @ X0)) & ! [X2,X3] : (($true != (cQ @ X2 @ X3)) | ((cQ @ X3 @ X2) = $true) | ($true = (cQ @ X3 @ X3))) & ? [X4] : ($true != (cP @ X4)) & ! [X5] : (((cP @ X5) = $true) | ! [X6] : ((cQ @ X5 @ X6) != $true))),
% 0.19/0.37    inference(rectify,[],[f7])).
% 0.19/0.37  thf(f7,plain,(
% 0.19/0.37    ! [X4] : ? [X5] : ((cQ @ X5 @ X4) = $true) & ! [X3,X2] : (((cQ @ X3 @ X2) != $true) | ($true = (cQ @ X2 @ X3)) | ($true = (cQ @ X2 @ X2))) & ? [X6] : ((cP @ X6) != $true) & ! [X0] : (((cP @ X0) = $true) | ! [X1] : ((cQ @ X0 @ X1) != $true))),
% 0.19/0.37    inference(flattening,[],[f6])).
% 0.19/0.37  thf(f6,plain,(
% 0.19/0.37    ? [X6] : ((cP @ X6) != $true) & (! [X2,X3] : ((($true = (cQ @ X2 @ X2)) | ($true = (cQ @ X2 @ X3))) | ((cQ @ X3 @ X2) != $true)) & ! [X4] : ? [X5] : ((cQ @ X5 @ X4) = $true) & ! [X0] : (((cP @ X0) = $true) | ! [X1] : ((cQ @ X0 @ X1) != $true)))),
% 0.19/0.37    inference(ennf_transformation,[],[f5])).
% 0.19/0.37  thf(f5,plain,(
% 0.19/0.37    ~((! [X2,X3] : (((cQ @ X3 @ X2) = $true) => (($true = (cQ @ X2 @ X2)) | ($true = (cQ @ X2 @ X3)))) & ! [X4] : ? [X5] : ((cQ @ X5 @ X4) = $true) & ! [X0] : (? [X1] : ((cQ @ X0 @ X1) = $true) => ((cP @ X0) = $true))) => ! [X6] : ((cP @ X6) = $true))),
% 0.19/0.37    inference(fool_elimination,[],[f4])).
% 0.19/0.37  thf(f4,plain,(
% 0.19/0.37    ~((! [X0] : (? [X1] : (cQ @ X0 @ X1) => (cP @ X0)) & ! [X2,X3] : ((cQ @ X3 @ X2) => ((cQ @ X2 @ X2) | (cQ @ X2 @ X3))) & ! [X4] : ? [X5] : (cQ @ X5 @ X4)) => ! [X6] : (cP @ X6))),
% 0.19/0.37    inference(rectify,[],[f2])).
% 0.19/0.37  thf(f2,negated_conjecture,(
% 0.19/0.37    ~((! [X0] : (? [X1] : (cQ @ X0 @ X1) => (cP @ X0)) & ! [X5,X4] : ((cQ @ X4 @ X5) => ((cQ @ X5 @ X5) | (cQ @ X5 @ X4))) & ! [X2] : ? [X3] : (cQ @ X3 @ X2)) => ! [X5] : (cP @ X5))),
% 0.19/0.37    inference(negated_conjecture,[],[f1])).
% 0.19/0.37  thf(f1,conjecture,(
% 0.19/0.37    (! [X0] : (? [X1] : (cQ @ X0 @ X1) => (cP @ X0)) & ! [X5,X4] : ((cQ @ X4 @ X5) => ((cQ @ X5 @ X5) | (cQ @ X5 @ X4))) & ! [X2] : ? [X3] : (cQ @ X3 @ X2)) => ! [X5] : (cP @ X5)),
% 0.19/0.37    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX2133)).
% 0.19/0.37  thf(f21,plain,(
% 0.19/0.37    ( ! [X0 : $i,X1 : $i] : (($true != (cQ @ X1 @ X0)) | ((cP @ X0) = $true)) )),
% 0.19/0.37    inference(subsumption_resolution,[],[f20,f12])).
% 0.19/0.37  thf(f12,plain,(
% 0.19/0.37    ( ! [X6 : $i,X5 : $i] : (((cQ @ X5 @ X6) != $true) | ((cP @ X5) = $true)) )),
% 0.19/0.37    inference(cnf_transformation,[],[f11])).
% 0.19/0.37  thf(f20,plain,(
% 0.19/0.37    ( ! [X0 : $i,X1 : $i] : (((cP @ X0) = $true) | ((cQ @ X0 @ X1) = $true) | ($true != (cQ @ X1 @ X0))) )),
% 0.19/0.37    inference(trivial_inequality_removal,[],[f18])).
% 0.19/0.37  thf(f18,plain,(
% 0.19/0.37    ( ! [X0 : $i,X1 : $i] : (($true != $true) | ((cQ @ X0 @ X1) = $true) | ($true != (cQ @ X1 @ X0)) | ((cP @ X0) = $true)) )),
% 0.19/0.37    inference(superposition,[],[f12,f14])).
% 0.19/0.37  thf(f14,plain,(
% 0.19/0.37    ( ! [X2 : $i,X3 : $i] : (($true = (cQ @ X3 @ X3)) | ($true != (cQ @ X2 @ X3)) | ((cQ @ X3 @ X2) = $true)) )),
% 0.19/0.37    inference(cnf_transformation,[],[f11])).
% 0.19/0.37  thf(f13,plain,(
% 0.19/0.37    ($true != (cP @ sK1))),
% 0.19/0.37    inference(cnf_transformation,[],[f11])).
% 0.19/0.37  % SZS output end Proof for theBenchmark
% 0.19/0.37  % (21695)------------------------------
% 0.19/0.37  % (21695)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37  % (21695)Termination reason: Refutation
% 0.19/0.37  
% 0.19/0.37  % (21695)Memory used [KB]: 5500
% 0.19/0.37  % (21695)Time elapsed: 0.005 s
% 0.19/0.37  % (21695)Instructions burned: 2 (million)
% 0.19/0.37  % (21695)------------------------------
% 0.19/0.37  % (21695)------------------------------
% 0.19/0.37  % (21689)Success in time 0.017 s
% 0.19/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------