TSTP Solution File: ANA006-1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : ANA006-1 : TPTP v8.1.0. Released v2.5.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:46:42 EDT 2022

% Result   : Unknown 45.48s 45.65s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : ANA006-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.12  % Command  : otter-tptp-script %s
% 0.11/0.33  % Computer : n016.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 300
% 0.11/0.33  % DateTime : Wed Jul 27 10:20:07 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 45.39/45.65  ----- Otter 3.3f, August 2004 -----
% 45.39/45.65  The process was started by sandbox on n016.cluster.edu,
% 45.39/45.65  Wed Jul 27 10:20:07 2022
% 45.39/45.65  The command was "./otter".  The process ID is 19193.
% 45.39/45.65  
% 45.39/45.65  set(prolog_style_variables).
% 45.39/45.65  set(auto).
% 45.39/45.65     dependent: set(auto1).
% 45.39/45.65     dependent: set(process_input).
% 45.39/45.65     dependent: clear(print_kept).
% 45.39/45.65     dependent: clear(print_new_demod).
% 45.39/45.65     dependent: clear(print_back_demod).
% 45.39/45.65     dependent: clear(print_back_sub).
% 45.39/45.65     dependent: set(control_memory).
% 45.39/45.65     dependent: assign(max_mem, 12000).
% 45.39/45.65     dependent: assign(pick_given_ratio, 4).
% 45.39/45.65     dependent: assign(stats_level, 1).
% 45.39/45.65     dependent: assign(max_seconds, 10800).
% 45.39/45.65  clear(print_given).
% 45.39/45.65  
% 45.39/45.65  list(usable).
% 45.39/45.65  0 [] A=A.
% 45.39/45.65  0 [] add(X,n0)=X.
% 45.39/45.65  0 [] add(n0,X)=X.
% 45.39/45.65  0 [] -less_than(X,X).
% 45.39/45.65  0 [] -less_than(X,Y)| -less_than(Y,Z)|less_than(X,Z).
% 45.39/45.65  0 [] -less_than(n0,X)| -less_than(n0,Y)|less_than(n0,minimum(X,Y)).
% 45.39/45.65  0 [] -less_than(n0,X)| -less_than(n0,Y)|less_than(minimum(X,Y),X).
% 45.39/45.65  0 [] -less_than(n0,X)| -less_than(n0,Y)|less_than(minimum(X,Y),Y).
% 45.39/45.65  0 [] -less_than(X,half(Xa))| -less_than(Y,half(Xa))|less_than(add(X,Y),Xa).
% 45.39/45.65  0 [] -less_than(add(absolute(X),absolute(Y)),Xa)|less_than(absolute(add(X,Y)),Xa).
% 45.39/45.65  0 [] add(add(X,Y),Z)=add(X,add(Y,Z)).
% 45.39/45.65  0 [] add(X,Y)=add(Y,X).
% 45.39/45.65  0 [] -less_than(n0,Xa)|less_than(n0,half(Xa)).
% 45.39/45.65  0 [] -less_than(n0,Xa)|less_than(n0,half(Xa)).
% 45.39/45.65  0 [] minus(add(X,Y))=add(minus(X),minus(Y)).
% 45.39/45.65  end_of_list.
% 45.39/45.65  
% 45.39/45.65  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 45.39/45.65  
% 45.39/45.65  This is a Horn set with equality.  The strategy will be
% 45.39/45.65  Knuth-Bendix and hyper_res, with positive clauses in
% 45.39/45.65  sos and nonpositive clauses in usable.
% 45.39/45.65  
% 45.39/45.65     dependent: set(knuth_bendix).
% 45.39/45.65     dependent: set(anl_eq).
% 45.39/45.65     dependent: set(para_from).
% 45.39/45.65     dependent: set(para_into).
% 45.39/45.65     dependent: clear(para_from_right).
% 45.39/45.65     dependent: clear(para_into_right).
% 45.39/45.65     dependent: set(para_from_vars).
% 45.39/45.65     dependent: set(eq_units_both_ways).
% 45.39/45.65     dependent: set(dynamic_demod_all).
% 45.39/45.65     dependent: set(dynamic_demod).
% 45.39/45.65     dependent: set(order_eq).
% 45.39/45.65     dependent: set(back_demod).
% 45.39/45.65     dependent: set(lrpo).
% 45.39/45.65     dependent: set(hyper_res).
% 45.39/45.65     dependent: clear(order_hyper).
% 45.39/45.65  
% 45.39/45.65  ------------> process usable:
% 45.39/45.65  ** KEPT (pick-wt=3): 1 [] -less_than(A,A).
% 45.39/45.65  ** KEPT (pick-wt=9): 2 [] -less_than(A,B)| -less_than(B,C)|less_than(A,C).
% 45.39/45.65  ** KEPT (pick-wt=11): 3 [] -less_than(n0,A)| -less_than(n0,B)|less_than(n0,minimum(A,B)).
% 45.39/45.65  ** KEPT (pick-wt=11): 4 [] -less_than(n0,A)| -less_than(n0,B)|less_than(minimum(A,B),A).
% 45.39/45.65  ** KEPT (pick-wt=11): 5 [] -less_than(n0,A)| -less_than(n0,B)|less_than(minimum(A,B),B).
% 45.39/45.65  ** KEPT (pick-wt=13): 6 [] -less_than(A,half(B))| -less_than(C,half(B))|less_than(add(A,C),B).
% 45.39/45.65  ** KEPT (pick-wt=13): 7 [] -less_than(add(absolute(A),absolute(B)),C)|less_than(absolute(add(A,B)),C).
% 45.39/45.65  ** KEPT (pick-wt=7): 8 [] -less_than(n0,A)|less_than(n0,half(A)).
% 45.39/45.65    Following clause subsumed by 8 during input processing: 0 [] -less_than(n0,A)|less_than(n0,half(A)).
% 45.39/45.65  
% 45.39/45.65  ------------> process sos:
% 45.39/45.65  ** KEPT (pick-wt=3): 9 [] A=A.
% 45.39/45.65  ** KEPT (pick-wt=5): 10 [] add(A,n0)=A.
% 45.39/45.65  ---> New Demodulator: 11 [new_demod,10] add(A,n0)=A.
% 45.39/45.65  ** KEPT (pick-wt=5): 12 [] add(n0,A)=A.
% 45.39/45.65  ---> New Demodulator: 13 [new_demod,12] add(n0,A)=A.
% 45.39/45.65  ** KEPT (pick-wt=11): 14 [] add(add(A,B),C)=add(A,add(B,C)).
% 45.39/45.65  ---> New Demodulator: 15 [new_demod,14] add(add(A,B),C)=add(A,add(B,C)).
% 45.39/45.65  ** KEPT (pick-wt=7): 16 [] add(A,B)=add(B,A).
% 45.39/45.65  ** KEPT (pick-wt=10): 17 [] minus(add(A,B))=add(minus(A),minus(B)).
% 45.39/45.65  ---> New Demodulator: 18 [new_demod,17] minus(add(A,B))=add(minus(A),minus(B)).
% 45.39/45.65    Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] A=A.
% 45.39/45.65  >>>> Starting back demodulation with 11.
% 45.39/45.65  >>>> Starting back demodulation with 13.
% 45.39/45.65  >>>> Starting back demodulation with 15.
% 45.39/45.65    Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] add(A,B)=add(B,A).
% 45.39/45.65  >>>> Starting back demodulation with 18.
% 45.39/45.65  
% 45.39/45.65  ======= end of input processing =======
% 45.39/45.65  
% 45.39/45.65  =========== start of search ===========
% 45.39/45.65  
% 45.39/45.65  
% 45.39/45.65  Resetting weight limit to 19.
% 45.39/45.65  
% 45.39/45.65  
% 45.39/45.65  Resetting weight limit to 19.
% 45.39/45.65  
% 45.39/45.65  sos_size=2579
% 45.39/45.65  
% 45.39/45.65  Search stopped because sos empty.
% 45.39/45.65  
% 45.39/45.65  
% 45.39/45.65  Search stopped because sos empty.
% 45.39/45.65  
% 45.39/45.65  ============ end of search ============
% 45.39/45.65  
% 45.39/45.65  -------------- statistics -------------
% 45.39/45.65  clauses given               2696
% 45.39/45.65  clauses generated        10311319
% 45.39/45.65  clauses kept                2938
% 45.39/45.65  clauses forward subsumed   52390
% 45.39/45.65  clauses back subsumed          0
% 45.39/45.65  Kbytes malloced             5859
% 45.39/45.65  
% 45.39/45.65  ----------- times (seconds) -----------
% 45.39/45.65  user CPU time         43.75          (0 hr, 0 min, 43 sec)
% 45.39/45.65  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 45.39/45.65  wall-clock time       45             (0 hr, 0 min, 45 sec)
% 45.39/45.65  
% 45.39/45.65  Process 19193 finished Wed Jul 27 10:20:52 2022
% 45.39/45.65  Otter interrupted
% 45.39/45.65  PROOF NOT FOUND
%------------------------------------------------------------------------------