TSTP Solution File: SEU633^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU633^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 : n026.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:09 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU633^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 : n026.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 16:50:53 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.38 % (7951)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.15/0.38 % (7952)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 (3000ds/4Mi)
% 0.15/0.38 % (7954)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.38 % (7953)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.15/0.38 % (7955)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 (3000ds/2Mi)
% 0.15/0.38 % (7957)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.38 % (7956)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 (3000ds/275Mi)
% 0.15/0.38 % (7954)Instruction limit reached!
% 0.15/0.38 % (7954)------------------------------
% 0.15/0.38 % (7954)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (7954)Termination reason: Unknown
% 0.15/0.38 % (7954)Termination phase: Preprocessing 3
% 0.15/0.38 % (7955)Instruction limit reached!
% 0.15/0.38 % (7955)------------------------------
% 0.15/0.38 % (7955)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (7955)Termination reason: Unknown
% 0.15/0.38 % (7955)Termination phase: Property scanning
% 0.15/0.38
% 0.15/0.38 % (7955)Memory used [KB]: 895
% 0.15/0.38 % (7958)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.15/0.38 % (7955)Time elapsed: 0.003 s
% 0.15/0.38 % (7955)Instructions burned: 2 (million)
% 0.15/0.38 % (7955)------------------------------
% 0.15/0.38 % (7955)------------------------------
% 0.15/0.38
% 0.15/0.38 % (7954)Memory used [KB]: 895
% 0.15/0.38 % (7954)Time elapsed: 0.003 s
% 0.15/0.38 % (7954)Instructions burned: 2 (million)
% 0.15/0.38 % (7954)------------------------------
% 0.15/0.38 % (7954)------------------------------
% 0.15/0.38 % (7952)Instruction limit reached!
% 0.15/0.38 % (7952)------------------------------
% 0.15/0.38 % (7952)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (7952)Termination reason: Unknown
% 0.15/0.38 % (7952)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (7952)Memory used [KB]: 5500
% 0.15/0.38 % (7952)Time elapsed: 0.005 s
% 0.15/0.38 % (7952)Instructions burned: 4 (million)
% 0.15/0.38 % (7952)------------------------------
% 0.15/0.38 % (7952)------------------------------
% 0.15/0.38 % (7958)Refutation not found, incomplete strategy
% 0.15/0.38 % (7958)------------------------------
% 0.15/0.38 % (7958)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (7958)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % (7958)Memory used [KB]: 5500
% 0.15/0.38 % (7958)Time elapsed: 0.004 s
% 0.15/0.38 % (7958)Instructions burned: 2 (million)
% 0.15/0.38 % (7958)------------------------------
% 0.15/0.38 % (7958)------------------------------
% 0.15/0.38 % (7956)First to succeed.
% 0.15/0.38 % (7957)Also succeeded, but the first one will report.
% 0.15/0.38 % (7956)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% 0.15/0.38 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.38 thf(func_def_1, type, setunion: $i > $i).
% 0.15/0.38 thf(func_def_9, type, sK3: $o > $i > $i > $i).
% 0.15/0.38 thf(f54,plain,(
% 0.15/0.38 $false),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f48])).
% 0.15/0.38 thf(f48,plain,(
% 0.15/0.38 ($true != $true)),
% 0.15/0.38 inference(superposition,[],[f39,f45])).
% 0.15/0.38 thf(f45,plain,(
% 0.15/0.38 ( ! [X0 : $o] : (($true = X0)) )),
% 0.15/0.38 inference(subsumption_resolution,[],[f44,f26])).
% 0.15/0.38 thf(f26,plain,(
% 0.15/0.38 ((in @ sK4 @ (setunion @ sK5)) = $true)),
% 0.15/0.38 inference(cnf_transformation,[],[f19])).
% 0.15/0.38 thf(f19,plain,(
% 0.15/0.38 (setunionE = $true) & (! [X2] : (($true != (in @ sK4 @ X2)) | ($true != (in @ X2 @ sK5))) & ((in @ sK4 @ (setunion @ sK5)) = $true))),
% 0.15/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f9,f18])).
% 0.15/0.38 thf(f18,plain,(
% 0.15/0.38 ? [X0,X1] : (! [X2] : (($true != (in @ X0 @ X2)) | ($true != (in @ X2 @ X1))) & ($true = (in @ X0 @ (setunion @ X1)))) => (! [X2] : (($true != (in @ sK4 @ X2)) | ($true != (in @ X2 @ sK5))) & ((in @ sK4 @ (setunion @ sK5)) = $true))),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f9,plain,(
% 0.15/0.38 (setunionE = $true) & ? [X0,X1] : (! [X2] : (($true != (in @ X0 @ X2)) | ($true != (in @ X2 @ X1))) & ($true = (in @ X0 @ (setunion @ X1))))),
% 0.15/0.38 inference(ennf_transformation,[],[f8])).
% 0.15/0.38 thf(f8,plain,(
% 0.15/0.38 ~((setunionE = $true) => ! [X0,X1] : (($true = (in @ X0 @ (setunion @ X1))) => ? [X2] : (($true = (in @ X2 @ X1)) & ($true = (in @ X0 @ X2)))))),
% 0.15/0.38 inference(fool_elimination,[],[f7])).
% 0.15/0.38 thf(f7,plain,(
% 0.15/0.38 ~(setunionE => ! [X0,X1] : ((in @ X0 @ (setunion @ X1)) => ? [X2] : ((in @ X0 @ X2) & (in @ X2 @ X1))))),
% 0.15/0.38 inference(rectify,[],[f3])).
% 0.15/0.38 thf(f3,negated_conjecture,(
% 0.15/0.38 ~(setunionE => ! [X1,X0] : ((in @ X1 @ (setunion @ X0)) => ? [X4] : ((in @ X1 @ X4) & (in @ X4 @ X0))))),
% 0.15/0.38 inference(negated_conjecture,[],[f2])).
% 0.15/0.38 thf(f2,conjecture,(
% 0.15/0.38 setunionE => ! [X1,X0] : ((in @ X1 @ (setunion @ X0)) => ? [X4] : ((in @ X1 @ X4) & (in @ X4 @ X0)))),
% 0.15/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionE2)).
% 0.15/0.38 thf(f44,plain,(
% 0.15/0.38 ( ! [X0 : $o] : (((in @ sK4 @ (setunion @ sK5)) != $true) | ($true = X0)) )),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f43])).
% 0.15/0.38 thf(f43,plain,(
% 0.15/0.38 ( ! [X0 : $o] : (((in @ sK4 @ (setunion @ sK5)) != $true) | ($true = X0) | ($true != $true)) )),
% 0.15/0.38 inference(duplicate_literal_removal,[],[f42])).
% 0.15/0.38 thf(f42,plain,(
% 0.15/0.38 ( ! [X0 : $o] : (($true = X0) | ($true = X0) | ((in @ sK4 @ (setunion @ sK5)) != $true) | ($true != $true) | ((in @ sK4 @ (setunion @ sK5)) != $true)) )),
% 0.15/0.38 inference(superposition,[],[f41,f36])).
% 0.15/0.38 thf(f36,plain,(
% 0.15/0.38 ( ! [X6 : $o,X4 : $i,X5 : $i] : (($true = (in @ (sK3 @ X6 @ X5 @ X4) @ X4)) | ($true = X6) | ($true != (in @ X5 @ (setunion @ X4)))) )),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f34])).
% 0.15/0.38 thf(f34,plain,(
% 0.15/0.38 ( ! [X6 : $o,X4 : $i,X5 : $i] : (($true = (in @ (sK3 @ X6 @ X5 @ X4) @ X4)) | ($true != (in @ X5 @ (setunion @ X4))) | ($true = X6) | ($true != $true)) )),
% 0.15/0.38 inference(definition_unfolding,[],[f20,f28])).
% 0.15/0.38 thf(f28,plain,(
% 0.15/0.38 (setunionE = $true)),
% 0.15/0.38 inference(cnf_transformation,[],[f19])).
% 0.15/0.38 thf(f20,plain,(
% 0.15/0.38 ( ! [X6 : $o,X4 : $i,X5 : $i] : (($true = X6) | ($true = (in @ (sK3 @ X6 @ X5 @ X4) @ X4)) | ($true != (in @ X5 @ (setunion @ X4))) | (setunionE != $true)) )),
% 0.15/0.38 inference(cnf_transformation,[],[f17])).
% 0.15/0.38 thf(f17,plain,(
% 0.15/0.38 ((setunionE = $true) | ((($true != sK2) & ! [X3] : (($true != (in @ sK1 @ X3)) | ($true = sK2) | ((in @ X3 @ sK0) != $true))) & ($true = (in @ sK1 @ (setunion @ sK0))))) & (! [X4,X5] : (! [X6 : $o] : (($true = X6) | (($true = (in @ X5 @ (sK3 @ X6 @ X5 @ X4))) & ($true != X6) & ($true = (in @ (sK3 @ X6 @ X5 @ X4) @ X4)))) | ($true != (in @ X5 @ (setunion @ X4)))) | (setunionE != $true))),
% 0.15/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f13,f16,f15,f14])).
% 0.15/0.38 thf(f14,plain,(
% 0.15/0.38 ? [X0,X1] : (? [X2 : $o] : (($true != X2) & ! [X3] : (((in @ X1 @ X3) != $true) | ($true = X2) | ((in @ X3 @ X0) != $true))) & ((in @ X1 @ (setunion @ X0)) = $true)) => (? [X2 : $o] : (($true != X2) & ! [X3] : (($true != (in @ sK1 @ X3)) | ($true = X2) | ((in @ X3 @ sK0) != $true))) & ($true = (in @ sK1 @ (setunion @ sK0))))),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f15,plain,(
% 0.15/0.38 ? [X2 : $o] : (($true != X2) & ! [X3] : (($true != (in @ sK1 @ X3)) | ($true = X2) | ((in @ X3 @ sK0) != $true))) => (($true != sK2) & ! [X3] : (($true != (in @ sK1 @ X3)) | ($true = sK2) | ((in @ X3 @ sK0) != $true)))),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f16,plain,(
% 0.15/0.38 ! [X4,X5,X6 : $o] : (? [X7] : (((in @ X5 @ X7) = $true) & ($true != X6) & ((in @ X7 @ X4) = $true)) => (($true = (in @ X5 @ (sK3 @ X6 @ X5 @ X4))) & ($true != X6) & ($true = (in @ (sK3 @ X6 @ X5 @ X4) @ X4))))),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f13,plain,(
% 0.15/0.38 ((setunionE = $true) | ? [X0,X1] : (? [X2 : $o] : (($true != X2) & ! [X3] : (((in @ X1 @ X3) != $true) | ($true = X2) | ((in @ X3 @ X0) != $true))) & ((in @ X1 @ (setunion @ X0)) = $true))) & (! [X4,X5] : (! [X6 : $o] : (($true = X6) | ? [X7] : (((in @ X5 @ X7) = $true) & ($true != X6) & ((in @ X7 @ X4) = $true))) | ($true != (in @ X5 @ (setunion @ X4)))) | (setunionE != $true))),
% 0.15/0.38 inference(rectify,[],[f12])).
% 0.15/0.38 thf(f12,plain,(
% 0.15/0.38 ((setunionE = $true) | ? [X0,X1] : (? [X2 : $o] : (($true != X2) & ! [X3] : (((in @ X1 @ X3) != $true) | ($true = X2) | ((in @ X3 @ X0) != $true))) & ((in @ X1 @ (setunion @ X0)) = $true))) & (! [X0,X1] : (! [X2 : $o] : (($true = X2) | ? [X3] : (((in @ X1 @ X3) = $true) & ($true != X2) & ((in @ X3 @ X0) = $true))) | ((in @ X1 @ (setunion @ X0)) != $true)) | (setunionE != $true))),
% 0.15/0.38 inference(nnf_transformation,[],[f11])).
% 0.15/0.38 thf(f11,plain,(
% 0.15/0.38 (setunionE = $true) <=> ! [X0,X1] : (! [X2 : $o] : (($true = X2) | ? [X3] : (((in @ X1 @ X3) = $true) & ($true != X2) & ((in @ X3 @ X0) = $true))) | ((in @ X1 @ (setunion @ X0)) != $true))),
% 0.15/0.38 inference(flattening,[],[f10])).
% 0.15/0.38 thf(f10,plain,(
% 0.15/0.38 ! [X0,X1] : (! [X2 : $o] : (($true = X2) | ? [X3] : ((($true != X2) & ((in @ X3 @ X0) = $true)) & ((in @ X1 @ X3) = $true))) | ((in @ X1 @ (setunion @ X0)) != $true)) <=> (setunionE = $true)),
% 0.15/0.38 inference(ennf_transformation,[],[f6])).
% 0.15/0.38 thf(f6,plain,(
% 0.15/0.38 ! [X0,X1] : (((in @ X1 @ (setunion @ X0)) = $true) => ! [X2 : $o] : (! [X3] : (((in @ X1 @ X3) = $true) => (((in @ X3 @ X0) = $true) => ($true = X2))) => ($true = X2))) <=> (setunionE = $true)),
% 0.15/0.38 inference(fool_elimination,[],[f5])).
% 0.15/0.38 thf(f5,plain,(
% 0.15/0.38 (setunionE = ! [X0,X1] : ((in @ X1 @ (setunion @ X0)) => ! [X2 : $o] : (! [X3] : ((in @ X1 @ X3) => ((in @ X3 @ X0) => X2)) => X2)))),
% 0.15/0.38 inference(rectify,[],[f1])).
% 0.15/0.38 thf(f1,axiom,(
% 0.15/0.38 (setunionE = ! [X0,X1] : ((in @ X1 @ (setunion @ X0)) => ! [X2 : $o] : (! [X3] : ((in @ X1 @ X3) => ((in @ X3 @ X0) => X2)) => X2)))),
% 0.15/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionE)).
% 0.15/0.38 thf(f41,plain,(
% 0.15/0.38 ( ! [X0 : $o,X1 : $i] : (($true != (in @ (sK3 @ X0 @ sK4 @ X1) @ sK5)) | ($true != (in @ sK4 @ (setunion @ X1))) | ($true = X0)) )),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f40])).
% 0.15/0.38 thf(f40,plain,(
% 0.15/0.38 ( ! [X0 : $o,X1 : $i] : (($true != $true) | ($true != (in @ (sK3 @ X0 @ sK4 @ X1) @ sK5)) | ($true = X0) | ($true != (in @ sK4 @ (setunion @ X1)))) )),
% 0.15/0.38 inference(superposition,[],[f27,f37])).
% 0.15/0.38 thf(f37,plain,(
% 0.15/0.38 ( ! [X6 : $o,X4 : $i,X5 : $i] : (($true = (in @ X5 @ (sK3 @ X6 @ X5 @ X4))) | ($true = X6) | ($true != (in @ X5 @ (setunion @ X4)))) )),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f32])).
% 0.15/0.38 thf(f32,plain,(
% 0.15/0.38 ( ! [X6 : $o,X4 : $i,X5 : $i] : (($true != (in @ X5 @ (setunion @ X4))) | ($true = X6) | ($true = (in @ X5 @ (sK3 @ X6 @ X5 @ X4))) | ($true != $true)) )),
% 0.15/0.38 inference(definition_unfolding,[],[f22,f28])).
% 0.15/0.38 thf(f22,plain,(
% 0.15/0.38 ( ! [X6 : $o,X4 : $i,X5 : $i] : (($true = X6) | ($true = (in @ X5 @ (sK3 @ X6 @ X5 @ X4))) | ($true != (in @ X5 @ (setunion @ X4))) | (setunionE != $true)) )),
% 0.15/0.38 inference(cnf_transformation,[],[f17])).
% 0.15/0.38 thf(f27,plain,(
% 0.15/0.38 ( ! [X2 : $i] : (($true != (in @ sK4 @ X2)) | ($true != (in @ X2 @ sK5))) )),
% 0.15/0.38 inference(cnf_transformation,[],[f19])).
% 0.15/0.38 thf(f39,plain,(
% 0.15/0.38 ($true != (in @ (setunion @ sK5) @ sK5))),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f38])).
% 0.15/0.38 thf(f38,plain,(
% 0.15/0.38 ($true != (in @ (setunion @ sK5) @ sK5)) | ($true != $true)),
% 0.15/0.38 inference(superposition,[],[f27,f26])).
% 0.15/0.38 % SZS output end Proof for theBenchmark
% 0.15/0.38 % (7956)------------------------------
% 0.15/0.38 % (7956)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (7956)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (7956)Memory used [KB]: 5500
% 0.15/0.38 % (7956)Time elapsed: 0.006 s
% 0.15/0.38 % (7956)Instructions burned: 4 (million)
% 0.15/0.38 % (7956)------------------------------
% 0.15/0.38 % (7956)------------------------------
% 0.15/0.38 % (7950)Success in time 0.006 s
% 0.15/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------