TSTP Solution File: SYN386^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN386^5 : TPTP v8.2.0. Released v4.0.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 : n004.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 08:22:09 EDT 2024
% Result : Theorem 0.12s 0.36s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SYN386^5 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.13 % 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.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 13:40:23 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.34 This is a TH0_THM_NEQ_NAR problem
% 0.12/0.34 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.12/0.35 % (12072)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.12/0.35 % (12073)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.12/0.35 % (12074)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.12/0.35 % (12075)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.12/0.35 % (12076)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.12/0.35 % (12069)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.12/0.35 % (12072)Instruction limit reached!
% 0.12/0.35 % (12072)------------------------------
% 0.12/0.35 % (12072)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (12072)Termination reason: Unknown
% 0.12/0.35 % (12072)Termination phase: Saturation
% 0.12/0.35 % (12073)Instruction limit reached!
% 0.12/0.35 % (12073)------------------------------
% 0.12/0.35 % (12073)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35
% 0.12/0.35 % (12072)Memory used [KB]: 5500
% 0.12/0.35 % (12072)Time elapsed: 0.003 s
% 0.12/0.36 % (12072)Instructions burned: 2 (million)
% 0.12/0.36 % (12072)------------------------------
% 0.12/0.36 % (12072)------------------------------
% 0.12/0.36 % (12073)Termination reason: Unknown
% 0.12/0.36 % (12073)Termination phase: Saturation
% 0.12/0.36
% 0.12/0.36 % (12073)Memory used [KB]: 5500
% 0.12/0.36 % (12073)Time elapsed: 0.003 s
% 0.12/0.36 % (12073)Instructions burned: 3 (million)
% 0.12/0.36 % (12073)------------------------------
% 0.12/0.36 % (12073)------------------------------
% 0.12/0.36 % (12076)Instruction limit reached!
% 0.12/0.36 % (12076)------------------------------
% 0.12/0.36 % (12076)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (12076)Termination reason: Unknown
% 0.12/0.36 % (12076)Termination phase: Saturation
% 0.12/0.36
% 0.12/0.36 % (12076)Memory used [KB]: 5500
% 0.12/0.36 % (12076)Time elapsed: 0.004 s
% 0.12/0.36 % (12076)Instructions burned: 4 (million)
% 0.12/0.36 % (12076)------------------------------
% 0.12/0.36 % (12076)------------------------------
% 0.12/0.36 % (12074)First to succeed.
% 0.12/0.36 % (12071)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.12/0.36 % (12069)Also succeeded, but the first one will report.
% 0.12/0.36 % (12074)Refutation found. Thanks to Tanya!
% 0.12/0.36 % SZS status Theorem for theBenchmark
% 0.12/0.36 % SZS output start Proof for theBenchmark
% 0.12/0.36 thf(func_def_0, type, cD: $i > $i > $i > $o).
% 0.12/0.36 thf(func_def_1, type, cF: $i > $i > $o).
% 0.12/0.36 thf(func_def_2, type, cS: $i > $i > $o).
% 0.12/0.36 thf(func_def_7, type, sK1: $i > $i).
% 0.12/0.36 thf(func_def_8, type, sK2: $i > $i).
% 0.12/0.36 thf(func_def_9, type, sK3: $i > $i).
% 0.12/0.36 thf(func_def_10, type, sK4: $i > $i).
% 0.12/0.36 thf(func_def_11, type, sK5: $i > $i > $i).
% 0.12/0.36 thf(func_def_12, type, sK6: $i > $i > $i).
% 0.12/0.36 thf(f42,plain,(
% 0.12/0.36 $false),
% 0.12/0.36 inference(trivial_inequality_removal,[],[f41])).
% 0.12/0.36 thf(f41,plain,(
% 0.12/0.36 ($true != $true)),
% 0.12/0.36 inference(superposition,[],[f36,f21])).
% 0.12/0.36 thf(f21,plain,(
% 0.12/0.36 ( ! [X4 : $i] : (($true = (cF @ X4 @ (sK2 @ X4)))) )),
% 0.12/0.36 inference(cnf_transformation,[],[f16])).
% 0.12/0.36 thf(f16,plain,(
% 0.12/0.36 ! [X1] : ! [X3] : (((cD @ X3 @ sK0 @ X1) = $true) | ((cS @ (sK1 @ X1) @ X3) != $true)) & ! [X4] : ($true = (cF @ X4 @ (sK2 @ X4))) & ! [X6] : ! [X8,X9] : (($true != (cD @ X9 @ X8 @ (sK3 @ X6))) | ! [X10,X11] : (((cF @ X9 @ X11) != $true) | ((cD @ X11 @ X10 @ X6) = $true) | ((cF @ X8 @ X10) != $true))) & ! [X12] : ! [X14] : ((((cF @ (sK5 @ X14 @ X12) @ (sK6 @ X14 @ X12)) = $true) & ($true != (cD @ (sK6 @ X14 @ X12) @ X12 @ (sK4 @ X12)))) & ((cS @ X14 @ (sK5 @ X14 @ X12)) = $true))),
% 0.12/0.36 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f8,f15,f14,f13,f12,f11,f10,f9])).
% 0.12/0.36 thf(f9,plain,(
% 0.12/0.36 ? [X0] : ! [X1] : ? [X2] : ! [X3] : (((cD @ X3 @ X0 @ X1) = $true) | ($true != (cS @ X2 @ X3))) => ! [X1] : ? [X2] : ! [X3] : (((cD @ X3 @ sK0 @ X1) = $true) | ($true != (cS @ X2 @ X3)))),
% 0.12/0.36 introduced(choice_axiom,[])).
% 0.12/0.36 thf(f10,plain,(
% 0.12/0.36 ! [X1] : (? [X2] : ! [X3] : (((cD @ X3 @ sK0 @ X1) = $true) | ($true != (cS @ X2 @ X3))) => ! [X3] : (((cD @ X3 @ sK0 @ X1) = $true) | ((cS @ (sK1 @ X1) @ X3) != $true)))),
% 0.12/0.36 introduced(choice_axiom,[])).
% 0.12/0.36 thf(f11,plain,(
% 0.12/0.36 ! [X4] : (? [X5] : ((cF @ X4 @ X5) = $true) => ($true = (cF @ X4 @ (sK2 @ X4))))),
% 0.12/0.36 introduced(choice_axiom,[])).
% 0.12/0.36 thf(f12,plain,(
% 0.12/0.36 ! [X6] : (? [X7] : ! [X8,X9] : (($true != (cD @ X9 @ X8 @ X7)) | ! [X10,X11] : (((cF @ X9 @ X11) != $true) | ((cD @ X11 @ X10 @ X6) = $true) | ((cF @ X8 @ X10) != $true))) => ! [X9,X8] : (($true != (cD @ X9 @ X8 @ (sK3 @ X6))) | ! [X10,X11] : (((cF @ X9 @ X11) != $true) | ((cD @ X11 @ X10 @ X6) = $true) | ((cF @ X8 @ X10) != $true))))),
% 0.12/0.36 introduced(choice_axiom,[])).
% 0.12/0.36 thf(f13,plain,(
% 0.12/0.36 ! [X12] : (? [X13] : ! [X14] : ? [X15] : (? [X16] : (((cF @ X15 @ X16) = $true) & ((cD @ X16 @ X12 @ X13) != $true)) & ((cS @ X14 @ X15) = $true)) => ! [X14] : ? [X15] : (? [X16] : (((cF @ X15 @ X16) = $true) & ((cD @ X16 @ X12 @ (sK4 @ X12)) != $true)) & ((cS @ X14 @ X15) = $true)))),
% 0.12/0.36 introduced(choice_axiom,[])).
% 0.12/0.36 thf(f14,plain,(
% 0.12/0.36 ! [X12,X14] : (? [X15] : (? [X16] : (((cF @ X15 @ X16) = $true) & ((cD @ X16 @ X12 @ (sK4 @ X12)) != $true)) & ((cS @ X14 @ X15) = $true)) => (? [X16] : (($true = (cF @ (sK5 @ X14 @ X12) @ X16)) & ((cD @ X16 @ X12 @ (sK4 @ X12)) != $true)) & ((cS @ X14 @ (sK5 @ X14 @ X12)) = $true)))),
% 0.12/0.36 introduced(choice_axiom,[])).
% 0.12/0.36 thf(f15,plain,(
% 0.12/0.36 ! [X12,X14] : (? [X16] : (($true = (cF @ (sK5 @ X14 @ X12) @ X16)) & ((cD @ X16 @ X12 @ (sK4 @ X12)) != $true)) => (((cF @ (sK5 @ X14 @ X12) @ (sK6 @ X14 @ X12)) = $true) & ($true != (cD @ (sK6 @ X14 @ X12) @ X12 @ (sK4 @ X12)))))),
% 0.12/0.36 introduced(choice_axiom,[])).
% 0.12/0.36 thf(f8,plain,(
% 0.12/0.36 ? [X0] : ! [X1] : ? [X2] : ! [X3] : (((cD @ X3 @ X0 @ X1) = $true) | ($true != (cS @ X2 @ X3))) & ! [X4] : ? [X5] : ((cF @ X4 @ X5) = $true) & ! [X6] : ? [X7] : ! [X8,X9] : (($true != (cD @ X9 @ X8 @ X7)) | ! [X10,X11] : (((cF @ X9 @ X11) != $true) | ((cD @ X11 @ X10 @ X6) = $true) | ((cF @ X8 @ X10) != $true))) & ! [X12] : ? [X13] : ! [X14] : ? [X15] : (? [X16] : (((cF @ X15 @ X16) = $true) & ((cD @ X16 @ X12 @ X13) != $true)) & ((cS @ X14 @ X15) = $true))),
% 0.12/0.36 inference(rectify,[],[f7])).
% 0.12/0.36 thf(f7,plain,(
% 0.12/0.36 ? [X8] : ! [X9] : ? [X10] : ! [X11] : (((cD @ X11 @ X8 @ X9) = $true) | ($true != (cS @ X10 @ X11))) & ! [X6] : ? [X7] : ((cF @ X6 @ X7) = $true) & ! [X0] : ? [X1] : ! [X3,X2] : (($true != (cD @ X2 @ X3 @ X1)) | ! [X4,X5] : (($true != (cF @ X2 @ X5)) | ((cD @ X5 @ X4 @ X0) = $true) | ($true != (cF @ X3 @ X4)))) & ! [X12] : ? [X13] : ! [X14] : ? [X15] : (? [X16] : (((cF @ X15 @ X16) = $true) & ((cD @ X16 @ X12 @ X13) != $true)) & ((cS @ X14 @ X15) = $true))),
% 0.12/0.36 inference(flattening,[],[f6])).
% 0.12/0.36 thf(f6,plain,(
% 0.12/0.36 ! [X12] : ? [X13] : ! [X14] : ? [X15] : (? [X16] : (((cF @ X15 @ X16) = $true) & ((cD @ X16 @ X12 @ X13) != $true)) & ((cS @ X14 @ X15) = $true)) & (! [X0] : ? [X1] : ! [X3,X2] : (! [X5,X4] : (((cD @ X5 @ X4 @ X0) = $true) | (($true != (cF @ X2 @ X5)) | ($true != (cF @ X3 @ X4)))) | ($true != (cD @ X2 @ X3 @ X1))) & ! [X6] : ? [X7] : ((cF @ X6 @ X7) = $true) & ? [X8] : ! [X9] : ? [X10] : ! [X11] : (((cD @ X11 @ X8 @ X9) = $true) | ($true != (cS @ X10 @ X11))))),
% 0.12/0.36 inference(ennf_transformation,[],[f5])).
% 0.12/0.36 thf(f5,plain,(
% 0.12/0.36 ~((! [X0] : ? [X1] : ! [X3,X2] : (($true = (cD @ X2 @ X3 @ X1)) => ! [X5,X4] : ((($true = (cF @ X2 @ X5)) & ($true = (cF @ X3 @ X4))) => ((cD @ X5 @ X4 @ X0) = $true))) & ! [X6] : ? [X7] : ((cF @ X6 @ X7) = $true) & ? [X8] : ! [X9] : ? [X10] : ! [X11] : (($true = (cS @ X10 @ X11)) => ((cD @ X11 @ X8 @ X9) = $true))) => ? [X12] : ! [X13] : ? [X14] : ! [X15] : (((cS @ X14 @ X15) = $true) => ! [X16] : (((cF @ X15 @ X16) = $true) => ((cD @ X16 @ X12 @ X13) = $true))))),
% 0.12/0.36 inference(fool_elimination,[],[f4])).
% 0.12/0.36 thf(f4,plain,(
% 0.12/0.36 ~((! [X0] : ? [X1] : ! [X2,X3] : ((cD @ X2 @ X3 @ X1) => ! [X4,X5] : (((cF @ X2 @ X5) & (cF @ X3 @ X4)) => (cD @ X5 @ X4 @ X0))) & ! [X6] : ? [X7] : (cF @ X6 @ X7) & ? [X8] : ! [X9] : ? [X10] : ! [X11] : ((cS @ X10 @ X11) => (cD @ X11 @ X8 @ X9))) => ? [X12] : ! [X13] : ? [X14] : ! [X15] : ((cS @ X14 @ X15) => ! [X16] : ((cF @ X15 @ X16) => (cD @ X16 @ X12 @ X13))))),
% 0.12/0.36 inference(rectify,[],[f2])).
% 0.12/0.36 thf(f2,negated_conjecture,(
% 0.12/0.36 ~((! [X2] : ? [X5] : ! [X6,X7] : ((cD @ X6 @ X7 @ X5) => ! [X8,X1] : (((cF @ X6 @ X1) & (cF @ X7 @ X8)) => (cD @ X1 @ X8 @ X2))) & ! [X0] : ? [X1] : (cF @ X0 @ X1) & ? [X0] : ! [X2] : ? [X3] : ! [X4] : ((cS @ X3 @ X4) => (cD @ X4 @ X0 @ X2))) => ? [X1] : ! [X2] : ? [X9] : ! [X4] : ((cS @ X9 @ X4) => ! [X8] : ((cF @ X4 @ X8) => (cD @ X8 @ X1 @ X2))))),
% 0.12/0.36 inference(negated_conjecture,[],[f1])).
% 0.12/0.36 thf(f1,conjecture,(
% 0.12/0.36 (! [X2] : ? [X5] : ! [X6,X7] : ((cD @ X6 @ X7 @ X5) => ! [X8,X1] : (((cF @ X6 @ X1) & (cF @ X7 @ X8)) => (cD @ X1 @ X8 @ X2))) & ! [X0] : ? [X1] : (cF @ X0 @ X1) & ? [X0] : ! [X2] : ? [X3] : ! [X4] : ((cS @ X3 @ X4) => (cD @ X4 @ X0 @ X2))) => ? [X1] : ! [X2] : ? [X9] : ! [X4] : ((cS @ X9 @ X4) => ! [X8] : ((cF @ X4 @ X8) => (cD @ X8 @ X1 @ X2)))),
% 0.12/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX2138)).
% 0.12/0.36 thf(f36,plain,(
% 0.12/0.36 ( ! [X0 : $i] : (((cF @ sK0 @ X0) != $true)) )),
% 0.12/0.36 inference(trivial_inequality_removal,[],[f35])).
% 0.12/0.36 thf(f35,plain,(
% 0.12/0.36 ( ! [X0 : $i] : (((cF @ sK0 @ X0) != $true) | ($true != $true)) )),
% 0.12/0.36 inference(superposition,[],[f32,f19])).
% 0.12/0.36 thf(f19,plain,(
% 0.12/0.36 ( ! [X14 : $i,X12 : $i] : (((cF @ (sK5 @ X14 @ X12) @ (sK6 @ X14 @ X12)) = $true)) )),
% 0.12/0.36 inference(cnf_transformation,[],[f16])).
% 0.12/0.36 thf(f32,plain,(
% 0.12/0.36 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((cF @ (sK5 @ (sK1 @ (sK3 @ (sK4 @ X0))) @ X1) @ (sK6 @ X2 @ X0)) != $true) | ((cF @ sK0 @ X0) != $true)) )),
% 0.12/0.36 inference(trivial_inequality_removal,[],[f31])).
% 0.12/0.36 thf(f31,plain,(
% 0.12/0.36 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((cF @ sK0 @ X0) != $true) | ((cF @ (sK5 @ (sK1 @ (sK3 @ (sK4 @ X0))) @ X1) @ (sK6 @ X2 @ X0)) != $true) | ($true != $true)) )),
% 0.12/0.36 inference(superposition,[],[f30,f17])).
% 0.12/0.36 thf(f17,plain,(
% 0.12/0.36 ( ! [X14 : $i,X12 : $i] : (((cS @ X14 @ (sK5 @ X14 @ X12)) = $true)) )),
% 0.12/0.36 inference(cnf_transformation,[],[f16])).
% 0.12/0.36 thf(f30,plain,(
% 0.12/0.36 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (cS @ (sK1 @ (sK3 @ (sK4 @ X1))) @ X2)) | ($true != (cF @ X2 @ (sK6 @ X0 @ X1))) | ((cF @ sK0 @ X1) != $true)) )),
% 0.12/0.36 inference(trivial_inequality_removal,[],[f27])).
% 0.12/0.36 thf(f27,plain,(
% 0.12/0.36 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (cS @ (sK1 @ (sK3 @ (sK4 @ X1))) @ X2)) | ($true != (cF @ X2 @ (sK6 @ X0 @ X1))) | ((cF @ sK0 @ X1) != $true) | ($true != $true)) )),
% 0.12/0.36 inference(superposition,[],[f18,f26])).
% 0.12/0.36 thf(f26,plain,(
% 0.12/0.36 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true = (cD @ X2 @ X3 @ X1)) | ($true != (cF @ X0 @ X2)) | ((cF @ sK0 @ X3) != $true) | ($true != (cS @ (sK1 @ (sK3 @ X1)) @ X0))) )),
% 0.12/0.36 inference(trivial_inequality_removal,[],[f25])).
% 0.12/0.36 thf(f25,plain,(
% 0.12/0.36 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true != (cS @ (sK1 @ (sK3 @ X1)) @ X0)) | ($true != $true) | ($true != (cF @ X0 @ X2)) | ((cF @ sK0 @ X3) != $true) | ($true = (cD @ X2 @ X3 @ X1))) )),
% 0.12/0.36 inference(superposition,[],[f20,f22])).
% 0.12/0.36 thf(f22,plain,(
% 0.12/0.36 ( ! [X3 : $i,X1 : $i] : (((cD @ X3 @ sK0 @ X1) = $true) | ((cS @ (sK1 @ X1) @ X3) != $true)) )),
% 0.12/0.36 inference(cnf_transformation,[],[f16])).
% 0.12/0.36 thf(f20,plain,(
% 0.12/0.36 ( ! [X10 : $i,X11 : $i,X8 : $i,X6 : $i,X9 : $i] : (($true != (cD @ X9 @ X8 @ (sK3 @ X6))) | ((cF @ X9 @ X11) != $true) | ((cF @ X8 @ X10) != $true) | ((cD @ X11 @ X10 @ X6) = $true)) )),
% 0.12/0.36 inference(cnf_transformation,[],[f16])).
% 0.12/0.36 thf(f18,plain,(
% 0.12/0.36 ( ! [X14 : $i,X12 : $i] : (($true != (cD @ (sK6 @ X14 @ X12) @ X12 @ (sK4 @ X12)))) )),
% 0.12/0.36 inference(cnf_transformation,[],[f16])).
% 0.12/0.36 % SZS output end Proof for theBenchmark
% 0.12/0.36 % (12074)------------------------------
% 0.12/0.36 % (12074)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (12074)Termination reason: Refutation
% 0.12/0.36
% 0.12/0.36 % (12074)Memory used [KB]: 5500
% 0.12/0.36 % (12074)Time elapsed: 0.008 s
% 0.12/0.36 % (12074)Instructions burned: 8 (million)
% 0.12/0.36 % (12074)------------------------------
% 0.12/0.36 % (12074)------------------------------
% 0.12/0.36 % (12068)Success in time 0.02 s
% 0.19/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------