%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL711^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:15:07 AM UTC 2026
% Result : Theorem 0.20s 0.37s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL711^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.19 % Computer : n008.cluster.edu
% 0.12/0.19 % Model : x86_64 x86_64
% 0.12/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.19 % Memory : 8046.5625MB
% 0.12/0.19 % OS : Linux 6.8.0-71-generic
% 0.12/0.19 % CPULimit : 300
% 0.12/0.20 % WCLimit : 300
% 0.12/0.20 % DateTime : Tue Sep 29 09:53:20 UTC 2026
% 0.12/0.20 % CPUTime :
% 0.12/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.24 Running first-order model finding
% 0.12/0.24 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 % (2936989)Will run a generic schedule for satisfiability detection.
% 0.20/0.37 % (2936994)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3221487431_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.37 % Exception at run slice level
% 0.20/0.37 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.37 % (2936998)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=152669950:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.37 % (2937002)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3912453967:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.37 % (2936998)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.37 % (2936995)% WARNING: option uhcvi not known.
% 0.20/0.37 % Exception at run slice level
% 0.20/0.37 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.37 % (2936995)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1517922723:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.37 % (2936999)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=502568577:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.37 % (2936995)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.37 % (2936998) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2936989-2936998"...
% 0.20/0.37 % (2936995)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.37 % (2936997)dis+10_1_sil=32000:sp=arity:random_seed=788890661:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.37 % (2936996)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3919667134:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.37 % (2936998)...printing done.
% 0.20/0.37 % (2936998)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for theBenchmark
% 0.20/0.37 % SZS output start Proof for theBenchmark
% 0.20/0.37 thf(type_def_5, type, mu: $tType).
% 0.20/0.37 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.37 thf(func_def_0, type, meq_ind: (mu > mu > $i > $o)).
% 0.20/0.37 thf(func_def_1, type, meq_prop: (($i > $o) > ($i > $o) > $i > $o)).
% 0.20/0.37 thf(func_def_3, type, mnot: (($i > $o) > $i > $o)).
% 0.20/0.37 thf(func_def_4, type, mor: (($i > $o) > ($i > $o) > $i > $o)).
% 0.20/0.37 thf(func_def_5, type, mand: (($i > $o) > ($i > $o) > $i > $o)).
% 0.20/0.37 thf(func_def_6, type, mimplies: (($i > $o) > ($i > $o) > $i > $o)).
% 0.20/0.37 thf(func_def_7, type, mimplied: (($i > $o) > ($i > $o) > $i > $o)).
% 0.20/0.37 thf(func_def_8, type, mequiv: (($i > $o) > ($i > $o) > $i > $o)).
% 0.20/0.37 thf(func_def_9, type, mxor: (($i > $o) > ($i > $o) > $i > $o)).
% 0.20/0.37 thf(func_def_10, type, mforall_ind: ((mu > $i > $o) > $i > $o)).
% 0.20/0.37 thf(func_def_11, type, mforall_prop: ((($i > $o) > $i > $o) > $i > $o)).
% 0.20/0.37 thf(func_def_12, type, mexists_ind: ((mu > $i > $o) > $i > $o)).
% 0.20/0.37 thf(func_def_13, type, mexists_prop: ((($i > $o) > $i > $o) > $i > $o)).
% 0.20/0.37 thf(func_def_14, type, mtrue: ($i > $o)).
% 0.20/0.37 thf(func_def_15, type, mfalse: ($i > $o)).
% 0.20/0.37 thf(func_def_16, type, mbox: (($i > $i > $o) > ($i > $o) > $i > $o)).
% 0.20/0.37 thf(func_def_17, type, mdia: (($i > $i > $o) > ($i > $o) > $i > $o)).
% 0.20/0.37 thf(func_def_18, type, mreflexive: (($i > $i > $o) > $o)).
% 0.20/0.37 thf(func_def_19, type, msymmetric: (($i > $i > $o) > $o)).
% 0.20/0.37 thf(func_def_20, type, mserial: (($i > $i > $o) > $o)).
% 0.20/0.37 thf(func_def_21, type, mtransitive: (($i > $i > $o) > $o)).
% 0.20/0.37 thf(func_def_22, type, meuclidean: (($i > $i > $o) > $o)).
% 0.20/0.37 thf(func_def_23, type, mpartially_functional: (($i > $i > $o) > $o)).
% 0.20/0.37 thf(func_def_24, type, mfunctional: (($i > $i > $o) > $o)).
% 0.20/0.37 thf(func_def_25, type, mweakly_dense: (($i > $i > $o) > $o)).
% 0.20/0.37 thf(func_def_26, type, mweakly_connected: (($i > $i > $o) > $o)).
% 0.20/0.37 thf(func_def_27, type, mweakly_directed: (($i > $i > $o) > $o)).
% 0.20/0.37 thf(func_def_28, type, mvalid: (($i > $o) > $o)).
% 0.20/0.37 thf(func_def_29, type, minvalid: (($i > $o) > $o)).
% 0.20/0.37 thf(func_def_30, type, msatisfiable: (($i > $o) > $o)).
% 0.20/0.37 thf(func_def_31, type, mcountersatisfiable: (($i > $o) > $o)).
% 0.20/0.37 thf(func_def_32, type, db2: !>[X0: $tType]:(X0)).
% 0.20/0.37 thf(func_def_33, type, db1: !>[X0: $tType]:(X0)).
% 0.20/0.37 thf(func_def_34, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.20/0.37 thf(func_def_35, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.20/0.37 thf(func_def_36, type, db0: !>[X0: $tType]:(X0)).
% 0.20/0.37 thf(func_def_37, type, vNOT: ($o > $o)).
% 0.20/0.37 thf(func_def_38, type, vOR: ($o > $o > $o)).
% 0.20/0.37 thf(func_def_39, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.20/0.37 thf(func_def_42, type, db3: !>[X0: $tType]:(X0)).
% 0.20/0.37 thf(func_def_43, type, vIMP: ($o > $o > $o)).
% 0.20/0.37 thf(func_def_44, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.20/0.37 thf(func_def_45, type, vAND: ($o > $o > $o)).
% 0.20/0.37 thf(func_def_46, type, db4: !>[X0: $tType]:(X0)).
% 0.20/0.37 thf(func_def_47, type, sK0: ($i > $i > $o)).
% 0.20/0.37 thf(func_def_48, type, sK1: ($i > ($i > $o) > $i)).
% 0.20/0.37 thf(func_def_49, type, sK2: ($i > ($i > $o) > $i)).
% 0.20/0.37 thf(f3,axiom,(
% 0.20/0.37 (mnot = (^[X0 : ($i > $o), X1 : $i] : (~(X0 @ X1))))),
% 0.20/0.37 file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mnot)).
% 0.20/0.37 thf(f4,axiom,(
% 0.20/0.37 (mor = (^[X0 : ($i > $o), X1 : ($i > $o), X2 : $i] : ((X1 @ X2) | (X0 @ X2))))),
% 0.20/0.37 file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mor)).
% 0.20/0.37 thf(f6,axiom,(
% 0.20/0.37 (mimplies = (^[X0 : ($i > $o), X1 : ($i > $o)] : ((mor @ (mnot @ X0) @ X1))))),
% 0.20/0.37 file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mimplies)).
% 0.20/0.37 thf(f11,axiom,(
% 0.20/0.37 (mforall_prop = (^[X0 : (($i > $o) > $i > $o), X1 : $i] : (! [X2 : ($i > $o)] : (X0 @ X2 @ X1))))),
% 0.20/0.37 file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mforall_prop)).
% 0.20/0.37 thf(f16,axiom,(
% 0.20/0.37 (mbox = (^[X0 : ($i > $i > $o), X1 : ($i > $o), X2 : $i] : (! [X3 : $i] : ((X1 @ X3) | ~(X0 @ X2 @ X3)))))),
% 0.20/0.37 file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mbox)).
% 0.20/0.37 thf(f17,axiom,(
% 0.20/0.37 (mdia = (^[X0 : ($i > $i > $o), X1 : ($i > $o)] : ((mnot @ (mbox @ X0 @ (mnot @ X1))))))),
% 0.20/0.37 file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mdia)).
% 0.20/0.37 thf(f20,axiom,(
% 0.20/0.37 (mserial = (^[X0 : ($i > $i > $o)] : (! [X1 : $i] : ? [X2 : $i] : (X0 @ X1 @ X2))))),
% 0.20/0.37 file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mserial)).
% 0.20/0.37 thf(f28,axiom,(
% 0.20/0.37 (mvalid = (^[X0 : ($i > $o)] : (! [X1 : $i] : (X0 @ X1))))),
% 0.20/0.37 file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid)).
% 0.20/0.37 thf(f32,conjecture,(
% 0.20/0.37 ! [X0 : ($i > $i > $o)] : ((mvalid @ (mforall_prop @ (^[X1 : ($i > $o)] : ((mimplies @ (mbox @ X0 @ X1) @ (mdia @ X0 @ X1)))))) => (mserial @ X0))),
% 0.20/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)).
% 0.20/0.37 thf(f33,negated_conjecture,(
% 0.20/0.37 ~ ! [X0 : ($i > $i > $o)] : ((mvalid @ (mforall_prop @ (^[X1 : ($i > $o)] : ((mimplies @ (mbox @ X0 @ X1) @ (mdia @ X0 @ X1)))))) => (mserial @ X0))),
% 0.20/0.37 inference(negated_conjecture,[status(cth)],[f32])).
% 0.20/0.37 thf(f36,plain,(
% 0.20/0.37 (mnot = (^[X0 : ($i > $o), X1 : $i] : (~(X0 @ X1))))),
% 0.20/0.37 inference(rectify,[],[f3])).
% 0.20/0.37 thf(f37,plain,(
% 0.20/0.37 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.20/0.37 inference(fool_elimination,[],[f36])).
% 0.20/0.37 thf(f38,plain,(
% 0.20/0.37 (mor = (^[X0 : ($i > $o), X1 : ($i > $o), X2 : $i] : ((X1 @ X2) | (X0 @ X2))))),
% 0.20/0.37 inference(rectify,[],[f4])).
% 0.20/0.37 thf(f39,plain,(
% 0.20/0.37 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.20/0.37 inference(fool_elimination,[],[f38])).
% 0.20/0.37 thf(f41,plain,(
% 0.20/0.37 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.20/0.37 inference(fool_elimination,[],[f6])).
% 0.20/0.37 thf(f47,plain,(
% 0.20/0.37 (mforall_prop = (^[X0 : (($i > $o) > $i > $o), X1 : $i] : (! [X2 : ($i > $o)] : (X0 @ X2 @ X1))))),
% 0.20/0.37 inference(rectify,[],[f11])).
% 0.20/0.37 thf(f48,plain,(
% 0.20/0.37 (mforall_prop = (^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))))),
% 0.20/0.37 inference(fool_elimination,[],[f47])).
% 0.20/0.37 thf(f54,plain,(
% 0.20/0.37 (mbox = (^[X0 : ($i > $i > $o), X1 : ($i > $o), X2 : $i] : (! [X3 : $i] : ((X1 @ X3) | ~(X0 @ X2 @ X3)))))),
% 0.20/0.37 inference(rectify,[],[f16])).
% 0.20/0.37 thf(f55,plain,(
% 0.20/0.37 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))))),
% 0.20/0.37 inference(fool_elimination,[],[f54])).
% 0.20/0.37 thf(f56,plain,(
% 0.20/0.37 (mdia = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mbox @ Y0 @ (mnot @ Y1)))))))),
% 0.20/0.37 inference(fool_elimination,[],[f17])).
% 0.20/0.37 thf(f61,plain,(
% 0.20/0.37 (mserial = (^[X0 : ($i > $i > $o)] : (! [X1 : $i] : ? [X2 : $i] : (X0 @ X1 @ X2))))),
% 0.20/0.37 inference(rectify,[],[f20])).
% 0.20/0.37 thf(f62,plain,(
% 0.20/0.37 (mserial = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y1 @ Y2)))))))),
% 0.20/0.37 inference(fool_elimination,[],[f61])).
% 0.20/0.37 thf(f77,plain,(
% 0.20/0.37 (mvalid = (^[X0 : ($i > $o)] : (! [X1 : $i] : (X0 @ X1))))),
% 0.20/0.37 inference(rectify,[],[f28])).
% 0.20/0.37 thf(f78,plain,(
% 0.20/0.37 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.20/0.37 inference(fool_elimination,[],[f77])).
% 0.20/0.37 thf(f85,plain,(
% 0.20/0.37 ~ ! [X0 : ($i > $i > $o)] : ((mvalid @ (mforall_prop @ (^[X1 : ($i > $o)] : ((mimplies @ (mbox @ X0 @ X1) @ (mdia @ X0 @ X1)))))) => (mserial @ X0))),
% 0.20/0.37 inference(rectify,[],[f33])).
% 0.20/0.37 thf(f86,plain,(
% 0.20/0.37 ~ ! [X0 : ($i > $i > $o)] : (($true = ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ X0 @ Y0) @ (mdia @ X0 @ Y0))))))) => (((mserial @ X0)) = $true))),
% 0.20/0.37 inference(fool_elimination,[],[f85])).
% 0.20/0.37 thf(f87,plain,(
% 0.20/0.37 ? [X0 : ($i > $i > $o)] : ((((mserial @ X0)) != $true) & ($true = ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ X0 @ Y0) @ (mdia @ X0 @ Y0))))))))),
% 0.20/0.37 inference(ennf_transformation,[],[f86])).
% 0.20/0.37 thf(f88,plain,(
% 0.20/0.37 ($true != ((mserial @ sK0))) & ($true = ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ sK0 @ Y0) @ (mdia @ sK0 @ Y0)))))))),
% 0.20/0.37 inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f87])).
% 0.20/0.37 thf(f91,plain,(
% 0.20/0.37 (mnot = (^[Y0 : $i > $o]: ((^[Y1 : $i]: (~ (Y0 @ Y1))))))),
% 0.20/0.37 inference(cnf_transformation,[],[f37])).
% 0.20/0.37 thf(f92,plain,(
% 0.20/0.37 (mor = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) | (Y1 @ Y2))))))))),
% 0.20/0.37 inference(cnf_transformation,[],[f39])).
% 0.20/0.37 thf(f94,plain,(
% 0.20/0.37 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (mor @ (mnot @ Y0) @ Y1)))))),
% 0.20/0.37 inference(cnf_transformation,[],[f41])).
% 0.20/0.37 thf(f99,plain,(
% 0.20/0.37 (mforall_prop = (^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))))),
% 0.20/0.37 inference(cnf_transformation,[],[f48])).
% 0.20/0.37 thf(f104,plain,(
% 0.20/0.37 (mbox = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (!! @ $i @ (^[Y3 : $i]: ((~ (Y0 @ Y2 @ Y3)) | (Y1 @ Y3))))))))))),
% 0.20/0.37 inference(cnf_transformation,[],[f55])).
% 0.20/0.37 thf(f105,plain,(
% 0.20/0.37 (mdia = (^[Y0 : $i > $i > $o]: ((^[Y1 : $i > $o]: (mnot @ (mbox @ Y0 @ (mnot @ Y1)))))))),
% 0.20/0.37 inference(cnf_transformation,[],[f56])).
% 0.20/0.37 thf(f108,plain,(
% 0.20/0.37 (mserial = (^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y1 @ Y2)))))))),
% 0.20/0.37 inference(cnf_transformation,[],[f62])).
% 0.20/0.37 thf(f116,plain,(
% 0.20/0.37 (mvalid = (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))))),
% 0.20/0.37 inference(cnf_transformation,[],[f78])).
% 0.20/0.37 thf(f120,plain,(
% 0.20/0.37 ($true = ((mvalid @ (mforall_prop @ (^[Y0 : $i > $o]: (mimplies @ (mbox @ sK0 @ Y0) @ (mdia @ sK0 @ Y0)))))))),
% 0.20/0.37 inference(cnf_transformation,[],[f88])).
% 0.20/0.37 thf(f121,plain,(
% 0.20/0.37 ($true != ((mserial @ sK0)))),
% 0.20/0.37 inference(cnf_transformation,[],[f88])).
% 0.20/0.37 thf(f122,definition,(
% 0.20/0.37 ($true != $false)),
% 0.20/0.37 introduced(theory,[fool_distinctness_axiom])).
% 0.20/0.37 thf(f125,plain,(
% 0.20/0.37 (mimplies = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i]: ((Y2 @ Y4) | (Y3 @ Y4))))))) @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y0) @ Y1)))))),
% 0.20/0.37 inference(definition_unfolding,[],[f94,f92,f91])).
% 0.20/0.37 thf(f132,plain,(
% 0.20/0.37 (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]: ((~ (Y2 @ Y4 @ Y5)) | (Y3 @ Y5))))))))) @ Y0 @ ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (~ (Y2 @ Y3))))) @ Y1)))))))),
% 0.20/0.37 inference(definition_unfolding,[],[f105,f91,f104,f91])).
% 0.20/0.37 thf(f133,plain,(
% 0.20/0.37 ($true != (((^[Y0 : $i > $i > $o]: (!! @ $i @ (^[Y1 : $i]: (?? @ $i @ (^[Y2 : $i]: (Y0 @ Y1 @ Y2)))))) @ sK0)))),
% 0.20/0.37 inference(definition_unfolding,[],[f121,f108])).
% 0.20/0.37 thf(f134,plain,(
% 0.20/0.37 ($true = (((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (Y0 @ Y1)))) @ ((^[Y0 : ($i > $o) > $i > $o]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (Y0 @ Y2 @ Y1)))))) @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i > $o]: ((^[Y4 : $i > $o]: ((^[Y5 : $i]: ((Y3 @ Y5) | (Y4 @ Y5))))))) @ ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ Y1) @ Y2)))) @ ((^[Y1 : $i > $i > $o]: ((^[Y2 : $i > $o]: ((^[Y3 : $i]: (!! @ $i @ (^[Y4 : $i]: ((~ (Y1 @ Y3 @ Y4)) | (Y2 @ Y4))))))))) @ sK0 @ Y0) @ ((^[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]: ((~ (Y3 @ Y5 @ Y6)) | (Y4 @ Y6))))))))) @ Y1 @ ((^[Y3 : $i > $o]: ((^[Y4 : $i]: (~ (Y3 @ Y4))))) @ Y2)))))) @ sK0 @ Y0)))))))),
% 0.20/0.37 inference(definition_unfolding,[],[f120,f116,f99,f125,f104,f132])).
% 0.20/0.37 thf(f135,plain,(
% 0.20/0.37 ($true = ((!! @ $i @ (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((~ (!! @ $i @ (^[Y2 : $i]: ((~ (sK0 @ Y0 @ Y2)) | (Y1 @ Y2))))) | (~ (!! @ $i @ (^[Y2 : $i]: ((~ (sK0 @ Y0 @ Y2)) | (~ (Y1 @ Y2)))))))))))))),
% 0.20/0.37 inference(beta-eta_normalization,[],[f134])).
% 0.20/0.37 thf(f136,plain,(
% 0.20/0.37 ( ! [X1 : $i] : (($true = (((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: ((~ (!! @ $i @ (^[Y2 : $i]: ((~ (sK0 @ Y0 @ Y2)) | (Y1 @ Y2))))) | (~ (!! @ $i @ (^[Y2 : $i]: ((~ (sK0 @ Y0 @ Y2)) | (~ (Y1 @ Y2)))))))))) @ X1)))) )),
% 0.20/0.37 inference(pi_proxy_clausification,[],[f135])).
% 0.20/0.37 thf(f137,plain,(
% 0.20/0.37 ( ! [X1 : $i] : (($true = ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((~ (!! @ $i @ (^[Y1 : $i]: ((~ (sK0 @ X1 @ Y1)) | (Y0 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ (sK0 @ X1 @ Y1)) | (~ (Y0 @ Y1)))))))))))) )),
% 0.20/0.37 inference(beta-eta_normalization,[],[f136])).
% 0.20/0.37 thf(f138,plain,(
% 0.20/0.37 ( ! [X2 : ($i > $o),X1 : $i] : (($true = (((^[Y0 : $i > $o]: ((~ (!! @ $i @ (^[Y1 : $i]: ((~ (sK0 @ X1 @ Y1)) | (Y0 @ Y1))))) | (~ (!! @ $i @ (^[Y1 : $i]: ((~ (sK0 @ X1 @ Y1)) | (~ (Y0 @ Y1)))))))) @ X2)))) )),
% 0.20/0.37 inference(pi_proxy_clausification,[],[f137])).
% 0.20/0.37 thf(f139,plain,(
% 0.20/0.37 ( ! [X2 : ($i > $o),X1 : $i] : (($true = (((~ (!! @ $i @ (^[Y0 : $i]: ((~ (sK0 @ X1 @ Y0)) | (X2 @ Y0))))) | (~ (!! @ $i @ (^[Y0 : $i]: ((~ (sK0 @ X1 @ Y0)) | (~ (X2 @ Y0)))))))))) )),
% 0.20/0.37 inference(beta-eta_normalization,[],[f138])).
% 0.20/0.37 thf(f140,plain,(
% 0.20/0.37 ( ! [X2 : ($i > $o),X1 : $i] : (($true = ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (sK0 @ X1 @ Y0)) | (~ (X2 @ Y0)))))))) | ($true = ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (sK0 @ X1 @ Y0)) | (X2 @ Y0)))))))) )),
% 0.20/0.37 inference(or_proxy_clausification,[],[f139])).
% 0.20/0.37 thf(f141,plain,(
% 0.20/0.37 ( ! [X2 : ($i > $o),X1 : $i] : (($false = ((!! @ $i @ (^[Y0 : $i]: ((~ (sK0 @ X1 @ Y0)) | (~ (X2 @ Y0))))))) | ($true = ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (sK0 @ X1 @ Y0)) | (X2 @ Y0)))))))) )),
% 0.20/0.37 inference(not_proxy_clausification,[],[f140])).
% 0.20/0.37 thf(f142,plain,(
% 0.20/0.37 ( ! [X2 : ($i > $o),X1 : $i] : (($false = (((^[Y0 : $i]: ((~ (sK0 @ X1 @ Y0)) | (~ (X2 @ Y0)))) @ (sK1 @ X1 @ X2)))) | ($true = ((~ (!! @ $i @ (^[Y0 : $i]: ((~ (sK0 @ X1 @ Y0)) | (X2 @ Y0)))))))) )),
% 0.20/0.37 inference(sigma_proxy_clausification,[],[f141])).
% 0.20/0.37 thf(f143,plain,(
% 0.20/0.37 ( ! [X2 : ($i > $o),X1 : $i] : (($false = (((^[Y0 : $i]: ((~ (sK0 @ X1 @ Y0)) | (~ (X2 @ Y0)))) @ (sK1 @ X1 @ X2)))) | ($false = ((!! @ $i @ (^[Y0 : $i]: ((~ (sK0 @ X1 @ Y0)) | (X2 @ Y0))))))) )),
% 0.20/0.37 inference(not_proxy_clausification,[],[f142])).
% 0.20/0.37 thf(f144,plain,(
% 0.20/0.37 ( ! [X2 : ($i > $o),X1 : $i] : (($false = (((^[Y0 : $i]: ((~ (sK0 @ X1 @ Y0)) | (~ (X2 @ Y0)))) @ (sK1 @ X1 @ X2)))) | ($false = (((^[Y0 : $i]: ((~ (sK0 @ X1 @ Y0)) | (X2 @ Y0))) @ (sK2 @ X1 @ X2))))) )),
% 0.20/0.37 inference(sigma_proxy_clausification,[],[f143])).
% 0.20/0.37 thf(f145,plain,(
% 0.20/0.37 ( ! [X2 : ($i > $o),X1 : $i] : (($false = (((~ (sK0 @ X1 @ (sK1 @ X1 @ X2))) | (~ (X2 @ (sK1 @ X1 @ X2)))))) | ($false = (((~ (sK0 @ X1 @ (sK2 @ X1 @ X2))) | (X2 @ (sK2 @ X1 @ X2)))))) )),
% 0.20/0.37 inference(beta-eta_normalization,[],[f144])).
% 0.20/0.37 thf(f147,plain,(
% 0.20/0.37 ( ! [X2 : ($i > $o),X1 : $i] : (($false = ((~ (sK0 @ X1 @ (sK1 @ X1 @ X2))))) | ($false = (((~ (sK0 @ X1 @ (sK2 @ X1 @ X2))) | (X2 @ (sK2 @ X1 @ X2)))))) )),
% 0.20/0.37 inference(or_proxy_clausification,[],[f145])).
% 0.20/0.37 thf(f148,plain,(
% 0.20/0.37 ( ! [X2 : ($i > $o),X1 : $i] : (($true = ((sK0 @ X1 @ (sK1 @ X1 @ X2)))) | ($false = (((~ (sK0 @ X1 @ (sK2 @ X1 @ X2))) | (X2 @ (sK2 @ X1 @ X2)))))) )),
% 0.20/0.37 inference(not_proxy_clausification,[],[f147])).
% 0.20/0.37 thf(f149,plain,(
% 0.20/0.37 ( ! [X2 : ($i > $o),X1 : $i] : (($true = ((sK0 @ X1 @ (sK1 @ X1 @ X2)))) | ($false = ((X2 @ (sK2 @ X1 @ X2))))) )),
% 0.20/0.37 inference(or_proxy_clausification,[],[f148])).
% 0.20/0.37 thf(f156,plain,(
% 0.20/0.37 ($true != ((!! @ $i @ (^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0))))))),
% 0.20/0.37 inference(beta-eta_normalization,[],[f133])).
% 0.20/0.37 thf(f157,plain,(
% 0.20/0.37 ($false = (((^[Y0 : $i]: (?? @ $i @ (sK0 @ Y0))) @ sK3)))),
% 0.20/0.37 inference(sigma_proxy_clausification,[],[f156])).
% 0.20/0.37 thf(f158,plain,(
% 0.20/0.37 ($false = ((?? @ $i @ (sK0 @ sK3))))),
% 0.20/0.37 inference(beta-eta_normalization,[],[f157])).
% 0.20/0.37 thf(f159,plain,(
% 0.20/0.37 ( ! [X1 : $i] : (($false = ((sK0 @ sK3 @ X1)))) )),
% 0.20/0.37 inference(pi_proxy_clausification,[],[f158])).
% 0.20/0.37 thf(f221,plain,(
% 0.20/0.37 ( ! [X0 : ($i > $o)] : (($true = $false) | ($false = ((X0 @ (sK2 @ sK3 @ X0))))) )),
% 0.20/0.37 inference(constrained_superposition,[],[f159,f149])).
% 0.20/0.37 thf(f240,plain,(
% 0.20/0.37 ( ! [X0 : ($i > $o)] : (($false = ((X0 @ (sK2 @ sK3 @ X0))))) )),
% 0.20/0.37 inference(trivial_inequality_removal,[],[f221])).
% 0.20/0.37 thf(f264,plain,(
% 0.20/0.37 ($false != $false)),
% 0.20/0.37 inference(constrained_superposition,[],[f122,f240])).
% 0.20/0.37 thf(f265,plain,(
% 0.20/0.37 $false),
% 0.20/0.37 inference(trivial_inequality_removal,[],[f264])).
% 0.20/0.37 % SZS output end Proof for theBenchmark
% 0.20/0.37 % (2936998)------------------------------
% 0.20/0.37 % (2936998)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.37 % (2936998)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.37 % (2936998)CaDiCaL version: 2.1.3
% 0.20/0.37 % (2936998)Termination reason: Refutation
% 0.20/0.37 % (2936998)Time elapsed: 0.022 s
% 0.20/0.37 % (2936998)Peak memory usage: 12 MB
% 0.20/0.37 % (2936998)Instructions burned: 22 (million)
% 0.20/0.37 % (2936989)Success in time 0.114 s
% 0.20/0.37 % Vampire exiting
%------------------------------------------------------------------------------