TSTP Solution File: ANA025-2 by Otter---3.3

View Problem - Process Solution

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

% Computer : n010.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 12:46:45 EDT 2022

% Result   : Unsatisfiable 1.70s 1.91s
% Output   : Refutation 1.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   23 (  13 unt;   2 nHn;  17 RR)
%            Number of literals    :   39 (   0 equ;  16 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-3 aty)
%            Number of variables   :   25 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ class_OrderedGroup_Olordered__ab__group__abs(A)
    | c_lesse_quals(c_0,c_HOL_Oabs(B,A),A) ),
    file('ANA025-2.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ class_Orderings_Olinorder(A)
    | c_less(B,C,A)
    | c_lesse_quals(C,B,A) ),
    file('ANA025-2.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ class_Orderings_Olinorder(A)
    | ~ c_lesse_quals(B,C,A)
    | ~ c_lesse_quals(D,C,A)
    | c_lesse_quals(c_Orderings_Omax(D,B,A),C,A) ),
    file('ANA025-2.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ class_Orderings_Oorder(A)
    | ~ c_lesse_quals(B,C,A)
    | ~ c_lesse_quals(D,B,A)
    | c_lesse_quals(D,C,A) ),
    file('ANA025-2.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ class_Orderings_Oorder(A)
    | ~ c_less(B,C,A)
    | c_lesse_quals(B,C,A) ),
    file('ANA025-2.p',unknown),
    [] ).

cnf(6,axiom,
    ~ c_lesse_quals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
    file('ANA025-2.p',unknown),
    [] ).

