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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : PUZ015-1 : TPTP v8.1.0. Released v1.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 13:11:02 EDT 2022

% Result   : Unknown 5.44s 5.67s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : PUZ015-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13  % Command  : otter-tptp-script %s
% 0.12/0.34  % Computer : n008.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Jul 27 01:51:23 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.78/1.96  ----- Otter 3.3f, August 2004 -----
% 1.78/1.96  The process was started by sandbox2 on n008.cluster.edu,
% 1.78/1.96  Wed Jul 27 01:51:23 2022
% 1.78/1.96  The command was "./otter".  The process ID is 23202.
% 1.78/1.96  
% 1.78/1.96  set(prolog_style_variables).
% 1.78/1.96  set(auto).
% 1.78/1.96     dependent: set(auto1).
% 1.78/1.96     dependent: set(process_input).
% 1.78/1.96     dependent: clear(print_kept).
% 1.78/1.96     dependent: clear(print_new_demod).
% 1.78/1.96     dependent: clear(print_back_demod).
% 1.78/1.96     dependent: clear(print_back_sub).
% 1.78/1.96     dependent: set(control_memory).
% 1.78/1.96     dependent: assign(max_mem, 12000).
% 1.78/1.96     dependent: assign(pick_given_ratio, 4).
% 1.78/1.96     dependent: assign(stats_level, 1).
% 1.78/1.96     dependent: assign(max_seconds, 10800).
% 1.78/1.96  clear(print_given).
% 1.78/1.96  
% 1.78/1.96  list(usable).
% 1.78/1.96  0 [] A=A.
% 1.78/1.96  0 [] -achievable(row(X),squares(not_covered,not_covered,Y3,Y4,Y5,Y6,Y7,Y8))|achievable(row(X),squares(covered,covered,Y3,Y4,Y5,Y6,Y7,Y8)).
% 1.78/1.96  0 [] -achievable(row(X),squares(Y1,not_covered,not_covered,Y4,Y5,Y6,Y7,Y8))|achievable(row(X),squares(Y1,covered,covered,Y4,Y5,Y6,Y7,Y8)).
% 1.78/1.96  0 [] -achievable(row(X),squares(Y1,Y2,not_covered,not_covered,Y5,Y6,Y7,Y8))|achievable(row(X),squares(Y1,Y2,covered,covered,Y5,Y6,Y7,Y8)).
% 1.78/1.96  0 [] -achievable(row(X),squares(Y1,Y2,Y3,not_covered,not_covered,Y6,Y7,Y8))|achievable(row(X),squares(Y1,Y2,Y3,covered,covered,Y6,Y7,Y8)).
% 1.78/1.96  0 [] -achievable(row(X),squares(Y1,Y2,Y3,Y4,not_covered,not_covered,Y7,Y8))|achievable(row(X),squares(Y1,Y2,Y3,Y4,covered,covered,Y7,Y8)).
% 1.78/1.96  0 [] -achievable(row(X),squares(Y1,Y2,Y3,Y4,Y5,not_covered,not_covered,Y8))|achievable(row(X),squares(Y1,Y2,Y3,Y4,Y5,covered,covered,Y8)).
% 1.78/1.96  0 [] -achievable(row(X),squares(Y1,Y2,Y3,Y4,Y5,Y6,not_covered,not_covered))|achievable(row(X),squares(Y1,Y2,Y3,Y4,Y5,Y6,covered,covered)).
% 1.78/1.96  0 [] -achievable(row(X),squares(Y1,Y2,Y3,Y4,Y5,Y6,Y7,Y8))|achievable(row(successor(X)),squares(complement(Y1),complement(Y2),complement(Y3),complement(Y4),complement(Y5),complement(Y6),complement(Y7),complement(Y8))).
% 1.78/1.96  0 [] successor(n1)=n2.
% 1.78/1.96  0 [] successor(n2)=n3.
% 1.78/1.96  0 [] successor(n3)=n4.
% 1.78/1.96  0 [] successor(n4)=n5.
% 1.78/1.96  0 [] successor(n5)=n6.
% 1.78/1.96  0 [] successor(n6)=n7.
% 1.78/1.96  0 [] successor(n7)=n8.
% 1.78/1.96  0 [] successor(n8)=n9.
% 1.78/1.96  0 [] complement(covered)=not_covered.
% 1.78/1.96  0 [] complement(not_covered)=covered.
% 1.78/1.96  0 [] complement(removed)=not_covered.
% 1.78/1.96  0 [] achievable(row(n1),squares(removed,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)).
% 1.78/1.96  0 [] -achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,not_covered)).
% 1.78/1.96  end_of_list.
% 1.78/1.96  
% 1.78/1.96  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.78/1.96  
% 1.78/1.96  This is a Horn set with equality.  The strategy will be
% 1.78/1.96  Knuth-Bendix and hyper_res, with positive clauses in
% 1.78/1.96  sos and nonpositive clauses in usable.
% 1.78/1.96  
% 1.78/1.96     dependent: set(knuth_bendix).
% 1.78/1.96     dependent: set(anl_eq).
% 1.78/1.96     dependent: set(para_from).
% 1.78/1.96     dependent: set(para_into).
% 1.78/1.96     dependent: clear(para_from_right).
% 1.78/1.96     dependent: clear(para_into_right).
% 1.78/1.96     dependent: set(para_from_vars).
% 1.78/1.96     dependent: set(eq_units_both_ways).
% 1.78/1.96     dependent: set(dynamic_demod_all).
% 1.78/1.96     dependent: set(dynamic_demod).
% 1.78/1.96     dependent: set(order_eq).
% 1.78/1.96     dependent: set(back_demod).
% 1.78/1.96     dependent: set(lrpo).
% 1.78/1.96     dependent: set(hyper_res).
% 1.78/1.96     dependent: clear(order_hyper).
% 1.78/1.96  
% 1.78/1.96  ------------> process usable:
% 1.78/1.96  ** KEPT (pick-wt=24): 1 [] -achievable(row(A),squares(not_covered,not_covered,B,C,D,E,F,G))|achievable(row(A),squares(covered,covered,B,C,D,E,F,G)).
% 1.78/1.96  ** KEPT (pick-wt=24): 2 [] -achievable(row(A),squares(B,not_covered,not_covered,C,D,E,F,G))|achievable(row(A),squares(B,covered,covered,C,D,E,F,G)).
% 1.78/1.96  ** KEPT (pick-wt=24): 3 [] -achievable(row(A),squares(B,C,not_covered,not_covered,D,E,F,G))|achievable(row(A),squares(B,C,covered,covered,D,E,F,G)).
% 1.78/1.96  ** KEPT (pick-wt=24): 4 [] -achievable(row(A),squares(B,C,D,not_covered,not_covered,E,F,G))|achievable(row(A),squares(B,C,D,covered,covered,E,F,G)).
% 1.78/1.96  ** KEPT (pick-wt=24): 5 [] -achievable(row(A),squares(B,C,D,E,not_covered,not_covered,F,G))|achievable(row(A),squares(B,C,D,E,covered,covered,F,G)).
% 1.78/1.96  ** KEPT (pick-wt=24): 6 [] -achievable(row(A),squares(B,C,D,E,F,not_covered,not_covered,G))|achievable(row(A),squares(B,C,D,E,F,covered,covered,G)).
% 1.78/1.96  ** KEPT (pick-wt=24): 7 [] -achievable(row(A),squares(B,C,D,E,F,G,not_covered,not_covered))|achievable(row(A),squares(B,C,D,E,F,G,covered,covered)).
% 5.44/5.67  ** KEPT (pick-wt=33): 8 [] -achievable(row(A),squares(B,C,D,E,F,G,H,I))|achievable(row(successor(A)),squares(complement(B),complement(C),complement(D),complement(E),complement(F),complement(G),complement(H),complement(I))).
% 5.44/5.67  ** KEPT (pick-wt=12): 9 [] -achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,not_covered)).
% 5.44/5.67  
% 5.44/5.67  ------------> process sos:
% 5.44/5.67  ** KEPT (pick-wt=3): 10 [] A=A.
% 5.44/5.67  ** KEPT (pick-wt=4): 11 [] successor(n1)=n2.
% 5.44/5.67  ---> New Demodulator: 12 [new_demod,11] successor(n1)=n2.
% 5.44/5.67  ** KEPT (pick-wt=4): 13 [] successor(n2)=n3.
% 5.44/5.67  ---> New Demodulator: 14 [new_demod,13] successor(n2)=n3.
% 5.44/5.67  ** KEPT (pick-wt=4): 15 [] successor(n3)=n4.
% 5.44/5.67  ---> New Demodulator: 16 [new_demod,15] successor(n3)=n4.
% 5.44/5.67  ** KEPT (pick-wt=4): 17 [] successor(n4)=n5.
% 5.44/5.67  ---> New Demodulator: 18 [new_demod,17] successor(n4)=n5.
% 5.44/5.67  ** KEPT (pick-wt=4): 19 [] successor(n5)=n6.
% 5.44/5.67  ---> New Demodulator: 20 [new_demod,19] successor(n5)=n6.
% 5.44/5.67  ** KEPT (pick-wt=4): 21 [] successor(n6)=n7.
% 5.44/5.67  ---> New Demodulator: 22 [new_demod,21] successor(n6)=n7.
% 5.44/5.67  ** KEPT (pick-wt=4): 23 [] successor(n7)=n8.
% 5.44/5.67  ---> New Demodulator: 24 [new_demod,23] successor(n7)=n8.
% 5.44/5.67  ** KEPT (pick-wt=4): 25 [] successor(n8)=n9.
% 5.44/5.67  ---> New Demodulator: 26 [new_demod,25] successor(n8)=n9.
% 5.44/5.67  ** KEPT (pick-wt=4): 27 [] complement(covered)=not_covered.
% 5.44/5.67  ---> New Demodulator: 28 [new_demod,27] complement(covered)=not_covered.
% 5.44/5.67  ** KEPT (pick-wt=4): 29 [] complement(not_covered)=covered.
% 5.44/5.67  ---> New Demodulator: 30 [new_demod,29] complement(not_covered)=covered.
% 5.44/5.67  ** KEPT (pick-wt=4): 31 [] complement(removed)=not_covered.
% 5.44/5.67  ---> New Demodulator: 32 [new_demod,31] complement(removed)=not_covered.
% 5.44/5.67  ** KEPT (pick-wt=12): 33 [] achievable(row(n1),squares(removed,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)).
% 5.44/5.67    Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] A=A.
% 5.44/5.67  >>>> Starting back demodulation with 12.
% 5.44/5.67  >>>> Starting back demodulation with 14.
% 5.44/5.67  >>>> Starting back demodulation with 16.
% 5.44/5.67  >>>> Starting back demodulation with 18.
% 5.44/5.67  >>>> Starting back demodulation with 20.
% 5.44/5.67  >>>> Starting back demodulation with 22.
% 5.44/5.67  >>>> Starting back demodulation with 24.
% 5.44/5.67  >>>> Starting back demodulation with 26.
% 5.44/5.67  >>>> Starting back demodulation with 28.
% 5.44/5.67  >>>> Starting back demodulation with 30.
% 5.44/5.67  >>>> Starting back demodulation with 32.
% 5.44/5.67  
% 5.44/5.67  ======= end of input processing =======
% 5.44/5.67  
% 5.44/5.67  =========== start of search ===========
% 5.44/5.67  
% 5.44/5.67  
% 5.44/5.67  Resetting weight limit to 30.
% 5.44/5.67  
% 5.44/5.67  
% 5.44/5.67  Resetting weight limit to 30.
% 5.44/5.67  
% 5.44/5.67  sos_size=3421
% 5.44/5.67  
% 5.44/5.67  
% 5.44/5.67  Resetting weight limit to 29.
% 5.44/5.67  
% 5.44/5.67  
% 5.44/5.67  Resetting weight limit to 29.
% 5.44/5.67  
% 5.44/5.67  sos_size=3775
% 5.44/5.67  
% 5.44/5.67  Search stopped in tp_alloc by max_mem option.
% 5.44/5.67  
% 5.44/5.67  Search stopped in tp_alloc by max_mem option.
% 5.44/5.67  
% 5.44/5.67  ============ end of search ============
% 5.44/5.67  
% 5.44/5.67  -------------- statistics -------------
% 5.44/5.67  clauses given               7556
% 5.44/5.67  clauses generated         114406
% 5.44/5.67  clauses kept               16431
% 5.44/5.67  clauses forward subsumed   97998
% 5.44/5.67  clauses back subsumed          0
% 5.44/5.67  Kbytes malloced            11718
% 5.44/5.67  
% 5.44/5.67  ----------- times (seconds) -----------
% 5.44/5.67  user CPU time          3.70          (0 hr, 0 min, 3 sec)
% 5.44/5.67  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 5.44/5.67  wall-clock time        6             (0 hr, 0 min, 6 sec)
% 5.44/5.67  
% 5.44/5.67  Process 23202 finished Wed Jul 27 01:51:29 2022
% 5.44/5.67  Otter interrupted
% 5.44/5.67  PROOF NOT FOUND
%------------------------------------------------------------------------------