TSTP Solution File: SET670^3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET670^3 : 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 : n010.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:12:45 EDT 2024
% Result : Theorem 0.22s 0.40s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SET670^3 : TPTP v8.2.0. Released v3.6.0.
% 0.07/0.15 % 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 : n010.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 12:19:38 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TH0_THM_EQU_NAR problem
% 0.15/0.37 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.39 % (21200)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.39 % (21200)Instruction limit reached!
% 0.15/0.39 % (21200)------------------------------
% 0.15/0.39 % (21200)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (21200)Termination reason: Unknown
% 0.15/0.39 % (21200)Termination phase: shuffling
% 0.15/0.39
% 0.15/0.39 % (21200)Memory used [KB]: 1023
% 0.15/0.39 % (21200)Time elapsed: 0.003 s
% 0.15/0.39 % (21200)Instructions burned: 2 (million)
% 0.15/0.39 % (21200)------------------------------
% 0.15/0.39 % (21200)------------------------------
% 0.15/0.39 % (21198)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.39 % (21199)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.39 % (21199)Instruction limit reached!
% 0.22/0.39 % (21199)------------------------------
% 0.22/0.39 % (21199)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.39 % (21199)Termination reason: Unknown
% 0.22/0.39 % (21199)Termination phase: shuffling
% 0.22/0.39
% 0.22/0.39 % (21199)Memory used [KB]: 1023
% 0.22/0.39 % (21199)Time elapsed: 0.003 s
% 0.22/0.39 % (21199)Instructions burned: 3 (million)
% 0.22/0.39 % (21199)------------------------------
% 0.22/0.39 % (21199)------------------------------
% 0.22/0.39 % (21203)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.22/0.39 % (21202)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.22/0.39 % (21201)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.22/0.39 % (21197)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.22/0.40 % (21203)Instruction limit reached!
% 0.22/0.40 % (21203)------------------------------
% 0.22/0.40 % (21203)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (21203)Termination reason: Unknown
% 0.22/0.40 % (21203)Termination phase: shuffling
% 0.22/0.40
% 0.22/0.40 % (21203)Memory used [KB]: 1023
% 0.22/0.40 % (21203)Time elapsed: 0.003 s
% 0.22/0.40 % (21203)Instructions burned: 3 (million)
% 0.22/0.40 % (21203)------------------------------
% 0.22/0.40 % (21203)------------------------------
% 0.22/0.40 % (21197)Instruction limit reached!
% 0.22/0.40 % (21197)------------------------------
% 0.22/0.40 % (21197)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (21197)Termination reason: Unknown
% 0.22/0.40 % (21197)Termination phase: Property scanning
% 0.22/0.40
% 0.22/0.40 % (21197)Memory used [KB]: 1023
% 0.22/0.40 % (21197)Time elapsed: 0.004 s
% 0.22/0.40 % (21197)Instructions burned: 5 (million)
% 0.22/0.40 % (21197)------------------------------
% 0.22/0.40 % (21197)------------------------------
% 0.22/0.40 % (21198)First to succeed.
% 0.22/0.40 % (21201)Also succeeded, but the first one will report.
% 0.22/0.40 % (21202)Also succeeded, but the first one will report.
% 0.22/0.40 % (21198)Refutation found. Thanks to Tanya!
% 0.22/0.40 % SZS status Theorem for theBenchmark
% 0.22/0.40 % SZS output start Proof for theBenchmark
% 0.22/0.40 thf(func_def_0, type, in: $i > ($i > $o) > $o).
% 0.22/0.40 thf(func_def_2, type, is_a: $i > ($i > $o) > $o).
% 0.22/0.40 thf(func_def_3, type, emptyset: $i > $o).
% 0.22/0.40 thf(func_def_4, type, unord_pair: $i > $i > $i > $o).
% 0.22/0.40 thf(func_def_5, type, singleton: $i > $i > $o).
% 0.22/0.40 thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_10, type, complement: ($i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o).
% 0.22/0.40 thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o).
% 0.22/0.40 thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o).
% 0.22/0.40 thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o).
% 0.22/0.40 thf(func_def_15, type, cartesian_product: ($i > $o) > ($i > $o) > $i > $i > $o).
% 0.22/0.40 thf(func_def_16, type, pair_rel: $i > $i > $i > $i > $o).
% 0.22/0.40 thf(func_def_17, type, id_rel: ($i > $o) > $i > $i > $o).
% 0.22/0.40 thf(func_def_18, type, sub_rel: ($i > $i > $o) > ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_19, type, is_rel_on: ($i > $i > $o) > ($i > $o) > ($i > $o) > $o).
% 0.22/0.40 thf(func_def_20, type, restrict_rel_domain: ($i > $i > $o) > ($i > $o) > $i > $i > $o).
% 0.22/0.40 thf(func_def_21, type, rel_diagonal: $i > $i > $o).
% 0.22/0.40 thf(func_def_22, type, rel_composition: ($i > $i > $o) > ($i > $i > $o) > $i > $i > $o).
% 0.22/0.40 thf(func_def_23, type, reflexive: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_24, type, irreflexive: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_25, type, symmetric: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_26, type, transitive: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_27, type, equiv_rel: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_28, type, rel_codomain: ($i > $i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_29, type, rel_domain: ($i > $i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_30, type, rel_inverse: ($i > $i > $o) > $i > $i > $o).
% 0.22/0.40 thf(func_def_31, type, equiv_classes: ($i > $i > $o) > ($i > $o) > $o).
% 0.22/0.40 thf(func_def_32, type, restrict_rel_codomain: ($i > $i > $o) > ($i > $o) > $i > $i > $o).
% 0.22/0.40 thf(func_def_33, type, rel_field: ($i > $i > $o) > $i > $o).
% 0.22/0.40 thf(func_def_34, type, well_founded: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_35, type, upwards_well_founded: ($i > $i > $o) > $o).
% 0.22/0.40 thf(func_def_36, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.22/0.40 thf(func_def_53, type, sK0: $i > $i > $o).
% 0.22/0.40 thf(func_def_54, type, sK1: $i > $o).
% 0.22/0.40 thf(func_def_55, type, sK2: $i > $o).
% 0.22/0.40 thf(func_def_56, type, sK3: $i > $o).
% 0.22/0.40 thf(f197,plain,(
% 0.22/0.40 $false),
% 0.22/0.40 inference(avatar_sat_refutation,[],[f179,f193,f196])).
% 0.22/0.40 thf(f196,plain,(
% 0.22/0.40 ~spl4_1),
% 0.22/0.40 inference(avatar_contradiction_clause,[],[f195])).
% 0.22/0.40 thf(f195,plain,(
% 0.22/0.40 $false | ~spl4_1),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f194])).
% 0.22/0.40 thf(f194,plain,(
% 0.22/0.40 ($true = $false) | ~spl4_1),
% 0.22/0.40 inference(backward_demodulation,[],[f161,f174])).
% 0.22/0.40 thf(f174,plain,(
% 0.22/0.40 ((sK1 @ sK6) = $false) | ~spl4_1),
% 0.22/0.40 inference(avatar_component_clause,[],[f172])).
% 0.22/0.40 thf(f172,plain,(
% 0.22/0.40 spl4_1 <=> ((sK1 @ sK6) = $false)),
% 0.22/0.40 introduced(avatar_definition,[new_symbols(naming,[spl4_1])])).
% 0.22/0.40 thf(f161,plain,(
% 0.22/0.40 ($true = (sK1 @ sK6))),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f159])).
% 0.22/0.40 thf(f159,plain,(
% 0.22/0.40 (((sK1 @ sK6) & (sK0 @ sK6 @ sK5)) = $true)),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f157])).
% 0.22/0.40 thf(f157,plain,(
% 0.22/0.40 ((((sK1 @ sK6) & (sK0 @ sK6 @ sK5)) => ((sK3 @ sK5) & (sK1 @ sK6))) = $false)),
% 0.22/0.40 inference(beta_eta_normalization,[],[f156])).
% 0.22/0.40 thf(f156,plain,(
% 0.22/0.40 ($false = ((^[Y0 : $i]: (((sK1 @ Y0) & (sK0 @ Y0 @ sK5)) => ((sK3 @ sK5) & (sK1 @ Y0)))) @ sK6))),
% 0.22/0.40 inference(sigma_clausification,[],[f155])).
% 0.22/0.40 thf(f155,plain,(
% 0.22/0.40 ($false = (!! @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) & (sK0 @ Y0 @ sK5)) => ((sK3 @ sK5) & (sK1 @ Y0))))))),
% 0.22/0.40 inference(beta_eta_normalization,[],[f154])).
% 0.22/0.40 thf(f154,plain,(
% 0.22/0.40 (((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK1 @ Y1) & (sK0 @ Y1 @ Y0)) => ((sK3 @ Y0) & (sK1 @ Y1)))))) @ sK5) = $false)),
% 0.22/0.40 inference(sigma_clausification,[],[f153])).
% 0.22/0.40 thf(f153,plain,(
% 0.22/0.40 ($true != (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (((sK1 @ Y1) & (sK0 @ Y1 @ Y0)) => ((sK3 @ Y0) & (sK1 @ Y1))))))))),
% 0.22/0.40 inference(beta_eta_normalization,[],[f152])).
% 0.22/0.40 thf(f152,plain,(
% 0.22/0.40 ($true != ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: (!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y0 @ Y4 @ Y3) => ((Y2 @ Y3) & (Y1 @ Y4)))))))))))) @ ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((Y1 @ Y2) & (Y0 @ Y2 @ Y3))))))))) @ sK0 @ sK1) @ sK1 @ sK3))),
% 0.22/0.40 inference(definition_unfolding,[],[f146,f135,f112])).
% 0.22/0.40 thf(f112,plain,(
% 0.22/0.40 (restrict_rel_domain = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((Y1 @ Y2) & (Y0 @ Y2 @ Y3))))))))))),
% 0.22/0.40 inference(cnf_transformation,[],[f88])).
% 0.22/0.40 thf(f88,plain,(
% 0.22/0.40 (restrict_rel_domain = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: ((Y1 @ Y2) & (Y0 @ Y2 @ Y3))))))))))),
% 0.22/0.40 inference(fool_elimination,[],[f87])).
% 0.22/0.40 thf(f87,plain,(
% 0.22/0.40 ((^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i, X3 : $i] : ((X0 @ X2 @ X3) & (X1 @ X2))) = restrict_rel_domain)),
% 0.22/0.40 inference(rectify,[],[f20])).
% 0.22/0.40 thf(f20,axiom,(
% 0.22/0.40 ((^[X8 : $i > $i > $o, X5 : $i > $o, X0 : $i, X2 : $i] : ((X8 @ X0 @ X2) & (X5 @ X0))) = restrict_rel_domain)),
% 0.22/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',restrict_rel_domain)).
% 0.22/0.40 thf(f135,plain,(
% 0.22/0.40 (is_rel_on = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: (!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y0 @ Y4 @ Y3) => ((Y2 @ Y3) & (Y1 @ Y4)))))))))))))),
% 0.22/0.40 inference(cnf_transformation,[],[f54])).
% 0.22/0.40 thf(f54,plain,(
% 0.22/0.40 (is_rel_on = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: (!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y0 @ Y4 @ Y3) => ((Y2 @ Y3) & (Y1 @ Y4)))))))))))))),
% 0.22/0.40 inference(fool_elimination,[],[f53])).
% 0.22/0.40 thf(f53,plain,(
% 0.22/0.40 ((^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i > $o] : (! [X3,X4] : ((X0 @ X3 @ X4) => ((X1 @ X3) & (X2 @ X4))))) = is_rel_on)),
% 0.22/0.40 inference(rectify,[],[f19])).
% 0.22/0.40 thf(f19,axiom,(
% 0.22/0.40 ((^[X8 : $i > $i > $o, X9 : $i > $o, X10 : $i > $o] : (! [X0,X2] : ((X8 @ X0 @ X2) => ((X9 @ X0) & (X10 @ X2))))) = is_rel_on)),
% 0.22/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',is_rel_on)).
% 0.22/0.40 thf(f146,plain,(
% 0.22/0.40 ((is_rel_on @ (restrict_rel_domain @ sK0 @ sK1) @ sK1 @ sK3) != $true)),
% 0.22/0.40 inference(cnf_transformation,[],[f110])).
% 0.22/0.40 thf(f110,plain,(
% 0.22/0.40 ($true = (is_rel_on @ sK0 @ sK2 @ sK3)) & ((is_rel_on @ (restrict_rel_domain @ sK0 @ sK1) @ sK1 @ sK3) != $true)),
% 0.22/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f108,f109])).
% 0.22/0.40 thf(f109,plain,(
% 0.22/0.40 ? [X0 : $i > $i > $o,X1 : $i > $o,X2 : $i > $o,X3 : $i > $o] : (($true = (is_rel_on @ X0 @ X2 @ X3)) & ($true != (is_rel_on @ (restrict_rel_domain @ X0 @ X1) @ X1 @ X3))) => (($true = (is_rel_on @ sK0 @ sK2 @ sK3)) & ((is_rel_on @ (restrict_rel_domain @ sK0 @ sK1) @ sK1 @ sK3) != $true))),
% 0.22/0.40 introduced(choice_axiom,[])).
% 0.22/0.40 thf(f108,plain,(
% 0.22/0.40 ? [X0 : $i > $i > $o,X1 : $i > $o,X2 : $i > $o,X3 : $i > $o] : (($true = (is_rel_on @ X0 @ X2 @ X3)) & ($true != (is_rel_on @ (restrict_rel_domain @ X0 @ X1) @ X1 @ X3)))),
% 0.22/0.40 inference(ennf_transformation,[],[f96])).
% 0.22/0.40 thf(f96,plain,(
% 0.22/0.40 ~! [X0 : $i > $i > $o,X1 : $i > $o,X2 : $i > $o,X3 : $i > $o] : (($true = (is_rel_on @ X0 @ X2 @ X3)) => ($true = (is_rel_on @ (restrict_rel_domain @ X0 @ X1) @ X1 @ X3)))),
% 0.22/0.40 inference(fool_elimination,[],[f95])).
% 0.22/0.40 thf(f95,plain,(
% 0.22/0.40 ~! [X0 : $i > $i > $o,X1 : $i > $o,X2 : $i > $o,X3 : $i > $o] : ((is_rel_on @ X0 @ X2 @ X3) => (is_rel_on @ (restrict_rel_domain @ X0 @ X1) @ X1 @ X3))),
% 0.22/0.40 inference(rectify,[],[f37])).
% 0.22/0.40 thf(f37,negated_conjecture,(
% 0.22/0.40 ~! [X8 : $i > $i > $o,X11 : $i > $o,X0 : $i > $o,X2 : $i > $o] : ((is_rel_on @ X8 @ X0 @ X2) => (is_rel_on @ (restrict_rel_domain @ X8 @ X11) @ X11 @ X2))),
% 0.22/0.40 inference(negated_conjecture,[],[f36])).
% 0.22/0.40 thf(f36,conjecture,(
% 0.22/0.40 ! [X8 : $i > $i > $o,X11 : $i > $o,X0 : $i > $o,X2 : $i > $o] : ((is_rel_on @ X8 @ X0 @ X2) => (is_rel_on @ (restrict_rel_domain @ X8 @ X11) @ X11 @ X2))),
% 0.22/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm)).
% 0.22/0.40 thf(f193,plain,(
% 0.22/0.40 ~spl4_2),
% 0.22/0.40 inference(avatar_contradiction_clause,[],[f192])).
% 0.22/0.40 thf(f192,plain,(
% 0.22/0.40 $false | ~spl4_2),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f191])).
% 0.22/0.40 thf(f191,plain,(
% 0.22/0.40 ($true = $false) | ~spl4_2),
% 0.22/0.40 inference(forward_demodulation,[],[f186,f178])).
% 0.22/0.40 thf(f178,plain,(
% 0.22/0.40 ((sK3 @ sK5) = $false) | ~spl4_2),
% 0.22/0.40 inference(avatar_component_clause,[],[f176])).
% 0.22/0.40 thf(f176,plain,(
% 0.22/0.40 spl4_2 <=> ((sK3 @ sK5) = $false)),
% 0.22/0.40 introduced(avatar_definition,[new_symbols(naming,[spl4_2])])).
% 0.22/0.40 thf(f186,plain,(
% 0.22/0.40 ($true = (sK3 @ sK5))),
% 0.22/0.40 inference(trivial_inequality_removal,[],[f180])).
% 0.22/0.40 thf(f180,plain,(
% 0.22/0.40 ($true = (sK3 @ sK5)) | ($true = $false)),
% 0.22/0.40 inference(superposition,[],[f160,f170])).
% 0.22/0.40 thf(f170,plain,(
% 0.22/0.40 ( ! [X2 : $i,X1 : $i] : (($false = (sK0 @ X2 @ X1)) | ($true = (sK3 @ X1))) )),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f168])).
% 0.22/0.40 thf(f168,plain,(
% 0.22/0.40 ( ! [X2 : $i,X1 : $i] : (($false = (sK0 @ X2 @ X1)) | ($true = ((sK3 @ X1) & (sK2 @ X2)))) )),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f167])).
% 0.22/0.40 thf(f167,plain,(
% 0.22/0.40 ( ! [X2 : $i,X1 : $i] : (($true = ((sK0 @ X2 @ X1) => ((sK3 @ X1) & (sK2 @ X2))))) )),
% 0.22/0.40 inference(beta_eta_normalization,[],[f166])).
% 0.22/0.40 thf(f166,plain,(
% 0.22/0.40 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((sK0 @ Y0 @ X1) => ((sK3 @ X1) & (sK2 @ Y0)))) @ X2))) )),
% 0.22/0.40 inference(pi_clausification,[],[f165])).
% 0.22/0.40 thf(f165,plain,(
% 0.22/0.40 ( ! [X1 : $i] : (($true = (!! @ $i @ (^[Y0 : $i]: ((sK0 @ Y0 @ X1) => ((sK3 @ X1) & (sK2 @ Y0))))))) )),
% 0.22/0.40 inference(beta_eta_normalization,[],[f164])).
% 0.22/0.40 thf(f164,plain,(
% 0.22/0.40 ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK0 @ Y1 @ Y0) => ((sK3 @ Y0) & (sK2 @ Y1)))))) @ X1) = $true)) )),
% 0.22/0.40 inference(pi_clausification,[],[f163])).
% 0.22/0.40 thf(f163,plain,(
% 0.22/0.40 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK0 @ Y1 @ Y0) => ((sK3 @ Y0) & (sK2 @ Y1))))))))),
% 0.22/0.40 inference(beta_eta_normalization,[],[f151])).
% 0.22/0.40 thf(f151,plain,(
% 0.22/0.40 ($true = ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: (!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y0 @ Y4 @ Y3) => ((Y2 @ Y3) & (Y1 @ Y4)))))))))))) @ sK0 @ sK2 @ sK3))),
% 0.22/0.40 inference(definition_unfolding,[],[f147,f135])).
% 0.22/0.40 thf(f147,plain,(
% 0.22/0.40 ($true = (is_rel_on @ sK0 @ sK2 @ sK3))),
% 0.22/0.40 inference(cnf_transformation,[],[f110])).
% 0.22/0.40 thf(f160,plain,(
% 0.22/0.40 ($true = (sK0 @ sK6 @ sK5))),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f159])).
% 0.22/0.40 thf(f179,plain,(
% 0.22/0.40 spl4_1 | spl4_2),
% 0.22/0.40 inference(avatar_split_clause,[],[f162,f176,f172])).
% 0.22/0.40 thf(f162,plain,(
% 0.22/0.40 ((sK1 @ sK6) = $false) | ((sK3 @ sK5) = $false)),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f158])).
% 0.22/0.40 thf(f158,plain,(
% 0.22/0.40 (((sK3 @ sK5) & (sK1 @ sK6)) = $false)),
% 0.22/0.40 inference(binary_proxy_clausification,[],[f157])).
% 0.22/0.40 % SZS output end Proof for theBenchmark
% 0.22/0.40 % (21198)------------------------------
% 0.22/0.40 % (21198)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (21198)Termination reason: Refutation
% 0.22/0.40
% 0.22/0.40 % (21198)Memory used [KB]: 5628
% 0.22/0.40 % (21198)Time elapsed: 0.009 s
% 0.22/0.40 % (21198)Instructions burned: 10 (million)
% 0.22/0.40 % (21198)------------------------------
% 0.22/0.40 % (21198)------------------------------
% 0.22/0.40 % (21195)Success in time 0.021 s
% 0.22/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------