TSTP Solution File: GRP663-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP663-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n009.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:35 EDT 2022
% Result : Unknown 2.34s 2.56s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP663-1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 04:59:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.34/2.56 ----- Otter 3.3f, August 2004 -----
% 2.34/2.56 The process was started by sandbox on n009.cluster.edu,
% 2.34/2.56 Wed Jul 27 04:59:36 2022
% 2.34/2.56 The command was "./otter". The process ID is 29353.
% 2.34/2.56
% 2.34/2.56 set(prolog_style_variables).
% 2.34/2.56 set(auto).
% 2.34/2.56 dependent: set(auto1).
% 2.34/2.56 dependent: set(process_input).
% 2.34/2.56 dependent: clear(print_kept).
% 2.34/2.56 dependent: clear(print_new_demod).
% 2.34/2.56 dependent: clear(print_back_demod).
% 2.34/2.56 dependent: clear(print_back_sub).
% 2.34/2.56 dependent: set(control_memory).
% 2.34/2.56 dependent: assign(max_mem, 12000).
% 2.34/2.56 dependent: assign(pick_given_ratio, 4).
% 2.34/2.56 dependent: assign(stats_level, 1).
% 2.34/2.56 dependent: assign(max_seconds, 10800).
% 2.34/2.56 clear(print_given).
% 2.34/2.56
% 2.34/2.56 list(usable).
% 2.34/2.56 0 [] A=A.
% 2.34/2.56 0 [] mult(A,ld(A,B))=B.
% 2.34/2.56 0 [] ld(A,mult(A,B))=B.
% 2.34/2.56 0 [] mult(rd(A,B),B)=A.
% 2.34/2.56 0 [] rd(mult(A,B),B)=A.
% 2.34/2.56 0 [] mult(A,unit)=A.
% 2.34/2.56 0 [] mult(unit,A)=A.
% 2.34/2.56 0 [] mult(A,mult(B,C))=mult(rd(mult(A,B),A),mult(A,C)).
% 2.34/2.56 0 [] mult(mult(A,B),C)=mult(mult(A,C),ld(C,mult(B,C))).
% 2.34/2.56 0 [] mult(op_c,op_d)=unit.
% 2.34/2.56 0 [] mult(mult(a,b),mult(op_d,op_c))!=mult(a,mult(b,mult(op_d,op_c))).
% 2.34/2.56 end_of_list.
% 2.34/2.56
% 2.34/2.56 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.34/2.56
% 2.34/2.56 All clauses are units, and equality is present; the
% 2.34/2.56 strategy will be Knuth-Bendix with positive clauses in sos.
% 2.34/2.56
% 2.34/2.56 dependent: set(knuth_bendix).
% 2.34/2.56 dependent: set(anl_eq).
% 2.34/2.56 dependent: set(para_from).
% 2.34/2.56 dependent: set(para_into).
% 2.34/2.56 dependent: clear(para_from_right).
% 2.34/2.56 dependent: clear(para_into_right).
% 2.34/2.56 dependent: set(para_from_vars).
% 2.34/2.56 dependent: set(eq_units_both_ways).
% 2.34/2.56 dependent: set(dynamic_demod_all).
% 2.34/2.56 dependent: set(dynamic_demod).
% 2.34/2.56 dependent: set(order_eq).
% 2.34/2.56 dependent: set(back_demod).
% 2.34/2.56 dependent: set(lrpo).
% 2.34/2.56
% 2.34/2.56 ------------> process usable:
% 2.34/2.56 ** KEPT (pick-wt=15): 1 [] mult(mult(a,b),mult(op_d,op_c))!=mult(a,mult(b,mult(op_d,op_c))).
% 2.34/2.56
% 2.34/2.56 ------------> process sos:
% 2.34/2.56 ** KEPT (pick-wt=3): 2 [] A=A.
% 2.34/2.56 ** KEPT (pick-wt=7): 3 [] mult(A,ld(A,B))=B.
% 2.34/2.56 ---> New Demodulator: 4 [new_demod,3] mult(A,ld(A,B))=B.
% 2.34/2.56 ** KEPT (pick-wt=7): 5 [] ld(A,mult(A,B))=B.
% 2.34/2.56 ---> New Demodulator: 6 [new_demod,5] ld(A,mult(A,B))=B.
% 2.34/2.56 ** KEPT (pick-wt=7): 7 [] mult(rd(A,B),B)=A.
% 2.34/2.56 ---> New Demodulator: 8 [new_demod,7] mult(rd(A,B),B)=A.
% 2.34/2.56 ** KEPT (pick-wt=7): 9 [] rd(mult(A,B),B)=A.
% 2.34/2.56 ---> New Demodulator: 10 [new_demod,9] rd(mult(A,B),B)=A.
% 2.34/2.56 ** KEPT (pick-wt=5): 11 [] mult(A,unit)=A.
% 2.34/2.56 ---> New Demodulator: 12 [new_demod,11] mult(A,unit)=A.
% 2.34/2.56 ** KEPT (pick-wt=5): 13 [] mult(unit,A)=A.
% 2.34/2.56 ---> New Demodulator: 14 [new_demod,13] mult(unit,A)=A.
% 2.34/2.56 ** KEPT (pick-wt=15): 16 [copy,15,flip.1] mult(rd(mult(A,B),A),mult(A,C))=mult(A,mult(B,C)).
% 2.34/2.56 ---> New Demodulator: 17 [new_demod,16] mult(rd(mult(A,B),A),mult(A,C))=mult(A,mult(B,C)).
% 2.34/2.56 ** KEPT (pick-wt=15): 18 [] mult(mult(A,B),C)=mult(mult(A,C),ld(C,mult(B,C))).
% 2.34/2.56 ** KEPT (pick-wt=5): 19 [] mult(op_c,op_d)=unit.
% 2.34/2.56 ---> New Demodulator: 20 [new_demod,19] mult(op_c,op_d)=unit.
% 2.34/2.56 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 2.34/2.56 >>>> Starting back demodulation with 4.
% 2.34/2.56 >>>> Starting back demodulation with 6.
% 2.34/2.56 >>>> Starting back demodulation with 8.
% 2.34/2.56 >>>> Starting back demodulation with 10.
% 2.34/2.56 >>>> Starting back demodulation with 12.
% 2.34/2.56 >>>> Starting back demodulation with 14.
% 2.34/2.56 >>>> Starting back demodulation with 17.
% 2.34/2.56 ** KEPT (pick-wt=15): 21 [copy,18,flip.1] mult(mult(A,B),ld(B,mult(C,B)))=mult(mult(A,C),B).
% 2.34/2.56 >>>> Starting back demodulation with 20.
% 2.34/2.56 Following clause subsumed by 18 during input processing: 0 [copy,21,flip.1] mult(mult(A,B),C)=mult(mult(A,C),ld(C,mult(B,C))).
% 2.34/2.56
% 2.34/2.56 ======= end of input processing =======
% 2.34/2.56
% 2.34/2.56 =========== start of search ===========
% 2.34/2.56
% 2.34/2.56
% 2.34/2.56 Resetting weight limit to 11.
% 2.34/2.56
% 2.34/2.56
% 2.34/2.56 Resetting weight limit to 11.
% 2.34/2.56
% 2.34/2.56 sos_size=120
% 2.34/2.56
% 2.34/2.56 Search stopped because sos empty.
% 2.34/2.56
% 2.34/2.56
% 2.34/2.56 Search stopped because sos empty.
% 2.34/2.56
% 2.34/2.56 ============ end of search ============
% 2.34/2.56
% 2.34/2.56 -------------- statistics -------------
% 2.34/2.56 clauses given 176
% 2.34/2.56 clauses generated 34914
% 2.34/2.56 clauses kept 248
% 2.34/2.56 clauses forward subsumed 1776
% 2.34/2.56 clauses back subsumed 2
% 2.34/2.56 Kbytes malloced 7812
% 2.34/2.56
% 2.34/2.56 ----------- times (seconds) -----------
% 2.34/2.56 user CPU time 0.65 (0 hr, 0 min, 0 sec)
% 2.34/2.56 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.34/2.56 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.34/2.56
% 2.34/2.56 Process 29353 finished Wed Jul 27 04:59:38 2022
% 2.34/2.56 Otter interrupted
% 2.34/2.56 PROOF NOT FOUND
%------------------------------------------------------------------------------