TSTP Solution File: SEU523^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU523^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 : n012.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:20 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU523^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.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 17:25:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_NAR problem
% 0.13/0.35 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.13/0.36 % (26794)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.13/0.36 % (26793)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.13/0.36 % (26795)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.13/0.37 % (26789)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.13/0.37 % (26791)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.13/0.37 % (26790)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.13/0.37 % (26793)Instruction limit reached!
% 0.13/0.37 % (26793)------------------------------
% 0.13/0.37 % (26793)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (26793)Termination reason: Unknown
% 0.13/0.37 % (26793)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (26793)Memory used [KB]: 895
% 0.13/0.37 % (26793)Time elapsed: 0.003 s
% 0.13/0.37 % (26793)Instructions burned: 2 (million)
% 0.13/0.37 % (26793)------------------------------
% 0.13/0.37 % (26793)------------------------------
% 0.13/0.37 % (26792)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.37 % (26795)First to succeed.
% 0.13/0.37 % (26792)Instruction limit reached!
% 0.13/0.37 % (26792)------------------------------
% 0.13/0.37 % (26792)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (26792)Termination reason: Unknown
% 0.13/0.37 % (26792)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (26792)Memory used [KB]: 5500
% 0.13/0.37 % (26792)Time elapsed: 0.003 s
% 0.13/0.37 % (26792)Instructions burned: 3 (million)
% 0.13/0.37 % (26792)------------------------------
% 0.13/0.37 % (26792)------------------------------
% 0.13/0.37 % (26796)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.13/0.37 % (26790)Instruction limit reached!
% 0.13/0.37 % (26790)------------------------------
% 0.13/0.37 % (26790)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (26790)Termination reason: Unknown
% 0.13/0.37 % (26790)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (26790)Memory used [KB]: 5500
% 0.13/0.37 % (26790)Time elapsed: 0.005 s
% 0.13/0.37 % (26790)Instructions burned: 4 (million)
% 0.13/0.37 % (26790)------------------------------
% 0.13/0.37 % (26790)------------------------------
% 0.13/0.37 % (26794)Also succeeded, but the first one will report.
% 0.13/0.37 % (26789)Also succeeded, but the first one will report.
% 0.13/0.37 % (26795)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% 0.13/0.37 thf(func_def_0, type, in: $i > $i > $o).
% 0.13/0.37 thf(func_def_1, type, setunion: $i > $i).
% 0.13/0.37 thf(func_def_9, type, sK3: $i > $i > $i).
% 0.13/0.37 thf(f48,plain,(
% 0.13/0.37 $false),
% 0.13/0.37 inference(subsumption_resolution,[],[f47,f45])).
% 0.13/0.37 thf(f45,plain,(
% 0.13/0.37 ((in @ (sK3 @ sK1 @ sK0) @ sK0) != $true)),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f44])).
% 0.13/0.37 thf(f44,plain,(
% 0.13/0.37 ((in @ (sK3 @ sK1 @ sK0) @ sK0) != $true) | ($true != $true)),
% 0.13/0.37 inference(superposition,[],[f39,f43])).
% 0.13/0.37 thf(f43,plain,(
% 0.13/0.37 ((in @ sK1 @ (sK3 @ sK1 @ sK0)) = $true)),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f42])).
% 0.13/0.37 thf(f42,plain,(
% 0.13/0.37 ($true != $true) | ((in @ sK1 @ (sK3 @ sK1 @ sK0)) = $true)),
% 0.13/0.37 inference(superposition,[],[f37,f23])).
% 0.13/0.37 thf(f23,plain,(
% 0.13/0.37 ((in @ sK1 @ (setunion @ sK0)) = $true)),
% 0.13/0.37 inference(cnf_transformation,[],[f13])).
% 0.13/0.37 thf(f13,plain,(
% 0.13/0.37 (((in @ sK1 @ (setunion @ sK0)) = $true) & ((sK2 != $true) & ! [X3] : ((sK2 = $true) | ((in @ sK1 @ X3) != $true) | ((in @ X3 @ sK0) != $true)))) & (setunionAx = $true)),
% 0.13/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f10,f12,f11])).
% 0.13/0.37 thf(f11,plain,(
% 0.13/0.37 ? [X0,X1] : (((in @ X1 @ (setunion @ X0)) = $true) & ? [X2 : $o] : (($true != X2) & ! [X3] : (($true = X2) | ((in @ X1 @ X3) != $true) | ((in @ X3 @ X0) != $true)))) => (((in @ sK1 @ (setunion @ sK0)) = $true) & ? [X2 : $o] : (($true != X2) & ! [X3] : (($true = X2) | ((in @ sK1 @ X3) != $true) | ((in @ X3 @ sK0) != $true))))),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f12,plain,(
% 0.13/0.37 ? [X2 : $o] : (($true != X2) & ! [X3] : (($true = X2) | ((in @ sK1 @ X3) != $true) | ((in @ X3 @ sK0) != $true))) => ((sK2 != $true) & ! [X3] : ((sK2 = $true) | ((in @ sK1 @ X3) != $true) | ((in @ X3 @ sK0) != $true)))),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f10,plain,(
% 0.13/0.37 ? [X0,X1] : (((in @ X1 @ (setunion @ X0)) = $true) & ? [X2 : $o] : (($true != X2) & ! [X3] : (($true = X2) | ((in @ X1 @ X3) != $true) | ((in @ X3 @ X0) != $true)))) & (setunionAx = $true)),
% 0.13/0.37 inference(flattening,[],[f9])).
% 0.13/0.37 thf(f9,plain,(
% 0.13/0.37 ? [X1,X0] : (? [X2 : $o] : (($true != X2) & ! [X3] : ((($true = X2) | ((in @ X3 @ X0) != $true)) | ((in @ X1 @ X3) != $true))) & ((in @ X1 @ (setunion @ X0)) = $true)) & (setunionAx = $true)),
% 0.13/0.37 inference(ennf_transformation,[],[f8])).
% 0.13/0.37 thf(f8,plain,(
% 0.13/0.37 ~((setunionAx = $true) => ! [X1,X0] : (((in @ X1 @ (setunion @ X0)) = $true) => ! [X2 : $o] : (! [X3] : (((in @ X1 @ X3) = $true) => (((in @ X3 @ X0) = $true) => ($true = X2))) => ($true = X2))))),
% 0.13/0.37 inference(fool_elimination,[],[f7])).
% 0.13/0.37 thf(f7,plain,(
% 0.13/0.37 ~(setunionAx => ! [X0,X1] : ((in @ X1 @ (setunion @ X0)) => ! [X2 : $o] : (! [X3] : ((in @ X1 @ X3) => ((in @ X3 @ X0) => X2)) => X2)))),
% 0.13/0.37 inference(rectify,[],[f3])).
% 0.13/0.37 thf(f3,negated_conjecture,(
% 0.13/0.37 ~(setunionAx => ! [X0,X1] : ((in @ X1 @ (setunion @ X0)) => ! [X3 : $o] : (! [X2] : ((in @ X1 @ X2) => ((in @ X2 @ X0) => X3)) => X3)))),
% 0.13/0.37 inference(negated_conjecture,[],[f2])).
% 0.13/0.37 thf(f2,conjecture,(
% 0.13/0.37 setunionAx => ! [X0,X1] : ((in @ X1 @ (setunion @ X0)) => ! [X3 : $o] : (! [X2] : ((in @ X1 @ X2) => ((in @ X2 @ X0) => X3)) => X3))),
% 0.13/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionE)).
% 0.13/0.37 thf(f37,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ X1 @ (setunion @ X0)) != $true) | ((in @ X1 @ (sK3 @ X1 @ X0)) = $true)) )),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f32])).
% 0.13/0.37 thf(f32,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ X1 @ (setunion @ X0)) != $true) | ((in @ X1 @ (sK3 @ X1 @ X0)) = $true) | ($true != $true)) )),
% 0.13/0.37 inference(definition_unfolding,[],[f27,f20])).
% 0.13/0.37 thf(f20,plain,(
% 0.13/0.37 (setunionAx = $true)),
% 0.13/0.37 inference(cnf_transformation,[],[f13])).
% 0.13/0.37 thf(f27,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ X1 @ (sK3 @ X1 @ X0)) = $true) | ((in @ X1 @ (setunion @ X0)) != $true) | (setunionAx != $true)) )),
% 0.13/0.37 inference(cnf_transformation,[],[f19])).
% 0.13/0.37 thf(f19,plain,(
% 0.13/0.37 (! [X0,X1] : ((((in @ X1 @ (setunion @ X0)) = $true) | ! [X2] : (((in @ X2 @ X0) != $true) | ((in @ X1 @ X2) != $true))) & ((((in @ (sK3 @ X1 @ X0) @ X0) = $true) & ((in @ X1 @ (sK3 @ X1 @ X0)) = $true)) | ((in @ X1 @ (setunion @ X0)) != $true))) | (setunionAx != $true)) & ((setunionAx = $true) | ((! [X6] : (((in @ X6 @ sK4) != $true) | ((in @ sK5 @ X6) != $true)) | ((in @ sK5 @ (setunion @ sK4)) != $true)) & ((((in @ sK6 @ sK4) = $true) & ((in @ sK5 @ sK6) = $true)) | ((in @ sK5 @ (setunion @ sK4)) = $true))))),
% 0.13/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f15,f18,f17,f16])).
% 0.13/0.37 thf(f16,plain,(
% 0.13/0.37 ! [X0,X1] : (? [X3] : (((in @ X3 @ X0) = $true) & ((in @ X1 @ X3) = $true)) => (((in @ (sK3 @ X1 @ X0) @ X0) = $true) & ((in @ X1 @ (sK3 @ X1 @ X0)) = $true)))),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f17,plain,(
% 0.13/0.37 ? [X4,X5] : ((! [X6] : (((in @ X6 @ X4) != $true) | ((in @ X5 @ X6) != $true)) | ((in @ X5 @ (setunion @ X4)) != $true)) & (? [X7] : (((in @ X7 @ X4) = $true) & ((in @ X5 @ X7) = $true)) | ((in @ X5 @ (setunion @ X4)) = $true))) => ((! [X6] : (((in @ X6 @ sK4) != $true) | ((in @ sK5 @ X6) != $true)) | ((in @ sK5 @ (setunion @ sK4)) != $true)) & (? [X7] : (((in @ X7 @ sK4) = $true) & ($true = (in @ sK5 @ X7))) | ((in @ sK5 @ (setunion @ sK4)) = $true)))),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f18,plain,(
% 0.13/0.37 ? [X7] : (((in @ X7 @ sK4) = $true) & ($true = (in @ sK5 @ X7))) => (((in @ sK6 @ sK4) = $true) & ((in @ sK5 @ sK6) = $true))),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f15,plain,(
% 0.13/0.37 (! [X0,X1] : ((((in @ X1 @ (setunion @ X0)) = $true) | ! [X2] : (((in @ X2 @ X0) != $true) | ((in @ X1 @ X2) != $true))) & (? [X3] : (((in @ X3 @ X0) = $true) & ((in @ X1 @ X3) = $true)) | ((in @ X1 @ (setunion @ X0)) != $true))) | (setunionAx != $true)) & ((setunionAx = $true) | ? [X4,X5] : ((! [X6] : (((in @ X6 @ X4) != $true) | ((in @ X5 @ X6) != $true)) | ((in @ X5 @ (setunion @ X4)) != $true)) & (? [X7] : (((in @ X7 @ X4) = $true) & ((in @ X5 @ X7) = $true)) | ((in @ X5 @ (setunion @ X4)) = $true))))),
% 0.13/0.37 inference(rectify,[],[f14])).
% 0.13/0.37 thf(f14,plain,(
% 0.13/0.37 (! [X0,X1] : ((((in @ X1 @ (setunion @ X0)) = $true) | ! [X2] : (((in @ X2 @ X0) != $true) | ((in @ X1 @ X2) != $true))) & (? [X2] : (((in @ X2 @ X0) = $true) & ((in @ X1 @ X2) = $true)) | ((in @ X1 @ (setunion @ X0)) != $true))) | (setunionAx != $true)) & ((setunionAx = $true) | ? [X0,X1] : ((! [X2] : (((in @ X2 @ X0) != $true) | ((in @ X1 @ X2) != $true)) | ((in @ X1 @ (setunion @ X0)) != $true)) & (? [X2] : (((in @ X2 @ X0) = $true) & ((in @ X1 @ X2) = $true)) | ((in @ X1 @ (setunion @ X0)) = $true))))),
% 0.13/0.37 inference(nnf_transformation,[],[f6])).
% 0.13/0.37 thf(f6,plain,(
% 0.13/0.37 ! [X0,X1] : (((in @ X1 @ (setunion @ X0)) = $true) <=> ? [X2] : (((in @ X2 @ X0) = $true) & ((in @ X1 @ X2) = $true))) <=> (setunionAx = $true)),
% 0.13/0.37 inference(fool_elimination,[],[f5])).
% 0.13/0.37 thf(f5,plain,(
% 0.13/0.37 (! [X0,X1] : (? [X2] : ((in @ X1 @ X2) & (in @ X2 @ X0)) <=> (in @ X1 @ (setunion @ X0))) = setunionAx)),
% 0.13/0.37 inference(rectify,[],[f1])).
% 0.13/0.37 thf(f1,axiom,(
% 0.13/0.37 (! [X0,X1] : (? [X2] : ((in @ X1 @ X2) & (in @ X2 @ X0)) <=> (in @ X1 @ (setunion @ X0))) = setunionAx)),
% 0.13/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionAx)).
% 0.13/0.37 thf(f39,plain,(
% 0.13/0.37 ( ! [X3 : $i] : (((in @ sK1 @ X3) != $true) | ((in @ X3 @ sK0) != $true)) )),
% 0.13/0.37 inference(subsumption_resolution,[],[f21,f22])).
% 0.13/0.37 thf(f22,plain,(
% 0.13/0.37 (sK2 != $true)),
% 0.13/0.37 inference(cnf_transformation,[],[f13])).
% 0.13/0.37 thf(f21,plain,(
% 0.13/0.37 ( ! [X3 : $i] : ((sK2 = $true) | ((in @ sK1 @ X3) != $true) | ((in @ X3 @ sK0) != $true)) )),
% 0.13/0.37 inference(cnf_transformation,[],[f13])).
% 0.13/0.37 thf(f47,plain,(
% 0.13/0.37 ((in @ (sK3 @ sK1 @ sK0) @ sK0) = $true)),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f46])).
% 0.13/0.37 thf(f46,plain,(
% 0.13/0.37 ((in @ (sK3 @ sK1 @ sK0) @ sK0) = $true) | ($true != $true)),
% 0.13/0.37 inference(superposition,[],[f38,f23])).
% 0.13/0.37 thf(f38,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ X1 @ (setunion @ X0)) != $true) | ((in @ (sK3 @ X1 @ X0) @ X0) = $true)) )),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f31])).
% 0.13/0.37 thf(f31,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ((in @ (sK3 @ X1 @ X0) @ X0) = $true) | ((in @ X1 @ (setunion @ X0)) != $true)) )),
% 0.13/0.37 inference(definition_unfolding,[],[f28,f20])).
% 0.13/0.37 thf(f28,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $i] : (((in @ (sK3 @ X1 @ X0) @ X0) = $true) | ((in @ X1 @ (setunion @ X0)) != $true) | (setunionAx != $true)) )),
% 0.13/0.37 inference(cnf_transformation,[],[f19])).
% 0.13/0.37 % SZS output end Proof for theBenchmark
% 0.13/0.37 % (26795)------------------------------
% 0.13/0.37 % (26795)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (26795)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (26795)Memory used [KB]: 5500
% 0.13/0.37 % (26795)Time elapsed: 0.005 s
% 0.13/0.37 % (26795)Instructions burned: 4 (million)
% 0.13/0.37 % (26795)------------------------------
% 0.13/0.37 % (26795)------------------------------
% 0.13/0.37 % (26788)Success in time 0.005 s
% 0.13/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------