TSTP Solution File: HEN009-5 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : HEN009-5 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n006.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:57:59 EDT 2022

% Result   : Unsatisfiable 2.76s 2.95s
% Output   : Refutation 2.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   20 (  17 unt;   0 nHn;   5 RR)
%            Number of literals    :   24 (  23 equ;   6 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   32 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( divide(A,B) != zero
    | divide(B,A) != zero
    | A = B ),
    file('HEN009-5.p',unknown),
    [] ).

cnf(3,axiom,
    ( divide(divide(A,B),C) != zero
    | divide(divide(A,C),B) = zero ),
    file('HEN009-5.p',unknown),
    [] ).

cnf(4,axiom,
    ( divide(A,B) != zero
    | divide(divide(C,B),divide(C,A)) = zero ),
    file('HEN009-5.p',unknown),
    [] ).

cnf(5,axiom,
    divide(identity,a) != divide(identity,divide(identity,divide(identity,a))),
    file('HEN009-5.p',unknown),
    [] ).

cnf(6,plain,
    divide(identity,divide(identity,divide(identity,a))) != divide(identity,a),
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[5])]),
    [iquote('copy,5,flip.1')] ).

cnf(8,axiom,
    divide(divide(A,B),A) = zero,
    file('HEN009-5.p',unknown),
    [] ).

cnf(10,axiom,
    divide(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)) = zero,
    file('HEN009-5.p',unknown),
    [] ).

cnf(13,axiom,
    divide(zero,A) = zero,
    file('HEN009-5.p',unknown),
    [] ).

cnf(14,axiom,
    divide(A,identity) = zero,
    file('HEN009-5.p',unknown),
    [] ).

cnf(27,plain,
    divide(divide(A,A),B) = zero,
    inference(hyper,[status(thm)],[8,3]),
    [iquote('hyper,8,3')] ).

cnf(39,plain,
    divide(A,A) = zero,
    inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[27,1,13])]),
    [iquote('hyper,27,1,12,flip.1')] ).

cnf(63,plain,
    divide(divide(divide(A,B),divide(identity,B)),zero) = zero,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[10,14]),13]),
    [iquote('para_into,10.1.1.2.1,14.1.1,demod,13')] ).

cnf(84,plain,
    divide(divide(A,divide(A,B)),B) = zero,
    inference(hyper,[status(thm)],[39,3]),
    [iquote('hyper,39,3')] ).

cnf(133,plain,
    divide(divide(A,B),divide(A,divide(C,divide(C,B)))) = zero,
    inference(hyper,[status(thm)],[84,4]),
    [iquote('hyper,84,4')] ).

cnf(151,plain,
    divide(A,divide(A,zero)) = zero,
    inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[84,1,13])]),
    [iquote('hyper,84,1,12,flip.1')] ).

cnf(197,plain,
    divide(A,zero) = A,
    inference(hyper,[status(thm)],[151,1,8]),
    [iquote('hyper,151,1,8')] ).

cnf(242,plain,
    divide(divide(A,B),divide(identity,B)) = zero,
    inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[63]),197]),
    [iquote('back_demod,63,demod,197')] ).

cnf(258,plain,
    divide(divide(A,divide(identity,B)),B) = zero,
    inference(hyper,[status(thm)],[242,3]),
    [iquote('hyper,242,3')] ).

cnf(3137,plain,
    divide(identity,divide(identity,divide(identity,A))) = divide(identity,A),
    inference(hyper,[status(thm)],[133,1,258]),
    [iquote('hyper,133,1,258')] ).

