TSTP Solution File: SEU530^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU530^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 : n005.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:23 EDT 2024
% Result : Theorem 0.16s 0.39s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SEU530^2 : TPTP v8.2.0. Released v3.7.0.
% 0.13/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.16/0.36 % Computer : n005.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sun May 19 18:13:53 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a TH0_THM_EQU_NAR problem
% 0.16/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.16/0.38 % (23831)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.16/0.38 % (23833)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.16/0.38 % (23835)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.16/0.38 % (23834)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.38 % (23836)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.16/0.38 % (23839)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.16/0.38 % (23835)Instruction limit reached!
% 0.16/0.38 % (23835)------------------------------
% 0.16/0.38 % (23835)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (23835)Termination reason: Unknown
% 0.16/0.38 % (23835)Termination phase: Property scanning
% 0.16/0.38
% 0.16/0.38 % (23835)Memory used [KB]: 895
% 0.16/0.38 % (23835)Time elapsed: 0.003 s
% 0.16/0.38 % (23835)Instructions burned: 2 (million)
% 0.16/0.38 % (23835)------------------------------
% 0.16/0.38 % (23835)------------------------------
% 0.16/0.38 % (23834)Instruction limit reached!
% 0.16/0.38 % (23834)------------------------------
% 0.16/0.38 % (23834)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (23834)Termination reason: Unknown
% 0.16/0.38 % (23834)Termination phase: Saturation
% 0.16/0.38
% 0.16/0.38 % (23834)Memory used [KB]: 5373
% 0.16/0.38 % (23834)Time elapsed: 0.003 s
% 0.16/0.38 % (23834)Instructions burned: 2 (million)
% 0.16/0.38 % (23834)------------------------------
% 0.16/0.38 % (23834)------------------------------
% 0.16/0.39 % (23831)First to succeed.
% 0.16/0.39 % (23839)Refutation not found, incomplete strategy
% 0.16/0.39 % (23839)------------------------------
% 0.16/0.39 % (23839)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (23839)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.39
% 0.16/0.39
% 0.16/0.39 % (23839)Memory used [KB]: 5500
% 0.16/0.39 % (23839)Time elapsed: 0.004 s
% 0.16/0.39 % (23839)Instructions burned: 2 (million)
% 0.16/0.39 % (23839)------------------------------
% 0.16/0.39 % (23839)------------------------------
% 0.16/0.39 % (23836)Also succeeded, but the first one will report.
% 0.16/0.39 % (23831)Refutation found. Thanks to Tanya!
% 0.16/0.39 % SZS status Theorem for theBenchmark
% 0.16/0.39 % SZS output start Proof for theBenchmark
% 0.16/0.39 thf(func_def_0, type, in: $i > $i > $o).
% 0.16/0.39 thf(func_def_2, type, setadjoin: $i > $i > $i).
% 0.16/0.39 thf(f43,plain,(
% 0.16/0.39 $false),
% 0.16/0.39 inference(subsumption_resolution,[],[f42,f41])).
% 0.16/0.39 thf(f41,plain,(
% 0.16/0.39 ((in @ sK0 @ (setadjoin @ sK0 @ emptyset)) != $true)),
% 0.16/0.39 inference(superposition,[],[f19,f40])).
% 0.16/0.39 thf(f40,plain,(
% 0.16/0.39 (sK0 = sK1)),
% 0.16/0.39 inference(trivial_inequality_removal,[],[f36])).
% 0.16/0.39 thf(f36,plain,(
% 0.16/0.39 ($true = $false) | (sK0 = sK1)),
% 0.16/0.39 inference(superposition,[],[f29,f18])).
% 0.16/0.39 thf(f18,plain,(
% 0.16/0.39 ((in @ sK0 @ (setadjoin @ sK1 @ emptyset)) = $true)),
% 0.16/0.39 inference(cnf_transformation,[],[f15])).
% 0.16/0.39 thf(f15,plain,(
% 0.16/0.39 (uniqinunit = $true) & (((in @ sK1 @ (setadjoin @ sK0 @ emptyset)) != $true) & ((in @ sK0 @ (setadjoin @ sK1 @ emptyset)) = $true)) & (eqinunit = $true)),
% 0.16/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f13,f14])).
% 0.16/0.39 thf(f14,plain,(
% 0.16/0.39 ? [X0,X1] : (((in @ X1 @ (setadjoin @ X0 @ emptyset)) != $true) & ((in @ X0 @ (setadjoin @ X1 @ emptyset)) = $true)) => (((in @ sK1 @ (setadjoin @ sK0 @ emptyset)) != $true) & ((in @ sK0 @ (setadjoin @ sK1 @ emptyset)) = $true))),
% 0.16/0.39 introduced(choice_axiom,[])).
% 0.16/0.39 thf(f13,plain,(
% 0.16/0.39 (uniqinunit = $true) & ? [X0,X1] : (((in @ X1 @ (setadjoin @ X0 @ emptyset)) != $true) & ((in @ X0 @ (setadjoin @ X1 @ emptyset)) = $true)) & (eqinunit = $true)),
% 0.16/0.39 inference(flattening,[],[f12])).
% 0.16/0.39 thf(f12,plain,(
% 0.16/0.39 (? [X0,X1] : (((in @ X1 @ (setadjoin @ X0 @ emptyset)) != $true) & ((in @ X0 @ (setadjoin @ X1 @ emptyset)) = $true)) & (eqinunit = $true)) & (uniqinunit = $true)),
% 0.16/0.39 inference(ennf_transformation,[],[f9])).
% 0.16/0.39 thf(f9,plain,(
% 0.16/0.39 ~((uniqinunit = $true) => ((eqinunit = $true) => ! [X0,X1] : (((in @ X0 @ (setadjoin @ X1 @ emptyset)) = $true) => ((in @ X1 @ (setadjoin @ X0 @ emptyset)) = $true))))),
% 0.16/0.39 inference(fool_elimination,[],[f8])).
% 0.16/0.39 thf(f8,plain,(
% 0.16/0.39 ~(uniqinunit => (eqinunit => ! [X0,X1] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (in @ X1 @ (setadjoin @ X0 @ emptyset)))))),
% 0.16/0.39 inference(rectify,[],[f4])).
% 0.16/0.39 thf(f4,negated_conjecture,(
% 0.16/0.39 ~(uniqinunit => (eqinunit => ! [X0,X1] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (in @ X1 @ (setadjoin @ X0 @ emptyset)))))),
% 0.16/0.39 inference(negated_conjecture,[],[f3])).
% 0.16/0.39 thf(f3,conjecture,(
% 0.16/0.39 uniqinunit => (eqinunit => ! [X0,X1] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (in @ X1 @ (setadjoin @ X0 @ emptyset))))),
% 0.16/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singletonsswitch)).
% 0.16/0.39 thf(f29,plain,(
% 0.16/0.39 ( ! [X2 : $i,X1 : $i] : (((in @ X2 @ (setadjoin @ X1 @ emptyset)) = $false) | (X1 = X2)) )),
% 0.16/0.39 inference(equality_proxy_clausification,[],[f28])).
% 0.16/0.39 thf(f28,plain,(
% 0.16/0.39 ( ! [X2 : $i,X1 : $i] : (((X2 = X1) = $true) | ((in @ X2 @ (setadjoin @ X1 @ emptyset)) = $false)) )),
% 0.16/0.39 inference(binary_proxy_clausification,[],[f27])).
% 0.16/0.39 thf(f27,plain,(
% 0.16/0.39 ( ! [X2 : $i,X1 : $i] : (($true = ((in @ X2 @ (setadjoin @ X1 @ emptyset)) => (X2 = X1)))) )),
% 0.16/0.39 inference(beta_eta_normalization,[],[f26])).
% 0.16/0.39 thf(f26,plain,(
% 0.16/0.39 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((in @ Y0 @ (setadjoin @ X1 @ emptyset)) => (Y0 = X1))) @ X2) = $true)) )),
% 0.16/0.39 inference(pi_clausification,[],[f25])).
% 0.16/0.39 thf(f25,plain,(
% 0.16/0.39 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (setadjoin @ X1 @ emptyset)) => (Y0 = X1)))) = $true)) )),
% 0.16/0.39 inference(beta_eta_normalization,[],[f24])).
% 0.16/0.39 thf(f24,plain,(
% 0.16/0.39 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (Y1 = Y0))))) @ X1) = $true)) )),
% 0.16/0.39 inference(pi_clausification,[],[f23])).
% 0.16/0.39 thf(f23,plain,(
% 0.16/0.39 ((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (Y1 = Y0)))))) = $true)),
% 0.16/0.39 inference(definition_unfolding,[],[f21,f20])).
% 0.16/0.39 thf(f20,plain,(
% 0.16/0.39 (uniqinunit = $true)),
% 0.16/0.39 inference(cnf_transformation,[],[f15])).
% 0.16/0.39 thf(f21,plain,(
% 0.16/0.39 (uniqinunit = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (Y1 = Y0)))))))),
% 0.16/0.39 inference(cnf_transformation,[],[f11])).
% 0.16/0.39 thf(f11,plain,(
% 0.16/0.39 (uniqinunit = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y1 @ (setadjoin @ Y0 @ emptyset)) => (Y1 = Y0)))))))),
% 0.16/0.39 inference(fool_elimination,[],[f10])).
% 0.16/0.39 thf(f10,plain,(
% 0.16/0.39 (! [X0,X1] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)) = uniqinunit)),
% 0.16/0.39 inference(rectify,[],[f1])).
% 0.16/0.39 thf(f1,axiom,(
% 0.16/0.39 (! [X0,X1] : ((in @ X0 @ (setadjoin @ X1 @ emptyset)) => (X0 = X1)) = uniqinunit)),
% 0.16/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uniqinunit)).
% 0.16/0.39 thf(f19,plain,(
% 0.16/0.39 ((in @ sK1 @ (setadjoin @ sK0 @ emptyset)) != $true)),
% 0.16/0.39 inference(cnf_transformation,[],[f15])).
% 0.16/0.39 thf(f42,plain,(
% 0.16/0.39 ((in @ sK0 @ (setadjoin @ sK0 @ emptyset)) = $true)),
% 0.16/0.39 inference(superposition,[],[f18,f40])).
% 0.16/0.39 % SZS output end Proof for theBenchmark
% 0.16/0.39 % (23831)------------------------------
% 0.16/0.39 % (23831)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (23831)Termination reason: Refutation
% 0.16/0.39
% 0.16/0.39 % (23831)Memory used [KB]: 5500
% 0.16/0.39 % (23831)Time elapsed: 0.006 s
% 0.16/0.39 % (23831)Instructions burned: 3 (million)
% 0.16/0.39 % (23831)------------------------------
% 0.16/0.39 % (23831)------------------------------
% 0.16/0.39 % (23828)Success in time 0.017 s
% 0.16/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------