TSTP Solution File: LCL096-10 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : LCL096-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n018.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:03:32 EDT 2022

% Result   : Unknown 3.20s 3.39s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : LCL096-10 : TPTP v8.1.0. Released v7.3.0.
% 0.10/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n018.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 09:28:16 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 3.20/3.39  ----- Otter 3.3f, August 2004 -----
% 3.20/3.39  The process was started by sandbox2 on n018.cluster.edu,
% 3.20/3.39  Wed Jul 27 09:28:16 2022
% 3.20/3.39  The command was "./otter".  The process ID is 10527.
% 3.20/3.39  
% 3.20/3.39  set(prolog_style_variables).
% 3.20/3.39  set(auto).
% 3.20/3.39     dependent: set(auto1).
% 3.20/3.39     dependent: set(process_input).
% 3.20/3.39     dependent: clear(print_kept).
% 3.20/3.39     dependent: clear(print_new_demod).
% 3.20/3.39     dependent: clear(print_back_demod).
% 3.20/3.39     dependent: clear(print_back_sub).
% 3.20/3.39     dependent: set(control_memory).
% 3.20/3.39     dependent: assign(max_mem, 12000).
% 3.20/3.39     dependent: assign(pick_given_ratio, 4).
% 3.20/3.39     dependent: assign(stats_level, 1).
% 3.20/3.39     dependent: assign(max_seconds, 10800).
% 3.20/3.39  clear(print_given).
% 3.20/3.39  
% 3.20/3.39  list(usable).
% 3.20/3.39  0 [] A=A.
% 3.20/3.39  0 [] ife_q(A,A,B,C)=B.
% 3.20/3.39  0 [] ife_q(is_a_theorem(e_quivalent(X,Y)),true,ife_q(is_a_theorem(X),true,is_a_theorem(Y),true),true)=true.
% 3.20/3.39  0 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(X,Y),e_quivalent(X,Z)),e_quivalent(Y,Z)),U),U))=true.
% 3.20/3.39  0 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(X,Y),e_quivalent(X,Z)),U),e_quivalent(e_quivalent(Y,Z),U)),V),V))=true.
% 3.20/3.39  0 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(X,Y),Z),U),e_quivalent(e_quivalent(e_quivalent(X,V),Z),e_quivalent(e_quivalent(Y,V),U))))=true.
% 3.20/3.39  0 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(a,e_quivalent(e_quivalent(b,b),a)),c),c))!=true.
% 3.20/3.39  end_of_list.
% 3.20/3.39  
% 3.20/3.39  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 3.20/3.39  
% 3.20/3.39  All clauses are units, and equality is present; the
% 3.20/3.39  strategy will be Knuth-Bendix with positive clauses in sos.
% 3.20/3.39  
% 3.20/3.39     dependent: set(knuth_bendix).
% 3.20/3.39     dependent: set(anl_eq).
% 3.20/3.39     dependent: set(para_from).
% 3.20/3.39     dependent: set(para_into).
% 3.20/3.39     dependent: clear(para_from_right).
% 3.20/3.39     dependent: clear(para_into_right).
% 3.20/3.39     dependent: set(para_from_vars).
% 3.20/3.39     dependent: set(eq_units_both_ways).
% 3.20/3.39     dependent: set(dynamic_demod_all).
% 3.20/3.39     dependent: set(dynamic_demod).
% 3.20/3.39     dependent: set(order_eq).
% 3.20/3.39     dependent: set(back_demod).
% 3.20/3.39     dependent: set(lrpo).
% 3.20/3.39  
% 3.20/3.39  ------------> process usable:
% 3.20/3.39  ** KEPT (pick-wt=14): 1 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(a,e_quivalent(e_quivalent(b,b),a)),c),c))!=true.
% 3.20/3.39  
% 3.20/3.39  ------------> process sos:
% 3.20/3.39  ** KEPT (pick-wt=3): 2 [] A=A.
% 3.20/3.39  ** KEPT (pick-wt=7): 3 [] ife_q(A,A,B,C)=B.
% 3.20/3.39  ---> New Demodulator: 4 [new_demod,3] ife_q(A,A,B,C)=B.
% 3.20/3.39  ** KEPT (pick-wt=16): 5 [] ife_q(is_a_theorem(e_quivalent(A,B)),true,ife_q(is_a_theorem(A),true,is_a_theorem(B),true),true)=true.
% 3.20/3.39  ---> New Demodulator: 6 [new_demod,5] ife_q(is_a_theorem(e_quivalent(A,B)),true,ife_q(is_a_theorem(A),true,is_a_theorem(B),true),true)=true.
% 3.20/3.39  ** KEPT (pick-wt=18): 7 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(B,C)),D),D))=true.
% 3.20/3.39  ---> New Demodulator: 8 [new_demod,7] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(B,C)),D),D))=true.
% 3.20/3.39  ** KEPT (pick-wt=22): 9 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),D),e_quivalent(e_quivalent(B,C),D)),E),E))=true.
% 3.20/3.39  ---> New Demodulator: 10 [new_demod,9] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),D),e_quivalent(e_quivalent(B,C),D)),E),E))=true.
% 3.20/3.39  ** KEPT (pick-wt=22): 11 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),C),D),e_quivalent(e_quivalent(e_quivalent(A,E),C),e_quivalent(e_quivalent(B,E),D))))=true.
% 3.20/3.39  ---> New Demodulator: 12 [new_demod,11] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),C),D),e_quivalent(e_quivalent(e_quivalent(A,E),C),e_quivalent(e_quivalent(B,E),D))))=true.
% 3.20/3.39    Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 3.20/3.39  >>>> Starting back demodulation with 4.
% 3.20/3.39  >>>> Starting back demodulation with 6.
% 3.20/3.39  >>>> Starting back demodulation with 8.
% 3.20/3.39  >>>> Starting back demodulation with 10.
% 3.20/3.39  >>>> Starting back demodulation with 12.
% 3.20/3.39  
% 3.20/3.39  ======= end of input processing =======
% 3.20/3.39  
% 3.20/3.39  =========== start of search ===========
% 3.20/3.39  
% 3.20/3.39  
% 3.20/3.39  Resetting weight limit to 18.
% 3.20/3.39  
% 3.20/3.39  
% 3.20/3.39  Resetting weight limit to 18.
% 3.20/3.39  
% 3.20/3.39  sos_size=608
% 3.20/3.39  
% 3.20/3.39  Search stopped because sos empty.
% 3.20/3.39  
% 3.20/3.39  
% 3.20/3.39  Search stopped because sos empty.
% 3.20/3.39  
% 3.20/3.39  ============ end of search ============
% 3.20/3.39  
% 3.20/3.39  -------------- statistics -------------
% 3.20/3.39  clauses given               1007
% 3.20/3.39  clauses generated         208206
% 3.20/3.39  clauses kept                1104
% 3.20/3.39  clauses forward subsumed  138956
% 3.20/3.39  clauses back subsumed          0
% 3.20/3.39  Kbytes malloced             6835
% 3.20/3.39  
% 3.20/3.39  ----------- times (seconds) -----------
% 3.20/3.39  user CPU time          1.50          (0 hr, 0 min, 1 sec)
% 3.20/3.39  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 3.20/3.39  wall-clock time        3             (0 hr, 0 min, 3 sec)
% 3.20/3.39  
% 3.20/3.39  Process 10527 finished Wed Jul 27 09:28:19 2022
% 3.20/3.39  Otter interrupted
% 3.20/3.39  PROOF NOT FOUND
%------------------------------------------------------------------------------