TSTP Solution File: GRP002-10 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP002-10 : TPTP v8.1.0. Released v7.3.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:55:49 EDT 2022
% Result : Unknown 2.06s 2.24s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP002-10 : TPTP v8.1.0. Released v7.3.0.
% 0.00/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:19:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.96/2.11 ----- Otter 3.3f, August 2004 -----
% 1.96/2.11 The process was started by sandbox on n025.cluster.edu,
% 1.96/2.11 Wed Jul 27 05:19:45 2022
% 1.96/2.11 The command was "./otter". The process ID is 20779.
% 1.96/2.11
% 1.96/2.11 set(prolog_style_variables).
% 1.96/2.11 set(auto).
% 1.96/2.11 dependent: set(auto1).
% 1.96/2.11 dependent: set(process_input).
% 1.96/2.11 dependent: clear(print_kept).
% 1.96/2.11 dependent: clear(print_new_demod).
% 1.96/2.11 dependent: clear(print_back_demod).
% 1.96/2.11 dependent: clear(print_back_sub).
% 1.96/2.11 dependent: set(control_memory).
% 1.96/2.11 dependent: assign(max_mem, 12000).
% 1.96/2.11 dependent: assign(pick_given_ratio, 4).
% 1.96/2.11 dependent: assign(stats_level, 1).
% 1.96/2.11 dependent: assign(max_seconds, 10800).
% 1.96/2.11 clear(print_given).
% 1.96/2.11
% 1.96/2.11 list(usable).
% 1.96/2.11 0 [] A=A.
% 1.96/2.11 0 [] ife_q2(A,A,B,C)=B.
% 1.96/2.11 0 [] ife_q(A,A,B,C)=B.
% 1.96/2.11 0 [] product(identity,X,X)=true.
% 1.96/2.11 0 [] product(X,identity,X)=true.
% 1.96/2.11 0 [] product(inverse(X),X,identity)=true.
% 1.96/2.11 0 [] product(X,inverse(X),identity)=true.
% 1.96/2.11 0 [] product(X,Y,multiply(X,Y))=true.
% 1.96/2.11 0 [] ife_q2(product(X,Y,W),true,ife_q2(product(X,Y,Z),true,Z,W),W)=W.
% 1.96/2.11 0 [] ife_q(product(U,Z,W),true,ife_q(product(Y,Z,V),true,ife_q(product(X,Y,U),true,product(X,V,W),true),true),true)=true.
% 1.96/2.11 0 [] ife_q(product(Y,Z,V),true,ife_q(product(X,V,W),true,ife_q(product(X,Y,U),true,product(U,Z,W),true),true),true)=true.
% 1.96/2.11 0 [] ife_q(product(X,X,Y),true,product(X,Y,identity),true)=true.
% 1.96/2.11 0 [] ife_q(product(X,X,Y),true,product(Y,X,identity),true)=true.
% 1.96/2.11 0 [] product(a,b,c)=true.
% 1.96/2.11 0 [] product(c,inverse(a),d)=true.
% 1.96/2.11 0 [] product(d,inverse(b),h)=true.
% 1.96/2.11 0 [] product(h,b,j)=true.
% 1.96/2.11 0 [] product(j,inverse(h),k)=true.
% 1.96/2.11 0 [] product(k,inverse(b),identity)!=true.
% 1.96/2.11 end_of_list.
% 1.96/2.11
% 1.96/2.11 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.96/2.11
% 1.96/2.11 All clauses are units, and equality is present; the
% 1.96/2.11 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.96/2.11
% 1.96/2.11 dependent: set(knuth_bendix).
% 1.96/2.11 dependent: set(anl_eq).
% 1.96/2.11 dependent: set(para_from).
% 1.96/2.11 dependent: set(para_into).
% 1.96/2.11 dependent: clear(para_from_right).
% 1.96/2.11 dependent: clear(para_into_right).
% 1.96/2.11 dependent: set(para_from_vars).
% 1.96/2.11 dependent: set(eq_units_both_ways).
% 1.96/2.11 dependent: set(dynamic_demod_all).
% 1.96/2.11 dependent: set(dynamic_demod).
% 1.96/2.11 dependent: set(order_eq).
% 1.96/2.11 dependent: set(back_demod).
% 1.96/2.11 dependent: set(lrpo).
% 1.96/2.11
% 1.96/2.11 ------------> process usable:
% 1.96/2.11 ** KEPT (pick-wt=7): 1 [] product(k,inverse(b),identity)!=true.
% 1.96/2.11
% 1.96/2.11 ------------> process sos:
% 1.96/2.11 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.96/2.11 ** KEPT (pick-wt=7): 3 [] ife_q2(A,A,B,C)=B.
% 1.96/2.11 ---> New Demodulator: 4 [new_demod,3] ife_q2(A,A,B,C)=B.
% 1.96/2.11 ** KEPT (pick-wt=7): 5 [] ife_q(A,A,B,C)=B.
% 1.96/2.11 ---> New Demodulator: 6 [new_demod,5] ife_q(A,A,B,C)=B.
% 1.96/2.11 ** KEPT (pick-wt=6): 7 [] product(identity,A,A)=true.
% 1.96/2.11 ---> New Demodulator: 8 [new_demod,7] product(identity,A,A)=true.
% 1.96/2.11 ** KEPT (pick-wt=6): 9 [] product(A,identity,A)=true.
% 1.96/2.11 ---> New Demodulator: 10 [new_demod,9] product(A,identity,A)=true.
% 1.96/2.11 ** KEPT (pick-wt=7): 11 [] product(inverse(A),A,identity)=true.
% 1.96/2.11 ---> New Demodulator: 12 [new_demod,11] product(inverse(A),A,identity)=true.
% 1.96/2.11 ** KEPT (pick-wt=7): 13 [] product(A,inverse(A),identity)=true.
% 1.96/2.11 ---> New Demodulator: 14 [new_demod,13] product(A,inverse(A),identity)=true.
% 1.96/2.11 ** KEPT (pick-wt=8): 15 [] product(A,B,multiply(A,B))=true.
% 1.96/2.11 ---> New Demodulator: 16 [new_demod,15] product(A,B,multiply(A,B))=true.
% 1.96/2.11 ** KEPT (pick-wt=17): 17 [] ife_q2(product(A,B,C),true,ife_q2(product(A,B,D),true,D,C),C)=C.
% 1.96/2.11 ---> New Demodulator: 18 [new_demod,17] ife_q2(product(A,B,C),true,ife_q2(product(A,B,D),true,D,C),C)=C.
% 1.96/2.11 ** KEPT (pick-wt=27): 19 [] ife_q(product(A,B,C),true,ife_q(product(D,B,E),true,ife_q(product(F,D,A),true,product(F,E,C),true),true),true)=true.
% 1.96/2.11 ---> New Demodulator: 20 [new_demod,19] ife_q(product(A,B,C),true,ife_q(product(D,B,E),true,ife_q(product(F,D,A),true,product(F,E,C),true),true),true)=true.
% 1.96/2.11 ** KEPT (pick-wt=27): 21 [] ife_q(product(A,B,C),true,ife_q(product(D,C,E),true,ife_q(product(D,A,F),true,product(F,B,E),true),true),true)=true.
% 1.96/2.11 ---> New Demodulator: 22 [new_demod,21] ife_q(product(A,B,C),true,ife_q(product(D,C,E),true,ife_q(product(D,A,F),true,product(F,B,E),true),true),true)=true.
% 1.96/2.11 ** KEPT (pick-wt=13): 23 [] ife_q(product(A,A,B),true,product(A,B,identity),true)=true.
% 1.96/2.11 ---> New Demodulator: 24 [new_demod,23] ife_q(product(A,A,B),true,product(A,B,identity),true)=true.
% 2.06/2.24 ** KEPT (pick-wt=13): 25 [] ife_q(product(A,A,B),true,product(B,A,identity),true)=true.
% 2.06/2.24 ---> New Demodulator: 26 [new_demod,25] ife_q(product(A,A,B),true,product(B,A,identity),true)=true.
% 2.06/2.24 ** KEPT (pick-wt=6): 27 [] product(a,b,c)=true.
% 2.06/2.24 ---> New Demodulator: 28 [new_demod,27] product(a,b,c)=true.
% 2.06/2.24 ** KEPT (pick-wt=7): 29 [] product(c,inverse(a),d)=true.
% 2.06/2.24 ---> New Demodulator: 30 [new_demod,29] product(c,inverse(a),d)=true.
% 2.06/2.24 ** KEPT (pick-wt=7): 31 [] product(d,inverse(b),h)=true.
% 2.06/2.24 ---> New Demodulator: 32 [new_demod,31] product(d,inverse(b),h)=true.
% 2.06/2.24 ** KEPT (pick-wt=6): 33 [] product(h,b,j)=true.
% 2.06/2.24 ---> New Demodulator: 34 [new_demod,33] product(h,b,j)=true.
% 2.06/2.24 ** KEPT (pick-wt=7): 35 [] product(j,inverse(h),k)=true.
% 2.06/2.24 ---> New Demodulator: 36 [new_demod,35] product(j,inverse(h),k)=true.
% 2.06/2.24 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 2.06/2.24 >>>> Starting back demodulation with 4.
% 2.06/2.24 >>>> Starting back demodulation with 6.
% 2.06/2.24 >>>> Starting back demodulation with 8.
% 2.06/2.24 >>>> Starting back demodulation with 10.
% 2.06/2.24 >>>> Starting back demodulation with 12.
% 2.06/2.24 >>>> Starting back demodulation with 14.
% 2.06/2.24 >>>> Starting back demodulation with 16.
% 2.06/2.24 >>>> Starting back demodulation with 18.
% 2.06/2.24 >>>> Starting back demodulation with 20.
% 2.06/2.24 >>>> Starting back demodulation with 22.
% 2.06/2.24 >>>> Starting back demodulation with 24.
% 2.06/2.24 >>>> Starting back demodulation with 26.
% 2.06/2.24 >>>> Starting back demodulation with 28.
% 2.06/2.24 >>>> Starting back demodulation with 30.
% 2.06/2.24 >>>> Starting back demodulation with 32.
% 2.06/2.24 >>>> Starting back demodulation with 34.
% 2.06/2.24 >>>> Starting back demodulation with 36.
% 2.06/2.24
% 2.06/2.24 ======= end of input processing =======
% 2.06/2.24
% 2.06/2.24 =========== start of search ===========
% 2.06/2.24
% 2.06/2.24
% 2.06/2.24 Resetting weight limit to 14.
% 2.06/2.24
% 2.06/2.24
% 2.06/2.24 Resetting weight limit to 14.
% 2.06/2.24
% 2.06/2.24 sos_size=342
% 2.06/2.24
% 2.06/2.24
% 2.06/2.24 Resetting weight limit to 11.
% 2.06/2.24
% 2.06/2.24
% 2.06/2.24 Resetting weight limit to 11.
% 2.06/2.24
% 2.06/2.24 sos_size=309
% 2.06/2.24
% 2.06/2.24
% 2.06/2.24 Resetting weight limit to 8.
% 2.06/2.24
% 2.06/2.24
% 2.06/2.24 Resetting weight limit to 8.
% 2.06/2.24
% 2.06/2.24 sos_size=60
% 2.06/2.24
% 2.06/2.24 Search stopped because sos empty.
% 2.06/2.24
% 2.06/2.24
% 2.06/2.24 Search stopped because sos empty.
% 2.06/2.24
% 2.06/2.24 ============ end of search ============
% 2.06/2.24
% 2.06/2.24 -------------- statistics -------------
% 2.06/2.24 clauses given 417
% 2.06/2.24 clauses generated 9736
% 2.06/2.24 clauses kept 705
% 2.06/2.24 clauses forward subsumed 6605
% 2.06/2.24 clauses back subsumed 0
% 2.06/2.24 Kbytes malloced 4882
% 2.06/2.24
% 2.06/2.24 ----------- times (seconds) -----------
% 2.06/2.24 user CPU time 0.12 (0 hr, 0 min, 0 sec)
% 2.06/2.24 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.06/2.24 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.06/2.24
% 2.06/2.24 Process 20779 finished Wed Jul 27 05:19:47 2022
% 2.06/2.24 Otter interrupted
% 2.06/2.24 PROOF NOT FOUND
%------------------------------------------------------------------------------