TSTP Solution File: LCL594^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL594^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n021.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:07 EDT 2024
% Result : Theorem 0.15s 0.41s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : LCL594^1 : TPTP v8.2.0. Released v3.6.0.
% 0.13/0.16 % 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.15/0.37 % Computer : n021.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 02:59:38 EDT 2024
% 0.15/0.38 % CPUTime :
% 0.15/0.38 This is a TH0_THM_EQU_NAR problem
% 0.15/0.38 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.15/0.40 % (27431)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.15/0.40 % (27434)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.15/0.40 % (27428)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.15/0.40 % (27431)Instruction limit reached!
% 0.15/0.40 % (27431)------------------------------
% 0.15/0.40 % (27431)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (27434)Instruction limit reached!
% 0.15/0.40 % (27434)------------------------------
% 0.15/0.40 % (27434)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (27434)Termination reason: Unknown
% 0.15/0.40 % (27434)Termination phase: Property scanning
% 0.15/0.40
% 0.15/0.40 % (27434)Memory used [KB]: 1023
% 0.15/0.40 % (27434)Time elapsed: 0.003 s
% 0.15/0.40 % (27434)Instructions burned: 3 (million)
% 0.15/0.40 % (27434)------------------------------
% 0.15/0.40 % (27434)------------------------------
% 0.15/0.40 % (27431)Termination reason: Unknown
% 0.15/0.40 % (27431)Termination phase: Property scanning
% 0.15/0.40
% 0.15/0.40 % (27431)Memory used [KB]: 1023
% 0.15/0.40 % (27431)Time elapsed: 0.003 s
% 0.15/0.40 % (27431)Instructions burned: 3 (million)
% 0.15/0.40 % (27431)------------------------------
% 0.15/0.40 % (27431)------------------------------
% 0.15/0.40 % (27433)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.40 % (27428)Instruction limit reached!
% 0.15/0.40 % (27428)------------------------------
% 0.15/0.40 % (27428)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (27428)Termination reason: Unknown
% 0.15/0.40 % (27428)Termination phase: Saturation
% 0.15/0.40
% 0.15/0.40 % (27428)Memory used [KB]: 5500
% 0.15/0.40 % (27428)Time elapsed: 0.005 s
% 0.15/0.40 % (27428)Instructions burned: 4 (million)
% 0.15/0.40 % (27428)------------------------------
% 0.15/0.40 % (27428)------------------------------
% 0.15/0.40 % (27432)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.15/0.40 % (27432)Refutation not found, incomplete strategy
% 0.15/0.40 % (27432)------------------------------
% 0.15/0.40 % (27432)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (27432)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.40
% 0.15/0.40
% 0.15/0.40 % (27432)Memory used [KB]: 5500
% 0.15/0.40 % (27432)Time elapsed: 0.003 s
% 0.15/0.40 % (27432)Instructions burned: 3 (million)
% 0.15/0.40 % (27432)------------------------------
% 0.15/0.40 % (27432)------------------------------
% 0.15/0.40 % (27429)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.15/0.41 % (27433)First to succeed.
% 0.15/0.41 % (27427)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.15/0.41 % (27429)Refutation not found, incomplete strategy
% 0.15/0.41 % (27429)------------------------------
% 0.15/0.41 % (27429)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (27429)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.41
% 0.15/0.41
% 0.15/0.41 % (27429)Memory used [KB]: 5500
% 0.15/0.41 % (27429)Time elapsed: 0.007 s
% 0.15/0.41 % (27429)Instructions burned: 5 (million)
% 0.15/0.41 % (27429)------------------------------
% 0.15/0.41 % (27429)------------------------------
% 0.15/0.41 % (27433)Refutation found. Thanks to Tanya!
% 0.15/0.41 % SZS status Theorem for theBenchmark
% 0.15/0.41 % SZS output start Proof for theBenchmark
% 0.15/0.41 thf(type_def_6, type, individuals: $tType).
% 0.15/0.41 thf(func_def_1, type, prop_a: $i > $o).
% 0.15/0.41 thf(func_def_2, type, prop_b: $i > $o).
% 0.15/0.41 thf(func_def_3, type, prop_c: $i > $o).
% 0.15/0.41 thf(func_def_4, type, mfalse: $i > $o).
% 0.15/0.41 thf(func_def_5, type, mtrue: $i > $o).
% 0.15/0.41 thf(func_def_6, type, mnot: ($i > $o) > $i > $o).
% 0.15/0.41 thf(func_def_8, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.41 thf(func_def_9, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.41 thf(func_def_10, type, mimpl: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.41 thf(func_def_11, type, miff: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.41 thf(func_def_12, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.15/0.41 thf(func_def_13, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.15/0.41 thf(func_def_14, type, individuals: $tType).
% 0.15/0.41 thf(func_def_15, type, mall: (individuals > $i > $o) > $i > $o).
% 0.15/0.41 thf(func_def_16, type, mexists: (individuals > $i > $o) > $i > $o).
% 0.15/0.41 thf(func_def_17, type, mvalid: ($i > $o) > $o).
% 0.15/0.41 thf(func_def_18, type, msatisfiable: ($i > $o) > $o).
% 0.15/0.41 thf(func_def_19, type, mcountersatisfiable: ($i > $o) > $o).
% 0.15/0.41 thf(func_def_20, type, minvalid: ($i > $o) > $o).
% 0.15/0.41 thf(func_def_34, type, sK0: ($i > $i > $o) > $i > $o).
% 0.15/0.41 thf(func_def_36, type, sK2: ($i > $i > $o) > $i).
% 0.15/0.41 thf(func_def_38, type, ph3: !>[X0: $tType]:(X0)).
% 0.15/0.41 thf(f90,plain,(
% 0.15/0.41 $false),
% 0.15/0.41 inference(trivial_inequality_removal,[],[f87])).
% 0.15/0.41 thf(f87,plain,(
% 0.15/0.41 ($false != $false)),
% 0.15/0.41 inference(superposition,[],[f18,f85])).
% 0.15/0.41 thf(f85,plain,(
% 0.15/0.41 ( ! [X0 : $i > $i > $o] : (((X0 @ (sK2 @ X0) @ (sK2 @ X0)) = $false)) )),
% 0.15/0.41 inference(trivial_inequality_removal,[],[f81])).
% 0.15/0.41 thf(f81,plain,(
% 0.15/0.41 ( ! [X0 : $i > $i > $o] : (((X0 @ (sK2 @ X0) @ (sK2 @ X0)) = $false) | ($true = $false)) )),
% 0.15/0.41 inference(superposition,[],[f74,f79])).
% 0.15/0.41 thf(f79,plain,(
% 0.15/0.41 ( ! [X0 : $i > $i > $o,X1 : $i] : (((sK0 @ X0 @ X1) = $true) | ((X0 @ (sK2 @ X0) @ X1) = $false)) )),
% 0.15/0.41 inference(binary_proxy_clausification,[],[f78])).
% 0.15/0.41 thf(f78,plain,(
% 0.15/0.41 ( ! [X0 : $i > $i > $o,X1 : $i] : (($true = ((X0 @ (sK2 @ X0) @ X1) => (sK0 @ X0 @ X1)))) )),
% 0.15/0.41 inference(beta_eta_normalization,[],[f77])).
% 0.15/0.41 thf(f77,plain,(
% 0.15/0.41 ( ! [X0 : $i > $i > $o,X1 : $i] : ((((^[Y0 : $i]: ((X0 @ (sK2 @ X0) @ Y0) => (sK0 @ X0 @ Y0))) @ X1) = $true)) )),
% 0.15/0.41 inference(pi_clausification,[],[f76])).
% 0.15/0.41 thf(f76,plain,(
% 0.15/0.41 ( ! [X0 : $i > $i > $o] : (((!! @ $i @ (^[Y0 : $i]: ((X0 @ (sK2 @ X0) @ Y0) => (sK0 @ X0 @ Y0)))) = $true)) )),
% 0.15/0.41 inference(not_proxy_clausification,[],[f75])).
% 0.15/0.41 thf(f75,plain,(
% 0.15/0.41 ( ! [X0 : $i > $i > $o] : (((~ (!! @ $i @ (^[Y0 : $i]: ((X0 @ (sK2 @ X0) @ Y0) => (sK0 @ X0 @ Y0))))) = $false)) )),
% 0.15/0.41 inference(binary_proxy_clausification,[],[f73])).
% 0.15/0.41 thf(f73,plain,(
% 0.15/0.41 ( ! [X0 : $i > $i > $o] : ((((~ (!! @ $i @ (^[Y0 : $i]: ((X0 @ (sK2 @ X0) @ Y0) => (sK0 @ X0 @ Y0))))) | (sK0 @ X0 @ (sK2 @ X0))) = $false)) )),
% 0.15/0.41 inference(beta_eta_normalization,[],[f72])).
% 0.15/0.41 thf(f72,plain,(
% 0.15/0.41 ( ! [X0 : $i > $i > $o] : ((((^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((X0 @ Y0 @ Y1) => (sK0 @ X0 @ Y1))))) | (sK0 @ X0 @ Y0))) @ (sK2 @ X0)) = $false)) )),
% 0.15/0.41 inference(sigma_clausification,[],[f71])).
% 0.15/0.41 thf(f71,plain,(
% 0.15/0.41 ( ! [X0 : $i > $i > $o] : (((!! @ $i @ (^[Y0 : $i]: ((~ (!! @ $i @ (^[Y1 : $i]: ((X0 @ Y0 @ Y1) => (sK0 @ X0 @ Y1))))) | (sK0 @ X0 @ Y0)))) != $true)) )),
% 0.15/0.41 inference(beta_eta_normalization,[],[f70])).
% 0.15/0.41 thf(f70,plain,(
% 0.15/0.41 ( ! [X0 : $i > $i > $o] : ((((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ 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))))))))) @ X0 @ (sK0 @ X0)) @ (sK0 @ X0))) != $true)) )),
% 0.15/0.41 inference(definition_unfolding,[],[f61,f66,f68,f65])).
% 0.15/0.41 thf(f65,plain,(
% 0.15/0.41 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.15/0.41 inference(cnf_transformation,[],[f46])).
% 0.15/0.41 thf(f46,plain,(
% 0.15/0.41 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y0 @ Y2 @ Y3) => (Y1 @ Y3))))))))))),
% 0.15/0.41 inference(fool_elimination,[],[f45])).
% 0.15/0.41 thf(f45,plain,(
% 0.15/0.41 ((^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : ((X0 @ X2 @ X3) => (X1 @ X3)))) = mbox)),
% 0.15/0.41 inference(rectify,[],[f8])).
% 0.15/0.41 thf(f8,axiom,(
% 0.15/0.41 ((^[X4 : $i > $i > $o, X5 : $i > $o, X0 : $i] : (! [X2] : ((X4 @ X0 @ X2) => (X5 @ X2)))) = mbox)),
% 0.15/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox)).
% 0.15/0.41 thf(f68,plain,(
% 0.15/0.41 (mimpl = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))))),
% 0.15/0.41 inference(definition_unfolding,[],[f52,f59,f55])).
% 0.15/0.41 thf(f55,plain,(
% 0.15/0.41 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.15/0.41 inference(cnf_transformation,[],[f26])).
% 0.15/0.41 thf(f26,plain,(
% 0.15/0.41 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.15/0.41 inference(fool_elimination,[],[f25])).
% 0.15/0.41 thf(f25,plain,(
% 0.15/0.41 ((^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))) = mnot)),
% 0.15/0.41 inference(rectify,[],[f3])).
% 0.15/0.41 thf(f3,axiom,(
% 0.15/0.41 ((^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))) = mnot)),
% 0.15/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mnot)).
% 0.15/0.41 thf(f59,plain,(
% 0.15/0.41 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.15/0.41 inference(cnf_transformation,[],[f36])).
% 0.15/0.41 thf(f36,plain,(
% 0.15/0.41 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.15/0.41 inference(fool_elimination,[],[f35])).
% 0.15/0.41 thf(f35,plain,(
% 0.15/0.41 (mor = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X1 @ X2) | (X0 @ X2))))),
% 0.15/0.41 inference(rectify,[],[f4])).
% 0.15/0.41 thf(f4,axiom,(
% 0.15/0.41 (mor = (^[X0 : $i > $o, X2 : $i > $o, X1 : $i] : ((X2 @ X1) | (X0 @ X1))))),
% 0.15/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor)).
% 0.15/0.41 thf(f52,plain,(
% 0.15/0.41 (mimpl = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.15/0.41 inference(cnf_transformation,[],[f38])).
% 0.15/0.41 thf(f38,plain,(
% 0.15/0.41 (mimpl = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.15/0.41 inference(fool_elimination,[],[f37])).
% 0.15/0.41 thf(f37,plain,(
% 0.15/0.41 (mimpl = (^[X0 : $i > $o, X1 : $i > $o] : (mor @ (mnot @ X0) @ X1)))),
% 0.15/0.41 inference(rectify,[],[f6])).
% 0.15/0.41 thf(f6,axiom,(
% 0.15/0.41 (mimpl = (^[X1 : $i > $o, X3 : $i > $o] : (mor @ (mnot @ X1) @ X3)))),
% 0.15/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimpl)).
% 0.15/0.41 thf(f66,plain,(
% 0.15/0.41 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.15/0.41 inference(cnf_transformation,[],[f20])).
% 0.15/0.41 thf(f20,plain,(
% 0.15/0.41 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.15/0.41 inference(fool_elimination,[],[f19])).
% 0.15/0.41 thf(f19,plain,(
% 0.15/0.41 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.15/0.41 inference(rectify,[],[f12])).
% 0.15/0.41 thf(f12,axiom,(
% 0.15/0.41 ((^[X5 : $i > $o] : (! [X6] : (X5 @ X6))) = mvalid)),
% 0.15/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mvalid)).
% 0.15/0.41 thf(f61,plain,(
% 0.15/0.41 ( ! [X0 : $i > $i > $o] : (((mvalid @ (mimpl @ (mbox @ X0 @ (sK0 @ X0)) @ (sK0 @ X0))) != $true)) )),
% 0.15/0.41 inference(cnf_transformation,[],[f51])).
% 0.15/0.41 thf(f51,plain,(
% 0.15/0.41 ! [X0 : $i > $i > $o] : ((mvalid @ (mimpl @ (mbox @ X0 @ (sK0 @ X0)) @ (sK0 @ X0))) != $true)),
% 0.15/0.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f49,f50])).
% 0.15/0.41 thf(f50,plain,(
% 0.15/0.41 ! [X0 : $i > $i > $o] : (? [X1 : $i > $o] : ($true != (mvalid @ (mimpl @ (mbox @ X0 @ X1) @ X1))) => ((mvalid @ (mimpl @ (mbox @ X0 @ (sK0 @ X0)) @ (sK0 @ X0))) != $true))),
% 0.15/0.41 introduced(choice_axiom,[])).
% 0.15/0.41 thf(f49,plain,(
% 0.15/0.41 ! [X0 : $i > $i > $o] : ? [X1 : $i > $o] : ($true != (mvalid @ (mimpl @ (mbox @ X0 @ X1) @ X1)))),
% 0.15/0.41 inference(ennf_transformation,[],[f30])).
% 0.15/0.41 thf(f30,plain,(
% 0.15/0.41 ~? [X0 : $i > $i > $o] : ! [X1 : $i > $o] : ($true = (mvalid @ (mimpl @ (mbox @ X0 @ X1) @ X1)))),
% 0.15/0.41 inference(fool_elimination,[],[f29])).
% 0.15/0.41 thf(f29,plain,(
% 0.15/0.41 ~? [X0 : $i > $i > $o] : ! [X1 : $i > $o] : (mvalid @ (mimpl @ (mbox @ X0 @ X1) @ X1))),
% 0.15/0.41 inference(rectify,[],[f17])).
% 0.15/0.41 thf(f17,negated_conjecture,(
% 0.15/0.41 ~? [X4 : $i > $i > $o] : ! [X7 : $i > $o] : (mvalid @ (mimpl @ (mbox @ X4 @ X7) @ X7))),
% 0.15/0.41 inference(negated_conjecture,[],[f16])).
% 0.15/0.41 thf(f16,conjecture,(
% 0.15/0.41 ? [X4 : $i > $i > $o] : ! [X7 : $i > $o] : (mvalid @ (mimpl @ (mbox @ X4 @ X7) @ X7))),
% 0.15/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm)).
% 0.15/0.41 thf(f74,plain,(
% 0.15/0.41 ( ! [X0 : $i > $i > $o] : (((sK0 @ X0 @ (sK2 @ X0)) = $false)) )),
% 0.15/0.41 inference(binary_proxy_clausification,[],[f73])).
% 0.15/0.41 thf(f18,plain,(
% 0.15/0.41 ($true != $false)),
% 0.15/0.41 introduced(fool_axiom,[])).
% 0.15/0.41 % SZS output end Proof for theBenchmark
% 0.15/0.41 % (27433)------------------------------
% 0.15/0.41 % (27433)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.41 % (27433)Termination reason: Refutation
% 0.15/0.41
% 0.15/0.41 % (27433)Memory used [KB]: 5628
% 0.15/0.41 % (27433)Time elapsed: 0.010 s
% 0.15/0.41 % (27433)Instructions burned: 10 (million)
% 0.15/0.41 % (27433)------------------------------
% 0.15/0.41 % (27433)------------------------------
% 0.15/0.41 % (27426)Success in time 0.024 s
% 0.15/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------