TSTP Solution File: LCL407-2 by Otter---3.3

View Problem - Process Solution

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

% Computer : n012.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:04:22 EDT 2022

% Result   : Unknown 1.52s 1.71s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL407-2 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n012.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed Jul 27 09:26:05 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.52/1.71  ----- Otter 3.3f, August 2004 -----
% 1.52/1.71  The process was started by sandbox2 on n012.cluster.edu,
% 1.52/1.71  Wed Jul 27 09:26:05 2022
% 1.52/1.71  The command was "./otter".  The process ID is 13443.
% 1.52/1.71  
% 1.52/1.71  set(prolog_style_variables).
% 1.52/1.71  set(auto).
% 1.52/1.71     dependent: set(auto1).
% 1.52/1.71     dependent: set(process_input).
% 1.52/1.71     dependent: clear(print_kept).
% 1.52/1.71     dependent: clear(print_new_demod).
% 1.52/1.71     dependent: clear(print_back_demod).
% 1.52/1.71     dependent: clear(print_back_sub).
% 1.52/1.71     dependent: set(control_memory).
% 1.52/1.71     dependent: assign(max_mem, 12000).
% 1.52/1.71     dependent: assign(pick_given_ratio, 4).
% 1.52/1.71     dependent: assign(stats_level, 1).
% 1.52/1.71     dependent: assign(max_seconds, 10800).
% 1.52/1.71  clear(print_given).
% 1.52/1.71  
% 1.52/1.71  list(usable).
% 1.52/1.71  0 [] A=A.
% 1.52/1.71  0 [] not(X)=xor(X,truth).
% 1.52/1.71  0 [] xor(X,falsehood)=X.
% 1.52/1.71  0 [] xor(X,X)=falsehood.
% 1.52/1.71  0 [] and_star(X,truth)=X.
% 1.52/1.71  0 [] and_star(X,falsehood)=falsehood.
% 1.52/1.71  0 [] and_star(xor(truth,X),X)=falsehood.
% 1.52/1.71  0 [] xor(X,xor(truth,Y))=xor(xor(X,truth),Y).
% 1.52/1.71  0 [] and_star(xor(and_star(xor(truth,X),Y),truth),Y)=and_star(xor(and_star(xor(truth,Y),X),truth),X).
% 1.52/1.71  end_of_list.
% 1.52/1.71  
% 1.52/1.71  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.52/1.71  
% 1.52/1.71  All clauses are units, and equality is present; the
% 1.52/1.71  strategy will be Knuth-Bendix with positive clauses in sos.
% 1.52/1.71  
% 1.52/1.71     dependent: set(knuth_bendix).
% 1.52/1.71     dependent: set(anl_eq).
% 1.52/1.71     dependent: set(para_from).
% 1.52/1.71     dependent: set(para_into).
% 1.52/1.71     dependent: clear(para_from_right).
% 1.52/1.71     dependent: clear(para_into_right).
% 1.52/1.71     dependent: set(para_from_vars).
% 1.52/1.71     dependent: set(eq_units_both_ways).
% 1.52/1.71     dependent: set(dynamic_demod_all).
% 1.52/1.71     dependent: set(dynamic_demod).
% 1.52/1.71     dependent: set(order_eq).
% 1.52/1.71     dependent: set(back_demod).
% 1.52/1.71     dependent: set(lrpo).
% 1.52/1.71  
% 1.52/1.71  There is no negative clause, so all clause lists will
% 1.52/1.71  be printed at the end of the search.
% 1.52/1.71  
% 1.52/1.71     dependent: set(print_lists_at_end).
% 1.52/1.71  
% 1.52/1.71  ------------> process usable:
% 1.52/1.71  
% 1.52/1.71  ------------> process sos:
% 1.52/1.71  ** KEPT (pick-wt=3): 1 [] A=A.
% 1.52/1.71  ** KEPT (pick-wt=6): 2 [] not(A)=xor(A,truth).
% 1.52/1.71  ---> New Demodulator: 3 [new_demod,2] not(A)=xor(A,truth).
% 1.52/1.71  ** KEPT (pick-wt=5): 4 [] xor(A,falsehood)=A.
% 1.52/1.71  ---> New Demodulator: 5 [new_demod,4] xor(A,falsehood)=A.
% 1.52/1.71  ** KEPT (pick-wt=5): 6 [] xor(A,A)=falsehood.
% 1.52/1.71  ---> New Demodulator: 7 [new_demod,6] xor(A,A)=falsehood.
% 1.52/1.71  ** KEPT (pick-wt=5): 8 [] and_star(A,truth)=A.
% 1.52/1.71  ---> New Demodulator: 9 [new_demod,8] and_star(A,truth)=A.
% 1.52/1.71  ** KEPT (pick-wt=5): 10 [] and_star(A,falsehood)=falsehood.
% 1.52/1.71  ---> New Demodulator: 11 [new_demod,10] and_star(A,falsehood)=falsehood.
% 1.52/1.71  ** KEPT (pick-wt=7): 12 [] and_star(xor(truth,A),A)=falsehood.
% 1.52/1.71  ---> New Demodulator: 13 [new_demod,12] and_star(xor(truth,A),A)=falsehood.
% 1.52/1.71  ** KEPT (pick-wt=11): 15 [copy,14,flip.1] xor(xor(A,truth),B)=xor(A,xor(truth,B)).
% 1.52/1.71  ---> New Demodulator: 16 [new_demod,15] xor(xor(A,truth),B)=xor(A,xor(truth,B)).
% 1.52/1.71  ** KEPT (pick-wt=19): 17 [] and_star(xor(and_star(xor(truth,A),B),truth),B)=and_star(xor(and_star(xor(truth,B),A),truth),A).
% 1.52/1.71    Following clause subsumed by 1 during input processing: 0 [copy,1,flip.1] A=A.
% 1.52/1.71  >>>> Starting back demodulation with 3.
% 1.52/1.71  >>>> Starting back demodulation with 5.
% 1.52/1.71  >>>> Starting back demodulation with 7.
% 1.52/1.71  >>>> Starting back demodulation with 9.
% 1.52/1.71  >>>> Starting back demodulation with 11.
% 1.52/1.71  >>>> Starting back demodulation with 13.
% 1.52/1.71  >>>> Starting back demodulation with 16.
% 1.52/1.71    Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] and_star(xor(and_star(xor(truth,A),B),truth),B)=and_star(xor(and_star(xor(truth,B),A),truth),A).
% 1.52/1.71  
% 1.52/1.71  ======= end of input processing =======
% 1.52/1.71  
% 1.52/1.71  =========== start of search ===========
% 1.52/1.71  
% 1.52/1.71  Search stopped because sos empty.
% 1.52/1.71  
% 1.52/1.71  
% 1.52/1.71  Search stopped because sos empty.
% 1.52/1.71  
% 1.52/1.71  ============ end of search ============
% 1.52/1.71  
% 1.52/1.71  list(usable).
% 1.52/1.71  1 [] A=A.
% 1.52/1.71  4 [] xor(A,falsehood)=A.
% 1.52/1.71  6 [] xor(A,A)=falsehood.
% 1.52/1.71  8 [] and_star(A,truth)=A.
% 1.52/1.71  10 [] and_star(A,falsehood)=falsehood.
% 1.52/1.71  2 [] not(A)=xor(A,truth).
% 1.52/1.71  12 [] and_star(xor(truth,A),A)=falsehood.
% 1.52/1.71  15 [copy,14,flip.1] xor(xor(A,truth),B)=xor(A,xor(truth,B)).
% 1.52/1.71  20 [para_into,15.1.1.1,6.1.1,flip.1] xor(truth,xor(truth,A))=xor(falsehood,A).
% 1.52/1.71  28 [para_into,20.1.1.2,6.1.1,demod,5,flip.1] xor(falsehood,truth)=truth.
% 1.52/1.71  17 [] and_star(xor(and_star(xor(truth,A),B),truth),B)=and_star(xor(and_star(xor(truth,B),A),truth),A).
% 1.52/1.71  22 [para_into,15.1.1,6.1.1,flip.1] xor(A,xor(truth,xor(A,truth)))=falsehood.
% 1.52/1.71  24 [back_demod,18,demod,21] xor(A,xor(falsehood,B))=xor(A,B).
% 1.52/1.71  38 [para_into,24.1.1,6.1.1,flip.1] xor(xor(falsehood,A),A)=falsehood.
% 1.52/1.71  26 [para_into,20.1.1.2,20.1.1,demod,25,flip.1] xor(falsehood,xor(truth,A))=xor(truth,A).
% 1.52/1.71  30 [para_from,20.1.1,12.1.1.1] and_star(xor(falsehood,A),xor(truth,A))=falsehood.
% 1.52/1.71  35 [para_into,17.1.1.1.1.1,4.1.1,demod,11,29,11] and_star(xor(and_star(truth,A),truth),A)=falsehood.
% 1.52/1.71  41 [para_from,24.1.1,12.1.1.1] and_star(xor(truth,A),xor(falsehood,A))=falsehood.
% 1.52/1.71  44 [para_from,41.1.1,17.1.1.1.1,demod,29,25,13,29] and_star(truth,xor(falsehood,A))=and_star(truth,A).
% 1.52/1.71  46 [para_from,44.1.1,35.1.1.1.1] and_star(xor(and_star(truth,A),truth),xor(falsehood,A))=falsehood.
% 1.52/1.71  32 [para_into,17.1.1.1.1.1,20.1.1] and_star(xor(and_star(xor(falsehood,A),B),truth),B)=and_star(xor(and_star(xor(truth,B),xor(truth,A)),truth),xor(truth,A)).
% 1.52/1.71  33 [para_into,17.1.1.1.1.1,6.1.1,demod,9,9,flip.1] xor(xor(truth,A),truth)=and_star(xor(and_star(falsehood,A),truth),A).
% 1.52/1.71  52 [para_from,33.1.1,22.1.1.2.2] xor(xor(truth,A),xor(truth,and_star(xor(and_star(falsehood,A),truth),A)))=falsehood.
% 1.52/1.71  48 [para_into,32.1.1.1.1,8.1.1,demod,9,7,flip.1] and_star(xor(and_star(falsehood,xor(truth,A)),truth),xor(truth,A))=xor(xor(falsehood,A),truth).
% 1.52/1.71  54 [para_from,33.1.1,15.1.1.1] xor(and_star(xor(and_star(falsehood,A),truth),A),B)=xor(xor(truth,A),xor(truth,B)).
% 1.52/1.71  37 [copy,32,flip.1] and_star(xor(and_star(xor(truth,A),xor(truth,B)),truth),xor(truth,B))=and_star(xor(and_star(xor(falsehood,B),A),truth),A).
% 1.52/1.71  50 [para_into,33.1.1.1,24.1.1,demod,34,flip.1] and_star(xor(and_star(falsehood,xor(falsehood,A)),truth),xor(falsehood,A))=and_star(xor(and_star(falsehood,A),truth),A).
% 1.52/1.71  59 [para_into,40.1.1,37.1.1,demod,21,flip.1] and_star(xor(and_star(xor(falsehood,A),xor(falsehood,B)),truth),xor(falsehood,B))=and_star(xor(and_star(xor(falsehood,A),B),truth),B).
% 1.52/1.71  61 [para_into,40.1.1,17.1.1,flip.1] and_star(xor(and_star(xor(truth,A),xor(falsehood,B)),truth),xor(falsehood,B))=and_star(xor(and_star(xor(truth,A),B),truth),B).
% 1.52/1.71  57 [para_into,37.1.1.1.1.1,20.1.1] and_star(xor(and_star(xor(falsehood,A),xor(truth,B)),truth),xor(truth,B))=and_star(xor(and_star(xor(falsehood,B),xor(truth,A)),truth),xor(truth,A)).
% 1.52/1.71  end_of_list.
% 1.52/1.71  
% 1.52/1.71  list(sos).
% 1.52/1.71  end_of_list.
% 1.52/1.71  
% 1.52/1.71  list(demodulators).
% 1.52/1.71  3 [new_demod,2] not(A)=xor(A,truth).
% 1.52/1.71  5 [new_demod,4] xor(A,falsehood)=A.
% 1.52/1.71  7 [new_demod,6] xor(A,A)=falsehood.
% 1.52/1.71  9 [new_demod,8] and_star(A,truth)=A.
% 1.52/1.71  11 [new_demod,10] and_star(A,falsehood)=falsehood.
% 1.52/1.71  13 [new_demod,12] and_star(xor(truth,A),A)=falsehood.
% 1.52/1.71  16 [new_demod,15] xor(xor(A,truth),B)=xor(A,xor(truth,B)).
% 1.52/1.71  21 [new_demod,20] xor(truth,xor(truth,A))=xor(falsehood,A).
% 1.52/1.71  23 [new_demod,22] xor(A,xor(truth,xor(A,truth)))=falsehood.
% 1.52/1.71  25 [new_demod,24] xor(A,xor(falsehood,B))=xor(A,B).
% 1.52/1.71  27 [new_demod,26] xor(falsehood,xor(truth,A))=xor(truth,A).
% 1.52/1.71  29 [new_demod,28] xor(falsehood,truth)=truth.
% 1.52/1.71  31 [new_demod,30] and_star(xor(falsehood,A),xor(truth,A))=falsehood.
% 1.52/1.71  34 [new_demod,33] xor(xor(truth,A),truth)=and_star(xor(and_star(falsehood,A),truth),A).
% 1.52/1.71  36 [new_demod,35] and_star(xor(and_star(truth,A),truth),A)=falsehood.
% 1.52/1.71  39 [new_demod,38] xor(xor(falsehood,A),A)=falsehood.
% 1.52/1.71  42 [new_demod,41] and_star(xor(truth,A),xor(falsehood,A))=falsehood.
% 1.52/1.71  45 [new_demod,44] and_star(truth,xor(falsehood,A))=and_star(truth,A).
% 1.52/1.71  47 [new_demod,46] and_star(xor(and_star(truth,A),truth),xor(falsehood,A))=falsehood.
% 1.52/1.71  49 [new_demod,48] and_star(xor(and_star(falsehood,xor(truth,A)),truth),xor(truth,A))=xor(xor(falsehood,A),truth).
% 1.52/1.71  51 [new_demod,50] and_star(xor(and_star(falsehood,xor(falsehood,A)),truth),xor(falsehood,A))=and_star(xor(and_star(falsehood,A),truth),A).
% 1.52/1.71  53 [new_demod,52] xor(xor(truth,A),xor(truth,and_star(xor(and_star(falsehood,A),truth),A)))=falsehood.
% 1.52/1.71  55 [new_demod,54] xor(and_star(xor(and_star(falsehood,A),truth),A),B)=xor(xor(truth,A),xor(truth,B)).
% 1.52/1.71  60 [new_demod,59] and_star(xor(and_star(xor(falsehood,A),xor(falsehood,B)),truth),xor(falsehood,B))=and_star(xor(and_star(xor(falsehood,A),B),truth),B).
% 1.52/1.71  62 [new_demod,61] and_star(xor(and_star(xor(truth,A),xor(falsehood,B)),truth),xor(falsehood,B))=and_star(xor(and_star(xor(truth,A),B),truth),B).
% 1.52/1.71  end_of_list.
% 1.52/1.71  
% 1.52/1.71  
% 1.52/1.71  -------------- statistics -------------
% 1.52/1.71  clauses given                 31
% 1.52/1.71  clauses generated            346
% 1.52/1.71  clauses kept                  35
% 1.52/1.71  clauses forward subsumed     334
% 1.52/1.71  clauses back subsumed          0
% 1.52/1.71  Kbytes malloced              976
% 1.52/1.71  
% 1.52/1.71  ----------- times (seconds) -----------
% 1.52/1.71  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.52/1.71  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.52/1.71  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.52/1.71  
% 1.52/1.71  Process 13443 finished Wed Jul 27 09:26:07 2022
% 1.52/1.71  Otter interrupted
% 1.52/1.71  PROOF NOT FOUND
%------------------------------------------------------------------------------