TSTP Solution File: SET793+4 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SET793+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n015.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:14:16 EDT 2022

% Result   : Theorem 2.95s 3.14s
% Output   : Refutation 2.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   18 (   8 unt;   5 nHn;  15 RR)
%            Number of literals    :   39 (   1 equ;  16 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-3 aty)
%            Number of variables   :   25 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(45,axiom,
    ( ~ total_order(A,B)
    | ~ member(C,B)
    | ~ member(D,B)
    | apply(A,C,D)
    | apply(A,D,C) ),
    file('SET793+4.p',unknown),
    [] ).

cnf(56,axiom,
    ( greatest(A,B,C)
    | ~ member(A,C)
    | member(dollar_f11(B,C,A),C) ),
    file('SET793+4.p',unknown),
    [] ).

cnf(57,axiom,
    ( greatest(A,B,C)
    | ~ member(A,C)
    | ~ apply(B,dollar_f11(B,C,A),A) ),
    file('SET793+4.p',unknown),
    [] ).

cnf(62,axiom,
    ( ~ max(A,B,C)
    | member(A,C) ),
    file('SET793+4.p',unknown),
    [] ).

cnf(63,axiom,
    ( ~ max(A,B,C)
    | ~ member(D,C)
    | ~ apply(B,A,D)
    | A = D ),
    file('SET793+4.p',unknown),
    [] ).

cnf(86,axiom,
    ~ greatest(dollar_c1,dollar_c3,dollar_c2),
    file('SET793+4.p',unknown),
    [] ).

cnf(88,plain,
    ( ~ total_order(A,B)
    | ~ member(C,B)
    | apply(A,C,C) ),
    inference(factor_simp,[status(thm)],[inference(factor,[status(thm)],[45])]),
    [iquote('factor,45.2.3,factor_simp')] ).

cnf(112,axiom,
    total_order(dollar_c3,dollar_c2),
    file('SET793+4.p',unknown),
    [] ).

cnf(113,axiom,
    max(dollar_c1,dollar_c3,dollar_c2),
    file('SET793+4.p',unknown),
    [] ).

cnf(127,plain,
    member(dollar_c1,dollar_c2),
    inference(hyper,[status(thm)],[113,62]),
    [iquote('hyper,113,62')] ).

cnf(137,plain,
    apply(dollar_c3,dollar_c1,dollar_c1),
    inference(hyper,[status(thm)],[127,88,112]),
    [iquote('hyper,127,88,112')] ).

cnf(143,plain,
    ( greatest(dollar_c1,A,dollar_c2)
    | member(dollar_f11(A,dollar_c2,dollar_c1),dollar_c2) ),
    inference(hyper,[status(thm)],[127,56]),
    [iquote('hyper,127,56')] ).

cnf(184,plain,
    ( apply(dollar_c3,A,dollar_c1)
    | ~ max(dollar_c1,B,C)
    | ~ member(A,C)
    | ~ apply(B,dollar_c1,A) ),
    inference(para_into,[status(thm),theory(equality)],[137,63]),
    [iquote('para_into,137.1.2,63.4.1')] ).

cnf(355,plain,
    ( greatest(dollar_c1,A,dollar_c2)
    | apply(dollar_c3,dollar_c1,dollar_f11(A,dollar_c2,dollar_c1))
    | apply(dollar_c3,dollar_f11(A,dollar_c2,dollar_c1),dollar_c1) ),
    inference(hyper,[status(thm)],[143,45,112,127]),
    [iquote('hyper,143,45,112,127')] ).

cnf(1137,plain,
    ( apply(dollar_c3,dollar_c1,dollar_f11(dollar_c3,dollar_c2,dollar_c1))
    | apply(dollar_c3,dollar_f11(dollar_c3,dollar_c2,dollar_c1),dollar_c1) ),
    inference(hyper,[status(thm)],[355,86]),
    [iquote('hyper,355,86')] ).

cnf(1141,plain,
    apply(dollar_c3,dollar_f11(dollar_c3,dollar_c2,dollar_c1),dollar_c1),
    inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[1137,184,113,143]),86])]),
    [iquote('hyper,1137,184,113,143,unit_del,86,factor_simp')] ).

cnf(1153,plain,
    greatest(dollar_c1,dollar_c3,dollar_c2),
    inference(hyper,[status(thm)],[1141,57,127]),
    [iquote('hyper,1141,57,127')] ).

