TSTP Solution File: SEU783^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU783^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 : n007.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:30 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU783^2 : TPTP v8.2.0. Released v3.7.0.
% 0.08/0.14 % 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.14/0.35 % Computer : n007.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 16:40:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.37 % (3291)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.14/0.37 % (3292)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.14/0.37 % (3296)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.37 % (3294)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.14/0.37 % (3293)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (3295)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.14/0.37 % (3290)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.14/0.37 % (3297)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.14/0.37 % (3294)Instruction limit reached!
% 0.14/0.37 % (3294)------------------------------
% 0.14/0.37 % (3294)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (3294)Termination reason: Unknown
% 0.14/0.37 % (3294)Termination phase: Property scanning
% 0.14/0.37
% 0.14/0.38 % (3294)Memory used [KB]: 895
% 0.14/0.38 % (3294)Time elapsed: 0.003 s
% 0.14/0.38 % (3294)Instructions burned: 2 (million)
% 0.14/0.38 % (3294)------------------------------
% 0.14/0.38 % (3294)------------------------------
% 0.14/0.38 % (3291)Instruction limit reached!
% 0.14/0.38 % (3291)------------------------------
% 0.14/0.38 % (3291)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (3291)Termination reason: Unknown
% 0.14/0.38 % (3291)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (3291)Memory used [KB]: 5500
% 0.14/0.38 % (3291)Time elapsed: 0.005 s
% 0.14/0.38 % (3291)Instructions burned: 4 (million)
% 0.14/0.38 % (3291)------------------------------
% 0.14/0.38 % (3291)------------------------------
% 0.14/0.38 % (3293)Instruction limit reached!
% 0.14/0.38 % (3293)------------------------------
% 0.14/0.38 % (3293)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (3293)Termination reason: Unknown
% 0.14/0.38 % (3293)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (3293)Memory used [KB]: 5500
% 0.14/0.38 % (3293)Time elapsed: 0.003 s
% 0.14/0.38 % (3293)Instructions burned: 3 (million)
% 0.14/0.38 % (3293)------------------------------
% 0.14/0.38 % (3293)------------------------------
% 0.14/0.38 % (3297)Instruction limit reached!
% 0.14/0.38 % (3297)------------------------------
% 0.14/0.38 % (3297)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (3297)Termination reason: Unknown
% 0.14/0.38 % (3297)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (3297)Memory used [KB]: 5500
% 0.14/0.38 % (3297)Time elapsed: 0.003 s
% 0.14/0.38 % (3297)Instructions burned: 3 (million)
% 0.14/0.38 % (3297)------------------------------
% 0.14/0.38 % (3297)------------------------------
% 0.14/0.38 % (3295)First to succeed.
% 0.14/0.38 % (3292)Also succeeded, but the first one will report.
% 0.14/0.38 % (3290)Also succeeded, but the first one will report.
% 0.14/0.38 % (3295)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% 0.14/0.38 thf(func_def_0, type, in: $i > $i > $o).
% 0.14/0.38 thf(func_def_1, type, binunion: $i > $i > $i).
% 0.14/0.38 thf(func_def_4, type, kpair: $i > $i > $i).
% 0.14/0.38 thf(func_def_5, type, breln1: $i > $i > $o).
% 0.14/0.38 thf(f37,plain,(
% 0.14/0.38 $false),
% 0.14/0.38 inference(subsumption_resolution,[],[f36,f24])).
% 0.14/0.38 thf(f24,plain,(
% 0.14/0.38 ($true = (in @ (kpair @ sK3 @ sK4) @ sK1))),
% 0.14/0.38 inference(cnf_transformation,[],[f16])).
% 0.14/0.38 thf(f16,plain,(
% 0.14/0.38 (binunionIL = $true) & ((((((in @ sK4 @ sK0) = $true) & ($true != (in @ (kpair @ sK3 @ sK4) @ (binunion @ sK1 @ sK2))) & ($true = (in @ (kpair @ sK3 @ sK4) @ sK1))) & ((in @ sK3 @ sK0) = $true)) & ((breln1 @ sK0 @ sK2) = $true)) & ($true = (breln1 @ sK0 @ sK1)))),
% 0.14/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f11,f15,f14,f13,f12])).
% 0.14/0.38 thf(f12,plain,(
% 0.14/0.38 ? [X0,X1] : (? [X2] : (? [X3] : (? [X4] : (((in @ X4 @ X0) = $true) & ((in @ (kpair @ X3 @ X4) @ (binunion @ X1 @ X2)) != $true) & ((in @ (kpair @ X3 @ X4) @ X1) = $true)) & ($true = (in @ X3 @ X0))) & ((breln1 @ X0 @ X2) = $true)) & ($true = (breln1 @ X0 @ X1))) => (? [X2] : (? [X3] : (? [X4] : (((in @ X4 @ sK0) = $true) & ($true != (in @ (kpair @ X3 @ X4) @ (binunion @ sK1 @ X2))) & ($true = (in @ (kpair @ X3 @ X4) @ sK1))) & ((in @ X3 @ sK0) = $true)) & ($true = (breln1 @ sK0 @ X2))) & ($true = (breln1 @ sK0 @ sK1)))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f13,plain,(
% 0.14/0.38 ? [X2] : (? [X3] : (? [X4] : (((in @ X4 @ sK0) = $true) & ($true != (in @ (kpair @ X3 @ X4) @ (binunion @ sK1 @ X2))) & ($true = (in @ (kpair @ X3 @ X4) @ sK1))) & ((in @ X3 @ sK0) = $true)) & ($true = (breln1 @ sK0 @ X2))) => (? [X3] : (? [X4] : (((in @ X4 @ sK0) = $true) & ((in @ (kpair @ X3 @ X4) @ (binunion @ sK1 @ sK2)) != $true) & ($true = (in @ (kpair @ X3 @ X4) @ sK1))) & ((in @ X3 @ sK0) = $true)) & ((breln1 @ sK0 @ sK2) = $true))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f14,plain,(
% 0.14/0.38 ? [X3] : (? [X4] : (((in @ X4 @ sK0) = $true) & ((in @ (kpair @ X3 @ X4) @ (binunion @ sK1 @ sK2)) != $true) & ($true = (in @ (kpair @ X3 @ X4) @ sK1))) & ((in @ X3 @ sK0) = $true)) => (? [X4] : (((in @ X4 @ sK0) = $true) & ((in @ (kpair @ sK3 @ X4) @ (binunion @ sK1 @ sK2)) != $true) & ($true = (in @ (kpair @ sK3 @ X4) @ sK1))) & ((in @ sK3 @ sK0) = $true))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f15,plain,(
% 0.14/0.38 ? [X4] : (((in @ X4 @ sK0) = $true) & ((in @ (kpair @ sK3 @ X4) @ (binunion @ sK1 @ sK2)) != $true) & ($true = (in @ (kpair @ sK3 @ X4) @ sK1))) => (((in @ sK4 @ sK0) = $true) & ($true != (in @ (kpair @ sK3 @ sK4) @ (binunion @ sK1 @ sK2))) & ($true = (in @ (kpair @ sK3 @ sK4) @ sK1)))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f11,plain,(
% 0.14/0.38 (binunionIL = $true) & ? [X0,X1] : (? [X2] : (? [X3] : (? [X4] : (((in @ X4 @ X0) = $true) & ((in @ (kpair @ X3 @ X4) @ (binunion @ X1 @ X2)) != $true) & ((in @ (kpair @ X3 @ X4) @ X1) = $true)) & ($true = (in @ X3 @ X0))) & ((breln1 @ X0 @ X2) = $true)) & ($true = (breln1 @ X0 @ X1)))),
% 0.14/0.38 inference(flattening,[],[f10])).
% 0.14/0.38 thf(f10,plain,(
% 0.14/0.38 ? [X1,X0] : (? [X2] : (? [X3] : (? [X4] : ((((in @ (kpair @ X3 @ X4) @ (binunion @ X1 @ X2)) != $true) & ((in @ (kpair @ X3 @ X4) @ X1) = $true)) & ((in @ X4 @ X0) = $true)) & ($true = (in @ X3 @ X0))) & ((breln1 @ X0 @ X2) = $true)) & ($true = (breln1 @ X0 @ X1))) & (binunionIL = $true)),
% 0.14/0.38 inference(ennf_transformation,[],[f8])).
% 0.14/0.38 thf(f8,plain,(
% 0.14/0.38 ~((binunionIL = $true) => ! [X1,X0] : (($true = (breln1 @ X0 @ X1)) => ! [X2] : (((breln1 @ X0 @ X2) = $true) => ! [X3] : (($true = (in @ X3 @ X0)) => ! [X4] : (((in @ X4 @ X0) = $true) => (((in @ (kpair @ X3 @ X4) @ X1) = $true) => ((in @ (kpair @ X3 @ X4) @ (binunion @ X1 @ X2)) = $true)))))))),
% 0.14/0.38 inference(fool_elimination,[],[f7])).
% 0.14/0.38 thf(f7,plain,(
% 0.14/0.38 ~(binunionIL => ! [X0,X1] : ((breln1 @ X0 @ X1) => ! [X2] : ((breln1 @ X0 @ X2) => ! [X3] : ((in @ X3 @ X0) => ! [X4] : ((in @ X4 @ X0) => ((in @ (kpair @ X3 @ X4) @ X1) => (in @ (kpair @ X3 @ X4) @ (binunion @ X1 @ X2))))))))),
% 0.14/0.38 inference(rectify,[],[f3])).
% 0.14/0.38 thf(f3,negated_conjecture,(
% 0.14/0.38 ~(binunionIL => ! [X0,X3] : ((breln1 @ X0 @ X3) => ! [X4] : ((breln1 @ X0 @ X4) => ! [X2] : ((in @ X2 @ X0) => ! [X5] : ((in @ X5 @ X0) => ((in @ (kpair @ X2 @ X5) @ X3) => (in @ (kpair @ X2 @ X5) @ (binunion @ X3 @ X4))))))))),
% 0.14/0.38 inference(negated_conjecture,[],[f2])).
% 0.14/0.38 thf(f2,conjecture,(
% 0.14/0.38 binunionIL => ! [X0,X3] : ((breln1 @ X0 @ X3) => ! [X4] : ((breln1 @ X0 @ X4) => ! [X2] : ((in @ X2 @ X0) => ! [X5] : ((in @ X5 @ X0) => ((in @ (kpair @ X2 @ X5) @ X3) => (in @ (kpair @ X2 @ X5) @ (binunion @ X3 @ X4)))))))),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1unionIL)).
% 0.14/0.38 thf(f36,plain,(
% 0.14/0.38 ($true != (in @ (kpair @ sK3 @ sK4) @ sK1))),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f35])).
% 0.14/0.38 thf(f35,plain,(
% 0.14/0.38 ($true != $true) | ($true != (in @ (kpair @ sK3 @ sK4) @ sK1))),
% 0.14/0.38 inference(superposition,[],[f25,f34])).
% 0.14/0.38 thf(f34,plain,(
% 0.14/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ (binunion @ X1 @ X2)) = $true) | ((in @ X0 @ X1) != $true)) )),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f31])).
% 0.14/0.38 thf(f31,plain,(
% 0.14/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | ((in @ X0 @ (binunion @ X1 @ X2)) = $true) | ((in @ X0 @ X1) != $true)) )),
% 0.14/0.38 inference(definition_unfolding,[],[f30,f27])).
% 0.14/0.38 thf(f27,plain,(
% 0.14/0.38 (binunionIL = $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f16])).
% 0.14/0.38 thf(f30,plain,(
% 0.14/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X0 @ X1) != $true) | ((in @ X0 @ (binunion @ X1 @ X2)) = $true) | (binunionIL != $true)) )),
% 0.14/0.38 inference(cnf_transformation,[],[f20])).
% 0.14/0.38 thf(f20,plain,(
% 0.14/0.38 (! [X0,X1,X2] : (((in @ X0 @ X1) != $true) | ((in @ X0 @ (binunion @ X1 @ X2)) = $true)) | (binunionIL != $true)) & ((binunionIL = $true) | (($true = (in @ sK5 @ sK6)) & ($true != (in @ sK5 @ (binunion @ sK6 @ sK7)))))),
% 0.14/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f18,f19])).
% 0.14/0.38 thf(f19,plain,(
% 0.14/0.38 ? [X3,X4,X5] : (((in @ X3 @ X4) = $true) & ((in @ X3 @ (binunion @ X4 @ X5)) != $true)) => (($true = (in @ sK5 @ sK6)) & ($true != (in @ sK5 @ (binunion @ sK6 @ sK7))))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f18,plain,(
% 0.14/0.38 (! [X0,X1,X2] : (((in @ X0 @ X1) != $true) | ((in @ X0 @ (binunion @ X1 @ X2)) = $true)) | (binunionIL != $true)) & ((binunionIL = $true) | ? [X3,X4,X5] : (((in @ X3 @ X4) = $true) & ((in @ X3 @ (binunion @ X4 @ X5)) != $true)))),
% 0.14/0.38 inference(rectify,[],[f17])).
% 0.14/0.38 thf(f17,plain,(
% 0.14/0.38 (! [X2,X0,X1] : (((in @ X2 @ X0) != $true) | ((in @ X2 @ (binunion @ X0 @ X1)) = $true)) | (binunionIL != $true)) & ((binunionIL = $true) | ? [X2,X0,X1] : (((in @ X2 @ X0) = $true) & ((in @ X2 @ (binunion @ X0 @ X1)) != $true)))),
% 0.14/0.38 inference(nnf_transformation,[],[f9])).
% 0.14/0.38 thf(f9,plain,(
% 0.14/0.38 ! [X2,X0,X1] : (((in @ X2 @ X0) != $true) | ((in @ X2 @ (binunion @ X0 @ X1)) = $true)) <=> (binunionIL = $true)),
% 0.14/0.38 inference(ennf_transformation,[],[f6])).
% 0.14/0.38 thf(f6,plain,(
% 0.14/0.38 (binunionIL = $true) <=> ! [X0,X1,X2] : (((in @ X2 @ X0) = $true) => ((in @ X2 @ (binunion @ X0 @ X1)) = $true))),
% 0.14/0.38 inference(fool_elimination,[],[f5])).
% 0.14/0.38 thf(f5,plain,(
% 0.14/0.38 (! [X0,X1,X2] : ((in @ X2 @ X0) => (in @ X2 @ (binunion @ X0 @ X1))) = binunionIL)),
% 0.14/0.38 inference(rectify,[],[f1])).
% 0.14/0.38 thf(f1,axiom,(
% 0.14/0.38 (! [X0,X1,X2] : ((in @ X2 @ X0) => (in @ X2 @ (binunion @ X0 @ X1))) = binunionIL)),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionIL)).
% 0.14/0.38 thf(f25,plain,(
% 0.14/0.38 ($true != (in @ (kpair @ sK3 @ sK4) @ (binunion @ sK1 @ sK2)))),
% 0.14/0.38 inference(cnf_transformation,[],[f16])).
% 0.14/0.38 % SZS output end Proof for theBenchmark
% 0.14/0.38 % (3295)------------------------------
% 0.14/0.38 % (3295)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (3295)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (3295)Memory used [KB]: 5500
% 0.14/0.38 % (3295)Time elapsed: 0.005 s
% 0.14/0.38 % (3295)Instructions burned: 3 (million)
% 0.14/0.38 % (3295)------------------------------
% 0.14/0.38 % (3295)------------------------------
% 0.14/0.38 % (3289)Success in time 0.007 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------