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