cnf(1154,plain,
    $false,
    inference(binary,[status(thm)],[1153,86]),
    [iquote('binary,1153.1,86.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET793+4 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13  % Command  : otter-tptp-script %s
% 0.12/0.34  % Computer : n015.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 10:44:12 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 2.03/2.20  ----- Otter 3.3f, August 2004 -----
% 2.03/2.20  The process was started by sandbox2 on n015.cluster.edu,
% 2.03/2.20  Wed Jul 27 10:44:12 2022
% 2.03/2.20  The command was "./otter".  The process ID is 8319.
% 2.03/2.20  
% 2.03/2.20  set(prolog_style_variables).
% 2.03/2.20  set(auto).
% 2.03/2.20     dependent: set(auto1).
% 2.03/2.20     dependent: set(process_input).
% 2.03/2.20     dependent: clear(print_kept).
% 2.03/2.20     dependent: clear(print_new_demod).
% 2.03/2.20     dependent: clear(print_back_demod).
% 2.03/2.20     dependent: clear(print_back_sub).
% 2.03/2.20     dependent: set(control_memory).
% 2.03/2.20     dependent: assign(max_mem, 12000).
% 2.03/2.20     dependent: assign(pick_given_ratio, 4).
% 2.03/2.20     dependent: assign(stats_level, 1).
% 2.03/2.20     dependent: assign(max_seconds, 10800).
% 2.03/2.20  clear(print_given).
% 2.03/2.20  
% 2.03/2.20  formula_list(usable).
% 2.03/2.20  all A (A=A).
% 2.03/2.20  all R E (order(R,E)<-> (all X (member(X,E)->apply(R,X,X)))& (all X Y (member(X,E)&member(Y,E)-> (apply(R,X,Y)&apply(R,Y,X)->X=Y)))& (all X Y Z (member(X,E)&member(Y,E)&member(Z,E)-> (apply(R,X,Y)&apply(R,Y,Z)->apply(R,X,Z))))).
% 2.03/2.20  all R E (total_order(R,E)<->order(R,E)& (all X Y (member(X,E)&member(Y,E)->apply(R,X,Y)|apply(R,Y,X)))).
% 2.03/2.20  all R E M (upper_bound(M,R,E)<-> (all X (member(X,E)->apply(R,X,M)))).
% 2.03/2.20  all R E M (lower_bound(M,R,E)<-> (all X (member(X,E)->apply(R,M,X)))).
% 2.03/2.20  all R E M (greatest(M,R,E)<->member(M,E)& (all X (member(X,E)->apply(R,X,M)))).
% 2.03/2.20  all R E M (least(M,R,E)<->member(M,E)& (all X (member(X,E)->apply(R,M,X)))).
% 2.03/2.20  all R E M (max(M,R,E)<->member(M,E)& (all X (member(X,E)&apply(R,M,X)->M=X))).
% 2.03/2.20  all R E M (min(M,R,E)<->member(M,E)& (all X (member(X,E)&apply(R,X,M)->M=X))).
% 2.03/2.20  all A X R E (least_upper_bound(A,X,R,E)<->member(A,X)&upper_bound(A,R,X)& (all M (member(M,E)&upper_bound(M,R,X)->apply(R,A,M)))).
% 2.03/2.20  all A X R E (greatest_lower_bound(A,X,R,E)<->member(A,X)&lower_bound(A,R,X)& (all M (member(M,E)&lower_bound(M,R,X)->apply(R,M,A)))).
% 2.03/2.20  -(all R E M (total_order(R,E)&max(M,R,E)->greatest(M,R,E))).
% 2.03/2.20  end_of_list.
% 2.03/2.20  
% 2.03/2.20  -------> usable clausifies to:
% 2.03/2.20  
% 2.03/2.20  list(usable).
% 2.03/2.20  0 [] A=A.
% 2.03/2.20  0 [] -order(R,E)| -member(X,E)|apply(R,X,X).
% 2.03/2.20  0 [] -order(R,E)| -member(X1,E)| -member(Y,E)| -apply(R,X1,Y)| -apply(R,Y,X1)|X1=Y.
% 2.03/2.20  0 [] -order(R,E)| -member(X2,E)| -member(X3,E)| -member(Z,E)| -apply(R,X2,X3)| -apply(R,X3,Z)|apply(R,X2,Z).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|member($f3(R,E),E)|member($f6(R,E),E).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|member($f3(R,E),E)|member($f5(R,E),E).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|member($f3(R,E),E)|member($f4(R,E),E).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|member($f3(R,E),E)|apply(R,$f6(R,E),$f5(R,E)).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|member($f3(R,E),E)|apply(R,$f5(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|member($f3(R,E),E)| -apply(R,$f6(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|member($f2(R,E),E)|member($f6(R,E),E).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|member($f2(R,E),E)|member($f5(R,E),E).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|member($f2(R,E),E)|member($f4(R,E),E).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|member($f2(R,E),E)|apply(R,$f6(R,E),$f5(R,E)).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|member($f2(R,E),E)|apply(R,$f5(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|member($f2(R,E),E)| -apply(R,$f6(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|apply(R,$f3(R,E),$f2(R,E))|member($f6(R,E),E).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|apply(R,$f3(R,E),$f2(R,E))|member($f5(R,E),E).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|apply(R,$f3(R,E),$f2(R,E))|member($f4(R,E),E).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|apply(R,$f3(R,E),$f2(R,E))|apply(R,$f6(R,E),$f5(R,E)).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|apply(R,$f3(R,E),$f2(R,E))|apply(R,$f5(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|apply(R,$f3(R,E),$f2(R,E))| -apply(R,$f6(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|apply(R,$f2(R,E),$f3(R,E))|member($f6(R,E),E).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|apply(R,$f2(R,E),$f3(R,E))|member($f5(R,E),E).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|apply(R,$f2(R,E),$f3(R,E))|member($f4(R,E),E).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|apply(R,$f2(R,E),$f3(R,E))|apply(R,$f6(R,E),$f5(R,E)).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|apply(R,$f2(R,E),$f3(R,E))|apply(R,$f5(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|apply(R,$f2(R,E),$f3(R,E))| -apply(R,$f6(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|$f3(R,E)!=$f2(R,E)|member($f6(R,E),E).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|$f3(R,E)!=$f2(R,E)|member($f5(R,E),E).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|$f3(R,E)!=$f2(R,E)|member($f4(R,E),E).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|$f3(R,E)!=$f2(R,E)|apply(R,$f6(R,E),$f5(R,E)).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|$f3(R,E)!=$f2(R,E)|apply(R,$f5(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)|member($f1(R,E),E)|$f3(R,E)!=$f2(R,E)| -apply(R,$f6(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|member($f3(R,E),E)|member($f6(R,E),E).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|member($f3(R,E),E)|member($f5(R,E),E).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|member($f3(R,E),E)|member($f4(R,E),E).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|member($f3(R,E),E)|apply(R,$f6(R,E),$f5(R,E)).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|member($f3(R,E),E)|apply(R,$f5(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|member($f3(R,E),E)| -apply(R,$f6(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|member($f2(R,E),E)|member($f6(R,E),E).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|member($f2(R,E),E)|member($f5(R,E),E).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|member($f2(R,E),E)|member($f4(R,E),E).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|member($f2(R,E),E)|apply(R,$f6(R,E),$f5(R,E)).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|member($f2(R,E),E)|apply(R,$f5(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|member($f2(R,E),E)| -apply(R,$f6(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|apply(R,$f3(R,E),$f2(R,E))|member($f6(R,E),E).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|apply(R,$f3(R,E),$f2(R,E))|member($f5(R,E),E).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|apply(R,$f3(R,E),$f2(R,E))|member($f4(R,E),E).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|apply(R,$f3(R,E),$f2(R,E))|apply(R,$f6(R,E),$f5(R,E)).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|apply(R,$f3(R,E),$f2(R,E))|apply(R,$f5(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|apply(R,$f3(R,E),$f2(R,E))| -apply(R,$f6(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|apply(R,$f2(R,E),$f3(R,E))|member($f6(R,E),E).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|apply(R,$f2(R,E),$f3(R,E))|member($f5(R,E),E).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|apply(R,$f2(R,E),$f3(R,E))|member($f4(R,E),E).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|apply(R,$f2(R,E),$f3(R,E))|apply(R,$f6(R,E),$f5(R,E)).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|apply(R,$f2(R,E),$f3(R,E))|apply(R,$f5(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|apply(R,$f2(R,E),$f3(R,E))| -apply(R,$f6(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|$f3(R,E)!=$f2(R,E)|member($f6(R,E),E).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|$f3(R,E)!=$f2(R,E)|member($f5(R,E),E).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|$f3(R,E)!=$f2(R,E)|member($f4(R,E),E).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|$f3(R,E)!=$f2(R,E)|apply(R,$f6(R,E),$f5(R,E)).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|$f3(R,E)!=$f2(R,E)|apply(R,$f5(R,E),$f4(R,E)).
% 2.03/2.20  0 [] order(R,E)| -apply(R,$f1(R,E),$f1(R,E))|$f3(R,E)!=$f2(R,E)| -apply(R,$f6(R,E),$f4(R,E)).
% 2.03/2.20  0 [] -total_order(R,E)|order(R,E).
% 2.03/2.20  0 [] -total_order(R,E)| -member(X,E)| -member(Y,E)|apply(R,X,Y)|apply(R,Y,X).
% 2.03/2.20  0 [] total_order(R,E)| -order(R,E)|member($f8(R,E),E).
% 2.03/2.20  0 [] total_order(R,E)| -order(R,E)|member($f7(R,E),E).
% 2.03/2.20  0 [] total_order(R,E)| -order(R,E)| -apply(R,$f8(R,E),$f7(R,E)).
% 2.03/2.20  0 [] total_order(R,E)| -order(R,E)| -apply(R,$f7(R,E),$f8(R,E)).
% 2.03/2.20  0 [] -upper_bound(M,R,E)| -member(X,E)|apply(R,X,M).
% 2.03/2.20  0 [] upper_bound(M,R,E)|member($f9(R,E,M),E).
% 2.03/2.20  0 [] upper_bound(M,R,E)| -apply(R,$f9(R,E,M),M).
% 2.03/2.20  0 [] -lower_bound(M,R,E)| -member(X,E)|apply(R,M,X).
% 2.03/2.20  0 [] lower_bound(M,R,E)|member($f10(R,E,M),E).
% 2.03/2.20  0 [] lower_bound(M,R,E)| -apply(R,M,$f10(R,E,M)).
% 2.03/2.20  0 [] -greatest(M,R,E)|member(M,E).
% 2.03/2.20  0 [] -greatest(M,R,E)| -member(X,E)|apply(R,X,M).
% 2.03/2.20  0 [] greatest(M,R,E)| -member(M,E)|member($f11(R,E,M),E).
% 2.03/2.20  0 [] greatest(M,R,E)| -member(M,E)| -apply(R,$f11(R,E,M),M).
% 2.03/2.20  0 [] -least(M,R,E)|member(M,E).
% 2.03/2.20  0 [] -least(M,R,E)| -member(X,E)|apply(R,M,X).
% 2.03/2.20  0 [] least(M,R,E)| -member(M,E)|member($f12(R,E,M),E).
% 2.03/2.20  0 [] least(M,R,E)| -member(M,E)| -apply(R,M,$f12(R,E,M)).
% 2.03/2.20  0 [] -max(M,R,E)|member(M,E).
% 2.03/2.20  0 [] -max(M,R,E)| -member(X,E)| -apply(R,M,X)|M=X.
% 2.03/2.20  0 [] max(M,R,E)| -member(M,E)|member($f13(R,E,M),E).
% 2.03/2.20  0 [] max(M,R,E)| -member(M,E)|apply(R,M,$f13(R,E,M)).
% 2.03/2.20  0 [] max(M,R,E)| -member(M,E)|M!=$f13(R,E,M).
% 2.03/2.20  0 [] -min(M,R,E)|member(M,E).
% 2.03/2.20  0 [] -min(M,R,E)| -member(X,E)| -apply(R,X,M)|M=X.
% 2.03/2.20  0 [] min(M,R,E)| -member(M,E)|member($f14(R,E,M),E).
% 2.03/2.20  0 [] min(M,R,E)| -member(M,E)|apply(R,$f14(R,E,M),M).
% 2.03/2.20  0 [] min(M,R,E)| -member(M,E)|M!=$f14(R,E,M).
% 2.03/2.20  0 [] -least_upper_bound(A,X,R,E)|member(A,X).
% 2.03/2.20  0 [] -least_upper_bound(A,X,R,E)|upper_bound(A,R,X).
% 2.03/2.20  0 [] -least_upper_bound(A,X,R,E)| -member(M,E)| -upper_bound(M,R,X)|apply(R,A,M).
% 2.03/2.20  0 [] least_upper_bound(A,X,R,E)| -member(A,X)| -upper_bound(A,R,X)|member($f15(A,X,R,E),E).
% 2.03/2.20  0 [] least_upper_bound(A,X,R,E)| -member(A,X)| -upper_bound(A,R,X)|upper_bound($f15(A,X,R,E),R,X).
% 2.03/2.20  0 [] least_upper_bound(A,X,R,E)| -member(A,X)| -upper_bound(A,R,X)| -apply(R,A,$f15(A,X,R,E)).
% 2.03/2.20  0 [] -greatest_lower_bound(A,X,R,E)|member(A,X).
% 2.03/2.20  0 [] -greatest_lower_bound(A,X,R,E)|lower_bound(A,R,X).
% 2.03/2.20  0 [] -greatest_lower_bound(A,X,R,E)| -member(M,E)| -lower_bound(M,R,X)|apply(R,M,A).
% 2.03/2.20  0 [] greatest_lower_bound(A,X,R,E)| -member(A,X)| -lower_bound(A,R,X)|member($f16(A,X,R,E),E).
% 2.03/2.20  0 [] greatest_lower_bound(A,X,R,E)| -member(A,X)| -lower_bound(A,R,X)|lower_bound($f16(A,X,R,E),R,X).
% 2.03/2.20  0 [] greatest_lower_bound(A,X,R,E)| -member(A,X)| -lower_bound(A,R,X)| -apply(R,$f16(A,X,R,E),A).
% 2.03/2.20  0 [] total_order($c3,$c2).
% 2.03/2.20  0 [] max($c1,$c3,$c2).
% 2.03/2.20  0 [] -greatest($c1,$c3,$c2).
% 2.03/2.20  end_of_list.
% 2.03/2.20  
% 2.03/2.20  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 2.03/2.20  
% 2.03/2.20  This ia a non-Horn set with equality.  The strategy will be
% 2.03/2.20  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.03/2.20  deletion, with positive clauses in sos and nonpositive
% 2.03/2.20  clauses in usable.
% 2.03/2.20  
% 2.03/2.20     dependent: set(knuth_bendix).
% 2.03/2.20     dependent: set(anl_eq).
% 2.03/2.20     dependent: set(para_from).
% 2.03/2.20     dependent: set(para_into).
% 2.03/2.20     dependent: clear(para_from_right).
% 2.03/2.20     dependent: clear(para_into_right).
% 2.03/2.20     dependent: set(para_from_vars).
% 2.03/2.20     dependent: set(eq_units_both_ways).
% 2.03/2.20     dependent: set(dynamic_demod_all).
% 2.03/2.20     dependent: set(dynamic_demod).
% 2.03/2.20     dependent: set(order_eq).
% 2.03/2.20     dependent: set(back_demod).
% 2.03/2.20     dependent: set(lrpo).
% 2.03/2.20     dependent: set(hyper_res).
% 2.03/2.20     dependent: set(unit_deletion).
% 2.03/2.20     dependent: set(factor).
% 2.03/2.20  
% 2.03/2.20  ------------> process usable:
% 2.03/2.20  ** KEPT (pick-wt=10): 1 [] -order(A,B)| -member(C,B)|apply(A,C,C).
% 2.03/2.20  ** KEPT (pick-wt=20): 2 [] -order(A,B)| -member(C,B)| -member(D,B)| -apply(A,C,D)| -apply(A,D,C)|C=D.
% 2.03/2.20  ** KEPT (pick-wt=24): 3 [] -order(A,B)| -member(C,B)| -member(D,B)| -member(E,B)| -apply(A,C,D)| -apply(A,D,E)|apply(A,C,E).
% 2.03/2.20  ** KEPT (pick-wt=21): 4 [] order(A,B)|member($f1(A,B),B)|member($f3(A,B),B)| -apply(A,$f6(A,B),$f4(A,B)).
% 2.03/2.20  ** KEPT (pick-wt=21): 5 [] order(A,B)|member($f1(A,B),B)|member($f2(A,B),B)| -apply(A,$f6(A,B),$f4(A,B)).
% 2.03/2.20  ** KEPT (pick-wt=24): 6 [] order(A,B)|member($f1(A,B),B)|apply(A,$f3(A,B),$f2(A,B))| -apply(A,$f6(A,B),$f4(A,B)).
% 2.03/2.20  ** KEPT (pick-wt=24): 7 [] order(A,B)|member($f1(A,B),B)|apply(A,$f2(A,B),$f3(A,B))| -apply(A,$f6(A,B),$f4(A,B)).
% 2.03/2.20  ** KEPT (pick-wt=20): 8 [] order(A,B)|member($f1(A,B),B)|$f3(A,B)!=$f2(A,B)|member($f6(A,B),B).
% 2.03/2.20  ** KEPT (pick-wt=20): 9 [] order(A,B)|member($f1(A,B),B)|$f3(A,B)!=$f2(A,B)|member($f5(A,B),B).
% 2.03/2.20  ** KEPT (pick-wt=20): 10 [] order(A,B)|member($f1(A,B),B)|$f3(A,B)!=$f2(A,B)|member($f4(A,B),B).
% 2.03/2.20  ** KEPT (pick-wt=23): 11 [] order(A,B)|member($f1(A,B),B)|$f3(A,B)!=$f2(A,B)|apply(A,$f6(A,B),$f5(A,B)).
% 2.03/2.20  ** KEPT (pick-wt=23): 12 [] order(A,B)|member($f1(A,B),B)|$f3(A,B)!=$f2(A,B)|apply(A,$f5(A,B),$f4(A,B)).
% 2.03/2.20  ** KEPT (pick-wt=23): 13 [] order(A,B)|member($f1(A,B),B)|$f3(A,B)!=$f2(A,B)| -apply(A,$f6(A,B),$f4(A,B)).
% 2.03/2.20  ** KEPT (pick-wt=21): 14 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|member($f3(A,B),B)|member($f6(A,B),B).
% 2.03/2.20  ** KEPT (pick-wt=21): 15 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|member($f3(A,B),B)|member($f5(A,B),B).
% 2.03/2.20  ** KEPT (pick-wt=21): 16 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|member($f3(A,B),B)|member($f4(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=24): 17 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|member($f3(A,B),B)|apply(A,$f6(A,B),$f5(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=24): 18 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|member($f3(A,B),B)|apply(A,$f5(A,B),$f4(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=24): 19 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|member($f3(A,B),B)| -apply(A,$f6(A,B),$f4(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=21): 20 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|member($f2(A,B),B)|member($f6(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=21): 21 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|member($f2(A,B),B)|member($f5(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=21): 22 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|member($f2(A,B),B)|member($f4(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=24): 23 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|member($f2(A,B),B)|apply(A,$f6(A,B),$f5(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=24): 24 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|member($f2(A,B),B)|apply(A,$f5(A,B),$f4(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=24): 25 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|member($f2(A,B),B)| -apply(A,$f6(A,B),$f4(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=24): 26 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|apply(A,$f3(A,B),$f2(A,B))|member($f6(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=24): 27 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|apply(A,$f3(A,B),$f2(A,B))|member($f5(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=24): 28 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|apply(A,$f3(A,B),$f2(A,B))|member($f4(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=27): 29 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|apply(A,$f3(A,B),$f2(A,B))|apply(A,$f6(A,B),$f5(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=27): 30 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|apply(A,$f3(A,B),$f2(A,B))|apply(A,$f5(A,B),$f4(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=27): 31 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|apply(A,$f3(A,B),$f2(A,B))| -apply(A,$f6(A,B),$f4(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=24): 32 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|apply(A,$f2(A,B),$f3(A,B))|member($f6(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=24): 33 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|apply(A,$f2(A,B),$f3(A,B))|member($f5(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=24): 34 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|apply(A,$f2(A,B),$f3(A,B))|member($f4(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=27): 35 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|apply(A,$f2(A,B),$f3(A,B))|apply(A,$f6(A,B),$f5(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=27): 36 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|apply(A,$f2(A,B),$f3(A,B))|apply(A,$f5(A,B),$f4(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=27): 37 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|apply(A,$f2(A,B),$f3(A,B))| -apply(A,$f6(A,B),$f4(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=23): 38 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|$f3(A,B)!=$f2(A,B)|member($f6(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=23): 39 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|$f3(A,B)!=$f2(A,B)|member($f5(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=23): 40 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|$f3(A,B)!=$f2(A,B)|member($f4(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=26): 41 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|$f3(A,B)!=$f2(A,B)|apply(A,$f6(A,B),$f5(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=26): 42 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|$f3(A,B)!=$f2(A,B)|apply(A,$f5(A,B),$f4(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=26): 43 [] order(A,B)| -apply(A,$f1(A,B),$f1(A,B))|$f3(A,B)!=$f2(A,B)| -apply(A,$f6(A,B),$f4(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=6): 44 [] -total_order(A,B)|order(A,B).
% 2.03/2.21  ** KEPT (pick-wt=17): 45 [] -total_order(A,B)| -member(C,B)| -member(D,B)|apply(A,C,D)|apply(A,D,C).
% 2.03/2.21  ** KEPT (pick-wt=11): 46 [] total_order(A,B)| -order(A,B)|member($f8(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=11): 47 [] total_order(A,B)| -order(A,B)|member($f7(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=14): 48 [] total_order(A,B)| -order(A,B)| -apply(A,$f8(A,B),$f7(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=14): 49 [] total_order(A,B)| -order(A,B)| -apply(A,$f7(A,B),$f8(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=11): 50 [] -upper_bound(A,B,C)| -member(D,C)|apply(B,D,A).
% 2.03/2.21  ** KEPT (pick-wt=11): 51 [] upper_bound(A,B,C)| -apply(B,$f9(B,C,A),A).
% 2.03/2.21  ** KEPT (pick-wt=11): 52 [] -lower_bound(A,B,C)| -member(D,C)|apply(B,A,D).
% 2.03/2.21  ** KEPT (pick-wt=11): 53 [] lower_bound(A,B,C)| -apply(B,A,$f10(B,C,A)).
% 2.03/2.21  ** KEPT (pick-wt=7): 54 [] -greatest(A,B,C)|member(A,C).
% 2.03/2.21  ** KEPT (pick-wt=11): 55 [] -greatest(A,B,C)| -member(D,C)|apply(B,D,A).
% 2.03/2.21  ** KEPT (pick-wt=13): 56 [] greatest(A,B,C)| -member(A,C)|member($f11(B,C,A),C).
% 2.03/2.21  ** KEPT (pick-wt=14): 57 [] greatest(A,B,C)| -member(A,C)| -apply(B,$f11(B,C,A),A).
% 2.03/2.21  ** KEPT (pick-wt=7): 58 [] -least(A,B,C)|member(A,C).
% 2.03/2.21  ** KEPT (pick-wt=11): 59 [] -least(A,B,C)| -member(D,C)|apply(B,A,D).
% 2.03/2.21  ** KEPT (pick-wt=13): 60 [] least(A,B,C)| -member(A,C)|member($f12(B,C,A),C).
% 2.03/2.21  ** KEPT (pick-wt=14): 61 [] least(A,B,C)| -member(A,C)| -apply(B,A,$f12(B,C,A)).
% 2.03/2.21  ** KEPT (pick-wt=7): 62 [] -max(A,B,C)|member(A,C).
% 2.03/2.21  ** KEPT (pick-wt=14): 63 [] -max(A,B,C)| -member(D,C)| -apply(B,A,D)|A=D.
% 2.03/2.21  ** KEPT (pick-wt=13): 64 [] max(A,B,C)| -member(A,C)|member($f13(B,C,A),C).
% 2.03/2.21  ** KEPT (pick-wt=14): 65 [] max(A,B,C)| -member(A,C)|apply(B,A,$f13(B,C,A)).
% 2.03/2.21  ** KEPT (pick-wt=13): 67 [copy,66,flip.3] max(A,B,C)| -member(A,C)|$f13(B,C,A)!=A.
% 2.03/2.21  ** KEPT (pick-wt=7): 68 [] -min(A,B,C)|member(A,C).
% 2.03/2.21  ** KEPT (pick-wt=14): 69 [] -min(A,B,C)| -member(D,C)| -apply(B,D,A)|A=D.
% 2.03/2.21  ** KEPT (pick-wt=13): 70 [] min(A,B,C)| -member(A,C)|member($f14(B,C,A),C).
% 2.03/2.21  ** KEPT (pick-wt=14): 71 [] min(A,B,C)| -member(A,C)|apply(B,$f14(B,C,A),A).
% 2.03/2.21  ** KEPT (pick-wt=13): 73 [copy,72,flip.3] min(A,B,C)| -member(A,C)|$f14(B,C,A)!=A.
% 2.03/2.21  ** KEPT (pick-wt=8): 74 [] -least_upper_bound(A,B,C,D)|member(A,B).
% 2.03/2.21  ** KEPT (pick-wt=9): 75 [] -least_upper_bound(A,B,C,D)|upper_bound(A,C,B).
% 2.03/2.21  ** KEPT (pick-wt=16): 76 [] -least_upper_bound(A,B,C,D)| -member(E,D)| -upper_bound(E,C,B)|apply(C,A,E).
% 2.03/2.21  ** KEPT (pick-wt=19): 77 [] least_upper_bound(A,B,C,D)| -member(A,B)| -upper_bound(A,C,B)|member($f15(A,B,C,D),D).
% 2.03/2.21  ** KEPT (pick-wt=20): 78 [] least_upper_bound(A,B,C,D)| -member(A,B)| -upper_bound(A,C,B)|upper_bound($f15(A,B,C,D),C,B).
% 2.03/2.21  ** KEPT (pick-wt=20): 79 [] least_upper_bound(A,B,C,D)| -member(A,B)| -upper_bound(A,C,B)| -apply(C,A,$f15(A,B,C,D)).
% 2.03/2.21  ** KEPT (pick-wt=8): 80 [] -greatest_lower_bound(A,B,C,D)|member(A,B).
% 2.03/2.21  ** KEPT (pick-wt=9): 81 [] -greatest_lower_bound(A,B,C,D)|lower_bound(A,C,B).
% 2.03/2.21  ** KEPT (pick-wt=16): 82 [] -greatest_lower_bound(A,B,C,D)| -member(E,D)| -lower_bound(E,C,B)|apply(C,E,A).
% 2.03/2.21  ** KEPT (pick-wt=19): 83 [] greatest_lower_bound(A,B,C,D)| -member(A,B)| -lower_bound(A,C,B)|member($f16(A,B,C,D),D).
% 2.03/2.21  ** KEPT (pick-wt=20): 84 [] greatest_lower_bound(A,B,C,D)| -member(A,B)| -lower_bound(A,C,B)|lower_bound($f16(A,B,C,D),C,B).
% 2.03/2.21  ** KEPT (pick-wt=20): 85 [] greatest_lower_bound(A,B,C,D)| -member(A,B)| -lower_bound(A,C,B)| -apply(C,$f16(A,B,C,D),A).
% 2.03/2.21  ** KEPT (pick-wt=4): 86 [] -greatest($c1,$c3,$c2).
% 2.03/2.21  
% 2.03/2.21  ------------> process sos:
% 2.03/2.21  ** KEPT (pick-wt=3): 89 [] A=A.
% 2.03/2.21  ** KEPT (pick-wt=18): 90 [] order(A,B)|member($f1(A,B),B)|member($f3(A,B),B)|member($f6(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=18): 91 [] order(A,B)|member($f1(A,B),B)|member($f3(A,B),B)|member($f5(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=18): 92 [] order(A,B)|member($f1(A,B),B)|member($f3(A,B),B)|member($f4(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=21): 93 [] order(A,B)|member($f1(A,B),B)|member($f3(A,B),B)|apply(A,$f6(A,B),$f5(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=21): 94 [] order(A,B)|member($f1(A,B),B)|member($f3(A,B),B)|apply(A,$f5(A,B),$f4(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=18): 95 [] order(A,B)|member($f1(A,B),B)|member($f2(A,B),B)|member($f6(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=18): 96 [] order(A,B)|member($f1(A,B),B)|member($f2(A,B),B)|member($f5(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=18): 97 [] order(A,B)|member($f1(A,B),B)|member($f2(A,B),B)|member($f4(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=21): 98 [] order(A,B)|member($f1(A,B),B)|member($f2(A,B),B)|apply(A,$f6(A,B),$f5(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=21): 99 [] order(A,B)|member($f1(A,B),B)|member($f2(A,B),B)|apply(A,$f5(A,B),$f4(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=21): 100 [] order(A,B)|member($f1(A,B),B)|apply(A,$f3(A,B),$f2(A,B))|member($f6(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=21): 101 [] order(A,B)|member($f1(A,B),B)|apply(A,$f3(A,B),$f2(A,B))|member($f5(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=21): 102 [] order(A,B)|member($f1(A,B),B)|apply(A,$f3(A,B),$f2(A,B))|member($f4(A,B),B).
% 2.03/2.21  ** KEPT (pick-wt=24): 103 [] order(A,B)|member($f1(A,B),B)|apply(A,$f3(A,B),$f2(A,B))|apply(A,$f6(A,B),$f5(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=24): 104 [] order(A,B)|member($f1(A,B),B)|apply(A,$f3(A,B),$f2(A,B))|apply(A,$f5(A,B),$f4(A,B)).
% 2.03/2.21  ** KEPT (pick-wt=21): 105 [] order(A,B)|member($f1(A,B),B)|apply(A,$f2(A,B),$f3(A,B))|member($f6(A,B),B).
% 2.95/3.14  ** KEPT (pick-wt=21): 106 [] order(A,B)|member($f1(A,B),B)|apply(A,$f2(A,B),$f3(A,B))|member($f5(A,B),B).
% 2.95/3.14  ** KEPT (pick-wt=21): 107 [] order(A,B)|member($f1(A,B),B)|apply(A,$f2(A,B),$f3(A,B))|member($f4(A,B),B).
% 2.95/3.14  ** KEPT (pick-wt=24): 108 [] order(A,B)|member($f1(A,B),B)|apply(A,$f2(A,B),$f3(A,B))|apply(A,$f6(A,B),$f5(A,B)).
% 2.95/3.14  ** KEPT (pick-wt=24): 109 [] order(A,B)|member($f1(A,B),B)|apply(A,$f2(A,B),$f3(A,B))|apply(A,$f5(A,B),$f4(A,B)).
% 2.95/3.14  ** KEPT (pick-wt=10): 110 [] upper_bound(A,B,C)|member($f9(B,C,A),C).
% 2.95/3.14  ** KEPT (pick-wt=10): 111 [] lower_bound(A,B,C)|member($f10(B,C,A),C).
% 2.95/3.14  ** KEPT (pick-wt=3): 112 [] total_order($c3,$c2).
% 2.95/3.14  ** KEPT (pick-wt=4): 113 [] max($c1,$c3,$c2).
% 2.95/3.14    Following clause subsumed by 89 during input processing: 0 [copy,89,flip.1] A=A.
% 2.95/3.14  89 back subsumes 87.
% 2.95/3.14  
% 2.95/3.14  ======= end of input processing =======
% 2.95/3.14  
% 2.95/3.14  =========== start of search ===========
% 2.95/3.14  
% 2.95/3.14  
% 2.95/3.14  Resetting weight limit to 20.
% 2.95/3.14  
% 2.95/3.14  
% 2.95/3.14  Resetting weight limit to 20.
% 2.95/3.14  
% 2.95/3.14  sos_size=1001
% 2.95/3.14  
% 2.95/3.14  -------- PROOF -------- 
% 2.95/3.14  
% 2.95/3.14  ----> UNIT CONFLICT at   0.94 sec ----> 1154 [binary,1153.1,86.1] $F.
% 2.95/3.14  
% 2.95/3.14  Length of proof is 9.  Level of proof is 6.
% 2.95/3.14  
% 2.95/3.14  ---------------- PROOF ----------------
% 2.95/3.14  % SZS status Theorem
% 2.95/3.14  % SZS output start Refutation
% See solution above
% 2.95/3.14  ------------ end of proof -------------
% 2.95/3.14  
% 2.95/3.14  
% 2.95/3.14  Search stopped by max_proofs option.
% 2.95/3.14  
% 2.95/3.14  
% 2.95/3.14  Search stopped by max_proofs option.
% 2.95/3.14  
% 2.95/3.14  ============ end of search ============
% 2.95/3.14  
% 2.95/3.14  -------------- statistics -------------
% 2.95/3.14  clauses given                 70
% 2.95/3.14  clauses generated           6151
% 2.95/3.14  clauses kept                1151
% 2.95/3.14  clauses forward subsumed    2137
% 2.95/3.14  clauses back subsumed          6
% 2.95/3.14  Kbytes malloced             4882
% 2.95/3.14  
% 2.95/3.14  ----------- times (seconds) -----------
% 2.95/3.14  user CPU time          0.94          (0 hr, 0 min, 0 sec)
% 2.95/3.14  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 2.95/3.14  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 2.95/3.14  
% 2.95/3.14  That finishes the proof of the theorem.
% 2.95/3.14  
% 2.95/3.14  Process 8319 finished Wed Jul 27 10:44:14 2022
% 2.95/3.14  Otter interrupted
% 2.95/3.14  PROOF FOUND
%------------------------------------------------------------------------------