TSTP Solution File: GRP727-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP727-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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:57:44 EDT 2022
% Result : Unknown 1.90s 2.11s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP727-1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n021.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 05:11:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.73/1.92 ----- Otter 3.3f, August 2004 -----
% 1.73/1.92 The process was started by sandbox on n021.cluster.edu,
% 1.73/1.92 Wed Jul 27 05:11:53 2022
% 1.73/1.92 The command was "./otter". The process ID is 2137.
% 1.73/1.92
% 1.73/1.92 set(prolog_style_variables).
% 1.73/1.92 set(auto).
% 1.73/1.92 dependent: set(auto1).
% 1.73/1.92 dependent: set(process_input).
% 1.73/1.92 dependent: clear(print_kept).
% 1.73/1.92 dependent: clear(print_new_demod).
% 1.73/1.92 dependent: clear(print_back_demod).
% 1.73/1.92 dependent: clear(print_back_sub).
% 1.73/1.92 dependent: set(control_memory).
% 1.73/1.92 dependent: assign(max_mem, 12000).
% 1.73/1.92 dependent: assign(pick_given_ratio, 4).
% 1.73/1.92 dependent: assign(stats_level, 1).
% 1.73/1.92 dependent: assign(max_seconds, 10800).
% 1.73/1.92 clear(print_given).
% 1.73/1.92
% 1.73/1.92 list(usable).
% 1.73/1.92 0 [] A=A.
% 1.73/1.92 0 [] mult(unit,A)=A.
% 1.73/1.92 0 [] mult(A,unit)=A.
% 1.73/1.92 0 [] mult(A,i(A))=unit.
% 1.73/1.92 0 [] mult(i(A),A)=unit.
% 1.73/1.92 0 [] i(mult(A,B))=mult(i(A),i(B)).
% 1.73/1.92 0 [] mult(i(A),mult(A,B))=B.
% 1.73/1.92 0 [] rd(mult(A,B),B)=A.
% 1.73/1.92 0 [] mult(rd(A,B),B)=A.
% 1.73/1.92 0 [] mult(mult(A,mult(B,A)),C)=mult(A,mult(B,mult(A,C))).
% 1.73/1.92 0 [] mult(mult(A,B),C)=mult(mult(A,mult(B,C)),asoc(A,B,C)).
% 1.73/1.92 0 [] op_l(A,B,C)=mult(i(mult(C,B)),mult(C,mult(B,A))).
% 1.73/1.92 0 [] op_r(A,B,C)=rd(mult(mult(A,B),C),mult(B,C)).
% 1.73/1.92 0 [] op_t(A,B)=mult(i(B),mult(A,B)).
% 1.73/1.92 0 [] op_r(op_r(A,B,C),D,E)=op_r(op_r(A,D,E),B,C).
% 1.73/1.92 0 [] op_l(op_r(A,B,C),D,E)=op_r(op_l(A,D,E),B,C).
% 1.73/1.92 0 [] op_l(op_l(A,B,C),D,E)=op_l(op_l(A,D,E),B,C).
% 1.73/1.92 0 [] op_t(op_r(A,B,C),D)=op_r(op_t(A,D),B,C).
% 1.73/1.92 0 [] op_t(op_l(A,B,C),D)=op_l(op_t(A,D),B,C).
% 1.73/1.92 0 [] op_t(op_t(A,B),C)=op_t(op_t(A,C),B).
% 1.73/1.92 0 [] asoc(asoc(A,B,C),D,E)=unit.
% 1.73/1.92 0 [] asoc(a,b,asoc(c,d,e))!=unit.
% 1.73/1.92 end_of_list.
% 1.73/1.92
% 1.73/1.92 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.73/1.92
% 1.73/1.92 All clauses are units, and equality is present; the
% 1.73/1.92 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.73/1.92
% 1.73/1.92 dependent: set(knuth_bendix).
% 1.73/1.92 dependent: set(anl_eq).
% 1.73/1.92 dependent: set(para_from).
% 1.73/1.92 dependent: set(para_into).
% 1.73/1.92 dependent: clear(para_from_right).
% 1.73/1.92 dependent: clear(para_into_right).
% 1.73/1.92 dependent: set(para_from_vars).
% 1.73/1.92 dependent: set(eq_units_both_ways).
% 1.73/1.92 dependent: set(dynamic_demod_all).
% 1.73/1.92 dependent: set(dynamic_demod).
% 1.73/1.92 dependent: set(order_eq).
% 1.73/1.92 dependent: set(back_demod).
% 1.73/1.92 dependent: set(lrpo).
% 1.73/1.92
% 1.73/1.92 ------------> process usable:
% 1.73/1.92 ** KEPT (pick-wt=9): 1 [] asoc(a,b,asoc(c,d,e))!=unit.
% 1.73/1.92
% 1.73/1.92 ------------> process sos:
% 1.73/1.92 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.73/1.92 ** KEPT (pick-wt=5): 3 [] mult(unit,A)=A.
% 1.73/1.92 ---> New Demodulator: 4 [new_demod,3] mult(unit,A)=A.
% 1.73/1.92 ** KEPT (pick-wt=5): 5 [] mult(A,unit)=A.
% 1.73/1.92 ---> New Demodulator: 6 [new_demod,5] mult(A,unit)=A.
% 1.73/1.92 ** KEPT (pick-wt=6): 7 [] mult(A,i(A))=unit.
% 1.73/1.92 ---> New Demodulator: 8 [new_demod,7] mult(A,i(A))=unit.
% 1.73/1.92 ** KEPT (pick-wt=6): 9 [] mult(i(A),A)=unit.
% 1.73/1.92 ---> New Demodulator: 10 [new_demod,9] mult(i(A),A)=unit.
% 1.73/1.92 ** KEPT (pick-wt=10): 11 [] i(mult(A,B))=mult(i(A),i(B)).
% 1.73/1.92 ---> New Demodulator: 12 [new_demod,11] i(mult(A,B))=mult(i(A),i(B)).
% 1.73/1.92 ** KEPT (pick-wt=8): 13 [] mult(i(A),mult(A,B))=B.
% 1.73/1.92 ---> New Demodulator: 14 [new_demod,13] mult(i(A),mult(A,B))=B.
% 1.73/1.92 ** KEPT (pick-wt=7): 15 [] rd(mult(A,B),B)=A.
% 1.73/1.92 ---> New Demodulator: 16 [new_demod,15] rd(mult(A,B),B)=A.
% 1.73/1.92 ** KEPT (pick-wt=7): 17 [] mult(rd(A,B),B)=A.
% 1.73/1.92 ---> New Demodulator: 18 [new_demod,17] mult(rd(A,B),B)=A.
% 1.73/1.92 ** KEPT (pick-wt=15): 19 [] mult(mult(A,mult(B,A)),C)=mult(A,mult(B,mult(A,C))).
% 1.73/1.92 ---> New Demodulator: 20 [new_demod,19] mult(mult(A,mult(B,A)),C)=mult(A,mult(B,mult(A,C))).
% 1.73/1.92 ** KEPT (pick-wt=16): 22 [copy,21,flip.1] mult(mult(A,mult(B,C)),asoc(A,B,C))=mult(mult(A,B),C).
% 1.73/1.92 ---> New Demodulator: 23 [new_demod,22] mult(mult(A,mult(B,C)),asoc(A,B,C))=mult(mult(A,B),C).
% 1.73/1.92 ** KEPT (pick-wt=16): 25 [copy,24,demod,12,flip.1] mult(mult(i(A),i(B)),mult(A,mult(B,C)))=op_l(C,B,A).
% 1.73/1.92 ---> New Demodulator: 26 [new_demod,25] mult(mult(i(A),i(B)),mult(A,mult(B,C)))=op_l(C,B,A).
% 1.73/1.92 ** KEPT (pick-wt=14): 28 [copy,27,flip.1] rd(mult(mult(A,B),C),mult(B,C))=op_r(A,B,C).
% 1.73/1.92 ---> New Demodulator: 29 [new_demod,28] rd(mult(mult(A,B),C),mult(B,C))=op_r(A,B,C).
% 1.73/1.92 ** KEPT (pick-wt=10): 30 [] op_t(A,B)=mult(i(B),mult(A,B)).
% 1.73/1.92 ** KEPT (pick-wt=15): 31 [] op_r(op_r(A,B,C),D,E)=op_r(op_r(A,D,E),B,C).
% 1.73/1.92 ** KEPT (pick-wt=15): 33 [copy,32,flip.1] op_r(op_l(A,B,C),D,E)=op_l(op_r(A,D,E),B,C).
% 1.73/1.92 ---> New Demodulator: 34 [new_demod,33] op_r(op_l(A,B,C),D,E)=op_l(op_r(A,D,E),B,C).
% 1.90/2.10 ** KEPT (pick-wt=15): 35 [] op_l(op_l(A,B,C),D,E)=op_l(op_l(A,D,E),B,C).
% 1.90/2.10 ** KEPT (pick-wt=13): 36 [] op_t(op_r(A,B,C),D)=op_r(op_t(A,D),B,C).
% 1.90/2.10 ---> New Demodulator: 37 [new_demod,36] op_t(op_r(A,B,C),D)=op_r(op_t(A,D),B,C).
% 1.90/2.10 ** KEPT (pick-wt=13): 38 [] op_t(op_l(A,B,C),D)=op_l(op_t(A,D),B,C).
% 1.90/2.10 ---> New Demodulator: 39 [new_demod,38] op_t(op_l(A,B,C),D)=op_l(op_t(A,D),B,C).
% 1.90/2.10 ** KEPT (pick-wt=11): 40 [] op_t(op_t(A,B),C)=op_t(op_t(A,C),B).
% 1.90/2.10 ** KEPT (pick-wt=9): 41 [] asoc(asoc(A,B,C),D,E)=unit.
% 1.90/2.10 ---> New Demodulator: 42 [new_demod,41] asoc(asoc(A,B,C),D,E)=unit.
% 1.90/2.10 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.90/2.10 >>>> Starting back demodulation with 4.
% 1.90/2.10 >>>> Starting back demodulation with 6.
% 1.90/2.10 >>>> Starting back demodulation with 8.
% 1.90/2.10 >>>> Starting back demodulation with 10.
% 1.90/2.10 >>>> Starting back demodulation with 12.
% 1.90/2.10 >>>> Starting back demodulation with 14.
% 1.90/2.10 >>>> Starting back demodulation with 16.
% 1.90/2.10 >>>> Starting back demodulation with 18.
% 1.90/2.10 >>>> Starting back demodulation with 20.
% 1.90/2.10 >>>> Starting back demodulation with 23.
% 1.90/2.10 >>>> Starting back demodulation with 26.
% 1.90/2.10 >>>> Starting back demodulation with 29.
% 1.90/2.10 ** KEPT (pick-wt=10): 43 [copy,30,flip.1] mult(i(A),mult(B,A))=op_t(B,A).
% 1.90/2.10 Following clause subsumed by 31 during input processing: 0 [copy,31,flip.1] op_r(op_r(A,B,C),D,E)=op_r(op_r(A,D,E),B,C).
% 1.90/2.10 >>>> Starting back demodulation with 34.
% 1.90/2.10 Following clause subsumed by 35 during input processing: 0 [copy,35,flip.1] op_l(op_l(A,B,C),D,E)=op_l(op_l(A,D,E),B,C).
% 1.90/2.10 >>>> Starting back demodulation with 37.
% 1.90/2.10 >>>> Starting back demodulation with 39.
% 1.90/2.10 Following clause subsumed by 40 during input processing: 0 [copy,40,flip.1] op_t(op_t(A,B),C)=op_t(op_t(A,C),B).
% 1.90/2.10 >>>> Starting back demodulation with 42.
% 1.90/2.10 Following clause subsumed by 30 during input processing: 0 [copy,43,flip.1] op_t(A,B)=mult(i(B),mult(A,B)).
% 1.90/2.10
% 1.90/2.10 ======= end of input processing =======
% 1.90/2.10
% 1.90/2.10 =========== start of search ===========
% 1.90/2.10
% 1.90/2.10
% 1.90/2.10 Resetting weight limit to 11.
% 1.90/2.10
% 1.90/2.10
% 1.90/2.10 Resetting weight limit to 11.
% 1.90/2.10
% 1.90/2.10 sos_size=140
% 1.90/2.10
% 1.90/2.10 Search stopped because sos empty.
% 1.90/2.10
% 1.90/2.10
% 1.90/2.10 Search stopped because sos empty.
% 1.90/2.10
% 1.90/2.10 ============ end of search ============
% 1.90/2.10
% 1.90/2.10 -------------- statistics -------------
% 1.90/2.10 clauses given 278
% 1.90/2.10 clauses generated 28940
% 1.90/2.10 clauses kept 329
% 1.90/2.10 clauses forward subsumed 8069
% 1.90/2.10 clauses back subsumed 0
% 1.90/2.10 Kbytes malloced 8789
% 1.90/2.10
% 1.90/2.10 ----------- times (seconds) -----------
% 1.90/2.10 user CPU time 0.18 (0 hr, 0 min, 0 sec)
% 1.90/2.10 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.90/2.10 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.90/2.10
% 1.90/2.10 Process 2137 finished Wed Jul 27 05:11:54 2022
% 1.90/2.10 Otter interrupted
% 1.90/2.10 PROOF NOT FOUND
%------------------------------------------------------------------------------