TSTP Solution File: HEN001-3 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : HEN001-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n016.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:53 EDT 2022

% Result   : Unsatisfiable 1.70s 1.91s
% Output   : Refutation 1.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    5 (   4 unt;   0 nHn;   3 RR)
%            Number of literals    :    6 (   3 equ;   2 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :    4 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ less_e_qual(A,B)
    | divide(A,B) = zero ),
    file('HEN001-3.p',unknown),
    [] ).

cnf(4,axiom,
    divide(a,identity) != zero,
    file('HEN001-3.p',unknown),
    [] ).

cnf(9,axiom,
    less_e_qual(A,identity),
    file('HEN001-3.p',unknown),
    [] ).

cnf(13,plain,
    divide(A,identity) = zero,
    inference(hyper,[status(thm)],[9,1]),
    [iquote('hyper,9,1')] ).

cnf(15,plain,
    $false,
    inference(binary,[status(thm)],[13,4]),
    [iquote('binary,13.1,4.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem  : HEN001-3 : TPTP v8.1.0. Released v1.0.0.
% 0.09/0.11  % Command  : otter-tptp-script %s
% 0.11/0.32  % Computer : n016.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Wed Jul 27 09:20:22 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 1.70/1.91  ----- Otter 3.3f, August 2004 -----
% 1.70/1.91  The process was started by sandbox2 on n016.cluster.edu,
% 1.70/1.91  Wed Jul 27 09:20:22 2022
% 1.70/1.91  The command was "./otter".  The process ID is 12271.
% 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 [] A=A.
% 1.70/1.91  0 [] -less_e_qual(X,Y)|divide(X,Y)=zero.
% 1.70/1.91  0 [] divide(X,Y)!=zero|less_e_qual(X,Y).
% 1.70/1.91  0 [] less_e_qual(divide(X,Y),X).
% 1.70/1.91  0 [] less_e_qual(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)).
% 1.70/1.91  0 [] less_e_qual(zero,X).
% 1.70/1.91  0 [] -less_e_qual(X,Y)| -less_e_qual(Y,X)|X=Y.
% 1.70/1.91  0 [] less_e_qual(X,identity).
% 1.70/1.91  0 [] divide(a,identity)!=zero.
% 1.70/1.91  end_of_list.
% 1.70/1.91  
% 1.70/1.91  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.70/1.91  
% 1.70/1.91  This is a Horn set with equality.  The strategy will be
% 1.70/1.91  Knuth-Bendix and hyper_res, with positive clauses in
% 1.70/1.91  sos and nonpositive clauses in usable.
% 1.70/1.91  
% 1.70/1.91     dependent: set(knuth_bendix).
% 1.70/1.91     dependent: set(anl_eq).
% 1.70/1.91     dependent: set(para_from).
% 1.70/1.91     dependent: set(para_into).
% 1.70/1.91     dependent: clear(para_from_right).
% 1.70/1.91     dependent: clear(para_into_right).
% 1.70/1.91     dependent: set(para_from_vars).
% 1.70/1.91     dependent: set(eq_units_both_ways).
% 1.70/1.91     dependent: set(dynamic_demod_all).
% 1.70/1.91     dependent: set(dynamic_demod).
% 1.70/1.91     dependent: set(order_eq).
% 1.70/1.91     dependent: set(back_demod).
% 1.70/1.91     dependent: set(lrpo).
% 1.70/1.91     dependent: set(hyper_res).
% 1.70/1.91     dependent: clear(order_hyper).
% 1.70/1.91  
% 1.70/1.91  ------------> process usable:
% 1.70/1.91  ** KEPT (pick-wt=8): 1 [] -less_e_qual(A,B)|divide(A,B)=zero.
% 1.70/1.91  ** KEPT (pick-wt=8): 2 [] divide(A,B)!=zero|less_e_qual(A,B).
% 1.70/1.91  ** KEPT (pick-wt=9): 3 [] -less_e_qual(A,B)| -less_e_qual(B,A)|A=B.
% 1.70/1.91  ** KEPT (pick-wt=5): 4 [] divide(a,identity)!=zero.
% 1.70/1.91  
% 1.70/1.91  ------------> process sos:
% 1.70/1.91  ** KEPT (pick-wt=3): 5 [] A=A.
% 1.70/1.91  ** KEPT (pick-wt=5): 6 [] less_e_qual(divide(A,B),A).
% 1.70/1.91  ** KEPT (pick-wt=13): 7 [] less_e_qual(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)).
% 1.70/1.91  ** KEPT (pick-wt=3): 8 [] less_e_qual(zero,A).
% 1.70/1.91  ** KEPT (pick-wt=3): 9 [] less_e_qual(A,identity).
% 1.70/1.91    Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] A=A.
% 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 ----> 15 [binary,13.1,4.1] $F.
% 1.70/1.91  
% 1.70/1.91  Length of proof is 1.  Level of proof is 1.
% 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                  3
% 1.70/1.91  clauses generated              7
% 1.70/1.91  clauses kept                  12
% 1.70/1.91  clauses forward subsumed       5
% 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        2             (0 hr, 0 min, 2 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 12271 finished Wed Jul 27 09:20:24 2022
% 1.70/1.91  Otter interrupted
% 1.70/1.91  PROOF FOUND
%------------------------------------------------------------------------------