TSTP Solution File: LCL581^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL581^1 : TPTP v8.2.0. Released v3.6.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 : n015.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 00:16:03 EDT 2024
% Result : Theorem 0.12s 0.35s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : LCL581^1 : TPTP v8.2.0. Released v3.6.0.
% 0.02/0.12 % 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.12/0.33 % Computer : n015.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 02:55:22 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a TH0_THM_EQU_NAR problem
% 0.12/0.33 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.12/0.35 % (13702)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 % (13699)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.35 % (13700)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.35 % (13698)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 % (13701)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.12/0.35 % (13703)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 % (13704)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 % (13701)Instruction limit reached!
% 0.12/0.35 % (13701)------------------------------
% 0.12/0.35 % (13701)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (13701)Termination reason: Unknown
% 0.12/0.35 % (13701)Termination phase: shuffling
% 0.12/0.35 % (13702)Instruction limit reached!
% 0.12/0.35 % (13702)------------------------------
% 0.12/0.35 % (13702)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (13702)Termination reason: Unknown
% 0.12/0.35 % (13702)Termination phase: Property scanning
% 0.12/0.35
% 0.12/0.35 % (13702)Memory used [KB]: 1023
% 0.12/0.35 % (13702)Time elapsed: 0.003 s
% 0.12/0.35 % (13702)Instructions burned: 3 (million)
% 0.12/0.35 % (13702)------------------------------
% 0.12/0.35 % (13702)------------------------------
% 0.12/0.35
% 0.12/0.35 % (13701)Memory used [KB]: 1023
% 0.12/0.35 % (13701)Time elapsed: 0.003 s
% 0.12/0.35 % (13701)Instructions burned: 3 (million)
% 0.12/0.35 % (13701)------------------------------
% 0.12/0.35 % (13701)------------------------------
% 0.12/0.35 % (13705)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 % (13699)Instruction limit reached!
% 0.12/0.35 % (13699)------------------------------
% 0.12/0.35 % (13699)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (13699)Termination reason: Unknown
% 0.12/0.35 % (13699)Termination phase: Saturation
% 0.12/0.35
% 0.12/0.35 % (13698)First to succeed.
% 0.12/0.35 % (13699)Memory used [KB]: 5500
% 0.12/0.35 % (13703)Refutation not found, incomplete strategy
% 0.12/0.35 % (13703)------------------------------
% 0.12/0.35 % (13703)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (13699)Time elapsed: 0.004 s
% 0.12/0.35 % (13699)Instructions burned: 4 (million)
% 0.12/0.35 % (13699)------------------------------
% 0.12/0.35 % (13699)------------------------------
% 0.12/0.35 % (13703)Termination reason: Refutation not found, incomplete strategy
% 0.12/0.35
% 0.12/0.35
% 0.12/0.35 % (13703)Memory used [KB]: 5500
% 0.12/0.35 % (13703)Time elapsed: 0.003 s
% 0.12/0.35 % (13703)Instructions burned: 3 (million)
% 0.12/0.35 % (13703)------------------------------
% 0.12/0.35 % (13703)------------------------------
% 0.12/0.35 % (13704)Also succeeded, but the first one will report.
% 0.12/0.35 % (13705)Instruction limit reached!
% 0.12/0.35 % (13705)------------------------------
% 0.12/0.35 % (13705)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (13705)Termination reason: Unknown
% 0.12/0.35 % (13705)Termination phase: Property scanning
% 0.12/0.35
% 0.12/0.35 % (13705)Memory used [KB]: 1023
% 0.12/0.35 % (13705)Time elapsed: 0.004 s
% 0.12/0.35 % (13705)Instructions burned: 3 (million)
% 0.12/0.35 % (13705)------------------------------
% 0.12/0.35 % (13705)------------------------------
% 0.12/0.35 % (13698)Refutation found. Thanks to Tanya!
% 0.12/0.35 % SZS status Theorem for theBenchmark
% 0.12/0.35 % SZS output start Proof for theBenchmark
% 0.12/0.35 thf(type_def_6, type, individuals: $tType).
% 0.12/0.35 thf(func_def_1, type, prop_a: $i > $o).
% 0.12/0.35 thf(func_def_2, type, prop_b: $i > $o).
% 0.12/0.35 thf(func_def_3, type, prop_c: $i > $o).
% 0.12/0.35 thf(func_def_4, type, mfalse: $i > $o).
% 0.12/0.35 thf(func_def_5, type, mtrue: $i > $o).
% 0.12/0.35 thf(func_def_6, type, mnot: ($i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_8, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_9, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_10, type, mimpl: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_11, type, miff: ($i > $o) > ($i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_12, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_13, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_14, type, individuals: $tType).
% 0.12/0.35 thf(func_def_15, type, mall: (individuals > $i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_16, type, mexists: (individuals > $i > $o) > $i > $o).
% 0.12/0.35 thf(func_def_17, type, mvalid: ($i > $o) > $o).
% 0.12/0.35 thf(func_def_18, type, msatisfiable: ($i > $o) > $o).
% 0.12/0.35 thf(func_def_19, type, mcountersatisfiable: ($i > $o) > $o).
% 0.12/0.35 thf(func_def_20, type, minvalid: ($i > $o) > $o).
% 0.12/0.35 thf(func_def_21, type, a: $i > $o).
% 0.12/0.35 thf(func_def_22, type, r: $i > $i > $o).
% 0.12/0.35 thf(f73,plain,(
% 0.12/0.35 $false),
% 0.12/0.35 inference(trivial_inequality_removal,[],[f72])).
% 0.12/0.35 thf(f72,plain,(
% 0.12/0.35 ($true = $false)),
% 0.12/0.35 inference(beta_eta_normalization,[],[f71])).
% 0.12/0.35 thf(f71,plain,(
% 0.12/0.35 (((^[Y0 : $i]: ($true)) @ sK1) = $false)),
% 0.12/0.35 inference(sigma_clausification,[],[f70])).
% 0.12/0.35 thf(f70,plain,(
% 0.12/0.35 ($true != (!! @ $i @ (^[Y0 : $i]: ($true))))),
% 0.12/0.35 inference(boolean_simplification,[],[f69])).
% 0.12/0.35 thf(f69,plain,(
% 0.12/0.35 ($true != (!! @ $i @ (^[Y0 : $i]: ((!! @ $i @ (^[Y1 : $i]: ((r @ Y0 @ Y1) => (a @ Y1)))) | (~ (!! @ $i @ (^[Y1 : $i]: ((r @ Y0 @ Y1) => (a @ Y1)))))))))),
% 0.12/0.35 inference(beta_eta_normalization,[],[f68])).
% 0.12/0.35 thf(f68,plain,(
% 0.12/0.35 ($true != ((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))) @ r @ a) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))) @ r @ a))))),
% 0.12/0.35 inference(definition_unfolding,[],[f59,f51,f66,f55,f55])).
% 0.12/0.35 thf(f55,plain,(
% 0.12/0.35 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.12/0.35 inference(cnf_transformation,[],[f34])).
% 0.12/0.35 thf(f34,plain,(
% 0.12/0.35 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.12/0.35 inference(fool_elimination,[],[f33])).
% 0.12/0.35 thf(f33,plain,(
% 0.12/0.35 (mbox = (^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : ((X0 @ X2 @ X3) => (X1 @ X3)))))),
% 0.12/0.35 inference(rectify,[],[f8])).
% 0.12/0.35 thf(f8,axiom,(
% 0.12/0.35 (mbox = (^[X4 : $i > $i > $o, X5 : $i > $o, X0 : $i] : (! [X2] : ((X4 @ X0 @ X2) => (X5 @ X2)))))),
% 0.12/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox)).
% 0.12/0.35 thf(f66,plain,(
% 0.12/0.35 (mimpl = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y3 @ Y4) | (Y2 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))))),
% 0.12/0.35 inference(definition_unfolding,[],[f54,f58,f62])).
% 0.12/0.35 thf(f62,plain,(
% 0.12/0.35 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.12/0.35 inference(cnf_transformation,[],[f48])).
% 0.12/0.35 thf(f48,plain,(
% 0.12/0.35 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.12/0.35 inference(fool_elimination,[],[f47])).
% 0.12/0.35 thf(f47,plain,(
% 0.12/0.35 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.12/0.35 inference(rectify,[],[f3])).
% 0.12/0.35 thf(f3,axiom,(
% 0.12/0.35 (mnot = (^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))))),
% 0.12/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mnot)).
% 0.12/0.35 thf(f58,plain,(
% 0.12/0.35 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.12/0.35 inference(cnf_transformation,[],[f41])).
% 0.12/0.35 thf(f41,plain,(
% 0.12/0.35 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.12/0.35 inference(fool_elimination,[],[f40])).
% 0.12/0.35 thf(f40,plain,(
% 0.12/0.35 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))) = mor)),
% 0.12/0.35 inference(rectify,[],[f4])).
% 0.12/0.35 thf(f4,axiom,(
% 0.12/0.35 ((^[X0 : $i > $o, X2 : $i > $o, X1 : $i] : ((X0 @ X1) | (X2 @ X1))) = mor)),
% 0.12/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mor)).
% 0.12/0.35 thf(f54,plain,(
% 0.12/0.35 (mimpl = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.12/0.35 inference(cnf_transformation,[],[f24])).
% 0.12/0.35 thf(f24,plain,(
% 0.12/0.35 (mimpl = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.12/0.35 inference(fool_elimination,[],[f23])).
% 0.12/0.35 thf(f23,plain,(
% 0.12/0.35 (mimpl = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.12/0.35 inference(rectify,[],[f6])).
% 0.12/0.35 thf(f6,axiom,(
% 0.12/0.35 (mimpl = (^[X1 : $i > $o, X3 : $i > $o] : (mor @ (mnot @ X1) @ X3)))),
% 0.12/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimpl)).
% 0.12/0.35 thf(f51,plain,(
% 0.12/0.35 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.12/0.35 inference(cnf_transformation,[],[f30])).
% 0.12/0.35 thf(f30,plain,(
% 0.12/0.35 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.12/0.35 inference(fool_elimination,[],[f29])).
% 0.12/0.35 thf(f29,plain,(
% 0.12/0.35 (mvalid = (^[X0 : $i > $o] : (! [X1] : (X0 @ X1))))),
% 0.12/0.35 inference(rectify,[],[f12])).
% 0.12/0.35 thf(f12,axiom,(
% 0.12/0.35 (mvalid = (^[X5 : $i > $o] : (! [X6] : (X5 @ X6))))),
% 0.12/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mvalid)).
% 0.12/0.35 thf(f59,plain,(
% 0.12/0.35 ((mvalid @ (mimpl @ (mbox @ r @ a) @ (mbox @ r @ a))) != $true)),
% 0.12/0.35 inference(cnf_transformation,[],[f49])).
% 0.12/0.35 thf(f49,plain,(
% 0.12/0.35 ((mvalid @ (mimpl @ (mbox @ r @ a) @ (mbox @ r @ a))) != $true)),
% 0.12/0.35 inference(flattening,[],[f39])).
% 0.12/0.35 thf(f39,plain,(
% 0.12/0.35 ~((mvalid @ (mimpl @ (mbox @ r @ a) @ (mbox @ r @ a))) = $true)),
% 0.12/0.35 inference(fool_elimination,[],[f38])).
% 0.12/0.35 thf(f38,plain,(
% 0.12/0.35 ~(mvalid @ (mimpl @ (mbox @ r @ a) @ (mbox @ r @ a)))),
% 0.12/0.35 inference(rectify,[],[f17])).
% 0.12/0.35 thf(f17,negated_conjecture,(
% 0.12/0.35 ~(mvalid @ (mimpl @ (mbox @ r @ a) @ (mbox @ r @ a)))),
% 0.12/0.35 inference(negated_conjecture,[],[f16])).
% 0.12/0.35 thf(f16,conjecture,(
% 0.12/0.35 (mvalid @ (mimpl @ (mbox @ r @ a) @ (mbox @ r @ a)))),
% 0.12/0.35 file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm)).
% 0.12/0.35 % SZS output end Proof for theBenchmark
% 0.12/0.35 % (13698)------------------------------
% 0.12/0.35 % (13698)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.35 % (13698)Termination reason: Refutation
% 0.12/0.35
% 0.12/0.35 % (13698)Memory used [KB]: 5500
% 0.12/0.35 % (13698)Time elapsed: 0.005 s
% 0.12/0.35 % (13698)Instructions burned: 4 (million)
% 0.12/0.35 % (13698)------------------------------
% 0.12/0.35 % (13698)------------------------------
% 0.12/0.35 % (13697)Success in time 0.016 s
% 0.12/0.35 % Vampire---4.8 exiting
%------------------------------------------------------------------------------