TSTP Solution File: SEU565^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU565^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 : n002.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:37 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU565^2 : TPTP v8.2.0. Released v3.7.0.
% 0.12/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.14/0.35 % Computer : n002.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 17:30:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/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.14/0.39 % (20979)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.39 % (20973)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.14/0.39 % (20975)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.14/0.39 % (20974)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.14/0.39 % (20976)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.39 % (20977)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.14/0.39 % (20978)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.14/0.39 % (20979)First to succeed.
% 0.14/0.39 % (20976)Instruction limit reached!
% 0.14/0.39 % (20976)------------------------------
% 0.14/0.39 % (20976)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (20976)Termination reason: Unknown
% 0.14/0.39 % (20976)Termination phase: Property scanning
% 0.14/0.39 % (20977)Instruction limit reached!
% 0.14/0.39 % (20977)------------------------------
% 0.14/0.39 % (20977)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (20977)Termination reason: Unknown
% 0.14/0.39 % (20977)Termination phase: Property scanning
% 0.14/0.39
% 0.14/0.39 % (20977)Memory used [KB]: 895
% 0.14/0.39 % (20977)Time elapsed: 0.004 s
% 0.14/0.39 % (20977)Instructions burned: 2 (million)
% 0.14/0.39 % (20977)------------------------------
% 0.14/0.39 % (20977)------------------------------
% 0.14/0.39
% 0.14/0.39 % (20976)Memory used [KB]: 895
% 0.14/0.39 % (20976)Time elapsed: 0.004 s
% 0.14/0.39 % (20976)Instructions burned: 2 (million)
% 0.14/0.39 % (20976)------------------------------
% 0.14/0.39 % (20976)------------------------------
% 0.14/0.39 % (20980)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.14/0.39 % (20978)Also succeeded, but the first one will report.
% 0.14/0.39 % (20979)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% 0.14/0.39 thf(func_def_0, type, in: $i > $i > $o).
% 0.14/0.39 thf(func_def_1, type, subset: $i > $i > $o).
% 0.14/0.39 thf(f37,plain,(
% 0.14/0.39 $false),
% 0.14/0.39 inference(subsumption_resolution,[],[f36,f22])).
% 0.14/0.39 thf(f22,plain,(
% 0.14/0.39 ($true != (in @ sK0 @ sK2))),
% 0.14/0.39 inference(cnf_transformation,[],[f15])).
% 0.14/0.39 thf(f15,plain,(
% 0.14/0.39 (subsetE = $true) & (($true != (in @ sK0 @ sK2)) & ($true = (subset @ sK1 @ sK2)) & ($true = (in @ sK0 @ sK1)))),
% 0.14/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f11,f14])).
% 0.14/0.39 thf(f14,plain,(
% 0.14/0.39 ? [X0,X1,X2] : (($true != (in @ X0 @ X2)) & ($true = (subset @ X1 @ X2)) & ($true = (in @ X0 @ X1))) => (($true != (in @ sK0 @ sK2)) & ($true = (subset @ sK1 @ sK2)) & ($true = (in @ sK0 @ sK1)))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f11,plain,(
% 0.14/0.39 (subsetE = $true) & ? [X0,X1,X2] : (($true != (in @ X0 @ X2)) & ($true = (subset @ X1 @ X2)) & ($true = (in @ X0 @ X1)))),
% 0.14/0.39 inference(flattening,[],[f10])).
% 0.14/0.39 thf(f10,plain,(
% 0.14/0.40 ? [X0,X2,X1] : ((($true = (in @ X0 @ X1)) & ($true != (in @ X0 @ X2))) & ($true = (subset @ X1 @ X2))) & (subsetE = $true)),
% 0.14/0.40 inference(ennf_transformation,[],[f9])).
% 0.14/0.40 thf(f9,plain,(
% 0.14/0.40 ~((subsetE = $true) => ! [X0,X2,X1] : (($true = (subset @ X1 @ X2)) => (($true != (in @ X0 @ X2)) => ($true != (in @ X0 @ X1)))))),
% 0.14/0.40 inference(flattening,[],[f6])).
% 0.14/0.40 thf(f6,plain,(
% 0.14/0.40 ~((subsetE = $true) => ! [X0,X1,X2] : (($true = (subset @ X1 @ X2)) => (~($true = (in @ X0 @ X2)) => ~($true = (in @ X0 @ X1)))))),
% 0.14/0.40 inference(fool_elimination,[],[f5])).
% 0.14/0.40 thf(f5,plain,(
% 0.14/0.40 ~(subsetE => ! [X0,X1,X2] : ((subset @ X1 @ X2) => (~(in @ X0 @ X2) => ~(in @ X0 @ X1))))),
% 0.14/0.40 inference(rectify,[],[f3])).
% 0.14/0.40 thf(f3,negated_conjecture,(
% 0.14/0.40 ~(subsetE => ! [X2,X0,X1] : ((subset @ X0 @ X1) => (~(in @ X2 @ X1) => ~(in @ X2 @ X0))))),
% 0.14/0.40 inference(negated_conjecture,[],[f2])).
% 0.14/0.40 thf(f2,conjecture,(
% 0.14/0.40 subsetE => ! [X2,X0,X1] : ((subset @ X0 @ X1) => (~(in @ X2 @ X1) => ~(in @ X2 @ X0)))),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetE2)).
% 0.14/0.40 thf(f36,plain,(
% 0.14/0.40 ($true = (in @ sK0 @ sK2))),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f35])).
% 0.14/0.40 thf(f35,plain,(
% 0.14/0.40 ($true != $true) | ($true = (in @ sK0 @ sK2))),
% 0.14/0.40 inference(superposition,[],[f34,f20])).
% 0.14/0.40 thf(f20,plain,(
% 0.14/0.40 ($true = (in @ sK0 @ sK1))),
% 0.14/0.40 inference(cnf_transformation,[],[f15])).
% 0.14/0.40 thf(f34,plain,(
% 0.14/0.40 ( ! [X0 : $i] : (($true != (in @ X0 @ sK1)) | ($true = (in @ X0 @ sK2))) )),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f33])).
% 0.14/0.40 thf(f33,plain,(
% 0.14/0.40 ( ! [X0 : $i] : (($true = (in @ X0 @ sK2)) | ($true != (in @ X0 @ sK1)) | ($true != $true)) )),
% 0.14/0.40 inference(superposition,[],[f32,f21])).
% 0.14/0.40 thf(f21,plain,(
% 0.14/0.40 ($true = (subset @ sK1 @ sK2))),
% 0.14/0.40 inference(cnf_transformation,[],[f15])).
% 0.14/0.40 thf(f32,plain,(
% 0.14/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (subset @ X1 @ X0)) | ((in @ X2 @ X0) = $true) | ((in @ X2 @ X1) != $true)) )),
% 0.14/0.40 inference(trivial_inequality_removal,[],[f28])).
% 0.14/0.40 thf(f28,plain,(
% 0.14/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ X1) != $true) | ($true != (subset @ X1 @ X0)) | ($true != $true) | ((in @ X2 @ X0) = $true)) )),
% 0.14/0.40 inference(definition_unfolding,[],[f27,f23])).
% 0.14/0.40 thf(f23,plain,(
% 0.14/0.40 (subsetE = $true)),
% 0.14/0.40 inference(cnf_transformation,[],[f15])).
% 0.14/0.40 thf(f27,plain,(
% 0.14/0.40 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ X0) = $true) | ($true != (subset @ X1 @ X0)) | ((in @ X2 @ X1) != $true) | (subsetE != $true)) )),
% 0.14/0.40 inference(cnf_transformation,[],[f19])).
% 0.14/0.40 thf(f19,plain,(
% 0.14/0.40 (! [X0,X1,X2] : (((in @ X2 @ X0) = $true) | ($true != (subset @ X1 @ X0)) | ((in @ X2 @ X1) != $true)) | (subsetE != $true)) & ((subsetE = $true) | (((in @ sK5 @ sK3) != $true) & ($true = (subset @ sK4 @ sK3)) & ($true = (in @ sK5 @ sK4))))),
% 0.14/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f17,f18])).
% 0.14/0.40 thf(f18,plain,(
% 0.14/0.40 ? [X3,X4,X5] : (($true != (in @ X5 @ X3)) & ($true = (subset @ X4 @ X3)) & ($true = (in @ X5 @ X4))) => (((in @ sK5 @ sK3) != $true) & ($true = (subset @ sK4 @ sK3)) & ($true = (in @ sK5 @ sK4)))),
% 0.14/0.40 introduced(choice_axiom,[])).
% 0.14/0.40 thf(f17,plain,(
% 0.14/0.40 (! [X0,X1,X2] : (((in @ X2 @ X0) = $true) | ($true != (subset @ X1 @ X0)) | ((in @ X2 @ X1) != $true)) | (subsetE != $true)) & ((subsetE = $true) | ? [X3,X4,X5] : (($true != (in @ X5 @ X3)) & ($true = (subset @ X4 @ X3)) & ($true = (in @ X5 @ X4))))),
% 0.14/0.40 inference(rectify,[],[f16])).
% 0.14/0.40 thf(f16,plain,(
% 0.14/0.40 (! [X0,X1,X2] : (((in @ X2 @ X0) = $true) | ($true != (subset @ X1 @ X0)) | ((in @ X2 @ X1) != $true)) | (subsetE != $true)) & ((subsetE = $true) | ? [X0,X1,X2] : (((in @ X2 @ X0) != $true) & ($true = (subset @ X1 @ X0)) & ((in @ X2 @ X1) = $true)))),
% 0.14/0.40 inference(nnf_transformation,[],[f13])).
% 0.14/0.40 thf(f13,plain,(
% 0.14/0.40 ! [X0,X1,X2] : (((in @ X2 @ X0) = $true) | ($true != (subset @ X1 @ X0)) | ((in @ X2 @ X1) != $true)) <=> (subsetE = $true)),
% 0.14/0.40 inference(flattening,[],[f12])).
% 0.14/0.40 thf(f12,plain,(
% 0.14/0.40 ! [X1,X2,X0] : ((((in @ X2 @ X0) = $true) | ((in @ X2 @ X1) != $true)) | ($true != (subset @ X1 @ X0))) <=> (subsetE = $true)),
% 0.14/0.40 inference(ennf_transformation,[],[f8])).
% 0.14/0.40 thf(f8,plain,(
% 0.14/0.40 ! [X1,X2,X0] : (($true = (subset @ X1 @ X0)) => (((in @ X2 @ X1) = $true) => ((in @ X2 @ X0) = $true))) <=> (subsetE = $true)),
% 0.14/0.40 inference(fool_elimination,[],[f7])).
% 0.14/0.40 thf(f7,plain,(
% 0.14/0.40 (subsetE = ! [X0,X1,X2] : ((subset @ X1 @ X0) => ((in @ X2 @ X1) => (in @ X2 @ X0))))),
% 0.14/0.40 inference(rectify,[],[f1])).
% 0.14/0.40 thf(f1,axiom,(
% 0.14/0.40 (subsetE = ! [X1,X0,X2] : ((subset @ X0 @ X1) => ((in @ X2 @ X0) => (in @ X2 @ X1))))),
% 0.14/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetE)).
% 0.14/0.40 % SZS output end Proof for theBenchmark
% 0.14/0.40 % (20979)------------------------------
% 0.14/0.40 % (20979)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (20979)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (20979)Memory used [KB]: 5500
% 0.14/0.40 % (20979)Time elapsed: 0.007 s
% 0.14/0.40 % (20979)Instructions burned: 2 (million)
% 0.14/0.40 % (20979)------------------------------
% 0.14/0.40 % (20979)------------------------------
% 0.14/0.40 % (20971)Success in time 0.028 s
% 0.14/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------