TSTP Solution File: GRP720-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP720-2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:44 EDT 2022
% Result : Unknown 2.42s 2.66s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP720-2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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:20:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.42/2.66 ----- Otter 3.3f, August 2004 -----
% 2.42/2.66 The process was started by sandbox on n025.cluster.edu,
% 2.42/2.66 Wed Jul 27 05:20:00 2022
% 2.42/2.66 The command was "./otter". The process ID is 21656.
% 2.42/2.66
% 2.42/2.66 set(prolog_style_variables).
% 2.42/2.66 set(auto).
% 2.42/2.66 dependent: set(auto1).
% 2.42/2.66 dependent: set(process_input).
% 2.42/2.66 dependent: clear(print_kept).
% 2.42/2.66 dependent: clear(print_new_demod).
% 2.42/2.66 dependent: clear(print_back_demod).
% 2.42/2.66 dependent: clear(print_back_sub).
% 2.42/2.66 dependent: set(control_memory).
% 2.42/2.66 dependent: assign(max_mem, 12000).
% 2.42/2.66 dependent: assign(pick_given_ratio, 4).
% 2.42/2.66 dependent: assign(stats_level, 1).
% 2.42/2.66 dependent: assign(max_seconds, 10800).
% 2.42/2.66 clear(print_given).
% 2.42/2.66
% 2.42/2.66 list(usable).
% 2.42/2.66 0 [] A=A.
% 2.42/2.66 0 [] mult(A,unit)=A.
% 2.42/2.66 0 [] mult(unit,A)=A.
% 2.42/2.66 0 [] mult(A,ld(A,B))=B.
% 2.42/2.66 0 [] ld(A,mult(A,B))=B.
% 2.42/2.66 0 [] mult(A,B)=mult(B,A).
% 2.42/2.66 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)))).
% 2.42/2.66 0 [] ld(A,mult(mult(B,C),A))=mult(ld(A,mult(B,A)),ld(A,mult(C,A))).
% 2.42/2.66 0 [] mult(mult(op_a,op_a),mult(op_b,op_b))!=mult(A,A).
% 2.42/2.66 end_of_list.
% 2.42/2.66
% 2.42/2.66 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.42/2.66
% 2.42/2.66 All clauses are units, and equality is present; the
% 2.42/2.66 strategy will be Knuth-Bendix with positive clauses in sos.
% 2.42/2.66
% 2.42/2.66 dependent: set(knuth_bendix).
% 2.42/2.66 dependent: set(anl_eq).
% 2.42/2.66 dependent: set(para_from).
% 2.42/2.66 dependent: set(para_into).
% 2.42/2.66 dependent: clear(para_from_right).
% 2.42/2.66 dependent: clear(para_into_right).
% 2.42/2.66 dependent: set(para_from_vars).
% 2.42/2.66 dependent: set(eq_units_both_ways).
% 2.42/2.66 dependent: set(dynamic_demod_all).
% 2.42/2.66 dependent: set(dynamic_demod).
% 2.42/2.66 dependent: set(order_eq).
% 2.42/2.66 dependent: set(back_demod).
% 2.42/2.66 dependent: set(lrpo).
% 2.42/2.66
% 2.42/2.66 ------------> process usable:
% 2.42/2.66 ** KEPT (pick-wt=11): 1 [] mult(mult(op_a,op_a),mult(op_b,op_b))!=mult(A,A).
% 2.42/2.66 ** KEPT (pick-wt=11): 2 [copy,1,flip.1] mult(A,A)!=mult(mult(op_a,op_a),mult(op_b,op_b)).
% 2.42/2.66 Following clause subsumed by 1 during input processing: 0 [copy,2,flip.1] mult(mult(op_a,op_a),mult(op_b,op_b))!=mult(A,A).
% 2.42/2.66
% 2.42/2.66 ------------> process sos:
% 2.42/2.66 ** KEPT (pick-wt=3): 3 [] A=A.
% 2.42/2.66 ** KEPT (pick-wt=5): 4 [] mult(A,unit)=A.
% 2.42/2.66 ---> New Demodulator: 5 [new_demod,4] mult(A,unit)=A.
% 2.42/2.66 ** KEPT (pick-wt=5): 6 [] mult(unit,A)=A.
% 2.42/2.66 ---> New Demodulator: 7 [new_demod,6] mult(unit,A)=A.
% 2.42/2.66 ** KEPT (pick-wt=7): 8 [] mult(A,ld(A,B))=B.
% 2.42/2.66 ---> New Demodulator: 9 [new_demod,8] mult(A,ld(A,B))=B.
% 2.42/2.66 ** KEPT (pick-wt=7): 10 [] ld(A,mult(A,B))=B.
% 2.42/2.66 ---> New Demodulator: 11 [new_demod,10] ld(A,mult(A,B))=B.
% 2.42/2.66 ** KEPT (pick-wt=7): 12 [] mult(A,B)=mult(B,A).
% 2.42/2.66 ** KEPT (pick-wt=31): 14 [copy,13,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.42/2.66 ---> New Demodulator: 15 [new_demod,14] 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.42/2.66 ** KEPT (pick-wt=19): 16 [] ld(A,mult(mult(B,C),A))=mult(ld(A,mult(B,A)),ld(A,mult(C,A))).
% 2.42/2.66 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 2.42/2.66 >>>> Starting back demodulation with 5.
% 2.42/2.66 >>>> Starting back demodulation with 7.
% 2.42/2.66 >>>> Starting back demodulation with 9.
% 2.42/2.66 >>>> Starting back demodulation with 11.
% 2.42/2.66 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] mult(A,B)=mult(B,A).
% 2.42/2.66 >>>> Starting back demodulation with 15.
% 2.42/2.66 ** KEPT (pick-wt=19): 17 [copy,16,flip.1] mult(ld(A,mult(B,A)),ld(A,mult(C,A)))=ld(A,mult(mult(B,C),A)).
% 2.42/2.66 Following clause subsumed by 16 during input processing: 0 [copy,17,flip.1] ld(A,mult(mult(B,C),A))=mult(ld(A,mult(B,A)),ld(A,mult(C,A))).
% 2.42/2.66
% 2.42/2.66 ======= end of input processing =======
% 2.42/2.66
% 2.42/2.66 =========== start of search ===========
% 2.42/2.66
% 2.42/2.66
% 2.42/2.66 Resetting weight limit to 15.
% 2.42/2.66
% 2.42/2.66
% 2.42/2.66 Resetting weight limit to 15.
% 2.42/2.66
% 2.42/2.66 sos_size=107
% 2.42/2.66
% 2.42/2.66 Search stopped in tp_alloc by max_mem option.
% 2.42/2.66
% 2.42/2.66 Search stopped in tp_alloc by max_mem option.
% 2.42/2.66
% 2.42/2.66 ============ end of search ============
% 2.42/2.66
% 2.42/2.66 -------------- statistics -------------
% 2.42/2.66 clauses given 146
% 2.42/2.66 clauses generated 24944
% 2.42/2.66 clauses kept 264
% 2.42/2.66 clauses forward subsumed 5479
% 2.42/2.66 clauses back subsumed 1
% 2.42/2.66 Kbytes malloced 11718
% 2.42/2.66
% 2.42/2.66 ----------- times (seconds) -----------
% 2.42/2.66 user CPU time 0.57 (0 hr, 0 min, 0 sec)
% 2.42/2.66 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.42/2.66 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.42/2.66
% 2.42/2.66 Process 21656 finished Wed Jul 27 05:20:02 2022
% 2.42/2.66 Otter interrupted
% 2.42/2.66 PROOF NOT FOUND
%------------------------------------------------------------------------------