TSTP Solution File: SWV487+1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SWV487+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n027.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 13:20:53 EDT 2022

% Result   : Unknown 245.60s 245.80s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWV487+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n027.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Wed Jul 27 06:09:51 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.71/1.95  ----- Otter 3.3f, August 2004 -----
% 1.71/1.95  The process was started by sandbox on n027.cluster.edu,
% 1.71/1.95  Wed Jul 27 06:09:51 2022
% 1.71/1.95  The command was "./otter".  The process ID is 7211.
% 1.71/1.95  
% 1.71/1.95  set(prolog_style_variables).
% 1.71/1.95  set(auto).
% 1.71/1.95     dependent: set(auto1).
% 1.71/1.95     dependent: set(process_input).
% 1.71/1.95     dependent: clear(print_kept).
% 1.71/1.95     dependent: clear(print_new_demod).
% 1.71/1.95     dependent: clear(print_back_demod).
% 1.71/1.95     dependent: clear(print_back_sub).
% 1.71/1.95     dependent: set(control_memory).
% 1.71/1.95     dependent: assign(max_mem, 12000).
% 1.71/1.95     dependent: assign(pick_given_ratio, 4).
% 1.71/1.95     dependent: assign(stats_level, 1).
% 1.71/1.95     dependent: assign(max_seconds, 10800).
% 1.71/1.95  clear(print_given).
% 1.71/1.95  
% 1.71/1.95  formula_list(usable).
% 1.71/1.95  all A (A=A).
% 1.71/1.95  all I J (int_le_q(I,J)<->int_less(I,J)|I=J).
% 1.71/1.95  all I J K (int_less(I,J)&int_less(J,K)->int_less(I,K)).
% 1.71/1.95  all I J (int_less(I,J)->I!=J).
% 1.71/1.95  all I J (int_less(I,J)|int_le_q(J,I)).
% 1.71/1.95  int_less(int_zero,int_one).
% 1.71/1.95  all I J (plus(I,J)=plus(J,I)).
% 1.71/1.95  all I (plus(I,int_zero)=I).
% 1.71/1.95  all I1 J1 I2 J2 (int_less(I1,J1)&int_le_q(I2,J2)->int_le_q(plus(I1,I2),plus(J1,J2))).
% 1.71/1.95  all I J (int_less(I,J)<-> (exists K (plus(I,K)=J&int_less(int_zero,K)))).
% 1.71/1.95  all I (int_less(int_zero,I)<->int_le_q(int_one,I)).
% 1.71/1.95  real_zero!=real_one.
% 1.71/1.95  all I J (int_le_q(int_one,I)&int_le_q(I,n)&int_le_q(int_one,J)&int_le_q(J,n)-> (all C (int_less(int_zero,C)&I=plus(J,C)-> (all K (int_le_q(int_one,K)&int_le_q(K,J)->a(plus(K,C),K)=real_zero))))& (all C (int_le_q(int_zero,C)&J=plus(I,C)-> (all K (int_le_q(int_one,K)&int_le_q(K,I)->a(K,plus(K,C))=lu(K,plus(K,C))))))).
% 1.71/1.95  -(all I J (int_le_q(int_one,J)&int_less(J,I)&int_le_q(I,n)->a(I,J)=real_zero)).
% 1.71/1.95  end_of_list.
% 1.71/1.95  
% 1.71/1.95  -------> usable clausifies to:
% 1.71/1.95  
% 1.71/1.95  list(usable).
% 1.71/1.95  0 [] A=A.
% 1.71/1.95  0 [] -int_le_q(I,J)|int_less(I,J)|I=J.
% 1.71/1.95  0 [] int_le_q(I,J)| -int_less(I,J).
% 1.71/1.95  0 [] int_le_q(I,J)|I!=J.
% 1.71/1.95  0 [] -int_less(I,J)| -int_less(J,K)|int_less(I,K).
% 1.71/1.95  0 [] -int_less(I,J)|I!=J.
% 1.71/1.95  0 [] int_less(I,J)|int_le_q(J,I).
% 1.71/1.95  0 [] int_less(int_zero,int_one).
% 1.71/1.95  0 [] plus(I,J)=plus(J,I).
% 1.71/1.95  0 [] plus(I,int_zero)=I.
% 1.71/1.95  0 [] -int_less(I1,J1)| -int_le_q(I2,J2)|int_le_q(plus(I1,I2),plus(J1,J2)).
% 1.71/1.95  0 [] -int_less(I,J)|plus(I,$f1(I,J))=J.
% 1.71/1.95  0 [] -int_less(I,J)|int_less(int_zero,$f1(I,J)).
% 1.71/1.95  0 [] int_less(I,J)|plus(I,K)!=J| -int_less(int_zero,K).
% 1.71/1.95  0 [] -int_less(int_zero,I)|int_le_q(int_one,I).
% 1.71/1.95  0 [] int_less(int_zero,I)| -int_le_q(int_one,I).
% 1.71/1.95  0 [] real_zero!=real_one.
% 1.71/1.95  0 [] -int_le_q(int_one,I)| -int_le_q(I,n)| -int_le_q(int_one,J)| -int_le_q(J,n)| -int_less(int_zero,C)|I!=plus(J,C)| -int_le_q(int_one,K)| -int_le_q(K,J)|a(plus(K,C),K)=real_zero.
% 1.71/1.95  0 [] -int_le_q(int_one,I)| -int_le_q(I,n)| -int_le_q(int_one,J)| -int_le_q(J,n)| -int_le_q(int_zero,X1)|J!=plus(I,X1)| -int_le_q(int_one,X2)| -int_le_q(X2,I)|a(X2,plus(X2,X1))=lu(X2,plus(X2,X1)).
% 1.71/1.95  0 [] int_le_q(int_one,$c1).
% 1.71/1.95  0 [] int_less($c1,$c2).
% 1.71/1.95  0 [] int_le_q($c2,n).
% 1.71/1.95  0 [] a($c2,$c1)!=real_zero.
% 1.71/1.95  end_of_list.
% 1.71/1.95  
% 1.71/1.95  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 1.71/1.95  
% 1.71/1.95  This ia a non-Horn set with equality.  The strategy will be
% 1.71/1.95  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.71/1.95  deletion, with positive clauses in sos and nonpositive
% 1.71/1.95  clauses in usable.
% 1.71/1.95  
% 1.71/1.95     dependent: set(knuth_bendix).
% 1.71/1.95     dependent: set(anl_eq).
% 1.71/1.95     dependent: set(para_from).
% 1.71/1.95     dependent: set(para_into).
% 1.71/1.95     dependent: clear(para_from_right).
% 1.71/1.95     dependent: clear(para_into_right).
% 1.71/1.95     dependent: set(para_from_vars).
% 1.71/1.95     dependent: set(eq_units_both_ways).
% 1.71/1.95     dependent: set(dynamic_demod_all).
% 1.71/1.95     dependent: set(dynamic_demod).
% 1.71/1.95     dependent: set(order_eq).
% 1.71/1.95     dependent: set(back_demod).
% 1.71/1.95     dependent: set(lrpo).
% 1.71/1.95     dependent: set(hyper_res).
% 1.71/1.95     dependent: set(unit_deletion).
% 1.71/1.95     dependent: set(factor).
% 1.71/1.95  
% 1.71/1.95  ------------> process usable:
% 1.71/1.95  ** KEPT (pick-wt=9): 1 [] -int_le_q(A,B)|int_less(A,B)|A=B.
% 1.71/1.95  ** KEPT (pick-wt=6): 2 [] int_le_q(A,B)| -int_less(A,B).
% 1.71/1.95  ** KEPT (pick-wt=6): 3 [] int_le_q(A,B)|A!=B.
% 1.71/1.95  ** KEPT (pick-wt=9): 4 [] -int_less(A,B)| -int_less(B,C)|int_less(A,C).
% 1.71/1.95  ** KEPT (pick-wt=6): 5 [] -int_less(A,B)|A!=B.
% 1.71/1.95  ** KEPT (pick-wt=13): 6 [] -int_less(A,B)| -int_le_q(C,D)|int_le_q(plus(A,C),plus(B,D)).
% 1.71/1.95  ** KEPT (pick-wt=10): 7 [] -int_less(A,B)|plus(A,$f1(A,B))=B.
% 1.71/1.95  ** KEPT (pick-wt=8): 8 [] -int_less(A,B)|int_less(int_zero,$f1(A,B)).
% 1.71/1.95  ** KEPT (pick-wt=11): 9 [] int_less(A,B)|plus(A,C)!=B| -int_less(int_zero,C).
% 245.60/245.80  ** KEPT (pick-wt=6): 10 [] -int_less(int_zero,A)|int_le_q(int_one,A).
% 245.60/245.80  ** KEPT (pick-wt=6): 11 [] int_less(int_zero,A)| -int_le_q(int_one,A).
% 245.60/245.80  ** KEPT (pick-wt=3): 12 [] real_zero!=real_one.
% 245.60/245.80  ** KEPT (pick-wt=33): 13 [] -int_le_q(int_one,A)| -int_le_q(A,n)| -int_le_q(int_one,B)| -int_le_q(B,n)| -int_less(int_zero,C)|A!=plus(B,C)| -int_le_q(int_one,D)| -int_le_q(D,B)|a(plus(D,C),D)=real_zero.
% 245.60/245.80  ** KEPT (pick-wt=37): 15 [copy,14,flip.9] -int_le_q(int_one,A)| -int_le_q(A,n)| -int_le_q(int_one,B)| -int_le_q(B,n)| -int_le_q(int_zero,C)|B!=plus(A,C)| -int_le_q(int_one,D)| -int_le_q(D,A)|lu(D,plus(D,C))=a(D,plus(D,C)).
% 245.60/245.80  ** KEPT (pick-wt=5): 16 [] a($c2,$c1)!=real_zero.
% 245.60/245.80  
% 245.60/245.80  ------------> process sos:
% 245.60/245.80  ** KEPT (pick-wt=3): 83 [] A=A.
% 245.60/245.80  ** KEPT (pick-wt=6): 84 [] int_less(A,B)|int_le_q(B,A).
% 245.60/245.80  ** KEPT (pick-wt=3): 85 [] int_less(int_zero,int_one).
% 245.60/245.80  ** KEPT (pick-wt=7): 86 [] plus(A,B)=plus(B,A).
% 245.60/245.80  ** KEPT (pick-wt=5): 87 [] plus(A,int_zero)=A.
% 245.60/245.80  ---> New Demodulator: 88 [new_demod,87] plus(A,int_zero)=A.
% 245.60/245.80  ** KEPT (pick-wt=3): 89 [] int_le_q(int_one,$c1).
% 245.60/245.80  ** KEPT (pick-wt=3): 90 [] int_less($c1,$c2).
% 245.60/245.80  ** KEPT (pick-wt=3): 91 [] int_le_q($c2,n).
% 245.60/245.80    Following clause subsumed by 83 during input processing: 0 [copy,83,flip.1] A=A.
% 245.60/245.80    Following clause subsumed by 86 during input processing: 0 [copy,86,flip.1] plus(A,B)=plus(B,A).
% 245.60/245.80  >>>> Starting back demodulation with 88.
% 245.60/245.80      >> back demodulating 81 with 88.
% 245.60/245.80      >> back demodulating 65 with 88.
% 245.60/245.80  
% 245.60/245.80  ======= end of input processing =======
% 245.60/245.80  
% 245.60/245.80  =========== start of search ===========
% 245.60/245.80  
% 245.60/245.80  Search stopped in tp_alloc by max_mem option.
% 245.60/245.80  
% 245.60/245.80  Search stopped in tp_alloc by max_mem option.
% 245.60/245.80  
% 245.60/245.80  ============ end of search ============
% 245.60/245.80  
% 245.60/245.80  -------------- statistics -------------
% 245.60/245.80  clauses given                 90
% 245.60/245.80  clauses generated        1177060
% 245.60/245.80  clauses kept               12913
% 245.60/245.80  clauses forward subsumed 1164238
% 245.60/245.80  clauses back subsumed        111
% 245.60/245.80  Kbytes malloced            11718
% 245.60/245.80  
% 245.60/245.80  ----------- times (seconds) -----------
% 245.60/245.80  user CPU time        243.87          (0 hr, 4 min, 3 sec)
% 245.60/245.80  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 245.60/245.80  wall-clock time      246             (0 hr, 4 min, 6 sec)
% 245.60/245.80  
% 245.60/245.80  Process 7211 finished Wed Jul 27 06:13:57 2022
% 245.60/245.80  Otter interrupted
% 245.60/245.80  PROOF NOT FOUND
%------------------------------------------------------------------------------