TSTP Solution File: SET752^4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET752^4 : 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 : n032.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 03:13:07 EDT 2024
% Result : Theorem 0.09s 0.30s
% Output : Refutation 0.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08 % Problem : SET752^4 : TPTP v8.2.0. Released v3.6.0.
% 0.04/0.09 % 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.09/0.27 % Computer : n032.cluster.edu
% 0.09/0.27 % Model : x86_64 x86_64
% 0.09/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27 % Memory : 8042.1875MB
% 0.09/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.27 % CPULimit : 300
% 0.09/0.27 % WCLimit : 300
% 0.09/0.27 % DateTime : Mon May 20 13:05:52 EDT 2024
% 0.09/0.27 % CPUTime :
% 0.09/0.27 This is a TH0_THM_EQU_NAR problem
% 0.09/0.28 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.09/0.29 % (30699)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.09/0.29 % (30697)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.09/0.29 % (30700)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.09/0.29 % (30698)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.09/0.29 % (30701)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.09/0.29 % (30702)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.09/0.29 % (30703)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.09/0.29 % (30704)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.09/0.29 % (30700)Instruction limit reached!
% 0.09/0.29 % (30700)------------------------------
% 0.09/0.29 % (30700)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.09/0.29 % (30700)Termination reason: Unknown
% 0.09/0.29 % (30701)Instruction limit reached!
% 0.09/0.29 % (30701)------------------------------
% 0.09/0.29 % (30701)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.09/0.29 % (30700)Termination phase: shuffling
% 0.09/0.29
% 0.09/0.29 % (30700)Memory used [KB]: 1023
% 0.09/0.29 % (30700)Time elapsed: 0.002 s
% 0.09/0.29 % (30700)Instructions burned: 2 (million)
% 0.09/0.29 % (30700)------------------------------
% 0.09/0.29 % (30700)------------------------------
% 0.09/0.29 % (30701)Termination reason: Unknown
% 0.09/0.29 % (30701)Termination phase: shuffling
% 0.09/0.29
% 0.09/0.29 % (30701)Memory used [KB]: 1023
% 0.09/0.29 % (30701)Time elapsed: 0.002 s
% 0.09/0.29 % (30701)Instructions burned: 2 (million)
% 0.09/0.29 % (30701)------------------------------
% 0.09/0.29 % (30701)------------------------------
% 0.09/0.29 % (30698)Instruction limit reached!
% 0.09/0.29 % (30698)------------------------------
% 0.09/0.29 % (30698)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.09/0.29 % (30698)Termination reason: Unknown
% 0.09/0.29 % (30698)Termination phase: Function definition elimination
% 0.09/0.29
% 0.09/0.29 % (30698)Memory used [KB]: 1023
% 0.09/0.29 % (30698)Time elapsed: 0.003 s
% 0.09/0.29 % (30698)Instructions burned: 5 (million)
% 0.09/0.29 % (30698)------------------------------
% 0.09/0.29 % (30698)------------------------------
% 0.09/0.29 % (30704)Instruction limit reached!
% 0.09/0.29 % (30704)------------------------------
% 0.09/0.29 % (30704)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.09/0.29 % (30704)Termination reason: Unknown
% 0.09/0.29 % (30704)Termination phase: Function definition elimination
% 0.09/0.29
% 0.09/0.29 % (30704)Memory used [KB]: 1023
% 0.09/0.29 % (30704)Time elapsed: 0.003 s
% 0.09/0.29 % (30704)Instructions burned: 5 (million)
% 0.09/0.29 % (30704)------------------------------
% 0.09/0.29 % (30704)------------------------------
% 0.09/0.29 % (30703)First to succeed.
% 0.09/0.29 % (30697)Also succeeded, but the first one will report.
% 0.09/0.30 % (30699)Also succeeded, but the first one will report.
% 0.09/0.30 % (30703)Refutation found. Thanks to Tanya!
% 0.09/0.30 % SZS status Theorem for theBenchmark
% 0.09/0.30 % SZS output start Proof for theBenchmark
% 0.09/0.30 thf(func_def_0, type, in: $i > ($i > $o) > $o).
% 0.09/0.30 thf(func_def_2, type, is_a: $i > ($i > $o) > $o).
% 0.09/0.30 thf(func_def_3, type, emptyset: $i > $o).
% 0.09/0.30 thf(func_def_4, type, unord_pair: $i > $i > $i > $o).
% 0.09/0.30 thf(func_def_5, type, singleton: $i > $i > $o).
% 0.09/0.30 thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o).
% 0.09/0.30 thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o).
% 0.09/0.30 thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o).
% 0.09/0.30 thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o).
% 0.09/0.30 thf(func_def_10, type, complement: ($i > $o) > $i > $o).
% 0.09/0.30 thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o).
% 0.09/0.30 thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o).
% 0.09/0.30 thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o).
% 0.09/0.30 thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o).
% 0.09/0.30 thf(func_def_15, type, fun_image: ($i > $i) > ($i > $o) > $i > $o).
% 0.09/0.30 thf(func_def_16, type, fun_composition: ($i > $i) > ($i > $i) > $i > $i).
% 0.09/0.30 thf(func_def_17, type, fun_inv_image: ($i > $i) > ($i > $o) > $i > $o).
% 0.09/0.30 thf(func_def_18, type, fun_injective: ($i > $i) > $o).
% 0.09/0.30 thf(func_def_19, type, fun_surjective: ($i > $i) > $o).
% 0.09/0.30 thf(func_def_20, type, fun_bijective: ($i > $i) > $o).
% 0.09/0.30 thf(func_def_21, type, fun_decreasing: ($i > $i) > ($i > $i > $o) > $o).
% 0.09/0.30 thf(func_def_22, type, fun_increasing: ($i > $i) > ($i > $i > $o) > $o).
% 0.09/0.30 thf(func_def_37, type, sK0: $i > $o).
% 0.09/0.30 thf(func_def_38, type, sK1: $i > $o).
% 0.09/0.30 thf(func_def_39, type, sK2: $i > $i).
% 0.09/0.30 thf(func_def_41, type, ph4: !>[X0: $tType]:(X0)).
% 0.09/0.30 thf(f222,plain,(
% 0.09/0.30 $false),
% 0.09/0.30 inference(avatar_sat_refutation,[],[f176,f181,f186,f187,f192,f193,f194,f195,f202,f205,f214,f221])).
% 0.09/0.30 thf(f221,plain,(
% 0.09/0.30 ~spl3_3 | ~spl3_6),
% 0.09/0.30 inference(avatar_contradiction_clause,[],[f220])).
% 0.09/0.30 thf(f220,plain,(
% 0.09/0.30 $false | (~spl3_3 | ~spl3_6)),
% 0.09/0.30 inference(trivial_inequality_removal,[],[f219])).
% 0.09/0.30 thf(f219,plain,(
% 0.09/0.30 ($true = $false) | (~spl3_3 | ~spl3_6)),
% 0.09/0.30 inference(backward_demodulation,[],[f171,f218])).
% 0.09/0.30 thf(f218,plain,(
% 0.09/0.30 ((sK0 @ sK7) = $false) | ~spl3_6),
% 0.09/0.30 inference(trivial_inequality_removal,[],[f215])).
% 0.09/0.30 thf(f215,plain,(
% 0.09/0.30 (sK5 != sK5) | ((sK0 @ sK7) = $false) | ~spl3_6),
% 0.09/0.30 inference(superposition,[],[f125,f185])).
% 0.09/0.30 thf(f185,plain,(
% 0.09/0.30 ((sK2 @ sK7) = sK5) | ~spl3_6),
% 0.09/0.30 inference(avatar_component_clause,[],[f183])).
% 0.09/0.30 thf(f183,plain,(
% 0.09/0.30 spl3_6 <=> ((sK2 @ sK7) = sK5)),
% 0.09/0.30 introduced(avatar_definition,[new_symbols(naming,[spl3_6])])).
% 0.09/0.30 thf(f125,plain,(
% 0.09/0.30 ( ! [X0 : $i] : ((sK5 != (sK2 @ X0)) | ((sK0 @ X0) = $false)) )),
% 0.09/0.30 inference(duplicate_literal_removal,[],[f124])).
% 0.09/0.30 thf(f124,plain,(
% 0.09/0.30 ( ! [X0 : $i] : (((sK0 @ X0) = $false) | ((sK0 @ X0) = $false) | (sK5 != (sK2 @ X0))) )),
% 0.09/0.30 inference(condensation,[],[f122])).
% 0.09/0.30 thf(f122,plain,(
% 0.09/0.30 ( ! [X2 : $i,X1 : $i] : (((sK2 @ X1) != sK5) | ((sK0 @ X2) = $false) | ((sK0 @ X1) = $false) | (sK5 != (sK2 @ X2))) )),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f121])).
% 0.09/0.30 thf(f121,plain,(
% 0.09/0.30 ( ! [X2 : $i,X1 : $i] : ((sK5 != (sK2 @ X2)) | ($false = ((sK1 @ X1) | (sK0 @ X1))) | ((sK0 @ X2) = $false) | ((sK2 @ X1) != sK5)) )),
% 0.09/0.30 inference(equality_proxy_clausification,[],[f120])).
% 0.09/0.30 thf(f120,plain,(
% 0.09/0.30 ( ! [X2 : $i,X1 : $i] : ((sK5 != (sK2 @ X2)) | ((sK0 @ X2) = $false) | (((sK2 @ X1) = sK5) = $false) | ($false = ((sK1 @ X1) | (sK0 @ X1)))) )),
% 0.09/0.30 inference(equality_proxy_clausification,[],[f119])).
% 0.09/0.30 thf(f119,plain,(
% 0.09/0.30 ( ! [X2 : $i,X1 : $i] : ((((sK2 @ X2) = sK5) = $false) | ($false = ((sK1 @ X1) | (sK0 @ X1))) | (((sK2 @ X1) = sK5) = $false) | ((sK0 @ X2) = $false)) )),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f118])).
% 0.09/0.30 thf(f118,plain,(
% 0.09/0.30 ( ! [X2 : $i,X1 : $i] : (((((sK2 @ X1) = sK5) & ((sK1 @ X1) | (sK0 @ X1))) = $false) | ((sK0 @ X2) = $false) | (((sK2 @ X2) = sK5) = $false)) )),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f117])).
% 0.09/0.30 thf(f117,plain,(
% 0.09/0.30 ( ! [X2 : $i,X1 : $i] : (((((sK2 @ X2) = sK5) & (sK0 @ X2)) = $false) | ((((sK2 @ X1) = sK5) & ((sK1 @ X1) | (sK0 @ X1))) = $false)) )),
% 0.09/0.30 inference(beta_eta_normalization,[],[f116])).
% 0.09/0.30 thf(f116,plain,(
% 0.09/0.30 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK0 @ Y0))) @ X2) = $false) | ((((sK2 @ X1) = sK5) & ((sK1 @ X1) | (sK0 @ X1))) = $false)) )),
% 0.09/0.30 inference(pi_clausification,[],[f104])).
% 0.09/0.30 thf(f104,plain,(
% 0.09/0.30 ( ! [X1 : $i] : (($false = (?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK0 @ Y0))))) | ((((sK2 @ X1) = sK5) & ((sK1 @ X1) | (sK0 @ X1))) = $false)) )),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f103])).
% 0.09/0.30 thf(f103,plain,(
% 0.09/0.30 ( ! [X1 : $i] : ((((?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK1 @ Y0)))) | (?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK0 @ Y0))))) = $false) | ((((sK2 @ X1) = sK5) & ((sK1 @ X1) | (sK0 @ X1))) = $false)) )),
% 0.09/0.30 inference(beta_eta_normalization,[],[f102])).
% 0.09/0.30 thf(f102,plain,(
% 0.09/0.30 ( ! [X1 : $i] : ((((?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK1 @ Y0)))) | (?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK0 @ Y0))))) = $false) | (((^[Y0 : $i]: (((sK2 @ Y0) = sK5) & ((sK1 @ Y0) | (sK0 @ Y0)))) @ X1) = $false)) )),
% 0.09/0.30 inference(pi_clausification,[],[f101])).
% 0.09/0.30 thf(f101,plain,(
% 0.09/0.30 ($false = (?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & ((sK1 @ Y0) | (sK0 @ Y0)))))) | (((?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK1 @ Y0)))) | (?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK0 @ Y0))))) = $false)),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f99])).
% 0.09/0.30 thf(f99,plain,(
% 0.09/0.30 (((?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK1 @ Y0)))) | (?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK0 @ Y0))))) != (?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & ((sK1 @ Y0) | (sK0 @ Y0))))))),
% 0.09/0.30 inference(beta_eta_normalization,[],[f98])).
% 0.09/0.30 thf(f98,plain,(
% 0.09/0.30 (((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (((sK2 @ Y1) = Y0) & ((sK1 @ Y1) | (sK0 @ Y1)))))) @ sK5) != ((^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (((sK2 @ Y1) = Y0) & (sK1 @ Y1)))) | (?? @ $i @ (^[Y1 : $i]: (((sK2 @ Y1) = Y0) & (sK0 @ Y1)))))) @ sK5))),
% 0.09/0.30 inference(negative_extensionality,[],[f97])).
% 0.09/0.30 thf(f97,plain,(
% 0.09/0.30 ((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: (((sK2 @ Y1) = Y0) & ((sK1 @ Y1) | (sK0 @ Y1)))))) != (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (((sK2 @ Y1) = Y0) & (sK1 @ Y1)))) | (?? @ $i @ (^[Y1 : $i]: (((sK2 @ Y1) = Y0) & (sK0 @ Y1)))))))),
% 0.09/0.30 inference(beta_eta_normalization,[],[f96])).
% 0.09/0.30 thf(f96,plain,(
% 0.09/0.30 (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))) @ ((^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (((Y0 @ Y3) = Y2) & (Y1 @ Y3))))))))) @ sK2 @ sK0) @ ((^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (((Y0 @ Y3) = Y2) & (Y1 @ Y3))))))))) @ sK2 @ sK1)) != ((^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (((Y0 @ Y3) = Y2) & (Y1 @ Y3))))))))) @ sK2 @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))) @ sK0 @ sK1)))),
% 0.09/0.30 inference(definition_unfolding,[],[f79,f92,f82,f82,f92,f92])).
% 0.09/0.30 thf(f82,plain,(
% 0.09/0.30 (union = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.09/0.30 inference(cnf_transformation,[],[f29])).
% 0.09/0.30 thf(f29,plain,(
% 0.09/0.30 (union = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))),
% 0.09/0.30 inference(fool_elimination,[],[f28])).
% 0.09/0.30 thf(f28,plain,(
% 0.09/0.30 ((^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))) = union)),
% 0.09/0.30 inference(rectify,[],[f6])).
% 0.09/0.30 thf(f6,axiom,(
% 0.09/0.30 ((^[X0 : $i > $o, X2 : $i > $o, X3 : $i] : ((X0 @ X3) | (X2 @ X3))) = union)),
% 0.09/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',union)).
% 0.09/0.30 thf(f92,plain,(
% 0.09/0.30 (fun_image = (^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (((Y0 @ Y3) = Y2) & (Y1 @ Y3))))))))))),
% 0.09/0.30 inference(cnf_transformation,[],[f59])).
% 0.09/0.30 thf(f59,plain,(
% 0.09/0.30 (fun_image = (^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: (((Y0 @ Y3) = Y2) & (Y1 @ Y3))))))))))),
% 0.09/0.30 inference(fool_elimination,[],[f58])).
% 0.09/0.30 thf(f58,plain,(
% 0.09/0.30 ((^[X0 : $i > $i, X1 : $i > $o, X2 : $i] : (? [X3] : ((X1 @ X3) & ((X0 @ X3) = X2)))) = fun_image)),
% 0.09/0.30 inference(rectify,[],[f15])).
% 0.09/0.30 thf(f15,axiom,(
% 0.09/0.30 ((^[X4 : $i > $i, X5 : $i > $o, X2 : $i] : (? [X0] : ((X5 @ X0) & ((X4 @ X0) = X2)))) = fun_image)),
% 0.09/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fun_image)).
% 0.09/0.30 thf(f79,plain,(
% 0.09/0.30 ((fun_image @ sK2 @ (union @ sK0 @ sK1)) != (union @ (fun_image @ sK2 @ sK0) @ (fun_image @ sK2 @ sK1)))),
% 0.09/0.30 inference(cnf_transformation,[],[f70])).
% 0.09/0.30 thf(f70,plain,(
% 0.09/0.30 ((fun_image @ sK2 @ (union @ sK0 @ sK1)) != (union @ (fun_image @ sK2 @ sK0) @ (fun_image @ sK2 @ sK1)))),
% 0.09/0.30 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f68,f69])).
% 0.09/0.30 thf(f69,plain,(
% 0.09/0.30 ? [X0 : $i > $o,X1 : $i > $o,X2 : $i > $i] : ((fun_image @ X2 @ (union @ X0 @ X1)) != (union @ (fun_image @ X2 @ X0) @ (fun_image @ X2 @ X1))) => ((fun_image @ sK2 @ (union @ sK0 @ sK1)) != (union @ (fun_image @ sK2 @ sK0) @ (fun_image @ sK2 @ sK1)))),
% 0.09/0.30 introduced(choice_axiom,[])).
% 0.09/0.30 thf(f68,plain,(
% 0.09/0.30 ? [X0 : $i > $o,X1 : $i > $o,X2 : $i > $i] : ((fun_image @ X2 @ (union @ X0 @ X1)) != (union @ (fun_image @ X2 @ X0) @ (fun_image @ X2 @ X1)))),
% 0.09/0.30 inference(ennf_transformation,[],[f67])).
% 0.09/0.30 thf(f67,plain,(
% 0.09/0.30 ~! [X0 : $i > $o,X1 : $i > $o,X2 : $i > $i] : ((fun_image @ X2 @ (union @ X0 @ X1)) = (union @ (fun_image @ X2 @ X0) @ (fun_image @ X2 @ X1)))),
% 0.09/0.30 inference(rectify,[],[f24])).
% 0.09/0.30 thf(f24,negated_conjecture,(
% 0.09/0.30 ~! [X0 : $i > $o,X2 : $i > $o,X4 : $i > $i] : ((fun_image @ X4 @ (union @ X0 @ X2)) = (union @ (fun_image @ X4 @ X0) @ (fun_image @ X4 @ X2)))),
% 0.09/0.30 inference(negated_conjecture,[],[f23])).
% 0.09/0.30 thf(f23,conjecture,(
% 0.09/0.30 ! [X0 : $i > $o,X2 : $i > $o,X4 : $i > $i] : ((fun_image @ X4 @ (union @ X0 @ X2)) = (union @ (fun_image @ X4 @ X0) @ (fun_image @ X4 @ X2)))),
% 0.09/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm)).
% 0.09/0.30 thf(f171,plain,(
% 0.09/0.30 ($true = (sK0 @ sK7)) | ~spl3_3),
% 0.09/0.30 inference(avatar_component_clause,[],[f169])).
% 0.09/0.30 thf(f169,plain,(
% 0.09/0.30 spl3_3 <=> ($true = (sK0 @ sK7))),
% 0.09/0.30 introduced(avatar_definition,[new_symbols(naming,[spl3_3])])).
% 0.09/0.30 thf(f214,plain,(
% 0.09/0.30 ~spl3_1 | ~spl3_7),
% 0.09/0.30 inference(avatar_contradiction_clause,[],[f213])).
% 0.09/0.30 thf(f213,plain,(
% 0.09/0.30 $false | (~spl3_1 | ~spl3_7)),
% 0.09/0.30 inference(trivial_inequality_removal,[],[f212])).
% 0.09/0.30 thf(f212,plain,(
% 0.09/0.30 ($true = $false) | (~spl3_1 | ~spl3_7)),
% 0.09/0.30 inference(backward_demodulation,[],[f163,f211])).
% 0.09/0.30 thf(f211,plain,(
% 0.09/0.30 ((sK1 @ sK8) = $false) | ~spl3_7),
% 0.09/0.30 inference(trivial_inequality_removal,[],[f209])).
% 0.09/0.30 thf(f209,plain,(
% 0.09/0.30 (sK5 != sK5) | ((sK1 @ sK8) = $false) | ~spl3_7),
% 0.09/0.30 inference(superposition,[],[f115,f191])).
% 0.09/0.30 thf(f191,plain,(
% 0.09/0.30 (sK5 = (sK2 @ sK8)) | ~spl3_7),
% 0.09/0.30 inference(avatar_component_clause,[],[f189])).
% 0.09/0.30 thf(f189,plain,(
% 0.09/0.30 spl3_7 <=> (sK5 = (sK2 @ sK8))),
% 0.09/0.30 introduced(avatar_definition,[new_symbols(naming,[spl3_7])])).
% 0.09/0.30 thf(f115,plain,(
% 0.09/0.30 ( ! [X0 : $i] : ((sK5 != (sK2 @ X0)) | ($false = (sK1 @ X0))) )),
% 0.09/0.30 inference(duplicate_literal_removal,[],[f114])).
% 0.09/0.30 thf(f114,plain,(
% 0.09/0.30 ( ! [X0 : $i] : (($false = (sK1 @ X0)) | (sK5 != (sK2 @ X0)) | (sK5 != (sK2 @ X0))) )),
% 0.09/0.30 inference(condensation,[],[f113])).
% 0.09/0.30 thf(f113,plain,(
% 0.09/0.30 ( ! [X2 : $i,X1 : $i] : (((sK1 @ X2) = $false) | ((sK2 @ X1) != sK5) | ((sK1 @ X1) = $false) | (sK5 != (sK2 @ X2))) )),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f111])).
% 0.09/0.30 thf(f111,plain,(
% 0.09/0.30 ( ! [X2 : $i,X1 : $i] : ((sK5 != (sK2 @ X2)) | ($false = ((sK1 @ X1) | (sK0 @ X1))) | ((sK1 @ X2) = $false) | ((sK2 @ X1) != sK5)) )),
% 0.09/0.30 inference(equality_proxy_clausification,[],[f110])).
% 0.09/0.30 thf(f110,plain,(
% 0.09/0.30 ( ! [X2 : $i,X1 : $i] : ((((sK2 @ X2) = sK5) = $false) | ((sK1 @ X2) = $false) | ((sK2 @ X1) != sK5) | ($false = ((sK1 @ X1) | (sK0 @ X1)))) )),
% 0.09/0.30 inference(equality_proxy_clausification,[],[f109])).
% 0.09/0.30 thf(f109,plain,(
% 0.09/0.30 ( ! [X2 : $i,X1 : $i] : (((sK1 @ X2) = $false) | (((sK2 @ X1) = sK5) = $false) | (((sK2 @ X2) = sK5) = $false) | ($false = ((sK1 @ X1) | (sK0 @ X1)))) )),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f108])).
% 0.09/0.30 thf(f108,plain,(
% 0.09/0.30 ( ! [X2 : $i,X1 : $i] : (((((sK2 @ X2) = sK5) & (sK1 @ X2)) = $false) | (((sK2 @ X1) = sK5) = $false) | ($false = ((sK1 @ X1) | (sK0 @ X1)))) )),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f107])).
% 0.09/0.30 thf(f107,plain,(
% 0.09/0.30 ( ! [X2 : $i,X1 : $i] : (((((sK2 @ X1) = sK5) & ((sK1 @ X1) | (sK0 @ X1))) = $false) | ((((sK2 @ X2) = sK5) & (sK1 @ X2)) = $false)) )),
% 0.09/0.30 inference(beta_eta_normalization,[],[f106])).
% 0.09/0.30 thf(f106,plain,(
% 0.09/0.30 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK1 @ Y0))) @ X2) = $false) | ((((sK2 @ X1) = sK5) & ((sK1 @ X1) | (sK0 @ X1))) = $false)) )),
% 0.09/0.30 inference(pi_clausification,[],[f105])).
% 0.09/0.30 thf(f105,plain,(
% 0.09/0.30 ( ! [X1 : $i] : (((?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK1 @ Y0)))) = $false) | ((((sK2 @ X1) = sK5) & ((sK1 @ X1) | (sK0 @ X1))) = $false)) )),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f103])).
% 0.09/0.30 thf(f163,plain,(
% 0.09/0.30 ($true = (sK1 @ sK8)) | ~spl3_1),
% 0.09/0.30 inference(avatar_component_clause,[],[f161])).
% 0.09/0.30 thf(f161,plain,(
% 0.09/0.30 spl3_1 <=> ($true = (sK1 @ sK8))),
% 0.09/0.30 introduced(avatar_definition,[new_symbols(naming,[spl3_1])])).
% 0.09/0.30 thf(f205,plain,(
% 0.09/0.30 ~spl3_4 | ~spl3_5),
% 0.09/0.30 inference(avatar_contradiction_clause,[],[f204])).
% 0.09/0.30 thf(f204,plain,(
% 0.09/0.30 $false | (~spl3_4 | ~spl3_5)),
% 0.09/0.30 inference(trivial_inequality_removal,[],[f203])).
% 0.09/0.30 thf(f203,plain,(
% 0.09/0.30 ($true = $false) | (~spl3_4 | ~spl3_5)),
% 0.09/0.30 inference(forward_demodulation,[],[f175,f197])).
% 0.09/0.30 thf(f197,plain,(
% 0.09/0.30 ((sK1 @ sK6) = $false) | ~spl3_5),
% 0.09/0.30 inference(trivial_inequality_removal,[],[f196])).
% 0.09/0.30 thf(f196,plain,(
% 0.09/0.30 (sK5 != sK5) | ((sK1 @ sK6) = $false) | ~spl3_5),
% 0.09/0.30 inference(superposition,[],[f115,f180])).
% 0.09/0.30 thf(f180,plain,(
% 0.09/0.30 ((sK2 @ sK6) = sK5) | ~spl3_5),
% 0.09/0.30 inference(avatar_component_clause,[],[f178])).
% 0.09/0.30 thf(f178,plain,(
% 0.09/0.30 spl3_5 <=> ((sK2 @ sK6) = sK5)),
% 0.09/0.30 introduced(avatar_definition,[new_symbols(naming,[spl3_5])])).
% 0.09/0.30 thf(f175,plain,(
% 0.09/0.30 ((sK1 @ sK6) = $true) | ~spl3_4),
% 0.09/0.30 inference(avatar_component_clause,[],[f173])).
% 0.09/0.30 thf(f173,plain,(
% 0.09/0.30 spl3_4 <=> ((sK1 @ sK6) = $true)),
% 0.09/0.30 introduced(avatar_definition,[new_symbols(naming,[spl3_4])])).
% 0.09/0.30 thf(f202,plain,(
% 0.09/0.30 ~spl3_2 | ~spl3_5),
% 0.09/0.30 inference(avatar_contradiction_clause,[],[f201])).
% 0.09/0.30 thf(f201,plain,(
% 0.09/0.30 $false | (~spl3_2 | ~spl3_5)),
% 0.09/0.30 inference(trivial_inequality_removal,[],[f200])).
% 0.09/0.30 thf(f200,plain,(
% 0.09/0.30 ($true = $false) | (~spl3_2 | ~spl3_5)),
% 0.09/0.30 inference(backward_demodulation,[],[f167,f199])).
% 0.09/0.30 thf(f199,plain,(
% 0.09/0.30 ((sK0 @ sK6) = $false) | ~spl3_5),
% 0.09/0.30 inference(trivial_inequality_removal,[],[f198])).
% 0.09/0.30 thf(f198,plain,(
% 0.09/0.30 (sK5 != sK5) | ((sK0 @ sK6) = $false) | ~spl3_5),
% 0.09/0.30 inference(superposition,[],[f125,f180])).
% 0.09/0.30 thf(f167,plain,(
% 0.09/0.30 ((sK0 @ sK6) = $true) | ~spl3_2),
% 0.09/0.30 inference(avatar_component_clause,[],[f165])).
% 0.09/0.30 thf(f165,plain,(
% 0.09/0.30 spl3_2 <=> ((sK0 @ sK6) = $true)),
% 0.09/0.30 introduced(avatar_definition,[new_symbols(naming,[spl3_2])])).
% 0.09/0.30 thf(f195,plain,(
% 0.09/0.30 spl3_6 | spl3_5 | spl3_7),
% 0.09/0.30 inference(avatar_split_clause,[],[f141,f189,f178,f183])).
% 0.09/0.30 thf(f141,plain,(
% 0.09/0.30 ((sK2 @ sK6) = sK5) | ((sK2 @ sK7) = sK5) | (sK5 = (sK2 @ sK8))),
% 0.09/0.30 inference(equality_proxy_clausification,[],[f140])).
% 0.09/0.30 thf(f140,plain,(
% 0.09/0.30 ((sK2 @ sK6) = sK5) | (((sK2 @ sK8) = sK5) = $true) | ((sK2 @ sK7) = sK5)),
% 0.09/0.30 inference(equality_proxy_clausification,[],[f139])).
% 0.09/0.30 thf(f139,plain,(
% 0.09/0.30 ((sK2 @ sK7) = sK5) | (((sK2 @ sK6) = sK5) = $true) | (((sK2 @ sK8) = sK5) = $true)),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f137])).
% 0.09/0.30 thf(f137,plain,(
% 0.09/0.30 ($true = (((sK2 @ sK6) = sK5) & ((sK1 @ sK6) | (sK0 @ sK6)))) | (((sK2 @ sK8) = sK5) = $true) | ((sK2 @ sK7) = sK5)),
% 0.09/0.30 inference(equality_proxy_clausification,[],[f136])).
% 0.09/0.30 thf(f136,plain,(
% 0.09/0.30 ($true = ((sK2 @ sK7) = sK5)) | (((sK2 @ sK8) = sK5) = $true) | ($true = (((sK2 @ sK6) = sK5) & ((sK1 @ sK6) | (sK0 @ sK6))))),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f134])).
% 0.09/0.30 thf(f134,plain,(
% 0.09/0.30 ($true = (((sK2 @ sK7) = sK5) & (sK0 @ sK7))) | ($true = (((sK2 @ sK6) = sK5) & ((sK1 @ sK6) | (sK0 @ sK6)))) | (((sK2 @ sK8) = sK5) = $true)),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f132])).
% 0.09/0.30 thf(f132,plain,(
% 0.09/0.30 ((((sK2 @ sK8) = sK5) & (sK1 @ sK8)) = $true) | ($true = (((sK2 @ sK7) = sK5) & (sK0 @ sK7))) | ($true = (((sK2 @ sK6) = sK5) & ((sK1 @ sK6) | (sK0 @ sK6))))),
% 0.09/0.30 inference(beta_eta_normalization,[],[f131])).
% 0.09/0.30 thf(f131,plain,(
% 0.09/0.30 ($true = (((sK2 @ sK7) = sK5) & (sK0 @ sK7))) | ($true = ((^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK1 @ Y0))) @ sK8)) | ($true = (((sK2 @ sK6) = sK5) & ((sK1 @ sK6) | (sK0 @ sK6))))),
% 0.09/0.30 inference(sigma_clausification,[],[f130])).
% 0.09/0.30 thf(f130,plain,(
% 0.09/0.30 ($true = (?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK1 @ Y0))))) | ($true = (((sK2 @ sK7) = sK5) & (sK0 @ sK7))) | ($true = (((sK2 @ sK6) = sK5) & ((sK1 @ sK6) | (sK0 @ sK6))))),
% 0.09/0.30 inference(beta_eta_normalization,[],[f129])).
% 0.09/0.30 thf(f129,plain,(
% 0.09/0.30 ($true = ((^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK0 @ Y0))) @ sK7)) | ($true = (((sK2 @ sK6) = sK5) & ((sK1 @ sK6) | (sK0 @ sK6)))) | ($true = (?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK1 @ Y0)))))),
% 0.09/0.30 inference(sigma_clausification,[],[f128])).
% 0.09/0.30 thf(f128,plain,(
% 0.09/0.30 ($true = (?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK0 @ Y0))))) | ($true = (((sK2 @ sK6) = sK5) & ((sK1 @ sK6) | (sK0 @ sK6)))) | ($true = (?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK1 @ Y0)))))),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f127])).
% 0.09/0.30 thf(f127,plain,(
% 0.09/0.30 ($true = ((?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK1 @ Y0)))) | (?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK0 @ Y0)))))) | ($true = (((sK2 @ sK6) = sK5) & ((sK1 @ sK6) | (sK0 @ sK6))))),
% 0.09/0.30 inference(beta_eta_normalization,[],[f126])).
% 0.09/0.30 thf(f126,plain,(
% 0.09/0.30 ($true = ((^[Y0 : $i]: (((sK2 @ Y0) = sK5) & ((sK1 @ Y0) | (sK0 @ Y0)))) @ sK6)) | ($true = ((?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK1 @ Y0)))) | (?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK0 @ Y0))))))),
% 0.09/0.30 inference(sigma_clausification,[],[f100])).
% 0.09/0.30 thf(f100,plain,(
% 0.09/0.30 ($true = (?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & ((sK1 @ Y0) | (sK0 @ Y0)))))) | ($true = ((?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK1 @ Y0)))) | (?? @ $i @ (^[Y0 : $i]: (((sK2 @ Y0) = sK5) & (sK0 @ Y0))))))),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f99])).
% 0.09/0.30 thf(f194,plain,(
% 0.09/0.30 spl3_6 | spl3_2 | spl3_7 | spl3_4),
% 0.09/0.30 inference(avatar_split_clause,[],[f143,f173,f189,f165,f183])).
% 0.09/0.30 thf(f143,plain,(
% 0.09/0.30 ((sK1 @ sK6) = $true) | (sK5 = (sK2 @ sK8)) | ((sK2 @ sK7) = sK5) | ((sK0 @ sK6) = $true)),
% 0.09/0.30 inference(equality_proxy_clausification,[],[f142])).
% 0.09/0.30 thf(f142,plain,(
% 0.09/0.30 (((sK2 @ sK8) = sK5) = $true) | ((sK1 @ sK6) = $true) | ((sK0 @ sK6) = $true) | ((sK2 @ sK7) = sK5)),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f138])).
% 0.09/0.30 thf(f138,plain,(
% 0.09/0.30 ($true = ((sK1 @ sK6) | (sK0 @ sK6))) | (((sK2 @ sK8) = sK5) = $true) | ((sK2 @ sK7) = sK5)),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f137])).
% 0.09/0.30 thf(f193,plain,(
% 0.09/0.30 spl3_5 | spl3_7 | spl3_3),
% 0.09/0.30 inference(avatar_split_clause,[],[f147,f169,f189,f178])).
% 0.09/0.30 thf(f147,plain,(
% 0.09/0.30 (sK5 = (sK2 @ sK8)) | ($true = (sK0 @ sK7)) | ((sK2 @ sK6) = sK5)),
% 0.09/0.30 inference(equality_proxy_clausification,[],[f146])).
% 0.09/0.30 thf(f146,plain,(
% 0.09/0.30 (((sK2 @ sK6) = sK5) = $true) | ($true = (sK0 @ sK7)) | (sK5 = (sK2 @ sK8))),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f144])).
% 0.09/0.30 thf(f144,plain,(
% 0.09/0.30 ($true = (((sK2 @ sK6) = sK5) & ((sK1 @ sK6) | (sK0 @ sK6)))) | ($true = (sK0 @ sK7)) | (sK5 = (sK2 @ sK8))),
% 0.09/0.30 inference(equality_proxy_clausification,[],[f135])).
% 0.09/0.30 thf(f135,plain,(
% 0.09/0.30 (((sK2 @ sK8) = sK5) = $true) | ($true = (((sK2 @ sK6) = sK5) & ((sK1 @ sK6) | (sK0 @ sK6)))) | ($true = (sK0 @ sK7))),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f134])).
% 0.09/0.30 thf(f192,plain,(
% 0.09/0.30 spl3_7 | spl3_2 | spl3_4 | spl3_3),
% 0.09/0.30 inference(avatar_split_clause,[],[f148,f169,f173,f165,f189])).
% 0.09/0.30 thf(f148,plain,(
% 0.09/0.30 ((sK1 @ sK6) = $true) | (sK5 = (sK2 @ sK8)) | ($true = (sK0 @ sK7)) | ((sK0 @ sK6) = $true)),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f145])).
% 0.09/0.30 thf(f145,plain,(
% 0.09/0.30 (sK5 = (sK2 @ sK8)) | ($true = (sK0 @ sK7)) | ($true = ((sK1 @ sK6) | (sK0 @ sK6)))),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f144])).
% 0.09/0.30 thf(f187,plain,(
% 0.09/0.30 spl3_1 | spl3_6 | spl3_5),
% 0.09/0.30 inference(avatar_split_clause,[],[f154,f178,f183,f161])).
% 0.09/0.30 thf(f154,plain,(
% 0.09/0.30 ((sK2 @ sK7) = sK5) | ($true = (sK1 @ sK8)) | ((sK2 @ sK6) = sK5)),
% 0.09/0.30 inference(equality_proxy_clausification,[],[f153])).
% 0.09/0.30 thf(f153,plain,(
% 0.09/0.30 ((sK2 @ sK7) = sK5) | ($true = (sK1 @ sK8)) | (((sK2 @ sK6) = sK5) = $true)),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f151])).
% 0.09/0.30 thf(f151,plain,(
% 0.09/0.30 ($true = (((sK2 @ sK6) = sK5) & ((sK1 @ sK6) | (sK0 @ sK6)))) | ((sK2 @ sK7) = sK5) | ($true = (sK1 @ sK8))),
% 0.09/0.30 inference(equality_proxy_clausification,[],[f150])).
% 0.09/0.30 thf(f150,plain,(
% 0.09/0.30 ($true = (sK1 @ sK8)) | ($true = ((sK2 @ sK7) = sK5)) | ($true = (((sK2 @ sK6) = sK5) & ((sK1 @ sK6) | (sK0 @ sK6))))),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f133])).
% 0.09/0.30 thf(f133,plain,(
% 0.09/0.30 ($true = (((sK2 @ sK7) = sK5) & (sK0 @ sK7))) | ($true = (((sK2 @ sK6) = sK5) & ((sK1 @ sK6) | (sK0 @ sK6)))) | ($true = (sK1 @ sK8))),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f132])).
% 0.09/0.30 thf(f186,plain,(
% 0.09/0.30 spl3_2 | spl3_1 | spl3_4 | spl3_6),
% 0.09/0.30 inference(avatar_split_clause,[],[f155,f183,f173,f161,f165])).
% 0.09/0.30 thf(f155,plain,(
% 0.09/0.30 ((sK1 @ sK6) = $true) | ((sK2 @ sK7) = sK5) | ($true = (sK1 @ sK8)) | ((sK0 @ sK6) = $true)),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f152])).
% 0.09/0.30 thf(f152,plain,(
% 0.09/0.30 ($true = (sK1 @ sK8)) | ($true = ((sK1 @ sK6) | (sK0 @ sK6))) | ((sK2 @ sK7) = sK5)),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f151])).
% 0.09/0.30 thf(f181,plain,(
% 0.09/0.30 spl3_1 | spl3_5 | spl3_3),
% 0.09/0.30 inference(avatar_split_clause,[],[f158,f169,f178,f161])).
% 0.09/0.30 thf(f158,plain,(
% 0.09/0.30 ($true = (sK1 @ sK8)) | ((sK2 @ sK6) = sK5) | ($true = (sK0 @ sK7))),
% 0.09/0.30 inference(equality_proxy_clausification,[],[f157])).
% 0.09/0.30 thf(f157,plain,(
% 0.09/0.30 ($true = (sK0 @ sK7)) | ($true = (sK1 @ sK8)) | (((sK2 @ sK6) = sK5) = $true)),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f149])).
% 0.09/0.30 thf(f149,plain,(
% 0.09/0.30 ($true = (sK0 @ sK7)) | ($true = (sK1 @ sK8)) | ($true = (((sK2 @ sK6) = sK5) & ((sK1 @ sK6) | (sK0 @ sK6))))),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f133])).
% 0.09/0.30 thf(f176,plain,(
% 0.09/0.30 spl3_1 | spl3_2 | spl3_3 | spl3_4),
% 0.09/0.30 inference(avatar_split_clause,[],[f159,f173,f169,f165,f161])).
% 0.09/0.30 thf(f159,plain,(
% 0.09/0.30 ($true = (sK0 @ sK7)) | ((sK0 @ sK6) = $true) | ($true = (sK1 @ sK8)) | ((sK1 @ sK6) = $true)),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f156])).
% 0.09/0.30 thf(f156,plain,(
% 0.09/0.30 ($true = ((sK1 @ sK6) | (sK0 @ sK6))) | ($true = (sK1 @ sK8)) | ($true = (sK0 @ sK7))),
% 0.09/0.30 inference(binary_proxy_clausification,[],[f149])).
% 0.09/0.30 % SZS output end Proof for theBenchmark
% 0.09/0.30 % (30703)------------------------------
% 0.09/0.30 % (30703)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.09/0.30 % (30703)Termination reason: Refutation
% 0.09/0.30
% 0.09/0.30 % (30703)Memory used [KB]: 5628
% 0.09/0.30 % (30703)Time elapsed: 0.008 s
% 0.09/0.30 % (30703)Instructions burned: 12 (million)
% 0.09/0.30 % (30703)------------------------------
% 0.09/0.30 % (30703)------------------------------
% 0.09/0.30 % (30696)Success in time 0.008 s
% 0.09/0.30 % Vampire---4.8 exiting
%------------------------------------------------------------------------------