TSTP Solution File: NUM637^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM637^2 : TPTP v8.2.0. Released v3.7.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 : n004.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 01:43:58 EDT 2024
% Result : Theorem 0.10s 0.37s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : NUM637^2 : TPTP v8.2.0. Released v3.7.0.
% 0.09/0.13 % 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.10/0.33 % Computer : n004.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33 % CPULimit : 300
% 0.10/0.33 % WCLimit : 300
% 0.10/0.33 % DateTime : Mon May 20 04:27:53 EDT 2024
% 0.10/0.33 % CPUTime :
% 0.10/0.33 This is a TH0_THM_EQU_NAR problem
% 0.10/0.33 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.10/0.35 % (11019)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.10/0.35 % (11018)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.10/0.35 % (11018)Instruction limit reached!
% 0.10/0.35 % (11018)------------------------------
% 0.10/0.35 % (11018)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.35 % (11018)Termination reason: Unknown
% 0.10/0.35 % (11018)Termination phase: Saturation
% 0.10/0.35
% 0.10/0.35 % (11018)Memory used [KB]: 5500
% 0.10/0.35 % (11018)Time elapsed: 0.003 s
% 0.10/0.35 % (11018)Instructions burned: 2 (million)
% 0.10/0.35 % (11018)------------------------------
% 0.10/0.35 % (11018)------------------------------
% 0.10/0.35 % (11019)Instruction limit reached!
% 0.10/0.35 % (11019)------------------------------
% 0.10/0.35 % (11019)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.35 % (11019)Termination reason: Unknown
% 0.10/0.35 % (11019)Termination phase: Saturation
% 0.10/0.35
% 0.10/0.35 % (11019)Memory used [KB]: 5500
% 0.10/0.35 % (11019)Time elapsed: 0.003 s
% 0.10/0.35 % (11019)Instructions burned: 2 (million)
% 0.10/0.35 % (11019)------------------------------
% 0.10/0.35 % (11019)------------------------------
% 0.10/0.36 % (11015)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.10/0.36 % (11017)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.10/0.36 % (11017)Refutation not found, incomplete strategy
% 0.10/0.36 % (11017)------------------------------
% 0.10/0.36 % (11017)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.36 % (11017)Termination reason: Refutation not found, incomplete strategy
% 0.10/0.36
% 0.10/0.36
% 0.10/0.36 % (11017)Memory used [KB]: 5500
% 0.10/0.36 % (11017)Time elapsed: 0.003 s
% 0.10/0.36 % (11017)Instructions burned: 2 (million)
% 0.10/0.36 % (11017)------------------------------
% 0.10/0.36 % (11017)------------------------------
% 0.10/0.36 % (11020)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.10/0.36 % (11020)Refutation not found, incomplete strategy
% 0.10/0.36 % (11020)------------------------------
% 0.10/0.36 % (11020)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.36 % (11020)Termination reason: Refutation not found, incomplete strategy
% 0.10/0.36
% 0.10/0.36
% 0.10/0.36 % (11020)Memory used [KB]: 5373
% 0.10/0.36 % (11020)Time elapsed: 0.002 s
% 0.10/0.36 % (11020)Instructions burned: 1 (million)
% 0.10/0.36 % (11020)------------------------------
% 0.10/0.36 % (11020)------------------------------
% 0.10/0.36 % (11016)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.10/0.36 % (11021)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.10/0.36 % (11023)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.10/0.37 % (11022)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.10/0.37 % (11016)Instruction limit reached!
% 0.10/0.37 % (11016)------------------------------
% 0.10/0.37 % (11016)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.37 % (11016)Termination reason: Unknown
% 0.10/0.37 % (11016)Termination phase: Saturation
% 0.10/0.37
% 0.10/0.37 % (11016)Memory used [KB]: 5500
% 0.10/0.37 % (11016)Time elapsed: 0.004 s
% 0.10/0.37 % (11016)Instructions burned: 4 (million)
% 0.10/0.37 % (11016)------------------------------
% 0.10/0.37 % (11016)------------------------------
% 0.10/0.37 % (11022)Instruction limit reached!
% 0.10/0.37 % (11022)------------------------------
% 0.10/0.37 % (11022)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.37 % (11022)Termination reason: Unknown
% 0.10/0.37 % (11022)Termination phase: Saturation
% 0.10/0.37
% 0.10/0.37 % (11022)Memory used [KB]: 5500
% 0.10/0.37 % (11022)Time elapsed: 0.004 s
% 0.10/0.37 % (11022)Instructions burned: 3 (million)
% 0.10/0.37 % (11022)------------------------------
% 0.10/0.37 % (11022)------------------------------
% 0.10/0.37 % (11015)First to succeed.
% 0.10/0.37 % (11015)Refutation found. Thanks to Tanya!
% 0.10/0.37 % SZS status Theorem for theBenchmark
% 0.10/0.37 % SZS output start Proof for theBenchmark
% 0.10/0.37 thf(func_def_1, type, succ: $i > $i).
% 0.10/0.37 thf(func_def_5, type, sK0: ($i > $o) > $i).
% 0.10/0.37 thf(func_def_9, type, ph3: !>[X0: $tType]:(X0)).
% 0.10/0.37 thf(f171,plain,(
% 0.10/0.37 $false),
% 0.10/0.37 inference(trivial_inequality_removal,[],[f168])).
% 0.10/0.37 thf(f168,plain,(
% 0.10/0.37 (sK1 != sK1) | (one != one)),
% 0.10/0.37 inference(superposition,[],[f23,f143])).
% 0.10/0.37 thf(f143,plain,(
% 0.10/0.37 ( ! [X0 : $i] : ((one = X0) | (sK1 != X0)) )),
% 0.10/0.37 inference(superposition,[],[f24,f90])).
% 0.10/0.37 thf(f90,plain,(
% 0.10/0.37 ( ! [X0 : $i] : (((succ @ (sK0 @ (^[Y0 : $i]: (~ (X0 = Y0))))) = X0) | (one = X0)) )),
% 0.10/0.37 inference(equality_proxy_clausification,[],[f89])).
% 0.10/0.37 thf(f89,plain,(
% 0.10/0.37 ( ! [X0 : $i] : (($true = (X0 = one)) | ((succ @ (sK0 @ (^[Y0 : $i]: (~ (X0 = Y0))))) = X0)) )),
% 0.10/0.37 inference(not_proxy_clausification,[],[f88])).
% 0.10/0.37 thf(f88,plain,(
% 0.10/0.37 ( ! [X0 : $i] : (((succ @ (sK0 @ (^[Y0 : $i]: (~ (X0 = Y0))))) = X0) | ($true != (~ (X0 = one)))) )),
% 0.10/0.37 inference(beta_eta_normalization,[],[f65])).
% 0.10/0.37 thf(f65,plain,(
% 0.10/0.37 ( ! [X0 : $i] : (((succ @ (sK0 @ (^[Y0 : $i]: (~ (X0 = Y0))))) = X0) | ($true != ((^[Y0 : $i]: (~ (X0 = Y0))) @ one))) )),
% 0.10/0.37 inference(leibniz_equality_elimination,[],[f20])).
% 0.10/0.37 thf(f20,plain,(
% 0.10/0.37 ( ! [X2 : $i,X0 : $i > $o] : (($true != (X0 @ (succ @ (sK0 @ X0)))) | ($true != (X0 @ one)) | ($true = (X0 @ X2))) )),
% 0.10/0.37 inference(cnf_transformation,[],[f16])).
% 0.10/0.37 thf(f16,plain,(
% 0.10/0.37 ! [X0 : $i > $o] : (($true != (X0 @ one)) | (($true = (X0 @ (sK0 @ X0))) & ($true != (X0 @ (succ @ (sK0 @ X0))))) | ! [X2] : ($true = (X0 @ X2)))),
% 0.10/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f13,f15])).
% 0.10/0.37 thf(f15,plain,(
% 0.10/0.37 ! [X0 : $i > $o] : (? [X1] : (((X0 @ X1) = $true) & ($true != (X0 @ (succ @ X1)))) => (($true = (X0 @ (sK0 @ X0))) & ($true != (X0 @ (succ @ (sK0 @ X0))))))),
% 0.10/0.37 introduced(choice_axiom,[])).
% 0.10/0.37 thf(f13,plain,(
% 0.10/0.37 ! [X0 : $i > $o] : (($true != (X0 @ one)) | ? [X1] : (((X0 @ X1) = $true) & ($true != (X0 @ (succ @ X1)))) | ! [X2] : ($true = (X0 @ X2)))),
% 0.10/0.37 inference(flattening,[],[f12])).
% 0.10/0.37 thf(f12,plain,(
% 0.10/0.37 ! [X0 : $i > $o] : (! [X2] : ($true = (X0 @ X2)) | (? [X1] : (((X0 @ X1) = $true) & ($true != (X0 @ (succ @ X1)))) | ($true != (X0 @ one))))),
% 0.10/0.37 inference(ennf_transformation,[],[f8])).
% 0.10/0.37 thf(f8,plain,(
% 0.10/0.37 ! [X0 : $i > $o] : ((! [X1] : (((X0 @ X1) = $true) => ($true = (X0 @ (succ @ X1)))) & ($true = (X0 @ one))) => ! [X2] : ($true = (X0 @ X2)))),
% 0.10/0.37 inference(fool_elimination,[],[f7])).
% 0.10/0.37 thf(f7,plain,(
% 0.10/0.37 ! [X0 : $i > $o] : ((! [X1] : ((X0 @ X1) => (X0 @ (succ @ X1))) & (X0 @ one)) => ! [X2] : (X0 @ X2))),
% 0.10/0.37 inference(rectify,[],[f3])).
% 0.10/0.37 thf(f3,axiom,(
% 0.10/0.37 ! [X2 : $i > $o] : ((! [X0] : ((X2 @ X0) => (X2 @ (succ @ X0))) & (X2 @ one)) => ! [X1] : (X2 @ X1))),
% 0.10/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',induction)).
% 0.10/0.37 thf(f24,plain,(
% 0.10/0.37 ( ! [X1 : $i] : (((succ @ X1) != sK1)) )),
% 0.10/0.37 inference(cnf_transformation,[],[f18])).
% 0.10/0.37 thf(f18,plain,(
% 0.10/0.37 ! [X1] : ((succ @ X1) != sK1) & (one != sK1)),
% 0.10/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f14,f17])).
% 0.10/0.37 thf(f17,plain,(
% 0.10/0.37 ? [X0] : (! [X1] : ((succ @ X1) != X0) & (one != X0)) => (! [X1] : ((succ @ X1) != sK1) & (one != sK1))),
% 0.10/0.37 introduced(choice_axiom,[])).
% 0.10/0.37 thf(f14,plain,(
% 0.10/0.37 ? [X0] : (! [X1] : ((succ @ X1) != X0) & (one != X0))),
% 0.10/0.37 inference(ennf_transformation,[],[f10])).
% 0.10/0.37 thf(f10,plain,(
% 0.10/0.37 ~! [X0] : ((one != X0) => ? [X1] : ((succ @ X1) = X0))),
% 0.10/0.37 inference(rectify,[],[f5])).
% 0.10/0.37 thf(f5,negated_conjecture,(
% 0.10/0.37 ~! [X0] : ((one != X0) => ? [X3] : ((succ @ X3) = X0))),
% 0.10/0.37 inference(negated_conjecture,[],[f4])).
% 0.10/0.37 thf(f4,conjecture,(
% 0.10/0.37 ! [X0] : ((one != X0) => ? [X3] : ((succ @ X3) = X0))),
% 0.10/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz3)).
% 0.10/0.37 thf(f23,plain,(
% 0.10/0.37 (one != sK1)),
% 0.10/0.37 inference(cnf_transformation,[],[f18])).
% 0.10/0.37 % SZS output end Proof for theBenchmark
% 0.10/0.37 % (11015)------------------------------
% 0.10/0.37 % (11015)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.37 % (11015)Termination reason: Refutation
% 0.10/0.37
% 0.10/0.37 % (11015)Memory used [KB]: 5500
% 0.10/0.37 % (11015)Time elapsed: 0.009 s
% 0.10/0.37 % (11015)Instructions burned: 10 (million)
% 0.10/0.37 % (11015)------------------------------
% 0.10/0.37 % (11015)------------------------------
% 0.10/0.37 % (11014)Success in time 0.03 s
% 0.10/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------