TSTP Solution File: GRP666+6 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP666+6 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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:36 EDT 2022
% Result : Unknown 2.47s 2.66s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP666+6 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n024.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:06:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.60/1.82 ----- Otter 3.3f, August 2004 -----
% 1.60/1.82 The process was started by sandbox2 on n024.cluster.edu,
% 1.60/1.82 Wed Jul 27 05:06:55 2022
% 1.60/1.82 The command was "./otter". The process ID is 17358.
% 1.60/1.82
% 1.60/1.82 set(prolog_style_variables).
% 1.60/1.82 set(auto).
% 1.60/1.82 dependent: set(auto1).
% 1.60/1.82 dependent: set(process_input).
% 1.60/1.82 dependent: clear(print_kept).
% 1.60/1.82 dependent: clear(print_new_demod).
% 1.60/1.82 dependent: clear(print_back_demod).
% 1.60/1.82 dependent: clear(print_back_sub).
% 1.60/1.82 dependent: set(control_memory).
% 1.60/1.82 dependent: assign(max_mem, 12000).
% 1.60/1.82 dependent: assign(pick_given_ratio, 4).
% 1.60/1.82 dependent: assign(stats_level, 1).
% 1.60/1.82 dependent: assign(max_seconds, 10800).
% 1.60/1.82 clear(print_given).
% 1.60/1.82
% 1.60/1.82 formula_list(usable).
% 1.60/1.82 all A (A=A).
% 1.60/1.82 all B A (mult(A,ld(A,B))=B).
% 1.60/1.82 all B A (ld(A,mult(A,B))=B).
% 1.60/1.82 all B A (mult(rd(A,B),B)=A).
% 1.60/1.82 all B A (rd(mult(A,B),B)=A).
% 1.60/1.82 all A (mult(A,unit)=A).
% 1.60/1.82 all A (mult(unit,A)=A).
% 1.60/1.82 all D C B A (ld(mult(A,B),mult(A,mult(B,mult(C,D))))=mult(ld(mult(A,B),mult(A,mult(B,C))),ld(mult(A,B),mult(A,mult(B,D))))).
% 1.60/1.82 all D C B A (rd(mult(mult(mult(A,B),C),D),mult(C,D))=mult(rd(mult(mult(A,C),D),mult(C,D)),rd(mult(mult(B,C),D),mult(C,D)))).
% 1.60/1.82 all C B A (ld(A,mult(mult(B,C),A))=mult(ld(A,mult(B,A)),ld(A,mult(C,A)))).
% 1.60/1.82 all B A (mult(i(A),mult(A,B))=B).
% 1.60/1.82 all B A (mult(mult(A,B),i(B))=A).
% 1.60/1.82 -((all X0 X1 X2 (mult(X2,mult(X0,mult(X2,X1)))=mult(mult(mult(X2,X0),X2),X1)))| (all X3 X4 X5 (mult(X3,mult(X5,mult(X4,X5)))=mult(mult(mult(X3,X5),X4),X5)))| (all X6 X7 X8 (mult(mult(X8,X6),mult(X7,X8))=mult(mult(X8,mult(X6,X7)),X8)))| (all X9 X10 X11 (mult(mult(X11,X9),mult(X10,X11))=mult(X11,mult(mult(X9,X10),X11))))).
% 1.60/1.82 end_of_list.
% 1.60/1.82
% 1.60/1.82 -------> usable clausifies to:
% 1.60/1.82
% 1.60/1.82 list(usable).
% 1.60/1.82 0 [] A=A.
% 1.60/1.82 0 [] mult(A,ld(A,B))=B.
% 1.60/1.82 0 [] ld(A,mult(A,B))=B.
% 1.60/1.82 0 [] mult(rd(A,B),B)=A.
% 1.60/1.82 0 [] rd(mult(A,B),B)=A.
% 1.60/1.82 0 [] mult(A,unit)=A.
% 1.60/1.82 0 [] mult(unit,A)=A.
% 1.60/1.82 0 [] ld(mult(A,B),mult(A,mult(B,mult(C,D))))=mult(ld(mult(A,B),mult(A,mult(B,C))),ld(mult(A,B),mult(A,mult(B,D)))).
% 1.60/1.82 0 [] rd(mult(mult(mult(A,B),C),D),mult(C,D))=mult(rd(mult(mult(A,C),D),mult(C,D)),rd(mult(mult(B,C),D),mult(C,D))).
% 1.60/1.82 0 [] ld(A,mult(mult(B,C),A))=mult(ld(A,mult(B,A)),ld(A,mult(C,A))).
% 1.60/1.82 0 [] mult(i(A),mult(A,B))=B.
% 1.60/1.82 0 [] mult(mult(A,B),i(B))=A.
% 1.60/1.82 0 [] mult($c1,mult($c3,mult($c1,$c2)))!=mult(mult(mult($c1,$c3),$c1),$c2).
% 1.60/1.82 0 [] mult($c6,mult($c4,mult($c5,$c4)))!=mult(mult(mult($c6,$c4),$c5),$c4).
% 1.60/1.82 0 [] mult(mult($c7,$c9),mult($c8,$c7))!=mult(mult($c7,mult($c9,$c8)),$c7).
% 1.60/1.82 0 [] mult(mult($c10,$c12),mult($c11,$c10))!=mult($c10,mult(mult($c12,$c11),$c10)).
% 1.60/1.82 end_of_list.
% 1.60/1.82
% 1.60/1.82 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.60/1.82
% 1.60/1.82 All clauses are units, and equality is present; the
% 1.60/1.82 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.60/1.82
% 1.60/1.82 dependent: set(knuth_bendix).
% 1.60/1.82 dependent: set(anl_eq).
% 1.60/1.82 dependent: set(para_from).
% 1.60/1.82 dependent: set(para_into).
% 1.60/1.82 dependent: clear(para_from_right).
% 1.60/1.82 dependent: clear(para_into_right).
% 1.60/1.82 dependent: set(para_from_vars).
% 1.60/1.82 dependent: set(eq_units_both_ways).
% 1.60/1.82 dependent: set(dynamic_demod_all).
% 1.60/1.82 dependent: set(dynamic_demod).
% 1.60/1.82 dependent: set(order_eq).
% 1.60/1.82 dependent: set(back_demod).
% 1.60/1.82 dependent: set(lrpo).
% 1.60/1.82
% 1.60/1.82 ------------> process usable:
% 1.60/1.82 ** KEPT (pick-wt=15): 2 [copy,1,flip.1] mult(mult(mult($c1,$c3),$c1),$c2)!=mult($c1,mult($c3,mult($c1,$c2))).
% 1.60/1.82 ** KEPT (pick-wt=15): 4 [copy,3,flip.1] mult(mult(mult($c6,$c4),$c5),$c4)!=mult($c6,mult($c4,mult($c5,$c4))).
% 1.60/1.82 ** KEPT (pick-wt=15): 6 [copy,5,flip.1] mult(mult($c7,mult($c9,$c8)),$c7)!=mult(mult($c7,$c9),mult($c8,$c7)).
% 1.60/1.82 ** KEPT (pick-wt=15): 8 [copy,7,flip.1] mult($c10,mult(mult($c12,$c11),$c10))!=mult(mult($c10,$c12),mult($c11,$c10)).
% 1.60/1.82
% 1.60/1.82 ------------> process sos:
% 1.60/1.82 ** KEPT (pick-wt=3): 9 [] A=A.
% 1.60/1.82 ** KEPT (pick-wt=7): 10 [] mult(A,ld(A,B))=B.
% 1.60/1.82 ---> New Demodulator: 11 [new_demod,10] mult(A,ld(A,B))=B.
% 1.60/1.82 ** KEPT (pick-wt=7): 12 [] ld(A,mult(A,B))=B.
% 1.60/1.82 ---> New Demodulator: 13 [new_demod,12] ld(A,mult(A,B))=B.
% 1.60/1.82 ** KEPT (pick-wt=7): 14 [] mult(rd(A,B),B)=A.
% 1.60/1.82 ---> New Demodulator: 15 [new_demod,14] mult(rd(A,B),B)=A.
% 1.60/1.82 ** KEPT (pick-wt=7): 16 [] rd(mult(A,B),B)=A.
% 1.60/1.82 ---> New Demodulator: 17 [new_demod,16] rd(mult(A,B),B)=A.
% 1.60/1.82 ** KEPT (pick-wt=5): 18 [] mult(A,unit)=A.
% 1.60/1.82 ---> New Demodulator: 19 [new_demod,18] mult(A,unit)=A.
% 2.47/2.66 ** KEPT (pick-wt=5): 20 [] mult(unit,A)=A.
% 2.47/2.66 ---> New Demodulator: 21 [new_demod,20] mult(unit,A)=A.
% 2.47/2.66 ** KEPT (pick-wt=31): 23 [copy,22,flip.1] mult(ld(mult(A,B),mult(A,mult(B,C))),ld(mult(A,B),mult(A,mult(B,D))))=ld(mult(A,B),mult(A,mult(B,mult(C,D)))).
% 2.47/2.66 ---> New Demodulator: 24 [new_demod,23] mult(ld(mult(A,B),mult(A,mult(B,C))),ld(mult(A,B),mult(A,mult(B,D))))=ld(mult(A,B),mult(A,mult(B,mult(C,D)))).
% 2.47/2.66 ** KEPT (pick-wt=31): 25 [] rd(mult(mult(mult(A,B),C),D),mult(C,D))=mult(rd(mult(mult(A,C),D),mult(C,D)),rd(mult(mult(B,C),D),mult(C,D))).
% 2.47/2.66 ---> New Demodulator: 26 [new_demod,25] rd(mult(mult(mult(A,B),C),D),mult(C,D))=mult(rd(mult(mult(A,C),D),mult(C,D)),rd(mult(mult(B,C),D),mult(C,D))).
% 2.47/2.66 ** KEPT (pick-wt=19): 27 [] ld(A,mult(mult(B,C),A))=mult(ld(A,mult(B,A)),ld(A,mult(C,A))).
% 2.47/2.66 ** KEPT (pick-wt=8): 28 [] mult(i(A),mult(A,B))=B.
% 2.47/2.66 ---> New Demodulator: 29 [new_demod,28] mult(i(A),mult(A,B))=B.
% 2.47/2.66 ** KEPT (pick-wt=8): 30 [] mult(mult(A,B),i(B))=A.
% 2.47/2.66 ---> New Demodulator: 31 [new_demod,30] mult(mult(A,B),i(B))=A.
% 2.47/2.66 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] A=A.
% 2.47/2.66 >>>> Starting back demodulation with 11.
% 2.47/2.66 >>>> Starting back demodulation with 13.
% 2.47/2.66 >>>> Starting back demodulation with 15.
% 2.47/2.66 >>>> Starting back demodulation with 17.
% 2.47/2.66 >>>> Starting back demodulation with 19.
% 2.47/2.66 >>>> Starting back demodulation with 21.
% 2.47/2.66 >>>> Starting back demodulation with 24.
% 2.47/2.66 >>>> Starting back demodulation with 26.
% 2.47/2.66 ** KEPT (pick-wt=19): 32 [copy,27,flip.1] mult(ld(A,mult(B,A)),ld(A,mult(C,A)))=ld(A,mult(mult(B,C),A)).
% 2.47/2.66 >>>> Starting back demodulation with 29.
% 2.47/2.66 >>>> Starting back demodulation with 31.
% 2.47/2.66 Following clause subsumed by 27 during input processing: 0 [copy,32,flip.1] ld(A,mult(mult(B,C),A))=mult(ld(A,mult(B,A)),ld(A,mult(C,A))).
% 2.47/2.66
% 2.47/2.66 ======= end of input processing =======
% 2.47/2.66
% 2.47/2.66 =========== start of search ===========
% 2.47/2.66
% 2.47/2.66
% 2.47/2.66 Resetting weight limit to 23.
% 2.47/2.66
% 2.47/2.66
% 2.47/2.66 Resetting weight limit to 23.
% 2.47/2.66
% 2.47/2.66 sos_size=33
% 2.47/2.66
% 2.47/2.66
% 2.47/2.66 Resetting weight limit to 15.
% 2.47/2.66
% 2.47/2.66
% 2.47/2.66 Resetting weight limit to 15.
% 2.47/2.66
% 2.47/2.66 sos_size=77
% 2.47/2.66
% 2.47/2.66 Search stopped because sos empty.
% 2.47/2.66
% 2.47/2.66
% 2.47/2.66 Search stopped because sos empty.
% 2.47/2.66
% 2.47/2.66 ============ end of search ============
% 2.47/2.66
% 2.47/2.66 -------------- statistics -------------
% 2.47/2.66 clauses given 149
% 2.47/2.66 clauses generated 39878
% 2.47/2.66 clauses kept 295
% 2.47/2.66 clauses forward subsumed 14102
% 2.47/2.66 clauses back subsumed 0
% 2.47/2.66 Kbytes malloced 5859
% 2.47/2.66
% 2.47/2.66 ----------- times (seconds) -----------
% 2.47/2.66 user CPU time 0.84 (0 hr, 0 min, 0 sec)
% 2.47/2.66 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.47/2.66 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.47/2.66
% 2.47/2.66 Process 17358 finished Wed Jul 27 05:06:57 2022
% 2.47/2.66 Otter interrupted
% 2.47/2.66 PROOF NOT FOUND
%------------------------------------------------------------------------------