TSTP Solution File: GRP666-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP666-3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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.95s 3.13s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP666-3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n015.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:32:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.94/2.13 ----- Otter 3.3f, August 2004 -----
% 1.94/2.13 The process was started by sandbox on n015.cluster.edu,
% 1.94/2.13 Wed Jul 27 05:32:56 2022
% 1.94/2.13 The command was "./otter". The process ID is 12554.
% 1.94/2.13
% 1.94/2.13 set(prolog_style_variables).
% 1.94/2.13 set(auto).
% 1.94/2.13 dependent: set(auto1).
% 1.94/2.13 dependent: set(process_input).
% 1.94/2.13 dependent: clear(print_kept).
% 1.94/2.13 dependent: clear(print_new_demod).
% 1.94/2.13 dependent: clear(print_back_demod).
% 1.94/2.13 dependent: clear(print_back_sub).
% 1.94/2.13 dependent: set(control_memory).
% 1.94/2.13 dependent: assign(max_mem, 12000).
% 1.94/2.13 dependent: assign(pick_given_ratio, 4).
% 1.94/2.13 dependent: assign(stats_level, 1).
% 1.94/2.13 dependent: assign(max_seconds, 10800).
% 1.94/2.13 clear(print_given).
% 1.94/2.13
% 1.94/2.13 list(usable).
% 1.94/2.13 0 [] A=A.
% 1.94/2.13 0 [] mult(A,ld(A,B))=B.
% 1.94/2.13 0 [] ld(A,mult(A,B))=B.
% 1.94/2.13 0 [] mult(rd(A,B),B)=A.
% 1.94/2.13 0 [] rd(mult(A,B),B)=A.
% 1.94/2.13 0 [] mult(A,unit)=A.
% 1.94/2.13 0 [] mult(unit,A)=A.
% 1.94/2.13 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.94/2.13 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.94/2.13 0 [] ld(A,mult(mult(B,C),A))=mult(ld(A,mult(B,A)),ld(A,mult(C,A))).
% 1.94/2.13 0 [] mult(i(A),mult(A,B))=B.
% 1.94/2.13 0 [] mult(mult(A,B),i(B))=A.
% 1.94/2.13 0 [] mult(a,mult(b,mult(c,b)))!=mult(mult(mult(a,b),c),b).
% 1.94/2.13 end_of_list.
% 1.94/2.13
% 1.94/2.13 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.94/2.13
% 1.94/2.13 All clauses are units, and equality is present; the
% 1.94/2.13 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.94/2.13
% 1.94/2.13 dependent: set(knuth_bendix).
% 1.94/2.13 dependent: set(anl_eq).
% 1.94/2.13 dependent: set(para_from).
% 1.94/2.13 dependent: set(para_into).
% 1.94/2.13 dependent: clear(para_from_right).
% 1.94/2.13 dependent: clear(para_into_right).
% 1.94/2.13 dependent: set(para_from_vars).
% 1.94/2.13 dependent: set(eq_units_both_ways).
% 1.94/2.13 dependent: set(dynamic_demod_all).
% 1.94/2.13 dependent: set(dynamic_demod).
% 1.94/2.13 dependent: set(order_eq).
% 1.94/2.13 dependent: set(back_demod).
% 1.94/2.13 dependent: set(lrpo).
% 1.94/2.13
% 1.94/2.13 ------------> process usable:
% 1.94/2.13 ** KEPT (pick-wt=15): 2 [copy,1,flip.1] mult(mult(mult(a,b),c),b)!=mult(a,mult(b,mult(c,b))).
% 1.94/2.13
% 1.94/2.13 ------------> process sos:
% 1.94/2.13 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.94/2.13 ** KEPT (pick-wt=7): 4 [] mult(A,ld(A,B))=B.
% 1.94/2.13 ---> New Demodulator: 5 [new_demod,4] mult(A,ld(A,B))=B.
% 1.94/2.13 ** KEPT (pick-wt=7): 6 [] ld(A,mult(A,B))=B.
% 1.94/2.13 ---> New Demodulator: 7 [new_demod,6] ld(A,mult(A,B))=B.
% 1.94/2.13 ** KEPT (pick-wt=7): 8 [] mult(rd(A,B),B)=A.
% 1.94/2.13 ---> New Demodulator: 9 [new_demod,8] mult(rd(A,B),B)=A.
% 1.94/2.13 ** KEPT (pick-wt=7): 10 [] rd(mult(A,B),B)=A.
% 1.94/2.13 ---> New Demodulator: 11 [new_demod,10] rd(mult(A,B),B)=A.
% 1.94/2.13 ** KEPT (pick-wt=5): 12 [] mult(A,unit)=A.
% 1.94/2.13 ---> New Demodulator: 13 [new_demod,12] mult(A,unit)=A.
% 1.94/2.13 ** KEPT (pick-wt=5): 14 [] mult(unit,A)=A.
% 1.94/2.13 ---> New Demodulator: 15 [new_demod,14] mult(unit,A)=A.
% 1.94/2.13 ** KEPT (pick-wt=31): 17 [copy,16,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.94/2.13 ---> New Demodulator: 18 [new_demod,17] 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.94/2.13 ** KEPT (pick-wt=31): 19 [] 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.94/2.13 ---> New Demodulator: 20 [new_demod,19] 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.94/2.13 ** KEPT (pick-wt=19): 21 [] ld(A,mult(mult(B,C),A))=mult(ld(A,mult(B,A)),ld(A,mult(C,A))).
% 1.94/2.13 ** KEPT (pick-wt=8): 22 [] mult(i(A),mult(A,B))=B.
% 1.94/2.13 ---> New Demodulator: 23 [new_demod,22] mult(i(A),mult(A,B))=B.
% 1.94/2.13 ** KEPT (pick-wt=8): 24 [] mult(mult(A,B),i(B))=A.
% 1.94/2.13 ---> New Demodulator: 25 [new_demod,24] mult(mult(A,B),i(B))=A.
% 1.94/2.13 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.94/2.13 >>>> Starting back demodulation with 5.
% 1.94/2.13 >>>> Starting back demodulation with 7.
% 1.94/2.13 >>>> Starting back demodulation with 9.
% 1.94/2.13 >>>> Starting back demodulation with 11.
% 1.94/2.13 >>>> Starting back demodulation with 13.
% 1.94/2.13 >>>> Starting back demodulation with 15.
% 1.94/2.13 >>>> Starting back demodulation with 18.
% 1.94/2.13 >>>> Starting back demodulation with 20.
% 1.94/2.13 ** KEPT (pick-wt=19): 26 [copy,21,flip.1] mult(ld(A,mult(B,A)),ld(A,mult(C,A)))=ld(A,mult(mult(B,C),A)).
% 1.94/2.13 >>>> Starting back demodulation with 23.
% 1.94/2.13 >>>> Starting back demodulation with 25.
% 2.95/3.13 Following clause subsumed by 21 during input processing: 0 [copy,26,flip.1] ld(A,mult(mult(B,C),A))=mult(ld(A,mult(B,A)),ld(A,mult(C,A))).
% 2.95/3.13
% 2.95/3.13 ======= end of input processing =======
% 2.95/3.13
% 2.95/3.13 =========== start of search ===========
% 2.95/3.13
% 2.95/3.13
% 2.95/3.13 Resetting weight limit to 15.
% 2.95/3.13
% 2.95/3.13
% 2.95/3.13 Resetting weight limit to 15.
% 2.95/3.13
% 2.95/3.13 sos_size=66
% 2.95/3.13
% 2.95/3.13 Search stopped because sos empty.
% 2.95/3.13
% 2.95/3.13
% 2.95/3.13 Search stopped because sos empty.
% 2.95/3.13
% 2.95/3.13 ============ end of search ============
% 2.95/3.13
% 2.95/3.13 -------------- statistics -------------
% 2.95/3.13 clauses given 140
% 2.95/3.13 clauses generated 41222
% 2.95/3.13 clauses kept 258
% 2.95/3.13 clauses forward subsumed 9760
% 2.95/3.13 clauses back subsumed 4
% 2.95/3.13 Kbytes malloced 5859
% 2.95/3.13
% 2.95/3.13 ----------- times (seconds) -----------
% 2.95/3.13 user CPU time 0.99 (0 hr, 0 min, 0 sec)
% 2.95/3.13 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.95/3.13 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 2.95/3.13
% 2.95/3.13 Process 12554 finished Wed Jul 27 05:32:59 2022
% 2.95/3.13 Otter interrupted
% 2.95/3.13 PROOF NOT FOUND
%------------------------------------------------------------------------------