cnf(7,axiom,
    ~ c_lesse_quals(c_Orderings_Omax(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b),
    file('ANA025-2.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ class_LOrder_Ojoin__semilorder(A)
    | class_Orderings_Oorder(A) ),
    file('ANA025-2.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ class_OrderedGroup_Olordered__ab__group__abs(A)
    | class_LOrder_Ojoin__semilorder(A) ),
    file('ANA025-2.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(A)
    | class_Orderings_Olinorder(A) ),
    file('ANA025-2.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(A)
    | class_OrderedGroup_Olordered__ab__group__abs(A) ),
    file('ANA025-2.p',unknown),
    [] ).

cnf(13,axiom,
    class_Ring__and__Field_Oordered__idom(t_b),
    file('ANA025-2.p',unknown),
    [] ).

cnf(14,plain,
    class_OrderedGroup_Olordered__ab__group__abs(t_b),
    inference(hyper,[status(thm)],[13,11]),
    [iquote('hyper,13,11')] ).

cnf(15,plain,
    class_Orderings_Olinorder(t_b),
    inference(hyper,[status(thm)],[13,10]),
    [iquote('hyper,13,10')] ).

cnf(16,plain,
    class_LOrder_Ojoin__semilorder(t_b),
    inference(hyper,[status(thm)],[14,9]),
    [iquote('hyper,14,9')] ).

cnf(17,plain,
    c_lesse_quals(c_0,c_HOL_Oabs(A,t_b),t_b),
    inference(hyper,[status(thm)],[14,1]),
    [iquote('hyper,14,1')] ).

cnf(18,plain,
    ( c_less(A,B,t_b)
    | c_lesse_quals(B,A,t_b) ),
    inference(hyper,[status(thm)],[15,2]),
    [iquote('hyper,15,2')] ).

cnf(19,plain,
    class_Orderings_Oorder(t_b),
    inference(hyper,[status(thm)],[16,8]),
    [iquote('hyper,16,8')] ).

cnf(23,plain,
    c_less(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),
    inference(hyper,[status(thm)],[18,6]),
    [iquote('hyper,18,6')] ).

cnf(37,plain,
    c_lesse_quals(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),
    inference(hyper,[status(thm)],[23,5,19]),
    [iquote('hyper,23,5,19')] ).

cnf(40,plain,
    c_lesse_quals(c_minus(v_k(v_x),v_g(v_x),t_b),c_HOL_Oabs(A,t_b),t_b),
    inference(hyper,[status(thm)],[37,4,19,17]),
    [iquote('hyper,37,4,19,17')] ).

cnf(98,plain,
    c_lesse_quals(c_Orderings_Omax(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),c_HOL_Oabs(A,t_b),t_b),
    inference(hyper,[status(thm)],[40,3,15,17]),
    [iquote('hyper,40,3,15,17')] ).

cnf(99,plain,
    $false,
    inference(binary,[status(thm)],[98,7]),
    [iquote('binary,98.1,7.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : ANA025-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12  % Command  : otter-tptp-script %s
% 0.13/0.33  % Computer : n010.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Wed Jul 27 09:56:54 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 1.70/1.91  ----- Otter 3.3f, August 2004 -----
% 1.70/1.91  The process was started by sandbox2 on n010.cluster.edu,
% 1.70/1.91  Wed Jul 27 09:56:55 2022
% 1.70/1.91  The command was "./otter".  The process ID is 25255.
% 1.70/1.91  
% 1.70/1.91  set(prolog_style_variables).
% 1.70/1.91  set(auto).
% 1.70/1.91     dependent: set(auto1).
% 1.70/1.91     dependent: set(process_input).
% 1.70/1.91     dependent: clear(print_kept).
% 1.70/1.91     dependent: clear(print_new_demod).
% 1.70/1.91     dependent: clear(print_back_demod).
% 1.70/1.91     dependent: clear(print_back_sub).
% 1.70/1.91     dependent: set(control_memory).
% 1.70/1.91     dependent: assign(max_mem, 12000).
% 1.70/1.91     dependent: assign(pick_given_ratio, 4).
% 1.70/1.91     dependent: assign(stats_level, 1).
% 1.70/1.91     dependent: assign(max_seconds, 10800).
% 1.70/1.91  clear(print_given).
% 1.70/1.91  
% 1.70/1.91  list(usable).
% 1.70/1.91  0 [] -class_OrderedGroup_Olordered__ab__group__abs(T_a)|c_lesse_quals(c_0,c_HOL_Oabs(V_a,T_a),T_a).
% 1.70/1.91  0 [] -class_Orderings_Olinorder(T_a)|c_less(V_y,V_x,T_a)|c_lesse_quals(V_x,V_y,T_a).
% 1.70/1.91  0 [] -class_Orderings_Olinorder(T_b)| -c_lesse_quals(V_y,V_z,T_b)| -c_lesse_quals(V_x,V_z,T_b)|c_lesse_quals(c_Orderings_Omax(V_x,V_y,T_b),V_z,T_b).
% 1.70/1.91  0 [] -class_Orderings_Oorder(T_a)| -c_lesse_quals(V_y,V_z,T_a)| -c_lesse_quals(V_x,V_y,T_a)|c_lesse_quals(V_x,V_z,T_a).
% 1.70/1.91  0 [] -class_Orderings_Oorder(T_a)| -c_less(V_x,V_y,T_a)|c_lesse_quals(V_x,V_y,T_a).
% 1.70/1.91  0 [] -c_lesse_quals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b).
% 1.70/1.91  0 [] -c_lesse_quals(c_Orderings_Omax(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b).
% 1.70/1.91  0 [] -class_LOrder_Ojoin__semilorder(T)|class_Orderings_Oorder(T).
% 1.70/1.91  0 [] -class_OrderedGroup_Olordered__ab__group__abs(T)|class_LOrder_Ojoin__semilorder(T).
% 1.70/1.91  0 [] -class_Ring__and__Field_Oordered__idom(T)|class_Orderings_Olinorder(T).
% 1.70/1.91  0 [] -class_Ring__and__Field_Oordered__idom(T)|class_OrderedGroup_Olordered__ab__group__abs(T).
% 1.70/1.91  0 [] class_Ring__and__Field_Oordered__idom(t_b).
% 1.70/1.91  end_of_list.
% 1.70/1.91  
% 1.70/1.91  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.70/1.91  
% 1.70/1.91  This is a non-Horn set without equality.  The strategy will
% 1.70/1.91  be ordered hyper_res, unit deletion, and factoring, with
% 1.70/1.91  satellites in sos and with nuclei in usable.
% 1.70/1.91  
% 1.70/1.91     dependent: set(hyper_res).
% 1.70/1.91     dependent: set(factor).
% 1.70/1.91     dependent: set(unit_deletion).
% 1.70/1.91  
% 1.70/1.91  ------------> process usable:
% 1.70/1.91  ** KEPT (pick-wt=8): 1 [] -class_OrderedGroup_Olordered__ab__group__abs(A)|c_lesse_quals(c_0,c_HOL_Oabs(B,A),A).
% 1.70/1.91  ** KEPT (pick-wt=10): 2 [] -class_Orderings_Olinorder(A)|c_less(B,C,A)|c_lesse_quals(C,B,A).
% 1.70/1.91  ** KEPT (pick-wt=17): 3 [] -class_Orderings_Olinorder(A)| -c_lesse_quals(B,C,A)| -c_lesse_quals(D,C,A)|c_lesse_quals(c_Orderings_Omax(D,B,A),C,A).
% 1.70/1.91  ** KEPT (pick-wt=14): 4 [] -class_Orderings_Oorder(A)| -c_lesse_quals(B,C,A)| -c_lesse_quals(D,B,A)|c_lesse_quals(D,C,A).
% 1.70/1.91  ** KEPT (pick-wt=10): 5 [] -class_Orderings_Oorder(A)| -c_less(B,C,A)|c_lesse_quals(B,C,A).
% 1.70/1.91  ** KEPT (pick-wt=9): 6 [] -c_lesse_quals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b).
% 1.70/1.91  ** KEPT (pick-wt=19): 7 [] -c_lesse_quals(c_Orderings_Omax(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b).
% 1.70/1.91  ** KEPT (pick-wt=4): 8 [] -class_LOrder_Ojoin__semilorder(A)|class_Orderings_Oorder(A).
% 1.70/1.91  ** KEPT (pick-wt=4): 9 [] -class_OrderedGroup_Olordered__ab__group__abs(A)|class_LOrder_Ojoin__semilorder(A).
% 1.70/1.91  ** KEPT (pick-wt=4): 10 [] -class_Ring__and__Field_Oordered__idom(A)|class_Orderings_Olinorder(A).
% 1.70/1.91  ** KEPT (pick-wt=4): 11 [] -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Olordered__ab__group__abs(A).
% 1.70/1.91  
% 1.70/1.91  ------------> process sos:
% 1.70/1.91  ** KEPT (pick-wt=2): 13 [] class_Ring__and__Field_Oordered__idom(t_b).
% 1.70/1.91  
% 1.70/1.91  ======= end of input processing =======
% 1.70/1.91  
% 1.70/1.91  =========== start of search ===========
% 1.70/1.91  
% 1.70/1.91  -------- PROOF -------- 
% 1.70/1.91  
% 1.70/1.91  ----> UNIT CONFLICT at   0.00 sec ----> 99 [binary,98.1,7.1] $F.
% 1.70/1.91  
% 1.70/1.91  Length of proof is 10.  Level of proof is 6.
% 1.70/1.91  
% 1.70/1.91  ---------------- PROOF ----------------
% 1.70/1.91  % SZS status Unsatisfiable
% 1.70/1.91  % SZS output start Refutation
% See solution above
% 1.70/1.91  ------------ end of proof -------------
% 1.70/1.91  
% 1.70/1.91  
% 1.70/1.91  Search stopped by max_proofs option.
% 1.70/1.91  
% 1.70/1.91  
% 1.70/1.91  Search stopped by max_proofs option.
% 1.70/1.91  
% 1.70/1.91  ============ end of search ============
% 1.70/1.91  
% 1.70/1.91  -------------- statistics -------------
% 1.70/1.91  clauses given                 14
% 1.70/1.91  clauses generated            137
% 1.70/1.91  clauses kept                  98
% 1.70/1.91  clauses forward subsumed      50
% 1.70/1.91  clauses back subsumed          0
% 1.70/1.91  Kbytes malloced              976
% 1.70/1.91  
% 1.70/1.91  ----------- times (seconds) -----------
% 1.70/1.91  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.70/1.91  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.70/1.91  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.70/1.91  
% 1.70/1.91  That finishes the proof of the theorem.
% 1.70/1.91  
% 1.70/1.91  Process 25255 finished Wed Jul 27 09:56:56 2022
% 1.70/1.91  Otter interrupted
% 1.70/1.91  PROOF FOUND
%------------------------------------------------------------------------------