TSTP Solution File: SYO535^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO535^1 : TPTP v8.2.0. Released 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n014.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:06:08 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO535^1 : TPTP v8.2.0. Released v5.2.0.
% 0.13/0.14 % 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.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 10:53:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.20/0.35 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.20/0.37 % (1164)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.20/0.37 % (1159)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 (2999ds/4Mi)
% 0.20/0.37 % (1158)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.20/0.37 % (1161)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.37 % (1160)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 (2999ds/27Mi)
% 0.20/0.37 % (1162)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 (2999ds/2Mi)
% 0.20/0.37 % (1163)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 (2999ds/275Mi)
% 0.20/0.37 % (1161)Instruction limit reached!
% 0.20/0.37 % (1161)------------------------------
% 0.20/0.37 % (1161)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (1162)Instruction limit reached!
% 0.20/0.37 % (1162)------------------------------
% 0.20/0.37 % (1162)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (1162)Termination reason: Unknown
% 0.20/0.37 % (1162)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (1162)Memory used [KB]: 895
% 0.20/0.37 % (1162)Time elapsed: 0.003 s
% 0.20/0.37 % (1162)Instructions burned: 2 (million)
% 0.20/0.37 % (1162)------------------------------
% 0.20/0.37 % (1162)------------------------------
% 0.20/0.37 % (1161)Termination reason: Unknown
% 0.20/0.37 % (1161)Termination phase: Property scanning
% 0.20/0.37
% 0.20/0.37 % (1161)Memory used [KB]: 895
% 0.20/0.37 % (1161)Time elapsed: 0.003 s
% 0.20/0.37 % (1161)Instructions burned: 2 (million)
% 0.20/0.37 % (1161)------------------------------
% 0.20/0.37 % (1161)------------------------------
% 0.20/0.37 % (1165)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.37 % (1163)Refutation not found, incomplete strategy
% 0.20/0.37 % (1163)------------------------------
% 0.20/0.37 % (1163)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (1163)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (1163)Memory used [KB]: 5500
% 0.20/0.37 % (1163)Time elapsed: 0.004 s
% 0.20/0.37 % (1163)Instructions burned: 3 (million)
% 0.20/0.37 % (1163)------------------------------
% 0.20/0.37 % (1163)------------------------------
% 0.20/0.37 % (1159)Instruction limit reached!
% 0.20/0.37 % (1159)------------------------------
% 0.20/0.37 % (1159)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (1159)Termination reason: Unknown
% 0.20/0.37 % (1159)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (1159)Memory used [KB]: 5500
% 0.20/0.37 % (1159)Time elapsed: 0.005 s
% 0.20/0.37 % (1159)Instructions burned: 4 (million)
% 0.20/0.37 % (1159)------------------------------
% 0.20/0.37 % (1159)------------------------------
% 0.20/0.37 % (1165)Instruction limit reached!
% 0.20/0.37 % (1165)------------------------------
% 0.20/0.37 % (1165)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (1165)Termination reason: Unknown
% 0.20/0.37 % (1165)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (1165)Memory used [KB]: 5500
% 0.20/0.37 % (1165)Time elapsed: 0.004 s
% 0.20/0.37 % (1165)Instructions burned: 3 (million)
% 0.20/0.37 % (1165)------------------------------
% 0.20/0.37 % (1165)------------------------------
% 0.20/0.37 % (1160)First to succeed.
% 0.20/0.38 % (1160)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% 0.20/0.38 thf(func_def_0, type, eps: ($i > $o) > $i).
% 0.20/0.38 thf(func_def_2, type, epsii: (($i > $i) > $o) > $i > $i).
% 0.20/0.38 thf(func_def_3, type, epsa: ($i > ($i > $i) > $o) > $i).
% 0.20/0.38 thf(func_def_4, type, epsb: ($i > ($i > $i) > $o) > $i > $i).
% 0.20/0.38 thf(func_def_5, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.20/0.38 thf(func_def_13, type, sK0: $i > ($i > $i) > $o).
% 0.20/0.38 thf(func_def_14, type, sK1: $i > $i).
% 0.20/0.38 thf(func_def_17, type, ph4: !>[X0: $tType]:(X0)).
% 0.20/0.38 thf(func_def_18, type, sK5: $i > $i).
% 0.20/0.38 thf(func_def_19, type, sK6: $i > $i).
% 0.20/0.38 thf(f71,plain,(
% 0.20/0.38 $false),
% 0.20/0.38 inference(avatar_sat_refutation,[],[f45,f61,f64,f70])).
% 0.20/0.38 thf(f70,plain,(
% 0.20/0.38 ~spl3_1),
% 0.20/0.38 inference(avatar_split_clause,[],[f32,f39])).
% 0.20/0.38 thf(f39,plain,(
% 0.20/0.38 spl3_1 <=> ((sK0 @ (eps @ (^[Y0 : $i]: (?? @ ($i > $i) @ (sK0 @ Y0)))) @ (epsii @ (sK0 @ (eps @ (^[Y0 : $i]: (?? @ ($i > $i) @ (sK0 @ Y0))))))) = $true)),
% 0.20/0.38 introduced(avatar_definition,[new_symbols(naming,[spl3_1])])).
% 0.20/0.38 thf(f32,plain,(
% 0.20/0.38 ((sK0 @ (eps @ (^[Y0 : $i]: (?? @ ($i > $i) @ (sK0 @ Y0)))) @ (epsii @ (sK0 @ (eps @ (^[Y0 : $i]: (?? @ ($i > $i) @ (sK0 @ Y0))))))) != $true)),
% 0.20/0.38 inference(beta_eta_normalization,[],[f31])).
% 0.20/0.38 thf(f31,plain,(
% 0.20/0.38 ((sK0 @ ((^[Y0 : $i > ($i > $i) > $o]: (eps @ (^[Y1 : $i]: (?? @ ($i > $i) @ (^[Y2 : $i > $i]: (Y0 @ Y1 @ Y2)))))) @ sK0) @ ((^[Y0 : $i > ($i > $i) > $o]: (epsii @ (^[Y1 : $i > $i]: (Y0 @ ((^[Y2 : $i > ($i > $i) > $o]: (eps @ (^[Y3 : $i]: (?? @ ($i > $i) @ (^[Y4 : $i > $i]: (Y2 @ Y3 @ Y4)))))) @ Y0) @ Y1)))) @ sK0)) != $true)),
% 0.20/0.38 inference(definition_unfolding,[],[f27,f25,f30])).
% 0.20/0.38 thf(f30,plain,(
% 0.20/0.38 (epsb = (^[Y0 : $i > ($i > $i) > $o]: (epsii @ (^[Y1 : $i > $i]: (Y0 @ ((^[Y2 : $i > ($i > $i) > $o]: (eps @ (^[Y3 : $i]: (?? @ ($i > $i) @ (^[Y4 : $i > $i]: (Y2 @ Y3 @ Y4)))))) @ Y0) @ Y1)))))),
% 0.20/0.38 inference(definition_unfolding,[],[f29,f25])).
% 0.20/0.38 thf(f29,plain,(
% 0.20/0.38 (epsb = (^[Y0 : $i > ($i > $i) > $o]: (epsii @ (^[Y1 : $i > $i]: (Y0 @ (epsa @ Y0) @ Y1)))))),
% 0.20/0.38 inference(cnf_transformation,[],[f13])).
% 0.20/0.38 thf(f13,plain,(
% 0.20/0.38 (epsb = (^[Y0 : $i > ($i > $i) > $o]: (epsii @ (^[Y1 : $i > $i]: (Y0 @ (epsa @ Y0) @ Y1)))))),
% 0.20/0.38 inference(fool_elimination,[],[f12])).
% 0.20/0.38 thf(f12,plain,(
% 0.20/0.38 (epsb = (^[X0 : $i > ($i > $i) > $o] : (epsii @ (^[X1 : $i > $i] : (X0 @ (epsa @ X0) @ X1)))))),
% 0.20/0.38 inference(rectify,[],[f4])).
% 0.20/0.38 thf(f4,axiom,(
% 0.20/0.38 (epsb = (^[X2 : $i > ($i > $i) > $o] : (epsii @ (^[X3 : $i > $i] : (X2 @ (epsa @ X2) @ X3)))))),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',epsbd)).
% 0.20/0.38 thf(f25,plain,(
% 0.20/0.38 (epsa = (^[Y0 : $i > ($i > $i) > $o]: (eps @ (^[Y1 : $i]: (?? @ ($i > $i) @ (^[Y2 : $i > $i]: (Y0 @ Y1 @ Y2)))))))),
% 0.20/0.38 inference(cnf_transformation,[],[f15])).
% 0.20/0.38 thf(f15,plain,(
% 0.20/0.38 (epsa = (^[Y0 : $i > ($i > $i) > $o]: (eps @ (^[Y1 : $i]: (?? @ ($i > $i) @ (^[Y2 : $i > $i]: (Y0 @ Y1 @ Y2)))))))),
% 0.20/0.38 inference(fool_elimination,[],[f14])).
% 0.20/0.38 thf(f14,plain,(
% 0.20/0.38 (epsa = (^[X0 : $i > ($i > $i) > $o] : (eps @ (^[X1 : $i] : (? [X2 : $i > $i] : (X0 @ X1 @ X2))))))),
% 0.20/0.38 inference(rectify,[],[f3])).
% 0.20/0.38 thf(f3,axiom,(
% 0.20/0.38 (epsa = (^[X2 : $i > ($i > $i) > $o] : (eps @ (^[X1 : $i] : (? [X3 : $i > $i] : (X2 @ X1 @ X3))))))),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',epsad)).
% 0.20/0.38 thf(f27,plain,(
% 0.20/0.38 ((sK0 @ (epsa @ sK0) @ (epsb @ sK0)) != $true)),
% 0.20/0.38 inference(cnf_transformation,[],[f23])).
% 0.20/0.38 thf(f23,plain,(
% 0.20/0.38 ((sK0 @ (epsa @ sK0) @ (epsb @ sK0)) != $true) & ((sK0 @ sK2 @ sK1) = $true)),
% 0.20/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f18,f22,f21])).
% 0.20/0.38 thf(f21,plain,(
% 0.20/0.38 ? [X0 : $i > ($i > $i) > $o] : (((X0 @ (epsa @ X0) @ (epsb @ X0)) != $true) & ? [X1 : $i > $i,X2] : ($true = (X0 @ X2 @ X1))) => (((sK0 @ (epsa @ sK0) @ (epsb @ sK0)) != $true) & ? [X2,X1 : $i > $i] : ((sK0 @ X2 @ X1) = $true))),
% 0.20/0.38 introduced(choice_axiom,[])).
% 0.20/0.38 thf(f22,plain,(
% 0.20/0.38 ? [X2,X1 : $i > $i] : ((sK0 @ X2 @ X1) = $true) => ((sK0 @ sK2 @ sK1) = $true)),
% 0.20/0.38 introduced(choice_axiom,[])).
% 0.20/0.38 thf(f18,plain,(
% 0.20/0.38 ? [X0 : $i > ($i > $i) > $o] : (((X0 @ (epsa @ X0) @ (epsb @ X0)) != $true) & ? [X1 : $i > $i,X2] : ($true = (X0 @ X2 @ X1)))),
% 0.20/0.38 inference(ennf_transformation,[],[f17])).
% 0.20/0.38 thf(f17,plain,(
% 0.20/0.38 ~! [X0 : $i > ($i > $i) > $o] : (? [X1 : $i > $i,X2] : ($true = (X0 @ X2 @ X1)) => ((X0 @ (epsa @ X0) @ (epsb @ X0)) = $true))),
% 0.20/0.38 inference(fool_elimination,[],[f16])).
% 0.20/0.38 thf(f16,plain,(
% 0.20/0.38 ~! [X0 : $i > ($i > $i) > $o] : (? [X1 : $i > $i,X2] : (X0 @ X2 @ X1) => (X0 @ (epsa @ X0) @ (epsb @ X0)))),
% 0.20/0.38 inference(rectify,[],[f6])).
% 0.20/0.38 thf(f6,negated_conjecture,(
% 0.20/0.38 ~! [X2 : $i > ($i > $i) > $o] : (? [X3 : $i > $i,X1] : (X2 @ X1 @ X3) => (X2 @ (epsa @ X2) @ (epsb @ X2)))),
% 0.20/0.38 inference(negated_conjecture,[],[f5])).
% 0.20/0.38 thf(f5,conjecture,(
% 0.20/0.38 ! [X2 : $i > ($i > $i) > $o] : (? [X3 : $i > $i,X1] : (X2 @ X1 @ X3) => (X2 @ (epsa @ X2) @ (epsb @ X2)))),
% 0.20/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)).
% 0.20/0.38 thf(f64,plain,(
% 0.20/0.38 ~spl3_4),
% 0.20/0.38 inference(avatar_contradiction_clause,[],[f63])).
% 0.20/0.38 thf(f63,plain,(
% 0.20/0.38 $false | ~spl3_4),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f62])).
% 0.20/0.38 thf(f62,plain,(
% 0.20/0.38 ($false = $true) | ~spl3_4),
% 0.20/0.38 inference(backward_demodulation,[],[f26,f52])).
% 0.20/0.38 thf(f52,plain,(
% 0.20/0.38 ( ! [X2 : $i > $i,X1 : $i] : (((sK0 @ X1 @ X2) = $false)) ) | ~spl3_4),
% 0.20/0.38 inference(avatar_component_clause,[],[f51])).
% 0.20/0.38 thf(f51,plain,(
% 0.20/0.38 spl3_4 <=> ! [X2 : $i > $i,X1] : ((sK0 @ X1 @ X2) = $false)),
% 0.20/0.38 introduced(avatar_definition,[new_symbols(naming,[spl3_4])])).
% 0.20/0.38 thf(f26,plain,(
% 0.20/0.38 ((sK0 @ sK2 @ sK1) = $true)),
% 0.20/0.38 inference(cnf_transformation,[],[f23])).
% 0.20/0.38 thf(f61,plain,(
% 0.20/0.38 spl3_4 | ~spl3_2),
% 0.20/0.38 inference(avatar_split_clause,[],[f60,f43,f51])).
% 0.20/0.38 thf(f43,plain,(
% 0.20/0.38 spl3_2 <=> ! [X1 : $i > $i] : ((sK0 @ (eps @ (^[Y0 : $i]: (?? @ ($i > $i) @ (sK0 @ Y0)))) @ X1) = $false)),
% 0.20/0.38 introduced(avatar_definition,[new_symbols(naming,[spl3_2])])).
% 0.20/0.38 thf(f60,plain,(
% 0.20/0.38 ( ! [X2 : $i > $i,X1 : $i] : (((sK0 @ X1 @ X2) = $false)) ) | ~spl3_2),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f59])).
% 0.20/0.38 thf(f59,plain,(
% 0.20/0.38 ( ! [X2 : $i > $i,X1 : $i] : (($false = $true) | ((sK0 @ X1 @ X2) = $false)) ) | ~spl3_2),
% 0.20/0.38 inference(forward_demodulation,[],[f58,f44])).
% 0.20/0.38 thf(f44,plain,(
% 0.20/0.38 ( ! [X1 : $i > $i] : (((sK0 @ (eps @ (^[Y0 : $i]: (?? @ ($i > $i) @ (sK0 @ Y0)))) @ X1) = $false)) ) | ~spl3_2),
% 0.20/0.38 inference(avatar_component_clause,[],[f43])).
% 0.20/0.38 thf(f58,plain,(
% 0.20/0.38 ( ! [X2 : $i > $i,X1 : $i] : (((sK0 @ (eps @ (^[Y0 : $i]: (?? @ ($i > $i) @ (sK0 @ Y0)))) @ sK6) = $true) | ((sK0 @ X1 @ X2) = $false)) )),
% 0.20/0.38 inference(pi_clausification,[],[f57])).
% 0.20/0.38 thf(f57,plain,(
% 0.20/0.38 ( ! [X1 : $i] : (((sK0 @ (eps @ (^[Y0 : $i]: (?? @ ($i > $i) @ (sK0 @ Y0)))) @ sK6) = $true) | ($false = (?? @ ($i > $i) @ (sK0 @ X1)))) )),
% 0.20/0.38 inference(sigma_clausification,[],[f56])).
% 0.20/0.38 thf(f56,plain,(
% 0.20/0.38 ( ! [X1 : $i] : (($true = (?? @ ($i > $i) @ (sK0 @ (eps @ (^[Y0 : $i]: (?? @ ($i > $i) @ (sK0 @ Y0))))))) | ($false = (?? @ ($i > $i) @ (sK0 @ X1)))) )),
% 0.20/0.38 inference(beta_eta_normalization,[],[f55])).
% 0.20/0.38 thf(f55,plain,(
% 0.20/0.38 ( ! [X1 : $i] : ((((^[Y0 : $i]: (?? @ ($i > $i) @ (sK0 @ Y0))) @ X1) = $false) | ($true = ((^[Y0 : $i]: (?? @ ($i > $i) @ (sK0 @ Y0))) @ (eps @ (^[Y0 : $i]: (?? @ ($i > $i) @ (sK0 @ Y0))))))) )),
% 0.20/0.38 introduced(choice_axiom,[])).
% 0.20/0.38 thf(f45,plain,(
% 0.20/0.38 spl3_1 | spl3_2),
% 0.20/0.38 inference(avatar_split_clause,[],[f34,f43,f39])).
% 0.20/0.38 thf(f34,plain,(
% 0.20/0.38 ( ! [X1 : $i > $i] : (((sK0 @ (eps @ (^[Y0 : $i]: (?? @ ($i > $i) @ (sK0 @ Y0)))) @ X1) = $false) | ((sK0 @ (eps @ (^[Y0 : $i]: (?? @ ($i > $i) @ (sK0 @ Y0)))) @ (epsii @ (sK0 @ (eps @ (^[Y0 : $i]: (?? @ ($i > $i) @ (sK0 @ Y0))))))) = $true)) )),
% 0.20/0.38 introduced(choice_axiom,[])).
% 0.20/0.38 % SZS output end Proof for theBenchmark
% 0.20/0.38 % (1160)------------------------------
% 0.20/0.38 % (1160)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (1160)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (1160)Memory used [KB]: 5500
% 0.20/0.38 % (1160)Time elapsed: 0.007 s
% 0.20/0.38 % (1160)Instructions burned: 4 (million)
% 0.20/0.38 % (1160)------------------------------
% 0.20/0.38 % (1160)------------------------------
% 0.20/0.38 % (1157)Success in time 0.008 s
% 0.20/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------