TSTP Solution File: SYO053^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO053^2 : 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 : n009.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 09:02:31 EDT 2024
% Result : Theorem 0.20s 0.40s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO053^2 : TPTP v8.2.0. Released v4.0.0.
% 0.03/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 : n009.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.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 10:03:37 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_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.20/0.37 % (13354)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.20/0.37 % (13347)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.20/0.37 % (13350)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.37 % (13348)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.20/0.37 % (13349)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.20/0.37 % (13352)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.20/0.37 % (13351)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.20/0.37 % (13354)Instruction limit reached!
% 0.20/0.37 % (13354)------------------------------
% 0.20/0.37 % (13354)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (13354)Termination reason: Unknown
% 0.20/0.37 % (13354)Termination phase: shuffling
% 0.20/0.37
% 0.20/0.37 % (13354)Memory used [KB]: 1023
% 0.20/0.37 % (13354)Time elapsed: 0.003 s
% 0.20/0.37 % (13354)Instructions burned: 3 (million)
% 0.20/0.37 % (13354)------------------------------
% 0.20/0.37 % (13354)------------------------------
% 0.20/0.37 % (13350)Instruction limit reached!
% 0.20/0.37 % (13350)------------------------------
% 0.20/0.37 % (13350)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (13351)Instruction limit reached!
% 0.20/0.37 % (13351)------------------------------
% 0.20/0.37 % (13351)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (13350)Termination reason: Unknown
% 0.20/0.37 % (13350)Termination phase: shuffling
% 0.20/0.37
% 0.20/0.37 % (13350)Memory used [KB]: 1023
% 0.20/0.37 % (13350)Time elapsed: 0.003 s
% 0.20/0.37 % (13350)Instructions burned: 2 (million)
% 0.20/0.37 % (13350)------------------------------
% 0.20/0.37 % (13350)------------------------------
% 0.20/0.37 % (13353)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.20/0.37 % (13351)Termination reason: Unknown
% 0.20/0.37 % (13351)Termination phase: shuffling
% 0.20/0.37
% 0.20/0.37 % (13351)Memory used [KB]: 1023
% 0.20/0.37 % (13351)Time elapsed: 0.003 s
% 0.20/0.37 % (13351)Instructions burned: 2 (million)
% 0.20/0.37 % (13351)------------------------------
% 0.20/0.37 % (13351)------------------------------
% 0.20/0.37 % (13348)Instruction limit reached!
% 0.20/0.37 % (13348)------------------------------
% 0.20/0.37 % (13348)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (13348)Termination reason: Unknown
% 0.20/0.37 % (13348)Termination phase: Property scanning
% 0.20/0.37
% 0.20/0.37 % (13348)Memory used [KB]: 1023
% 0.20/0.37 % (13348)Time elapsed: 0.004 s
% 0.20/0.37 % (13348)Instructions burned: 4 (million)
% 0.20/0.37 % (13348)------------------------------
% 0.20/0.37 % (13348)------------------------------
% 0.20/0.37 % (13352)Refutation not found, incomplete strategy
% 0.20/0.37 % (13352)------------------------------
% 0.20/0.37 % (13352)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (13352)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (13352)Memory used [KB]: 5628
% 0.20/0.37 % (13352)Time elapsed: 0.006 s
% 0.20/0.37 % (13352)Instructions burned: 7 (million)
% 0.20/0.37 % (13352)------------------------------
% 0.20/0.37 % (13352)------------------------------
% 0.20/0.37 % (13347)Refutation not found, incomplete strategy
% 0.20/0.37 % (13347)------------------------------
% 0.20/0.37 % (13347)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (13347)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (13347)Memory used [KB]: 5628
% 0.20/0.37 % (13347)Time elapsed: 0.007 s
% 0.20/0.37 % (13347)Instructions burned: 9 (million)
% 0.20/0.37 % (13347)------------------------------
% 0.20/0.37 % (13347)------------------------------
% 0.20/0.37 % (13349)Refutation not found, incomplete strategy
% 0.20/0.37 % (13349)------------------------------
% 0.20/0.37 % (13349)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (13349)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (13349)Memory used [KB]: 5628
% 0.20/0.37 % (13349)Time elapsed: 0.007 s
% 0.20/0.37 % (13349)Instructions burned: 9 (million)
% 0.20/0.37 % (13349)------------------------------
% 0.20/0.37 % (13349)------------------------------
% 0.20/0.37 % (13353)Refutation not found, incomplete strategy
% 0.20/0.37 % (13353)------------------------------
% 0.20/0.37 % (13353)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (13353)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.38 % (13353)Memory used [KB]: 5628
% 0.20/0.38 % (13353)Time elapsed: 0.007 s
% 0.20/0.38 % (13353)Instructions burned: 8 (million)
% 0.20/0.38 % (13353)------------------------------
% 0.20/0.38 % (13353)------------------------------
% 0.20/0.38 % (13355)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.38 % (13356)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.38 % (13357)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.39 % (13357)Instruction limit reached!
% 0.20/0.39 % (13357)------------------------------
% 0.20/0.39 % (13357)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39 % (13357)Termination reason: Unknown
% 0.20/0.39 % (13357)Termination phase: shuffling
% 0.20/0.39
% 0.20/0.39 % (13357)Memory used [KB]: 1023
% 0.20/0.39 % (13357)Time elapsed: 0.003 s
% 0.20/0.39 % (13357)Instructions burned: 3 (million)
% 0.20/0.39 % (13357)------------------------------
% 0.20/0.39 % (13357)------------------------------
% 0.20/0.39 % (13358)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.20/0.39 % (13359)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.39 % (13360)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.20/0.39 % (13361)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.39 % (13356)Refutation not found, incomplete strategy
% 0.20/0.39 % (13356)------------------------------
% 0.20/0.39 % (13356)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39 % (13356)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 % (13356)Memory used [KB]: 5628
% 0.20/0.39 % (13356)Time elapsed: 0.006 s
% 0.20/0.39 % (13356)Instructions burned: 8 (million)
% 0.20/0.39 % (13356)------------------------------
% 0.20/0.39 % (13356)------------------------------
% 0.20/0.39 % (13362)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.39 % (13361)Instruction limit reached!
% 0.20/0.39 % (13361)------------------------------
% 0.20/0.39 % (13361)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39 % (13361)Termination reason: Unknown
% 0.20/0.39 % (13361)Termination phase: Property scanning
% 0.20/0.39
% 0.20/0.39 % (13361)Memory used [KB]: 1023
% 0.20/0.39 % (13361)Time elapsed: 0.004 s
% 0.20/0.39 % (13361)Instructions burned: 4 (million)
% 0.20/0.39 % (13361)------------------------------
% 0.20/0.39 % (13361)------------------------------
% 0.20/0.39 % (13362)Instruction limit reached!
% 0.20/0.39 % (13362)------------------------------
% 0.20/0.39 % (13362)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39 % (13362)Termination reason: Unknown
% 0.20/0.39 % (13362)Termination phase: shuffling
% 0.20/0.39
% 0.20/0.39 % (13362)Memory used [KB]: 1023
% 0.20/0.39 % (13362)Time elapsed: 0.004 s
% 0.20/0.39 % (13362)Instructions burned: 4 (million)
% 0.20/0.39 % (13362)------------------------------
% 0.20/0.39 % (13362)------------------------------
% 0.20/0.39 % (13359)Instruction limit reached!
% 0.20/0.39 % (13359)------------------------------
% 0.20/0.39 % (13359)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39 % (13359)Termination reason: Unknown
% 0.20/0.39 % (13359)Termination phase: Saturation
% 0.20/0.39
% 0.20/0.39 % (13359)Memory used [KB]: 1023
% 0.20/0.39 % (13359)Time elapsed: 0.006 s
% 0.20/0.39 % (13359)Instructions burned: 8 (million)
% 0.20/0.39 % (13359)------------------------------
% 0.20/0.39 % (13359)------------------------------
% 0.20/0.40 % (13358)First to succeed.
% 0.20/0.40 % (13355)Also succeeded, but the first one will report.
% 0.20/0.40 % (13358)Refutation found. Thanks to Tanya!
% 0.20/0.40 % SZS status Theorem for theBenchmark
% 0.20/0.40 % SZS output start Proof for theBenchmark
% 0.20/0.40 thf(type_def_5, type, mu: $tType).
% 0.20/0.40 thf(func_def_0, type, mu: $tType).
% 0.20/0.40 thf(func_def_1, type, meq_ind: mu > mu > $i > $o).
% 0.20/0.40 thf(func_def_2, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.40 thf(func_def_4, type, mnot: ($i > $o) > $i > $o).
% 0.20/0.40 thf(func_def_5, type, mor: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.40 thf(func_def_6, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.40 thf(func_def_7, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.40 thf(func_def_8, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.40 thf(func_def_9, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.40 thf(func_def_10, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.40 thf(func_def_11, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.20/0.40 thf(func_def_12, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.20/0.40 thf(func_def_13, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.20/0.40 thf(func_def_14, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
% 0.20/0.40 thf(func_def_15, type, mtrue: $i > $o).
% 0.20/0.40 thf(func_def_16, type, mfalse: $i > $o).
% 0.20/0.40 thf(func_def_17, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.20/0.40 thf(func_def_18, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.20/0.40 thf(func_def_19, type, mreflexive: ($i > $i > $o) > $o).
% 0.20/0.40 thf(func_def_20, type, msymmetric: ($i > $i > $o) > $o).
% 0.20/0.40 thf(func_def_21, type, mserial: ($i > $i > $o) > $o).
% 0.20/0.40 thf(func_def_22, type, mtransitive: ($i > $i > $o) > $o).
% 0.20/0.40 thf(func_def_23, type, meuclidean: ($i > $i > $o) > $o).
% 0.20/0.40 thf(func_def_24, type, mpartially_functional: ($i > $i > $o) > $o).
% 0.20/0.40 thf(func_def_25, type, mfunctional: ($i > $i > $o) > $o).
% 0.20/0.40 thf(func_def_26, type, mweakly_dense: ($i > $i > $o) > $o).
% 0.20/0.40 thf(func_def_27, type, mweakly_connected: ($i > $i > $o) > $o).
% 0.20/0.40 thf(func_def_28, type, mweakly_directed: ($i > $i > $o) > $o).
% 0.20/0.40 thf(func_def_29, type, mvalid: ($i > $o) > $o).
% 0.20/0.40 thf(func_def_30, type, minvalid: ($i > $o) > $o).
% 0.20/0.40 thf(func_def_31, type, msatisfiable: ($i > $o) > $o).
% 0.20/0.40 thf(func_def_32, type, mcountersatisfiable: ($i > $o) > $o).
% 0.20/0.40 thf(func_def_49, type, ph1: !>[X0: $tType]:(X0)).
% 0.20/0.40 thf(func_def_50, type, sK2: ($i > $i > $o) > $i > $i).
% 0.20/0.40 thf(f167,plain,(
% 0.20/0.40 $false),
% 0.20/0.40 inference(trivial_inequality_removal,[],[f166])).
% 0.20/0.40 thf(f166,plain,(
% 0.20/0.40 ($false = $true)),
% 0.20/0.40 inference(beta_eta_normalization,[],[f162])).
% 0.20/0.40 thf(f162,plain,(
% 0.20/0.40 ( ! [X2 : $i] : ((((^[Y0 : $i]: ((^[Y1 : $i]: ($false)))) @ X2 @ (sK2 @ (^[Y0 : $i]: ((^[Y1 : $i]: ($false)))) @ X2)) = $true)) )),
% 0.20/0.40 inference(primitive_instantiation,[],[f156])).
% 0.20/0.40 thf(f156,plain,(
% 0.20/0.40 ( ! [X2 : $i,X1 : $i > $i > $o] : (((X1 @ X2 @ (sK2 @ X1 @ X2)) = $true)) )),
% 0.20/0.40 inference(not_proxy_clausification,[],[f155])).
% 0.20/0.40 thf(f155,plain,(
% 0.20/0.40 ( ! [X2 : $i,X1 : $i > $i > $o] : (((~ (X1 @ X2 @ (sK2 @ X1 @ X2))) = $false)) )),
% 0.20/0.40 inference(beta_eta_normalization,[],[f154])).
% 0.20/0.40 thf(f154,plain,(
% 0.20/0.40 ( ! [X2 : $i,X1 : $i > $i > $o] : ((((^[Y0 : $i]: (~ (X1 @ X2 @ Y0))) @ (sK2 @ X1 @ X2)) = $false)) )),
% 0.20/0.40 inference(sigma_clausification,[],[f151])).
% 0.20/0.40 thf(f151,plain,(
% 0.20/0.40 ( ! [X2 : $i,X1 : $i > $i > $o] : (((!! @ $i @ (^[Y0 : $i]: (~ (X1 @ X2 @ Y0)))) = $false)) )),
% 0.20/0.40 inference(not_proxy_clausification,[],[f150])).
% 0.20/0.40 thf(f150,plain,(
% 0.20/0.40 ( ! [X2 : $i,X1 : $i > $i > $o] : (((~ (!! @ $i @ (^[Y0 : $i]: (~ (X1 @ X2 @ Y0))))) = $true)) )),
% 0.20/0.40 inference(beta_eta_normalization,[],[f149])).
% 0.20/0.40 thf(f149,plain,(
% 0.20/0.40 ( ! [X2 : $i,X1 : $i > $i > $o] : ((((^[Y0 : $i]: (~ (!! @ $i @ (^[Y1 : $i]: (~ (X1 @ Y0 @ Y1)))))) @ X2) = $true)) )),
% 0.20/0.40 inference(pi_clausification,[],[f146])).
% 0.20/0.40 thf(f146,plain,(
% 0.20/0.40 ( ! [X1 : $i > $i > $o] : (((!! @ $i @ (^[Y0 : $i]: (~ (!! @ $i @ (^[Y1 : $i]: (~ (X1 @ Y0 @ Y1))))))) = $true)) )),
% 0.20/0.40 inference(not_proxy_clausification,[],[f145])).
% 0.20/0.40 thf(f145,plain,(
% 0.20/0.40 ( ! [X1 : $i > $i > $o] : (((~ (!! @ $i @ (^[Y0 : $i]: (~ (!! @ $i @ (^[Y1 : $i]: (~ (X1 @ Y0 @ Y1)))))))) = $false)) )),
% 0.20/0.40 inference(beta_eta_normalization,[],[f144])).
% 0.20/0.40 thf(f144,plain,(
% 0.20/0.40 ( ! [X1 : $i > $i > $o] : (($false = ((^[Y0 : $i > $i > $o]: (~ (!! @ $i @ (^[Y1 : $i]: (~ (!! @ $i @ (^[Y2 : $i]: (~ (Y0 @ Y1 @ Y2))))))))) @ X1))) )),
% 0.20/0.40 inference(pi_clausification,[],[f141])).
% 0.20/0.40 thf(f141,plain,(
% 0.20/0.40 ($false = (?? @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: (~ (!! @ $i @ (^[Y1 : $i]: (~ (!! @ $i @ (^[Y2 : $i]: (~ (Y0 @ Y1 @ Y2)))))))))))),
% 0.20/0.40 inference(not_proxy_clausification,[],[f140])).
% 0.20/0.40 thf(f140,plain,(
% 0.20/0.40 ($true = (~ (?? @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: (~ (!! @ $i @ (^[Y1 : $i]: (~ (!! @ $i @ (^[Y2 : $i]: (~ (Y0 @ Y1 @ Y2))))))))))))),
% 0.20/0.40 inference(boolean_simplification,[],[f139])).
% 0.20/0.40 thf(f139,plain,(
% 0.20/0.40 ($true = (~ (?? @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: (~ (!! @ $i @ (^[Y1 : $i]: (~ (!! @ $i @ (^[Y2 : $i]: ($false | (~ (Y0 @ Y1 @ Y2)))))))))))))),
% 0.20/0.40 inference(boolean_simplification,[],[f138])).
% 0.20/0.40 thf(f138,plain,(
% 0.20/0.40 ((~ (?? @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: (~ (!! @ $i @ (^[Y1 : $i]: (~ (!! @ $i @ (^[Y2 : $i]: ((~ $true) | (~ (Y0 @ Y1 @ Y2)))))))))))) = $true)),
% 0.20/0.40 inference(beta_eta_normalization,[],[f137])).
% 0.20/0.40 thf(f137,plain,(
% 0.20/0.40 ($true = (~ (?? @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: (~ ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: (Y1 @ Y2)))) @ ((^[Y1 : $i > $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ ((^[Y3 : $i > $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i]: (!! @ $i @ (^[Y6 : $i]: ((Y4 @ Y6) | (~ (Y3 @ Y5 @ Y6)))))))))) @ Y1 @ ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ Y2)))))) @ Y0 @ (^[Y1 : $i]: ($true)))))))))),
% 0.20/0.40 inference(definition_unfolding,[],[f104,f115,f136,f103])).
% 0.20/0.40 thf(f103,plain,(
% 0.20/0.40 (mtrue = (^[Y0 : $i]: ($true)))),
% 0.20/0.40 inference(cnf_transformation,[],[f56])).
% 0.20/0.40 thf(f56,plain,(
% 0.20/0.40 (mtrue = (^[Y0 : $i]: ($true)))),
% 0.20/0.40 inference(fool_elimination,[],[f55])).
% 0.20/0.40 thf(f55,plain,(
% 0.20/0.40 ((^[X0 : $i] : ($true)) = mtrue)),
% 0.20/0.40 inference(rectify,[],[f14])).
% 0.20/0.40 thf(f14,axiom,(
% 0.20/0.40 ((^[X2 : $i] : ($true)) = mtrue)),
% 0.20/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mtrue)).
% 0.20/0.40 thf(f136,plain,(
% 0.20/0.40 (mdia = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ ((^[Y2 : $i > $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (!! @ $i @ (^[Y5 : $i]: ((Y3 @ Y5) | (~ (Y2 @ Y4 @ Y5)))))))))) @ Y0 @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))))),
% 0.20/0.40 inference(definition_unfolding,[],[f125,f101,f96,f101])).
% 0.20/0.40 thf(f96,plain,(
% 0.20/0.40 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (Y0 @ Y2 @ Y3)))))))))))),
% 0.20/0.40 inference(cnf_transformation,[],[f60])).
% 0.20/0.40 thf(f60,plain,(
% 0.20/0.40 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) | (~ (Y0 @ Y2 @ Y3)))))))))))),
% 0.20/0.40 inference(fool_elimination,[],[f59])).
% 0.20/0.40 thf(f59,plain,(
% 0.20/0.40 (mbox = (^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i] : (! [X3] : (~(X0 @ X2 @ X3) | (X1 @ X3)))))),
% 0.20/0.40 inference(rectify,[],[f16])).
% 0.20/0.40 thf(f16,axiom,(
% 0.20/0.40 (mbox = (^[X6 : $i > $i > $o, X3 : $i > $o, X2 : $i] : (! [X7] : (~(X6 @ X2 @ X7) | (X3 @ X7)))))),
% 0.20/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox)).
% 0.20/0.40 thf(f101,plain,(
% 0.20/0.40 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.20/0.40 inference(cnf_transformation,[],[f80])).
% 0.20/0.40 thf(f80,plain,(
% 0.20/0.40 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.20/0.40 inference(fool_elimination,[],[f79])).
% 0.20/0.40 thf(f79,plain,(
% 0.20/0.40 ((^[X0 : $i > $o, X1 : $i] : (~(X0 @ X1))) = mnot)),
% 0.20/0.40 inference(rectify,[],[f3])).
% 0.20/0.40 thf(f3,axiom,(
% 0.20/0.40 ((^[X3 : $i > $o, X2 : $i] : (~(X3 @ X2))) = mnot)),
% 0.20/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mnot)).
% 0.20/0.40 thf(f125,plain,(
% 0.20/0.40 (mdia = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mbox @ Y0 @ (mnot @ Y1)))))))),
% 0.20/0.40 inference(cnf_transformation,[],[f74])).
% 0.20/0.40 thf(f74,plain,(
% 0.20/0.40 (mdia = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mbox @ Y0 @ (mnot @ Y1)))))))),
% 0.20/0.40 inference(fool_elimination,[],[f73])).
% 0.20/0.40 thf(f73,plain,(
% 0.20/0.40 (mdia = (^[X0 : $i > $i > $o, X1 : $i > $o] : (mnot @ (mbox @ X0 @ (mnot @ X1)))))),
% 0.20/0.40 inference(rectify,[],[f17])).
% 0.20/0.40 thf(f17,axiom,(
% 0.20/0.40 (mdia = (^[X6 : $i > $i > $o, X3 : $i > $o] : (mnot @ (mbox @ X6 @ (mnot @ X3)))))),
% 0.20/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mdia)).
% 0.20/0.40 thf(f115,plain,(
% 0.20/0.40 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.20/0.40 inference(cnf_transformation,[],[f84])).
% 0.20/0.40 thf(f84,plain,(
% 0.20/0.40 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.20/0.40 inference(fool_elimination,[],[f83])).
% 0.20/0.40 thf(f83,plain,(
% 0.20/0.40 ((^[X0 : $i > $o] : (! [X1] : (X0 @ X1))) = mvalid)),
% 0.20/0.40 inference(rectify,[],[f28])).
% 0.20/0.40 thf(f28,axiom,(
% 0.20/0.40 ((^[X3 : $i > $o] : (! [X2] : (X3 @ X2))) = mvalid)),
% 0.20/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',mvalid)).
% 0.20/0.40 thf(f104,plain,(
% 0.20/0.40 ((~ (?? @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: (~ (mvalid @ (mdia @ Y0 @ mtrue)))))) = $true)),
% 0.20/0.40 inference(cnf_transformation,[],[f66])).
% 0.20/0.40 thf(f66,plain,(
% 0.20/0.40 ((~ (?? @ ($i > $i > $o) @ (^[Y0 : $i > $i > $o]: (~ (mvalid @ (mdia @ Y0 @ mtrue)))))) = $true)),
% 0.20/0.40 inference(fool_elimination,[],[f65])).
% 0.20/0.40 thf(f65,plain,(
% 0.20/0.40 ~? [X0 : $i > $i > $o] : ~(mvalid @ (mdia @ X0 @ mtrue))),
% 0.20/0.40 inference(rectify,[],[f33])).
% 0.20/0.40 thf(f33,negated_conjecture,(
% 0.20/0.40 ~? [X6 : $i > $i > $o] : ~(mvalid @ (mdia @ X6 @ mtrue))),
% 0.20/0.40 inference(negated_conjecture,[],[f32])).
% 0.20/0.40 thf(f32,conjecture,(
% 0.20/0.40 ? [X6 : $i > $i > $o] : ~(mvalid @ (mdia @ X6 @ mtrue))),
% 0.20/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)).
% 0.20/0.40 % SZS output end Proof for theBenchmark
% 0.20/0.40 % (13358)------------------------------
% 0.20/0.40 % (13358)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (13358)Termination reason: Refutation
% 0.20/0.40
% 0.20/0.40 % (13358)Memory used [KB]: 5628
% 0.20/0.40 % (13358)Time elapsed: 0.011 s
% 0.20/0.40 % (13358)Instructions burned: 12 (million)
% 0.20/0.40 % (13358)------------------------------
% 0.20/0.40 % (13358)------------------------------
% 0.20/0.40 % (13346)Success in time 0.028 s
% 0.20/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------