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