TSTP Solution File: SET683^3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET683^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 : n014.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:49 EDT 2024
% Result : Theorem 0.15s 0.33s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SET683^3 : TPTP v8.2.0. Released v3.6.0.
% 0.08/0.10 % 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.10/0.30 % Computer : n014.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon May 20 13:17:37 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 This is a TH0_THM_EQU_NAR problem
% 0.10/0.30 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.32 % (15882)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.15/0.32 % (15880)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.32 % (15884)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.15/0.32 % (15881)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.32 % (15883)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.32 % (15877)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.15/0.32 % (15879)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.32 % (15880)Instruction limit reached!
% 0.15/0.32 % (15880)------------------------------
% 0.15/0.32 % (15880)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (15880)Termination reason: Unknown
% 0.15/0.32 % (15880)Termination phase: shuffling
% 0.15/0.32
% 0.15/0.32 % (15881)Instruction limit reached!
% 0.15/0.32 % (15881)------------------------------
% 0.15/0.32 % (15881)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (15881)Termination reason: Unknown
% 0.15/0.32 % (15881)Termination phase: shuffling
% 0.15/0.32
% 0.15/0.32 % (15881)Memory used [KB]: 1023
% 0.15/0.32 % (15881)Time elapsed: 0.003 s
% 0.15/0.32 % (15881)Instructions burned: 2 (million)
% 0.15/0.32 % (15881)------------------------------
% 0.15/0.32 % (15881)------------------------------
% 0.15/0.32 % (15880)Memory used [KB]: 1023
% 0.15/0.32 % (15880)Time elapsed: 0.003 s
% 0.15/0.32 % (15880)Instructions burned: 3 (million)
% 0.15/0.32 % (15878)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.15/0.32 % (15880)------------------------------
% 0.15/0.32 % (15880)------------------------------
% 0.15/0.32 % (15884)Instruction limit reached!
% 0.15/0.32 % (15884)------------------------------
% 0.15/0.32 % (15884)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (15884)Termination reason: Unknown
% 0.15/0.32 % (15884)Termination phase: shuffling
% 0.15/0.32
% 0.15/0.32 % (15884)Memory used [KB]: 1023
% 0.15/0.32 % (15884)Time elapsed: 0.003 s
% 0.15/0.32 % (15884)Instructions burned: 4 (million)
% 0.15/0.32 % (15884)------------------------------
% 0.15/0.32 % (15884)------------------------------
% 0.15/0.32 % (15878)Instruction limit reached!
% 0.15/0.32 % (15878)------------------------------
% 0.15/0.32 % (15878)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (15878)Termination reason: Unknown
% 0.15/0.32 % (15878)Termination phase: Property scanning
% 0.15/0.32
% 0.15/0.32 % (15878)Memory used [KB]: 1023
% 0.15/0.32 % (15878)Time elapsed: 0.003 s
% 0.15/0.32 % (15878)Instructions burned: 4 (million)
% 0.15/0.32 % (15878)------------------------------
% 0.15/0.32 % (15878)------------------------------
% 0.15/0.33 % (15882)First to succeed.
% 0.15/0.33 % (15883)Also succeeded, but the first one will report.
% 0.15/0.33 % (15882)Refutation found. Thanks to Tanya!
% 0.15/0.33 % SZS status Theorem for theBenchmark
% 0.15/0.33 % SZS output start Proof for theBenchmark
% 0.15/0.33 thf(func_def_0, type, in: $i > ($i > $o) > $o).
% 0.15/0.33 thf(func_def_2, type, is_a: $i > ($i > $o) > $o).
% 0.15/0.33 thf(func_def_3, type, emptyset: $i > $o).
% 0.15/0.33 thf(func_def_4, type, unord_pair: $i > $i > $i > $o).
% 0.15/0.33 thf(func_def_5, type, singleton: $i > $i > $o).
% 0.15/0.33 thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.33 thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.33 thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.33 thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o).
% 0.15/0.33 thf(func_def_10, type, complement: ($i > $o) > $i > $o).
% 0.15/0.33 thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o).
% 0.15/0.33 thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o).
% 0.15/0.33 thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o).
% 0.15/0.33 thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o).
% 0.15/0.33 thf(func_def_15, type, cartesian_product: ($i > $o) > ($i > $o) > $i > $i > $o).
% 0.15/0.33 thf(func_def_16, type, pair_rel: $i > $i > $i > $i > $o).
% 0.15/0.33 thf(func_def_17, type, id_rel: ($i > $o) > $i > $i > $o).
% 0.15/0.33 thf(func_def_18, type, sub_rel: ($i > $i > $o) > ($i > $i > $o) > $o).
% 0.15/0.33 thf(func_def_19, type, is_rel_on: ($i > $i > $o) > ($i > $o) > ($i > $o) > $o).
% 0.15/0.33 thf(func_def_20, type, restrict_rel_domain: ($i > $i > $o) > ($i > $o) > $i > $i > $o).
% 0.15/0.33 thf(func_def_21, type, rel_diagonal: $i > $i > $o).
% 0.15/0.33 thf(func_def_22, type, rel_composition: ($i > $i > $o) > ($i > $i > $o) > $i > $i > $o).
% 0.15/0.33 thf(func_def_23, type, reflexive: ($i > $i > $o) > $o).
% 0.15/0.33 thf(func_def_24, type, irreflexive: ($i > $i > $o) > $o).
% 0.15/0.33 thf(func_def_25, type, symmetric: ($i > $i > $o) > $o).
% 0.15/0.33 thf(func_def_26, type, transitive: ($i > $i > $o) > $o).
% 0.15/0.33 thf(func_def_27, type, equiv_rel: ($i > $i > $o) > $o).
% 0.15/0.33 thf(func_def_28, type, rel_codomain: ($i > $i > $o) > $i > $o).
% 0.15/0.33 thf(func_def_29, type, rel_domain: ($i > $i > $o) > $i > $o).
% 0.15/0.33 thf(func_def_30, type, rel_inverse: ($i > $i > $o) > $i > $i > $o).
% 0.15/0.33 thf(func_def_31, type, equiv_classes: ($i > $i > $o) > ($i > $o) > $o).
% 0.15/0.33 thf(func_def_32, type, restrict_rel_codomain: ($i > $i > $o) > ($i > $o) > $i > $i > $o).
% 0.15/0.33 thf(func_def_33, type, rel_field: ($i > $i > $o) > $i > $o).
% 0.15/0.33 thf(func_def_34, type, well_founded: ($i > $i > $o) > $o).
% 0.15/0.33 thf(func_def_35, type, upwards_well_founded: ($i > $i > $o) > $o).
% 0.15/0.33 thf(func_def_52, type, sK0: $i > $i > $o).
% 0.15/0.33 thf(func_def_53, type, sK1: $i > $o).
% 0.15/0.33 thf(func_def_54, type, sK2: $i > $o).
% 0.15/0.33 thf(f139,plain,(
% 0.15/0.33 $false),
% 0.15/0.33 inference(trivial_inequality_removal,[],[f138])).
% 0.15/0.33 thf(f138,plain,(
% 0.15/0.33 ($true = $false)),
% 0.15/0.33 inference(forward_demodulation,[],[f126,f137])).
% 0.15/0.33 thf(f137,plain,(
% 0.15/0.33 ( ! [X4 : $i,X5 : $i] : (((sK0 @ X4 @ X5) = $false)) )),
% 0.15/0.33 inference(subsumption_resolution,[],[f128,f136])).
% 0.15/0.33 thf(f136,plain,(
% 0.15/0.33 ( ! [X2 : $i,X1 : $i] : (($true = (sK1 @ X2)) | ((sK0 @ X2 @ X1) = $false)) )),
% 0.15/0.33 inference(binary_proxy_clausification,[],[f134])).
% 0.15/0.33 thf(f134,plain,(
% 0.15/0.33 ( ! [X2 : $i,X1 : $i] : (($true = ((sK1 @ X2) & (sK2 @ X1))) | ((sK0 @ X2 @ X1) = $false)) )),
% 0.15/0.33 inference(binary_proxy_clausification,[],[f133])).
% 0.15/0.33 thf(f133,plain,(
% 0.15/0.33 ( ! [X2 : $i,X1 : $i] : (($true = ((sK0 @ X2 @ X1) => ((sK1 @ X2) & (sK2 @ X1))))) )),
% 0.15/0.33 inference(beta_eta_normalization,[],[f132])).
% 0.15/0.33 thf(f132,plain,(
% 0.15/0.33 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((sK0 @ Y0 @ X1) => ((sK1 @ Y0) & (sK2 @ X1)))) @ X2))) )),
% 0.15/0.33 inference(pi_clausification,[],[f131])).
% 0.15/0.33 thf(f131,plain,(
% 0.15/0.33 ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((sK0 @ Y0 @ X1) => ((sK1 @ Y0) & (sK2 @ X1))))) = $true)) )),
% 0.15/0.33 inference(beta_eta_normalization,[],[f130])).
% 0.15/0.33 thf(f130,plain,(
% 0.15/0.33 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK0 @ Y1 @ Y0) => ((sK1 @ Y1) & (sK2 @ Y0)))))) @ X1))) )),
% 0.15/0.33 inference(pi_clausification,[],[f129])).
% 0.15/0.33 thf(f129,plain,(
% 0.15/0.33 ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((sK0 @ Y1 @ Y0) => ((sK1 @ Y1) & (sK2 @ Y0))))))))),
% 0.15/0.33 inference(beta_eta_normalization,[],[f121])).
% 0.15/0.33 thf(f121,plain,(
% 0.15/0.33 ($true = ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: (!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y0 @ Y4 @ Y3) => ((Y1 @ Y4) & (Y2 @ Y3)))))))))))) @ sK0 @ sK1 @ sK2))),
% 0.15/0.33 inference(definition_unfolding,[],[f117,f120])).
% 0.15/0.33 thf(f120,plain,(
% 0.15/0.33 (is_rel_on = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: (!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y0 @ Y4 @ Y3) => ((Y1 @ Y4) & (Y2 @ Y3)))))))))))))),
% 0.15/0.33 inference(cnf_transformation,[],[f75])).
% 0.15/0.33 thf(f75,plain,(
% 0.15/0.33 (is_rel_on = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: (!! @ $i @ (^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((Y0 @ Y4 @ Y3) => ((Y1 @ Y4) & (Y2 @ Y3)))))))))))))),
% 0.15/0.33 inference(fool_elimination,[],[f74])).
% 0.15/0.33 thf(f74,plain,(
% 0.15/0.33 ((^[X0 : $i > $i > $o, X1 : $i > $o, X2 : $i > $o] : (! [X3,X4] : ((X0 @ X3 @ X4) => ((X2 @ X4) & (X1 @ X3))))) = is_rel_on)),
% 0.15/0.33 inference(rectify,[],[f19])).
% 0.15/0.33 thf(f19,axiom,(
% 0.15/0.33 ((^[X8 : $i > $i > $o, X9 : $i > $o, X10 : $i > $o] : (! [X0,X2] : ((X8 @ X0 @ X2) => ((X10 @ X2) & (X9 @ X0))))) = is_rel_on)),
% 0.15/0.33 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',is_rel_on)).
% 0.15/0.33 thf(f117,plain,(
% 0.15/0.33 ($true = (is_rel_on @ sK0 @ sK1 @ sK2))),
% 0.15/0.33 inference(cnf_transformation,[],[f112])).
% 0.15/0.33 thf(f112,plain,(
% 0.15/0.33 ($true = (is_rel_on @ sK0 @ sK1 @ sK2)) & (($true = (sK2 @ sK3)) & ((rel_codomain @ sK0 @ sK3) = $true) & ! [X4] : (((sK1 @ X4) != $true) | ((rel_domain @ sK0 @ X4) != $true)))),
% 0.15/0.33 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f109,f111,f110])).
% 0.15/0.33 thf(f110,plain,(
% 0.15/0.33 ? [X0 : $i > $i > $o,X1 : $i > $o,X2 : $i > $o] : (($true = (is_rel_on @ X0 @ X1 @ X2)) & ? [X3] : (((X2 @ X3) = $true) & ((rel_codomain @ X0 @ X3) = $true) & ! [X4] : (($true != (X1 @ X4)) | ($true != (rel_domain @ X0 @ X4))))) => (($true = (is_rel_on @ sK0 @ sK1 @ sK2)) & ? [X3] : (($true = (sK2 @ X3)) & ($true = (rel_codomain @ sK0 @ X3)) & ! [X4] : (((sK1 @ X4) != $true) | ((rel_domain @ sK0 @ X4) != $true))))),
% 0.15/0.33 introduced(choice_axiom,[])).
% 0.15/0.33 thf(f111,plain,(
% 0.15/0.33 ? [X3] : (($true = (sK2 @ X3)) & ($true = (rel_codomain @ sK0 @ X3)) & ! [X4] : (((sK1 @ X4) != $true) | ((rel_domain @ sK0 @ X4) != $true))) => (($true = (sK2 @ sK3)) & ((rel_codomain @ sK0 @ sK3) = $true) & ! [X4] : (((sK1 @ X4) != $true) | ((rel_domain @ sK0 @ X4) != $true)))),
% 0.15/0.33 introduced(choice_axiom,[])).
% 0.15/0.33 thf(f109,plain,(
% 0.15/0.33 ? [X0 : $i > $i > $o,X1 : $i > $o,X2 : $i > $o] : (($true = (is_rel_on @ X0 @ X1 @ X2)) & ? [X3] : (((X2 @ X3) = $true) & ((rel_codomain @ X0 @ X3) = $true) & ! [X4] : (($true != (X1 @ X4)) | ($true != (rel_domain @ X0 @ X4)))))),
% 0.15/0.33 inference(flattening,[],[f108])).
% 0.15/0.33 thf(f108,plain,(
% 0.15/0.33 ? [X0 : $i > $i > $o,X1 : $i > $o,X2 : $i > $o] : (? [X3] : ((! [X4] : (($true != (X1 @ X4)) | ($true != (rel_domain @ X0 @ X4))) & ((rel_codomain @ X0 @ X3) = $true)) & ((X2 @ X3) = $true)) & ($true = (is_rel_on @ X0 @ X1 @ X2)))),
% 0.15/0.33 inference(ennf_transformation,[],[f69])).
% 0.15/0.33 thf(f69,plain,(
% 0.15/0.33 ~! [X0 : $i > $i > $o,X1 : $i > $o,X2 : $i > $o] : (($true = (is_rel_on @ X0 @ X1 @ X2)) => ! [X3] : (((X2 @ X3) = $true) => (((rel_codomain @ X0 @ X3) = $true) => ? [X4] : (($true = (rel_domain @ X0 @ X4)) & ($true = (X1 @ X4))))))),
% 0.15/0.33 inference(fool_elimination,[],[f68])).
% 0.15/0.33 thf(f68,plain,(
% 0.15/0.33 ~! [X0 : $i > $i > $o,X1 : $i > $o,X2 : $i > $o] : ((is_rel_on @ X0 @ X1 @ X2) => ! [X3] : ((X2 @ X3) => ((rel_codomain @ X0 @ X3) => ? [X4] : ((X1 @ X4) & (rel_domain @ X0 @ X4)))))),
% 0.15/0.33 inference(rectify,[],[f37])).
% 0.15/0.33 thf(f37,negated_conjecture,(
% 0.15/0.33 ~! [X8 : $i > $i > $o,X0 : $i > $o,X2 : $i > $o] : ((is_rel_on @ X8 @ X0 @ X2) => ! [X4] : ((X2 @ X4) => ((rel_codomain @ X8 @ X4) => ? [X3] : ((X0 @ X3) & (rel_domain @ X8 @ X3)))))),
% 0.15/0.33 inference(negated_conjecture,[],[f36])).
% 0.15/0.33 thf(f36,conjecture,(
% 0.15/0.33 ! [X8 : $i > $i > $o,X0 : $i > $o,X2 : $i > $o] : ((is_rel_on @ X8 @ X0 @ X2) => ! [X4] : ((X2 @ X4) => ((rel_codomain @ X8 @ X4) => ? [X3] : ((X0 @ X3) & (rel_domain @ X8 @ X3)))))),
% 0.15/0.33 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm)).
% 0.15/0.33 thf(f128,plain,(
% 0.15/0.33 ( ! [X4 : $i,X5 : $i] : (((sK0 @ X4 @ X5) = $false) | ((sK1 @ X4) != $true)) )),
% 0.15/0.33 inference(pi_clausification,[],[f127])).
% 0.15/0.33 thf(f127,plain,(
% 0.15/0.33 ( ! [X4 : $i] : (((sK1 @ X4) != $true) | ($true != (?? @ $i @ (sK0 @ X4)))) )),
% 0.15/0.33 inference(beta_eta_normalization,[],[f123])).
% 0.15/0.33 thf(f123,plain,(
% 0.15/0.33 ( ! [X4 : $i] : (((sK1 @ X4) != $true) | ($true != ((^[Y0 : $i > $i > $o]: ((^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y1 @ Y2)))))) @ sK0 @ X4))) )),
% 0.15/0.33 inference(definition_unfolding,[],[f114,f118])).
% 0.15/0.33 thf(f118,plain,(
% 0.15/0.33 (rel_domain = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y1 @ Y2)))))))),
% 0.15/0.33 inference(cnf_transformation,[],[f63])).
% 0.15/0.33 thf(f63,plain,(
% 0.15/0.33 (rel_domain = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y1 @ Y2)))))))),
% 0.15/0.33 inference(fool_elimination,[],[f62])).
% 0.15/0.33 thf(f62,plain,(
% 0.15/0.33 ((^[X0 : $i > $i > $o, X1 : $i] : (? [X2] : (X0 @ X1 @ X2))) = rel_domain)),
% 0.15/0.33 inference(rectify,[],[f29])).
% 0.15/0.33 thf(f29,axiom,(
% 0.15/0.33 ((^[X8 : $i > $i > $o, X0 : $i] : (? [X2] : (X8 @ X0 @ X2))) = rel_domain)),
% 0.15/0.33 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rel_domain)).
% 0.15/0.33 thf(f114,plain,(
% 0.15/0.33 ( ! [X4 : $i] : (((sK1 @ X4) != $true) | ((rel_domain @ sK0 @ X4) != $true)) )),
% 0.15/0.33 inference(cnf_transformation,[],[f112])).
% 0.15/0.33 thf(f126,plain,(
% 0.15/0.33 ($true = (sK0 @ sK5 @ sK3))),
% 0.15/0.33 inference(beta_eta_normalization,[],[f125])).
% 0.15/0.33 thf(f125,plain,(
% 0.15/0.33 ($true = ((^[Y0 : $i]: (sK0 @ Y0 @ sK3)) @ sK5))),
% 0.15/0.33 inference(sigma_clausification,[],[f124])).
% 0.15/0.33 thf(f124,plain,(
% 0.15/0.33 ($true = (?? @ $i @ (^[Y0 : $i]: (sK0 @ Y0 @ sK3))))),
% 0.15/0.33 inference(beta_eta_normalization,[],[f122])).
% 0.15/0.33 thf(f122,plain,(
% 0.15/0.33 (((^[Y0 : $i > $i > $o]: ((^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y2 @ Y1)))))) @ sK0 @ sK3) = $true)),
% 0.15/0.33 inference(definition_unfolding,[],[f115,f119])).
% 0.15/0.33 thf(f119,plain,(
% 0.15/0.33 (rel_codomain = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y2 @ Y1)))))))),
% 0.15/0.33 inference(cnf_transformation,[],[f93])).
% 0.15/0.33 thf(f93,plain,(
% 0.15/0.33 (rel_codomain = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y2 @ Y1)))))))),
% 0.15/0.33 inference(fool_elimination,[],[f92])).
% 0.15/0.33 thf(f92,plain,(
% 0.15/0.33 ((^[X0 : $i > $i > $o, X1 : $i] : (? [X2] : (X0 @ X2 @ X1))) = rel_codomain)),
% 0.15/0.33 inference(rectify,[],[f28])).
% 0.15/0.33 thf(f28,axiom,(
% 0.15/0.33 ((^[X8 : $i > $i > $o, X2 : $i] : (? [X0] : (X8 @ X0 @ X2))) = rel_codomain)),
% 0.15/0.33 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rel_codomain)).
% 0.15/0.33 thf(f115,plain,(
% 0.15/0.33 ((rel_codomain @ sK0 @ sK3) = $true)),
% 0.15/0.33 inference(cnf_transformation,[],[f112])).
% 0.15/0.33 % SZS output end Proof for theBenchmark
% 0.15/0.33 % (15882)------------------------------
% 0.15/0.33 % (15882)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (15882)Termination reason: Refutation
% 0.15/0.33
% 0.15/0.33 % (15882)Memory used [KB]: 5628
% 0.15/0.33 % (15882)Time elapsed: 0.006 s
% 0.15/0.33 % (15882)Instructions burned: 8 (million)
% 0.15/0.33 % (15882)------------------------------
% 0.15/0.33 % (15882)------------------------------
% 0.15/0.33 % (15876)Success in time 0.018 s
% 0.15/0.33 % Vampire---4.8 exiting
%------------------------------------------------------------------------------