TSTP Solution File: SEU650^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU650^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 : n032.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.07s 0.28s
% Output : Refutation 0.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SEU650^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.08 % 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.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Sun May 19 18:00:22 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.07/0.27 This is a TH0_THM_EQU_NAR problem
% 0.07/0.27 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.07/0.28 % (21642)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.07/0.28 % (21636)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.07/0.28 % (21638)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.07/0.28 % (21642)First to succeed.
% 0.07/0.28 % (21636)Also succeeded, but the first one will report.
% 0.07/0.28 % (21642)Refutation found. Thanks to Tanya!
% 0.07/0.28 % SZS status Theorem for theBenchmark
% 0.07/0.28 % SZS output start Proof for theBenchmark
% 0.07/0.28 thf(func_def_1, type, setadjoin: $i > $i > $i).
% 0.07/0.28 thf(f31,plain,(
% 0.07/0.28 $false),
% 0.07/0.28 inference(subsumption_resolution,[],[f30,f29])).
% 0.07/0.28 thf(f29,plain,(
% 0.07/0.28 ( ! [X3 : $i] : (((setadjoin @ X3 @ (setadjoin @ X3 @ emptyset)) = (setadjoin @ X3 @ emptyset))) )),
% 0.07/0.28 inference(trivial_inequality_removal,[],[f28])).
% 0.07/0.28 thf(f28,plain,(
% 0.07/0.28 ( ! [X3 : $i] : (((setadjoin @ X3 @ (setadjoin @ X3 @ emptyset)) = (setadjoin @ X3 @ emptyset)) | ($true != $true)) )),
% 0.07/0.28 inference(equality_resolution,[],[f27])).
% 0.07/0.28 thf(f27,plain,(
% 0.07/0.28 ( ! [X2 : $i,X3 : $i] : (((setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) = (setadjoin @ X2 @ emptyset)) | (X2 != X3) | ($true != $true)) )),
% 0.07/0.28 inference(definition_unfolding,[],[f21,f18])).
% 0.07/0.28 thf(f18,plain,(
% 0.07/0.28 (setukpairinjR11 = $true)),
% 0.07/0.28 inference(cnf_transformation,[],[f13])).
% 0.07/0.28 thf(f13,plain,(
% 0.07/0.28 ((sK0 = sK1) & ((setadjoin @ (setadjoin @ sK0 @ emptyset) @ emptyset) != (setadjoin @ (setadjoin @ sK0 @ emptyset) @ (setadjoin @ (setadjoin @ sK0 @ (setadjoin @ sK1 @ emptyset)) @ emptyset)))) & (setukpairinjR11 = $true)),
% 0.07/0.28 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f11,f12])).
% 0.07/0.28 thf(f12,plain,(
% 0.07/0.28 ? [X0,X1] : ((X0 = X1) & ((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X0 @ emptyset) @ emptyset))) => ((sK0 = sK1) & ((setadjoin @ (setadjoin @ sK0 @ emptyset) @ emptyset) != (setadjoin @ (setadjoin @ sK0 @ emptyset) @ (setadjoin @ (setadjoin @ sK0 @ (setadjoin @ sK1 @ emptyset)) @ emptyset))))),
% 0.07/0.28 introduced(choice_axiom,[])).
% 0.07/0.28 thf(f11,plain,(
% 0.07/0.28 ? [X0,X1] : ((X0 = X1) & ((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ X0 @ emptyset) @ emptyset))) & (setukpairinjR11 = $true)),
% 0.07/0.28 inference(rectify,[],[f10])).
% 0.07/0.28 thf(f10,plain,(
% 0.07/0.28 ? [X1,X0] : ((X0 = X1) & ((setadjoin @ (setadjoin @ X1 @ emptyset) @ emptyset) != (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))) & (setukpairinjR11 = $true)),
% 0.07/0.28 inference(ennf_transformation,[],[f6])).
% 0.07/0.28 thf(f6,plain,(
% 0.07/0.28 ~((setukpairinjR11 = $true) => ! [X1,X0] : ((X0 = X1) => ((setadjoin @ (setadjoin @ X1 @ emptyset) @ emptyset) = (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))))),
% 0.07/0.28 inference(fool_elimination,[],[f5])).
% 0.07/0.28 thf(f5,plain,(
% 0.07/0.28 ~(setukpairinjR11 => ! [X0,X1] : ((X0 = X1) => ((setadjoin @ (setadjoin @ X1 @ emptyset) @ emptyset) = (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)) @ emptyset)))))),
% 0.07/0.28 inference(rectify,[],[f3])).
% 0.07/0.28 thf(f3,negated_conjecture,(
% 0.07/0.28 ~(setukpairinjR11 => ! [X1,X0] : ((X0 = X1) => ((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X0 @ emptyset) @ emptyset))))),
% 0.07/0.28 inference(negated_conjecture,[],[f2])).
% 0.07/0.28 thf(f2,conjecture,(
% 0.07/0.28 setukpairinjR11 => ! [X1,X0] : ((X0 = X1) => ((setadjoin @ (setadjoin @ X0 @ emptyset) @ (setadjoin @ (setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) @ emptyset)) = (setadjoin @ (setadjoin @ X0 @ emptyset) @ emptyset)))),
% 0.07/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjR12)).
% 0.07/0.28 thf(f21,plain,(
% 0.07/0.28 ( ! [X2 : $i,X3 : $i] : (((setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) = (setadjoin @ X2 @ emptyset)) | (X2 != X3) | (setukpairinjR11 != $true)) )),
% 0.07/0.28 inference(cnf_transformation,[],[f17])).
% 0.07/0.28 thf(f17,plain,(
% 0.07/0.28 ((setukpairinjR11 = $true) | (((setadjoin @ sK2 @ (setadjoin @ sK3 @ emptyset)) != (setadjoin @ sK2 @ emptyset)) & (sK2 = sK3))) & (! [X2,X3] : (((setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) = (setadjoin @ X2 @ emptyset)) | (X2 != X3)) | (setukpairinjR11 != $true))),
% 0.07/0.28 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f15,f16])).
% 0.07/0.28 thf(f16,plain,(
% 0.07/0.28 ? [X0,X1] : (((setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) != (setadjoin @ X0 @ emptyset)) & (X0 = X1)) => (((setadjoin @ sK2 @ (setadjoin @ sK3 @ emptyset)) != (setadjoin @ sK2 @ emptyset)) & (sK2 = sK3))),
% 0.07/0.28 introduced(choice_axiom,[])).
% 0.07/0.28 thf(f15,plain,(
% 0.07/0.28 ((setukpairinjR11 = $true) | ? [X0,X1] : (((setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) != (setadjoin @ X0 @ emptyset)) & (X0 = X1))) & (! [X2,X3] : (((setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) = (setadjoin @ X2 @ emptyset)) | (X2 != X3)) | (setukpairinjR11 != $true))),
% 0.07/0.28 inference(rectify,[],[f14])).
% 0.07/0.28 thf(f14,plain,(
% 0.07/0.28 ((setukpairinjR11 = $true) | ? [X1,X0] : (((setadjoin @ X1 @ emptyset) != (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))) & (X0 = X1))) & (! [X1,X0] : (((setadjoin @ X1 @ emptyset) = (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))) | (X0 != X1)) | (setukpairinjR11 != $true))),
% 0.07/0.28 inference(nnf_transformation,[],[f9])).
% 0.07/0.28 thf(f9,plain,(
% 0.07/0.28 (setukpairinjR11 = $true) <=> ! [X1,X0] : (((setadjoin @ X1 @ emptyset) = (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))) | (X0 != X1))),
% 0.07/0.28 inference(ennf_transformation,[],[f8])).
% 0.07/0.28 thf(f8,plain,(
% 0.07/0.28 (setukpairinjR11 = $true) <=> ! [X1,X0] : ((X0 = X1) => ((setadjoin @ X1 @ emptyset) = (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset))))),
% 0.07/0.28 inference(fool_elimination,[],[f7])).
% 0.07/0.28 thf(f7,plain,(
% 0.07/0.28 (! [X0,X1] : ((X0 = X1) => ((setadjoin @ X1 @ emptyset) = (setadjoin @ X1 @ (setadjoin @ X0 @ emptyset)))) = setukpairinjR11)),
% 0.07/0.28 inference(rectify,[],[f1])).
% 0.07/0.28 thf(f1,axiom,(
% 0.07/0.28 (! [X1,X0] : ((X0 = X1) => ((setadjoin @ X0 @ (setadjoin @ X1 @ emptyset)) = (setadjoin @ X0 @ emptyset))) = setukpairinjR11)),
% 0.07/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjR11)).
% 0.07/0.28 thf(f30,plain,(
% 0.07/0.28 ((setadjoin @ (setadjoin @ sK1 @ emptyset) @ (setadjoin @ (setadjoin @ sK1 @ emptyset) @ emptyset)) != (setadjoin @ (setadjoin @ sK1 @ emptyset) @ emptyset))),
% 0.07/0.28 inference(forward_demodulation,[],[f24,f29])).
% 0.07/0.28 thf(f24,plain,(
% 0.07/0.28 ((setadjoin @ (setadjoin @ sK1 @ emptyset) @ (setadjoin @ (setadjoin @ sK1 @ (setadjoin @ sK1 @ emptyset)) @ emptyset)) != (setadjoin @ (setadjoin @ sK1 @ emptyset) @ emptyset))),
% 0.07/0.28 inference(definition_unfolding,[],[f19,f20,f20,f20])).
% 0.07/0.28 thf(f20,plain,(
% 0.07/0.28 (sK0 = sK1)),
% 0.07/0.28 inference(cnf_transformation,[],[f13])).
% 0.07/0.28 thf(f19,plain,(
% 0.07/0.28 ((setadjoin @ (setadjoin @ sK0 @ emptyset) @ emptyset) != (setadjoin @ (setadjoin @ sK0 @ emptyset) @ (setadjoin @ (setadjoin @ sK0 @ (setadjoin @ sK1 @ emptyset)) @ emptyset)))),
% 0.07/0.28 inference(cnf_transformation,[],[f13])).
% 0.07/0.28 % SZS output end Proof for theBenchmark
% 0.07/0.28 % (21642)------------------------------
% 0.07/0.28 % (21642)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.07/0.28 % (21642)Termination reason: Refutation
% 0.07/0.28
% 0.07/0.28 % (21642)Memory used [KB]: 5500
% 0.07/0.28 % (21642)Time elapsed: 0.003 s
% 0.07/0.28 % (21642)Instructions burned: 2 (million)
% 0.07/0.28 % (21642)------------------------------
% 0.07/0.28 % (21642)------------------------------
% 0.07/0.28 % (21635)Success in time 0.002 s
% 0.07/0.28 % Vampire---4.8 exiting
%------------------------------------------------------------------------------