TSTP Solution File: SEU569^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU569^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 : n018.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:39 EDT 2024
% Result : Theorem 0.17s 0.40s
% Output : Refutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU569^2 : TPTP v8.2.0. Released v3.7.0.
% 0.08/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.17/0.37 % Computer : n018.cluster.edu
% 0.17/0.37 % Model : x86_64 x86_64
% 0.17/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37 % Memory : 8042.1875MB
% 0.17/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37 % CPULimit : 300
% 0.17/0.37 % WCLimit : 300
% 0.17/0.37 % DateTime : Sun May 19 18:16:08 EDT 2024
% 0.17/0.38 % CPUTime :
% 0.17/0.38 This is a TH0_THM_EQU_NAR problem
% 0.17/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.17/0.40 % (29236)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.17/0.40 % (29235)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.17/0.40 % (29230)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.17/0.40 % (29235)Refutation not found, incomplete strategy
% 0.17/0.40 % (29235)------------------------------
% 0.17/0.40 % (29235)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.40 % (29235)Termination reason: Refutation not found, incomplete strategy
% 0.17/0.40
% 0.17/0.40
% 0.17/0.40 % (29235)Memory used [KB]: 5373
% 0.17/0.40 % (29233)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.17/0.40 % (29231)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.17/0.40 % (29232)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.17/0.40 % (29235)Time elapsed: 0.003 s
% 0.17/0.40 % (29235)Instructions burned: 1 (million)
% 0.17/0.40 % (29235)------------------------------
% 0.17/0.40 % (29235)------------------------------
% 0.17/0.40 % (29234)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.17/0.40 % (29237)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.17/0.40 % (29236)First to succeed.
% 0.17/0.40 % (29233)Instruction limit reached!
% 0.17/0.40 % (29233)------------------------------
% 0.17/0.40 % (29233)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.40 % (29233)Termination reason: Unknown
% 0.17/0.40 % (29233)Termination phase: Saturation
% 0.17/0.40 % (29234)Instruction limit reached!
% 0.17/0.40 % (29234)------------------------------
% 0.17/0.40 % (29234)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.40 % (29234)Termination reason: Unknown
% 0.17/0.40 % (29234)Termination phase: Saturation
% 0.17/0.40
% 0.17/0.40 % (29234)Memory used [KB]: 895
% 0.17/0.40 % (29234)Time elapsed: 0.003 s
% 0.17/0.40 % (29234)Instructions burned: 2 (million)
% 0.17/0.40 % (29234)------------------------------
% 0.17/0.40 % (29234)------------------------------
% 0.17/0.40
% 0.17/0.40 % (29233)Memory used [KB]: 5373
% 0.17/0.40 % (29233)Time elapsed: 0.003 s
% 0.17/0.40 % (29233)Instructions burned: 2 (million)
% 0.17/0.40 % (29233)------------------------------
% 0.17/0.40 % (29233)------------------------------
% 0.17/0.40 % (29230)Also succeeded, but the first one will report.
% 0.17/0.40 % (29237)Refutation not found, incomplete strategy
% 0.17/0.40 % (29237)------------------------------
% 0.17/0.40 % (29237)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.40 % (29237)Termination reason: Refutation not found, incomplete strategy
% 0.17/0.40
% 0.17/0.40
% 0.17/0.40 % (29237)Memory used [KB]: 5500
% 0.17/0.40 % (29237)Time elapsed: 0.003 s
% 0.17/0.40 % (29237)Instructions burned: 1 (million)
% 0.17/0.40 % (29237)------------------------------
% 0.17/0.40 % (29237)------------------------------
% 0.17/0.40 % (29236)Refutation found. Thanks to Tanya!
% 0.17/0.40 % SZS status Theorem for theBenchmark
% 0.17/0.40 % SZS output start Proof for theBenchmark
% 0.17/0.40 thf(func_def_0, type, in: $i > $i > $o).
% 0.17/0.40 thf(func_def_1, type, subset: $i > $i > $o).
% 0.17/0.40 thf(func_def_6, type, sK0: $i > $i > $i).
% 0.17/0.40 thf(f34,plain,(
% 0.17/0.40 $false),
% 0.17/0.40 inference(subsumption_resolution,[],[f33,f23])).
% 0.17/0.40 thf(f23,plain,(
% 0.17/0.40 ($true != (subset @ sK3 @ sK3))),
% 0.17/0.40 inference(cnf_transformation,[],[f17])).
% 0.17/0.40 thf(f17,plain,(
% 0.17/0.40 ($true != (subset @ sK3 @ sK3)) & (subsetI2 = $true)),
% 0.17/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f10,f16])).
% 0.17/0.40 thf(f16,plain,(
% 0.17/0.40 ? [X0] : ((subset @ X0 @ X0) != $true) => ($true != (subset @ sK3 @ sK3))),
% 0.17/0.40 introduced(choice_axiom,[])).
% 0.17/0.40 thf(f10,plain,(
% 0.17/0.40 ? [X0] : ((subset @ X0 @ X0) != $true) & (subsetI2 = $true)),
% 0.17/0.40 inference(ennf_transformation,[],[f8])).
% 0.17/0.40 thf(f8,plain,(
% 0.17/0.40 ~((subsetI2 = $true) => ! [X0] : ((subset @ X0 @ X0) = $true))),
% 0.17/0.40 inference(fool_elimination,[],[f7])).
% 0.17/0.40 thf(f7,plain,(
% 0.17/0.40 ~(subsetI2 => ! [X0] : (subset @ X0 @ X0))),
% 0.17/0.40 inference(rectify,[],[f3])).
% 0.17/0.40 thf(f3,negated_conjecture,(
% 0.17/0.40 ~(subsetI2 => ! [X0] : (subset @ X0 @ X0))),
% 0.17/0.40 inference(negated_conjecture,[],[f2])).
% 0.17/0.40 thf(f2,conjecture,(
% 0.17/0.40 subsetI2 => ! [X0] : (subset @ X0 @ X0)),
% 0.17/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetRefl)).
% 0.17/0.40 thf(f33,plain,(
% 0.17/0.40 ($true = (subset @ sK3 @ sK3))),
% 0.17/0.40 inference(trivial_inequality_removal,[],[f32])).
% 0.17/0.40 thf(f32,plain,(
% 0.17/0.40 ($true = (subset @ sK3 @ sK3)) | ($true != $true)),
% 0.17/0.40 inference(superposition,[],[f28,f31])).
% 0.17/0.40 thf(f31,plain,(
% 0.17/0.40 ($true = (in @ (sK0 @ sK3 @ sK3) @ sK3))),
% 0.17/0.40 inference(trivial_inequality_removal,[],[f30])).
% 0.17/0.40 thf(f30,plain,(
% 0.17/0.40 ($true = (in @ (sK0 @ sK3 @ sK3) @ sK3)) | ($true != $true)),
% 0.17/0.40 inference(superposition,[],[f23,f29])).
% 0.17/0.40 thf(f29,plain,(
% 0.17/0.40 ( ! [X0 : $i,X1 : $i] : (($true = (subset @ X1 @ X0)) | ($true = (in @ (sK0 @ X1 @ X0) @ X1))) )),
% 0.17/0.40 inference(trivial_inequality_removal,[],[f25])).
% 0.17/0.40 thf(f25,plain,(
% 0.17/0.40 ( ! [X0 : $i,X1 : $i] : (($true = (subset @ X1 @ X0)) | ($true = (in @ (sK0 @ X1 @ X0) @ X1)) | ($true != $true)) )),
% 0.17/0.40 inference(definition_unfolding,[],[f20,f22])).
% 0.17/0.40 thf(f22,plain,(
% 0.17/0.40 (subsetI2 = $true)),
% 0.17/0.40 inference(cnf_transformation,[],[f17])).
% 0.17/0.40 thf(f20,plain,(
% 0.17/0.40 ( ! [X0 : $i,X1 : $i] : (($true = (subset @ X1 @ X0)) | ($true = (in @ (sK0 @ X1 @ X0) @ X1)) | (subsetI2 != $true)) )),
% 0.17/0.40 inference(cnf_transformation,[],[f15])).
% 0.17/0.40 thf(f15,plain,(
% 0.17/0.40 (! [X0,X1] : (($true = (subset @ X1 @ X0)) | (($true != (in @ (sK0 @ X1 @ X0) @ X0)) & ($true = (in @ (sK0 @ X1 @ X0) @ X1)))) | (subsetI2 != $true)) & ((subsetI2 = $true) | (($true != (subset @ sK2 @ sK1)) & ! [X5] : (($true = (in @ X5 @ sK1)) | ($true != (in @ X5 @ sK2)))))),
% 0.17/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f12,f14,f13])).
% 0.17/0.40 thf(f13,plain,(
% 0.17/0.40 ! [X0,X1] : (? [X2] : (((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true)) => (($true != (in @ (sK0 @ X1 @ X0) @ X0)) & ($true = (in @ (sK0 @ X1 @ X0) @ X1))))),
% 0.17/0.40 introduced(choice_axiom,[])).
% 0.17/0.40 thf(f14,plain,(
% 0.17/0.40 ? [X3,X4] : (($true != (subset @ X4 @ X3)) & ! [X5] : (($true = (in @ X5 @ X3)) | ($true != (in @ X5 @ X4)))) => (($true != (subset @ sK2 @ sK1)) & ! [X5] : (($true = (in @ X5 @ sK1)) | ($true != (in @ X5 @ sK2))))),
% 0.17/0.40 introduced(choice_axiom,[])).
% 0.17/0.40 thf(f12,plain,(
% 0.17/0.40 (! [X0,X1] : (($true = (subset @ X1 @ X0)) | ? [X2] : (((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true))) | (subsetI2 != $true)) & ((subsetI2 = $true) | ? [X3,X4] : (($true != (subset @ X4 @ X3)) & ! [X5] : (($true = (in @ X5 @ X3)) | ($true != (in @ X5 @ X4)))))),
% 0.17/0.40 inference(rectify,[],[f11])).
% 0.17/0.40 thf(f11,plain,(
% 0.17/0.40 (! [X1,X0] : (((subset @ X0 @ X1) = $true) | ? [X2] : (((in @ X2 @ X1) != $true) & ((in @ X2 @ X0) = $true))) | (subsetI2 != $true)) & ((subsetI2 = $true) | ? [X1,X0] : (((subset @ X0 @ X1) != $true) & ! [X2] : (((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) != $true))))),
% 0.17/0.40 inference(nnf_transformation,[],[f9])).
% 0.17/0.40 thf(f9,plain,(
% 0.17/0.40 ! [X1,X0] : (((subset @ X0 @ X1) = $true) | ? [X2] : (((in @ X2 @ X1) != $true) & ((in @ X2 @ X0) = $true))) <=> (subsetI2 = $true)),
% 0.17/0.40 inference(ennf_transformation,[],[f6])).
% 0.17/0.40 thf(f6,plain,(
% 0.17/0.40 (subsetI2 = $true) <=> ! [X0,X1] : (! [X2] : (((in @ X2 @ X0) = $true) => ((in @ X2 @ X1) = $true)) => ((subset @ X0 @ X1) = $true))),
% 0.17/0.40 inference(fool_elimination,[],[f5])).
% 0.17/0.40 thf(f5,plain,(
% 0.17/0.40 (subsetI2 = ! [X0,X1] : (! [X2] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)))),
% 0.17/0.40 inference(rectify,[],[f1])).
% 0.17/0.40 thf(f1,axiom,(
% 0.17/0.40 (subsetI2 = ! [X0,X1] : (! [X2] : ((in @ X2 @ X0) => (in @ X2 @ X1)) => (subset @ X0 @ X1)))),
% 0.17/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetI2)).
% 0.17/0.40 thf(f28,plain,(
% 0.17/0.40 ( ! [X0 : $i,X1 : $i] : (($true != (in @ (sK0 @ X1 @ X0) @ X0)) | ($true = (subset @ X1 @ X0))) )),
% 0.17/0.40 inference(trivial_inequality_removal,[],[f24])).
% 0.17/0.40 thf(f24,plain,(
% 0.17/0.40 ( ! [X0 : $i,X1 : $i] : (($true != (in @ (sK0 @ X1 @ X0) @ X0)) | ($true = (subset @ X1 @ X0)) | ($true != $true)) )),
% 0.17/0.40 inference(definition_unfolding,[],[f21,f22])).
% 0.17/0.40 thf(f21,plain,(
% 0.17/0.40 ( ! [X0 : $i,X1 : $i] : (($true = (subset @ X1 @ X0)) | ($true != (in @ (sK0 @ X1 @ X0) @ X0)) | (subsetI2 != $true)) )),
% 0.17/0.40 inference(cnf_transformation,[],[f15])).
% 0.17/0.40 % SZS output end Proof for theBenchmark
% 0.17/0.40 % (29236)------------------------------
% 0.17/0.40 % (29236)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.17/0.40 % (29236)Termination reason: Refutation
% 0.17/0.40
% 0.17/0.40 % (29236)Memory used [KB]: 5500
% 0.17/0.40 % (29236)Time elapsed: 0.004 s
% 0.17/0.40 % (29236)Instructions burned: 2 (million)
% 0.17/0.40 % (29236)------------------------------
% 0.17/0.40 % (29236)------------------------------
% 0.17/0.40 % (29229)Success in time 0.015 s
% 0.17/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------