TSTP Solution File: SEU800^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU800^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n028.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.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 : SEU800^2 : TPTP v8.2.0. Released v3.7.0.
% 0.13/0.14 % 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.13/0.34 % Computer : n028.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 : Sun May 19 17:59:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_EQU_NAR problem
% 0.13/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.36 % (1976)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.36 % (1975)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.20/0.36 % (1979)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.20/0.36 % (1977)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.20/0.36 % (1974)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.20/0.37 % (1973)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.20/0.37 % (1978)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.20/0.37 % (1976)Instruction limit reached!
% 0.20/0.37 % (1976)------------------------------
% 0.20/0.37 % (1976)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (1976)Termination reason: Unknown
% 0.20/0.37 % (1976)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (1976)Memory used [KB]: 5500
% 0.20/0.37 % (1977)Instruction limit reached!
% 0.20/0.37 % (1977)------------------------------
% 0.20/0.37 % (1977)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (1977)Termination reason: Unknown
% 0.20/0.37 % (1977)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (1977)Memory used [KB]: 895
% 0.20/0.37 % (1977)Time elapsed: 0.003 s
% 0.20/0.37 % (1977)Instructions burned: 2 (million)
% 0.20/0.37 % (1977)------------------------------
% 0.20/0.37 % (1977)------------------------------
% 0.20/0.37 % (1976)Time elapsed: 0.003 s
% 0.20/0.37 % (1980)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.20/0.37 % (1976)Instructions burned: 3 (million)
% 0.20/0.37 % (1976)------------------------------
% 0.20/0.37 % (1976)------------------------------
% 0.20/0.37 % (1979)First to succeed.
% 0.20/0.37 % (1978)Refutation not found, incomplete strategy
% 0.20/0.37 % (1978)------------------------------
% 0.20/0.37 % (1978)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (1978)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (1978)Memory used [KB]: 5500
% 0.20/0.37 % (1978)Time elapsed: 0.003 s
% 0.20/0.37 % (1978)Instructions burned: 2 (million)
% 0.20/0.37 % (1978)------------------------------
% 0.20/0.37 % (1978)------------------------------
% 0.20/0.37 % (1980)Refutation not found, incomplete strategy
% 0.20/0.37 % (1980)------------------------------
% 0.20/0.37 % (1980)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (1975)Also succeeded, but the first one will report.
% 0.20/0.37 % (1980)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (1980)Memory used [KB]: 5500
% 0.20/0.37 % (1980)Time elapsed: 0.003 s
% 0.20/0.37 % (1980)Instructions burned: 2 (million)
% 0.20/0.37 % (1980)------------------------------
% 0.20/0.37 % (1980)------------------------------
% 0.20/0.37 % (1979)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, in: $i > $i > $o).
% 0.20/0.37 thf(func_def_1, type, dsetconstr: $i > ($i > $o) > $i).
% 0.20/0.37 thf(func_def_4, type, funcSet: $i > $i > $i).
% 0.20/0.37 thf(func_def_5, type, injective: $i > $i > $i > $o).
% 0.20/0.37 thf(func_def_6, type, injFuncSet: $i > $i > $i).
% 0.20/0.37 thf(func_def_15, type, sK2: $i > $o).
% 0.20/0.37 thf(func_def_21, type, ph7: !>[X0: $tType]:(X0)).
% 0.20/0.37 thf(f36,plain,(
% 0.20/0.37 $false),
% 0.20/0.37 inference(subsumption_resolution,[],[f35,f26])).
% 0.20/0.37 thf(f26,plain,(
% 0.20/0.37 ($true != (injective @ sK3 @ sK5 @ sK4))),
% 0.20/0.37 inference(cnf_transformation,[],[f19])).
% 0.20/0.37 thf(f19,plain,(
% 0.20/0.37 (($true != (injective @ sK3 @ sK5 @ sK4)) & ($true = (in @ sK4 @ (injFuncSet @ sK3 @ sK5)))) & (dsetconstrER = $true)),
% 0.20/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f12,f18])).
% 0.20/0.37 thf(f18,plain,(
% 0.20/0.37 ? [X0,X1,X2] : (($true != (injective @ X0 @ X2 @ X1)) & ($true = (in @ X1 @ (injFuncSet @ X0 @ X2)))) => (($true != (injective @ sK3 @ sK5 @ sK4)) & ($true = (in @ sK4 @ (injFuncSet @ sK3 @ sK5))))),
% 0.20/0.37 introduced(choice_axiom,[])).
% 0.20/0.37 thf(f12,plain,(
% 0.20/0.37 ? [X0,X1,X2] : (($true != (injective @ X0 @ X2 @ X1)) & ($true = (in @ X1 @ (injFuncSet @ X0 @ X2)))) & (dsetconstrER = $true)),
% 0.20/0.37 inference(ennf_transformation,[],[f11])).
% 0.20/0.37 thf(f11,plain,(
% 0.20/0.37 ~((dsetconstrER = $true) => ! [X0,X1,X2] : (($true = (in @ X1 @ (injFuncSet @ X0 @ X2))) => ($true = (injective @ X0 @ X2 @ X1))))),
% 0.20/0.37 inference(fool_elimination,[],[f10])).
% 0.20/0.37 thf(f10,plain,(
% 0.20/0.37 ~(dsetconstrER => ! [X0,X1,X2] : ((in @ X1 @ (injFuncSet @ X0 @ X2)) => (injective @ X0 @ X2 @ X1)))),
% 0.20/0.37 inference(rectify,[],[f4])).
% 0.20/0.37 thf(f4,negated_conjecture,(
% 0.20/0.37 ~(dsetconstrER => ! [X2,X5,X3] : ((in @ X5 @ (injFuncSet @ X2 @ X3)) => (injective @ X2 @ X3 @ X5)))),
% 0.20/0.37 inference(negated_conjecture,[],[f3])).
% 0.20/0.37 thf(f3,conjecture,(
% 0.20/0.37 dsetconstrER => ! [X2,X5,X3] : ((in @ X5 @ (injFuncSet @ X2 @ X3)) => (injective @ X2 @ X3 @ X5))),
% 0.20/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',injFuncSetFuncInj)).
% 0.20/0.37 thf(f35,plain,(
% 0.20/0.37 ($true = (injective @ sK3 @ sK5 @ sK4))),
% 0.20/0.37 inference(trivial_inequality_removal,[],[f34])).
% 0.20/0.37 thf(f34,plain,(
% 0.20/0.37 ($true = (injective @ sK3 @ sK5 @ sK4)) | ($true != $true)),
% 0.20/0.37 inference(superposition,[],[f32,f33])).
% 0.20/0.37 thf(f33,plain,(
% 0.20/0.37 ($true = (in @ sK4 @ (dsetconstr @ (funcSet @ sK3 @ sK5) @ (injective @ sK3 @ sK5))))),
% 0.20/0.37 inference(beta_eta_normalization,[],[f30])).
% 0.20/0.37 thf(f30,plain,(
% 0.20/0.37 ($true = (in @ sK4 @ ((^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (funcSet @ Y0 @ Y1) @ (^[Y2 : $i]: (injective @ Y0 @ Y1 @ Y2)))))) @ sK3 @ sK5)))),
% 0.20/0.37 inference(definition_unfolding,[],[f25,f20])).
% 0.20/0.37 thf(f20,plain,(
% 0.20/0.37 (injFuncSet = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (funcSet @ Y0 @ Y1) @ (^[Y2 : $i]: (injective @ Y0 @ Y1 @ Y2)))))))),
% 0.20/0.37 inference(cnf_transformation,[],[f7])).
% 0.20/0.37 thf(f7,plain,(
% 0.20/0.37 (injFuncSet = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (funcSet @ Y0 @ Y1) @ (^[Y2 : $i]: (injective @ Y0 @ Y1 @ Y2)))))))),
% 0.20/0.37 inference(fool_elimination,[],[f6])).
% 0.20/0.37 thf(f6,plain,(
% 0.20/0.37 (injFuncSet = (^[X0 : $i, X1 : $i] : (dsetconstr @ (funcSet @ X0 @ X1) @ (^[X2 : $i] : (injective @ X0 @ X1 @ X2)))))),
% 0.20/0.37 inference(rectify,[],[f2])).
% 0.20/0.37 thf(f2,axiom,(
% 0.20/0.37 (injFuncSet = (^[X0 : $i, X4 : $i] : (dsetconstr @ (funcSet @ X0 @ X4) @ (^[X5 : $i] : (injective @ X0 @ X4 @ X5)))))),
% 0.20/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',injFuncSet)).
% 0.20/0.37 thf(f25,plain,(
% 0.20/0.37 ($true = (in @ sK4 @ (injFuncSet @ sK3 @ sK5)))),
% 0.20/0.37 inference(cnf_transformation,[],[f19])).
% 0.20/0.37 thf(f32,plain,(
% 0.20/0.37 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (($true != (in @ X1 @ (dsetconstr @ X0 @ X2))) | ($true = (X2 @ X1))) )),
% 0.20/0.37 inference(beta_eta_normalization,[],[f31])).
% 0.20/0.37 thf(f31,plain,(
% 0.20/0.37 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (($true = (X2 @ X1)) | ($true != (in @ X1 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X2 @ Y0)))))) )),
% 0.20/0.37 inference(trivial_inequality_removal,[],[f27])).
% 0.20/0.37 thf(f27,plain,(
% 0.20/0.37 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (($true = (X2 @ X1)) | ($true != $true) | ($true != (in @ X1 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X2 @ Y0)))))) )),
% 0.20/0.37 inference(definition_unfolding,[],[f23,f24])).
% 0.20/0.37 thf(f24,plain,(
% 0.20/0.37 (dsetconstrER = $true)),
% 0.20/0.37 inference(cnf_transformation,[],[f19])).
% 0.20/0.37 thf(f23,plain,(
% 0.20/0.37 ( ! [X2 : $i > $o,X0 : $i,X1 : $i] : (($true != (in @ X1 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X2 @ Y0))))) | ($true = (X2 @ X1)) | (dsetconstrER != $true)) )),
% 0.20/0.37 inference(cnf_transformation,[],[f17])).
% 0.20/0.37 thf(f17,plain,(
% 0.20/0.37 (! [X0,X1,X2 : $i > $o] : (($true != (in @ X1 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X2 @ Y0))))) | ($true = (X2 @ X1))) | (dsetconstrER != $true)) & ((dsetconstrER = $true) | (($true = (in @ sK1 @ (dsetconstr @ sK0 @ (^[Y0 : $i]: (sK2 @ Y0))))) & ($true != (sK2 @ sK1))))),
% 0.20/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f15,f16])).
% 0.20/0.37 thf(f16,plain,(
% 0.20/0.37 ? [X3,X4,X5 : $i > $o] : (($true = (in @ X4 @ (dsetconstr @ X3 @ (^[Y0 : $i]: (X5 @ Y0))))) & ($true != (X5 @ X4))) => (($true = (in @ sK1 @ (dsetconstr @ sK0 @ (^[Y0 : $i]: (sK2 @ Y0))))) & ($true != (sK2 @ sK1)))),
% 0.20/0.37 introduced(choice_axiom,[])).
% 0.20/0.37 thf(f15,plain,(
% 0.20/0.37 (! [X0,X1,X2 : $i > $o] : (($true != (in @ X1 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X2 @ Y0))))) | ($true = (X2 @ X1))) | (dsetconstrER != $true)) & ((dsetconstrER = $true) | ? [X3,X4,X5 : $i > $o] : (($true = (in @ X4 @ (dsetconstr @ X3 @ (^[Y0 : $i]: (X5 @ Y0))))) & ($true != (X5 @ X4))))),
% 0.20/0.37 inference(rectify,[],[f14])).
% 0.20/0.37 thf(f14,plain,(
% 0.20/0.37 (! [X0,X1,X2 : $i > $o] : (($true != (in @ X1 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X2 @ Y0))))) | ($true = (X2 @ X1))) | (dsetconstrER != $true)) & ((dsetconstrER = $true) | ? [X0,X1,X2 : $i > $o] : (($true = (in @ X1 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X2 @ Y0))))) & ($true != (X2 @ X1))))),
% 0.20/0.37 inference(nnf_transformation,[],[f13])).
% 0.20/0.37 thf(f13,plain,(
% 0.20/0.37 ! [X0,X1,X2 : $i > $o] : (($true != (in @ X1 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X2 @ Y0))))) | ($true = (X2 @ X1))) <=> (dsetconstrER = $true)),
% 0.20/0.37 inference(ennf_transformation,[],[f9])).
% 0.20/0.37 thf(f9,plain,(
% 0.20/0.37 ! [X0,X1,X2 : $i > $o] : (($true = (in @ X1 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X2 @ Y0))))) => ($true = (X2 @ X1))) <=> (dsetconstrER = $true)),
% 0.20/0.37 inference(fool_elimination,[],[f8])).
% 0.20/0.37 thf(f8,plain,(
% 0.20/0.37 (dsetconstrER = ! [X0,X1,X2 : $i > $o] : ((in @ X1 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X2 @ X3)))) => (X2 @ X1)))),
% 0.20/0.37 inference(rectify,[],[f1])).
% 0.20/0.37 thf(f1,axiom,(
% 0.20/0.37 (dsetconstrER = ! [X0,X2,X1 : $i > $o] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) => (X1 @ X2)))),
% 0.20/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER)).
% 0.20/0.37 % SZS output end Proof for theBenchmark
% 0.20/0.37 % (1979)------------------------------
% 0.20/0.37 % (1979)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (1979)Termination reason: Refutation
% 0.20/0.37
% 0.20/0.37 % (1979)Memory used [KB]: 5500
% 0.20/0.37 % (1979)Time elapsed: 0.004 s
% 0.20/0.37 % (1979)Instructions burned: 3 (million)
% 0.20/0.37 % (1979)------------------------------
% 0.20/0.37 % (1979)------------------------------
% 0.20/0.37 % (1972)Success in time 0.017 s
% 0.20/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------