TSTP Solution File: NUM812^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM812^5 : TPTP v8.2.0. Bugfixed v5.2.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 : n017.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:46:15 EDT 2024
% Result : Theorem 0.24s 0.41s
% Output : Refutation 0.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : NUM812^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.08/0.16 % 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.16/0.38 % Computer : n017.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon May 20 07:34:38 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.16/0.38 This is a TH0_THM_EQU_NAR problem
% 0.16/0.38 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.16/0.40 % (23315)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.16/0.40 % (23317)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.16/0.40 % (23319)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.16/0.40 % (23320)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.16/0.40 % (23316)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.16/0.40 % (23321)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.16/0.40 % (23322)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.16/0.40 % (23318)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.40 % (23319)Instruction limit reached!
% 0.16/0.40 % (23319)------------------------------
% 0.16/0.40 % (23319)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (23319)Termination reason: Unknown
% 0.16/0.40 % (23319)Termination phase: Saturation
% 0.16/0.40
% 0.16/0.40 % (23319)Memory used [KB]: 895
% 0.16/0.40 % (23319)Time elapsed: 0.003 s
% 0.16/0.40 % (23319)Instructions burned: 2 (million)
% 0.16/0.40 % (23319)------------------------------
% 0.16/0.40 % (23319)------------------------------
% 0.16/0.40 % (23320)Refutation not found, incomplete strategy
% 0.16/0.40 % (23320)------------------------------
% 0.16/0.40 % (23320)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (23320)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.40
% 0.16/0.40
% 0.16/0.40 % (23320)Memory used [KB]: 5373
% 0.16/0.40 % (23320)Time elapsed: 0.003 s
% 0.16/0.40 % (23320)Instructions burned: 1 (million)
% 0.16/0.40 % (23320)------------------------------
% 0.16/0.40 % (23320)------------------------------
% 0.16/0.40 % (23322)Refutation not found, incomplete strategy
% 0.16/0.40 % (23322)------------------------------
% 0.16/0.40 % (23322)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (23322)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.40
% 0.16/0.40
% 0.16/0.40 % (23322)Memory used [KB]: 5500
% 0.16/0.40 % (23322)Time elapsed: 0.002 s
% 0.16/0.40 % (23322)Instructions burned: 2 (million)
% 0.16/0.40 % (23322)------------------------------
% 0.16/0.40 % (23322)------------------------------
% 0.16/0.40 % (23318)Instruction limit reached!
% 0.16/0.40 % (23318)------------------------------
% 0.16/0.40 % (23318)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (23317)Refutation not found, incomplete strategy
% 0.16/0.40 % (23317)------------------------------
% 0.16/0.40 % (23317)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (23317)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.40
% 0.16/0.40
% 0.16/0.40 % (23317)Memory used [KB]: 5500
% 0.16/0.40 % (23317)Time elapsed: 0.003 s
% 0.16/0.40 % (23317)Instructions burned: 3 (million)
% 0.16/0.40 % (23317)------------------------------
% 0.16/0.40 % (23317)------------------------------
% 0.16/0.40 % (23318)Termination reason: Unknown
% 0.16/0.40 % (23318)Termination phase: Saturation
% 0.16/0.40
% 0.16/0.40 % (23318)Memory used [KB]: 5500
% 0.16/0.40 % (23318)Time elapsed: 0.004 s
% 0.16/0.40 % (23318)Instructions burned: 2 (million)
% 0.16/0.40 % (23318)------------------------------
% 0.16/0.40 % (23318)------------------------------
% 0.16/0.40 % (23316)Instruction limit reached!
% 0.16/0.40 % (23316)------------------------------
% 0.16/0.40 % (23316)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (23316)Termination reason: Unknown
% 0.16/0.40 % (23316)Termination phase: Saturation
% 0.16/0.40
% 0.16/0.40 % (23316)Memory used [KB]: 5500
% 0.16/0.40 % (23316)Time elapsed: 0.004 s
% 0.16/0.40 % (23316)Instructions burned: 4 (million)
% 0.16/0.40 % (23316)------------------------------
% 0.16/0.40 % (23316)------------------------------
% 0.24/0.41 % (23315)First to succeed.
% 0.24/0.41 % (23315)Refutation found. Thanks to Tanya!
% 0.24/0.41 % SZS status Theorem for theBenchmark
% 0.24/0.41 % SZS output start Proof for theBenchmark
% 0.24/0.41 thf(func_def_1, type, cS: $i > $i).
% 0.24/0.41 thf(func_def_14, type, sK2: ($i > $o) > $i).
% 0.24/0.41 thf(func_def_16, type, ph3: !>[X0: $tType]:(X0)).
% 0.24/0.41 thf(f186,plain,(
% 0.24/0.41 $false),
% 0.24/0.41 inference(trivial_inequality_removal,[],[f181])).
% 0.24/0.41 thf(f181,plain,(
% 0.24/0.41 (c0 != c0) | (sK0 != sK0)),
% 0.24/0.41 inference(superposition,[],[f15,f166])).
% 0.24/0.41 thf(f166,plain,(
% 0.24/0.41 ( ! [X0 : $i] : ((c0 = X0) | (sK0 != X0)) )),
% 0.24/0.41 inference(superposition,[],[f14,f92])).
% 0.24/0.41 thf(f92,plain,(
% 0.24/0.41 ( ! [X0 : $i] : (((cS @ (sK2 @ (^[Y0 : $i]: (~ (X0 = Y0))))) = X0) | (c0 = X0)) )),
% 0.24/0.41 inference(equality_proxy_clausification,[],[f91])).
% 0.24/0.41 thf(f91,plain,(
% 0.24/0.41 ( ! [X0 : $i] : (((cS @ (sK2 @ (^[Y0 : $i]: (~ (X0 = Y0))))) = X0) | ((X0 = c0) = $true)) )),
% 0.24/0.41 inference(not_proxy_clausification,[],[f90])).
% 0.24/0.41 thf(f90,plain,(
% 0.24/0.41 ( ! [X0 : $i] : (((cS @ (sK2 @ (^[Y0 : $i]: (~ (X0 = Y0))))) = X0) | ((~ (X0 = c0)) = $false)) )),
% 0.24/0.41 inference(beta_eta_normalization,[],[f62])).
% 0.24/0.41 thf(f62,plain,(
% 0.24/0.41 ( ! [X0 : $i] : (((cS @ (sK2 @ (^[Y0 : $i]: (~ (X0 = Y0))))) = X0) | (((^[Y0 : $i]: (~ (X0 = Y0))) @ c0) = $false)) )),
% 0.24/0.41 inference(leibniz_equality_elimination,[],[f25])).
% 0.24/0.41 thf(f25,plain,(
% 0.24/0.41 ( ! [X2 : $i,X1 : $i > $o] : (((X1 @ (cS @ (sK2 @ X1))) = $false) | ((X1 @ X2) = $true) | ((X1 @ c0) = $false)) )),
% 0.24/0.41 inference(binary_proxy_clausification,[],[f24])).
% 0.24/0.41 thf(f24,plain,(
% 0.24/0.41 ( ! [X2 : $i,X1 : $i > $o] : (((X1 @ c0) = $false) | ((X1 @ X2) = $true) | ($false = ((X1 @ (sK2 @ X1)) => (X1 @ (cS @ (sK2 @ X1)))))) )),
% 0.24/0.41 inference(beta_eta_normalization,[],[f23])).
% 0.24/0.41 thf(f23,plain,(
% 0.24/0.41 ( ! [X2 : $i,X1 : $i > $o] : (($false = ((^[Y0 : $i]: ((X1 @ Y0) => (X1 @ (cS @ Y0)))) @ (sK2 @ X1))) | ((X1 @ X2) = $true) | ((X1 @ c0) = $false)) )),
% 0.24/0.41 inference(sigma_clausification,[],[f22])).
% 0.24/0.41 thf(f22,plain,(
% 0.24/0.41 ( ! [X2 : $i,X1 : $i > $o] : (((X1 @ X2) = $true) | ((X1 @ c0) = $false) | ($false = (!! @ $i @ (^[Y0 : $i]: ((X1 @ Y0) => (X1 @ (cS @ Y0))))))) )),
% 0.24/0.41 inference(binary_proxy_clausification,[],[f21])).
% 0.24/0.41 thf(f21,plain,(
% 0.24/0.41 ( ! [X2 : $i,X1 : $i > $o] : (($false = ((!! @ $i @ (^[Y0 : $i]: ((X1 @ Y0) => (X1 @ (cS @ Y0))))) & (X1 @ c0))) | ((X1 @ X2) = $true)) )),
% 0.24/0.41 inference(pi_clausification,[],[f20])).
% 0.24/0.41 thf(f20,plain,(
% 0.24/0.41 ( ! [X1 : $i > $o] : (($true = (!! @ $i @ X1)) | ($false = ((!! @ $i @ (^[Y0 : $i]: ((X1 @ Y0) => (X1 @ (cS @ Y0))))) & (X1 @ c0)))) )),
% 0.24/0.41 inference(binary_proxy_clausification,[],[f19])).
% 0.24/0.41 thf(f19,plain,(
% 0.24/0.41 ( ! [X1 : $i > $o] : (((((!! @ $i @ (^[Y0 : $i]: ((X1 @ Y0) => (X1 @ (cS @ Y0))))) & (X1 @ c0)) => (!! @ $i @ X1)) = $true)) )),
% 0.24/0.41 inference(beta_eta_normalization,[],[f18])).
% 0.24/0.41 thf(f18,plain,(
% 0.24/0.41 ( ! [X1 : $i > $o] : ((((^[Y0 : $i > $o]: (((!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (cS @ Y1))))) & (Y0 @ c0)) => (!! @ $i @ Y0))) @ X1) = $true)) )),
% 0.24/0.41 inference(pi_clausification,[],[f17])).
% 0.24/0.41 thf(f17,plain,(
% 0.24/0.41 ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (((!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (cS @ Y1))))) & (Y0 @ c0)) => (!! @ $i @ Y0)))) = $true)),
% 0.24/0.41 inference(beta_eta_normalization,[],[f16])).
% 0.24/0.41 thf(f16,plain,(
% 0.24/0.41 ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (((!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (cS @ Y1))))) & (Y0 @ c0)) => (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))) = $true)),
% 0.24/0.41 inference(definition_unfolding,[],[f13,f12])).
% 0.24/0.41 thf(f12,plain,(
% 0.24/0.41 (cIND = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: (((!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (cS @ Y1))))) & (Y0 @ c0)) => (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))))),
% 0.24/0.41 inference(cnf_transformation,[],[f6])).
% 0.24/0.41 thf(f6,plain,(
% 0.24/0.41 (cIND = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: (((!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (cS @ Y1))))) & (Y0 @ c0)) => (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))))),
% 0.24/0.41 inference(fool_elimination,[],[f5])).
% 0.24/0.41 thf(f5,plain,(
% 0.24/0.41 (! [X0 : $i > $o] : (((X0 @ c0) & ! [X1] : ((X0 @ X1) => (X0 @ (cS @ X1)))) => ! [X2] : (X0 @ X2)) = cIND)),
% 0.24/0.41 inference(rectify,[],[f1])).
% 0.24/0.41 thf(f1,axiom,(
% 0.24/0.41 (! [X0 : $i > $o] : (((X0 @ c0) & ! [X1] : ((X0 @ X1) => (X0 @ (cS @ X1)))) => ! [X1] : (X0 @ X1)) = cIND)),
% 0.24/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cIND_def)).
% 0.24/0.41 thf(f13,plain,(
% 0.24/0.41 (cIND = $true)),
% 0.24/0.41 inference(cnf_transformation,[],[f11])).
% 0.24/0.41 thf(f11,plain,(
% 0.24/0.41 ((c0 != sK0) & ! [X1] : ((cS @ X1) != sK0)) & (cIND = $true)),
% 0.24/0.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10])).
% 0.24/0.41 thf(f10,plain,(
% 0.24/0.41 ? [X0] : ((c0 != X0) & ! [X1] : ((cS @ X1) != X0)) => ((c0 != sK0) & ! [X1] : ((cS @ X1) != sK0))),
% 0.24/0.41 introduced(choice_axiom,[])).
% 0.24/0.41 thf(f9,plain,(
% 0.24/0.41 ? [X0] : ((c0 != X0) & ! [X1] : ((cS @ X1) != X0)) & (cIND = $true)),
% 0.24/0.41 inference(ennf_transformation,[],[f8])).
% 0.24/0.41 thf(f8,plain,(
% 0.24/0.41 ~((cIND = $true) => ! [X0] : ((c0 = X0) | ? [X1] : ((cS @ X1) = X0)))),
% 0.24/0.41 inference(fool_elimination,[],[f7])).
% 0.24/0.41 thf(f7,plain,(
% 0.24/0.41 ~(cIND => ! [X0] : ((c0 = X0) | ? [X1] : ((cS @ X1) = X0)))),
% 0.24/0.41 inference(rectify,[],[f3])).
% 0.24/0.41 thf(f3,negated_conjecture,(
% 0.24/0.41 ~(cIND => ! [X2] : ((c0 = X2) | ? [X3] : ((cS @ X3) = X2)))),
% 0.24/0.41 inference(negated_conjecture,[],[f2])).
% 0.24/0.41 thf(f2,conjecture,(
% 0.24/0.41 cIND => ! [X2] : ((c0 = X2) | ? [X3] : ((cS @ X3) = X2))),
% 0.24/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM578)).
% 0.24/0.41 thf(f14,plain,(
% 0.24/0.41 ( ! [X1 : $i] : (((cS @ X1) != sK0)) )),
% 0.24/0.41 inference(cnf_transformation,[],[f11])).
% 0.24/0.41 thf(f15,plain,(
% 0.24/0.41 (c0 != sK0)),
% 0.24/0.41 inference(cnf_transformation,[],[f11])).
% 0.24/0.41 % SZS output end Proof for theBenchmark
% 0.24/0.41 % (23315)------------------------------
% 0.24/0.41 % (23315)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.41 % (23315)Termination reason: Refutation
% 0.24/0.41
% 0.24/0.41 % (23315)Memory used [KB]: 5500
% 0.24/0.41 % (23315)Time elapsed: 0.011 s
% 0.24/0.41 % (23315)Instructions burned: 11 (million)
% 0.24/0.41 % (23315)------------------------------
% 0.24/0.41 % (23315)------------------------------
% 0.24/0.41 % (23314)Success in time 0.022 s
% 0.24/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------