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