↑ Up

Otter---3.3.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : HEN001-5 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n021.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.68s 1.89s
% Output   : Refutation 1.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    1
%            Number of leaves      :    2
% Syntax   : Number of clauses     :    3 (   3 unt;   0 nHn;   2 RR)
%            Number of literals    :    3 (   2 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    2 (   1 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   :    1 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    divide(a,identity) != zero,
    file('HEN001-5.p',unknown),
    [] ).

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

cnf(12,plain,
    $false,
    inference(binary,[status(thm)],[10,2]),
    [iquote('binary,10.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : HEN001-5 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : otter-tptp-script %s
% 0.13/0.33  % Computer : n021.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 08:53:08 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.68/1.89  
% 1.68/1.89  -------- PROOF -------- 
% 1.68/1.89  ----- Otter 3.3f, August 2004 -----
% 1.68/1.89  The process was started by sandbox2 on n021.cluster.edu,
% 1.68/1.89  Wed Jul 27 08:53:08 2022
% 1.68/1.89  The command was "./otter".  The process ID is 11965.
% 1.68/1.89  
% 1.68/1.89  set(prolog_style_variables).
% 1.68/1.89  set(auto).
% 1.68/1.89     dependent: set(auto1).
% 1.68/1.89     dependent: set(process_input).
% 1.68/1.89     dependent: clear(print_kept).
% 1.68/1.89     dependent: clear(print_new_demod).
% 1.68/1.89     dependent: clear(print_back_demod).
% 1.68/1.89     dependent: clear(print_back_sub).
% 1.68/1.89     dependent: set(control_memory).
% 1.68/1.89     dependent: assign(max_mem, 12000).
% 1.68/1.89     dependent: assign(pick_given_ratio, 4).
% 1.68/1.89     dependent: assign(stats_level, 1).
% 1.68/1.89     dependent: assign(max_seconds, 10800).
% 1.68/1.89  clear(print_given).
% 1.68/1.89  
% 1.68/1.89  list(usable).
% 1.68/1.89  0 [] A=A.
% 1.68/1.89  0 [] divide(divide(X,Y),X)=zero.
% 1.68/1.89  0 [] divide(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z))=zero.
% 1.68/1.89  0 [] divide(zero,X)=zero.
% 1.68/1.89  0 [] divide(X,Y)!=zero|divide(Y,X)!=zero|X=Y.
% 1.68/1.89  0 [] divide(X,identity)=zero.
% 1.68/1.89  0 [] divide(a,identity)!=zero.
% 1.68/1.89  end_of_list.
% 1.68/1.89  
% 1.68/1.89  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.68/1.89  
% 1.68/1.89  This is a Horn set with equality.  The strategy will be
% 1.68/1.89  Knuth-Bendix and hyper_res, with positive clauses in
% 1.68/1.89  sos and nonpositive clauses in usable.
% 1.68/1.89  
% 1.68/1.89     dependent: set(knuth_bendix).
% 1.68/1.89     dependent: set(anl_eq).
% 1.68/1.89     dependent: set(para_from).
% 1.68/1.89     dependent: set(para_into).
% 1.68/1.89     dependent: clear(para_from_right).
% 1.68/1.89     dependent: clear(para_into_right).
% 1.68/1.89     dependent: set(para_from_vars).
% 1.68/1.89     dependent: set(eq_units_both_ways).
% 1.68/1.89     dependent: set(dynamic_demod_all).
% 1.68/1.89     dependent: set(dynamic_demod).
% 1.68/1.89     dependent: set(order_eq).
% 1.68/1.89     dependent: set(back_demod).
% 1.68/1.89     dependent: set(lrpo).
% 1.68/1.89     dependent: set(hyper_res).
% 1.68/1.89     dependent: clear(order_hyper).
% 1.68/1.89  
% 1.68/1.89  ------------> process usable:
% 1.68/1.89  ** KEPT (pick-wt=13): 1 [] divide(A,B)!=zero|divide(B,A)!=zero|A=B.
% 1.68/1.89  ** KEPT (pick-wt=5): 2 [] divide(a,identity)!=zero.
% 1.68/1.89  
% 1.68/1.89  ------------> process sos:
% 1.68/1.89  ** KEPT (pick-wt=3): 3 [] A=A.
% 1.68/1.89  ** KEPT (pick-wt=7): 4 [] divide(divide(A,B),A)=zero.
% 1.68/1.89  ---> New Demodulator: 5 [new_demod,4] divide(divide(A,B),A)=zero.
% 1.68/1.89  ** KEPT (pick-wt=15): 6 [] divide(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B))=zero.
% 1.68/1.89  ---> New Demodulator: 7 [new_demod,6] divide(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B))=zero.
% 1.68/1.89  ** KEPT (pick-wt=5): 8 [] divide(zero,A)=zero.
% 1.68/1.89  ---> New Demodulator: 9 [new_demod,8] divide(zero,A)=zero.
% 1.68/1.89  ** KEPT (pick-wt=5): 10 [] divide(A,identity)=zero.
% 1.68/1.89  ---> New Demodulator: 11 [new_demod,10] divide(A,identity)=zero.
% 1.68/1.89  
% 1.68/1.89  ----> UNIT CONFLICT at   0.00 sec ----> 12 [binary,10.1,2.1] $F.
% 1.68/1.89  
% 1.68/1.89  Length of proof is 0.  Level of proof is 0.
% 1.68/1.89  
% 1.68/1.89  ---------------- PROOF ----------------
% 1.68/1.89  % SZS status Unsatisfiable
% 1.68/1.89  % SZS output start Refutation
% See solution above
% 1.68/1.89  ------------ end of proof -------------
% 1.68/1.89  
% 1.68/1.89  
% 1.68/1.89  Search stopped by max_proofs option.
% 1.68/1.89  
% 1.68/1.89  
% 1.68/1.89  Search stopped by max_proofs option.
% 1.68/1.89  
% 1.68/1.89  ============ end of search ============
% 1.68/1.89  
% 1.68/1.89  -------------- statistics -------------
% 1.68/1.89  clauses given                  0
% 1.68/1.89  clauses generated              0
% 1.68/1.89  clauses kept                   7
% 1.68/1.89  clauses forward subsumed       0
% 1.68/1.89  clauses back subsumed          0
% 1.68/1.89  Kbytes malloced              976
% 1.68/1.89  
% 1.68/1.89  ----------- times (seconds) -----------
% 1.68/1.89  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.68/1.89  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.68/1.89  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.68/1.89  
% 1.68/1.89  That finishes the proof of the theorem.
% 1.68/1.89  
% 1.68/1.89  Process 11965 finished Wed Jul 27 08:53:09 2022
% 1.68/1.89  Otter interrupted
% 1.68/1.89  PROOF FOUND
%------------------------------------------------------------------------------