TSTP Solution File: SYO008^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO008^1 : 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n024.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:02:12 EDT 2024
% Result : Theorem 0.20s 0.37s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYO008^1 : TPTP v8.2.0. Released v3.7.0.
% 0.04/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 : n024.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 08:35:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_EQU_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.13/0.36 % (22940)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.13/0.36 % (22938)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.13/0.36 % (22941)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.13/0.36 % (22934)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.13/0.36 % (22938)Instruction limit reached!
% 0.13/0.36 % (22938)------------------------------
% 0.13/0.36 % (22938)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (22938)Termination reason: Unknown
% 0.13/0.36 % (22938)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (22938)Memory used [KB]: 895
% 0.13/0.36 % (22938)Time elapsed: 0.003 s
% 0.13/0.36 % (22938)Instructions burned: 2 (million)
% 0.13/0.36 % (22938)------------------------------
% 0.13/0.36 % (22938)------------------------------
% 0.13/0.36 % (22937)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.36 % (22941)Refutation not found, incomplete strategy
% 0.13/0.36 % (22941)------------------------------
% 0.13/0.36 % (22941)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (22936)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.13/0.36 % (22941)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.36
% 0.13/0.36
% 0.13/0.36 % (22941)Memory used [KB]: 5500
% 0.13/0.36 % (22941)Time elapsed: 0.003 s
% 0.13/0.36 % (22941)Instructions burned: 2 (million)
% 0.13/0.36 % (22941)------------------------------
% 0.13/0.36 % (22941)------------------------------
% 0.13/0.36 % (22937)Instruction limit reached!
% 0.13/0.36 % (22937)------------------------------
% 0.13/0.36 % (22937)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (22937)Termination reason: Unknown
% 0.13/0.36 % (22937)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (22937)Memory used [KB]: 895
% 0.13/0.36 % (22937)Time elapsed: 0.003 s
% 0.13/0.36 % (22937)Instructions burned: 2 (million)
% 0.13/0.36 % (22937)------------------------------
% 0.13/0.36 % (22937)------------------------------
% 0.13/0.36 % (22940)First to succeed.
% 0.13/0.36 % (22939)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.20/0.37 % (22936)Refutation not found, incomplete strategy
% 0.20/0.37 % (22936)------------------------------
% 0.20/0.37 % (22936)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (22936)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (22936)Memory used [KB]: 5500
% 0.20/0.37 % (22936)Time elapsed: 0.003 s
% 0.20/0.37 % (22936)Instructions burned: 2 (million)
% 0.20/0.37 % (22936)------------------------------
% 0.20/0.37 % (22936)------------------------------
% 0.20/0.37 % (22940)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for theBenchmark
% 0.20/0.37 % SZS output start Proof for theBenchmark
% 0.20/0.37 thf(func_def_0, type, leibeq1: $i > $i > $o).
% 0.20/0.37 thf(func_def_2, type, leibeq2: ($i > $i) > ($i > $i) > $o).
% 0.20/0.37 thf(func_def_11, type, sK0: $i > $i).
% 0.20/0.37 thf(func_def_12, type, sK1: $i > $i).
% 0.20/0.37 thf(func_def_14, type, sK3: ($i > $i) > $o).
% 0.20/0.37 thf(func_def_16, type, ph4: !>[X0: $tType]:(X0)).
% 0.20/0.37 thf(f53,plain,(
% 0.20/0.37 $false),
% 0.20/0.37 inference(subsumption_resolution,[],[f52,f30])).
% 0.20/0.37 thf(f30,plain,(
% 0.20/0.37 ( ! [X0 : $i] : (((sK1 @ X0) = (sK0 @ X0))) )),
% 0.20/0.37 inference(leibniz_equality_elimination,[],[f29])).
% 0.20/0.37 thf(f29,plain,(
% 0.20/0.37 ( ! [X2 : $i,X3 : $i > $o] : (((X3 @ (sK1 @ X2)) = $true) | ((X3 @ (sK0 @ X2)) = $false)) )),
% 0.20/0.37 inference(binary_proxy_clausification,[],[f28])).
% 0.20/0.37 thf(f28,plain,(
% 0.20/0.37 ( ! [X2 : $i,X3 : $i > $o] : ((((X3 @ (sK0 @ X2)) => (X3 @ (sK1 @ X2))) = $true)) )),
% 0.20/0.37 inference(beta_eta_normalization,[],[f27])).
% 0.20/0.37 thf(f27,plain,(
% 0.20/0.37 ( ! [X2 : $i,X3 : $i > $o] : ((((^[Y0 : $i > $o]: ((Y0 @ (sK0 @ X2)) => (Y0 @ (sK1 @ X2)))) @ X3) = $true)) )),
% 0.20/0.37 inference(pi_clausification,[],[f26])).
% 0.20/0.37 thf(f26,plain,(
% 0.20/0.37 ( ! [X2 : $i] : (($true = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((Y0 @ (sK0 @ X2)) => (Y0 @ (sK1 @ X2))))))) )),
% 0.20/0.37 inference(beta_eta_normalization,[],[f20])).
% 0.20/0.37 thf(f20,plain,(
% 0.20/0.37 ( ! [X2 : $i] : (($true = ((^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((Y2 @ Y0) => (Y2 @ Y1))))))) @ (sK0 @ X2) @ (sK1 @ X2)))) )),
% 0.20/0.37 inference(definition_unfolding,[],[f15,f18])).
% 0.20/0.37 thf(f18,plain,(
% 0.20/0.37 (leibeq1 = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((Y2 @ Y0) => (Y2 @ Y1))))))))),
% 0.20/0.37 inference(cnf_transformation,[],[f11])).
% 0.20/0.37 thf(f11,plain,(
% 0.20/0.37 (leibeq1 = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((Y2 @ Y0) => (Y2 @ Y1))))))))),
% 0.20/0.37 inference(fool_elimination,[],[f10])).
% 0.20/0.37 thf(f10,plain,(
% 0.20/0.37 (leibeq1 = (^[X0 : $i, X1 : $i] : (! [X2 : $i > $o] : ((X2 @ X0) => (X2 @ X1)))))),
% 0.20/0.37 inference(rectify,[],[f1])).
% 0.20/0.37 thf(f1,axiom,(
% 0.20/0.37 (leibeq1 = (^[X0 : $i, X1 : $i] : (! [X2 : $i > $o] : ((X2 @ X0) => (X2 @ X1)))))),
% 0.20/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leibeq1)).
% 0.20/0.37 thf(f15,plain,(
% 0.20/0.37 ( ! [X2 : $i] : (($true = (leibeq1 @ (sK0 @ X2) @ (sK1 @ X2)))) )),
% 0.20/0.37 inference(cnf_transformation,[],[f14])).
% 0.20/0.37 thf(f14,plain,(
% 0.20/0.37 ((leibeq2 @ sK0 @ sK1) != $true) & ! [X2] : ($true = (leibeq1 @ (sK0 @ X2) @ (sK1 @ X2)))),
% 0.20/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f12,f13])).
% 0.20/0.37 thf(f13,plain,(
% 0.20/0.37 ? [X0 : $i > $i,X1 : $i > $i] : (($true != (leibeq2 @ X0 @ X1)) & ! [X2] : ((leibeq1 @ (X0 @ X2) @ (X1 @ X2)) = $true)) => (((leibeq2 @ sK0 @ sK1) != $true) & ! [X2] : ($true = (leibeq1 @ (sK0 @ X2) @ (sK1 @ X2))))),
% 0.20/0.37 introduced(choice_axiom,[])).
% 0.20/0.37 thf(f12,plain,(
% 0.20/0.37 ? [X0 : $i > $i,X1 : $i > $i] : (($true != (leibeq2 @ X0 @ X1)) & ! [X2] : ((leibeq1 @ (X0 @ X2) @ (X1 @ X2)) = $true))),
% 0.20/0.37 inference(ennf_transformation,[],[f9])).
% 0.20/0.37 thf(f9,plain,(
% 0.20/0.37 ~! [X0 : $i > $i,X1 : $i > $i] : (! [X2] : ((leibeq1 @ (X0 @ X2) @ (X1 @ X2)) = $true) => ($true = (leibeq2 @ X0 @ X1)))),
% 0.20/0.37 inference(fool_elimination,[],[f8])).
% 0.20/0.37 thf(f8,plain,(
% 0.20/0.37 ~! [X0 : $i > $i,X1 : $i > $i] : (! [X2] : (leibeq1 @ (X0 @ X2) @ (X1 @ X2)) => (leibeq2 @ X0 @ X1))),
% 0.20/0.37 inference(rectify,[],[f4])).
% 0.20/0.37 thf(f4,negated_conjecture,(
% 0.20/0.37 ~! [X6 : $i > $i,X7 : $i > $i] : (! [X3] : (leibeq1 @ (X6 @ X3) @ (X7 @ X3)) => (leibeq2 @ X6 @ X7))),
% 0.20/0.37 inference(negated_conjecture,[],[f3])).
% 0.20/0.37 thf(f3,conjecture,(
% 0.20/0.37 ! [X6 : $i > $i,X7 : $i > $i] : (! [X3] : (leibeq1 @ (X6 @ X3) @ (X7 @ X3)) => (leibeq2 @ X6 @ X7))),
% 0.20/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)).
% 0.20/0.37 thf(f52,plain,(
% 0.20/0.37 ((sK1 @ sK5) != (sK0 @ sK5))),
% 0.20/0.37 inference(negative_extensionality,[],[f51])).
% 0.20/0.37 thf(f51,plain,(
% 0.20/0.37 (sK0 != sK1)),
% 0.20/0.37 inference(trivial_inequality_removal,[],[f49])).
% 0.20/0.37 thf(f49,plain,(
% 0.20/0.37 ($true = $false) | (sK0 != sK1)),
% 0.20/0.37 inference(constrained_superposition,[],[f24,f25])).
% 0.20/0.37 thf(f25,plain,(
% 0.20/0.37 ((sK3 @ sK0) = $true)),
% 0.20/0.37 inference(binary_proxy_clausification,[],[f23])).
% 0.20/0.37 thf(f23,plain,(
% 0.20/0.37 (((sK3 @ sK0) => (sK3 @ sK1)) = $false)),
% 0.20/0.37 inference(beta_eta_normalization,[],[f22])).
% 0.20/0.37 thf(f22,plain,(
% 0.20/0.37 (((^[Y0 : ($i > $i) > $o]: ((Y0 @ sK0) => (Y0 @ sK1))) @ sK3) = $false)),
% 0.20/0.37 inference(sigma_clausification,[],[f21])).
% 0.20/0.37 thf(f21,plain,(
% 0.20/0.37 ((!! @ (($i > $i) > $o) @ (^[Y0 : ($i > $i) > $o]: ((Y0 @ sK0) => (Y0 @ sK1)))) != $true)),
% 0.20/0.37 inference(beta_eta_normalization,[],[f19])).
% 0.20/0.37 thf(f19,plain,(
% 0.20/0.37 (((^[Y0 : $i > $i]: ((^[Y1 : $i > $i]: (!! @ (($i > $i) > $o) @ (^[Y2 : ($i > $i) > $o]: ((Y2 @ Y0) => (Y2 @ Y1))))))) @ sK0 @ sK1) != $true)),
% 0.20/0.37 inference(definition_unfolding,[],[f16,f17])).
% 0.20/0.37 thf(f17,plain,(
% 0.20/0.37 (leibeq2 = (^[Y0 : $i > $i]: ((^[Y1 : $i > $i]: (!! @ (($i > $i) > $o) @ (^[Y2 : ($i > $i) > $o]: ((Y2 @ Y0) => (Y2 @ Y1))))))))),
% 0.20/0.37 inference(cnf_transformation,[],[f7])).
% 0.20/0.37 thf(f7,plain,(
% 0.20/0.37 (leibeq2 = (^[Y0 : $i > $i]: ((^[Y1 : $i > $i]: (!! @ (($i > $i) > $o) @ (^[Y2 : ($i > $i) > $o]: ((Y2 @ Y0) => (Y2 @ Y1))))))))),
% 0.20/0.37 inference(fool_elimination,[],[f6])).
% 0.20/0.37 thf(f6,plain,(
% 0.20/0.37 ((^[X0 : $i > $i, X1 : $i > $i] : (! [X2 : ($i > $i) > $o] : ((X2 @ X0) => (X2 @ X1)))) = leibeq2)),
% 0.20/0.37 inference(rectify,[],[f2])).
% 0.20/0.37 thf(f2,axiom,(
% 0.20/0.37 ((^[X3 : $i > $i, X4 : $i > $i] : (! [X5 : ($i > $i) > $o] : ((X5 @ X3) => (X5 @ X4)))) = leibeq2)),
% 0.20/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leibeq2)).
% 0.20/0.37 thf(f16,plain,(
% 0.20/0.37 ((leibeq2 @ sK0 @ sK1) != $true)),
% 0.20/0.37 inference(cnf_transformation,[],[f14])).
% 0.20/0.37 thf(f24,plain,(
% 0.20/0.37 ((sK3 @ sK1) = $false)),
% 0.20/0.37 inference(binary_proxy_clausification,[],[f23])).
% 0.20/0.37 % SZS output end Proof for theBenchmark
% 0.20/0.37 % (22940)------------------------------
% 0.20/0.37 % (22940)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (22940)Termination reason: Refutation
% 0.20/0.37
% 0.20/0.37 % (22940)Memory used [KB]: 5500
% 0.20/0.37 % (22940)Time elapsed: 0.005 s
% 0.20/0.37 % (22940)Instructions burned: 3 (million)
% 0.20/0.37 % (22940)------------------------------
% 0.20/0.37 % (22940)------------------------------
% 0.20/0.37 % (22933)Success in time 0.004 s
% 0.20/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------