cnf(3139,plain,
    $false,
    inference(binary,[status(thm)],[3137,6]),
    [iquote('binary,3137.1,6.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : HEN009-5 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.12  % Command  : otter-tptp-script %s
% 0.12/0.32  % Computer : n006.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Wed Jul 27 08:56:16 EDT 2022
% 0.18/0.33  % CPUTime  : 
% 2.76/2.95  ----- Otter 3.3f, August 2004 -----
% 2.76/2.95  The process was started by sandbox2 on n006.cluster.edu,
% 2.76/2.95  Wed Jul 27 08:56:17 2022
% 2.76/2.95  The command was "./otter".  The process ID is 28303.
% 2.76/2.95  
% 2.76/2.95  set(prolog_style_variables).
% 2.76/2.95  set(auto).
% 2.76/2.95     dependent: set(auto1).
% 2.76/2.95     dependent: set(process_input).
% 2.76/2.95     dependent: clear(print_kept).
% 2.76/2.95     dependent: clear(print_new_demod).
% 2.76/2.95     dependent: clear(print_back_demod).
% 2.76/2.95     dependent: clear(print_back_sub).
% 2.76/2.95     dependent: set(control_memory).
% 2.76/2.95     dependent: assign(max_mem, 12000).
% 2.76/2.95     dependent: assign(pick_given_ratio, 4).
% 2.76/2.95     dependent: assign(stats_level, 1).
% 2.76/2.95     dependent: assign(max_seconds, 10800).
% 2.76/2.95  clear(print_given).
% 2.76/2.95  
% 2.76/2.95  list(usable).
% 2.76/2.95  0 [] A=A.
% 2.76/2.95  0 [] divide(divide(X,Y),X)=zero.
% 2.76/2.95  0 [] divide(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z))=zero.
% 2.76/2.95  0 [] divide(zero,X)=zero.
% 2.76/2.95  0 [] divide(X,Y)!=zero|divide(Y,X)!=zero|X=Y.
% 2.76/2.95  0 [] divide(X,identity)=zero.
% 2.76/2.95  0 [] divide(X,Y)!=zero|divide(Y,Z)!=zero|divide(X,Z)=zero.
% 2.76/2.95  0 [] divide(divide(X,Y),Z)!=zero|divide(divide(X,Z),Y)=zero.
% 2.76/2.95  0 [] divide(X,Y)!=zero|divide(divide(Z,Y),divide(Z,X))=zero.
% 2.76/2.95  0 [] divide(identity,a)!=divide(identity,divide(identity,divide(identity,a))).
% 2.76/2.95  end_of_list.
% 2.76/2.95  
% 2.76/2.95  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 2.76/2.95  
% 2.76/2.95  This is a Horn set with equality.  The strategy will be
% 2.76/2.95  Knuth-Bendix and hyper_res, with positive clauses in
% 2.76/2.95  sos and nonpositive clauses in usable.
% 2.76/2.95  
% 2.76/2.95     dependent: set(knuth_bendix).
% 2.76/2.95     dependent: set(anl_eq).
% 2.76/2.95     dependent: set(para_from).
% 2.76/2.95     dependent: set(para_into).
% 2.76/2.95     dependent: clear(para_from_right).
% 2.76/2.95     dependent: clear(para_into_right).
% 2.76/2.95     dependent: set(para_from_vars).
% 2.76/2.95     dependent: set(eq_units_both_ways).
% 2.76/2.95     dependent: set(dynamic_demod_all).
% 2.76/2.95     dependent: set(dynamic_demod).
% 2.76/2.95     dependent: set(order_eq).
% 2.76/2.95     dependent: set(back_demod).
% 2.76/2.95     dependent: set(lrpo).
% 2.76/2.95     dependent: set(hyper_res).
% 2.76/2.95     dependent: clear(order_hyper).
% 2.76/2.95  
% 2.76/2.95  ------------> process usable:
% 2.76/2.95  ** KEPT (pick-wt=13): 1 [] divide(A,B)!=zero|divide(B,A)!=zero|A=B.
% 2.76/2.95  ** KEPT (pick-wt=15): 2 [] divide(A,B)!=zero|divide(B,C)!=zero|divide(A,C)=zero.
% 2.76/2.95  ** KEPT (pick-wt=14): 3 [] divide(divide(A,B),C)!=zero|divide(divide(A,C),B)=zero.
% 2.76/2.95  ** KEPT (pick-wt=14): 4 [] divide(A,B)!=zero|divide(divide(C,B),divide(C,A))=zero.
% 2.76/2.95  ** KEPT (pick-wt=11): 6 [copy,5,flip.1] divide(identity,divide(identity,divide(identity,a)))!=divide(identity,a).
% 2.76/2.95  
% 2.76/2.95  ------------> process sos:
% 2.76/2.95  ** KEPT (pick-wt=3): 7 [] A=A.
% 2.76/2.95  ** KEPT (pick-wt=7): 8 [] divide(divide(A,B),A)=zero.
% 2.76/2.95  ---> New Demodulator: 9 [new_demod,8] divide(divide(A,B),A)=zero.
% 2.76/2.95  ** KEPT (pick-wt=15): 10 [] divide(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B))=zero.
% 2.76/2.95  ---> New Demodulator: 11 [new_demod,10] divide(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B))=zero.
% 2.76/2.95  ** KEPT (pick-wt=5): 12 [] divide(zero,A)=zero.
% 2.76/2.95  ---> New Demodulator: 13 [new_demod,12] divide(zero,A)=zero.
% 2.76/2.95  ** KEPT (pick-wt=5): 14 [] divide(A,identity)=zero.
% 2.76/2.95  ---> New Demodulator: 15 [new_demod,14] divide(A,identity)=zero.
% 2.76/2.95    Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] A=A.
% 2.76/2.95  >>>> Starting back demodulation with 9.
% 2.76/2.95  >>>> Starting back demodulation with 11.
% 2.76/2.95  >>>> Starting back demodulation with 13.
% 2.76/2.95  >>>> Starting back demodulation with 15.
% 2.76/2.95  
% 2.76/2.95  ======= end of input processing =======
% 2.76/2.95  
% 2.76/2.95  =========== start of search ===========
% 2.76/2.95  
% 2.76/2.95  -------- PROOF -------- 
% 2.76/2.95  
% 2.76/2.95  ----> UNIT CONFLICT at   0.85 sec ----> 3139 [binary,3137.1,6.1] $F.
% 2.76/2.95  
% 2.76/2.95  Length of proof is 11.  Level of proof is 8.
% 2.76/2.95  
% 2.76/2.95  ---------------- PROOF ----------------
% 2.76/2.95  % SZS status Unsatisfiable
% 2.76/2.95  % SZS output start Refutation
% See solution above
% 2.76/2.95  ------------ end of proof -------------
% 2.76/2.95  
% 2.76/2.95  
% 2.76/2.95  Search stopped by max_proofs option.
% 2.76/2.95  
% 2.76/2.95  
% 2.76/2.95  Search stopped by max_proofs option.
% 2.76/2.95  
% 2.76/2.95  ============ end of search ============
% 2.76/2.95  
% 2.76/2.95  -------------- statistics -------------
% 2.76/2.95  clauses given                 82
% 2.76/2.95  clauses generated          15284
% 2.76/2.95  clauses kept                2499
% 2.76/2.95  clauses forward subsumed   11436
% 2.76/2.95  clauses back subsumed        276
% 2.76/2.95  Kbytes malloced             3906
% 2.76/2.95  
% 2.76/2.95  ----------- times (seconds) -----------
% 2.76/2.95  user CPU time          0.85          (0 hr, 0 min, 0 sec)
% 2.76/2.95  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 2.76/2.95  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 2.76/2.95  
% 2.76/2.95  That finishes the proof of the theorem.
% 2.76/2.95  
% 2.76/2.95  Process 28303 finished Wed Jul 27 08:56:19 2022
% 2.76/2.95  Otter interrupted
% 2.76/2.95  PROOF FOUND
%------------------------------------------------------------------------------