TSTP Solution File: SYO315^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO315^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 : n002.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:56 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYO315^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.15 % 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.37 % Computer : n002.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon May 20 09:10:38 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.14/0.37 This is a TH0_THM_NEQ_NAR problem
% 0.14/0.37 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.39 % (16308)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.39 % (16309)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.39 % (16310)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.39 % (16305)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.39 % (16307)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.39 % (16306)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.39 % (16311)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.39 % (16304)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.39 % (16307)Instruction limit reached!
% 0.14/0.39 % (16307)------------------------------
% 0.14/0.39 % (16307)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (16307)Termination reason: Unknown
% 0.14/0.39 % (16307)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (16308)Instruction limit reached!
% 0.14/0.39 % (16308)------------------------------
% 0.14/0.39 % (16308)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (16308)Termination reason: Unknown
% 0.14/0.39 % (16308)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (16308)Memory used [KB]: 5373
% 0.14/0.39 % (16308)Time elapsed: 0.003 s
% 0.14/0.39 % (16308)Instructions burned: 2 (million)
% 0.14/0.39 % (16308)------------------------------
% 0.14/0.39 % (16308)------------------------------
% 0.14/0.39 % (16307)Memory used [KB]: 5373
% 0.14/0.39 % (16307)Time elapsed: 0.003 s
% 0.14/0.39 % (16307)Instructions burned: 2 (million)
% 0.14/0.39 % (16307)------------------------------
% 0.14/0.39 % (16307)------------------------------
% 0.14/0.39 % (16311)Instruction limit reached!
% 0.14/0.39 % (16311)------------------------------
% 0.14/0.39 % (16311)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (16311)Termination reason: Unknown
% 0.14/0.39 % (16311)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (16311)Memory used [KB]: 5500
% 0.14/0.39 % (16311)Time elapsed: 0.004 s
% 0.14/0.39 % (16311)Instructions burned: 3 (million)
% 0.14/0.39 % (16311)------------------------------
% 0.14/0.39 % (16311)------------------------------
% 0.14/0.39 % (16305)Instruction limit reached!
% 0.14/0.39 % (16305)------------------------------
% 0.14/0.39 % (16305)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (16305)Termination reason: Unknown
% 0.14/0.39 % (16305)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (16305)Memory used [KB]: 5500
% 0.14/0.39 % (16305)Time elapsed: 0.005 s
% 0.14/0.39 % (16305)Instructions burned: 4 (million)
% 0.14/0.39 % (16305)------------------------------
% 0.14/0.39 % (16305)------------------------------
% 0.14/0.39 % (16306)First to succeed.
% 0.14/0.39 % (16309)Also succeeded, but the first one will report.
% 0.14/0.40 % (16304)Also succeeded, but the first one will report.
% 0.14/0.40 % (16306)Refutation found. Thanks to Tanya!
% 0.14/0.40 % SZS status Theorem for theBenchmark
% 0.14/0.40 % SZS output start Proof for theBenchmark
% 0.14/0.40 thf(func_def_2, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.14/0.40 thf(func_def_5, type, sK0: $i > $o).
% 0.14/0.40 thf(func_def_6, type, sK1: $i > $o).
% 0.14/0.40 thf(func_def_10, type, ph5: !>[X0: $tType]:(X0)).
% 0.14/0.40 thf(f61,plain,(
% 0.14/0.40 $false),
% 0.14/0.40 inference(avatar_sat_refutation,[],[f35,f54,f59])).
% 0.14/0.40 thf(f59,plain,(
% 0.14/0.40 ~spl4_4),
% 0.14/0.40 inference(avatar_contradiction_clause,[],[f58])).
% 0.14/0.40 thf(f58,plain,(
% 0.14/0.40 $false | ~spl4_4),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f55])).
% 0.14/0.40 thf(f55,plain,(
% 0.14/0.40 ($true != $true) | ~spl4_4),
% 0.14/0.40 inference(superposition,[],[f14,f34])).
% 0.14/0.40 thf(f34,plain,(
% 0.14/0.40 ((sK0 @ z) = $true) | ~spl4_4),
% 0.14/0.40 inference(avatar_component_clause,[],[f32])).
% 0.14/0.40 thf(f32,plain,(
% 0.14/0.40 spl4_4 <=> ((sK0 @ z) = $true)),
% 0.14/0.40 introduced(avatar_definition,[new_symbols(naming,[spl4_4])])).
% 0.14/0.40 thf(f14,plain,(
% 0.14/0.40 ((sK0 @ z) != $true)),
% 0.14/0.40 inference(cnf_transformation,[],[f10])).
% 0.14/0.40 thf(f10,plain,(
% 0.14/0.40 (((sK1 @ sK2) != $true) & ((sK0 @ z) != $true) & ((sK1 @ sK3) = $true) & ($true = (sK0 @ sK2))) & ! [X4 : $i > $o,X5,X6 : $i > $o,X7] : (((X6 @ X7) != $true) | ($true = (X6 @ X5)) | ((X4 @ z) = $true) | ($true != (X4 @ X5)))),
% 0.14/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f9])).
% 0.14/0.40 thf(f9,plain,(
% 0.14/0.40 ? [X0 : $i > $o,X1 : $i > $o,X2,X3] : (((X1 @ X2) != $true) & ((X0 @ z) != $true) & ((X1 @ X3) = $true) & ((X0 @ X2) = $true)) => (((sK1 @ sK2) != $true) & ((sK0 @ z) != $true) & ((sK1 @ sK3) = $true) & ($true = (sK0 @ sK2)))),
% 0.14/0.40 introduced(choice_axiom,[])).
% 0.14/0.40 thf(f8,plain,(
% 0.14/0.40 ? [X0 : $i > $o,X1 : $i > $o,X2,X3] : (((X1 @ X2) != $true) & ((X0 @ z) != $true) & ((X1 @ X3) = $true) & ((X0 @ X2) = $true)) & ! [X4 : $i > $o,X5,X6 : $i > $o,X7] : (((X6 @ X7) != $true) | ($true = (X6 @ X5)) | ((X4 @ z) = $true) | ($true != (X4 @ X5)))),
% 0.14/0.40 inference(rectify,[],[f7])).
% 0.14/0.40 thf(f7,plain,(
% 0.14/0.40 ? [X3 : $i > $o,X1 : $i > $o,X0,X2] : (($true != (X1 @ X0)) & ((X3 @ z) != $true) & ((X1 @ X2) = $true) & ((X3 @ X0) = $true)) & ! [X6 : $i > $o,X4,X5 : $i > $o,X7] : (((X5 @ X7) != $true) | ($true = (X5 @ X4)) | ((X6 @ z) = $true) | ($true != (X6 @ X4)))),
% 0.14/0.40 inference(ennf_transformation,[],[f6])).
% 0.14/0.40 thf(f6,plain,(
% 0.14/0.40 ~(? [X3 : $i > $o,X1 : $i > $o,X0,X2] : (($true != (X1 @ X0)) & ((X3 @ z) != $true) & ((X1 @ X2) = $true) & ((X3 @ X0) = $true)) => ? [X7,X5 : $i > $o,X6 : $i > $o,X4] : (($true = (X6 @ X4)) & ($true != (X5 @ X4)) & ((X5 @ X7) = $true) & ((X6 @ z) != $true)))),
% 0.14/0.40 inference(flattening,[],[f5])).
% 0.14/0.40 thf(f5,plain,(
% 0.14/0.40 ~(? [X0,X1 : $i > $o,X2,X3 : $i > $o] : (~($true = (X1 @ X0)) & ~((X3 @ z) = $true) & ((X1 @ X2) = $true) & ((X3 @ X0) = $true)) => ? [X4,X5 : $i > $o,X6 : $i > $o,X7] : (($true = (X6 @ X4)) & ((X5 @ X7) = $true) & ~((X6 @ z) = $true) & ~($true = (X5 @ X4))))),
% 0.14/0.40 inference(fool_elimination,[],[f4])).
% 0.14/0.40 thf(f4,plain,(
% 0.14/0.40 ~(? [X0,X1 : $i > $o,X2,X3 : $i > $o] : (~(X1 @ X0) & ~(X3 @ z) & (X1 @ X2) & (X3 @ X0)) => ? [X4,X5 : $i > $o,X6 : $i > $o,X7] : ((X6 @ X4) & (X5 @ X7) & ~(X6 @ z) & ~(X5 @ X4)))),
% 0.14/0.40 inference(rectify,[],[f2])).
% 0.14/0.40 thf(f2,negated_conjecture,(
% 0.14/0.40 ~(? [X3,X0 : $i > $o,X2,X1 : $i > $o] : (~(X0 @ X3) & ~(X1 @ z) & (X0 @ X2) & (X1 @ X3)) => ? [X3,X0 : $i > $o,X1 : $i > $o,X2] : ((X1 @ X3) & (X0 @ X2) & ~(X1 @ z) & ~(X0 @ X3)))),
% 0.14/0.40 inference(negated_conjecture,[],[f1])).
% 0.14/0.40 thf(f1,conjecture,(
% 0.14/0.40 ? [X3,X0 : $i > $o,X2,X1 : $i > $o] : (~(X0 @ X3) & ~(X1 @ z) & (X0 @ X2) & (X1 @ X3)) => ? [X3,X0 : $i > $o,X1 : $i > $o,X2] : ((X1 @ X3) & (X0 @ X2) & ~(X1 @ z) & ~(X0 @ X3))),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cSILLYWFF)).
% 0.14/0.40 thf(f54,plain,(
% 0.14/0.40 ~spl4_3),
% 0.14/0.40 inference(avatar_contradiction_clause,[],[f53])).
% 0.14/0.40 thf(f53,plain,(
% 0.14/0.40 $false | ~spl4_3),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f47])).
% 0.14/0.40 thf(f47,plain,(
% 0.14/0.40 ($true != $true) | ~spl4_3),
% 0.14/0.40 inference(superposition,[],[f15,f45])).
% 0.14/0.40 thf(f45,plain,(
% 0.14/0.40 ((sK1 @ sK2) = $true) | ~spl4_3),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f44])).
% 0.14/0.40 thf(f44,plain,(
% 0.14/0.40 ((sK1 @ sK2) = $true) | ($true != $true) | ~spl4_3),
% 0.14/0.40 inference(superposition,[],[f30,f13])).
% 0.14/0.40 thf(f13,plain,(
% 0.14/0.40 ((sK1 @ sK3) = $true)),
% 0.14/0.40 inference(cnf_transformation,[],[f10])).
% 0.14/0.40 thf(f30,plain,(
% 0.14/0.40 ( ! [X0 : $i > $o,X1 : $i] : (($true != (X0 @ X1)) | ((X0 @ sK2) = $true)) ) | ~spl4_3),
% 0.14/0.40 inference(avatar_component_clause,[],[f29])).
% 0.14/0.40 thf(f29,plain,(
% 0.14/0.40 spl4_3 <=> ! [X0 : $i > $o,X1] : (($true != (X0 @ X1)) | ((X0 @ sK2) = $true))),
% 0.14/0.40 introduced(avatar_definition,[new_symbols(naming,[spl4_3])])).
% 0.14/0.40 thf(f15,plain,(
% 0.14/0.40 ((sK1 @ sK2) != $true)),
% 0.14/0.40 inference(cnf_transformation,[],[f10])).
% 0.14/0.40 thf(f35,plain,(
% 0.14/0.40 spl4_3 | spl4_4),
% 0.14/0.40 inference(avatar_split_clause,[],[f18,f32,f29])).
% 0.14/0.40 thf(f18,plain,(
% 0.14/0.40 ( ! [X0 : $i > $o,X1 : $i] : (((sK0 @ z) = $true) | ($true != (X0 @ X1)) | ((X0 @ sK2) = $true)) )),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f16])).
% 0.14/0.40 thf(f16,plain,(
% 0.14/0.40 ( ! [X0 : $i > $o,X1 : $i] : (((X0 @ sK2) = $true) | ($true != $true) | ((sK0 @ z) = $true) | ($true != (X0 @ X1))) )),
% 0.14/0.40 inference(superposition,[],[f11,f12])).
% 0.14/0.40 thf(f12,plain,(
% 0.14/0.40 ($true = (sK0 @ sK2))),
% 0.14/0.40 inference(cnf_transformation,[],[f10])).
% 0.14/0.40 thf(f11,plain,(
% 0.14/0.40 ( ! [X6 : $i > $o,X7 : $i,X4 : $i > $o,X5 : $i] : (($true != (X4 @ X5)) | ($true = (X6 @ X5)) | ((X6 @ X7) != $true) | ((X4 @ z) = $true)) )),
% 0.14/0.40 inference(cnf_transformation,[],[f10])).
% 0.14/0.40 % SZS output end Proof for theBenchmark
% 0.14/0.40 % (16306)------------------------------
% 0.14/0.40 % (16306)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (16306)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (16306)Memory used [KB]: 5500
% 0.14/0.40 % (16306)Time elapsed: 0.006 s
% 0.14/0.40 % (16306)Instructions burned: 4 (million)
% 0.14/0.40 % (16306)------------------------------
% 0.14/0.40 % (16306)------------------------------
% 0.14/0.40 % (16303)Success in time 0.018 s
% 0.14/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------