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