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

View Problem - Process Solution

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

% Computer : n008.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:40 EDT 2022

% Result   : Unknown 2.76s 2.95s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : GRP696-1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13  % Command  : otter-tptp-script %s
% 0.13/0.35  % Computer : n008.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Wed Jul 27 05:12:23 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 1.98/2.16  ----- Otter 3.3f, August 2004 -----
% 1.98/2.16  The process was started by sandbox on n008.cluster.edu,
% 1.98/2.16  Wed Jul 27 05:12:23 2022
% 1.98/2.16  The command was "./otter".  The process ID is 11625.
% 1.98/2.16  
% 1.98/2.16  set(prolog_style_variables).
% 1.98/2.16  set(auto).
% 1.98/2.16     dependent: set(auto1).
% 1.98/2.16     dependent: set(process_input).
% 1.98/2.16     dependent: clear(print_kept).
% 1.98/2.16     dependent: clear(print_new_demod).
% 1.98/2.16     dependent: clear(print_back_demod).
% 1.98/2.16     dependent: clear(print_back_sub).
% 1.98/2.16     dependent: set(control_memory).
% 1.98/2.16     dependent: assign(max_mem, 12000).
% 1.98/2.16     dependent: assign(pick_given_ratio, 4).
% 1.98/2.16     dependent: assign(stats_level, 1).
% 1.98/2.16     dependent: assign(max_seconds, 10800).
% 1.98/2.16  clear(print_given).
% 1.98/2.16  
% 1.98/2.16  list(usable).
% 1.98/2.16  0 [] A=A.
% 1.98/2.16  0 [] mult(A,ld(A,B))=B.
% 1.98/2.16  0 [] ld(A,mult(A,B))=B.
% 1.98/2.16  0 [] mult(rd(A,B),B)=A.
% 1.98/2.16  0 [] rd(mult(A,B),B)=A.
% 1.98/2.16  0 [] mult(A,unit)=A.
% 1.98/2.16  0 [] mult(unit,A)=A.
% 1.98/2.16  0 [] mult(A,i(mult(B,A)))=i(B).
% 1.98/2.16  0 [] mult(A,mult(B,C))=mult(rd(mult(A,B),A),mult(A,C)).
% 1.98/2.16  0 [] mult(mult(A,B),C)=mult(mult(A,C),ld(C,mult(B,C))).
% 1.98/2.16  0 [] mult(i(A),A)=unit.
% 1.98/2.16  0 [] mult(A,i(A))=unit.
% 1.98/2.16  0 [] mult(mult(mult(a,b),a),mult(a,c))!=mult(a,mult(mult(mult(b,a),a),c)).
% 1.98/2.16  end_of_list.
% 1.98/2.16  
% 1.98/2.16  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.98/2.16  
% 1.98/2.16  All clauses are units, and equality is present; the
% 1.98/2.16  strategy will be Knuth-Bendix with positive clauses in sos.
% 1.98/2.16  
% 1.98/2.16     dependent: set(knuth_bendix).
% 1.98/2.16     dependent: set(anl_eq).
% 1.98/2.16     dependent: set(para_from).
% 1.98/2.16     dependent: set(para_into).
% 1.98/2.16     dependent: clear(para_from_right).
% 1.98/2.16     dependent: clear(para_into_right).
% 1.98/2.16     dependent: set(para_from_vars).
% 1.98/2.16     dependent: set(eq_units_both_ways).
% 1.98/2.16     dependent: set(dynamic_demod_all).
% 1.98/2.16     dependent: set(dynamic_demod).
% 1.98/2.16     dependent: set(order_eq).
% 1.98/2.16     dependent: set(back_demod).
% 1.98/2.16     dependent: set(lrpo).
% 1.98/2.16  
% 1.98/2.16  ------------> process usable:
% 1.98/2.16  ** KEPT (pick-wt=19): 2 [copy,1,flip.1] mult(a,mult(mult(mult(b,a),a),c))!=mult(mult(mult(a,b),a),mult(a,c)).
% 1.98/2.16  
% 1.98/2.16  ------------> process sos:
% 1.98/2.16  ** KEPT (pick-wt=3): 3 [] A=A.
% 1.98/2.16  ** KEPT (pick-wt=7): 4 [] mult(A,ld(A,B))=B.
% 1.98/2.16  ---> New Demodulator: 5 [new_demod,4] mult(A,ld(A,B))=B.
% 1.98/2.16  ** KEPT (pick-wt=7): 6 [] ld(A,mult(A,B))=B.
% 1.98/2.16  ---> New Demodulator: 7 [new_demod,6] ld(A,mult(A,B))=B.
% 1.98/2.16  ** KEPT (pick-wt=7): 8 [] mult(rd(A,B),B)=A.
% 1.98/2.16  ---> New Demodulator: 9 [new_demod,8] mult(rd(A,B),B)=A.
% 1.98/2.16  ** KEPT (pick-wt=7): 10 [] rd(mult(A,B),B)=A.
% 1.98/2.16  ---> New Demodulator: 11 [new_demod,10] rd(mult(A,B),B)=A.
% 1.98/2.16  ** KEPT (pick-wt=5): 12 [] mult(A,unit)=A.
% 1.98/2.16  ---> New Demodulator: 13 [new_demod,12] mult(A,unit)=A.
% 1.98/2.16  ** KEPT (pick-wt=5): 14 [] mult(unit,A)=A.
% 1.98/2.16  ---> New Demodulator: 15 [new_demod,14] mult(unit,A)=A.
% 1.98/2.16  ** KEPT (pick-wt=9): 16 [] mult(A,i(mult(B,A)))=i(B).
% 1.98/2.16  ---> New Demodulator: 17 [new_demod,16] mult(A,i(mult(B,A)))=i(B).
% 1.98/2.16  ** KEPT (pick-wt=15): 19 [copy,18,flip.1] mult(rd(mult(A,B),A),mult(A,C))=mult(A,mult(B,C)).
% 1.98/2.16  ---> New Demodulator: 20 [new_demod,19] mult(rd(mult(A,B),A),mult(A,C))=mult(A,mult(B,C)).
% 1.98/2.16  ** KEPT (pick-wt=15): 21 [] mult(mult(A,B),C)=mult(mult(A,C),ld(C,mult(B,C))).
% 1.98/2.16  ** KEPT (pick-wt=6): 22 [] mult(i(A),A)=unit.
% 1.98/2.16  ---> New Demodulator: 23 [new_demod,22] mult(i(A),A)=unit.
% 1.98/2.16  ** KEPT (pick-wt=6): 24 [] mult(A,i(A))=unit.
% 1.98/2.16  ---> New Demodulator: 25 [new_demod,24] mult(A,i(A))=unit.
% 1.98/2.16    Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.98/2.16  >>>> Starting back demodulation with 5.
% 1.98/2.16  >>>> Starting back demodulation with 7.
% 1.98/2.16  >>>> Starting back demodulation with 9.
% 1.98/2.16  >>>> Starting back demodulation with 11.
% 1.98/2.16  >>>> Starting back demodulation with 13.
% 1.98/2.16  >>>> Starting back demodulation with 15.
% 1.98/2.16  >>>> Starting back demodulation with 17.
% 1.98/2.16  >>>> Starting back demodulation with 20.
% 1.98/2.16  ** KEPT (pick-wt=15): 26 [copy,21,flip.1] mult(mult(A,B),ld(B,mult(C,B)))=mult(mult(A,C),B).
% 1.98/2.16  >>>> Starting back demodulation with 23.
% 1.98/2.16  >>>> Starting back demodulation with 25.
% 1.98/2.16    Following clause subsumed by 21 during input processing: 0 [copy,26,flip.1] mult(mult(A,B),C)=mult(mult(A,C),ld(C,mult(B,C))).
% 1.98/2.16  
% 1.98/2.16  ======= end of input processing =======
% 1.98/2.16  
% 1.98/2.16  =========== start of search ===========
% 1.98/2.16  
% 1.98/2.16  
% 1.98/2.16  Resetting weight limit to 19.
% 1.98/2.16  
% 1.98/2.16  
% 1.98/2.16  Resetting weight limit to 19.
% 1.98/2.16  
% 1.98/2.16  sos_size=215
% 1.98/2.16  
% 1.98/2.16  
% 1.98/2.16  Resetting weight limit to 17.
% 1.98/2.16  
% 1.98/2.16  
% 1.98/2.16  Resetting weight limit to 17.
% 1.98/2.16  
% 1.98/2.16  sos_size=126
% 1.98/2.16  
% 1.98/2.16  
% 1.98/2.16  Resetting weight limit to 15.
% 1.98/2.16  
% 1.98/2.16  
% 1.98/2.16  Resetting weight limit to 15.
% 2.76/2.95  
% 2.76/2.95  sos_size=117
% 2.76/2.95  
% 2.76/2.95  Search stopped because sos empty.
% 2.76/2.95  
% 2.76/2.95  
% 2.76/2.95  Search stopped because sos empty.
% 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                255
% 2.76/2.95  clauses generated          85970
% 2.76/2.95  clauses kept                 529
% 2.76/2.95  clauses forward subsumed   29963
% 2.76/2.95  clauses back subsumed          5
% 2.76/2.95  Kbytes malloced             4882
% 2.76/2.95  
% 2.76/2.95  ----------- times (seconds) -----------
% 2.76/2.95  user CPU time          1.01          (0 hr, 0 min, 1 sec)
% 2.76/2.95  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 2.76/2.95  wall-clock time        3             (0 hr, 0 min, 3 sec)
% 2.76/2.95  
% 2.76/2.95  Process 11625 finished Wed Jul 27 05:12:26 2022
% 2.76/2.95  Otter interrupted
% 2.76/2.95  PROOF NOT FOUND
%------------------------------------------------------------------------------