TSTP Solution File: SEU930^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU930^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 : 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 03:52:14 EDT 2024
% Result : Theorem 0.16s 0.39s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.13 % Problem : SEU930^5 : TPTP v8.2.0. Released v4.0.0.
% 0.14/0.15 % 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.16/0.36 % Computer : n017.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sun May 19 15:23:53 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a TH0_THM_EQU_NAR problem
% 0.16/0.37 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.16/0.38 % (11843)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.38 % (11842)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.38 % (11845)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.38 % (11844)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.38 % (11843)First to succeed.
% 0.16/0.39 % (11839)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.39 % (11842)Instruction limit reached!
% 0.16/0.39 % (11842)------------------------------
% 0.16/0.39 % (11842)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (11842)Termination reason: Unknown
% 0.16/0.39 % (11842)Termination phase: Saturation
% 0.16/0.39
% 0.16/0.39 % (11842)Memory used [KB]: 5500
% 0.16/0.39 % (11842)Time elapsed: 0.003 s
% 0.16/0.39 % (11842)Instructions burned: 2 (million)
% 0.16/0.39 % (11842)------------------------------
% 0.16/0.39 % (11842)------------------------------
% 0.16/0.39 % (11845)Also succeeded, but the first one will report.
% 0.16/0.39 % (11843)Refutation found. Thanks to Tanya!
% 0.16/0.39 % SZS status Theorem for theBenchmark
% 0.16/0.39 % SZS output start Proof for theBenchmark
% 0.16/0.39 thf(func_def_0, type, f: $i > $i).
% 0.16/0.39 thf(func_def_1, type, g: $i > $i).
% 0.16/0.39 thf(func_def_9, type, ph2: !>[X0: $tType]:(X0)).
% 0.16/0.39 thf(f22,plain,(
% 0.16/0.39 $false),
% 0.16/0.39 inference(subsumption_resolution,[],[f21,f12])).
% 0.16/0.39 thf(f12,plain,(
% 0.16/0.39 (sK0 != (f @ sK0))),
% 0.16/0.39 inference(cnf_transformation,[],[f10])).
% 0.16/0.39 thf(f10,plain,(
% 0.16/0.39 ((^[Y0 : $i]: (g @ (f @ Y0))) = (^[Y0 : $i]: (f @ (g @ Y0)))) & (! [X1] : (((g @ X1) != X1) | (sK0 = X1)) & (sK0 != (f @ sK0)) & (sK0 = (g @ sK0)))),
% 0.16/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9])).
% 0.16/0.39 thf(f9,plain,(
% 0.16/0.39 ? [X0] : (! [X1] : (((g @ X1) != X1) | (X0 = X1)) & ((f @ X0) != X0) & ((g @ X0) = X0)) => (! [X1] : (((g @ X1) != X1) | (sK0 = X1)) & (sK0 != (f @ sK0)) & (sK0 = (g @ sK0)))),
% 0.16/0.39 introduced(choice_axiom,[])).
% 0.16/0.39 thf(f8,plain,(
% 0.16/0.39 ((^[Y0 : $i]: (g @ (f @ Y0))) = (^[Y0 : $i]: (f @ (g @ Y0)))) & ? [X0] : (! [X1] : (((g @ X1) != X1) | (X0 = X1)) & ((f @ X0) != X0) & ((g @ X0) = X0))),
% 0.16/0.39 inference(flattening,[],[f7])).
% 0.16/0.39 thf(f7,plain,(
% 0.16/0.39 ? [X0] : (((f @ X0) != X0) & (! [X1] : (((g @ X1) != X1) | (X0 = X1)) & ((g @ X0) = X0))) & ((^[Y0 : $i]: (g @ (f @ Y0))) = (^[Y0 : $i]: (f @ (g @ Y0))))),
% 0.16/0.39 inference(ennf_transformation,[],[f6])).
% 0.16/0.39 thf(f6,plain,(
% 0.16/0.39 ~(((^[Y0 : $i]: (g @ (f @ Y0))) = (^[Y0 : $i]: (f @ (g @ Y0)))) => ! [X0] : ((! [X1] : (((g @ X1) = X1) => (X0 = X1)) & ((g @ X0) = X0)) => ((f @ X0) = X0)))),
% 0.16/0.39 inference(rectify,[],[f5])).
% 0.16/0.39 thf(f5,plain,(
% 0.16/0.39 ~(((^[Y0 : $i]: (g @ (f @ Y0))) = (^[Y0 : $i]: (f @ (g @ Y0)))) => ! [X2] : ((! [X3] : (((g @ X3) = X3) => (X2 = X3)) & ((g @ X2) = X2)) => ((f @ X2) = X2)))),
% 0.16/0.39 inference(fool_elimination,[],[f4])).
% 0.16/0.39 thf(f4,plain,(
% 0.16/0.39 ~(((^[X0 : $i] : (f @ (g @ X0))) = (^[X1 : $i] : (g @ (f @ X1)))) => ! [X2] : ((! [X3] : (((g @ X3) = X3) => (X2 = X3)) & ((g @ X2) = X2)) => ((f @ X2) = X2)))),
% 0.16/0.39 inference(rectify,[],[f2])).
% 0.16/0.39 thf(f2,negated_conjecture,(
% 0.16/0.39 ~(((^[X0 : $i] : (f @ (g @ X0))) = (^[X0 : $i] : (g @ (f @ X0)))) => ! [X0] : ((! [X1] : (((g @ X1) = X1) => (X0 = X1)) & ((g @ X0) = X0)) => ((f @ X0) = X0)))),
% 0.16/0.39 inference(negated_conjecture,[],[f1])).
% 0.16/0.39 thf(f1,conjecture,(
% 0.16/0.39 ((^[X0 : $i] : (f @ (g @ X0))) = (^[X0 : $i] : (g @ (f @ X0)))) => ! [X0] : ((! [X1] : (((g @ X1) = X1) => (X0 = X1)) & ((g @ X0) = X0)) => ((f @ X0) = X0))),
% 0.16/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM171A_pme)).
% 0.16/0.39 thf(f21,plain,(
% 0.16/0.39 (sK0 = (f @ sK0))),
% 0.16/0.39 inference(trivial_inequality_removal,[],[f19])).
% 0.16/0.39 thf(f19,plain,(
% 0.16/0.39 ((f @ sK0) != (f @ sK0)) | (sK0 = (f @ sK0))),
% 0.16/0.39 inference(superposition,[],[f18,f11])).
% 0.16/0.39 thf(f11,plain,(
% 0.16/0.39 (sK0 = (g @ sK0))),
% 0.16/0.39 inference(cnf_transformation,[],[f10])).
% 0.16/0.39 thf(f18,plain,(
% 0.16/0.39 ( ! [X0 : $i] : (((f @ (g @ X0)) != (f @ X0)) | ((f @ X0) = sK0)) )),
% 0.16/0.39 inference(superposition,[],[f13,f17])).
% 0.16/0.39 thf(f17,plain,(
% 0.16/0.39 ( ! [X1 : $i] : (((g @ (f @ X1)) = (f @ (g @ X1)))) )),
% 0.16/0.39 inference(beta_eta_normalization,[],[f16])).
% 0.16/0.39 thf(f16,plain,(
% 0.16/0.39 ( ! [X1 : $i] : ((((^[Y0 : $i]: (f @ (g @ Y0))) @ X1) = ((^[Y0 : $i]: (g @ (f @ Y0))) @ X1))) )),
% 0.16/0.39 inference(argument_congruence,[],[f14])).
% 0.16/0.39 thf(f14,plain,(
% 0.16/0.39 ((^[Y0 : $i]: (g @ (f @ Y0))) = (^[Y0 : $i]: (f @ (g @ Y0))))),
% 0.16/0.39 inference(cnf_transformation,[],[f10])).
% 0.16/0.39 thf(f13,plain,(
% 0.16/0.39 ( ! [X1 : $i] : (((g @ X1) != X1) | (sK0 = X1)) )),
% 0.16/0.39 inference(cnf_transformation,[],[f10])).
% 0.16/0.39 % SZS output end Proof for theBenchmark
% 0.16/0.39 % (11843)------------------------------
% 0.16/0.39 % (11843)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (11843)Termination reason: Refutation
% 0.16/0.39
% 0.16/0.39 % (11843)Memory used [KB]: 5500
% 0.16/0.39 % (11843)Time elapsed: 0.003 s
% 0.16/0.39 % (11843)Instructions burned: 3 (million)
% 0.16/0.39 % (11843)------------------------------
% 0.16/0.39 % (11843)------------------------------
% 0.16/0.39 % (11837)Success in time 0.003 s
% 0.16/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------