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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : BOO049-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n009.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:47:39 EDT 2022

% Result   : Unknown 135.39s 135.59s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : BOO049-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13  % Command  : otter-tptp-script %s
% 0.14/0.34  % Computer : n009.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Wed Jul 27 02:33:36 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 135.39/135.58  ----- Otter 3.3f, August 2004 -----
% 135.39/135.58  The process was started by sandbox on n009.cluster.edu,
% 135.39/135.58  Wed Jul 27 02:33:36 2022
% 135.39/135.58  The command was "./otter".  The process ID is 8180.
% 135.39/135.58  
% 135.39/135.58  set(prolog_style_variables).
% 135.39/135.58  set(auto).
% 135.39/135.58     dependent: set(auto1).
% 135.39/135.58     dependent: set(process_input).
% 135.39/135.58     dependent: clear(print_kept).
% 135.39/135.58     dependent: clear(print_new_demod).
% 135.39/135.58     dependent: clear(print_back_demod).
% 135.39/135.58     dependent: clear(print_back_sub).
% 135.39/135.58     dependent: set(control_memory).
% 135.39/135.58     dependent: assign(max_mem, 12000).
% 135.39/135.58     dependent: assign(pick_given_ratio, 4).
% 135.39/135.58     dependent: assign(stats_level, 1).
% 135.39/135.58     dependent: assign(max_seconds, 10800).
% 135.39/135.58  clear(print_given).
% 135.39/135.58  
% 135.39/135.58  list(usable).
% 135.39/135.58  0 [] A=A.
% 135.39/135.58  0 [] nand(nand(nand(A,nand(B,C)),A),nand(B,nand(A,C)))=B.
% 135.39/135.58  0 [] nand(nand(a,a),nand(b,a))!=a|nand(a,nand(b,nand(a,c)))!=nand(nand(nand(c,b),b),a).
% 135.39/135.58  end_of_list.
% 135.39/135.58  
% 135.39/135.58  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 135.39/135.58  
% 135.39/135.58  This is a Horn set with equality.  The strategy will be
% 135.39/135.58  Knuth-Bendix and hyper_res, with positive clauses in
% 135.39/135.58  sos and nonpositive clauses in usable.
% 135.39/135.58  
% 135.39/135.58     dependent: set(knuth_bendix).
% 135.39/135.58     dependent: set(anl_eq).
% 135.39/135.58     dependent: set(para_from).
% 135.39/135.58     dependent: set(para_into).
% 135.39/135.58     dependent: clear(para_from_right).
% 135.39/135.58     dependent: clear(para_into_right).
% 135.39/135.58     dependent: set(para_from_vars).
% 135.39/135.58     dependent: set(eq_units_both_ways).
% 135.39/135.58     dependent: set(dynamic_demod_all).
% 135.39/135.58     dependent: set(dynamic_demod).
% 135.39/135.58     dependent: set(order_eq).
% 135.39/135.58     dependent: set(back_demod).
% 135.39/135.58     dependent: set(lrpo).
% 135.39/135.58     dependent: set(hyper_res).
% 135.39/135.58     dependent: clear(order_hyper).
% 135.39/135.58  
% 135.39/135.58  ------------> process usable:
% 135.39/135.58  ** KEPT (pick-wt=24): 2 [copy,1,flip.2] nand(nand(a,a),nand(b,a))!=a|nand(nand(nand(c,b),b),a)!=nand(a,nand(b,nand(a,c))).
% 135.39/135.58  
% 135.39/135.58  ------------> process sos:
% 135.39/135.58  ** KEPT (pick-wt=3): 3 [] A=A.
% 135.39/135.58  ** KEPT (pick-wt=15): 4 [] nand(nand(nand(A,nand(B,C)),A),nand(B,nand(A,C)))=B.
% 135.39/135.58  ---> New Demodulator: 5 [new_demod,4] nand(nand(nand(A,nand(B,C)),A),nand(B,nand(A,C)))=B.
% 135.39/135.58    Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 135.39/135.58  >>>> Starting back demodulation with 5.
% 135.39/135.58  
% 135.39/135.58  ======= end of input processing =======
% 135.39/135.58  
% 135.39/135.58  =========== start of search ===========
% 135.39/135.58  
% 135.39/135.58  
% 135.39/135.58  Resetting weight limit to 29.
% 135.39/135.58  
% 135.39/135.58  
% 135.39/135.58  Resetting weight limit to 29.
% 135.39/135.58  
% 135.39/135.58  sos_size=330
% 135.39/135.58  
% 135.39/135.58  Search stopped because sos empty.
% 135.39/135.58  
% 135.39/135.58  
% 135.39/135.58  Search stopped because sos empty.
% 135.39/135.58  
% 135.39/135.58  ============ end of search ============
% 135.39/135.58  
% 135.39/135.58  -------------- statistics -------------
% 135.39/135.58  clauses given                361
% 135.39/135.58  clauses generated        1139109
% 135.39/135.58  clauses kept                 385
% 135.39/135.58  clauses forward subsumed   84324
% 135.39/135.58  clauses back subsumed          0
% 135.39/135.58  Kbytes malloced             7812
% 135.39/135.58  
% 135.39/135.58  ----------- times (seconds) -----------
% 135.39/135.58  user CPU time        133.76          (0 hr, 2 min, 13 sec)
% 135.39/135.58  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 135.39/135.58  wall-clock time      135             (0 hr, 2 min, 15 sec)
% 135.39/135.58  
% 135.39/135.58  Process 8180 finished Wed Jul 27 02:35:51 2022
% 135.39/135.59  Otter interrupted
% 135.39/135.59  PROOF NOT FOUND
%------------------------------------------------------------------------------