TSTP Solution File: SYO378^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO378^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 : n008.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:04:13 EDT 2024
% Result : Theorem 0.16s 0.37s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYO378^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.03/0.15 % 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.35 % Computer : n008.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Mon May 20 10:16:38 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a TH0_THM_EQU_NAR problem
% 0.16/0.36 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.37 % (8969)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.37 % (8970)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.37 % (8969)Instruction limit reached!
% 0.16/0.37 % (8969)------------------------------
% 0.16/0.37 % (8969)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.37 % (8969)Termination reason: Unknown
% 0.16/0.37 % (8969)Termination phase: Function definition elimination
% 0.16/0.37
% 0.16/0.37 % (8970)Instruction limit reached!
% 0.16/0.37 % (8970)------------------------------
% 0.16/0.37 % (8970)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.37 % (8969)Memory used [KB]: 895
% 0.16/0.37 % (8969)Time elapsed: 0.002 s
% 0.16/0.37 % (8969)Instructions burned: 2 (million)
% 0.16/0.37 % (8969)------------------------------
% 0.16/0.37 % (8969)------------------------------
% 0.16/0.37 % (8970)Termination reason: Unknown
% 0.16/0.37 % (8970)Termination phase: shuffling
% 0.16/0.37
% 0.16/0.37 % (8970)Memory used [KB]: 895
% 0.16/0.37 % (8970)Time elapsed: 0.002 s
% 0.16/0.37 % (8970)Instructions burned: 2 (million)
% 0.16/0.37 % (8970)------------------------------
% 0.16/0.37 % (8970)------------------------------
% 0.16/0.37 % (8968)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.37 % (8968)First to succeed.
% 0.16/0.37 % (8968)Refutation found. Thanks to Tanya!
% 0.16/0.37 % SZS status Theorem for theBenchmark
% 0.16/0.37 % SZS output start Proof for theBenchmark
% 0.16/0.37 thf(func_def_1, type, cQDP0: $i > $o).
% 0.16/0.37 thf(func_def_2, type, cQDP1: ($i > $o) > $o).
% 0.16/0.37 thf(func_def_3, type, cQDP2: (($i > $o) > $o) > $o).
% 0.16/0.37 thf(func_def_5, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.16/0.37 thf(func_def_15, type, ph1: !>[X0: $tType]:(X0)).
% 0.16/0.37 thf(f33,plain,(
% 0.16/0.37 $false),
% 0.16/0.37 inference(equality_resolution,[],[f32])).
% 0.16/0.37 thf(f32,plain,(
% 0.16/0.37 ( ! [X0 : $i] : ((c != X0)) )),
% 0.16/0.37 inference(equality_proxy_clausification,[],[f31])).
% 0.16/0.37 thf(f31,plain,(
% 0.16/0.37 ( ! [X0 : $i] : (($false = (c = X0))) )),
% 0.16/0.37 inference(equality_resolution,[],[f30])).
% 0.16/0.37 thf(f30,plain,(
% 0.16/0.37 ( ! [X0 : $i > $o,X1 : $i] : (((= @ c) != X0) | ((X0 @ X1) = $false)) )),
% 0.16/0.37 inference(equality_proxy_clausification,[],[f29])).
% 0.16/0.37 thf(f29,plain,(
% 0.16/0.37 ( ! [X0 : $i > $o,X1 : $i] : ((((= @ c) = X0) = $false) | ((X0 @ X1) = $false)) )),
% 0.16/0.37 inference(pi_clausification,[],[f28])).
% 0.16/0.37 thf(f28,plain,(
% 0.16/0.37 ( ! [X0 : $i > $o] : (((?? @ $i @ X0) = $false) | (((= @ c) = X0) = $false)) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f27])).
% 0.16/0.37 thf(f27,plain,(
% 0.16/0.37 ( ! [X0 : $i > $o] : ((((?? @ $i @ X0) & ((= @ c) = X0)) = $false)) )),
% 0.16/0.37 inference(beta_eta_normalization,[],[f26])).
% 0.16/0.37 thf(f26,plain,(
% 0.16/0.37 ( ! [X0 : $i > $o] : (($false = ((^[Y0 : $i > $o]: ((?? @ $i @ Y0) & ((= @ c) = Y0))) @ X0))) )),
% 0.16/0.37 inference(equality_resolution,[],[f25])).
% 0.16/0.37 thf(f25,plain,(
% 0.16/0.37 ( ! [X0 : ($i > $o) > $o,X1 : $i > $o] : (((^[Y0 : $i > $o]: ((?? @ $i @ Y0) & ((= @ c) = Y0))) != X0) | ((X0 @ X1) = $false)) )),
% 0.16/0.37 inference(equality_proxy_clausification,[],[f24])).
% 0.16/0.37 thf(f24,plain,(
% 0.16/0.37 ( ! [X0 : ($i > $o) > $o,X1 : $i > $o] : (((X0 @ X1) = $false) | ($false = ((^[Y0 : $i > $o]: ((?? @ $i @ Y0) & ((= @ c) = Y0))) = X0))) )),
% 0.16/0.37 inference(pi_clausification,[],[f23])).
% 0.16/0.37 thf(f23,plain,(
% 0.16/0.37 ( ! [X0 : ($i > $o) > $o] : (((?? @ ($i > $o) @ X0) = $false) | ($false = ((^[Y0 : $i > $o]: ((?? @ $i @ Y0) & ((= @ c) = Y0))) = X0))) )),
% 0.16/0.37 inference(binary_proxy_clausification,[],[f22])).
% 0.16/0.37 thf(f22,plain,(
% 0.16/0.37 ( ! [X0 : ($i > $o) > $o] : (($true != ((?? @ ($i > $o) @ X0) & ((^[Y0 : $i > $o]: ((?? @ $i @ Y0) & ((= @ c) = Y0))) = X0)))) )),
% 0.16/0.37 inference(beta_eta_normalization,[],[f21])).
% 0.16/0.37 thf(f21,plain,(
% 0.16/0.37 ( ! [X0 : ($i > $o) > $o] : ((((^[Y0 : ($i > $o) > $o]: ((?? @ ($i > $o) @ (^[Y1 : $i > $o]: (Y0 @ Y1))) & ((^[Y1 : $i > $o]: ((?? @ $i @ (^[Y2 : $i]: (Y1 @ Y2))) & ((^[Y2 : $i]: (c = Y2)) = Y1))) = Y0))) @ X0) != $true)) )),
% 0.16/0.37 inference(definition_unfolding,[],[f16,f20])).
% 0.16/0.37 thf(f20,plain,(
% 0.16/0.37 (cQDP2 = (^[Y0 : ($i > $o) > $o]: ((?? @ ($i > $o) @ (^[Y1 : $i > $o]: (Y0 @ Y1))) & ((^[Y1 : $i > $o]: ((?? @ $i @ (^[Y2 : $i]: (Y1 @ Y2))) & ((^[Y2 : $i]: (c = Y2)) = Y1))) = Y0))))),
% 0.16/0.37 inference(definition_unfolding,[],[f17,f19])).
% 0.16/0.37 thf(f19,plain,(
% 0.16/0.37 (cQDP1 = (^[Y0 : $i > $o]: ((?? @ $i @ (^[Y1 : $i]: (Y0 @ Y1))) & ((^[Y1 : $i]: (c = Y1)) = Y0))))),
% 0.16/0.37 inference(definition_unfolding,[],[f18,f15])).
% 0.16/0.37 thf(f15,plain,(
% 0.16/0.37 (cQDP0 = (^[Y0 : $i]: (c = Y0)))),
% 0.16/0.37 inference(cnf_transformation,[],[f9])).
% 0.16/0.37 thf(f9,plain,(
% 0.16/0.37 (cQDP0 = (^[Y0 : $i]: (c = Y0)))),
% 0.16/0.37 inference(fool_elimination,[],[f1])).
% 0.16/0.37 thf(f1,axiom,(
% 0.16/0.37 ((^[X0 : $i] : ((c = X0))) = cQDP0)),
% 0.16/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cQDP0_def)).
% 0.16/0.37 thf(f18,plain,(
% 0.16/0.37 (cQDP1 = (^[Y0 : $i > $o]: ((?? @ $i @ (^[Y1 : $i]: (Y0 @ Y1))) & (cQDP0 = Y0))))),
% 0.16/0.37 inference(cnf_transformation,[],[f13])).
% 0.16/0.37 thf(f13,plain,(
% 0.16/0.37 (cQDP1 = (^[Y0 : $i > $o]: ((?? @ $i @ (^[Y1 : $i]: (Y0 @ Y1))) & (cQDP0 = Y0))))),
% 0.16/0.37 inference(fool_elimination,[],[f12])).
% 0.16/0.37 thf(f12,plain,(
% 0.16/0.37 (cQDP1 = (^[X0 : $i > $o] : ((cQDP0 = X0) & ? [X1] : (X0 @ X1))))),
% 0.16/0.37 inference(rectify,[],[f2])).
% 0.16/0.37 thf(f2,axiom,(
% 0.16/0.37 (cQDP1 = (^[X0 : $i > $o] : ((cQDP0 = X0) & ? [X1] : (X0 @ X1))))),
% 0.16/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cQDP1_def)).
% 0.16/0.37 thf(f17,plain,(
% 0.16/0.37 (cQDP2 = (^[Y0 : ($i > $o) > $o]: ((?? @ ($i > $o) @ (^[Y1 : $i > $o]: (Y0 @ Y1))) & (cQDP1 = Y0))))),
% 0.16/0.37 inference(cnf_transformation,[],[f11])).
% 0.16/0.37 thf(f11,plain,(
% 0.16/0.37 (cQDP2 = (^[Y0 : ($i > $o) > $o]: ((?? @ ($i > $o) @ (^[Y1 : $i > $o]: (Y0 @ Y1))) & (cQDP1 = Y0))))),
% 0.16/0.37 inference(fool_elimination,[],[f10])).
% 0.16/0.37 thf(f10,plain,(
% 0.16/0.37 (cQDP2 = (^[X0 : ($i > $o) > $o] : ((cQDP1 = X0) & ? [X1 : $i > $o] : (X0 @ X1))))),
% 0.16/0.37 inference(rectify,[],[f3])).
% 0.16/0.37 thf(f3,axiom,(
% 0.16/0.37 (cQDP2 = (^[X0 : ($i > $o) > $o] : ((cQDP1 = X0) & ? [X1 : $i > $o] : (X0 @ X1))))),
% 0.16/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cQDP2_def)).
% 0.16/0.37 thf(f16,plain,(
% 0.16/0.37 ( ! [X0 : ($i > $o) > $o] : (((cQDP2 @ X0) != $true)) )),
% 0.16/0.37 inference(cnf_transformation,[],[f14])).
% 0.16/0.37 thf(f14,plain,(
% 0.16/0.37 ! [X0 : ($i > $o) > $o] : ((cQDP2 @ X0) != $true)),
% 0.16/0.37 inference(ennf_transformation,[],[f8])).
% 0.16/0.37 thf(f8,plain,(
% 0.16/0.37 ~? [X0 : ($i > $o) > $o] : ((cQDP2 @ X0) = $true)),
% 0.16/0.37 inference(fool_elimination,[],[f7])).
% 0.16/0.37 thf(f7,plain,(
% 0.16/0.37 ~? [X0 : ($i > $o) > $o] : (cQDP2 @ X0)),
% 0.16/0.37 inference(rectify,[],[f5])).
% 0.16/0.37 thf(f5,negated_conjecture,(
% 0.16/0.37 ~? [X2 : ($i > $o) > $o] : (cQDP2 @ X2)),
% 0.16/0.37 inference(negated_conjecture,[],[f4])).
% 0.16/0.37 thf(f4,conjecture,(
% 0.16/0.37 ? [X2 : ($i > $o) > $o] : (cQDP2 @ X2)),
% 0.16/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cQDTHM2)).
% 0.16/0.37 % SZS output end Proof for theBenchmark
% 0.16/0.37 % (8968)------------------------------
% 0.16/0.37 % (8968)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.37 % (8968)Termination reason: Refutation
% 0.16/0.37
% 0.16/0.37 % (8968)Memory used [KB]: 5500
% 0.16/0.37 % (8968)Time elapsed: 0.004 s
% 0.16/0.37 % (8968)Instructions burned: 2 (million)
% 0.16/0.37 % (8968)------------------------------
% 0.16/0.37 % (8968)------------------------------
% 0.16/0.37 % (8965)Success in time 0.011 s
% 0.16/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------