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