TSTP Solution File: SYO539^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO539^1 : TPTP v8.2.0. Released v5.2.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 : n020.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:06:08 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.12/0.12 % Problem : SYO539^1 : TPTP v8.2.0. Released v5.2.0.
% 0.12/0.14 % 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.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 09:26:08 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.13/0.36 % (11601)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.37 % (11601)Instruction limit reached!
% 0.13/0.37 % (11601)------------------------------
% 0.13/0.37 % (11601)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (11601)Termination reason: Unknown
% 0.13/0.37 % (11601)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (11601)Memory used [KB]: 5500
% 0.13/0.37 % (11601)Time elapsed: 0.003 s
% 0.13/0.37 % (11601)Instructions burned: 2 (million)
% 0.13/0.37 % (11601)------------------------------
% 0.13/0.37 % (11601)------------------------------
% 0.13/0.37 % (11598)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.13/0.37 % (11599)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 (3000ds/4Mi)
% 0.13/0.37 % (11600)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 (3000ds/27Mi)
% 0.13/0.37 % (11602)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 (3000ds/2Mi)
% 0.13/0.37 % (11603)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 (3000ds/275Mi)
% 0.13/0.37 % (11604)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.13/0.37 % (11605)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.13/0.37 % (11602)Instruction limit reached!
% 0.13/0.37 % (11602)------------------------------
% 0.13/0.37 % (11602)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (11602)Termination reason: Unknown
% 0.13/0.37 % (11602)Termination phase: Unused predicate definition removal
% 0.13/0.37
% 0.13/0.37 % (11602)Memory used [KB]: 895
% 0.13/0.37 % (11602)Time elapsed: 0.003 s
% 0.13/0.37 % (11602)Instructions burned: 2 (million)
% 0.13/0.37 % (11602)------------------------------
% 0.13/0.37 % (11602)------------------------------
% 0.13/0.37 % (11603)Refutation not found, incomplete strategy
% 0.13/0.37 % (11603)------------------------------
% 0.13/0.37 % (11603)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (11603)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 % (11603)Memory used [KB]: 5373
% 0.13/0.37 % (11603)Time elapsed: 0.003 s
% 0.13/0.37 % (11603)Instructions burned: 1 (million)
% 0.13/0.37 % (11603)------------------------------
% 0.13/0.37 % (11603)------------------------------
% 0.13/0.37 % (11599)Instruction limit reached!
% 0.13/0.37 % (11599)------------------------------
% 0.13/0.37 % (11599)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (11599)Termination reason: Unknown
% 0.13/0.37 % (11599)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (11599)Memory used [KB]: 5500
% 0.13/0.37 % (11599)Time elapsed: 0.005 s
% 0.13/0.37 % (11599)Instructions burned: 4 (million)
% 0.13/0.37 % (11599)------------------------------
% 0.13/0.37 % (11599)------------------------------
% 0.13/0.37 % (11605)Instruction limit reached!
% 0.13/0.37 % (11605)------------------------------
% 0.13/0.37 % (11605)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (11605)Termination reason: Unknown
% 0.13/0.37 % (11605)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (11605)Memory used [KB]: 5500
% 0.13/0.37 % (11605)Time elapsed: 0.005 s
% 0.13/0.37 % (11605)Instructions burned: 4 (million)
% 0.13/0.37 % (11605)------------------------------
% 0.13/0.37 % (11605)------------------------------
% 0.13/0.37 % (11606)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.13/0.38 % (11600)First to succeed.
% 0.13/0.38 % (11600)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, eps: ($i > $o) > $i).
% 0.13/0.38 thf(func_def_2, type, if: $o > $i > $i > $i).
% 0.13/0.38 thf(func_def_3, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.13/0.38 thf(func_def_19, type, ph4: !>[X0: $tType]:(X0)).
% 0.13/0.38 thf(f159,plain,(
% 0.13/0.38 $false),
% 0.13/0.38 inference(avatar_sat_refutation,[],[f92,f140,f146,f148,f155,f158])).
% 0.13/0.38 thf(f158,plain,(
% 0.13/0.38 ~spl3_1),
% 0.13/0.38 inference(avatar_contradiction_clause,[],[f157])).
% 0.13/0.38 thf(f157,plain,(
% 0.13/0.38 $false | ~spl3_1),
% 0.13/0.38 inference(equality_resolution,[],[f64])).
% 0.13/0.38 thf(f64,plain,(
% 0.13/0.38 ( ! [X1 : $i] : ((sK2 != X1)) ) | ~spl3_1),
% 0.13/0.38 inference(avatar_component_clause,[],[f63])).
% 0.13/0.38 thf(f63,plain,(
% 0.13/0.38 spl3_1 <=> ! [X1] : (sK2 != X1)),
% 0.13/0.38 introduced(avatar_definition,[new_symbols(naming,[spl3_1])])).
% 0.13/0.38 thf(f155,plain,(
% 0.13/0.38 spl3_2 | spl3_3 | spl3_1 | spl3_5),
% 0.13/0.38 inference(avatar_split_clause,[],[f135,f79,f63,f70,f66])).
% 0.13/0.38 thf(f66,plain,(
% 0.13/0.38 spl3_2 <=> ($true = sK0)),
% 0.13/0.38 introduced(avatar_definition,[new_symbols(naming,[spl3_2])])).
% 0.13/0.38 thf(f70,plain,(
% 0.13/0.38 spl3_3 <=> ((eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))) = sK1)),
% 0.13/0.38 introduced(avatar_definition,[new_symbols(naming,[spl3_3])])).
% 0.13/0.38 thf(f79,plain,(
% 0.13/0.38 spl3_5 <=> (sK2 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))))),
% 0.13/0.38 introduced(avatar_definition,[new_symbols(naming,[spl3_5])])).
% 0.13/0.38 thf(f135,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (($true = sK0) | (sK2 != X1) | ((eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))) = sK1) | (sK2 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))))) )),
% 0.13/0.38 inference(equality_proxy_clausification,[],[f134])).
% 0.13/0.38 thf(f134,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (((eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))) = sK1) | ($true = sK0) | (sK2 != X1) | ($true = (sK2 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))))) )),
% 0.13/0.38 inference(equality_proxy_clausification,[],[f133])).
% 0.13/0.38 thf(f133,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (($true = (sK1 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))))) | (sK2 != X1) | ($true = sK0) | ($true = (sK2 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))))) )),
% 0.13/0.38 inference(not_proxy_clausification,[],[f132])).
% 0.13/0.38 thf(f132,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (($false = (~ sK0)) | ($true = (sK1 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))))) | ($true = (sK2 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))))) | (sK2 != X1)) )),
% 0.13/0.38 inference(binary_proxy_clausification,[],[f130])).
% 0.13/0.38 thf(f130,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (($true = ((sK2 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))) & (~ sK0))) | ($false = (~ sK0)) | (sK2 != X1) | ($true = (sK1 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))))) )),
% 0.13/0.38 inference(equality_proxy_clausification,[],[f129])).
% 0.13/0.38 thf(f129,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (($false = (sK2 = X1)) | ($true = ((sK2 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))) & (~ sK0))) | ($true = (sK1 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))))) | ($false = (~ sK0))) )),
% 0.13/0.38 inference(binary_proxy_clausification,[],[f115])).
% 0.13/0.38 thf(f115,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (($false = ((sK2 = X1) & (~ sK0))) | ($true = (sK1 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))))) | ($true = ((sK2 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))) & (~ sK0)))) )),
% 0.13/0.38 inference(binary_proxy_clausification,[],[f97])).
% 0.13/0.38 thf(f97,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (($true = (sK0 & (sK1 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))))) | ($false = ((sK2 = X1) & (~ sK0))) | ($true = ((sK2 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))) & (~ sK0)))) )),
% 0.13/0.38 inference(binary_proxy_clausification,[],[f96])).
% 0.13/0.38 thf(f96,plain,(
% 0.13/0.38 ( ! [X1 : $i] : ((((sK0 & (sK1 = X1)) | ((sK2 = X1) & (~ sK0))) = $false) | ($true = (sK0 & (sK1 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))))) | ($true = ((sK2 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))) & (~ sK0)))) )),
% 0.13/0.38 inference(binary_proxy_clausification,[],[f95])).
% 0.13/0.38 thf(f95,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (($true = ((sK0 & (sK1 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))))) | ((sK2 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))) & (~ sK0)))) | (((sK0 & (sK1 = X1)) | ((sK2 = X1) & (~ sK0))) = $false)) )),
% 0.13/0.38 inference(beta_eta_normalization,[],[f93])).
% 0.13/0.38 thf(f93,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (($false = ((^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))) @ X1)) | ($true = ((^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))) @ (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))))) )),
% 0.13/0.38 introduced(choice_axiom,[])).
% 0.13/0.38 thf(f148,plain,(
% 0.13/0.38 ~spl3_6),
% 0.13/0.38 inference(avatar_contradiction_clause,[],[f147])).
% 0.13/0.38 thf(f147,plain,(
% 0.13/0.38 $false | ~spl3_6),
% 0.13/0.38 inference(equality_resolution,[],[f87])).
% 0.13/0.38 thf(f87,plain,(
% 0.13/0.38 ( ! [X1 : $i] : ((sK1 != X1)) ) | ~spl3_6),
% 0.13/0.38 inference(avatar_component_clause,[],[f86])).
% 0.13/0.38 thf(f86,plain,(
% 0.13/0.38 spl3_6 <=> ! [X1] : (sK1 != X1)),
% 0.13/0.38 introduced(avatar_definition,[new_symbols(naming,[spl3_6])])).
% 0.13/0.38 thf(f146,plain,(
% 0.13/0.38 spl3_3 | spl3_6 | ~spl3_2),
% 0.13/0.38 inference(avatar_split_clause,[],[f145,f66,f86,f70])).
% 0.13/0.38 thf(f145,plain,(
% 0.13/0.38 ( ! [X1 : $i] : ((sK1 != X1) | ((eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))) = sK1)) ) | ~spl3_2),
% 0.13/0.38 inference(trivial_inequality_removal,[],[f144])).
% 0.13/0.38 thf(f144,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (($true = $false) | (sK1 != X1) | ((eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))) = sK1)) ) | ~spl3_2),
% 0.13/0.38 inference(forward_demodulation,[],[f114,f68])).
% 0.13/0.38 thf(f68,plain,(
% 0.13/0.38 ($true = sK0) | ~spl3_2),
% 0.13/0.38 inference(avatar_component_clause,[],[f66])).
% 0.13/0.38 thf(f114,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (((eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))) = sK1) | (sK0 = $false) | (sK1 != X1)) )),
% 0.13/0.38 inference(duplicate_literal_removal,[],[f113])).
% 0.13/0.38 thf(f113,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (((eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))) = sK1) | (sK0 = $false) | (sK0 = $false) | (sK1 != X1)) )),
% 0.13/0.38 inference(not_proxy_clausification,[],[f112])).
% 0.13/0.38 thf(f112,plain,(
% 0.13/0.38 ( ! [X1 : $i] : ((sK0 = $false) | ((eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))) = sK1) | ($true = (~ sK0)) | (sK1 != X1)) )),
% 0.13/0.38 inference(equality_proxy_clausification,[],[f108])).
% 0.13/0.38 thf(f108,plain,(
% 0.13/0.38 ( ! [X1 : $i] : ((sK1 != X1) | ($true = (sK1 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))))) | (sK0 = $false) | ($true = (~ sK0))) )),
% 0.13/0.38 inference(binary_proxy_clausification,[],[f107])).
% 0.13/0.38 thf(f107,plain,(
% 0.13/0.38 ( ! [X1 : $i] : ((sK1 != X1) | ($true = (sK0 & (sK1 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))))) | (sK0 = $false) | ($true = (~ sK0))) )),
% 0.13/0.38 inference(equality_proxy_clausification,[],[f100])).
% 0.13/0.38 thf(f100,plain,(
% 0.13/0.38 ( ! [X1 : $i] : ((sK0 = $false) | ((sK1 = X1) = $false) | ($true = (sK0 & (sK1 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))))) | ($true = (~ sK0))) )),
% 0.13/0.38 inference(binary_proxy_clausification,[],[f99])).
% 0.13/0.38 thf(f99,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (($true = ((sK2 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))) & (~ sK0))) | (sK0 = $false) | ($true = (sK0 & (sK1 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))))) | ((sK1 = X1) = $false)) )),
% 0.13/0.38 inference(binary_proxy_clausification,[],[f98])).
% 0.13/0.38 thf(f98,plain,(
% 0.13/0.38 ( ! [X1 : $i] : (($false = (sK0 & (sK1 = X1))) | ($true = ((sK2 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0)))))) & (~ sK0))) | ($true = (sK0 & (sK1 = (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))))))) )),
% 0.13/0.38 inference(binary_proxy_clausification,[],[f96])).
% 0.13/0.38 thf(f140,plain,(
% 0.13/0.38 ~spl3_3),
% 0.13/0.38 inference(avatar_contradiction_clause,[],[f139])).
% 0.13/0.38 thf(f139,plain,(
% 0.13/0.38 $false | ~spl3_3),
% 0.13/0.38 inference(trivial_inequality_removal,[],[f94])).
% 0.13/0.38 thf(f94,plain,(
% 0.13/0.38 (sK1 != sK1) | ~spl3_3),
% 0.13/0.38 inference(superposition,[],[f21,f72])).
% 0.13/0.38 thf(f72,plain,(
% 0.13/0.38 ((eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))) = sK1) | ~spl3_3),
% 0.13/0.38 inference(avatar_component_clause,[],[f70])).
% 0.13/0.38 thf(f21,plain,(
% 0.13/0.38 ((eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))) != sK1)),
% 0.13/0.38 inference(beta_eta_normalization,[],[f20])).
% 0.13/0.38 thf(f20,plain,(
% 0.13/0.38 (((^[Y0 : $o]: ((^[Y1 : $i]: ((^[Y2 : $i]: (eps @ (^[Y3 : $i]: ((Y0 & (Y1 = Y3)) | ((Y2 = Y3) & (~ Y0)))))))))) @ sK0 @ sK1 @ sK2) != sK1)),
% 0.13/0.38 inference(definition_unfolding,[],[f15,f17])).
% 0.13/0.38 thf(f17,plain,(
% 0.13/0.38 (if = (^[Y0 : $o]: ((^[Y1 : $i]: ((^[Y2 : $i]: (eps @ (^[Y3 : $i]: ((Y0 & (Y1 = Y3)) | ((Y2 = Y3) & (~ Y0)))))))))))),
% 0.13/0.38 inference(cnf_transformation,[],[f9])).
% 0.13/0.38 thf(f9,plain,(
% 0.13/0.38 (if = (^[Y0 : $o]: ((^[Y1 : $i]: ((^[Y2 : $i]: (eps @ (^[Y3 : $i]: ((Y0 & (Y1 = Y3)) | ((Y2 = Y3) & (~ Y0)))))))))))),
% 0.13/0.38 inference(fool_elimination,[],[f8])).
% 0.13/0.38 thf(f8,plain,(
% 0.13/0.38 (if = (^[X0 : $o, X1 : $i, X2 : $i] : (eps @ (^[X3 : $i] : ((~X0 & (X2 = X3)) | ((X1 = X3) & X0))))))),
% 0.13/0.38 inference(rectify,[],[f2])).
% 0.13/0.38 thf(f2,axiom,(
% 0.13/0.38 (if = (^[X2 : $o, X1 : $i, X3 : $i] : (eps @ (^[X4 : $i] : ((~X2 & (X3 = X4)) | ((X1 = X4) & X2))))))),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifd)).
% 0.13/0.38 thf(f15,plain,(
% 0.13/0.38 ((if @ sK0 @ sK1 @ sK2) != sK1)),
% 0.13/0.38 inference(cnf_transformation,[],[f14])).
% 0.13/0.38 thf(f14,plain,(
% 0.13/0.38 (sK2 != (if @ sK0 @ sK1 @ sK2)) & ((if @ sK0 @ sK1 @ sK2) != sK1)),
% 0.13/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f12,f13])).
% 0.13/0.38 thf(f13,plain,(
% 0.13/0.38 ? [X0 : $o,X1,X2] : (((if @ X0 @ X1 @ X2) != X2) & ((if @ X0 @ X1 @ X2) != X1)) => ((sK2 != (if @ sK0 @ sK1 @ sK2)) & ((if @ sK0 @ sK1 @ sK2) != sK1))),
% 0.13/0.38 introduced(choice_axiom,[])).
% 0.13/0.38 thf(f12,plain,(
% 0.13/0.38 ? [X0 : $o,X1,X2] : (((if @ X0 @ X1 @ X2) != X2) & ((if @ X0 @ X1 @ X2) != X1))),
% 0.13/0.38 inference(ennf_transformation,[],[f10])).
% 0.13/0.38 thf(f10,plain,(
% 0.13/0.38 ~! [X0 : $o,X1,X2] : (((if @ X0 @ X1 @ X2) = X2) | ((if @ X0 @ X1 @ X2) = X1))),
% 0.13/0.38 inference(rectify,[],[f4])).
% 0.13/0.38 thf(f4,negated_conjecture,(
% 0.13/0.38 ~! [X2 : $o,X1,X3] : (((if @ X2 @ X1 @ X3) = X1) | ((if @ X2 @ X1 @ X3) = X3))),
% 0.13/0.38 inference(negated_conjecture,[],[f3])).
% 0.13/0.38 thf(f3,conjecture,(
% 0.13/0.38 ! [X2 : $o,X1,X3] : (((if @ X2 @ X1 @ X3) = X1) | ((if @ X2 @ X1 @ X3) = X3))),
% 0.13/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)).
% 0.13/0.38 thf(f92,plain,(
% 0.13/0.38 ~spl3_5),
% 0.13/0.38 inference(avatar_split_clause,[],[f22,f79])).
% 0.13/0.38 thf(f22,plain,(
% 0.13/0.38 (sK2 != (eps @ (^[Y0 : $i]: ((sK0 & (sK1 = Y0)) | ((sK2 = Y0) & (~ sK0))))))),
% 0.13/0.38 inference(beta_eta_normalization,[],[f19])).
% 0.13/0.38 thf(f19,plain,(
% 0.13/0.38 (sK2 != ((^[Y0 : $o]: ((^[Y1 : $i]: ((^[Y2 : $i]: (eps @ (^[Y3 : $i]: ((Y0 & (Y1 = Y3)) | ((Y2 = Y3) & (~ Y0)))))))))) @ sK0 @ sK1 @ sK2))),
% 0.13/0.38 inference(definition_unfolding,[],[f16,f17])).
% 0.13/0.38 thf(f16,plain,(
% 0.13/0.38 (sK2 != (if @ sK0 @ sK1 @ sK2))),
% 0.13/0.38 inference(cnf_transformation,[],[f14])).
% 0.13/0.38 % SZS output end Proof for theBenchmark
% 0.13/0.38 % (11600)------------------------------
% 0.13/0.38 % (11600)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (11600)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (11600)Memory used [KB]: 5500
% 0.13/0.38 % (11600)Time elapsed: 0.010 s
% 0.13/0.38 % (11600)Instructions burned: 9 (million)
% 0.13/0.38 % (11600)------------------------------
% 0.13/0.38 % (11600)------------------------------
% 0.13/0.38 % (11597)Success in time 0.012 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------