TSTP Solution File: GRP048-10 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP048-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:58 EDT 2022
% Result : Unknown 2.96s 3.14s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP048-10 : TPTP v8.1.0. Released v7.5.0.
% 0.06/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n022.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:00:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.68/1.89 ----- Otter 3.3f, August 2004 -----
% 1.68/1.89 The process was started by sandbox2 on n022.cluster.edu,
% 1.68/1.89 Wed Jul 27 05:00:35 2022
% 1.68/1.89 The command was "./otter". The process ID is 19686.
% 1.68/1.89
% 1.68/1.89 set(prolog_style_variables).
% 1.68/1.89 set(auto).
% 1.68/1.89 dependent: set(auto1).
% 1.68/1.89 dependent: set(process_input).
% 1.68/1.89 dependent: clear(print_kept).
% 1.68/1.89 dependent: clear(print_new_demod).
% 1.68/1.89 dependent: clear(print_back_demod).
% 1.68/1.89 dependent: clear(print_back_sub).
% 1.68/1.89 dependent: set(control_memory).
% 1.68/1.89 dependent: assign(max_mem, 12000).
% 1.68/1.89 dependent: assign(pick_given_ratio, 4).
% 1.68/1.89 dependent: assign(stats_level, 1).
% 1.68/1.89 dependent: assign(max_seconds, 10800).
% 1.68/1.89 clear(print_given).
% 1.68/1.89
% 1.68/1.89 list(usable).
% 1.68/1.89 0 [] A=A.
% 1.68/1.89 0 [] ife_q(A,A,B,C)=B.
% 1.68/1.89 0 [] product(identity,X,X)=true.
% 1.68/1.89 0 [] product(inverse(X),X,identity)=true.
% 1.68/1.89 0 [] product(X,Y,multiply(X,Y))=true.
% 1.68/1.89 0 [] ife_q(product(X,Y,W),true,ife_q(product(X,Y,Z),true,e_qualish(Z,W),true),true)=true.
% 1.68/1.89 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.68/1.89 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.68/1.89 0 [] ife_q(e_qualish(X,Y),true,ife_q(product(W,Z,X),true,product(W,Z,Y),true),true)=true.
% 1.68/1.89 0 [] e_qualish(a,b)=true.
% 1.68/1.89 0 [] e_qualish(inverse(a),inverse(b))!=true.
% 1.68/1.89 end_of_list.
% 1.68/1.89
% 1.68/1.89 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.68/1.89
% 1.68/1.89 All clauses are units, and equality is present; the
% 1.68/1.89 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.68/1.89
% 1.68/1.89 dependent: set(knuth_bendix).
% 1.68/1.89 dependent: set(anl_eq).
% 1.68/1.89 dependent: set(para_from).
% 1.68/1.89 dependent: set(para_into).
% 1.68/1.89 dependent: clear(para_from_right).
% 1.68/1.89 dependent: clear(para_into_right).
% 1.68/1.89 dependent: set(para_from_vars).
% 1.68/1.89 dependent: set(eq_units_both_ways).
% 1.68/1.89 dependent: set(dynamic_demod_all).
% 1.68/1.89 dependent: set(dynamic_demod).
% 1.68/1.89 dependent: set(order_eq).
% 1.68/1.89 dependent: set(back_demod).
% 1.68/1.89 dependent: set(lrpo).
% 1.68/1.89
% 1.68/1.89 ------------> process usable:
% 1.68/1.89 ** KEPT (pick-wt=7): 1 [] e_qualish(inverse(a),inverse(b))!=true.
% 1.68/1.89
% 1.68/1.89 ------------> process sos:
% 1.68/1.89 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.68/1.89 ** KEPT (pick-wt=7): 3 [] ife_q(A,A,B,C)=B.
% 1.68/1.89 ---> New Demodulator: 4 [new_demod,3] ife_q(A,A,B,C)=B.
% 1.68/1.89 ** KEPT (pick-wt=6): 5 [] product(identity,A,A)=true.
% 1.68/1.89 ---> New Demodulator: 6 [new_demod,5] product(identity,A,A)=true.
% 1.68/1.89 ** KEPT (pick-wt=7): 7 [] product(inverse(A),A,identity)=true.
% 1.68/1.89 ---> New Demodulator: 8 [new_demod,7] product(inverse(A),A,identity)=true.
% 1.68/1.89 ** KEPT (pick-wt=8): 9 [] product(A,B,multiply(A,B))=true.
% 1.68/1.89 ---> New Demodulator: 10 [new_demod,9] product(A,B,multiply(A,B))=true.
% 1.68/1.89 ** KEPT (pick-wt=19): 11 [] ife_q(product(A,B,C),true,ife_q(product(A,B,D),true,e_qualish(D,C),true),true)=true.
% 1.68/1.89 ---> New Demodulator: 12 [new_demod,11] ife_q(product(A,B,C),true,ife_q(product(A,B,D),true,e_qualish(D,C),true),true)=true.
% 1.68/1.89 ** KEPT (pick-wt=27): 13 [] 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.68/1.89 ---> New Demodulator: 14 [new_demod,13] 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.68/1.89 ** KEPT (pick-wt=27): 15 [] 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.68/1.89 ---> New Demodulator: 16 [new_demod,15] 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.68/1.89 ** KEPT (pick-wt=19): 17 [] ife_q(e_qualish(A,B),true,ife_q(product(C,D,A),true,product(C,D,B),true),true)=true.
% 1.68/1.89 ---> New Demodulator: 18 [new_demod,17] ife_q(e_qualish(A,B),true,ife_q(product(C,D,A),true,product(C,D,B),true),true)=true.
% 1.68/1.89 ** KEPT (pick-wt=5): 19 [] e_qualish(a,b)=true.
% 1.68/1.89 ---> New Demodulator: 20 [new_demod,19] e_qualish(a,b)=true.
% 1.68/1.89 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.68/1.89 >>>> Starting back demodulation with 4.
% 1.68/1.89 >>>> Starting back demodulation with 6.
% 1.68/1.89 >>>> Starting back demodulation with 8.
% 1.68/1.89 >>>> Starting back demodulation with 10.
% 1.68/1.89 >>>> Starting back demodulation with 12.
% 1.68/1.89 >>>> Starting back demodulation with 14.
% 1.68/1.89 >>>> Starting back demodulation with 16.
% 2.96/3.14 >>>> Starting back demodulation with 18.
% 2.96/3.14 >>>> Starting back demodulation with 20.
% 2.96/3.14
% 2.96/3.14 ======= end of input processing =======
% 2.96/3.14
% 2.96/3.14 =========== start of search ===========
% 2.96/3.14
% 2.96/3.14
% 2.96/3.14 Resetting weight limit to 13.
% 2.96/3.14
% 2.96/3.14
% 2.96/3.14 Resetting weight limit to 13.
% 2.96/3.14
% 2.96/3.14 sos_size=562
% 2.96/3.14
% 2.96/3.14
% 2.96/3.14 Resetting weight limit to 12.
% 2.96/3.14
% 2.96/3.14
% 2.96/3.14 Resetting weight limit to 12.
% 2.96/3.14
% 2.96/3.14 sos_size=595
% 2.96/3.14
% 2.96/3.14
% 2.96/3.14 Resetting weight limit to 11.
% 2.96/3.14
% 2.96/3.14
% 2.96/3.14 Resetting weight limit to 11.
% 2.96/3.14
% 2.96/3.14 sos_size=608
% 2.96/3.14
% 2.96/3.14
% 2.96/3.14 Resetting weight limit to 10.
% 2.96/3.14
% 2.96/3.14
% 2.96/3.14 Resetting weight limit to 10.
% 2.96/3.14
% 2.96/3.14 sos_size=655
% 2.96/3.14
% 2.96/3.14 Search stopped in tp_alloc by max_mem option.
% 2.96/3.14
% 2.96/3.14 Search stopped in tp_alloc by max_mem option.
% 2.96/3.14
% 2.96/3.14 ============ end of search ============
% 2.96/3.14
% 2.96/3.14 -------------- statistics -------------
% 2.96/3.14 clauses given 2068
% 2.96/3.14 clauses generated 244595
% 2.96/3.14 clauses kept 2391
% 2.96/3.14 clauses forward subsumed 38226
% 2.96/3.14 clauses back subsumed 0
% 2.96/3.14 Kbytes malloced 11718
% 2.96/3.14
% 2.96/3.14 ----------- times (seconds) -----------
% 2.96/3.14 user CPU time 1.23 (0 hr, 0 min, 1 sec)
% 2.96/3.14 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.96/3.14 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 2.96/3.14
% 2.96/3.14 Process 19686 finished Wed Jul 27 05:00:38 2022
% 2.96/3.14 Otter interrupted
% 2.96/3.14 PROOF NOT FOUND
%------------------------------------------------------------------------------