TSTP Solution File: LCL580^1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : LCL580^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% 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 : Mon Jun 24 11:26:59 EDT 2024
% Result : Theorem 0.12s 0.38s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL580^1 : TPTP v8.2.0. Released v3.6.0.
% 0.11/0.12 % Command : run_vampire %s %d THM
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Jun 22 17:15:24 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.36 This is a TH0_THM_EQU_NAR problem
% 0.12/0.36 Running higher-order theorem proving
% 0.12/0.36 Running /export/starexec/sandbox2/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/benchmark/theBenchmark.p -m 16384 -t 300
% 0.12/0.38 % (32150)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.12/0.38 % (32155)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.38 % (32151)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.38 % (32153)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.12/0.38 % (32149)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.38 % (32154)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.38 % (32156)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.38 % (32153)Instruction limit reached!
% 0.12/0.38 % (32153)------------------------------
% 0.12/0.38 % (32153)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.38 % (32153)Termination reason: Unknown
% 0.12/0.38 % (32154)Instruction limit reached!
% 0.12/0.38 % (32154)------------------------------
% 0.12/0.38 % (32154)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.38 % (32154)Termination reason: Unknown
% 0.12/0.38 % (32154)Termination phase: Property scanning
% 0.12/0.38
% 0.12/0.38 % (32154)Memory used [KB]: 1023
% 0.12/0.38 % (32154)Time elapsed: 0.004 s
% 0.12/0.38 % (32154)Instructions burned: 2 (million)
% 0.12/0.38 % (32154)------------------------------
% 0.12/0.38 % (32154)------------------------------
% 0.12/0.38 % (32153)Termination phase: Clausification
% 0.12/0.38
% 0.12/0.38 % (32153)Memory used [KB]: 1023
% 0.12/0.38 % (32153)Time elapsed: 0.004 s
% 0.12/0.38 % (32153)Instructions burned: 2 (million)
% 0.12/0.38 % (32153)------------------------------
% 0.12/0.38 % (32153)------------------------------
% 0.12/0.38 % (32149)First to succeed.
% 0.12/0.38 % (32155)Refutation not found, incomplete strategy
% 0.12/0.38 % (32155)------------------------------
% 0.12/0.38 % (32155)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.38 % (32155)Termination reason: Refutation not found, incomplete strategy
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 % (32155)Memory used [KB]: 5500
% 0.12/0.38 % (32155)Time elapsed: 0.004 s
% 0.12/0.38 % (32155)Instructions burned: 2 (million)
% 0.12/0.38 % (32155)------------------------------
% 0.12/0.38 % (32155)------------------------------
% 0.12/0.38 % (32151)Also succeeded, but the first one will report.
% 0.12/0.38 % (32156)Also succeeded, but the first one will report.
% 0.12/0.38 % (32149)Refutation found. Thanks to Tanya!
% 0.12/0.38 % SZS status Theorem for theBenchmark
% 0.12/0.38 % SZS output start Proof for theBenchmark
% 0.12/0.38 thf(type_def_6, type, individuals: $tType).
% 0.12/0.38 thf(func_def_1, type, prop_a: $i > $o).
% 0.12/0.38 thf(func_def_2, type, prop_b: $i > $o).
% 0.12/0.38 thf(func_def_3, type, prop_c: $i > $o).
% 0.12/0.38 thf(func_def_4, type, mfalse: $i > $o).
% 0.12/0.38 thf(func_def_5, type, mtrue: $i > $o).
% 0.12/0.38 thf(func_def_6, type, mnot: ($i > $o) > $i > $o).
% 0.12/0.38 thf(func_def_8, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.38 thf(func_def_9, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.38 thf(func_def_10, type, mimpl: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.38 thf(func_def_11, type, miff: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.38 thf(func_def_12, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.12/0.38 thf(func_def_13, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.12/0.38 thf(func_def_14, type, individuals: $tType).
% 0.12/0.38 thf(func_def_15, type, mall: (individuals > $i > $o) > $i > $o).
% 0.12/0.38 thf(func_def_16, type, mexists: (individuals > $i > $o) > $i > $o).
% 0.12/0.38 thf(func_def_17, type, mvalid: ($i > $o) > $o).
% 0.12/0.38 thf(func_def_18, type, msatisfiable: ($i > $o) > $o).
% 0.12/0.38 thf(func_def_19, type, mcountersatisfiable: ($i > $o) > $o).
% 0.12/0.38 thf(func_def_20, type, minvalid: ($i > $o) > $o).
% 0.12/0.38 thf(func_def_21, type, r: $i > $i > $o).
% 0.12/0.38 thf(f75,plain,(
% 0.12/0.38 $false),
% 0.12/0.38 inference(trivial_inequality_removal,[],[f74])).
% 0.12/0.38 thf(f74,plain,(
% 0.12/0.38 ($true = $false)),
% 0.12/0.38 inference(beta_eta_normalization,[],[f73])).
% 0.12/0.38 thf(f73,plain,(
% 0.12/0.38 (((^[Y0 : $i]: ($true)) @ sK2) = $false)),
% 0.12/0.38 inference(sigma_clausification,[],[f72])).
% 0.12/0.38 thf(f72,plain,(
% 0.12/0.38 ($false = (!! @ $i @ (^[Y0 : $i]: ($true))))),
% 0.12/0.38 inference(beta_eta_normalization,[],[f71])).
% 0.12/0.38 thf(f71,plain,(
% 0.12/0.38 ($false = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ($true)))) @ sK1))),
% 0.12/0.38 inference(sigma_clausification,[],[f70])).
% 0.12/0.38 thf(f70,plain,(
% 0.12/0.38 ($true != (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ($true))))))),
% 0.12/0.38 inference(boolean_simplification,[],[f69])).
% 0.12/0.38 thf(f69,plain,(
% 0.12/0.38 ($true != (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((r @ Y0 @ Y1) => $true))))))),
% 0.12/0.38 inference(beta_eta_normalization,[],[f68])).
% 0.12/0.38 thf(f68,plain,(
% 0.12/0.39 ($true != ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))) @ r @ (^[Y0 : $i]: ($true)))))),
% 0.12/0.39 inference(definition_unfolding,[],[f63,f58,f55,f61])).
% 0.12/0.39 thf(f61,plain,(
% 0.12/0.39 (mtrue = (^[Y0 : $i]: ($true)))),
% 0.12/0.39 inference(cnf_transformation,[],[f29])).
% 0.12/0.39 thf(f29,plain,(
% 0.12/0.39 (mtrue = (^[Y0 : $i]: ($true)))),
% 0.12/0.39 inference(fool_elimination,[],[f2])).
% 0.12/0.39 thf(f2,axiom,(
% 0.12/0.39 ((^[X0 : $i] : ($true)) = mtrue)),
% 0.12/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mtrue)).
% 0.12/0.39 thf(f55,plain,(
% 0.12/0.39 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.12/0.39 inference(cnf_transformation,[],[f41])).
% 0.12/0.39 thf(f41,plain,(
% 0.12/0.39 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.12/0.39 inference(fool_elimination,[],[f40])).
% 0.12/0.39 thf(f40,plain,(
% 0.12/0.39 (mbox = (^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : ((X0 @ X2 @ X3) => (X1 @ X3)))))),
% 0.12/0.39 inference(rectify,[],[f8])).
% 0.12/0.39 thf(f8,axiom,(
% 0.12/0.39 (mbox = (^[X4 : $i > $i > $o, X5 : $i > $o, X0 : $i] : (! [X2] : ((X4 @ X0 @ X2) => (X5 @ X2)))))),
% 0.12/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox)).
% 0.12/0.39 thf(f58,plain,(
% 0.12/0.39 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.12/0.39 inference(cnf_transformation,[],[f20])).
% 0.12/0.39 thf(f20,plain,(
% 0.12/0.39 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.12/0.39 inference(fool_elimination,[],[f19])).
% 0.12/0.39 thf(f19,plain,(
% 0.12/0.39 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.12/0.39 inference(rectify,[],[f12])).
% 0.12/0.39 thf(f12,axiom,(
% 0.12/0.39 ((^[X5 : $i > $o] : (! [X6] : (X5 @ X6))) = mvalid)),
% 0.12/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.12/0.39 thf(f63,plain,(
% 0.12/0.39 ((mvalid @ (mbox @ r @ mtrue)) != $true)),
% 0.12/0.39 inference(cnf_transformation,[],[f49])).
% 0.12/0.39 thf(f49,plain,(
% 0.12/0.39 ((mvalid @ (mbox @ r @ mtrue)) != $true)),
% 0.12/0.39 inference(flattening,[],[f24])).
% 0.12/0.39 thf(f24,plain,(
% 0.12/0.39 ~((mvalid @ (mbox @ r @ mtrue)) = $true)),
% 0.12/0.39 inference(fool_elimination,[],[f23])).
% 0.12/0.39 thf(f23,plain,(
% 0.12/0.39 ~(mvalid @ (mbox @ r @ mtrue))),
% 0.12/0.39 inference(rectify,[],[f17])).
% 0.12/0.39 thf(f17,negated_conjecture,(
% 0.12/0.39 ~(mvalid @ (mbox @ r @ mtrue))),
% 0.12/0.39 inference(negated_conjecture,[],[f16])).
% 0.12/0.39 thf(f16,conjecture,(
% 0.12/0.39 (mvalid @ (mbox @ r @ mtrue))),
% 0.12/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm)).
% 0.12/0.39 % SZS output end Proof for theBenchmark
% 0.12/0.39 % (32149)------------------------------
% 0.12/0.39 % (32149)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.39 % (32149)Termination reason: Refutation
% 0.12/0.39
% 0.12/0.39 % (32149)Memory used [KB]: 5500
% 0.12/0.39 % (32149)Time elapsed: 0.006 s
% 0.12/0.39 % (32149)Instructions burned: 3 (million)
% 0.12/0.39 % (32149)------------------------------
% 0.12/0.39 % (32149)------------------------------
% 0.12/0.39 % (32148)Success in time 0.008 s
%------------------------------------------------------------------------------