TSTP Solution File: SEU641^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU641^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 : n022.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:50:15 EDT 2024
% Result : Theorem 0.15s 0.40s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU641^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/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.15/0.35 % Computer : n022.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 18:17:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/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/sandbox/benchmark/theBenchmark.p
% 0.15/0.39 % (25509)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.15/0.39 % (25512)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.39 % (25510)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.15/0.39 % (25511)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.15/0.39 % (25513)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.15/0.39 % (25515)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.39 % (25514)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.15/0.39 % (25512)Instruction limit reached!
% 0.15/0.39 % (25512)------------------------------
% 0.15/0.39 % (25512)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (25512)Termination reason: Unknown
% 0.15/0.39 % (25512)Termination phase: Property scanning
% 0.15/0.39
% 0.15/0.39 % (25512)Memory used [KB]: 895
% 0.15/0.39 % (25512)Time elapsed: 0.004 s
% 0.15/0.39 % (25512)Instructions burned: 2 (million)
% 0.15/0.39 % (25512)------------------------------
% 0.15/0.39 % (25512)------------------------------
% 0.15/0.39 % (25516)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.15/0.39 % (25513)Instruction limit reached!
% 0.15/0.39 % (25513)------------------------------
% 0.15/0.39 % (25513)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (25513)Termination reason: Unknown
% 0.15/0.39 % (25513)Termination phase: Function definition elimination
% 0.15/0.39
% 0.15/0.39 % (25513)Memory used [KB]: 895
% 0.15/0.39 % (25513)Time elapsed: 0.004 s
% 0.15/0.39 % (25513)Instructions burned: 2 (million)
% 0.15/0.39 % (25513)------------------------------
% 0.15/0.39 % (25513)------------------------------
% 0.15/0.40 % (25509)First to succeed.
% 0.15/0.40 % (25516)Refutation not found, incomplete strategy
% 0.15/0.40 % (25516)------------------------------
% 0.15/0.40 % (25516)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (25516)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.40
% 0.15/0.40
% 0.15/0.40 % (25516)Memory used [KB]: 5500
% 0.15/0.40 % (25516)Time elapsed: 0.005 s
% 0.15/0.40 % (25516)Instructions burned: 2 (million)
% 0.15/0.40 % (25516)------------------------------
% 0.15/0.40 % (25516)------------------------------
% 0.15/0.40 % (25514)Also succeeded, but the first one will report.
% 0.15/0.40 % (25509)Refutation found. Thanks to Tanya!
% 0.15/0.40 % SZS status Theorem for theBenchmark
% 0.15/0.40 % SZS output start Proof for theBenchmark
% 0.15/0.40 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.40 thf(func_def_2, type, setadjoin: $i > $i > $i).
% 0.15/0.40 thf(f42,plain,(
% 0.15/0.40 $false),
% 0.15/0.40 inference(subsumption_resolution,[],[f41,f19])).
% 0.15/0.40 thf(f19,plain,(
% 0.15/0.40 (sK0 != sK1)),
% 0.15/0.40 inference(cnf_transformation,[],[f15])).
% 0.15/0.40 thf(f15,plain,(
% 0.15/0.40 (((setadjoin @ sK1 @ emptyset) = (setadjoin @ sK0 @ emptyset)) & (sK0 != sK1)) & (uniqinunit = $true) & (setadjoinIL = $true)),
% 0.15/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f13,f14])).
% 0.15/0.40 thf(f14,plain,(
% 0.15/0.40 ? [X0,X1] : (((setadjoin @ X1 @ emptyset) = (setadjoin @ X0 @ emptyset)) & (X0 != X1)) => (((setadjoin @ sK1 @ emptyset) = (setadjoin @ sK0 @ emptyset)) & (sK0 != sK1))),
% 0.15/0.40 introduced(choice_axiom,[])).
% 0.15/0.40 thf(f13,plain,(
% 0.15/0.40 ? [X0,X1] : (((setadjoin @ X1 @ emptyset) = (setadjoin @ X0 @ emptyset)) & (X0 != X1)) & (uniqinunit = $true) & (setadjoinIL = $true)),
% 0.15/0.40 inference(flattening,[],[f12])).
% 0.15/0.40 thf(f12,plain,(
% 0.15/0.40 (? [X0,X1] : (((setadjoin @ X1 @ emptyset) = (setadjoin @ X0 @ emptyset)) & (X0 != X1)) & (uniqinunit = $true)) & (setadjoinIL = $true)),
% 0.15/0.40 inference(ennf_transformation,[],[f7])).
% 0.15/0.40 thf(f7,plain,(
% 0.15/0.40 ~((setadjoinIL = $true) => ((uniqinunit = $true) => ! [X0,X1] : (((setadjoin @ X1 @ emptyset) = (setadjoin @ X0 @ emptyset)) => (X0 = X1))))),
% 0.15/0.40 inference(fool_elimination,[],[f6])).
% 0.15/0.40 thf(f6,plain,(
% 0.15/0.40 ~(setadjoinIL => (uniqinunit => ! [X0,X1] : (((setadjoin @ X1 @ emptyset) = (setadjoin @ X0 @ emptyset)) => (X0 = X1))))),
% 0.15/0.40 inference(rectify,[],[f4])).
% 0.15/0.40 thf(f4,negated_conjecture,(
% 0.15/0.40 ~(setadjoinIL => (uniqinunit => ! [X1,X0] : (((setadjoin @ X1 @ emptyset) = (setadjoin @ X0 @ emptyset)) => (X0 = X1))))),
% 0.15/0.40 inference(negated_conjecture,[],[f3])).
% 0.15/0.40 thf(f3,conjecture,(
% 0.15/0.40 setadjoinIL => (uniqinunit => ! [X1,X0] : (((setadjoin @ X1 @ emptyset) = (setadjoin @ X0 @ emptyset)) => (X0 = X1)))),
% 0.15/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',singletonsuniq)).
% 0.15/0.40 thf(f41,plain,(
% 0.15/0.40 (sK0 = sK1)),
% 0.15/0.40 inference(trivial_inequality_removal,[],[f39])).
% 0.15/0.40 thf(f39,plain,(
% 0.15/0.40 (sK0 = sK1) | ($true = $false)),
% 0.15/0.40 inference(superposition,[],[f34,f29])).
% 0.15/0.40 thf(f29,plain,(
% 0.15/0.40 ( ! [X2 : $i,X1 : $i] : (($false = (in @ X2 @ (setadjoin @ X1 @ emptyset))) | (X1 = X2)) )),
% 0.15/0.40 inference(equality_proxy_clausification,[],[f28])).
% 0.15/0.40 thf(f28,plain,(
% 0.15/0.40 ( ! [X2 : $i,X1 : $i] : (($false = (in @ X2 @ (setadjoin @ X1 @ emptyset))) | ($true = (X2 = X1))) )),
% 0.15/0.40 inference(binary_proxy_clausification,[],[f27])).
% 0.15/0.40 thf(f27,plain,(
% 0.15/0.40 ( ! [X2 : $i,X1 : $i] : (($true = ((in @ X2 @ (setadjoin @ X1 @ emptyset)) => (X2 = X1)))) )),
% 0.15/0.40 inference(beta_eta_normalization,[],[f26])).
% 0.15/0.40 thf(f26,plain,(
% 0.15/0.40 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((in @ Y0 @ (setadjoin @ X1 @ emptyset)) => (Y0 = X1))) @ X2) = $true)) )),
% 0.15/0.40 inference(pi_clausification,[],[f25])).
% 0.15/0.40 thf(f25,plain,(
% 0.15/0.40 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (setadjoin @ X1 @ emptyset)) => (Y0 = X1)))))) )),
% 0.15/0.40 inference(beta_eta_normalization,[],[f24])).
% 0.15/0.40 thf(f24,plain,(
% 0.15/0.40 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (Y1 = Y0))))) @ X1))) )),
% 0.15/0.40 inference(pi_clausification,[],[f22])).
% 0.15/0.40 thf(f22,plain,(
% 0.15/0.40 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (Y1 = Y0)))))))),
% 0.15/0.40 inference(definition_unfolding,[],[f18,f16])).
% 0.15/0.40 thf(f16,plain,(
% 0.15/0.40 (uniqinunit = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (Y1 = Y0)))))))),
% 0.15/0.40 inference(cnf_transformation,[],[f11])).
% 0.15/0.40 thf(f11,plain,(
% 0.15/0.40 (uniqinunit = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (Y1 = Y0)))))))),
% 0.15/0.40 inference(fool_elimination,[],[f10])).
% 0.15/0.40 thf(f10,plain,(
% 0.15/0.40 (uniqinunit = ! [X0,X1] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)))),
% 0.15/0.40 inference(rectify,[],[f2])).
% 0.15/0.40 thf(f2,axiom,(
% 0.15/0.40 (uniqinunit = ! [X0,X1] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)))),
% 0.15/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',uniqinunit)).
% 0.15/0.40 thf(f18,plain,(
% 0.15/0.40 (uniqinunit = $true)),
% 0.15/0.40 inference(cnf_transformation,[],[f15])).
% 0.15/0.40 thf(f34,plain,(
% 0.15/0.40 ($true = (in @ sK1 @ (setadjoin @ sK0 @ emptyset)))),
% 0.15/0.40 inference(superposition,[],[f33,f20])).
% 0.15/0.40 thf(f20,plain,(
% 0.15/0.40 ((setadjoin @ sK1 @ emptyset) = (setadjoin @ sK0 @ emptyset))),
% 0.15/0.40 inference(cnf_transformation,[],[f15])).
% 0.15/0.40 thf(f33,plain,(
% 0.15/0.40 ( ! [X2 : $i,X1 : $i] : (($true = (in @ X2 @ (setadjoin @ X2 @ X1)))) )),
% 0.15/0.40 inference(beta_eta_normalization,[],[f32])).
% 0.15/0.40 thf(f32,plain,(
% 0.15/0.40 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (in @ Y0 @ (setadjoin @ Y0 @ X1))) @ X2))) )),
% 0.15/0.40 inference(pi_clausification,[],[f31])).
% 0.15/0.40 thf(f31,plain,(
% 0.15/0.40 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: (in @ Y0 @ (setadjoin @ Y0 @ X1)))))) )),
% 0.15/0.40 inference(beta_eta_normalization,[],[f30])).
% 0.15/0.40 thf(f30,plain,(
% 0.15/0.40 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ Y0))))) @ X1))) )),
% 0.15/0.40 inference(pi_clausification,[],[f23])).
% 0.15/0.40 thf(f23,plain,(
% 0.15/0.40 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ Y0)))))))),
% 0.15/0.40 inference(definition_unfolding,[],[f21,f17])).
% 0.15/0.40 thf(f17,plain,(
% 0.15/0.40 (setadjoinIL = $true)),
% 0.15/0.40 inference(cnf_transformation,[],[f15])).
% 0.15/0.40 thf(f21,plain,(
% 0.15/0.40 (setadjoinIL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ Y0)))))))),
% 0.15/0.40 inference(cnf_transformation,[],[f9])).
% 0.15/0.40 thf(f9,plain,(
% 0.15/0.40 (setadjoinIL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ Y0)))))))),
% 0.15/0.40 inference(fool_elimination,[],[f8])).
% 0.15/0.40 thf(f8,plain,(
% 0.15/0.40 (! [X0,X1] : (in @ X0 @ (setadjoin @ X0 @ X1)) = setadjoinIL)),
% 0.15/0.40 inference(rectify,[],[f1])).
% 0.15/0.40 thf(f1,axiom,(
% 0.15/0.40 (! [X0,X1] : (in @ X0 @ (setadjoin @ X0 @ X1)) = setadjoinIL)),
% 0.15/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinIL)).
% 0.15/0.40 % SZS output end Proof for theBenchmark
% 0.15/0.40 % (25509)------------------------------
% 0.15/0.40 % (25509)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (25509)Termination reason: Refutation
% 0.15/0.40
% 0.15/0.40 % (25509)Memory used [KB]: 5500
% 0.15/0.40 % (25509)Time elapsed: 0.009 s
% 0.15/0.40 % (25509)Instructions burned: 3 (million)
% 0.15/0.40 % (25509)------------------------------
% 0.15/0.40 % (25509)------------------------------
% 0.15/0.40 % (25508)Success in time 0.031 s
% 0.15/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------