TSTP Solution File: CAT015-4 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : CAT015-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n029.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:49 EDT 2022

% Result   : Unknown 1.74s 1.90s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : CAT015-4 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n029.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 02:03:44 EDT 2022
% 0.18/0.33  % CPUTime  : 
% 1.70/1.90  ----- Otter 3.3f, August 2004 -----
% 1.70/1.90  The process was started by sandbox2 on n029.cluster.edu,
% 1.70/1.90  Wed Jul 27 02:03:44 2022
% 1.70/1.90  The command was "./otter".  The process ID is 21666.
% 1.70/1.90  
% 1.70/1.90  set(prolog_style_variables).
% 1.70/1.90  set(auto).
% 1.70/1.90     dependent: set(auto1).
% 1.70/1.90     dependent: set(process_input).
% 1.70/1.90     dependent: clear(print_kept).
% 1.70/1.90     dependent: clear(print_new_demod).
% 1.70/1.90     dependent: clear(print_back_demod).
% 1.70/1.90     dependent: clear(print_back_sub).
% 1.70/1.90     dependent: set(control_memory).
% 1.70/1.90     dependent: assign(max_mem, 12000).
% 1.70/1.90     dependent: assign(pick_given_ratio, 4).
% 1.70/1.90     dependent: assign(stats_level, 1).
% 1.70/1.90     dependent: assign(max_seconds, 10800).
% 1.70/1.90  clear(print_given).
% 1.70/1.90  
% 1.70/1.90  list(usable).
% 1.70/1.90  0 [] A=A.
% 1.70/1.90  0 [] -e_quivalent(X,Y)|there_exists(X).
% 1.70/1.90  0 [] -e_quivalent(X,Y)|X=Y.
% 1.70/1.90  0 [] -there_exists(X)|X!=Y|e_quivalent(X,Y).
% 1.70/1.90  0 [] -there_exists(domain(X))|there_exists(X).
% 1.70/1.90  0 [] -there_exists(codomain(X))|there_exists(X).
% 1.70/1.90  0 [] -there_exists(compose(X,Y))|there_exists(domain(X)).
% 1.70/1.90  0 [] -there_exists(compose(X,Y))|domain(X)=codomain(Y).
% 1.70/1.90  0 [] -there_exists(domain(X))|domain(X)!=codomain(Y)|there_exists(compose(X,Y)).
% 1.70/1.90  0 [] compose(X,compose(Y,Z))=compose(compose(X,Y),Z).
% 1.70/1.90  0 [] compose(X,domain(X))=X.
% 1.70/1.90  0 [] compose(codomain(X),X)=X.
% 1.70/1.90  0 [] X=Y|there_exists(X)|there_exists(Y).
% 1.70/1.90  0 [] -there_exists(X).
% 1.70/1.90  end_of_list.
% 1.70/1.90  
% 1.70/1.90  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.70/1.90  
% 1.70/1.90  This ia a non-Horn set with equality.  The strategy will be
% 1.70/1.90  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.70/1.90  deletion, with positive clauses in sos and nonpositive
% 1.70/1.90  clauses in usable.
% 1.70/1.90  
% 1.70/1.90     dependent: set(knuth_bendix).
% 1.70/1.90     dependent: set(anl_eq).
% 1.70/1.90     dependent: set(para_from).
% 1.70/1.90     dependent: set(para_into).
% 1.70/1.90     dependent: clear(para_from_right).
% 1.70/1.90     dependent: clear(para_into_right).
% 1.70/1.90     dependent: set(para_from_vars).
% 1.70/1.90     dependent: set(eq_units_both_ways).
% 1.70/1.90     dependent: set(dynamic_demod_all).
% 1.70/1.90     dependent: set(dynamic_demod).
% 1.70/1.90     dependent: set(order_eq).
% 1.70/1.90     dependent: set(back_demod).
% 1.70/1.90     dependent: set(lrpo).
% 1.70/1.90     dependent: set(hyper_res).
% 1.70/1.90     dependent: set(unit_deletion).
% 1.70/1.90     dependent: set(factor).
% 1.70/1.90  
% 1.70/1.90  ------------> process usable:
% 1.70/1.90  ** KEPT (pick-wt=5): 1 [] -e_quivalent(A,B)|there_exists(A).
% 1.70/1.90  ** KEPT (pick-wt=6): 2 [] -e_quivalent(A,B)|A=B.
% 1.70/1.90  ** KEPT (pick-wt=8): 3 [] -there_exists(A)|A!=B|e_quivalent(A,B).
% 1.70/1.90  ** KEPT (pick-wt=5): 4 [] -there_exists(domain(A))|there_exists(A).
% 1.70/1.90  ** KEPT (pick-wt=5): 5 [] -there_exists(codomain(A))|there_exists(A).
% 1.70/1.90  ** KEPT (pick-wt=7): 6 [] -there_exists(compose(A,B))|there_exists(domain(A)).
% 1.70/1.90  ** KEPT (pick-wt=9): 7 [] -there_exists(compose(A,B))|domain(A)=codomain(B).
% 1.70/1.90  ** KEPT (pick-wt=12): 8 [] -there_exists(domain(A))|domain(A)!=codomain(B)|there_exists(compose(A,B)).
% 1.70/1.90  ** KEPT (pick-wt=2): 9 [] -there_exists(A).
% 1.70/1.90  9 back subsumes 8.
% 1.70/1.90  9 back subsumes 7.
% 1.70/1.90  9 back subsumes 6.
% 1.70/1.90  9 back subsumes 5.
% 1.70/1.90  9 back subsumes 4.
% 1.70/1.90  9 back subsumes 3.
% 1.70/1.90  
% 1.70/1.90  ------------> process sos:
% 1.70/1.90  ** KEPT (pick-wt=3): 10 [] A=A.
% 1.70/1.90  ** KEPT (pick-wt=11): 12 [copy,11,flip.1] compose(compose(A,B),C)=compose(A,compose(B,C)).
% 1.70/1.90  ---> New Demodulator: 13 [new_demod,12] compose(compose(A,B),C)=compose(A,compose(B,C)).
% 1.70/1.90  ** KEPT (pick-wt=6): 14 [] compose(A,domain(A))=A.
% 1.70/1.90  ---> New Demodulator: 15 [new_demod,14] compose(A,domain(A))=A.
% 1.70/1.90  ** KEPT (pick-wt=6): 16 [] compose(codomain(A),A)=A.
% 1.70/1.90  ---> New Demodulator: 17 [new_demod,16] compose(codomain(A),A)=A.
% 1.70/1.90  ** KEPT (pick-wt=3): 19 [copy,18,unit_del,9,9] A=B.
% 1.70/1.90    Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] A=A.
% 1.70/1.90  >>>> Starting back demodulation with 13.
% 1.70/1.90  >>>> Starting back demodulation with 15.
% 1.70/1.90  >>>> Starting back demodulation with 17.
% 1.70/1.90    Following clause subsumed by 19 during input processing: 0 [copy,19,flip.1] A=B.
% 1.70/1.90  19 back subsumes 16.
% 1.70/1.90  19 back subsumes 14.
% 1.70/1.90  19 back subsumes 12.
% 1.70/1.90  19 back subsumes 10.
% 1.70/1.90  19 back subsumes 2.
% 1.70/1.90  
% 1.70/1.90  ======= end of input processing =======
% 1.70/1.90  
% 1.70/1.90  =========== start of search ===========
% 1.70/1.90  
% 1.70/1.90  Search stopped because sos empty.
% 1.70/1.90  
% 1.70/1.90  
% 1.70/1.90  Search stopped because sos empty.
% 1.70/1.90  
% 1.70/1.90  ============ end of search ============
% 1.70/1.90  
% 1.70/1.90  -------------- statistics -------------
% 1.70/1.90  clauses given                  1
% 1.70/1.90  clauses generated              0
% 1.70/1.90  clauses kept                  14
% 1.70/1.90  clauses forward subsumed       2
% 1.70/1.90  clauses back subsumed         11
% 1.70/1.90  Kbytes malloced              976
% 1.70/1.90  
% 1.70/1.90  ----------- times (seconds) -----------
% 1.70/1.90  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.70/1.90  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.70/1.90  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.70/1.90  
% 1.70/1.90  Process 21666 finished Wed Jul 27 02:03:45 2022
% 1.70/1.90  Otter interrupted
% 1.70/1.90  PROOF NOT FOUND
%------------------------------------------------------------------------------