TSTP Solution File: SEU603^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU603^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 : 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:49:54 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU603^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/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.14/0.36 % Computer : n028.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 15:36:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 % (7974)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.14/0.38 % (7977)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.14/0.38 % (7973)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.14/0.38 % (7975)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.14/0.38 % (7978)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.14/0.38 % (7979)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.38 % (7980)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.14/0.38 % (7976)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.38 % (7977)Instruction limit reached!
% 0.14/0.38 % (7977)------------------------------
% 0.14/0.38 % (7977)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (7977)Termination reason: Unknown
% 0.14/0.38 % (7977)Termination phase: Property scanning
% 0.14/0.38
% 0.14/0.38 % (7977)Memory used [KB]: 895
% 0.14/0.38 % (7977)Time elapsed: 0.003 s
% 0.14/0.38 % (7977)Instructions burned: 2 (million)
% 0.14/0.38 % (7977)------------------------------
% 0.14/0.38 % (7977)------------------------------
% 0.14/0.38 % (7976)Instruction limit reached!
% 0.14/0.38 % (7976)------------------------------
% 0.14/0.38 % (7976)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (7976)Termination reason: Unknown
% 0.14/0.38 % (7976)Termination phase: Function definition elimination
% 0.14/0.38
% 0.14/0.38 % (7976)Memory used [KB]: 895
% 0.14/0.38 % (7976)Time elapsed: 0.003 s
% 0.14/0.38 % (7976)Instructions burned: 2 (million)
% 0.14/0.38 % (7976)------------------------------
% 0.14/0.38 % (7976)------------------------------
% 0.14/0.38 % (7978)Refutation not found, incomplete strategy
% 0.14/0.38 % (7978)------------------------------
% 0.14/0.38 % (7978)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (7978)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (7978)Memory used [KB]: 5500
% 0.14/0.38 % (7978)Time elapsed: 0.004 s
% 0.14/0.38 % (7978)Instructions burned: 2 (million)
% 0.14/0.38 % (7978)------------------------------
% 0.14/0.38 % (7978)------------------------------
% 0.14/0.38 % (7980)Refutation not found, incomplete strategy
% 0.14/0.38 % (7980)------------------------------
% 0.14/0.38 % (7980)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (7980)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (7980)Memory used [KB]: 5500
% 0.14/0.38 % (7980)Time elapsed: 0.004 s
% 0.14/0.38 % (7980)Instructions burned: 2 (million)
% 0.14/0.38 % (7980)------------------------------
% 0.14/0.38 % (7980)------------------------------
% 0.14/0.38 % (7979)First to succeed.
% 0.14/0.38 % (7974)Instruction limit reached!
% 0.14/0.38 % (7974)------------------------------
% 0.14/0.38 % (7974)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (7974)Termination reason: Unknown
% 0.14/0.38 % (7974)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (7974)Memory used [KB]: 5500
% 0.14/0.38 % (7974)Time elapsed: 0.006 s
% 0.14/0.38 % (7974)Instructions burned: 4 (million)
% 0.14/0.38 % (7974)------------------------------
% 0.14/0.38 % (7974)------------------------------
% 0.14/0.38 % (7973)Also succeeded, but the first one will report.
% 0.14/0.38 % (7979)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% 0.14/0.38 thf(func_def_0, type, in: $i > $i > $o).
% 0.14/0.38 thf(func_def_1, type, dsetconstr: $i > ($i > $o) > $i).
% 0.14/0.38 thf(func_def_4, type, setminus: $i > $i > $i).
% 0.14/0.38 thf(func_def_16, type, sK5: $i > $o).
% 0.14/0.38 thf(func_def_18, type, ph7: !>[X0: $tType]:(X0)).
% 0.14/0.38 thf(f40,plain,(
% 0.14/0.38 $false),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f39])).
% 0.14/0.38 thf(f39,plain,(
% 0.14/0.38 ($true = $false)),
% 0.14/0.38 inference(backward_demodulation,[],[f22,f38])).
% 0.14/0.38 thf(f38,plain,(
% 0.14/0.38 ((in @ sK1 @ sK2) = $false)),
% 0.14/0.38 inference(not_proxy_clausification,[],[f37])).
% 0.14/0.38 thf(f37,plain,(
% 0.14/0.38 ($true = (~ (in @ sK1 @ sK2)))),
% 0.14/0.38 inference(beta_eta_normalization,[],[f36])).
% 0.14/0.38 thf(f36,plain,(
% 0.14/0.38 ($true = ((^[Y0 : $i]: (~ (in @ Y0 @ sK2))) @ sK1))),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f35])).
% 0.14/0.38 thf(f35,plain,(
% 0.14/0.38 ($true = ((^[Y0 : $i]: (~ (in @ Y0 @ sK2))) @ sK1)) | ($true != $true)),
% 0.14/0.38 inference(superposition,[],[f33,f34])).
% 0.14/0.38 thf(f34,plain,(
% 0.14/0.38 ((in @ sK1 @ (dsetconstr @ sK0 @ (^[Y0 : $i]: (~ (in @ Y0 @ sK2))))) = $true)),
% 0.14/0.38 inference(beta_eta_normalization,[],[f28])).
% 0.14/0.38 thf(f28,plain,(
% 0.14/0.38 ($true = (in @ sK1 @ ((^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ Y0 @ (^[Y2 : $i]: (~ (in @ Y2 @ Y1))))))) @ sK0 @ sK2)))),
% 0.14/0.38 inference(definition_unfolding,[],[f21,f27])).
% 0.14/0.38 thf(f27,plain,(
% 0.14/0.38 (setminus = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ Y0 @ (^[Y2 : $i]: (~ (in @ Y2 @ Y1))))))))),
% 0.14/0.38 inference(cnf_transformation,[],[f7])).
% 0.14/0.38 thf(f7,plain,(
% 0.14/0.38 (setminus = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ Y0 @ (^[Y2 : $i]: (~ (in @ Y2 @ Y1))))))))),
% 0.14/0.38 inference(fool_elimination,[],[f6])).
% 0.14/0.38 thf(f6,plain,(
% 0.14/0.38 ((^[X0 : $i, X1 : $i] : (dsetconstr @ X0 @ (^[X2 : $i] : (~(in @ X2 @ X1))))) = setminus)),
% 0.14/0.38 inference(rectify,[],[f2])).
% 0.14/0.38 thf(f2,axiom,(
% 0.14/0.38 ((^[X0 : $i, X4 : $i] : (dsetconstr @ X0 @ (^[X2 : $i] : (~(in @ X2 @ X4))))) = setminus)),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminus)).
% 0.14/0.38 thf(f21,plain,(
% 0.14/0.38 ($true = (in @ sK1 @ (setminus @ sK0 @ sK2)))),
% 0.14/0.38 inference(cnf_transformation,[],[f16])).
% 0.14/0.38 thf(f16,plain,(
% 0.14/0.38 (dsetconstrER = $true) & (((in @ sK1 @ sK2) = $true) & ($true = (in @ sK1 @ (setminus @ sK0 @ sK2))))),
% 0.14/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f14,f15])).
% 0.14/0.38 thf(f15,plain,(
% 0.14/0.38 ? [X0,X1,X2] : (((in @ X1 @ X2) = $true) & ((in @ X1 @ (setminus @ X0 @ X2)) = $true)) => (((in @ sK1 @ sK2) = $true) & ($true = (in @ sK1 @ (setminus @ sK0 @ sK2))))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f14,plain,(
% 0.14/0.38 (dsetconstrER = $true) & ? [X0,X1,X2] : (((in @ X1 @ X2) = $true) & ((in @ X1 @ (setminus @ X0 @ X2)) = $true))),
% 0.14/0.38 inference(ennf_transformation,[],[f12])).
% 0.14/0.38 thf(f12,plain,(
% 0.14/0.38 ~((dsetconstrER = $true) => ! [X0,X1,X2] : (((in @ X1 @ (setminus @ X0 @ X2)) = $true) => ((in @ X1 @ X2) != $true)))),
% 0.14/0.38 inference(flattening,[],[f11])).
% 0.14/0.38 thf(f11,plain,(
% 0.14/0.38 ~((dsetconstrER = $true) => ! [X0,X1,X2] : (((in @ X1 @ (setminus @ X0 @ X2)) = $true) => ~((in @ X1 @ X2) = $true)))),
% 0.14/0.38 inference(fool_elimination,[],[f10])).
% 0.14/0.38 thf(f10,plain,(
% 0.14/0.38 ~(dsetconstrER => ! [X0,X1,X2] : ((in @ X1 @ (setminus @ X0 @ X2)) => ~(in @ X1 @ X2)))),
% 0.14/0.38 inference(rectify,[],[f4])).
% 0.14/0.38 thf(f4,negated_conjecture,(
% 0.14/0.38 ~(dsetconstrER => ! [X0,X2,X4] : ((in @ X2 @ (setminus @ X0 @ X4)) => ~(in @ X2 @ X4)))),
% 0.14/0.38 inference(negated_conjecture,[],[f3])).
% 0.14/0.38 thf(f3,conjecture,(
% 0.14/0.38 dsetconstrER => ! [X0,X2,X4] : ((in @ X2 @ (setminus @ X0 @ X4)) => ~(in @ X2 @ X4))),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusER)).
% 0.14/0.38 thf(f33,plain,(
% 0.14/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i > $o] : (((in @ X4 @ (dsetconstr @ X3 @ X5)) != $true) | ((X5 @ X4) = $true)) )),
% 0.14/0.38 inference(beta_eta_normalization,[],[f32])).
% 0.14/0.38 thf(f32,plain,(
% 0.14/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i > $o] : (($true != (in @ X4 @ (dsetconstr @ X3 @ (^[Y0 : $i]: (X5 @ Y0))))) | ((X5 @ X4) = $true)) )),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f31])).
% 0.14/0.38 thf(f31,plain,(
% 0.14/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i > $o] : (((X5 @ X4) = $true) | ($true != (in @ X4 @ (dsetconstr @ X3 @ (^[Y0 : $i]: (X5 @ Y0))))) | ($true != $true)) )),
% 0.14/0.38 inference(definition_unfolding,[],[f24,f23])).
% 0.14/0.38 thf(f23,plain,(
% 0.14/0.38 (dsetconstrER = $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f16])).
% 0.14/0.38 thf(f24,plain,(
% 0.14/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i > $o] : (($true != (in @ X4 @ (dsetconstr @ X3 @ (^[Y0 : $i]: (X5 @ Y0))))) | ((X5 @ X4) = $true) | (dsetconstrER != $true)) )),
% 0.14/0.38 inference(cnf_transformation,[],[f20])).
% 0.14/0.38 thf(f20,plain,(
% 0.14/0.38 ((dsetconstrER = $true) | (((in @ sK4 @ (dsetconstr @ sK3 @ (^[Y0 : $i]: (sK5 @ Y0)))) = $true) & ((sK5 @ sK4) != $true))) & (! [X3,X4,X5 : $i > $o] : (($true != (in @ X4 @ (dsetconstr @ X3 @ (^[Y0 : $i]: (X5 @ Y0))))) | ((X5 @ X4) = $true)) | (dsetconstrER != $true))),
% 0.14/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f18,f19])).
% 0.14/0.38 thf(f19,plain,(
% 0.14/0.38 ? [X0,X1,X2 : $i > $o] : (((in @ X1 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X2 @ Y0)))) = $true) & ($true != (X2 @ X1))) => (((in @ sK4 @ (dsetconstr @ sK3 @ (^[Y0 : $i]: (sK5 @ Y0)))) = $true) & ((sK5 @ sK4) != $true))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f18,plain,(
% 0.14/0.38 ((dsetconstrER = $true) | ? [X0,X1,X2 : $i > $o] : (((in @ X1 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X2 @ Y0)))) = $true) & ($true != (X2 @ X1)))) & (! [X3,X4,X5 : $i > $o] : (($true != (in @ X4 @ (dsetconstr @ X3 @ (^[Y0 : $i]: (X5 @ Y0))))) | ((X5 @ X4) = $true)) | (dsetconstrER != $true))),
% 0.14/0.38 inference(rectify,[],[f17])).
% 0.14/0.38 thf(f17,plain,(
% 0.14/0.38 ((dsetconstrER = $true) | ? [X0,X1,X2 : $i > $o] : (((in @ X1 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X2 @ Y0)))) = $true) & ($true != (X2 @ X1)))) & (! [X0,X1,X2 : $i > $o] : (((in @ X1 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X2 @ Y0)))) != $true) | ($true = (X2 @ X1))) | (dsetconstrER != $true))),
% 0.14/0.38 inference(nnf_transformation,[],[f13])).
% 0.14/0.38 thf(f13,plain,(
% 0.14/0.38 (dsetconstrER = $true) <=> ! [X0,X1,X2 : $i > $o] : (((in @ X1 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X2 @ Y0)))) != $true) | ($true = (X2 @ X1)))),
% 0.14/0.38 inference(ennf_transformation,[],[f9])).
% 0.14/0.38 thf(f9,plain,(
% 0.14/0.38 ! [X0,X1,X2 : $i > $o] : (((in @ X1 @ (dsetconstr @ X0 @ (^[Y0 : $i]: (X2 @ Y0)))) = $true) => ($true = (X2 @ X1))) <=> (dsetconstrER = $true)),
% 0.14/0.38 inference(fool_elimination,[],[f8])).
% 0.14/0.38 thf(f8,plain,(
% 0.14/0.38 (dsetconstrER = ! [X0,X1,X2 : $i > $o] : ((in @ X1 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X2 @ X3)))) => (X2 @ X1)))),
% 0.14/0.38 inference(rectify,[],[f1])).
% 0.14/0.38 thf(f1,axiom,(
% 0.14/0.38 (dsetconstrER = ! [X0,X2,X1 : $i > $o] : ((in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))) => (X1 @ X2)))),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrER)).
% 0.14/0.38 thf(f22,plain,(
% 0.14/0.38 ((in @ sK1 @ sK2) = $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f16])).
% 0.14/0.38 % SZS output end Proof for theBenchmark
% 0.14/0.38 % (7979)------------------------------
% 0.14/0.38 % (7979)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (7979)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (7979)Memory used [KB]: 5500
% 0.14/0.38 % (7979)Time elapsed: 0.006 s
% 0.14/0.38 % (7979)Instructions burned: 2 (million)
% 0.14/0.38 % (7979)------------------------------
% 0.14/0.38 % (7979)------------------------------
% 0.14/0.38 % (7969)Success in time 0.009 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------