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