TSTP Solution File: SEU714^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU714^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 : n004.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:58 EDT 2024
% Result : Theorem 0.16s 0.40s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SEU714^2 : TPTP v8.2.0. Released v3.7.0.
% 0.13/0.16 % 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.37 % Computer : n004.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Sun May 19 16:15:23 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a TH0_THM_EQU_NAR problem
% 0.16/0.38 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.40 % (23708)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.40 % (23710)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.40 % (23709)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.16/0.40 % (23711)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.40 % (23712)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.40 % (23713)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.40 % (23711)Instruction limit reached!
% 0.16/0.40 % (23711)------------------------------
% 0.16/0.40 % (23711)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (23711)Termination reason: Unknown
% 0.16/0.40 % (23711)Termination phase: Property scanning
% 0.16/0.40
% 0.16/0.40 % (23712)Instruction limit reached!
% 0.16/0.40 % (23712)------------------------------
% 0.16/0.40 % (23712)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (23712)Termination reason: Unknown
% 0.16/0.40 % (23712)Termination phase: Function definition elimination
% 0.16/0.40
% 0.16/0.40 % (23712)Memory used [KB]: 895
% 0.16/0.40 % (23712)Time elapsed: 0.003 s
% 0.16/0.40 % (23712)Instructions burned: 2 (million)
% 0.16/0.40 % (23712)------------------------------
% 0.16/0.40 % (23712)------------------------------
% 0.16/0.40 % (23711)Memory used [KB]: 895
% 0.16/0.40 % (23711)Time elapsed: 0.003 s
% 0.16/0.40 % (23711)Instructions burned: 2 (million)
% 0.16/0.40 % (23711)------------------------------
% 0.16/0.40 % (23711)------------------------------
% 0.16/0.40 % (23709)Instruction limit reached!
% 0.16/0.40 % (23709)------------------------------
% 0.16/0.40 % (23709)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (23709)Termination reason: Unknown
% 0.16/0.40 % (23709)Termination phase: Saturation
% 0.16/0.40
% 0.16/0.40 % (23709)Memory used [KB]: 5500
% 0.16/0.40 % (23709)Time elapsed: 0.005 s
% 0.16/0.40 % (23709)Instructions burned: 4 (million)
% 0.16/0.40 % (23709)------------------------------
% 0.16/0.40 % (23709)------------------------------
% 0.16/0.40 % (23713)First to succeed.
% 0.16/0.40 % (23714)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.16/0.40 % (23708)Also succeeded, but the first one will report.
% 0.16/0.40 % (23713)Refutation found. Thanks to Tanya!
% 0.16/0.40 % SZS status Theorem for theBenchmark
% 0.16/0.40 % SZS output start Proof for theBenchmark
% 0.16/0.40 thf(func_def_0, type, in: $i > $i > $o).
% 0.16/0.40 thf(func_def_1, type, powerset: $i > $i).
% 0.16/0.40 thf(func_def_4, type, setminus: $i > $i > $i).
% 0.16/0.40 thf(func_def_13, type, sK5: $i > $i > $i).
% 0.16/0.40 thf(f59,plain,(
% 0.16/0.40 $false),
% 0.16/0.40 inference(trivial_inequality_removal,[],[f58])).
% 0.16/0.40 thf(f58,plain,(
% 0.16/0.40 ($true != $true)),
% 0.16/0.40 inference(superposition,[],[f31,f56])).
% 0.16/0.40 thf(f56,plain,(
% 0.16/0.40 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (setminus @ X0 @ X1) @ (powerset @ X0)))) )),
% 0.16/0.40 inference(trivial_inequality_removal,[],[f55])).
% 0.16/0.40 thf(f55,plain,(
% 0.16/0.40 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ($true = (in @ (setminus @ X0 @ X1) @ (powerset @ X0)))) )),
% 0.16/0.40 inference(duplicate_literal_removal,[],[f54])).
% 0.16/0.40 thf(f54,plain,(
% 0.16/0.40 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ($true = (in @ (setminus @ X0 @ X1) @ (powerset @ X0))) | ($true = (in @ (setminus @ X0 @ X1) @ (powerset @ X0)))) )),
% 0.16/0.40 inference(superposition,[],[f46,f50])).
% 0.16/0.40 thf(f50,plain,(
% 0.16/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ (sK5 @ X0 @ (setminus @ X1 @ X2)) @ X1)) | ($true = (in @ (setminus @ X1 @ X2) @ (powerset @ X0)))) )),
% 0.16/0.40 inference(trivial_inequality_removal,[],[f48])).
% 0.16/0.40 thf(f48,plain,(
% 0.16/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ (setminus @ X1 @ X2) @ (powerset @ X0))) | ($true = (in @ (sK5 @ X0 @ (setminus @ X1 @ X2)) @ X1)) | ($true != $true)) )),
% 0.16/0.40 inference(superposition,[],[f45,f47])).
% 0.16/0.40 thf(f47,plain,(
% 0.16/0.40 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (sK5 @ X1 @ X0) @ X0)) | ($true = (in @ X0 @ (powerset @ X1)))) )),
% 0.16/0.40 inference(trivial_inequality_removal,[],[f41])).
% 0.16/0.40 thf(f41,plain,(
% 0.16/0.40 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (sK5 @ X1 @ X0) @ X0)) | ($true = (in @ X0 @ (powerset @ X1))) | ($true != $true)) )),
% 0.16/0.40 inference(definition_unfolding,[],[f37,f33])).
% 0.16/0.40 thf(f33,plain,(
% 0.16/0.40 (powersetI = $true)),
% 0.16/0.40 inference(cnf_transformation,[],[f21])).
% 0.16/0.40 thf(f21,plain,(
% 0.16/0.40 (powersetI = $true) & (setminusEL = $true) & (($true != (in @ (setminus @ sK4 @ sK3) @ (powerset @ sK4))) & ($true = (in @ sK3 @ (powerset @ sK4))))),
% 0.16/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f13,f20])).
% 0.16/0.40 thf(f20,plain,(
% 0.16/0.40 ? [X0,X1] : (($true != (in @ (setminus @ X1 @ X0) @ (powerset @ X1))) & ($true = (in @ X0 @ (powerset @ X1)))) => (($true != (in @ (setminus @ sK4 @ sK3) @ (powerset @ sK4))) & ($true = (in @ sK3 @ (powerset @ sK4))))),
% 0.16/0.40 introduced(choice_axiom,[])).
% 0.16/0.40 thf(f13,plain,(
% 0.16/0.40 (powersetI = $true) & (setminusEL = $true) & ? [X0,X1] : (($true != (in @ (setminus @ X1 @ X0) @ (powerset @ X1))) & ($true = (in @ X0 @ (powerset @ X1))))),
% 0.16/0.40 inference(flattening,[],[f12])).
% 0.16/0.40 thf(f12,plain,(
% 0.16/0.40 (? [X0,X1] : (($true != (in @ (setminus @ X1 @ X0) @ (powerset @ X1))) & ($true = (in @ X0 @ (powerset @ X1)))) & (setminusEL = $true)) & (powersetI = $true)),
% 0.16/0.40 inference(ennf_transformation,[],[f11])).
% 0.16/0.40 thf(f11,plain,(
% 0.16/0.40 ~((powersetI = $true) => ((setminusEL = $true) => ! [X0,X1] : (($true = (in @ X0 @ (powerset @ X1))) => ($true = (in @ (setminus @ X1 @ X0) @ (powerset @ X1))))))),
% 0.16/0.40 inference(fool_elimination,[],[f10])).
% 0.16/0.40 thf(f10,plain,(
% 0.16/0.40 ~(powersetI => (setminusEL => ! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => (in @ (setminus @ X1 @ X0) @ (powerset @ X1)))))),
% 0.16/0.40 inference(rectify,[],[f4])).
% 0.16/0.40 thf(f4,negated_conjecture,(
% 0.16/0.40 ~(powersetI => (setminusEL => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => (in @ (setminus @ X0 @ X3) @ (powerset @ X0)))))),
% 0.16/0.40 inference(negated_conjecture,[],[f3])).
% 0.16/0.40 thf(f3,conjecture,(
% 0.16/0.40 powersetI => (setminusEL => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => (in @ (setminus @ X0 @ X3) @ (powerset @ X0))))),
% 0.16/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complementT_lem)).
% 0.16/0.40 thf(f37,plain,(
% 0.16/0.40 ( ! [X0 : $i,X1 : $i] : (($true = (in @ (sK5 @ X1 @ X0) @ X0)) | ($true = (in @ X0 @ (powerset @ X1))) | (powersetI != $true)) )),
% 0.16/0.40 inference(cnf_transformation,[],[f26])).
% 0.16/0.40 thf(f26,plain,(
% 0.16/0.40 (! [X0,X1] : ((($true = (in @ (sK5 @ X1 @ X0) @ X0)) & ($true != (in @ (sK5 @ X1 @ X0) @ X1))) | ($true = (in @ X0 @ (powerset @ X1)))) | (powersetI != $true)) & ((powersetI = $true) | (! [X5] : (($true != (in @ X5 @ sK6)) | ($true = (in @ X5 @ sK7))) & ($true != (in @ sK6 @ (powerset @ sK7)))))),
% 0.16/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f23,f25,f24])).
% 0.16/0.40 thf(f24,plain,(
% 0.16/0.40 ! [X0,X1] : (? [X2] : (((in @ X2 @ X0) = $true) & ((in @ X2 @ X1) != $true)) => (($true = (in @ (sK5 @ X1 @ X0) @ X0)) & ($true != (in @ (sK5 @ X1 @ X0) @ X1))))),
% 0.16/0.40 introduced(choice_axiom,[])).
% 0.16/0.40 thf(f25,plain,(
% 0.16/0.40 ? [X3,X4] : (! [X5] : (($true != (in @ X5 @ X3)) | ($true = (in @ X5 @ X4))) & ($true != (in @ X3 @ (powerset @ X4)))) => (! [X5] : (($true != (in @ X5 @ sK6)) | ($true = (in @ X5 @ sK7))) & ($true != (in @ sK6 @ (powerset @ sK7))))),
% 0.16/0.40 introduced(choice_axiom,[])).
% 0.16/0.40 thf(f23,plain,(
% 0.16/0.40 (! [X0,X1] : (? [X2] : (((in @ X2 @ X0) = $true) & ((in @ X2 @ X1) != $true)) | ($true = (in @ X0 @ (powerset @ X1)))) | (powersetI != $true)) & ((powersetI = $true) | ? [X3,X4] : (! [X5] : (($true != (in @ X5 @ X3)) | ($true = (in @ X5 @ X4))) & ($true != (in @ X3 @ (powerset @ X4)))))),
% 0.16/0.40 inference(rectify,[],[f22])).
% 0.16/0.40 thf(f22,plain,(
% 0.16/0.40 (! [X0,X1] : (? [X2] : (((in @ X2 @ X0) = $true) & ((in @ X2 @ X1) != $true)) | ($true = (in @ X0 @ (powerset @ X1)))) | (powersetI != $true)) & ((powersetI = $true) | ? [X0,X1] : (! [X2] : (((in @ X2 @ X0) != $true) | ((in @ X2 @ X1) = $true)) & ($true != (in @ X0 @ (powerset @ X1)))))),
% 0.16/0.40 inference(nnf_transformation,[],[f15])).
% 0.16/0.40 thf(f15,plain,(
% 0.16/0.40 ! [X0,X1] : (? [X2] : (((in @ X2 @ X0) = $true) & ((in @ X2 @ X1) != $true)) | ($true = (in @ X0 @ (powerset @ X1)))) <=> (powersetI = $true)),
% 0.16/0.40 inference(ennf_transformation,[],[f7])).
% 0.16/0.40 thf(f7,plain,(
% 0.16/0.40 (powersetI = $true) <=> ! [X1,X0] : (! [X2] : (((in @ X2 @ X0) = $true) => ((in @ X2 @ X1) = $true)) => ($true = (in @ X0 @ (powerset @ X1))))),
% 0.16/0.40 inference(fool_elimination,[],[f6])).
% 0.16/0.40 thf(f6,plain,(
% 0.16/0.40 (powersetI = ! [X0,X1] : (! [X2] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (in @ X0 @ (powerset @ X1))))),
% 0.16/0.40 inference(rectify,[],[f1])).
% 0.16/0.40 thf(f1,axiom,(
% 0.16/0.40 (powersetI = ! [X1,X0] : (! [X2] : ((in @ X2 @ X1) => (in @ X2 @ X0)) => (in @ X1 @ (powerset @ X0))))),
% 0.16/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetI)).
% 0.16/0.40 thf(f45,plain,(
% 0.16/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ X0 @ (setminus @ X1 @ X2))) | ($true = (in @ X0 @ X1))) )),
% 0.16/0.40 inference(trivial_inequality_removal,[],[f38])).
% 0.16/0.40 thf(f38,plain,(
% 0.16/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ X0 @ X1)) | ($true != (in @ X0 @ (setminus @ X1 @ X2))) | ($true != $true)) )),
% 0.16/0.40 inference(definition_unfolding,[],[f29,f32])).
% 0.16/0.40 thf(f32,plain,(
% 0.16/0.40 (setminusEL = $true)),
% 0.16/0.40 inference(cnf_transformation,[],[f21])).
% 0.16/0.40 thf(f29,plain,(
% 0.16/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ X0 @ (setminus @ X1 @ X2))) | ($true = (in @ X0 @ X1)) | (setminusEL != $true)) )),
% 0.16/0.40 inference(cnf_transformation,[],[f19])).
% 0.16/0.40 thf(f19,plain,(
% 0.16/0.40 (! [X0,X1,X2] : (($true != (in @ X0 @ (setminus @ X1 @ X2))) | ($true = (in @ X0 @ X1))) | (setminusEL != $true)) & ((setminusEL = $true) | (($true = (in @ sK0 @ (setminus @ sK1 @ sK2))) & ($true != (in @ sK0 @ sK1))))),
% 0.16/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f17,f18])).
% 0.16/0.40 thf(f18,plain,(
% 0.16/0.40 ? [X3,X4,X5] : (($true = (in @ X3 @ (setminus @ X4 @ X5))) & ($true != (in @ X3 @ X4))) => (($true = (in @ sK0 @ (setminus @ sK1 @ sK2))) & ($true != (in @ sK0 @ sK1)))),
% 0.16/0.40 introduced(choice_axiom,[])).
% 0.16/0.40 thf(f17,plain,(
% 0.16/0.40 (! [X0,X1,X2] : (($true != (in @ X0 @ (setminus @ X1 @ X2))) | ($true = (in @ X0 @ X1))) | (setminusEL != $true)) & ((setminusEL = $true) | ? [X3,X4,X5] : (($true = (in @ X3 @ (setminus @ X4 @ X5))) & ($true != (in @ X3 @ X4))))),
% 0.16/0.40 inference(rectify,[],[f16])).
% 0.16/0.40 thf(f16,plain,(
% 0.16/0.40 (! [X0,X1,X2] : (($true != (in @ X0 @ (setminus @ X1 @ X2))) | ($true = (in @ X0 @ X1))) | (setminusEL != $true)) & ((setminusEL = $true) | ? [X0,X1,X2] : (($true = (in @ X0 @ (setminus @ X1 @ X2))) & ($true != (in @ X0 @ X1))))),
% 0.16/0.40 inference(nnf_transformation,[],[f14])).
% 0.16/0.40 thf(f14,plain,(
% 0.16/0.40 ! [X0,X1,X2] : (($true != (in @ X0 @ (setminus @ X1 @ X2))) | ($true = (in @ X0 @ X1))) <=> (setminusEL = $true)),
% 0.16/0.40 inference(ennf_transformation,[],[f9])).
% 0.16/0.40 thf(f9,plain,(
% 0.16/0.40 (setminusEL = $true) <=> ! [X2,X0,X1] : (($true = (in @ X0 @ (setminus @ X1 @ X2))) => ($true = (in @ X0 @ X1)))),
% 0.16/0.40 inference(fool_elimination,[],[f8])).
% 0.16/0.40 thf(f8,plain,(
% 0.16/0.40 (setminusEL = ! [X0,X1,X2] : ((in @ X0 @ (setminus @ X1 @ X2)) => (in @ X0 @ X1)))),
% 0.16/0.40 inference(rectify,[],[f2])).
% 0.16/0.40 thf(f2,axiom,(
% 0.16/0.40 (setminusEL = ! [X2,X0,X1] : ((in @ X2 @ (setminus @ X0 @ X1)) => (in @ X2 @ X0)))),
% 0.16/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusEL)).
% 0.16/0.40 thf(f46,plain,(
% 0.16/0.40 ( ! [X0 : $i,X1 : $i] : (($true != (in @ (sK5 @ X1 @ X0) @ X1)) | ($true = (in @ X0 @ (powerset @ X1)))) )),
% 0.16/0.40 inference(trivial_inequality_removal,[],[f42])).
% 0.16/0.40 thf(f42,plain,(
% 0.16/0.40 ( ! [X0 : $i,X1 : $i] : (($true = (in @ X0 @ (powerset @ X1))) | ($true != (in @ (sK5 @ X1 @ X0) @ X1)) | ($true != $true)) )),
% 0.16/0.40 inference(definition_unfolding,[],[f36,f33])).
% 0.16/0.40 thf(f36,plain,(
% 0.16/0.40 ( ! [X0 : $i,X1 : $i] : (($true != (in @ (sK5 @ X1 @ X0) @ X1)) | ($true = (in @ X0 @ (powerset @ X1))) | (powersetI != $true)) )),
% 0.16/0.40 inference(cnf_transformation,[],[f26])).
% 0.16/0.40 thf(f31,plain,(
% 0.16/0.40 ($true != (in @ (setminus @ sK4 @ sK3) @ (powerset @ sK4)))),
% 0.16/0.40 inference(cnf_transformation,[],[f21])).
% 0.16/0.40 % SZS output end Proof for theBenchmark
% 0.16/0.40 % (23713)------------------------------
% 0.16/0.40 % (23713)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (23713)Termination reason: Refutation
% 0.16/0.40
% 0.16/0.40 % (23713)Memory used [KB]: 5500
% 0.16/0.40 % (23713)Time elapsed: 0.007 s
% 0.16/0.40 % (23713)Instructions burned: 4 (million)
% 0.16/0.40 % (23713)------------------------------
% 0.16/0.40 % (23713)------------------------------
% 0.16/0.40 % (23707)Success in time 0.013 s
% 0.16/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------