TSTP Solution File: SEV389^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV389^5 : TPTP v8.2.0. Released v4.0.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 : n020.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 04:13:38 EDT 2024
% Result : Theorem 0.15s 0.32s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEV389^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.10 % 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.10/0.30 % Computer : n020.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 18:46:38 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 This is a TH0_THM_EQU_NAR problem
% 0.10/0.30 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.15/0.32 % (32248)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.15/0.32 % (32249)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.15/0.32 % (32253)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.15/0.32 % (32248)First to succeed.
% 0.15/0.32 % (32253)Also succeeded, but the first one will report.
% 0.15/0.32 % (32249)Also succeeded, but the first one will report.
% 0.15/0.32 % (32251)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.32 % (32251)Also succeeded, but the first one will report.
% 0.15/0.32 % (32250)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.15/0.32 % (32252)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.15/0.32 % (32248)Refutation found. Thanks to Tanya!
% 0.15/0.32 % SZS status Theorem for theBenchmark
% 0.15/0.32 % SZS output start Proof for theBenchmark
% 0.15/0.32 thf(func_def_0, type, cS: $i > $o).
% 0.15/0.32 thf(func_def_1, type, cR: $i > $o).
% 0.15/0.32 thf(func_def_10, type, ph2: !>[X0: $tType]:(X0)).
% 0.15/0.32 thf(f28,plain,(
% 0.15/0.32 $false),
% 0.15/0.32 inference(subsumption_resolution,[],[f27,f11])).
% 0.15/0.32 thf(f11,plain,(
% 0.15/0.32 ((cS @ sK0) != $true)),
% 0.15/0.32 inference(cnf_transformation,[],[f9])).
% 0.15/0.32 thf(f9,plain,(
% 0.15/0.32 (cR = (^[Y0 : $i]: ((cS @ Y0) & (cR @ Y0)))) & (((cS @ sK0) != $true) & ((cR @ sK0) = $true))),
% 0.15/0.32 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8])).
% 0.15/0.32 thf(f8,plain,(
% 0.15/0.32 ? [X0] : (((cS @ X0) != $true) & ((cR @ X0) = $true)) => (((cS @ sK0) != $true) & ((cR @ sK0) = $true))),
% 0.15/0.32 introduced(choice_axiom,[])).
% 0.15/0.32 thf(f7,plain,(
% 0.15/0.32 (cR = (^[Y0 : $i]: ((cS @ Y0) & (cR @ Y0)))) & ? [X0] : (((cS @ X0) != $true) & ((cR @ X0) = $true))),
% 0.15/0.32 inference(ennf_transformation,[],[f6])).
% 0.15/0.32 thf(f6,plain,(
% 0.15/0.32 ~((cR = (^[Y0 : $i]: ((cS @ Y0) & (cR @ Y0)))) => ! [X0] : (((cR @ X0) = $true) => ((cS @ X0) = $true)))),
% 0.15/0.32 inference(rectify,[],[f5])).
% 0.15/0.32 thf(f5,plain,(
% 0.15/0.32 ~((cR = (^[Y0 : $i]: ((cS @ Y0) & (cR @ Y0)))) => ! [X1] : (($true = (cR @ X1)) => ((cS @ X1) = $true)))),
% 0.15/0.32 inference(fool_elimination,[],[f4])).
% 0.15/0.32 thf(f4,plain,(
% 0.15/0.32 ~(((^[X0 : $i] : ((cR @ X0) & (cS @ X0))) = cR) => ! [X1] : ((cR @ X1) => (cS @ X1)))),
% 0.15/0.32 inference(rectify,[],[f2])).
% 0.15/0.32 thf(f2,negated_conjecture,(
% 0.15/0.32 ~(((^[X0 : $i] : ((cR @ X0) & (cS @ X0))) = cR) => ! [X0] : ((cR @ X0) => (cS @ X0)))),
% 0.15/0.32 inference(negated_conjecture,[],[f1])).
% 0.15/0.32 thf(f1,conjecture,(
% 0.15/0.32 ((^[X0 : $i] : ((cR @ X0) & (cS @ X0))) = cR) => ! [X0] : ((cR @ X0) => (cS @ X0))),
% 0.15/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM37_pme)).
% 0.15/0.32 thf(f27,plain,(
% 0.15/0.32 ((cS @ sK0) = $true)),
% 0.15/0.32 inference(trivial_inequality_removal,[],[f23])).
% 0.15/0.32 thf(f23,plain,(
% 0.15/0.32 ((cS @ sK0) = $true) | ($false = $true)),
% 0.15/0.32 inference(superposition,[],[f10,f19])).
% 0.15/0.32 thf(f19,plain,(
% 0.15/0.32 ( ! [X1 : $i] : (($false = (cR @ X1)) | ((cS @ X1) = $true)) )),
% 0.15/0.32 inference(binary_proxy_clausification,[],[f15])).
% 0.15/0.32 thf(f15,plain,(
% 0.15/0.32 ( ! [X1 : $i] : (($false = (cR @ X1)) | (((cS @ X1) & (cR @ X1)) = $true)) )),
% 0.15/0.32 inference(binary_proxy_clausification,[],[f14])).
% 0.15/0.32 thf(f14,plain,(
% 0.15/0.32 ( ! [X1 : $i] : ((((cS @ X1) & (cR @ X1)) = (cR @ X1))) )),
% 0.15/0.32 inference(beta_eta_normalization,[],[f13])).
% 0.15/0.32 thf(f13,plain,(
% 0.15/0.32 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((cS @ Y0) & (cR @ Y0))) @ X1) = (cR @ X1))) )),
% 0.15/0.32 inference(argument_congruence,[],[f12])).
% 0.15/0.32 thf(f12,plain,(
% 0.15/0.32 (cR = (^[Y0 : $i]: ((cS @ Y0) & (cR @ Y0))))),
% 0.15/0.32 inference(cnf_transformation,[],[f9])).
% 0.15/0.32 thf(f10,plain,(
% 0.15/0.32 ((cR @ sK0) = $true)),
% 0.15/0.32 inference(cnf_transformation,[],[f9])).
% 0.15/0.32 % SZS output end Proof for theBenchmark
% 0.15/0.32 % (32248)------------------------------
% 0.15/0.32 % (32248)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (32248)Termination reason: Refutation
% 0.15/0.32
% 0.15/0.32 % (32248)Memory used [KB]: 5500
% 0.15/0.32 % (32248)Time elapsed: 0.003 s
% 0.15/0.32 % (32248)Instructions burned: 1 (million)
% 0.15/0.32 % (32248)------------------------------
% 0.15/0.32 % (32248)------------------------------
% 0.15/0.32 % (32247)Success in time 0.004 s
% 0.15/0.32 % Vampire---4.8 exiting
%------------------------------------------------------------------------------