TSTP Solution File: RNG030-7 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : RNG030-7 : TPTP v8.1.0. Released v1.0.0.
% 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 13:12:08 EDT 2022
% Result : Unknown 2.12s 2.34s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : RNG030-7 : TPTP v8.1.0. Released v1.0.0.
% 0.06/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 02:01:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.69/1.91 ----- Otter 3.3f, August 2004 -----
% 1.69/1.91 The process was started by sandbox2 on n010.cluster.edu,
% 1.69/1.91 Wed Jul 27 02:01:55 2022
% 1.69/1.91 The command was "./otter". The process ID is 23958.
% 1.69/1.91
% 1.69/1.91 set(prolog_style_variables).
% 1.69/1.91 set(auto).
% 1.69/1.91 dependent: set(auto1).
% 1.69/1.91 dependent: set(process_input).
% 1.69/1.91 dependent: clear(print_kept).
% 1.69/1.91 dependent: clear(print_new_demod).
% 1.69/1.91 dependent: clear(print_back_demod).
% 1.69/1.91 dependent: clear(print_back_sub).
% 1.69/1.91 dependent: set(control_memory).
% 1.69/1.91 dependent: assign(max_mem, 12000).
% 1.69/1.91 dependent: assign(pick_given_ratio, 4).
% 1.69/1.91 dependent: assign(stats_level, 1).
% 1.69/1.91 dependent: assign(max_seconds, 10800).
% 1.69/1.91 clear(print_given).
% 1.69/1.91
% 1.69/1.91 list(usable).
% 1.69/1.91 0 [] A=A.
% 1.69/1.91 0 [] multiply(additive_inverse(X),additive_inverse(Y))=multiply(X,Y).
% 1.69/1.91 0 [] multiply(additive_inverse(X),Y)=additive_inverse(multiply(X,Y)).
% 1.69/1.91 0 [] multiply(X,additive_inverse(Y))=additive_inverse(multiply(X,Y)).
% 1.69/1.91 0 [] multiply(X,add(Y,additive_inverse(Z)))=add(multiply(X,Y),additive_inverse(multiply(X,Z))).
% 1.69/1.91 0 [] multiply(add(X,additive_inverse(Y)),Z)=add(multiply(X,Z),additive_inverse(multiply(Y,Z))).
% 1.69/1.91 0 [] multiply(additive_inverse(X),add(Y,Z))=add(additive_inverse(multiply(X,Y)),additive_inverse(multiply(X,Z))).
% 1.69/1.91 0 [] multiply(add(X,Y),additive_inverse(Z))=add(additive_inverse(multiply(X,Z)),additive_inverse(multiply(Y,Z))).
% 1.69/1.91 0 [] add(X,Y)=add(Y,X).
% 1.69/1.91 0 [] add(X,add(Y,Z))=add(add(X,Y),Z).
% 1.69/1.91 0 [] add(additive_identity,X)=X.
% 1.69/1.91 0 [] add(X,additive_identity)=X.
% 1.69/1.91 0 [] multiply(additive_identity,X)=additive_identity.
% 1.69/1.91 0 [] multiply(X,additive_identity)=additive_identity.
% 1.69/1.91 0 [] add(additive_inverse(X),X)=additive_identity.
% 1.69/1.91 0 [] add(X,additive_inverse(X))=additive_identity.
% 1.69/1.91 0 [] multiply(X,add(Y,Z))=add(multiply(X,Y),multiply(X,Z)).
% 1.69/1.91 0 [] multiply(add(X,Y),Z)=add(multiply(X,Z),multiply(Y,Z)).
% 1.69/1.91 0 [] additive_inverse(additive_inverse(X))=X.
% 1.69/1.91 0 [] multiply(multiply(X,Y),Y)=multiply(X,multiply(Y,Y)).
% 1.69/1.91 0 [] associator(X,Y,Z)=add(multiply(multiply(X,Y),Z),additive_inverse(multiply(X,multiply(Y,Z)))).
% 1.69/1.91 0 [] commutator(X,Y)=add(multiply(Y,X),additive_inverse(multiply(X,Y))).
% 1.69/1.91 0 [] add(multiply(associator(x,x,y),multiply(associator(x,x,y),associator(x,x,y))),multiply(associator(x,x,y),multiply(associator(x,x,y),associator(x,x,y))))!=additive_identity.
% 1.69/1.91 end_of_list.
% 1.69/1.91
% 1.69/1.91 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.69/1.91
% 1.69/1.91 All clauses are units, and equality is present; the
% 1.69/1.91 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.69/1.91
% 1.69/1.91 dependent: set(knuth_bendix).
% 1.69/1.91 dependent: set(anl_eq).
% 1.69/1.91 dependent: set(para_from).
% 1.69/1.91 dependent: set(para_into).
% 1.69/1.91 dependent: clear(para_from_right).
% 1.69/1.91 dependent: clear(para_into_right).
% 1.69/1.91 dependent: set(para_from_vars).
% 1.69/1.91 dependent: set(eq_units_both_ways).
% 1.69/1.91 dependent: set(dynamic_demod_all).
% 1.69/1.91 dependent: set(dynamic_demod).
% 1.69/1.91 dependent: set(order_eq).
% 1.69/1.91 dependent: set(back_demod).
% 1.69/1.91 dependent: set(lrpo).
% 1.69/1.91
% 1.69/1.91 ------------> process usable:
% 1.69/1.91 ** KEPT (pick-wt=31): 1 [] add(multiply(associator(x,x,y),multiply(associator(x,x,y),associator(x,x,y))),multiply(associator(x,x,y),multiply(associator(x,x,y),associator(x,x,y))))!=additive_identity.
% 1.69/1.91
% 1.69/1.91 ------------> process sos:
% 1.69/1.91 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.69/1.91 ** KEPT (pick-wt=9): 3 [] multiply(additive_inverse(A),additive_inverse(B))=multiply(A,B).
% 1.69/1.91 ---> New Demodulator: 4 [new_demod,3] multiply(additive_inverse(A),additive_inverse(B))=multiply(A,B).
% 1.69/1.91 ** KEPT (pick-wt=9): 6 [copy,5,flip.1] additive_inverse(multiply(A,B))=multiply(additive_inverse(A),B).
% 1.69/1.91 ---> New Demodulator: 7 [new_demod,6] additive_inverse(multiply(A,B))=multiply(additive_inverse(A),B).
% 1.69/1.91 ** KEPT (pick-wt=9): 9 [copy,8,demod,7] multiply(A,additive_inverse(B))=multiply(additive_inverse(A),B).
% 1.69/1.91 ** KEPT (pick-wt=15): 11 [copy,10,demod,7] multiply(A,add(B,additive_inverse(C)))=add(multiply(A,B),multiply(additive_inverse(A),C)).
% 1.69/1.91 ** KEPT (pick-wt=15): 13 [copy,12,demod,7] multiply(add(A,additive_inverse(B)),C)=add(multiply(A,C),multiply(additive_inverse(B),C)).
% 1.69/1.91 ---> New Demodulator: 14 [new_demod,13] multiply(add(A,additive_inverse(B)),C)=add(multiply(A,C),multiply(additive_inverse(B),C)).
% 1.69/1.91 ** KEPT (pick-wt=16): 16 [copy,15,demod,7,7] multiply(additive_inverse(A),add(B,C))=add(multiply(additive_inverse(A),B),multiply(additive_inverse(A),C)).
% 1.69/1.91 ---> New Demodulator: 17 [new_demod,16] multiply(additive_inverse(A),add(B,C))=add(multiply(additive_inverse(A),B),multiply(additive_inverse(A),C)).
% 1.69/1.91 ** KEPT (pick-wt=16): 19 [copy,18,demod,7,7] multiply(add(A,B),additive_inverse(C))=add(multiply(additive_inverse(A),C),multiply(additive_inverse(B),C)).
% 1.69/1.91 ** KEPT (pick-wt=7): 20 [] add(A,B)=add(B,A).
% 1.69/1.91 ** KEPT (pick-wt=11): 22 [copy,21,flip.1] add(add(A,B),C)=add(A,add(B,C)).
% 1.69/1.91 ---> New Demodulator: 23 [new_demod,22] add(add(A,B),C)=add(A,add(B,C)).
% 1.69/1.91 ** KEPT (pick-wt=5): 24 [] add(additive_identity,A)=A.
% 1.69/1.91 ---> New Demodulator: 25 [new_demod,24] add(additive_identity,A)=A.
% 1.69/1.91 ** KEPT (pick-wt=5): 26 [] add(A,additive_identity)=A.
% 1.69/1.91 ---> New Demodulator: 27 [new_demod,26] add(A,additive_identity)=A.
% 1.69/1.91 ** KEPT (pick-wt=5): 28 [] multiply(additive_identity,A)=additive_identity.
% 1.69/1.91 ---> New Demodulator: 29 [new_demod,28] multiply(additive_identity,A)=additive_identity.
% 1.69/1.91 ** KEPT (pick-wt=5): 30 [] multiply(A,additive_identity)=additive_identity.
% 1.69/1.91 ---> New Demodulator: 31 [new_demod,30] multiply(A,additive_identity)=additive_identity.
% 1.69/1.91 ** KEPT (pick-wt=6): 32 [] add(additive_inverse(A),A)=additive_identity.
% 1.69/1.91 ---> New Demodulator: 33 [new_demod,32] add(additive_inverse(A),A)=additive_identity.
% 1.69/1.91 ** KEPT (pick-wt=6): 34 [] add(A,additive_inverse(A))=additive_identity.
% 1.69/1.91 ---> New Demodulator: 35 [new_demod,34] add(A,additive_inverse(A))=additive_identity.
% 1.69/1.91 ** KEPT (pick-wt=13): 36 [] multiply(A,add(B,C))=add(multiply(A,B),multiply(A,C)).
% 1.69/1.91 ---> New Demodulator: 37 [new_demod,36] multiply(A,add(B,C))=add(multiply(A,B),multiply(A,C)).
% 1.69/1.91 ** KEPT (pick-wt=13): 38 [] multiply(add(A,B),C)=add(multiply(A,C),multiply(B,C)).
% 1.69/1.91 ---> New Demodulator: 39 [new_demod,38] multiply(add(A,B),C)=add(multiply(A,C),multiply(B,C)).
% 1.69/1.91 ** KEPT (pick-wt=5): 40 [] additive_inverse(additive_inverse(A))=A.
% 1.69/1.91 ---> New Demodulator: 41 [new_demod,40] additive_inverse(additive_inverse(A))=A.
% 1.69/1.91 ** KEPT (pick-wt=11): 42 [] multiply(multiply(A,B),B)=multiply(A,multiply(B,B)).
% 1.69/1.91 ---> New Demodulator: 43 [new_demod,42] multiply(multiply(A,B),B)=multiply(A,multiply(B,B)).
% 1.69/1.91 ** KEPT (pick-wt=17): 45 [copy,44,demod,7,flip.1] add(multiply(multiply(A,B),C),multiply(additive_inverse(A),multiply(B,C)))=associator(A,B,C).
% 1.69/1.91 ---> New Demodulator: 46 [new_demod,45] add(multiply(multiply(A,B),C),multiply(additive_inverse(A),multiply(B,C)))=associator(A,B,C).
% 1.69/1.91 ** KEPT (pick-wt=12): 48 [copy,47,demod,7,flip.1] add(multiply(A,B),multiply(additive_inverse(B),A))=commutator(B,A).
% 1.69/1.91 ---> New Demodulator: 49 [new_demod,48] add(multiply(A,B),multiply(additive_inverse(B),A))=commutator(B,A).
% 1.69/1.91 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.69/1.91 >>>> Starting back demodulation with 4.
% 1.69/1.91 >>>> Starting back demodulation with 7.
% 1.69/1.91 ** KEPT (pick-wt=9): 50 [copy,9,flip.1] multiply(additive_inverse(A),B)=multiply(A,additive_inverse(B)).
% 1.69/1.91 ** KEPT (pick-wt=17): 51 [copy,11,flip.1,demod,37] add(multiply(A,B),multiply(additive_inverse(A),C))=add(multiply(A,B),multiply(A,additive_inverse(C))).
% 1.69/1.91 >>>> Starting back demodulation with 14.
% 1.69/1.91 >>>> Starting back demodulation with 17.
% 1.69/1.91 ** KEPT (pick-wt=19): 52 [copy,19,flip.1,demod,39] add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B))=add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))).
% 1.69/1.91 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] add(A,B)=add(B,A).
% 1.69/1.91 >>>> Starting back demodulation with 23.
% 1.69/1.91 >>>> Starting back demodulation with 25.
% 1.69/1.91 >>>> Starting back demodulation with 27.
% 1.69/1.91 >>>> Starting back demodulation with 29.
% 1.69/1.91 >>>> Starting back demodulation with 31.
% 1.69/1.91 >>>> Starting back demodulation with 33.
% 1.69/1.91 >>>> Starting back demodulation with 35.
% 1.69/1.91 >>>> Starting back demodulation with 37.
% 1.69/1.91 >> back demodulating 16 with 37.
% 1.69/1.91 >> back demodulating 11 with 37.
% 1.69/1.91 >>>> Starting back demodulation with 39.
% 1.69/1.91 >> back demodulating 19 with 39.
% 1.69/1.91 >> back demodulating 13 with 39.
% 1.69/1.91 >>>> Starting back demodulation with 41.
% 1.69/1.91 >>>> Starting back demodulation with 43.
% 1.69/1.91 >>>> Starting back demodulation with 46.
% 1.69/1.91 >>>> Starting back demodulation with 49.
% 2.12/2.34 Following clause subsumed by 9 during input processing: 0 [copy,50,flip.1] multiply(A,additive_inverse(B))=multiply(additive_inverse(A),B).
% 2.12/2.34 Following clause subsumed by 53 during input processing: 0 [copy,51,flip.1] add(multiply(A,B),multiply(A,additive_inverse(C)))=add(multiply(A,B),multiply(additive_inverse(A),C)).
% 2.12/2.34 Following clause subsumed by 54 during input processing: 0 [copy,52,flip.1] add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B)))=add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)).
% 2.12/2.34 Following clause subsumed by 51 during input processing: 0 [copy,53,flip.1] add(multiply(A,B),multiply(additive_inverse(A),C))=add(multiply(A,B),multiply(A,additive_inverse(C))).
% 2.12/2.34 Following clause subsumed by 52 during input processing: 0 [copy,54,flip.1] add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B))=add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))).
% 2.12/2.34
% 2.12/2.34 ======= end of input processing =======
% 2.12/2.34
% 2.12/2.34 =========== start of search ===========
% 2.12/2.34
% 2.12/2.34
% 2.12/2.34 Resetting weight limit to 11.
% 2.12/2.34
% 2.12/2.34
% 2.12/2.34 Resetting weight limit to 11.
% 2.12/2.34
% 2.12/2.34 sos_size=265
% 2.12/2.34
% 2.12/2.34 Search stopped because sos empty.
% 2.12/2.34
% 2.12/2.34
% 2.12/2.34 Search stopped because sos empty.
% 2.12/2.34
% 2.12/2.34 ============ end of search ============
% 2.12/2.34
% 2.12/2.34 -------------- statistics -------------
% 2.12/2.34 clauses given 369
% 2.12/2.34 clauses generated 46897
% 2.12/2.34 clauses kept 443
% 2.12/2.34 clauses forward subsumed 15031
% 2.12/2.34 clauses back subsumed 2
% 2.12/2.34 Kbytes malloced 6835
% 2.12/2.34
% 2.12/2.34 ----------- times (seconds) -----------
% 2.12/2.34 user CPU time 0.42 (0 hr, 0 min, 0 sec)
% 2.12/2.34 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.12/2.34 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.12/2.34
% 2.12/2.34 Process 23958 finished Wed Jul 27 02:01:57 2022
% 2.12/2.34 Otter interrupted
% 2.12/2.34 PROOF NOT FOUND
%------------------------------------------------------------------------------