TSTP Solution File: SEU721^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU721^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:51:01 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU721^2 : TPTP v8.2.0. Released v3.7.0.
% 0.12/0.15 % 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.15/0.37 % Computer : n018.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 15:57:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TH0_THM_EQU_NAR problem
% 0.15/0.37 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.15/0.39 % (7284)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.39 % (7282)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.39 % (7285)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.39 % (7283)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.39 % (7286)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.39 % (7288)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.39 % (7287)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.39 % (7289)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.39 % (7285)Instruction limit reached!
% 0.15/0.39 % (7285)------------------------------
% 0.15/0.39 % (7285)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (7285)Termination reason: Unknown
% 0.15/0.39 % (7285)Termination phase: Unused predicate definition removal
% 0.15/0.39 % (7286)Instruction limit reached!
% 0.15/0.39 % (7286)------------------------------
% 0.15/0.39 % (7286)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (7286)Termination reason: Unknown
% 0.15/0.39 % (7286)Termination phase: Unused predicate definition removal
% 0.15/0.39
% 0.15/0.39 % (7286)Memory used [KB]: 895
% 0.15/0.39 % (7286)Time elapsed: 0.003 s
% 0.15/0.39 % (7286)Instructions burned: 2 (million)
% 0.15/0.39 % (7286)------------------------------
% 0.15/0.39 % (7286)------------------------------
% 0.15/0.39
% 0.15/0.39 % (7285)Memory used [KB]: 895
% 0.15/0.39 % (7285)Time elapsed: 0.003 s
% 0.15/0.39 % (7285)Instructions burned: 2 (million)
% 0.15/0.39 % (7285)------------------------------
% 0.15/0.39 % (7285)------------------------------
% 0.15/0.39 % (7289)Instruction limit reached!
% 0.15/0.39 % (7289)------------------------------
% 0.15/0.39 % (7289)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (7289)Termination reason: Unknown
% 0.15/0.39 % (7289)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (7289)Memory used [KB]: 5500
% 0.15/0.39 % (7289)Time elapsed: 0.003 s
% 0.15/0.39 % (7289)Instructions burned: 3 (million)
% 0.15/0.39 % (7289)------------------------------
% 0.15/0.39 % (7289)------------------------------
% 0.15/0.39 % (7287)First to succeed.
% 0.15/0.39 % (7283)Instruction limit reached!
% 0.15/0.39 % (7283)------------------------------
% 0.15/0.39 % (7283)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (7283)Termination reason: Unknown
% 0.15/0.39 % (7283)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (7283)Memory used [KB]: 5500
% 0.15/0.39 % (7283)Time elapsed: 0.004 s
% 0.15/0.39 % (7283)Instructions burned: 4 (million)
% 0.15/0.39 % (7283)------------------------------
% 0.15/0.39 % (7283)------------------------------
% 0.15/0.39 % (7288)Also succeeded, but the first one will report.
% 0.15/0.39 % (7287)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% 0.15/0.39 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.39 thf(func_def_1, type, powerset: $i > $i).
% 0.15/0.39 thf(func_def_2, type, binintersect: $i > $i > $i).
% 0.15/0.39 thf(f36,plain,(
% 0.15/0.39 $false),
% 0.15/0.39 inference(subsumption_resolution,[],[f35,f26])).
% 0.15/0.39 thf(f26,plain,(
% 0.15/0.39 ((in @ sK6 @ sK3) != $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f20])).
% 0.15/0.39 thf(f20,plain,(
% 0.15/0.39 ((($true = (in @ sK5 @ (powerset @ sK4))) & (($true = (in @ sK6 @ sK4)) & ((in @ sK6 @ (binintersect @ sK3 @ sK5)) = $true) & ((in @ sK6 @ sK3) != $true))) & ((in @ sK3 @ (powerset @ sK4)) = $true)) & (binintersectEL = $true)),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f11,f19,f18,f17])).
% 0.15/0.39 thf(f17,plain,(
% 0.15/0.39 ? [X0,X1] : (? [X2] : (((in @ X2 @ (powerset @ X1)) = $true) & ? [X3] : (((in @ X3 @ X1) = $true) & ((in @ X3 @ (binintersect @ X0 @ X2)) = $true) & ((in @ X3 @ X0) != $true))) & ((in @ X0 @ (powerset @ X1)) = $true)) => (? [X2] : (((in @ X2 @ (powerset @ sK4)) = $true) & ? [X3] : (((in @ X3 @ sK4) = $true) & ((in @ X3 @ (binintersect @ sK3 @ X2)) = $true) & ((in @ X3 @ sK3) != $true))) & ((in @ sK3 @ (powerset @ sK4)) = $true))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f18,plain,(
% 0.15/0.39 ? [X2] : (((in @ X2 @ (powerset @ sK4)) = $true) & ? [X3] : (((in @ X3 @ sK4) = $true) & ((in @ X3 @ (binintersect @ sK3 @ X2)) = $true) & ((in @ X3 @ sK3) != $true))) => (($true = (in @ sK5 @ (powerset @ sK4))) & ? [X3] : (((in @ X3 @ sK4) = $true) & ((in @ X3 @ (binintersect @ sK3 @ sK5)) = $true) & ((in @ X3 @ sK3) != $true)))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f19,plain,(
% 0.15/0.39 ? [X3] : (((in @ X3 @ sK4) = $true) & ((in @ X3 @ (binintersect @ sK3 @ sK5)) = $true) & ((in @ X3 @ sK3) != $true)) => (($true = (in @ sK6 @ sK4)) & ((in @ sK6 @ (binintersect @ sK3 @ sK5)) = $true) & ((in @ sK6 @ sK3) != $true))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f11,plain,(
% 0.15/0.39 ? [X0,X1] : (? [X2] : (((in @ X2 @ (powerset @ X1)) = $true) & ? [X3] : (((in @ X3 @ X1) = $true) & ((in @ X3 @ (binintersect @ X0 @ X2)) = $true) & ((in @ X3 @ X0) != $true))) & ((in @ X0 @ (powerset @ X1)) = $true)) & (binintersectEL = $true)),
% 0.15/0.39 inference(flattening,[],[f10])).
% 0.15/0.39 thf(f10,plain,(
% 0.15/0.39 ? [X1,X0] : (? [X2] : (? [X3] : ((((in @ X3 @ (binintersect @ X0 @ X2)) = $true) & ((in @ X3 @ X0) != $true)) & ((in @ X3 @ X1) = $true)) & ((in @ X2 @ (powerset @ X1)) = $true)) & ((in @ X0 @ (powerset @ X1)) = $true)) & (binintersectEL = $true)),
% 0.15/0.39 inference(ennf_transformation,[],[f9])).
% 0.15/0.39 thf(f9,plain,(
% 0.15/0.39 ~((binintersectEL = $true) => ! [X1,X0] : (((in @ X0 @ (powerset @ X1)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X1)) = $true) => ! [X3] : (((in @ X3 @ X1) = $true) => (((in @ X3 @ X0) != $true) => ((in @ X3 @ (binintersect @ X0 @ X2)) != $true))))))),
% 0.15/0.39 inference(flattening,[],[f6])).
% 0.15/0.39 thf(f6,plain,(
% 0.15/0.39 ~((binintersectEL = $true) => ! [X0,X1] : (((in @ X0 @ (powerset @ X1)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X1)) = $true) => ! [X3] : (((in @ X3 @ X1) = $true) => (~((in @ X3 @ X0) = $true) => ~((in @ X3 @ (binintersect @ X0 @ X2)) = $true))))))),
% 0.15/0.39 inference(fool_elimination,[],[f5])).
% 0.15/0.39 thf(f5,plain,(
% 0.15/0.39 ~(binintersectEL => ! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => ! [X2] : ((in @ X2 @ (powerset @ X1)) => ! [X3] : ((in @ X3 @ X1) => (~(in @ X3 @ X0) => ~(in @ X3 @ (binintersect @ X0 @ X2)))))))),
% 0.15/0.39 inference(rectify,[],[f3])).
% 0.15/0.39 thf(f3,negated_conjecture,(
% 0.15/0.39 ~(binintersectEL => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => (~(in @ X2 @ X3) => ~(in @ X2 @ (binintersect @ X3 @ X4)))))))),
% 0.15/0.39 inference(negated_conjecture,[],[f2])).
% 0.15/0.39 thf(f2,conjecture,(
% 0.15/0.39 binintersectEL => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => (~(in @ X2 @ X3) => ~(in @ X2 @ (binintersect @ X3 @ X4))))))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectTELcontra)).
% 0.15/0.39 thf(f35,plain,(
% 0.15/0.39 ((in @ sK6 @ sK3) = $true)),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f34])).
% 0.15/0.39 thf(f34,plain,(
% 0.15/0.39 ($true != $true) | ((in @ sK6 @ sK3) = $true)),
% 0.15/0.39 inference(superposition,[],[f33,f27])).
% 0.15/0.39 thf(f27,plain,(
% 0.15/0.39 ((in @ sK6 @ (binintersect @ sK3 @ sK5)) = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f20])).
% 0.15/0.39 thf(f33,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X4 @ (binintersect @ X3 @ X5)) != $true) | ((in @ X4 @ X3) = $true)) )),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f32])).
% 0.15/0.39 thf(f32,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != $true) | ((in @ X4 @ (binintersect @ X3 @ X5)) != $true) | ((in @ X4 @ X3) = $true)) )),
% 0.15/0.39 inference(definition_unfolding,[],[f21,f24])).
% 0.15/0.39 thf(f24,plain,(
% 0.15/0.39 (binintersectEL = $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f20])).
% 0.15/0.39 thf(f21,plain,(
% 0.15/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X4 @ (binintersect @ X3 @ X5)) != $true) | ((in @ X4 @ X3) = $true) | (binintersectEL != $true)) )),
% 0.15/0.39 inference(cnf_transformation,[],[f16])).
% 0.15/0.39 thf(f16,plain,(
% 0.15/0.39 ((binintersectEL = $true) | (((in @ sK1 @ (binintersect @ sK0 @ sK2)) = $true) & ((in @ sK1 @ sK0) != $true))) & (! [X3,X4,X5] : (((in @ X4 @ (binintersect @ X3 @ X5)) != $true) | ((in @ X4 @ X3) = $true)) | (binintersectEL != $true))),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f14,f15])).
% 0.15/0.39 thf(f15,plain,(
% 0.15/0.39 ? [X0,X1,X2] : (((in @ X1 @ (binintersect @ X0 @ X2)) = $true) & ((in @ X1 @ X0) != $true)) => (((in @ sK1 @ (binintersect @ sK0 @ sK2)) = $true) & ((in @ sK1 @ sK0) != $true))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f14,plain,(
% 0.15/0.39 ((binintersectEL = $true) | ? [X0,X1,X2] : (((in @ X1 @ (binintersect @ X0 @ X2)) = $true) & ((in @ X1 @ X0) != $true))) & (! [X3,X4,X5] : (((in @ X4 @ (binintersect @ X3 @ X5)) != $true) | ((in @ X4 @ X3) = $true)) | (binintersectEL != $true))),
% 0.15/0.39 inference(rectify,[],[f13])).
% 0.15/0.39 thf(f13,plain,(
% 0.15/0.39 ((binintersectEL = $true) | ? [X2,X1,X0] : (((in @ X1 @ (binintersect @ X2 @ X0)) = $true) & ((in @ X1 @ X2) != $true))) & (! [X2,X1,X0] : (((in @ X1 @ (binintersect @ X2 @ X0)) != $true) | ((in @ X1 @ X2) = $true)) | (binintersectEL != $true))),
% 0.15/0.39 inference(nnf_transformation,[],[f12])).
% 0.15/0.39 thf(f12,plain,(
% 0.15/0.39 (binintersectEL = $true) <=> ! [X2,X1,X0] : (((in @ X1 @ (binintersect @ X2 @ X0)) != $true) | ((in @ X1 @ X2) = $true))),
% 0.15/0.39 inference(ennf_transformation,[],[f8])).
% 0.15/0.39 thf(f8,plain,(
% 0.15/0.39 (binintersectEL = $true) <=> ! [X2,X0,X1] : (((in @ X1 @ (binintersect @ X2 @ X0)) = $true) => ((in @ X1 @ X2) = $true))),
% 0.15/0.39 inference(fool_elimination,[],[f7])).
% 0.15/0.39 thf(f7,plain,(
% 0.15/0.39 (binintersectEL = ! [X0,X1,X2] : ((in @ X1 @ (binintersect @ X2 @ X0)) => (in @ X1 @ X2)))),
% 0.15/0.39 inference(rectify,[],[f1])).
% 0.15/0.39 thf(f1,axiom,(
% 0.15/0.39 (binintersectEL = ! [X1,X2,X0] : ((in @ X2 @ (binintersect @ X0 @ X1)) => (in @ X2 @ X0)))),
% 0.15/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectEL)).
% 0.15/0.39 % SZS output end Proof for theBenchmark
% 0.15/0.39 % (7287)------------------------------
% 0.15/0.39 % (7287)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (7287)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (7287)Memory used [KB]: 5500
% 0.15/0.39 % (7287)Time elapsed: 0.005 s
% 0.15/0.39 % (7287)Instructions burned: 3 (million)
% 0.15/0.39 % (7287)------------------------------
% 0.15/0.39 % (7287)------------------------------
% 0.15/0.39 % (7281)Success in time 0.017 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------