TSTP Solution File: SEU967^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU967^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.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:52:23 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU967^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.13 % 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.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 17:25:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_NEQ_NAR problem
% 0.13/0.35 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.13/0.36 % (25566)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.13/0.37 % (25566)Refutation not found, incomplete strategy
% 0.13/0.37 % (25566)------------------------------
% 0.13/0.37 % (25566)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (25566)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 % (25566)Memory used [KB]: 5500
% 0.13/0.37 % (25566)Time elapsed: 0.005 s
% 0.13/0.37 % (25566)Instructions burned: 4 (million)
% 0.13/0.37 % (25566)------------------------------
% 0.13/0.37 % (25566)------------------------------
% 0.13/0.37 % (25564)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.13/0.37 % (25569)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.13/0.37 % (25567)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37 % (25564)First to succeed.
% 0.13/0.37 % (25571)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.13/0.37 % (25567)Instruction limit reached!
% 0.13/0.37 % (25567)------------------------------
% 0.13/0.37 % (25567)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (25567)Termination reason: Unknown
% 0.13/0.37 % (25567)Termination phase: Preprocessing 3
% 0.13/0.37
% 0.13/0.37 % (25567)Memory used [KB]: 895
% 0.13/0.38 % (25567)Time elapsed: 0.003 s
% 0.13/0.38 % (25567)Instructions burned: 2 (million)
% 0.13/0.38 % (25567)------------------------------
% 0.13/0.38 % (25567)------------------------------
% 0.13/0.38 % (25571)Instruction limit reached!
% 0.13/0.38 % (25571)------------------------------
% 0.13/0.38 % (25571)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (25571)Termination reason: Unknown
% 0.13/0.38 % (25571)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (25571)Memory used [KB]: 5500
% 0.13/0.38 % (25571)Time elapsed: 0.003 s
% 0.13/0.38 % (25571)Instructions burned: 3 (million)
% 0.13/0.38 % (25571)------------------------------
% 0.13/0.38 % (25571)------------------------------
% 0.13/0.38 % (25565)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.13/0.38 % (25569)Also succeeded, but the first one will report.
% 0.13/0.38 % (25564)Refutation found. Thanks to Tanya!
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38 % SZS output start Proof for theBenchmark
% 0.13/0.38 thf(func_def_0, type, cY_0: (($i > $i) > $o) > $i).
% 0.13/0.38 thf(func_def_1, type, cG_0: (($i > $i) > $o) > $i > $i).
% 0.13/0.38 thf(func_def_2, type, cP_0: $i > $o).
% 0.13/0.38 thf(func_def_3, type, cH_0: (($i > $i) > $o) > $i > $i).
% 0.13/0.38 thf(func_def_11, type, sK0: (($i > $i) > $i > $o) > $i).
% 0.13/0.38 thf(func_def_12, type, sK1: (($i > $i) > $i > $o) > $i).
% 0.13/0.38 thf(func_def_15, type, ph3: !>[X0: $tType]:(X0)).
% 0.13/0.38 thf(f26,plain,(
% 0.13/0.38 $false),
% 0.13/0.38 inference(trivial_inequality_removal,[],[f25])).
% 0.13/0.38 thf(f25,plain,(
% 0.13/0.38 ($false = $true)),
% 0.13/0.38 inference(beta_eta_normalization,[],[f22])).
% 0.13/0.38 thf(f22,plain,(
% 0.13/0.38 (((^[Y0 : $i > $i]: ((^[Y1 : $i]: ($false)))) @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ ((^[Y1 : $i > $i]: ((^[Y2 : $i]: ($false)))) @ Y0)))) @ (sK0 @ (^[Y0 : $i > $i]: ((^[Y1 : $i]: ($false)))))) = $true)),
% 0.13/0.38 inference(primitive_instantiation,[],[f18])).
% 0.13/0.38 thf(f18,plain,(
% 0.13/0.38 ( ! [X0 : ($i > $i) > $i > $o] : (((X0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (X0 @ Y0)))) @ (sK0 @ X0)) = $true)) )),
% 0.13/0.38 inference(beta_eta_normalization,[],[f14])).
% 0.13/0.38 thf(f14,plain,(
% 0.13/0.38 ( ! [X0 : ($i > $i) > $i > $o] : (((X0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ (sK0 @ X0)) = $true)) )),
% 0.13/0.38 inference(cnf_transformation,[],[f12])).
% 0.13/0.38 thf(f12,plain,(
% 0.13/0.38 ! [X0 : ($i > $i) > $i > $o] : (((((cP_0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1)))) @ (cY_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))))) != $true) & ((cP_0 @ (cY_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1)))))) = $true)) | ! [X1] : ((X0 @ (^[Y0 : $i]: (cG_0 @ (^[Y1 : $i > $i]: (?? @ $i @ (^[Y2 : $i]: (X0 @ Y1 @ Y2)))) @ (cH_0 @ (^[Y1 : $i > $i]: (?? @ $i @ (^[Y2 : $i]: (X0 @ Y1 @ Y2)))) @ Y0))) @ X1) != $true)) & ((X0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ (sK0 @ X0)) = $true) & ((X0 @ (cH_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ (sK1 @ X0)) = $true))),
% 0.13/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f11,f10])).
% 0.13/0.38 thf(f10,plain,(
% 0.13/0.38 ! [X0 : ($i > $i) > $i > $o] : (? [X2] : ((X0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ X2) = $true) => ((X0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ (sK0 @ X0)) = $true))),
% 0.13/0.38 introduced(choice_axiom,[])).
% 0.13/0.38 thf(f11,plain,(
% 0.13/0.38 ! [X0 : ($i > $i) > $i > $o] : (? [X3] : ((X0 @ (cH_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ X3) = $true) => ((X0 @ (cH_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ (sK1 @ X0)) = $true))),
% 0.13/0.38 introduced(choice_axiom,[])).
% 0.13/0.38 thf(f9,plain,(
% 0.13/0.38 ! [X0 : ($i > $i) > $i > $o] : (((((cP_0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1)))) @ (cY_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))))) != $true) & ((cP_0 @ (cY_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1)))))) = $true)) | ! [X1] : ((X0 @ (^[Y0 : $i]: (cG_0 @ (^[Y1 : $i > $i]: (?? @ $i @ (^[Y2 : $i]: (X0 @ Y1 @ Y2)))) @ (cH_0 @ (^[Y1 : $i > $i]: (?? @ $i @ (^[Y2 : $i]: (X0 @ Y1 @ Y2)))) @ Y0))) @ X1) != $true)) & ? [X2] : ((X0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ X2) = $true) & ? [X3] : ((X0 @ (cH_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ X3) = $true))),
% 0.13/0.38 inference(rectify,[],[f8])).
% 0.13/0.38 thf(f8,plain,(
% 0.13/0.38 ! [X0 : ($i > $i) > $i > $o] : (((((cP_0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1)))) @ (cY_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))))) != $true) & ((cP_0 @ (cY_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1)))))) = $true)) | ! [X3] : ((X0 @ (^[Y0 : $i]: (cG_0 @ (^[Y1 : $i > $i]: (?? @ $i @ (^[Y2 : $i]: (X0 @ Y1 @ Y2)))) @ (cH_0 @ (^[Y1 : $i > $i]: (?? @ $i @ (^[Y2 : $i]: (X0 @ Y1 @ Y2)))) @ Y0))) @ X3) != $true)) & ? [X2] : ((X0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ X2) = $true) & ? [X1] : ((X0 @ (cH_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ X1) = $true))),
% 0.13/0.38 inference(ennf_transformation,[],[f7])).
% 0.13/0.38 thf(f7,plain,(
% 0.13/0.38 ! [X0 : ($i > $i) > $i > $o] : (? [X1] : ((X0 @ (cH_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ X1) = $true) & ((((cP_0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1)))) @ (cY_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))))) != $true) & ((cP_0 @ (cY_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1)))))) = $true)) | ~? [X3] : ((X0 @ (^[Y0 : $i]: (cG_0 @ (^[Y1 : $i > $i]: (?? @ $i @ (^[Y2 : $i]: (X0 @ Y1 @ Y2)))) @ (cH_0 @ (^[Y1 : $i > $i]: (?? @ $i @ (^[Y2 : $i]: (X0 @ Y1 @ Y2)))) @ Y0))) @ X3) = $true)) & ? [X2] : ((X0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ X2) = $true))),
% 0.13/0.38 inference(flattening,[],[f6])).
% 0.13/0.38 thf(f6,plain,(
% 0.13/0.38 ~~! [X0 : ($i > $i) > $i > $o] : (? [X1] : ((X0 @ (cH_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ X1) = $true) & ? [X2] : ((X0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ X2) = $true) & (~? [X3] : ((X0 @ (^[Y0 : $i]: (cG_0 @ (^[Y1 : $i > $i]: (?? @ $i @ (^[Y2 : $i]: (X0 @ Y1 @ Y2)))) @ (cH_0 @ (^[Y1 : $i > $i]: (?? @ $i @ (^[Y2 : $i]: (X0 @ Y1 @ Y2)))) @ Y0))) @ X3) = $true) | (~((cP_0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1)))) @ (cY_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))))) = $true) & ((cP_0 @ (cY_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1)))))) = $true))))),
% 0.13/0.38 inference(rectify,[],[f5])).
% 0.13/0.38 thf(f5,plain,(
% 0.13/0.38 ~~! [X0 : ($i > $i) > $i > $o] : (? [X1] : ((X0 @ (cH_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ X1) = $true) & ? [X4] : ((X0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))) @ X4) = $true) & (~? [X7] : ((X0 @ (^[Y0 : $i]: (cG_0 @ (^[Y1 : $i > $i]: (?? @ $i @ (^[Y2 : $i]: (X0 @ Y1 @ Y2)))) @ (cH_0 @ (^[Y1 : $i > $i]: (?? @ $i @ (^[Y2 : $i]: (X0 @ Y1 @ Y2)))) @ Y0))) @ X7) = $true) | (~((cP_0 @ (cG_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1)))) @ (cY_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1))))))) = $true) & ((cP_0 @ (cY_0 @ (^[Y0 : $i > $i]: (?? @ $i @ (^[Y1 : $i]: (X0 @ Y0 @ Y1)))))) = $true))))),
% 0.13/0.38 inference(fool_elimination,[],[f4])).
% 0.13/0.38 thf(f4,plain,(
% 0.13/0.38 ~~! [X0 : ($i > $i) > $i > $o] : (? [X1] : (X0 @ (cH_0 @ (^[X2 : $i > $i] : (? [X3] : (X0 @ X2 @ X3)))) @ X1) & ? [X4] : (X0 @ (cG_0 @ (^[X5 : $i > $i] : (? [X6] : (X0 @ X5 @ X6)))) @ X4) & (~? [X7] : (X0 @ (^[X8 : $i] : (cG_0 @ (^[X9 : $i > $i] : (? [X10] : (X0 @ X9 @ X10))) @ (cH_0 @ (^[X11 : $i > $i] : (? [X12] : (X0 @ X11 @ X12))) @ X8))) @ X7) | (~(cP_0 @ (cG_0 @ (^[X13 : $i > $i] : (? [X14] : (X0 @ X13 @ X14))) @ (cY_0 @ (^[X15 : $i > $i] : (? [X16] : (X0 @ X15 @ X16)))))) & (cP_0 @ (cY_0 @ (^[X17 : $i > $i] : (? [X18] : (X0 @ X17 @ X18))))))))),
% 0.13/0.38 inference(rectify,[],[f2])).
% 0.13/0.38 thf(f2,negated_conjecture,(
% 0.13/0.38 ~~! [X0 : ($i > $i) > $i > $o] : (? [X1] : (X0 @ (cH_0 @ (^[X2 : $i > $i] : (? [X3] : (X0 @ X2 @ X3)))) @ X1) & ? [X1] : (X0 @ (cG_0 @ (^[X2 : $i > $i] : (? [X3] : (X0 @ X2 @ X3)))) @ X1) & (~? [X1] : (X0 @ (^[X4 : $i] : (cG_0 @ (^[X2 : $i > $i] : (? [X3] : (X0 @ X2 @ X3))) @ (cH_0 @ (^[X2 : $i > $i] : (? [X3] : (X0 @ X2 @ X3))) @ X4))) @ X1) | (~(cP_0 @ (cG_0 @ (^[X2 : $i > $i] : (? [X1] : (X0 @ X2 @ X1))) @ (cY_0 @ (^[X2 : $i > $i] : (? [X1] : (X0 @ X2 @ X1)))))) & (cP_0 @ (cY_0 @ (^[X2 : $i > $i] : (? [X1] : (X0 @ X2 @ X1))))))))),
% 0.13/0.38 inference(negated_conjecture,[],[f1])).
% 0.13/0.38 thf(f1,conjecture,(
% 0.13/0.38 ~! [X0 : ($i > $i) > $i > $o] : (? [X1] : (X0 @ (cH_0 @ (^[X2 : $i > $i] : (? [X3] : (X0 @ X2 @ X3)))) @ X1) & ? [X1] : (X0 @ (cG_0 @ (^[X2 : $i > $i] : (? [X3] : (X0 @ X2 @ X3)))) @ X1) & (~? [X1] : (X0 @ (^[X4 : $i] : (cG_0 @ (^[X2 : $i > $i] : (? [X3] : (X0 @ X2 @ X3))) @ (cH_0 @ (^[X2 : $i > $i] : (? [X3] : (X0 @ X2 @ X3))) @ X4))) @ X1) | (~(cP_0 @ (cG_0 @ (^[X2 : $i > $i] : (? [X1] : (X0 @ X2 @ X1))) @ (cY_0 @ (^[X2 : $i > $i] : (? [X1] : (X0 @ X2 @ X1)))))) & (cP_0 @ (cY_0 @ (^[X2 : $i > $i] : (? [X1] : (X0 @ X2 @ X1))))))))),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBUGWFFA_pme)).
% 0.13/0.38 % SZS output end Proof for theBenchmark
% 0.13/0.38 % (25564)------------------------------
% 0.13/0.38 % (25564)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (25564)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (25564)Memory used [KB]: 5500
% 0.13/0.38 % (25564)Time elapsed: 0.006 s
% 0.13/0.38 % (25564)Instructions burned: 4 (million)
% 0.13/0.38 % (25564)------------------------------
% 0.13/0.38 % (25564)------------------------------
% 0.13/0.38 % (25563)Success in time 0.027 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------