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

View Problem - Process Solution

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

% Computer : n011.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:23 EDT 2022

% Result   : Unknown 2.00s 2.18s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : LCL423-10 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.12  % Command  : otter-tptp-script %s
% 0.13/0.33  % Computer : n011.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Wed Jul 27 09:11:25 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 2.00/2.18  ----- Otter 3.3f, August 2004 -----
% 2.00/2.18  The process was started by sandbox on n011.cluster.edu,
% 2.00/2.18  Wed Jul 27 09:11:25 2022
% 2.00/2.18  The command was "./otter".  The process ID is 1068.
% 2.00/2.18  
% 2.00/2.18  set(prolog_style_variables).
% 2.00/2.18  set(auto).
% 2.00/2.18     dependent: set(auto1).
% 2.00/2.18     dependent: set(process_input).
% 2.00/2.18     dependent: clear(print_kept).
% 2.00/2.18     dependent: clear(print_new_demod).
% 2.00/2.18     dependent: clear(print_back_demod).
% 2.00/2.18     dependent: clear(print_back_sub).
% 2.00/2.18     dependent: set(control_memory).
% 2.00/2.18     dependent: assign(max_mem, 12000).
% 2.00/2.18     dependent: assign(pick_given_ratio, 4).
% 2.00/2.18     dependent: assign(stats_level, 1).
% 2.00/2.18     dependent: assign(max_seconds, 10800).
% 2.00/2.18  clear(print_given).
% 2.00/2.18  
% 2.00/2.18  list(usable).
% 2.00/2.18  0 [] A=A.
% 2.00/2.18  0 [] ife_q(A,A,B,C)=B.
% 2.00/2.18  0 [] ife_q(is_a_theorem(implies(A,B)),true,ife_q(is_a_theorem(A),true,is_a_theorem(B),true),true)=true.
% 2.00/2.18  0 [] is_a_theorem(implies(implies(implies(A,B),implies(implies(implies(not(C),not(D)),E),C)),implies(F,implies(implies(C,A),implies(D,A)))))=true.
% 2.00/2.18  0 [] tuple(is_a_theorem(implies(implies(not(a),a),a)),is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),is_a_theorem(implies(a,implies(not(a),b))))!=tuple(true,true,true).
% 2.00/2.18  end_of_list.
% 2.00/2.18  
% 2.00/2.18  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.00/2.18  
% 2.00/2.18  All clauses are units, and equality is present; the
% 2.00/2.18  strategy will be Knuth-Bendix with positive clauses in sos.
% 2.00/2.18  
% 2.00/2.18     dependent: set(knuth_bendix).
% 2.00/2.18     dependent: set(anl_eq).
% 2.00/2.18     dependent: set(para_from).
% 2.00/2.18     dependent: set(para_into).
% 2.00/2.18     dependent: clear(para_from_right).
% 2.00/2.18     dependent: clear(para_into_right).
% 2.00/2.18     dependent: set(para_from_vars).
% 2.00/2.18     dependent: set(eq_units_both_ways).
% 2.00/2.18     dependent: set(dynamic_demod_all).
% 2.00/2.18     dependent: set(dynamic_demod).
% 2.00/2.18     dependent: set(order_eq).
% 2.00/2.18     dependent: set(back_demod).
% 2.00/2.18     dependent: set(lrpo).
% 2.00/2.18  
% 2.00/2.18  ------------> process usable:
% 2.00/2.18  ** KEPT (pick-wt=32): 1 [] tuple(is_a_theorem(implies(implies(not(a),a),a)),is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),is_a_theorem(implies(a,implies(not(a),b))))!=tuple(true,true,true).
% 2.00/2.18  
% 2.00/2.18  ------------> process sos:
% 2.00/2.18  ** KEPT (pick-wt=3): 2 [] A=A.
% 2.00/2.18  ** KEPT (pick-wt=7): 3 [] ife_q(A,A,B,C)=B.
% 2.00/2.18  ---> New Demodulator: 4 [new_demod,3] ife_q(A,A,B,C)=B.
% 2.00/2.18  ** KEPT (pick-wt=16): 5 [] ife_q(is_a_theorem(implies(A,B)),true,ife_q(is_a_theorem(A),true,is_a_theorem(B),true),true)=true.
% 2.00/2.18  ---> New Demodulator: 6 [new_demod,5] ife_q(is_a_theorem(implies(A,B)),true,ife_q(is_a_theorem(A),true,is_a_theorem(B),true),true)=true.
% 2.00/2.18  ** KEPT (pick-wt=26): 7 [] is_a_theorem(implies(implies(implies(A,B),implies(implies(implies(not(C),not(D)),E),C)),implies(F,implies(implies(C,A),implies(D,A)))))=true.
% 2.00/2.18  ---> New Demodulator: 8 [new_demod,7] is_a_theorem(implies(implies(implies(A,B),implies(implies(implies(not(C),not(D)),E),C)),implies(F,implies(implies(C,A),implies(D,A)))))=true.
% 2.00/2.18    Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 2.00/2.18  >>>> Starting back demodulation with 4.
% 2.00/2.18  >>>> Starting back demodulation with 6.
% 2.00/2.18  >>>> Starting back demodulation with 8.
% 2.00/2.18  
% 2.00/2.18  ======= end of input processing =======
% 2.00/2.18  
% 2.00/2.18  =========== start of search ===========
% 2.00/2.18  
% 2.00/2.18  
% 2.00/2.18  Resetting weight limit to 20.
% 2.00/2.18  
% 2.00/2.18  
% 2.00/2.18  Resetting weight limit to 20.
% 2.00/2.18  
% 2.00/2.18  sos_size=40
% 2.00/2.18  
% 2.00/2.18  
% 2.00/2.18  Resetting weight limit to 19.
% 2.00/2.18  
% 2.00/2.18  
% 2.00/2.18  Resetting weight limit to 19.
% 2.00/2.18  
% 2.00/2.18  sos_size=32
% 2.00/2.18  
% 2.00/2.18  
% 2.00/2.18  Resetting weight limit to 14.
% 2.00/2.18  
% 2.00/2.18  
% 2.00/2.18  Resetting weight limit to 14.
% 2.00/2.18  
% 2.00/2.18  sos_size=48
% 2.00/2.18  
% 2.00/2.18  Search stopped because sos empty.
% 2.00/2.18  
% 2.00/2.18  
% 2.00/2.18  Search stopped because sos empty.
% 2.00/2.18  
% 2.00/2.18  ============ end of search ============
% 2.00/2.18  
% 2.00/2.18  -------------- statistics -------------
% 2.00/2.18  clauses given                125
% 2.00/2.18  clauses generated           8797
% 2.00/2.18  clauses kept                 155
% 2.00/2.18  clauses forward subsumed    8254
% 2.00/2.18  clauses back subsumed          0
% 2.00/2.18  Kbytes malloced             5859
% 2.00/2.18  
% 2.00/2.18  ----------- times (seconds) -----------
% 2.00/2.18  user CPU time          0.07          (0 hr, 0 min, 0 sec)
% 2.00/2.18  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 2.00/2.18  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 2.00/2.18  
% 2.00/2.18  Process 1068 finished Wed Jul 27 09:11:27 2022
% 2.00/2.18  Otter interrupted
% 2.00/2.18  PROOF NOT FOUND
%------------------------------------------------------------------------------