TSTP Solution File: SEU652^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU652^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 : n024.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:20 EDT 2024
% Result : Theorem 0.10s 0.34s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SEU652^2 : TPTP v8.2.0. Released v3.7.0.
% 0.09/0.12 % 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.10/0.33 % Computer : n024.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33 % CPULimit : 300
% 0.10/0.33 % WCLimit : 300
% 0.10/0.33 % DateTime : Sun May 19 16:41:53 EDT 2024
% 0.10/0.33 % CPUTime :
% 0.10/0.33 This is a TH0_THM_EQU_NAR problem
% 0.10/0.33 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.10/0.34 % (4400)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.10/0.34 % (4402)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 (3000ds/27Mi)
% 0.10/0.34 % (4403)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.10/0.34 % (4403)Instruction limit reached!
% 0.10/0.34 % (4403)------------------------------
% 0.10/0.34 % (4403)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.34 % (4403)Termination reason: Unknown
% 0.10/0.34 % (4403)Termination phase: Saturation
% 0.10/0.34
% 0.10/0.34 % (4403)Memory used [KB]: 5500
% 0.10/0.34 % (4403)Time elapsed: 0.002 s
% 0.10/0.34 % (4403)Instructions burned: 3 (million)
% 0.10/0.34 % (4403)------------------------------
% 0.10/0.34 % (4403)------------------------------
% 0.10/0.34 % (4400)First to succeed.
% 0.10/0.34 % (4400)Refutation found. Thanks to Tanya!
% 0.10/0.34 % SZS status Theorem for theBenchmark
% 0.10/0.34 % SZS output start Proof for theBenchmark
% 0.10/0.34 thf(func_def_0, type, in: $i > $i > $o).
% 0.10/0.34 thf(func_def_2, type, setadjoin: $i > $i > $i).
% 0.10/0.34 thf(f62,plain,(
% 0.10/0.34 $false),
% 0.10/0.34 inference(subsumption_resolution,[],[f58,f23])).
% 0.10/0.34 thf(f23,plain,(
% 0.10/0.34 (sK1 != sK0)),
% 0.10/0.34 inference(cnf_transformation,[],[f18])).
% 0.10/0.34 thf(f18,plain,(
% 0.10/0.34 (secondinupair = $true) & (uniqinunit = $true) & (((setadjoin @ sK0 @ (setadjoin @ sK1 @ emptyset)) = (setadjoin @ sK2 @ emptyset)) & (sK1 != sK0)) & (setadjoinIL = $true)),
% 0.10/0.34 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f16,f17])).
% 0.10/0.34 thf(f17,plain,(
% 0.10/0.34 ? [X0,X1,X2] : (((setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) = (setadjoin @ X2 @ emptyset)) & (X0 != X1)) => (((setadjoin @ sK0 @ (setadjoin @ sK1 @ emptyset)) = (setadjoin @ sK2 @ emptyset)) & (sK1 != sK0))),
% 0.10/0.34 introduced(choice_axiom,[])).
% 0.10/0.34 thf(f16,plain,(
% 0.10/0.34 (secondinupair = $true) & (uniqinunit = $true) & ? [X0,X1,X2] : (((setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) = (setadjoin @ X2 @ emptyset)) & (X0 != X1)) & (setadjoinIL = $true)),
% 0.10/0.34 inference(flattening,[],[f15])).
% 0.10/0.34 thf(f15,plain,(
% 0.10/0.34 ((? [X0,X1,X2] : (((setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) = (setadjoin @ X2 @ emptyset)) & (X0 != X1)) & (secondinupair = $true)) & (uniqinunit = $true)) & (setadjoinIL = $true)),
% 0.10/0.34 inference(ennf_transformation,[],[f8])).
% 0.10/0.34 thf(f8,plain,(
% 0.10/0.34 ~((setadjoinIL = $true) => ((uniqinunit = $true) => ((secondinupair = $true) => ! [X0,X1,X2] : (((setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) = (setadjoin @ X2 @ emptyset)) => (X0 = X1)))))),
% 0.10/0.34 inference(fool_elimination,[],[f7])).
% 0.10/0.34 thf(f7,plain,(
% 0.10/0.34 ~(setadjoinIL => (uniqinunit => (secondinupair => ! [X0,X1,X2] : (((setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) = (setadjoin @ X2 @ emptyset)) => (X0 = X1)))))),
% 0.10/0.34 inference(rectify,[],[f5])).
% 0.10/0.34 thf(f5,negated_conjecture,(
% 0.10/0.34 ~(setadjoinIL => (uniqinunit => (secondinupair => ! [X0,X1,X2] : (((setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) = (setadjoin @ X2 @ emptyset)) => (X0 = X1)))))),
% 0.10/0.34 inference(negated_conjecture,[],[f4])).
% 0.10/0.34 thf(f4,conjecture,(
% 0.10/0.34 setadjoinIL => (uniqinunit => (secondinupair => ! [X0,X1,X2] : (((setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) = (setadjoin @ X2 @ emptyset)) => (X0 = X1))))),
% 0.10/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upairequniteq)).
% 0.10/0.34 thf(f58,plain,(
% 0.10/0.34 (sK1 = sK0)),
% 0.10/0.34 inference(superposition,[],[f57,f50])).
% 0.10/0.34 thf(f50,plain,(
% 0.10/0.34 (sK2 = sK0)),
% 0.10/0.34 inference(trivial_inequality_removal,[],[f48])).
% 0.10/0.34 thf(f48,plain,(
% 0.10/0.34 (sK2 = sK0) | ($true = $false)),
% 0.10/0.34 inference(superposition,[],[f35,f46])).
% 0.10/0.34 thf(f46,plain,(
% 0.10/0.34 ($true = (in @ sK0 @ (setadjoin @ sK2 @ emptyset)))),
% 0.10/0.34 inference(superposition,[],[f39,f24])).
% 0.10/0.34 thf(f24,plain,(
% 0.10/0.34 ((setadjoin @ sK0 @ (setadjoin @ sK1 @ emptyset)) = (setadjoin @ sK2 @ emptyset))),
% 0.10/0.34 inference(cnf_transformation,[],[f18])).
% 0.10/0.34 thf(f39,plain,(
% 0.10/0.34 ( ! [X2 : $i,X1 : $i] : (($true = (in @ X2 @ (setadjoin @ X2 @ X1)))) )),
% 0.10/0.34 inference(beta_eta_normalization,[],[f38])).
% 0.10/0.34 thf(f38,plain,(
% 0.10/0.34 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (in @ Y0 @ (setadjoin @ Y0 @ X1))) @ X2))) )),
% 0.10/0.34 inference(pi_clausification,[],[f37])).
% 0.10/0.34 thf(f37,plain,(
% 0.10/0.34 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: (in @ Y0 @ (setadjoin @ Y0 @ X1)))))) )),
% 0.10/0.34 inference(beta_eta_normalization,[],[f36])).
% 0.10/0.34 thf(f36,plain,(
% 0.10/0.34 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ Y0))))) @ X1))) )),
% 0.10/0.34 inference(pi_clausification,[],[f29])).
% 0.10/0.34 thf(f29,plain,(
% 0.10/0.34 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ Y0)))))))),
% 0.10/0.34 inference(definition_unfolding,[],[f22,f21])).
% 0.10/0.34 thf(f21,plain,(
% 0.10/0.34 (setadjoinIL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ Y0)))))))),
% 0.10/0.34 inference(cnf_transformation,[],[f14])).
% 0.10/0.34 thf(f14,plain,(
% 0.10/0.34 (setadjoinIL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y1 @ Y0)))))))),
% 0.10/0.34 inference(fool_elimination,[],[f13])).
% 0.10/0.34 thf(f13,plain,(
% 0.10/0.34 (! [X0,X1] : (in @ X0 @ (setadjoin @ X0 @ X1)) = setadjoinIL)),
% 0.10/0.34 inference(rectify,[],[f1])).
% 0.10/0.34 thf(f1,axiom,(
% 0.10/0.34 (! [X0,X1] : (in @ X0 @ (setadjoin @ X0 @ X1)) = setadjoinIL)),
% 0.10/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinIL)).
% 0.10/0.34 thf(f22,plain,(
% 0.10/0.34 (setadjoinIL = $true)),
% 0.10/0.34 inference(cnf_transformation,[],[f18])).
% 0.10/0.34 thf(f35,plain,(
% 0.10/0.34 ( ! [X2 : $i,X1 : $i] : (($false = (in @ X2 @ (setadjoin @ X1 @ emptyset))) | (X1 = X2)) )),
% 0.10/0.34 inference(equality_proxy_clausification,[],[f34])).
% 0.10/0.34 thf(f34,plain,(
% 0.10/0.34 ( ! [X2 : $i,X1 : $i] : (((X2 = X1) = $true) | ($false = (in @ X2 @ (setadjoin @ X1 @ emptyset)))) )),
% 0.10/0.34 inference(binary_proxy_clausification,[],[f33])).
% 0.10/0.34 thf(f33,plain,(
% 0.10/0.34 ( ! [X2 : $i,X1 : $i] : ((((in @ X2 @ (setadjoin @ X1 @ emptyset)) => (X2 = X1)) = $true)) )),
% 0.10/0.34 inference(beta_eta_normalization,[],[f32])).
% 0.10/0.34 thf(f32,plain,(
% 0.10/0.34 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((in @ Y0 @ (setadjoin @ X1 @ emptyset)) => (Y0 = X1))) @ X2))) )),
% 0.10/0.34 inference(pi_clausification,[],[f31])).
% 0.10/0.34 thf(f31,plain,(
% 0.10/0.34 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (setadjoin @ X1 @ emptyset)) => (Y0 = X1)))))) )),
% 0.10/0.34 inference(beta_eta_normalization,[],[f30])).
% 0.10/0.34 thf(f30,plain,(
% 0.10/0.34 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (Y1 = Y0))))) @ X1))) )),
% 0.10/0.34 inference(pi_clausification,[],[f28])).
% 0.10/0.34 thf(f28,plain,(
% 0.10/0.34 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (Y1 = Y0)))))))),
% 0.10/0.34 inference(definition_unfolding,[],[f25,f19])).
% 0.10/0.34 thf(f19,plain,(
% 0.10/0.34 (uniqinunit = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (Y1 = Y0)))))))),
% 0.10/0.34 inference(cnf_transformation,[],[f12])).
% 0.10/0.34 thf(f12,plain,(
% 0.10/0.34 (uniqinunit = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (Y1 = Y0)))))))),
% 0.10/0.34 inference(fool_elimination,[],[f11])).
% 0.10/0.34 thf(f11,plain,(
% 0.10/0.34 (uniqinunit = ! [X0,X1] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)))),
% 0.10/0.34 inference(rectify,[],[f2])).
% 0.10/0.34 thf(f2,axiom,(
% 0.10/0.34 (uniqinunit = ! [X0,X1] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)))),
% 0.10/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uniqinunit)).
% 0.10/0.34 thf(f25,plain,(
% 0.10/0.34 (uniqinunit = $true)),
% 0.10/0.34 inference(cnf_transformation,[],[f18])).
% 0.10/0.34 thf(f57,plain,(
% 0.10/0.34 (sK1 = sK2)),
% 0.10/0.34 inference(trivial_inequality_removal,[],[f54])).
% 0.10/0.34 thf(f54,plain,(
% 0.10/0.34 ($true = $false) | (sK1 = sK2)),
% 0.10/0.34 inference(superposition,[],[f52,f35])).
% 0.10/0.34 thf(f52,plain,(
% 0.10/0.34 ((in @ sK1 @ (setadjoin @ sK2 @ emptyset)) = $true)),
% 0.10/0.34 inference(superposition,[],[f43,f24])).
% 0.10/0.34 thf(f43,plain,(
% 0.10/0.34 ( ! [X2 : $i,X1 : $i] : (($true = (in @ X2 @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset))))) )),
% 0.10/0.34 inference(beta_eta_normalization,[],[f42])).
% 0.10/0.34 thf(f42,plain,(
% 0.10/0.34 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: (in @ Y0 @ (setadjoin @ X1 @ (setadjoin @ Y0 @ emptyset)))) @ X2))) )),
% 0.10/0.34 inference(pi_clausification,[],[f41])).
% 0.10/0.34 thf(f41,plain,(
% 0.10/0.34 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: (in @ Y0 @ (setadjoin @ X1 @ (setadjoin @ Y0 @ emptyset))))))) )),
% 0.10/0.34 inference(beta_eta_normalization,[],[f40])).
% 0.10/0.34 thf(f40,plain,(
% 0.10/0.34 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset)))))) @ X1))) )),
% 0.10/0.34 inference(pi_clausification,[],[f27])).
% 0.10/0.34 thf(f27,plain,(
% 0.10/0.34 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset))))))))),
% 0.10/0.34 inference(definition_unfolding,[],[f26,f20])).
% 0.10/0.34 thf(f20,plain,(
% 0.10/0.34 (secondinupair = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset))))))))),
% 0.10/0.34 inference(cnf_transformation,[],[f10])).
% 0.10/0.34 thf(f10,plain,(
% 0.10/0.34 (secondinupair = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (in @ Y1 @ (setadjoin @ Y0 @ (setadjoin @ Y1 @ emptyset))))))))),
% 0.10/0.34 inference(fool_elimination,[],[f9])).
% 0.10/0.34 thf(f9,plain,(
% 0.10/0.34 (! [X0,X1] : (in @ X0 @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))) = secondinupair)),
% 0.10/0.34 inference(rectify,[],[f3])).
% 0.10/0.34 thf(f3,axiom,(
% 0.10/0.34 (! [X1,X0] : (in @ X1 @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset))) = secondinupair)),
% 0.10/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',secondinupair)).
% 0.10/0.34 thf(f26,plain,(
% 0.10/0.34 (secondinupair = $true)),
% 0.10/0.34 inference(cnf_transformation,[],[f18])).
% 0.10/0.34 % SZS output end Proof for theBenchmark
% 0.10/0.34 % (4400)------------------------------
% 0.10/0.34 % (4400)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.10/0.34 % (4400)Termination reason: Refutation
% 0.10/0.34
% 0.10/0.34 % (4400)Memory used [KB]: 5500
% 0.10/0.34 % (4400)Time elapsed: 0.004 s
% 0.10/0.34 % (4400)Instructions burned: 4 (million)
% 0.10/0.34 % (4400)------------------------------
% 0.10/0.34 % (4400)------------------------------
% 0.10/0.34 % (4399)Success in time 0.011 s
% 0.10/0.34 % Vampire---4.8 exiting
%------------------------------------------------------------------------------