TSTP Solution File: GRP181-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP181-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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:56:39 EDT 2022
% Result : Unknown 3.05s 3.23s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP181-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/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:07:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.92/2.12 ----- Otter 3.3f, August 2004 -----
% 1.92/2.12 The process was started by sandbox2 on n011.cluster.edu,
% 1.92/2.12 Wed Jul 27 05:07:10 2022
% 1.92/2.12 The command was "./otter". The process ID is 2003.
% 1.92/2.12
% 1.92/2.12 set(prolog_style_variables).
% 1.92/2.12 set(auto).
% 1.92/2.12 dependent: set(auto1).
% 1.92/2.12 dependent: set(process_input).
% 1.92/2.12 dependent: clear(print_kept).
% 1.92/2.12 dependent: clear(print_new_demod).
% 1.92/2.12 dependent: clear(print_back_demod).
% 1.92/2.12 dependent: clear(print_back_sub).
% 1.92/2.12 dependent: set(control_memory).
% 1.92/2.12 dependent: assign(max_mem, 12000).
% 1.92/2.12 dependent: assign(pick_given_ratio, 4).
% 1.92/2.12 dependent: assign(stats_level, 1).
% 1.92/2.12 dependent: assign(max_seconds, 10800).
% 1.92/2.12 clear(print_given).
% 1.92/2.12
% 1.92/2.12 list(usable).
% 1.92/2.12 0 [] A=A.
% 1.92/2.12 0 [] multiply(identity,X)=X.
% 1.92/2.12 0 [] multiply(inverse(X),X)=identity.
% 1.92/2.12 0 [] multiply(multiply(X,Y),Z)=multiply(X,multiply(Y,Z)).
% 1.92/2.12 0 [] greatest_lower_bound(X,Y)=greatest_lower_bound(Y,X).
% 1.92/2.12 0 [] least_upper_bound(X,Y)=least_upper_bound(Y,X).
% 1.92/2.12 0 [] greatest_lower_bound(X,greatest_lower_bound(Y,Z))=greatest_lower_bound(greatest_lower_bound(X,Y),Z).
% 1.92/2.12 0 [] least_upper_bound(X,least_upper_bound(Y,Z))=least_upper_bound(least_upper_bound(X,Y),Z).
% 1.92/2.12 0 [] least_upper_bound(X,X)=X.
% 1.92/2.12 0 [] greatest_lower_bound(X,X)=X.
% 1.92/2.12 0 [] least_upper_bound(X,greatest_lower_bound(X,Y))=X.
% 1.92/2.12 0 [] greatest_lower_bound(X,least_upper_bound(X,Y))=X.
% 1.92/2.12 0 [] multiply(X,least_upper_bound(Y,Z))=least_upper_bound(multiply(X,Y),multiply(X,Z)).
% 1.92/2.12 0 [] multiply(X,greatest_lower_bound(Y,Z))=greatest_lower_bound(multiply(X,Y),multiply(X,Z)).
% 1.92/2.12 0 [] multiply(least_upper_bound(Y,Z),X)=least_upper_bound(multiply(Y,X),multiply(Z,X)).
% 1.92/2.12 0 [] multiply(greatest_lower_bound(Y,Z),X)=greatest_lower_bound(multiply(Y,X),multiply(Z,X)).
% 1.92/2.12 0 [] greatest_lower_bound(a,c)=greatest_lower_bound(b,c).
% 1.92/2.12 0 [] least_upper_bound(a,c)=least_upper_bound(b,c).
% 1.92/2.12 0 [] a!=b.
% 1.92/2.12 end_of_list.
% 1.92/2.12
% 1.92/2.12 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.92/2.12
% 1.92/2.12 All clauses are units, and equality is present; the
% 1.92/2.12 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.92/2.12
% 1.92/2.12 dependent: set(knuth_bendix).
% 1.92/2.12 dependent: set(anl_eq).
% 1.92/2.12 dependent: set(para_from).
% 1.92/2.12 dependent: set(para_into).
% 1.92/2.12 dependent: clear(para_from_right).
% 1.92/2.12 dependent: clear(para_into_right).
% 1.92/2.12 dependent: set(para_from_vars).
% 1.92/2.12 dependent: set(eq_units_both_ways).
% 1.92/2.12 dependent: set(dynamic_demod_all).
% 1.92/2.12 dependent: set(dynamic_demod).
% 1.92/2.12 dependent: set(order_eq).
% 1.92/2.12 dependent: set(back_demod).
% 1.92/2.12 dependent: set(lrpo).
% 1.92/2.12
% 1.92/2.12 ------------> process usable:
% 1.92/2.12 ** KEPT (pick-wt=3): 2 [copy,1,flip.1] b!=a.
% 1.92/2.12
% 1.92/2.12 ------------> process sos:
% 1.92/2.12 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.92/2.12 ** KEPT (pick-wt=5): 4 [] multiply(identity,A)=A.
% 1.92/2.12 ---> New Demodulator: 5 [new_demod,4] multiply(identity,A)=A.
% 1.92/2.12 ** KEPT (pick-wt=6): 6 [] multiply(inverse(A),A)=identity.
% 1.92/2.12 ---> New Demodulator: 7 [new_demod,6] multiply(inverse(A),A)=identity.
% 1.92/2.12 ** KEPT (pick-wt=11): 8 [] multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 1.92/2.12 ---> New Demodulator: 9 [new_demod,8] multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 1.92/2.12 ** KEPT (pick-wt=7): 10 [] greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 1.92/2.12 ** KEPT (pick-wt=7): 11 [] least_upper_bound(A,B)=least_upper_bound(B,A).
% 1.92/2.12 ** KEPT (pick-wt=11): 13 [copy,12,flip.1] greatest_lower_bound(greatest_lower_bound(A,B),C)=greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 1.92/2.12 ---> New Demodulator: 14 [new_demod,13] greatest_lower_bound(greatest_lower_bound(A,B),C)=greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 1.92/2.12 ** KEPT (pick-wt=11): 16 [copy,15,flip.1] least_upper_bound(least_upper_bound(A,B),C)=least_upper_bound(A,least_upper_bound(B,C)).
% 1.92/2.12 ---> New Demodulator: 17 [new_demod,16] least_upper_bound(least_upper_bound(A,B),C)=least_upper_bound(A,least_upper_bound(B,C)).
% 1.92/2.12 ** KEPT (pick-wt=5): 18 [] least_upper_bound(A,A)=A.
% 1.92/2.12 ---> New Demodulator: 19 [new_demod,18] least_upper_bound(A,A)=A.
% 1.92/2.12 ** KEPT (pick-wt=5): 20 [] greatest_lower_bound(A,A)=A.
% 1.92/2.12 ---> New Demodulator: 21 [new_demod,20] greatest_lower_bound(A,A)=A.
% 1.92/2.12 ** KEPT (pick-wt=7): 22 [] least_upper_bound(A,greatest_lower_bound(A,B))=A.
% 1.92/2.12 ---> New Demodulator: 23 [new_demod,22] least_upper_bound(A,greatest_lower_bound(A,B))=A.
% 1.92/2.12 ** KEPT (pick-wt=7): 24 [] greatest_lower_bound(A,least_upper_bound(A,B))=A.
% 3.05/3.22 ---> New Demodulator: 25 [new_demod,24] greatest_lower_bound(A,least_upper_bound(A,B))=A.
% 3.05/3.22 ** KEPT (pick-wt=13): 26 [] multiply(A,least_upper_bound(B,C))=least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.05/3.22 ---> New Demodulator: 27 [new_demod,26] multiply(A,least_upper_bound(B,C))=least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.05/3.22 ** KEPT (pick-wt=13): 28 [] multiply(A,greatest_lower_bound(B,C))=greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.05/3.22 ---> New Demodulator: 29 [new_demod,28] multiply(A,greatest_lower_bound(B,C))=greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.05/3.22 ** KEPT (pick-wt=13): 30 [] multiply(least_upper_bound(A,B),C)=least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.05/3.22 ---> New Demodulator: 31 [new_demod,30] multiply(least_upper_bound(A,B),C)=least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.05/3.22 ** KEPT (pick-wt=13): 32 [] multiply(greatest_lower_bound(A,B),C)=greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.05/3.22 ---> New Demodulator: 33 [new_demod,32] multiply(greatest_lower_bound(A,B),C)=greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.05/3.22 ** KEPT (pick-wt=7): 35 [copy,34,flip.1] greatest_lower_bound(b,c)=greatest_lower_bound(a,c).
% 3.05/3.22 ---> New Demodulator: 36 [new_demod,35] greatest_lower_bound(b,c)=greatest_lower_bound(a,c).
% 3.05/3.22 ** KEPT (pick-wt=7): 38 [copy,37,flip.1] least_upper_bound(b,c)=least_upper_bound(a,c).
% 3.05/3.22 ---> New Demodulator: 39 [new_demod,38] least_upper_bound(b,c)=least_upper_bound(a,c).
% 3.05/3.22 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 3.05/3.22 >>>> Starting back demodulation with 5.
% 3.05/3.22 >>>> Starting back demodulation with 7.
% 3.05/3.22 >>>> Starting back demodulation with 9.
% 3.05/3.22 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 3.05/3.22 Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] least_upper_bound(A,B)=least_upper_bound(B,A).
% 3.05/3.22 >>>> Starting back demodulation with 14.
% 3.05/3.22 >>>> Starting back demodulation with 17.
% 3.05/3.22 >>>> Starting back demodulation with 19.
% 3.05/3.22 >>>> Starting back demodulation with 21.
% 3.05/3.22 >>>> Starting back demodulation with 23.
% 3.05/3.22 >>>> Starting back demodulation with 25.
% 3.05/3.22 >>>> Starting back demodulation with 27.
% 3.05/3.22 >>>> Starting back demodulation with 29.
% 3.05/3.22 >>>> Starting back demodulation with 31.
% 3.05/3.22 >>>> Starting back demodulation with 33.
% 3.05/3.22 >>>> Starting back demodulation with 36.
% 3.05/3.22 >>>> Starting back demodulation with 39.
% 3.05/3.22
% 3.05/3.22 ======= end of input processing =======
% 3.05/3.22
% 3.05/3.22 =========== start of search ===========
% 3.05/3.22
% 3.05/3.22
% 3.05/3.22 Resetting weight limit to 11.
% 3.05/3.22
% 3.05/3.22
% 3.05/3.22 Resetting weight limit to 11.
% 3.05/3.22
% 3.05/3.22 sos_size=446
% 3.05/3.22
% 3.05/3.22 Search stopped because sos empty.
% 3.05/3.22
% 3.05/3.22
% 3.05/3.22 Search stopped because sos empty.
% 3.05/3.22
% 3.05/3.22 ============ end of search ============
% 3.05/3.22
% 3.05/3.22 -------------- statistics -------------
% 3.05/3.22 clauses given 705
% 3.05/3.22 clauses generated 205301
% 3.05/3.22 clauses kept 737
% 3.05/3.22 clauses forward subsumed 100040
% 3.05/3.22 clauses back subsumed 0
% 3.05/3.22 Kbytes malloced 9765
% 3.05/3.22
% 3.05/3.22 ----------- times (seconds) -----------
% 3.05/3.22 user CPU time 1.10 (0 hr, 0 min, 1 sec)
% 3.05/3.22 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 3.05/3.22 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.05/3.22
% 3.05/3.22 Process 2003 finished Wed Jul 27 05:07:13 2022
% 3.05/3.22 Otter interrupted
% 3.05/3.22 PROOF NOT FOUND
%------------------------------------------------------------------------------