TSTP Solution File: GRP666+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP666+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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 1.76s 2.00s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP666+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n027.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:48:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.72/1.97 ----- Otter 3.3f, August 2004 -----
% 1.72/1.97 The process was started by sandbox on n027.cluster.edu,
% 1.72/1.97 Wed Jul 27 05:48:36 2022
% 1.72/1.97 The command was "./otter". The process ID is 23641.
% 1.72/1.97
% 1.72/1.97 set(prolog_style_variables).
% 1.72/1.97 set(auto).
% 1.72/1.97 dependent: set(auto1).
% 1.72/1.97 dependent: set(process_input).
% 1.72/1.97 dependent: clear(print_kept).
% 1.72/1.97 dependent: clear(print_new_demod).
% 1.72/1.97 dependent: clear(print_back_demod).
% 1.72/1.97 dependent: clear(print_back_sub).
% 1.72/1.97 dependent: set(control_memory).
% 1.72/1.97 dependent: assign(max_mem, 12000).
% 1.72/1.97 dependent: assign(pick_given_ratio, 4).
% 1.72/1.97 dependent: assign(stats_level, 1).
% 1.72/1.97 dependent: assign(max_seconds, 10800).
% 1.72/1.97 clear(print_given).
% 1.72/1.97
% 1.72/1.97 formula_list(usable).
% 1.72/1.97 all A (A=A).
% 1.72/1.97 all B A (mult(A,ld(A,B))=B).
% 1.72/1.97 all B A (ld(A,mult(A,B))=B).
% 1.72/1.97 all B A (mult(rd(A,B),B)=A).
% 1.72/1.97 all B A (rd(mult(A,B),B)=A).
% 1.72/1.97 all A (mult(A,unit)=A).
% 1.72/1.97 all A (mult(unit,A)=A).
% 1.72/1.97 all B A (mult(i(A),mult(A,B))=B).
% 1.72/1.97 all B A (mult(mult(A,B),i(B))=A).
% 1.72/1.97 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.72/1.97 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.72/1.97 all C B A (ld(A,mult(mult(B,C),A))=mult(ld(A,mult(B,A)),ld(A,mult(C,A)))).
% 1.72/1.97 all X0 X1 X2 (mult(X0,mult(X1,mult(X2,X1)))=mult(mult(mult(X0,X1),X2),X1)->mult(X1,mult(X0,mult(X1,X2)))=mult(mult(mult(X1,X0),X1),X2)).
% 1.72/1.97 all X3 X4 X5 (mult(mult(X3,X4),mult(X5,X3))=mult(mult(X3,mult(X4,X5)),X3)->mult(X3,mult(X4,mult(X3,X5)))=mult(mult(mult(X3,X4),X3),X5)).
% 1.72/1.97 all X6 X7 X8 (mult(mult(X6,X7),mult(X8,X6))=mult(X6,mult(mult(X7,X8),X6))->mult(X6,mult(X7,mult(X6,X8)))=mult(mult(mult(X6,X7),X6),X8)).
% 1.72/1.97 mult(a,mult(b,mult(a,c)))!=mult(mult(mult(a,b),a),c).
% 1.72/1.97 end_of_list.
% 1.72/1.97
% 1.72/1.97 -------> usable clausifies to:
% 1.72/1.97
% 1.72/1.97 list(usable).
% 1.72/1.97 0 [] A=A.
% 1.72/1.97 0 [] mult(A,ld(A,B))=B.
% 1.72/1.97 0 [] ld(A,mult(A,B))=B.
% 1.72/1.97 0 [] mult(rd(A,B),B)=A.
% 1.72/1.97 0 [] rd(mult(A,B),B)=A.
% 1.72/1.97 0 [] mult(A,unit)=A.
% 1.72/1.97 0 [] mult(unit,A)=A.
% 1.72/1.97 0 [] mult(i(A),mult(A,B))=B.
% 1.72/1.97 0 [] mult(mult(A,B),i(B))=A.
% 1.72/1.97 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.72/1.97 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.72/1.97 0 [] ld(A,mult(mult(B,C),A))=mult(ld(A,mult(B,A)),ld(A,mult(C,A))).
% 1.72/1.97 0 [] mult(X0,mult(X1,mult(X2,X1)))!=mult(mult(mult(X0,X1),X2),X1)|mult(X1,mult(X0,mult(X1,X2)))=mult(mult(mult(X1,X0),X1),X2).
% 1.72/1.97 0 [] mult(mult(X3,X4),mult(X5,X3))!=mult(mult(X3,mult(X4,X5)),X3)|mult(X3,mult(X4,mult(X3,X5)))=mult(mult(mult(X3,X4),X3),X5).
% 1.72/1.97 0 [] mult(mult(X6,X7),mult(X8,X6))!=mult(X6,mult(mult(X7,X8),X6))|mult(X6,mult(X7,mult(X6,X8)))=mult(mult(mult(X6,X7),X6),X8).
% 1.72/1.97 0 [] mult(a,mult(b,mult(a,c)))!=mult(mult(mult(a,b),a),c).
% 1.72/1.97 end_of_list.
% 1.72/1.97
% 1.72/1.97 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.72/1.97
% 1.72/1.97 This is a Horn set with equality. The strategy will be
% 1.72/1.97 Knuth-Bendix and hyper_res, with positive clauses in
% 1.72/1.97 sos and nonpositive clauses in usable.
% 1.72/1.97
% 1.72/1.97 dependent: set(knuth_bendix).
% 1.72/1.97 dependent: set(anl_eq).
% 1.72/1.97 dependent: set(para_from).
% 1.72/1.97 dependent: set(para_into).
% 1.72/1.97 dependent: clear(para_from_right).
% 1.72/1.97 dependent: clear(para_into_right).
% 1.72/1.97 dependent: set(para_from_vars).
% 1.72/1.97 dependent: set(eq_units_both_ways).
% 1.72/1.97 dependent: set(dynamic_demod_all).
% 1.72/1.97 dependent: set(dynamic_demod).
% 1.72/1.97 dependent: set(order_eq).
% 1.72/1.97 dependent: set(back_demod).
% 1.72/1.97 dependent: set(lrpo).
% 1.72/1.97 dependent: set(hyper_res).
% 1.72/1.97 dependent: clear(order_hyper).
% 1.72/1.97
% 1.72/1.97 ------------> process usable:
% 1.72/1.97 ** KEPT (pick-wt=30): 2 [copy,1,flip.1,flip.2] mult(mult(mult(A,B),C),B)!=mult(A,mult(B,mult(C,B)))|mult(mult(mult(B,A),B),C)=mult(B,mult(A,mult(B,C))).
% 1.72/1.97 ** KEPT (pick-wt=30): 4 [copy,3,flip.1,flip.2] mult(mult(A,mult(B,C)),A)!=mult(mult(A,B),mult(C,A))|mult(mult(mult(A,B),A),C)=mult(A,mult(B,mult(A,C))).
% 1.72/1.97 ** KEPT (pick-wt=30): 6 [copy,5,flip.2] mult(mult(A,B),mult(C,A))!=mult(A,mult(mult(B,C),A))|mult(mult(mult(A,B),A),C)=mult(A,mult(B,mult(A,C))).
% 1.72/1.97 ** KEPT (pick-wt=15): 8 [copy,7,flip.1] mult(mult(mult(a,b),a),c)!=mult(a,mult(b,mult(a,c))).
% 1.72/1.97
% 1.72/1.97 ------------> process sos:
% 1.72/1.97 ** KEPT (pick-wt=3): 9 [] A=A.
% 1.72/1.97 ** KEPT (pick-wt=7): 10 [] mult(A,ld(A,B))=B.
% 1.76/2.00 ---> New Demodulator: 11 [new_demod,10] mult(A,ld(A,B))=B.
% 1.76/2.00 ** KEPT (pick-wt=7): 12 [] ld(A,mult(A,B))=B.
% 1.76/2.00 ---> New Demodulator: 13 [new_demod,12] ld(A,mult(A,B))=B.
% 1.76/2.00 ** KEPT (pick-wt=7): 14 [] mult(rd(A,B),B)=A.
% 1.76/2.00 ---> New Demodulator: 15 [new_demod,14] mult(rd(A,B),B)=A.
% 1.76/2.00 ** KEPT (pick-wt=7): 16 [] rd(mult(A,B),B)=A.
% 1.76/2.00 ---> New Demodulator: 17 [new_demod,16] rd(mult(A,B),B)=A.
% 1.76/2.00 ** KEPT (pick-wt=5): 18 [] mult(A,unit)=A.
% 1.76/2.00 ---> New Demodulator: 19 [new_demod,18] mult(A,unit)=A.
% 1.76/2.00 ** KEPT (pick-wt=5): 20 [] mult(unit,A)=A.
% 1.76/2.00 ---> New Demodulator: 21 [new_demod,20] mult(unit,A)=A.
% 1.76/2.00 ** KEPT (pick-wt=8): 22 [] mult(i(A),mult(A,B))=B.
% 1.76/2.00 ---> New Demodulator: 23 [new_demod,22] mult(i(A),mult(A,B))=B.
% 1.76/2.00 ** KEPT (pick-wt=8): 24 [] mult(mult(A,B),i(B))=A.
% 1.76/2.00 ---> New Demodulator: 25 [new_demod,24] mult(mult(A,B),i(B))=A.
% 1.76/2.00 ** KEPT (pick-wt=31): 27 [copy,26,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)))).
% 1.76/2.00 ---> New Demodulator: 28 [new_demod,27] 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)))).
% 1.76/2.00 ** KEPT (pick-wt=31): 29 [] 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.76/2.00 ---> New Demodulator: 30 [new_demod,29] 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.76/2.00 ** KEPT (pick-wt=19): 31 [] ld(A,mult(mult(B,C),A))=mult(ld(A,mult(B,A)),ld(A,mult(C,A))).
% 1.76/2.00 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] A=A.
% 1.76/2.00 >>>> Starting back demodulation with 11.
% 1.76/2.00 >>>> Starting back demodulation with 13.
% 1.76/2.00 >>>> Starting back demodulation with 15.
% 1.76/2.00 >>>> Starting back demodulation with 17.
% 1.76/2.00 >>>> Starting back demodulation with 19.
% 1.76/2.00 >>>> Starting back demodulation with 21.
% 1.76/2.00 >>>> Starting back demodulation with 23.
% 1.76/2.00 >>>> Starting back demodulation with 25.
% 1.76/2.00 >>>> Starting back demodulation with 28.
% 1.76/2.00 >>>> Starting back demodulation with 30.
% 1.76/2.00 ** KEPT (pick-wt=19): 32 [copy,31,flip.1] mult(ld(A,mult(B,A)),ld(A,mult(C,A)))=ld(A,mult(mult(B,C),A)).
% 1.76/2.00 Following clause subsumed by 31 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))).
% 1.76/2.00
% 1.76/2.00 ======= end of input processing =======
% 1.76/2.00
% 1.76/2.00 =========== start of search ===========
% 1.76/2.00
% 1.76/2.00
% 1.76/2.00 Resetting weight limit to 9.
% 1.76/2.00
% 1.76/2.00
% 1.76/2.00 Resetting weight limit to 9.
% 1.76/2.00
% 1.76/2.00 sos_size=77
% 1.76/2.00
% 1.76/2.00 Search stopped because sos empty.
% 1.76/2.00
% 1.76/2.00
% 1.76/2.00 Search stopped because sos empty.
% 1.76/2.00
% 1.76/2.00 ============ end of search ============
% 1.76/2.00
% 1.76/2.00 -------------- statistics -------------
% 1.76/2.00 clauses given 27
% 1.76/2.00 clauses generated 331
% 1.76/2.00 clauses kept 235
% 1.76/2.00 clauses forward subsumed 247
% 1.76/2.00 clauses back subsumed 3
% 1.76/2.00 Kbytes malloced 4882
% 1.76/2.00
% 1.76/2.00 ----------- times (seconds) -----------
% 1.76/2.00 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 1.76/2.00 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.76/2.00 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.76/2.00
% 1.76/2.00 Process 23641 finished Wed Jul 27 05:48:38 2022
% 1.76/2.00 Otter interrupted
% 1.76/2.00 PROOF NOT FOUND
%------------------------------------------------------------------------------