TSTP Solution File: LAT388+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT388+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n029.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 : Wed Jul 27 13:03:14 EDT 2022
% Result : Theorem 1.95s 2.13s
% Output : Refutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 2
% Syntax : Number of clauses : 3 ( 3 unt; 0 nHn; 3 RR)
% Number of literals : 3 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 1 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(52,axiom,
~ aSupremumOfIn0(A,xT,xS),
file('LAT388+1.p',unknown),
[] ).
cnf(76,axiom,
aSupremumOfIn0(xp,xT,xS),
file('LAT388+1.p',unknown),
[] ).
cnf(77,plain,
$false,
inference(binary,[status(thm)],[76,52]),
[iquote('binary,76.1,52.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT388+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 08:20:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.95/2.13 ----- Otter 3.3f, August 2004 -----
% 1.95/2.13 The process was started by sandbox2 on n029.cluster.edu,
% 1.95/2.13 Wed Jul 27 08:20:44 2022
% 1.95/2.13 The command was "./otter". The process ID is 17490.
% 1.95/2.13
% 1.95/2.13 set(prolog_style_variables).
% 1.95/2.13 set(auto).
% 1.95/2.13 dependent: set(auto1).
% 1.95/2.13 dependent: set(process_input).
% 1.95/2.13 dependent: clear(print_kept).
% 1.95/2.13 dependent: clear(print_new_demod).
% 1.95/2.13 dependent: clear(print_back_demod).
% 1.95/2.13 dependent: clear(print_back_sub).
% 1.95/2.13 dependent: set(control_memory).
% 1.95/2.13 dependent: assign(max_mem, 12000).
% 1.95/2.13 dependent: assign(pick_given_ratio, 4).
% 1.95/2.13 dependent: assign(stats_level, 1).
% 1.95/2.13 dependent: assign(max_seconds, 10800).
% 1.95/2.13 clear(print_given).
% 1.95/2.13
% 1.95/2.13 formula_list(usable).
% 1.95/2.13 all A (A=A).
% 1.95/2.13 all W0 (aSet0(W0)->$T).
% 1.95/2.13 all W0 (aElement0(W0)->$T).
% 1.95/2.13 all W0 (aSet0(W0)-> (all W1 (aElementOf0(W1,W0)->aElement0(W1)))).
% 1.95/2.13 all W0 (aSet0(W0)-> (isEmpty0(W0)<-> -(exists W1 aElementOf0(W1,W0)))).
% 1.95/2.13 all W0 (aSet0(W0)-> (all W1 (aSubsetOf0(W1,W0)<->aSet0(W1)& (all W2 (aElementOf0(W2,W1)->aElementOf0(W2,W0)))))).
% 1.95/2.13 all W0 W1 (aElement0(W0)&aElement0(W1)-> (sdtlse_qdt0(W0,W1)->$T)).
% 1.95/2.13 all W0 (aElement0(W0)->sdtlse_qdt0(W0,W0)).
% 1.95/2.13 all W0 W1 (aElement0(W0)&aElement0(W1)-> (sdtlse_qdt0(W0,W1)&sdtlse_qdt0(W1,W0)->W0=W1)).
% 1.95/2.13 all W0 W1 W2 (aElement0(W0)&aElement0(W1)&aElement0(W2)-> (sdtlse_qdt0(W0,W1)&sdtlse_qdt0(W1,W2)->sdtlse_qdt0(W0,W2))).
% 1.95/2.13 all W0 (aSet0(W0)-> (all W1 (aSubsetOf0(W1,W0)-> (all W2 (aLowerBoundOfIn0(W2,W1,W0)<->aElementOf0(W2,W0)& (all W3 (aElementOf0(W3,W1)->sdtlse_qdt0(W2,W3)))))))).
% 1.95/2.13 all W0 (aSet0(W0)-> (all W1 (aSubsetOf0(W1,W0)-> (all W2 (aUpperBoundOfIn0(W2,W1,W0)<->aElementOf0(W2,W0)& (all W3 (aElementOf0(W3,W1)->sdtlse_qdt0(W3,W2)))))))).
% 1.95/2.13 all W0 (aSet0(W0)-> (all W1 (aSubsetOf0(W1,W0)-> (all W2 (aInfimumOfIn0(W2,W1,W0)<->aElementOf0(W2,W0)&aLowerBoundOfIn0(W2,W1,W0)& (all W3 (aLowerBoundOfIn0(W3,W1,W0)->sdtlse_qdt0(W3,W2)))))))).
% 1.95/2.13 all W0 (aSet0(W0)-> (all W1 (aSubsetOf0(W1,W0)-> (all W2 (aSupremumOfIn0(W2,W1,W0)<->aElementOf0(W2,W0)&aUpperBoundOfIn0(W2,W1,W0)& (all W3 (aUpperBoundOfIn0(W3,W1,W0)->sdtlse_qdt0(W2,W3)))))))).
% 1.95/2.13 all W0 (aSet0(W0)-> (all W1 (aSubsetOf0(W1,W0)-> (all W2 W3 (aSupremumOfIn0(W2,W1,W0)&aSupremumOfIn0(W3,W1,W0)->W2=W3))))).
% 1.95/2.13 all W0 (aSet0(W0)-> (all W1 (aSubsetOf0(W1,W0)-> (all W2 W3 (aInfimumOfIn0(W2,W1,W0)&aInfimumOfIn0(W3,W1,W0)->W2=W3))))).
% 1.95/2.13 all W0 (aCompleteLattice0(W0)<->aSet0(W0)& (all W1 (aSubsetOf0(W1,W0)-> (exists W2 (aInfimumOfIn0(W2,W1,W0)& (exists W3 aSupremumOfIn0(W3,W1,W0))))))).
% 1.95/2.13 all W0 (aFunction0(W0)->$T).
% 1.95/2.13 all W0 (aFunction0(W0)->aSet0(szDzozmdt0(W0))).
% 1.95/2.13 all W0 (aFunction0(W0)->aSet0(szRzazndt0(W0))).
% 1.95/2.13 all W0 W1 (aFunction0(W0)&aSet0(W1)-> (isOn0(W0,W1)<->szDzozmdt0(W0)=szRzazndt0(W0)&szRzazndt0(W0)=W1)).
% 1.95/2.13 all W0 (aFunction0(W0)-> (all W1 (aElementOf0(W1,szDzozmdt0(W0))->aElementOf0(sdtlpdtrp0(W0,W1),szRzazndt0(W0))))).
% 1.95/2.13 all W0 (aFunction0(W0)-> (all W1 (aFixedPointOf0(W1,W0)<->aElementOf0(W1,szDzozmdt0(W0))&sdtlpdtrp0(W0,W1)=W1))).
% 1.95/2.13 all W0 (aFunction0(W0)-> (isMonotone0(W0)<-> (all W1 W2 (aElementOf0(W1,szDzozmdt0(W0))&aElementOf0(W2,szDzozmdt0(W0))-> (sdtlse_qdt0(W1,W2)->sdtlse_qdt0(sdtlpdtrp0(W0,W1),sdtlpdtrp0(W0,W2))))))).
% 1.95/2.13 aCompleteLattice0(xU).
% 1.95/2.13 aFunction0(xf).
% 1.95/2.13 isMonotone0(xf).
% 1.95/2.13 isOn0(xf,xU).
% 1.95/2.13 xS=cS1142(xf).
% 1.95/2.13 aSubsetOf0(xT,xS).
% 1.95/2.13 xP=cS1241(xU,xf,xT).
% 1.95/2.13 aInfimumOfIn0(xp,xP,xU).
% 1.95/2.13 aLowerBoundOfIn0(sdtlpdtrp0(xf,xp),xP,xU).
% 1.95/2.13 aUpperBoundOfIn0(sdtlpdtrp0(xf,xp),xT,xU).
% 1.95/2.13 aFixedPointOf0(xp,xf).
% 1.95/2.13 aSupremumOfIn0(xp,xT,xS).
% 1.95/2.13 -(exists W0 aSupremumOfIn0(W0,xT,xS)).
% 1.95/2.13 end_of_list.
% 1.95/2.13
% 1.95/2.13 -------> usable clausifies to:
% 1.95/2.13
% 1.95/2.13 list(usable).
% 1.95/2.13 0 [] A=A.
% 1.95/2.13 0 [] -aSet0(W0)|$T.
% 1.95/2.13 0 [] -aElement0(W0)|$T.
% 1.95/2.13 0 [] -aSet0(W0)| -aElementOf0(W1,W0)|aElement0(W1).
% 1.95/2.13 0 [] -aSet0(W0)| -isEmpty0(W0)| -aElementOf0(W1,W0).
% 1.95/2.13 0 [] -aSet0(W0)|isEmpty0(W0)|aElementOf0($f1(W0),W0).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)|aSet0(W1).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)| -aElementOf0(W2,W1)|aElementOf0(W2,W0).
% 1.95/2.13 0 [] -aSet0(W0)|aSubsetOf0(W1,W0)| -aSet0(W1)|aElementOf0($f2(W0,W1),W1).
% 1.95/2.13 0 [] -aSet0(W0)|aSubsetOf0(W1,W0)| -aSet0(W1)| -aElementOf0($f2(W0,W1),W0).
% 1.95/2.13 0 [] -aElement0(W0)| -aElement0(W1)| -sdtlse_qdt0(W0,W1)|$T.
% 1.95/2.13 0 [] -aElement0(W0)|sdtlse_qdt0(W0,W0).
% 1.95/2.13 0 [] -aElement0(W0)| -aElement0(W1)| -sdtlse_qdt0(W0,W1)| -sdtlse_qdt0(W1,W0)|W0=W1.
% 1.95/2.13 0 [] -aElement0(W0)| -aElement0(W1)| -aElement0(W2)| -sdtlse_qdt0(W0,W1)| -sdtlse_qdt0(W1,W2)|sdtlse_qdt0(W0,W2).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)| -aLowerBoundOfIn0(W2,W1,W0)|aElementOf0(W2,W0).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)| -aLowerBoundOfIn0(W2,W1,W0)| -aElementOf0(W3,W1)|sdtlse_qdt0(W2,W3).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)|aLowerBoundOfIn0(W2,W1,W0)| -aElementOf0(W2,W0)|aElementOf0($f3(W0,W1,W2),W1).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)|aLowerBoundOfIn0(W2,W1,W0)| -aElementOf0(W2,W0)| -sdtlse_qdt0(W2,$f3(W0,W1,W2)).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)| -aUpperBoundOfIn0(W2,W1,W0)|aElementOf0(W2,W0).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)| -aUpperBoundOfIn0(W2,W1,W0)| -aElementOf0(W3,W1)|sdtlse_qdt0(W3,W2).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)|aUpperBoundOfIn0(W2,W1,W0)| -aElementOf0(W2,W0)|aElementOf0($f4(W0,W1,W2),W1).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)|aUpperBoundOfIn0(W2,W1,W0)| -aElementOf0(W2,W0)| -sdtlse_qdt0($f4(W0,W1,W2),W2).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)| -aInfimumOfIn0(W2,W1,W0)|aElementOf0(W2,W0).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)| -aInfimumOfIn0(W2,W1,W0)|aLowerBoundOfIn0(W2,W1,W0).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)| -aInfimumOfIn0(W2,W1,W0)| -aLowerBoundOfIn0(W3,W1,W0)|sdtlse_qdt0(W3,W2).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)|aInfimumOfIn0(W2,W1,W0)| -aElementOf0(W2,W0)| -aLowerBoundOfIn0(W2,W1,W0)|aLowerBoundOfIn0($f5(W0,W1,W2),W1,W0).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)|aInfimumOfIn0(W2,W1,W0)| -aElementOf0(W2,W0)| -aLowerBoundOfIn0(W2,W1,W0)| -sdtlse_qdt0($f5(W0,W1,W2),W2).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)| -aSupremumOfIn0(W2,W1,W0)|aElementOf0(W2,W0).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)| -aSupremumOfIn0(W2,W1,W0)|aUpperBoundOfIn0(W2,W1,W0).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)| -aSupremumOfIn0(W2,W1,W0)| -aUpperBoundOfIn0(W3,W1,W0)|sdtlse_qdt0(W2,W3).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)|aSupremumOfIn0(W2,W1,W0)| -aElementOf0(W2,W0)| -aUpperBoundOfIn0(W2,W1,W0)|aUpperBoundOfIn0($f6(W0,W1,W2),W1,W0).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)|aSupremumOfIn0(W2,W1,W0)| -aElementOf0(W2,W0)| -aUpperBoundOfIn0(W2,W1,W0)| -sdtlse_qdt0(W2,$f6(W0,W1,W2)).
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)| -aSupremumOfIn0(W2,W1,W0)| -aSupremumOfIn0(W3,W1,W0)|W2=W3.
% 1.95/2.13 0 [] -aSet0(W0)| -aSubsetOf0(W1,W0)| -aInfimumOfIn0(W2,W1,W0)| -aInfimumOfIn0(W3,W1,W0)|W2=W3.
% 1.95/2.13 0 [] -aCompleteLattice0(W0)|aSet0(W0).
% 1.95/2.13 0 [] -aCompleteLattice0(W0)| -aSubsetOf0(W1,W0)|aInfimumOfIn0($f8(W0,W1),W1,W0).
% 1.95/2.13 0 [] -aCompleteLattice0(W0)| -aSubsetOf0(W1,W0)|aSupremumOfIn0($f7(W0,W1),W1,W0).
% 1.95/2.13 0 [] aCompleteLattice0(W0)| -aSet0(W0)|aSubsetOf0($f9(W0),W0).
% 1.95/2.13 0 [] aCompleteLattice0(W0)| -aSet0(W0)| -aInfimumOfIn0(W2,$f9(W0),W0)| -aSupremumOfIn0(W3,$f9(W0),W0).
% 1.95/2.13 0 [] -aFunction0(W0)|$T.
% 1.95/2.13 0 [] -aFunction0(W0)|aSet0(szDzozmdt0(W0)).
% 1.95/2.13 0 [] -aFunction0(W0)|aSet0(szRzazndt0(W0)).
% 1.95/2.13 0 [] -aFunction0(W0)| -aSet0(W1)| -isOn0(W0,W1)|szDzozmdt0(W0)=szRzazndt0(W0).
% 1.95/2.13 0 [] -aFunction0(W0)| -aSet0(W1)| -isOn0(W0,W1)|szRzazndt0(W0)=W1.
% 1.95/2.13 0 [] -aFunction0(W0)| -aSet0(W1)|isOn0(W0,W1)|szDzozmdt0(W0)!=szRzazndt0(W0)|szRzazndt0(W0)!=W1.
% 1.95/2.13 0 [] -aFunction0(W0)| -aElementOf0(W1,szDzozmdt0(W0))|aElementOf0(sdtlpdtrp0(W0,W1),szRzazndt0(W0)).
% 1.95/2.13 0 [] -aFunction0(W0)| -aFixedPointOf0(W1,W0)|aElementOf0(W1,szDzozmdt0(W0)).
% 1.95/2.13 0 [] -aFunction0(W0)| -aFixedPointOf0(W1,W0)|sdtlpdtrp0(W0,W1)=W1.
% 1.95/2.13 0 [] -aFunction0(W0)|aFixedPointOf0(W1,W0)| -aElementOf0(W1,szDzozmdt0(W0))|sdtlpdtrp0(W0,W1)!=W1.
% 1.95/2.13 0 [] -aFunction0(W0)| -isMonotone0(W0)| -aElementOf0(W1,szDzozmdt0(W0))| -aElementOf0(W2,szDzozmdt0(W0))| -sdtlse_qdt0(W1,W2)|sdtlse_qdt0(sdtlpdtrp0(W0,W1),sdtlpdtrp0(W0,W2)).
% 1.95/2.13 0 [] -aFunction0(W0)|isMonotone0(W0)|aElementOf0($f11(W0),szDzozmdt0(W0)).
% 1.95/2.13 0 [] -aFunction0(W0)|isMonotone0(W0)|aElementOf0($f10(W0),szDzozmdt0(W0)).
% 1.95/2.13 0 [] -aFunction0(W0)|isMonotone0(W0)|sdtlse_qdt0($f11(W0),$f10(W0)).
% 1.95/2.13 0 [] -aFunction0(W0)|isMonotone0(W0)| -sdtlse_qdt0(sdtlpdtrp0(W0,$f11(W0)),sdtlpdtrp0(W0,$f10(W0))).
% 1.95/2.13 0 [] aCompleteLattice0(xU).
% 1.95/2.13 0 [] aFunction0(xf).
% 1.95/2.13 0 [] isMonotone0(xf).
% 1.95/2.13 0 [] isOn0(xf,xU).
% 1.95/2.13 0 [] xS=cS1142(xf).
% 1.95/2.13 0 [] aSubsetOf0(xT,xS).
% 1.95/2.13 0 [] xP=cS1241(xU,xf,xT).
% 1.95/2.13 0 [] aInfimumOfIn0(xp,xP,xU).
% 1.95/2.13 0 [] aLowerBoundOfIn0(sdtlpdtrp0(xf,xp),xP,xU).
% 1.95/2.13 0 [] aUpperBoundOfIn0(sdtlpdtrp0(xf,xp),xT,xU).
% 1.95/2.13 0 [] aFixedPointOf0(xp,xf).
% 1.95/2.13 0 [] aSupremumOfIn0(xp,xT,xS).
% 1.95/2.13 0 [] -aSupremumOfIn0(W0,xT,xS).
% 1.95/2.13 end_of_list.
% 1.95/2.13
% 1.95/2.13 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.95/2.13
% 1.95/2.13 This ia a non-Horn set with equality. The strategy will be
% 1.95/2.13 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.95/2.13 deletion, with positive clauses in sos and nonpositive
% 1.95/2.13 clauses in usable.
% 1.95/2.13
% 1.95/2.13 dependent: set(knuth_bendix).
% 1.95/2.13 dependent: set(anl_eq).
% 1.95/2.13 dependent: set(para_from).
% 1.95/2.13 dependent: set(para_into).
% 1.95/2.13 dependent: clear(para_from_right).
% 1.95/2.13 dependent: clear(para_into_right).
% 1.95/2.13 dependent: set(para_from_vars).
% 1.95/2.13 dependent: set(eq_units_both_ways).
% 1.95/2.13 dependent: set(dynamic_demod_all).
% 1.95/2.13 dependent: set(dynamic_demod).
% 1.95/2.13 dependent: set(order_eq).
% 1.95/2.13 dependent: set(back_demod).
% 1.95/2.13 dependent: set(lrpo).
% 1.95/2.13 dependent: set(hyper_res).
% 1.95/2.13 dependent: set(unit_deletion).
% 1.95/2.13 dependent: set(factor).
% 1.95/2.13
% 1.95/2.13 ------------> process usable:
% 1.95/2.13 ** KEPT (pick-wt=7): 1 [] -aSet0(A)| -aElementOf0(B,A)|aElement0(B).
% 1.95/2.13 ** KEPT (pick-wt=7): 2 [] -aSet0(A)| -isEmpty0(A)| -aElementOf0(B,A).
% 1.95/2.13 ** KEPT (pick-wt=8): 3 [] -aSet0(A)|isEmpty0(A)|aElementOf0($f1(A),A).
% 1.95/2.13 ** KEPT (pick-wt=7): 4 [] -aSet0(A)| -aSubsetOf0(B,A)|aSet0(B).
% 1.95/2.13 ** KEPT (pick-wt=11): 5 [] -aSet0(A)| -aSubsetOf0(B,A)| -aElementOf0(C,B)|aElementOf0(C,A).
% 1.95/2.13 ** KEPT (pick-wt=12): 6 [] -aSet0(A)|aSubsetOf0(B,A)| -aSet0(B)|aElementOf0($f2(A,B),B).
% 1.95/2.13 ** KEPT (pick-wt=12): 7 [] -aSet0(A)|aSubsetOf0(B,A)| -aSet0(B)| -aElementOf0($f2(A,B),A).
% 1.95/2.13 ** KEPT (pick-wt=5): 8 [] -aElement0(A)|sdtlse_qdt0(A,A).
% 1.95/2.13 ** KEPT (pick-wt=13): 9 [] -aElement0(A)| -aElement0(B)| -sdtlse_qdt0(A,B)| -sdtlse_qdt0(B,A)|A=B.
% 1.95/2.13 ** KEPT (pick-wt=15): 10 [] -aElement0(A)| -aElement0(B)| -aElement0(C)| -sdtlse_qdt0(A,B)| -sdtlse_qdt0(B,C)|sdtlse_qdt0(A,C).
% 1.95/2.13 ** KEPT (pick-wt=12): 11 [] -aSet0(A)| -aSubsetOf0(B,A)| -aLowerBoundOfIn0(C,B,A)|aElementOf0(C,A).
% 1.95/2.13 ** KEPT (pick-wt=15): 12 [] -aSet0(A)| -aSubsetOf0(B,A)| -aLowerBoundOfIn0(C,B,A)| -aElementOf0(D,B)|sdtlse_qdt0(C,D).
% 1.95/2.13 ** KEPT (pick-wt=18): 13 [] -aSet0(A)| -aSubsetOf0(B,A)|aLowerBoundOfIn0(C,B,A)| -aElementOf0(C,A)|aElementOf0($f3(A,B,C),B).
% 1.95/2.13 ** KEPT (pick-wt=18): 14 [] -aSet0(A)| -aSubsetOf0(B,A)|aLowerBoundOfIn0(C,B,A)| -aElementOf0(C,A)| -sdtlse_qdt0(C,$f3(A,B,C)).
% 1.95/2.13 ** KEPT (pick-wt=12): 15 [] -aSet0(A)| -aSubsetOf0(B,A)| -aUpperBoundOfIn0(C,B,A)|aElementOf0(C,A).
% 1.95/2.13 ** KEPT (pick-wt=15): 16 [] -aSet0(A)| -aSubsetOf0(B,A)| -aUpperBoundOfIn0(C,B,A)| -aElementOf0(D,B)|sdtlse_qdt0(D,C).
% 1.95/2.13 ** KEPT (pick-wt=18): 17 [] -aSet0(A)| -aSubsetOf0(B,A)|aUpperBoundOfIn0(C,B,A)| -aElementOf0(C,A)|aElementOf0($f4(A,B,C),B).
% 1.95/2.13 ** KEPT (pick-wt=18): 18 [] -aSet0(A)| -aSubsetOf0(B,A)|aUpperBoundOfIn0(C,B,A)| -aElementOf0(C,A)| -sdtlse_qdt0($f4(A,B,C),C).
% 1.95/2.13 ** KEPT (pick-wt=12): 19 [] -aSet0(A)| -aSubsetOf0(B,A)| -aInfimumOfIn0(C,B,A)|aElementOf0(C,A).
% 1.95/2.13 ** KEPT (pick-wt=13): 20 [] -aSet0(A)| -aSubsetOf0(B,A)| -aInfimumOfIn0(C,B,A)|aLowerBoundOfIn0(C,B,A).
% 1.95/2.13 ** KEPT (pick-wt=16): 21 [] -aSet0(A)| -aSubsetOf0(B,A)| -aInfimumOfIn0(C,B,A)| -aLowerBoundOfIn0(D,B,A)|sdtlse_qdt0(D,C).
% 1.95/2.13 ** KEPT (pick-wt=23): 22 [] -aSet0(A)| -aSubsetOf0(B,A)|aInfimumOfIn0(C,B,A)| -aElementOf0(C,A)| -aLowerBoundOfIn0(C,B,A)|aLowerBoundOfIn0($f5(A,B,C),B,A).
% 1.95/2.13 ** KEPT (pick-wt=22): 23 [] -aSet0(A)| -aSubsetOf0(B,A)|aInfimumOfIn0(C,B,A)| -aElementOf0(C,A)| -aLowerBoundOfIn0(C,B,A)| -sdtlse_qdt0($f5(A,B,C),C).
% 1.95/2.13 ** KEPT (pick-wt=12): 24 [] -aSet0(A)| -aSubsetOf0(B,A)| -aSupremumOfIn0(C,B,A)|aElementOf0(C,A).
% 1.95/2.13 ** KEPT (pick-wt=13): 25 [] -aSet0(A)| -aSubsetOf0(B,A)| -aSupremumOfIn0(C,B,A)|aUpperBoundOfIn0(C,B,A).
% 1.95/2.13 ** KEPT (pick-wt=16): 26 [] -aSet0(A)| -aSubsetOf0(B,A)| -aSupremumOfIn0(C,B,A)| -aUpperBoundOfIn0(D,B,A)|sdtlse_qdt0(C,D).
% 1.95/2.13 ** KEPT (pick-wt=23): 27 [] -aSet0(A)| -aSubsetOf0(B,A)|aSupremumOfIn0(C,B,A)| -aElementOf0(C,A)| -aUpperBoundOfIn0(C,B,A)|aUpperBoundOfIn0($f6(A,B,C),B,A).
% 1.95/2.13 ** KEPT (pick-wt=22): 28 [] -aSet0(A)| -aSubsetOf0(B,A)|aSupremumOfIn0(C,B,A)| -aElementOf0(C,A)| -aUpperBoundOfIn0(C,B,A)| -sdtlse_qdt0(C,$f6(A,B,C)).
% 1.95/2.13 ** KEPT (pick-wt=16): 29 [] -aSet0(A)| -aSubsetOf0(B,
% 1.95/2.13 -------- PROOF --------
% 1.95/2.13 A)| -aSupremumOfIn0(C,B,A)| -aSupremumOfIn0(D,B,A)|C=D.
% 1.95/2.13 ** KEPT (pick-wt=16): 30 [] -aSet0(A)| -aSubsetOf0(B,A)| -aInfimumOfIn0(C,B,A)| -aInfimumOfIn0(D,B,A)|C=D.
% 1.95/2.13 ** KEPT (pick-wt=4): 31 [] -aCompleteLattice0(A)|aSet0(A).
% 1.95/2.13 ** KEPT (pick-wt=11): 32 [] -aCompleteLattice0(A)| -aSubsetOf0(B,A)|aInfimumOfIn0($f8(A,B),B,A).
% 1.95/2.13 ** KEPT (pick-wt=11): 33 [] -aCompleteLattice0(A)| -aSubsetOf0(B,A)|aSupremumOfIn0($f7(A,B),B,A).
% 1.95/2.13 ** KEPT (pick-wt=8): 34 [] aCompleteLattice0(A)| -aSet0(A)|aSubsetOf0($f9(A),A).
% 1.95/2.13 ** KEPT (pick-wt=14): 35 [] aCompleteLattice0(A)| -aSet0(A)| -aInfimumOfIn0(B,$f9(A),A)| -aSupremumOfIn0(C,$f9(A),A).
% 1.95/2.13 ** KEPT (pick-wt=5): 36 [] -aFunction0(A)|aSet0(szDzozmdt0(A)).
% 1.95/2.13 ** KEPT (pick-wt=5): 37 [] -aFunction0(A)|aSet0(szRzazndt0(A)).
% 1.95/2.13 ** KEPT (pick-wt=12): 39 [copy,38,flip.4] -aFunction0(A)| -aSet0(B)| -isOn0(A,B)|szRzazndt0(A)=szDzozmdt0(A).
% 1.95/2.13 ** KEPT (pick-wt=11): 40 [] -aFunction0(A)| -aSet0(B)| -isOn0(A,B)|szRzazndt0(A)=B.
% 1.95/2.13 ** KEPT (pick-wt=16): 42 [copy,41,flip.4] -aFunction0(A)| -aSet0(B)|isOn0(A,B)|szRzazndt0(A)!=szDzozmdt0(A)|szRzazndt0(A)!=B.
% 1.95/2.13 ** KEPT (pick-wt=12): 43 [] -aFunction0(A)| -aElementOf0(B,szDzozmdt0(A))|aElementOf0(sdtlpdtrp0(A,B),szRzazndt0(A)).
% 1.95/2.13 ** KEPT (pick-wt=9): 44 [] -aFunction0(A)| -aFixedPointOf0(B,A)|aElementOf0(B,szDzozmdt0(A)).
% 1.95/2.13 ** KEPT (pick-wt=10): 45 [] -aFunction0(A)| -aFixedPointOf0(B,A)|sdtlpdtrp0(A,B)=B.
% 1.95/2.13 ** KEPT (pick-wt=14): 46 [] -aFunction0(A)|aFixedPointOf0(B,A)| -aElementOf0(B,szDzozmdt0(A))|sdtlpdtrp0(A,B)!=B.
% 1.95/2.13 ** KEPT (pick-wt=22): 47 [] -aFunction0(A)| -isMonotone0(A)| -aElementOf0(B,szDzozmdt0(A))| -aElementOf0(C,szDzozmdt0(A))| -sdtlse_qdt0(B,C)|sdtlse_qdt0(sdtlpdtrp0(A,B),sdtlpdtrp0(A,C)).
% 1.95/2.13 ** KEPT (pick-wt=9): 48 [] -aFunction0(A)|isMonotone0(A)|aElementOf0($f11(A),szDzozmdt0(A)).
% 1.95/2.13 ** KEPT (pick-wt=9): 49 [] -aFunction0(A)|isMonotone0(A)|aElementOf0($f10(A),szDzozmdt0(A)).
% 1.95/2.13 ** KEPT (pick-wt=9): 50 [] -aFunction0(A)|isMonotone0(A)|sdtlse_qdt0($f11(A),$f10(A)).
% 1.95/2.13 ** KEPT (pick-wt=13): 51 [] -aFunction0(A)|isMonotone0(A)| -sdtlse_qdt0(sdtlpdtrp0(A,$f11(A)),sdtlpdtrp0(A,$f10(A))).
% 1.95/2.13 ** KEPT (pick-wt=4): 52 [] -aSupremumOfIn0(A,xT,xS).
% 1.95/2.13
% 1.95/2.13 ------------> process sos:
% 1.95/2.13 ** KEPT (pick-wt=3): 60 [] A=A.
% 1.95/2.13 ** KEPT (pick-wt=2): 61 [] aCompleteLattice0(xU).
% 1.95/2.13 ** KEPT (pick-wt=2): 62 [] aFunction0(xf).
% 1.95/2.13 ** KEPT (pick-wt=2): 63 [] isMonotone0(xf).
% 1.95/2.13 ** KEPT (pick-wt=3): 64 [] isOn0(xf,xU).
% 1.95/2.13 ** KEPT (pick-wt=4): 66 [copy,65,flip.1] cS1142(xf)=xS.
% 1.95/2.13 ---> New Demodulator: 67 [new_demod,66] cS1142(xf)=xS.
% 1.95/2.13 ** KEPT (pick-wt=3): 68 [] aSubsetOf0(xT,xS).
% 1.95/2.13 ** KEPT (pick-wt=6): 70 [copy,69,flip.1] cS1241(xU,xf,xT)=xP.
% 1.95/2.13 ---> New Demodulator: 71 [new_demod,70] cS1241(xU,xf,xT)=xP.
% 1.95/2.13 ** KEPT (pick-wt=4): 72 [] aInfimumOfIn0(xp,xP,xU).
% 1.95/2.13 ** KEPT (pick-wt=6): 73 [] aLowerBoundOfIn0(sdtlpdtrp0(xf,xp),xP,xU).
% 1.95/2.13 ** KEPT (pick-wt=6): 74 [] aUpperBoundOfIn0(sdtlpdtrp0(xf,xp),xT,xU).
% 1.95/2.13 ** KEPT (pick-wt=3): 75 [] aFixedPointOf0(xp,xf).
% 1.95/2.13 ** KEPT (pick-wt=4): 76 [] aSupremumOfIn0(xp,xT,xS).
% 1.95/2.13
% 1.95/2.13 ----> UNIT CONFLICT at 0.00 sec ----> 77 [binary,76.1,52.1] $F.
% 1.95/2.13
% 1.95/2.13 Length of proof is 0. Level of proof is 0.
% 1.95/2.13
% 1.95/2.13 ---------------- PROOF ----------------
% 1.95/2.13 % SZS status Theorem
% 1.95/2.13 % SZS output start Refutation
% See solution above
% 1.95/2.13 ------------ end of proof -------------
% 1.95/2.13
% 1.95/2.13
% 1.95/2.13 Search stopped by max_proofs option.
% 1.95/2.13
% 1.95/2.13
% 1.95/2.13 Search stopped by max_proofs option.
% 1.95/2.13
% 1.95/2.13 ============ end of search ============
% 1.95/2.13
% 1.95/2.13 -------------- statistics -------------
% 1.95/2.13 clauses given 0
% 1.95/2.13 clauses generated 12
% 1.95/2.13 clauses kept 70
% 1.95/2.13 clauses forward subsumed 2
% 1.95/2.13 clauses back subsumed 0
% 1.95/2.13 Kbytes malloced 1953
% 1.95/2.13
% 1.95/2.13 ----------- times (seconds) -----------
% 1.95/2.13 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.95/2.13 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.95/2.13 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.95/2.13
% 1.95/2.13 That finishes the proof of the theorem.
% 1.95/2.13
% 1.95/2.13 Process 17490 finished Wed Jul 27 08:20:46 2022
% 1.95/2.13 Otter interrupted
% 1.95/2.13 PROOF FOUND
%------------------------------------------------------------------------------