TSTP Solution File: GRP394+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP394+3 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n017.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 1.64s 1.89s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP394+3 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n017.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 04:21:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.64/1.88 ----- Otter 3.3f, August 2004 -----
% 1.64/1.88 The process was started by sandbox2 on n017.cluster.edu,
% 1.64/1.88 Wed Jul 27 04:21:03 2022
% 1.64/1.88 The command was "./otter". The process ID is 10314.
% 1.64/1.88
% 1.64/1.88 set(prolog_style_variables).
% 1.64/1.88 set(auto).
% 1.64/1.88 dependent: set(auto1).
% 1.64/1.88 dependent: set(process_input).
% 1.64/1.88 dependent: clear(print_kept).
% 1.64/1.88 dependent: clear(print_new_demod).
% 1.64/1.88 dependent: clear(print_back_demod).
% 1.64/1.88 dependent: clear(print_back_sub).
% 1.64/1.88 dependent: set(control_memory).
% 1.64/1.88 dependent: assign(max_mem, 12000).
% 1.64/1.88 dependent: assign(pick_given_ratio, 4).
% 1.64/1.88 dependent: assign(stats_level, 1).
% 1.64/1.88 dependent: assign(max_seconds, 10800).
% 1.64/1.88 clear(print_given).
% 1.64/1.88
% 1.64/1.88 formula_list(usable).
% 1.64/1.88 all A (A=A).
% 1.64/1.88 all X (multiply(identity,X)=X).
% 1.64/1.88 all X (multiply(inverse(X),X)=identity).
% 1.64/1.88 all X Y Z (multiply(multiply(X,Y),Z)=multiply(X,multiply(Y,Z))).
% 1.64/1.88 end_of_list.
% 1.64/1.88
% 1.64/1.88 -------> usable clausifies to:
% 1.64/1.88
% 1.64/1.88 list(usable).
% 1.64/1.88 0 [] A=A.
% 1.64/1.88 0 [] multiply(identity,X)=X.
% 1.64/1.88 0 [] multiply(inverse(X),X)=identity.
% 1.64/1.88 0 [] multiply(multiply(X,Y),Z)=multiply(X,multiply(Y,Z)).
% 1.64/1.88 end_of_list.
% 1.64/1.88
% 1.64/1.88 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.64/1.88
% 1.64/1.88 All clauses are units, and equality is present; the
% 1.64/1.88 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.64/1.88
% 1.64/1.88 dependent: set(knuth_bendix).
% 1.64/1.88 dependent: set(anl_eq).
% 1.64/1.88 dependent: set(para_from).
% 1.64/1.88 dependent: set(para_into).
% 1.64/1.88 dependent: clear(para_from_right).
% 1.64/1.88 dependent: clear(para_into_right).
% 1.64/1.88 dependent: set(para_from_vars).
% 1.64/1.88 dependent: set(eq_units_both_ways).
% 1.64/1.88 dependent: set(dynamic_demod_all).
% 1.64/1.88 dependent: set(dynamic_demod).
% 1.64/1.88 dependent: set(order_eq).
% 1.64/1.88 dependent: set(back_demod).
% 1.64/1.88 dependent: set(lrpo).
% 1.64/1.88
% 1.64/1.88 There is no negative clause, so all clause lists will
% 1.64/1.88 be printed at the end of the search.
% 1.64/1.88
% 1.64/1.88 dependent: set(print_lists_at_end).
% 1.64/1.88
% 1.64/1.88 ------------> process usable:
% 1.64/1.88
% 1.64/1.88 ------------> process sos:
% 1.64/1.88 ** KEPT (pick-wt=3): 1 [] A=A.
% 1.64/1.88 ** KEPT (pick-wt=5): 2 [] multiply(identity,A)=A.
% 1.64/1.88 ---> New Demodulator: 3 [new_demod,2] multiply(identity,A)=A.
% 1.64/1.88 ** KEPT (pick-wt=6): 4 [] multiply(inverse(A),A)=identity.
% 1.64/1.88 ---> New Demodulator: 5 [new_demod,4] multiply(inverse(A),A)=identity.
% 1.64/1.88 ** KEPT (pick-wt=11): 6 [] multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 1.64/1.88 ---> New Demodulator: 7 [new_demod,6] multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 1.64/1.88 Following clause subsumed by 1 during input processing: 0 [copy,1,flip.1] A=A.
% 1.64/1.88 >>>> Starting back demodulation with 3.
% 1.64/1.88 >>>> Starting back demodulation with 5.
% 1.64/1.88 >>>> Starting back demodulation with 7.
% 1.64/1.88
% 1.64/1.88 ======= end of input processing =======
% 1.64/1.88
% 1.64/1.88 =========== start of search ===========
% 1.64/1.88
% 1.64/1.88 Search stopped because sos empty.
% 1.64/1.88
% 1.64/1.88
% 1.64/1.88 Search stopped because sos empty.
% 1.64/1.88
% 1.64/1.88 ============ end of search ============
% 1.64/1.88
% 1.64/1.88 list(usable).
% 1.64/1.88 1 [] A=A.
% 1.64/1.88 2 [] multiply(identity,A)=A.
% 1.64/1.88 4 [] multiply(inverse(A),A)=identity.
% 1.64/1.88 6 [] multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 1.64/1.88 8 [para_into,6.1.1.1,4.1.1,demod,3,flip.1] multiply(inverse(A),multiply(A,B))=B.
% 1.64/1.88 14 [para_into,8.1.1.2,4.1.1,demod,11] multiply(A,identity)=A.
% 1.64/1.88 24 [para_into,14.1.1,4.1.1,flip.1] inverse(identity)=identity.
% 1.64/1.88 22 [para_into,14.1.1,10.1.1,demod,15,flip.1] inverse(inverse(A))=A.
% 1.64/1.88 20 [para_into,10.1.1,4.1.1,flip.1] multiply(A,inverse(A))=identity.
% 1.64/1.88 18 [para_into,10.1.1,8.1.1,flip.1] multiply(A,multiply(inverse(A),B))=B.
% 1.64/1.88 44 [para_into,30.1.1.1.1,8.1.1,flip.1] inverse(multiply(A,B))=multiply(inverse(B),inverse(A)).
% 1.64/1.88 end_of_list.
% 1.64/1.88
% 1.64/1.88 list(sos).
% 1.64/1.88 end_of_list.
% 1.64/1.88
% 1.64/1.88 list(demodulators).
% 1.64/1.88 3 [new_demod,2] multiply(identity,A)=A.
% 1.64/1.88 5 [new_demod,4] multiply(inverse(A),A)=identity.
% 1.64/1.88 7 [new_demod,6] multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 1.64/1.88 9 [new_demod,8] multiply(inverse(A),multiply(A,B))=B.
% 1.64/1.88 15 [new_demod,14] multiply(A,identity)=A.
% 1.64/1.88 19 [new_demod,18] multiply(A,multiply(inverse(A),B))=B.
% 1.64/1.88 21 [new_demod,20] multiply(A,inverse(A))=identity.
% 1.64/1.88 23 [new_demod,22] inverse(inverse(A))=A.
% 1.64/1.88 25 [new_demod,24] inverse(identity)=identity.
% 1.64/1.88 45 [new_demod,44] inverse(multiply(A,B))=multiply(inverse(B),inverse(A)).
% 1.64/1.88 end_of_list.
% 1.64/1.88
% 1.64/1.88
% 1.64/1.88 -------------- statistics -------------
% 1.64/1.88 clauses given 14
% 1.64/1.88 clauses generated 128
% 1.64/1.88 clauses kept 23
% 1.64/1.88 clauses forward subsumed 122
% 1.64/1.88 clauses back subsumed 0
% 1.64/1.88 Kbytes malloced 976
% 1.64/1.88
% 1.64/1.88 ----------- times (seconds) -----------
% 1.64/1.88 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.88 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.88 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.64/1.88
% 1.64/1.88 Process 10314 finished Wed Jul 27 04:21:04 2022
% 1.64/1.88 Otter interrupted
% 1.64/1.88 PROOF NOT FOUND
%------------------------------------------------------------------------------