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

View Problem - Process Solution

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

% Computer : n025.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:35 EDT 2022

% Result   : Unknown 2.07s 2.23s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : GRP659+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n025.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 05:12:30 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 2.07/2.23  ----- Otter 3.3f, August 2004 -----
% 2.07/2.23  The process was started by sandbox on n025.cluster.edu,
% 2.07/2.23  Wed Jul 27 05:12:30 2022
% 2.07/2.23  The command was "./otter".  The process ID is 9173.
% 2.07/2.23  
% 2.07/2.23  set(prolog_style_variables).
% 2.07/2.23  set(auto).
% 2.07/2.23     dependent: set(auto1).
% 2.07/2.23     dependent: set(process_input).
% 2.07/2.23     dependent: clear(print_kept).
% 2.07/2.23     dependent: clear(print_new_demod).
% 2.07/2.23     dependent: clear(print_back_demod).
% 2.07/2.23     dependent: clear(print_back_sub).
% 2.07/2.23     dependent: set(control_memory).
% 2.07/2.23     dependent: assign(max_mem, 12000).
% 2.07/2.23     dependent: assign(pick_given_ratio, 4).
% 2.07/2.23     dependent: assign(stats_level, 1).
% 2.07/2.23     dependent: assign(max_seconds, 10800).
% 2.07/2.23  clear(print_given).
% 2.07/2.23  
% 2.07/2.23  formula_list(usable).
% 2.07/2.23  all A (A=A).
% 2.07/2.23  all B A (mult(A,ld(A,B))=B).
% 2.07/2.23  all B A (ld(A,mult(A,B))=B).
% 2.07/2.23  all B A (mult(rd(A,B),B)=A).
% 2.07/2.23  all B A (rd(mult(A,B),B)=A).
% 2.07/2.23  all C B A (mult(mult(A,mult(B,C)),B)=mult(mult(A,B),mult(C,B))).
% 2.07/2.23  -(exists X0 all X1 (mult(X1,X0)=X1&mult(X0,X1)=X1)).
% 2.07/2.23  end_of_list.
% 2.07/2.23  
% 2.07/2.23  -------> usable clausifies to:
% 2.07/2.23  
% 2.07/2.23  list(usable).
% 2.07/2.23  0 [] A=A.
% 2.07/2.23  0 [] mult(A,ld(A,B))=B.
% 2.07/2.23  0 [] ld(A,mult(A,B))=B.
% 2.07/2.23  0 [] mult(rd(A,B),B)=A.
% 2.07/2.23  0 [] rd(mult(A,B),B)=A.
% 2.07/2.23  0 [] mult(mult(A,mult(B,C)),B)=mult(mult(A,B),mult(C,B)).
% 2.07/2.23  0 [] mult($f1(X0),X0)!=$f1(X0)|mult(X0,$f1(X0))!=$f1(X0).
% 2.07/2.23  end_of_list.
% 2.07/2.23  
% 2.07/2.23  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 2.07/2.23  
% 2.07/2.23  This is a Horn set with equality.  The strategy will be
% 2.07/2.23  Knuth-Bendix and hyper_res, with positive clauses in
% 2.07/2.23  sos and nonpositive clauses in usable.
% 2.07/2.23  
% 2.07/2.23     dependent: set(knuth_bendix).
% 2.07/2.23     dependent: set(anl_eq).
% 2.07/2.23     dependent: set(para_from).
% 2.07/2.23     dependent: set(para_into).
% 2.07/2.23     dependent: clear(para_from_right).
% 2.07/2.23     dependent: clear(para_into_right).
% 2.07/2.23     dependent: set(para_from_vars).
% 2.07/2.23     dependent: set(eq_units_both_ways).
% 2.07/2.23     dependent: set(dynamic_demod_all).
% 2.07/2.23     dependent: set(dynamic_demod).
% 2.07/2.23     dependent: set(order_eq).
% 2.07/2.23     dependent: set(back_demod).
% 2.07/2.23     dependent: set(lrpo).
% 2.07/2.23     dependent: set(hyper_res).
% 2.07/2.23     dependent: clear(order_hyper).
% 2.07/2.23  
% 2.07/2.23  ------------> process usable:
% 2.07/2.23  ** KEPT (pick-wt=14): 1 [] mult($f1(A),A)!=$f1(A)|mult(A,$f1(A))!=$f1(A).
% 2.07/2.23  
% 2.07/2.23  ------------> process sos:
% 2.07/2.23  ** KEPT (pick-wt=3): 2 [] A=A.
% 2.07/2.23  ** KEPT (pick-wt=7): 3 [] mult(A,ld(A,B))=B.
% 2.07/2.23  ---> New Demodulator: 4 [new_demod,3] mult(A,ld(A,B))=B.
% 2.07/2.23  ** KEPT (pick-wt=7): 5 [] ld(A,mult(A,B))=B.
% 2.07/2.23  ---> New Demodulator: 6 [new_demod,5] ld(A,mult(A,B))=B.
% 2.07/2.23  ** KEPT (pick-wt=7): 7 [] mult(rd(A,B),B)=A.
% 2.07/2.23  ---> New Demodulator: 8 [new_demod,7] mult(rd(A,B),B)=A.
% 2.07/2.23  ** KEPT (pick-wt=7): 9 [] rd(mult(A,B),B)=A.
% 2.07/2.23  ---> New Demodulator: 10 [new_demod,9] rd(mult(A,B),B)=A.
% 2.07/2.23  ** KEPT (pick-wt=15): 11 [] mult(mult(A,mult(B,C)),B)=mult(mult(A,B),mult(C,B)).
% 2.07/2.23  ---> New Demodulator: 12 [new_demod,11] mult(mult(A,mult(B,C)),B)=mult(mult(A,B),mult(C,B)).
% 2.07/2.23    Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 2.07/2.23  >>>> Starting back demodulation with 4.
% 2.07/2.23  >>>> Starting back demodulation with 6.
% 2.07/2.23  >>>> Starting back demodulation with 8.
% 2.07/2.23  >>>> Starting back demodulation with 10.
% 2.07/2.23  >>>> Starting back demodulation with 12.
% 2.07/2.23  
% 2.07/2.23  ======= end of input processing =======
% 2.07/2.23  
% 2.07/2.23  =========== start of search ===========
% 2.07/2.23  
% 2.07/2.23  
% 2.07/2.23  Resetting weight limit to 15.
% 2.07/2.23  
% 2.07/2.23  
% 2.07/2.23  Resetting weight limit to 15.
% 2.07/2.23  
% 2.07/2.23  sos_size=140
% 2.07/2.23  
% 2.07/2.23  
% 2.07/2.23  Resetting weight limit to 11.
% 2.07/2.23  
% 2.07/2.23  
% 2.07/2.23  Resetting weight limit to 11.
% 2.07/2.23  
% 2.07/2.23  sos_size=16
% 2.07/2.23  
% 2.07/2.23  Search stopped because sos empty.
% 2.07/2.23  
% 2.07/2.23  
% 2.07/2.23  Search stopped because sos empty.
% 2.07/2.23  
% 2.07/2.23  ============ end of search ============
% 2.07/2.23  
% 2.07/2.23  -------------- statistics -------------
% 2.07/2.23  clauses given                103
% 2.07/2.23  clauses generated           4532
% 2.07/2.23  clauses kept                 317
% 2.07/2.23  clauses forward subsumed    1426
% 2.07/2.23  clauses back subsumed          2
% 2.07/2.23  Kbytes malloced             6835
% 2.07/2.23  
% 2.07/2.23  ----------- times (seconds) -----------
% 2.07/2.23  user CPU time          0.12          (0 hr, 0 min, 0 sec)
% 2.07/2.23  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 2.07/2.23  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 2.07/2.23  
% 2.07/2.23  Process 9173 finished Wed Jul 27 05:12:32 2022
% 2.07/2.23  Otter interrupted
% 2.07/2.23  PROOF NOT FOUND
%------------------------------------------------------------------------------