TSTP Solution File: SEU801^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU801^2 : 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 : n011.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:51:39 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU801^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/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 : n011.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 : Sun May 19 15:33:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/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.21/0.37 % (10112)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.21/0.37 % (10105)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.21/0.37 % (10106)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.21/0.37 % (10109)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.21/0.37 % (10108)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.37 % (10110)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.21/0.37 % (10108)Instruction limit reached!
% 0.21/0.37 % (10108)------------------------------
% 0.21/0.37 % (10108)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (10108)Termination reason: Unknown
% 0.21/0.37 % (10109)Instruction limit reached!
% 0.21/0.37 % (10109)------------------------------
% 0.21/0.37 % (10109)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (10108)Termination phase: Property scanning
% 0.21/0.37
% 0.21/0.37 % (10108)Memory used [KB]: 895
% 0.21/0.37 % (10108)Time elapsed: 0.003 s
% 0.21/0.37 % (10108)Instructions burned: 2 (million)
% 0.21/0.37 % (10108)------------------------------
% 0.21/0.37 % (10108)------------------------------
% 0.21/0.37 % (10109)Termination reason: Unknown
% 0.21/0.37 % (10109)Termination phase: Clausification
% 0.21/0.37
% 0.21/0.37 % (10109)Memory used [KB]: 895
% 0.21/0.37 % (10109)Time elapsed: 0.003 s
% 0.21/0.37 % (10109)Instructions burned: 2 (million)
% 0.21/0.37 % (10109)------------------------------
% 0.21/0.37 % (10109)------------------------------
% 0.21/0.37 % (10112)Instruction limit reached!
% 0.21/0.37 % (10112)------------------------------
% 0.21/0.37 % (10112)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (10112)Termination reason: Unknown
% 0.21/0.37 % (10112)Termination phase: Saturation
% 0.21/0.37
% 0.21/0.37 % (10112)Memory used [KB]: 5500
% 0.21/0.37 % (10112)Time elapsed: 0.004 s
% 0.21/0.37 % (10112)Instructions burned: 3 (million)
% 0.21/0.37 % (10112)------------------------------
% 0.21/0.37 % (10112)------------------------------
% 0.21/0.37 % (10106)Instruction limit reached!
% 0.21/0.37 % (10106)------------------------------
% 0.21/0.37 % (10106)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (10106)Termination reason: Unknown
% 0.21/0.37 % (10106)Termination phase: Saturation
% 0.21/0.37
% 0.21/0.37 % (10106)Memory used [KB]: 5500
% 0.21/0.37 % (10106)Time elapsed: 0.005 s
% 0.21/0.37 % (10106)Instructions burned: 4 (million)
% 0.21/0.37 % (10106)------------------------------
% 0.21/0.37 % (10106)------------------------------
% 0.21/0.37 % (10110)First to succeed.
% 0.21/0.38 % (10107)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.21/0.38 % (10105)Also succeeded, but the first one will report.
% 0.21/0.38 % (10110)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% 0.21/0.38 thf(func_def_0, type, in: $i > $i > $o).
% 0.21/0.38 thf(func_def_1, type, dsetconstr: $i > ($i > $o) > $i).
% 0.21/0.38 thf(func_def_4, type, funcSet: $i > $i > $i).
% 0.21/0.38 thf(func_def_5, type, ap: $i > $i > $i > $i > $i).
% 0.21/0.38 thf(func_def_6, type, surjective: $i > $i > $i > $o).
% 0.21/0.38 thf(func_def_7, type, surjFuncSet: $i > $i > $i).
% 0.21/0.38 thf(func_def_25, type, sK4: $i > $o).
% 0.21/0.38 thf(func_def_29, type, ph7: !>[X0: $tType]:(X0)).
% 0.21/0.38 thf(f39,plain,(
% 0.21/0.38 $false),
% 0.21/0.38 inference(subsumption_resolution,[],[f38,f25])).
% 0.21/0.38 thf(f25,plain,(
% 0.21/0.38 ((in @ sK2 @ (funcSet @ sK1 @ sK0)) != $true)),
% 0.21/0.38 inference(cnf_transformation,[],[f18])).
% 0.21/0.38 thf(f18,plain,(
% 0.21/0.38 (((in @ sK2 @ (funcSet @ sK1 @ sK0)) != $true) & ($true = (in @ sK2 @ (surjFuncSet @ sK1 @ sK0)))) & (dsetconstrEL = $true)),
% 0.21/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f15,f17])).
% 0.21/0.38 thf(f17,plain,(
% 0.21/0.38 ? [X0,X1,X2] : (((in @ X2 @ (funcSet @ X1 @ X0)) != $true) & ((in @ X2 @ (surjFuncSet @ X1 @ X0)) = $true)) => (((in @ sK2 @ (funcSet @ sK1 @ sK0)) != $true) & ($true = (in @ sK2 @ (surjFuncSet @ sK1 @ sK0))))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f15,plain,(
% 0.21/0.38 ? [X0,X1,X2] : (((in @ X2 @ (funcSet @ X1 @ X0)) != $true) & ((in @ X2 @ (surjFuncSet @ X1 @ X0)) = $true)) & (dsetconstrEL = $true)),
% 0.21/0.38 inference(ennf_transformation,[],[f10])).
% 0.21/0.38 thf(f10,plain,(
% 0.21/0.38 ~((dsetconstrEL = $true) => ! [X0,X1,X2] : (((in @ X2 @ (surjFuncSet @ X1 @ X0)) = $true) => ((in @ X2 @ (funcSet @ X1 @ X0)) = $true)))),
% 0.21/0.38 inference(fool_elimination,[],[f9])).
% 0.21/0.38 thf(f9,plain,(
% 0.21/0.38 ~(dsetconstrEL => ! [X0,X1,X2] : ((in @ X2 @ (surjFuncSet @ X1 @ X0)) => (in @ X2 @ (funcSet @ X1 @ X0))))),
% 0.21/0.38 inference(rectify,[],[f5])).
% 0.21/0.38 thf(f5,negated_conjecture,(
% 0.21/0.38 ~(dsetconstrEL => ! [X4,X0,X5] : ((in @ X5 @ (surjFuncSet @ X0 @ X4)) => (in @ X5 @ (funcSet @ X0 @ X4))))),
% 0.21/0.38 inference(negated_conjecture,[],[f4])).
% 0.21/0.38 thf(f4,conjecture,(
% 0.21/0.38 dsetconstrEL => ! [X4,X0,X5] : ((in @ X5 @ (surjFuncSet @ X0 @ X4)) => (in @ X5 @ (funcSet @ X0 @ X4)))),
% 0.21/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',surjFuncSetFuncIn)).
% 0.21/0.38 thf(f38,plain,(
% 0.21/0.38 ((in @ sK2 @ (funcSet @ sK1 @ sK0)) = $true)),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f37])).
% 0.21/0.38 thf(f37,plain,(
% 0.21/0.38 ($true != $true) | ((in @ sK2 @ (funcSet @ sK1 @ sK0)) = $true)),
% 0.21/0.38 inference(superposition,[],[f35,f36])).
% 0.21/0.38 thf(f36,plain,(
% 0.21/0.38 ((in @ sK2 @ (dsetconstr @ (funcSet @ sK1 @ sK0) @ (surjective @ sK1 @ sK0))) = $true)),
% 0.21/0.38 inference(beta_eta_normalization,[],[f30])).
% 0.21/0.38 thf(f30,plain,(
% 0.21/0.38 ((in @ sK2 @ ((^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (funcSet @ Y0 @ Y1) @ (^[Y2 : $i]: (surjective @ Y0 @ Y1 @ Y2)))))) @ sK1 @ sK0)) = $true)),
% 0.21/0.38 inference(definition_unfolding,[],[f24,f26])).
% 0.21/0.38 thf(f26,plain,(
% 0.21/0.38 (surjFuncSet = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (funcSet @ Y0 @ Y1) @ (^[Y2 : $i]: (surjective @ Y0 @ Y1 @ Y2)))))))),
% 0.21/0.38 inference(cnf_transformation,[],[f14])).
% 0.21/0.38 thf(f14,plain,(
% 0.21/0.38 (surjFuncSet = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (funcSet @ Y0 @ Y1) @ (^[Y2 : $i]: (surjective @ Y0 @ Y1 @ Y2)))))))),
% 0.21/0.38 inference(fool_elimination,[],[f13])).
% 0.21/0.38 thf(f13,plain,(
% 0.21/0.38 (surjFuncSet = (^[X0 : $i, X1 : $i] : (dsetconstr @ (funcSet @ X0 @ X1) @ (^[X2 : $i] : (surjective @ X0 @ X1 @ X2)))))),
% 0.21/0.38 inference(rectify,[],[f3])).
% 0.21/0.38 thf(f3,axiom,(
% 0.21/0.38 (surjFuncSet = (^[X0 : $i, X4 : $i] : (dsetconstr @ (funcSet @ X0 @ X4) @ (^[X5 : $i] : (surjective @ X0 @ X4 @ X5)))))),
% 0.21/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',surjFuncSet)).
% 0.21/0.38 thf(f24,plain,(
% 0.21/0.38 ($true = (in @ sK2 @ (surjFuncSet @ sK1 @ sK0)))),
% 0.21/0.38 inference(cnf_transformation,[],[f18])).
% 0.21/0.38 thf(f35,plain,(
% 0.21/0.38 ( ! [X3 : $i,X4 : $i > $o,X5 : $i] : (((in @ X3 @ (dsetconstr @ X5 @ X4)) != $true) | ((in @ X3 @ X5) = $true)) )),
% 0.21/0.38 inference(beta_eta_normalization,[],[f34])).
% 0.21/0.38 thf(f34,plain,(
% 0.21/0.38 ( ! [X3 : $i,X4 : $i > $o,X5 : $i] : (((in @ X3 @ X5) = $true) | ((in @ X3 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X4 @ Y0)))) != $true)) )),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f33])).
% 0.21/0.38 thf(f33,plain,(
% 0.21/0.38 ( ! [X3 : $i,X4 : $i > $o,X5 : $i] : (((in @ X3 @ X5) = $true) | ($true != $true) | ((in @ X3 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X4 @ Y0)))) != $true)) )),
% 0.21/0.38 inference(definition_unfolding,[],[f27,f23])).
% 0.21/0.38 thf(f23,plain,(
% 0.21/0.38 (dsetconstrEL = $true)),
% 0.21/0.38 inference(cnf_transformation,[],[f18])).
% 0.21/0.38 thf(f27,plain,(
% 0.21/0.38 ( ! [X3 : $i,X4 : $i > $o,X5 : $i] : (((in @ X3 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X4 @ Y0)))) != $true) | ((in @ X3 @ X5) = $true) | (dsetconstrEL != $true)) )),
% 0.21/0.38 inference(cnf_transformation,[],[f22])).
% 0.21/0.38 thf(f22,plain,(
% 0.21/0.38 ((dsetconstrEL = $true) | (((in @ sK3 @ (dsetconstr @ sK5 @ (^[Y0 : $i]: (sK4 @ Y0)))) = $true) & ((in @ sK3 @ sK5) != $true))) & (! [X3,X4 : $i > $o,X5] : (((in @ X3 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X4 @ Y0)))) != $true) | ((in @ X3 @ X5) = $true)) | (dsetconstrEL != $true))),
% 0.21/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f20,f21])).
% 0.21/0.38 thf(f21,plain,(
% 0.21/0.38 ? [X0,X1 : $i > $o,X2] : (((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) = $true) & ((in @ X0 @ X2) != $true)) => (((in @ sK3 @ (dsetconstr @ sK5 @ (^[Y0 : $i]: (sK4 @ Y0)))) = $true) & ((in @ sK3 @ sK5) != $true))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f20,plain,(
% 0.21/0.38 ((dsetconstrEL = $true) | ? [X0,X1 : $i > $o,X2] : (((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) = $true) & ((in @ X0 @ X2) != $true))) & (! [X3,X4 : $i > $o,X5] : (((in @ X3 @ (dsetconstr @ X5 @ (^[Y0 : $i]: (X4 @ Y0)))) != $true) | ((in @ X3 @ X5) = $true)) | (dsetconstrEL != $true))),
% 0.21/0.38 inference(rectify,[],[f19])).
% 0.21/0.38 thf(f19,plain,(
% 0.21/0.38 ((dsetconstrEL = $true) | ? [X0,X1 : $i > $o,X2] : (((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) = $true) & ((in @ X0 @ X2) != $true))) & (! [X0,X1 : $i > $o,X2] : (((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) != $true) | ((in @ X0 @ X2) = $true)) | (dsetconstrEL != $true))),
% 0.21/0.38 inference(nnf_transformation,[],[f16])).
% 0.21/0.38 thf(f16,plain,(
% 0.21/0.38 (dsetconstrEL = $true) <=> ! [X0,X1 : $i > $o,X2] : (((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) != $true) | ((in @ X0 @ X2) = $true))),
% 0.21/0.38 inference(ennf_transformation,[],[f12])).
% 0.21/0.38 thf(f12,plain,(
% 0.21/0.38 ! [X0,X1 : $i > $o,X2] : (((in @ X0 @ (dsetconstr @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))) = $true) => ((in @ X0 @ X2) = $true)) <=> (dsetconstrEL = $true)),
% 0.21/0.38 inference(fool_elimination,[],[f11])).
% 0.21/0.38 thf(f11,plain,(
% 0.21/0.38 (dsetconstrEL = ! [X0,X1 : $i > $o,X2] : ((in @ X0 @ (dsetconstr @ X2 @ (^[X3 : $i] : (X1 @ X3)))) => (in @ X0 @ X2)))),
% 0.21/0.38 inference(rectify,[],[f1])).
% 0.21/0.38 thf(f1,axiom,(
% 0.21/0.38 (dsetconstrEL = ! [X2,X1 : $i > $o,X0] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) => (in @ X2 @ X0)))),
% 0.21/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrEL)).
% 0.21/0.38 % SZS output end Proof for theBenchmark
% 0.21/0.38 % (10110)------------------------------
% 0.21/0.38 % (10110)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (10110)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (10110)Memory used [KB]: 5500
% 0.21/0.38 % (10110)Time elapsed: 0.006 s
% 0.21/0.38 % (10110)Instructions burned: 3 (million)
% 0.21/0.38 % (10110)------------------------------
% 0.21/0.38 % (10110)------------------------------
% 0.21/0.38 % (10104)Success in time 0.008 s
% 0.21/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------