TSTP Solution File: GRP765-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP765-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:57:47 EDT 2022
% Result : Unknown 1.94s 2.17s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP765-1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 05:38:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.94/2.13 ----- Otter 3.3f, August 2004 -----
% 1.94/2.13 The process was started by sandbox2 on n026.cluster.edu,
% 1.94/2.13 Wed Jul 27 05:38:54 2022
% 1.94/2.13 The command was "./otter". The process ID is 20899.
% 1.94/2.13
% 1.94/2.13 set(prolog_style_variables).
% 1.94/2.13 set(auto).
% 1.94/2.13 dependent: set(auto1).
% 1.94/2.13 dependent: set(process_input).
% 1.94/2.13 dependent: clear(print_kept).
% 1.94/2.13 dependent: clear(print_new_demod).
% 1.94/2.13 dependent: clear(print_back_demod).
% 1.94/2.13 dependent: clear(print_back_sub).
% 1.94/2.13 dependent: set(control_memory).
% 1.94/2.13 dependent: assign(max_mem, 12000).
% 1.94/2.13 dependent: assign(pick_given_ratio, 4).
% 1.94/2.13 dependent: assign(stats_level, 1).
% 1.94/2.13 dependent: assign(max_seconds, 10800).
% 1.94/2.13 clear(print_given).
% 1.94/2.13
% 1.94/2.13 list(usable).
% 1.94/2.13 0 [] A=A.
% 1.94/2.13 0 [] product(A,one)=A.
% 1.94/2.13 0 [] product(one,A)=A.
% 1.94/2.13 0 [] product(A,difference(A,B))=B.
% 1.94/2.13 0 [] difference(A,product(A,B))=B.
% 1.94/2.13 0 [] quotient(product(A,B),B)=A.
% 1.94/2.13 0 [] product(quotient(A,B),B)=A.
% 1.94/2.13 0 [] difference(A,product(product(A,B),C))=quotient(product(B,product(C,A)),A).
% 1.94/2.13 0 [] difference(product(A,B),product(A,product(B,C)))=quotient(quotient(product(C,product(A,B)),B),A).
% 1.94/2.13 0 [] i(A)=difference(A,one).
% 1.94/2.13 0 [] j(A)=quotient(one,A).
% 1.94/2.13 0 [] product(i(A),A)=product(A,j(A)).
% 1.94/2.13 0 [] eta(A)=product(i(A),A).
% 1.94/2.13 0 [] product(i(i(x0)),x1)!=product(eta(x0),product(x0,x1)).
% 1.94/2.13 end_of_list.
% 1.94/2.13
% 1.94/2.13 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.94/2.13
% 1.94/2.13 All clauses are units, and equality is present; the
% 1.94/2.13 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.94/2.13
% 1.94/2.13 dependent: set(knuth_bendix).
% 1.94/2.13 dependent: set(anl_eq).
% 1.94/2.13 dependent: set(para_from).
% 1.94/2.13 dependent: set(para_into).
% 1.94/2.13 dependent: clear(para_from_right).
% 1.94/2.13 dependent: clear(para_into_right).
% 1.94/2.13 dependent: set(para_from_vars).
% 1.94/2.13 dependent: set(eq_units_both_ways).
% 1.94/2.13 dependent: set(dynamic_demod_all).
% 1.94/2.13 dependent: set(dynamic_demod).
% 1.94/2.13 dependent: set(order_eq).
% 1.94/2.13 dependent: set(back_demod).
% 1.94/2.13 dependent: set(lrpo).
% 1.94/2.13
% 1.94/2.13 ------------> process usable:
% 1.94/2.13 ** KEPT (pick-wt=12): 1 [] product(i(i(x0)),x1)!=product(eta(x0),product(x0,x1)).
% 1.94/2.13
% 1.94/2.13 ------------> process sos:
% 1.94/2.13 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.94/2.13 ** KEPT (pick-wt=5): 3 [] product(A,one)=A.
% 1.94/2.13 ---> New Demodulator: 4 [new_demod,3] product(A,one)=A.
% 1.94/2.13 ** KEPT (pick-wt=5): 5 [] product(one,A)=A.
% 1.94/2.13 ---> New Demodulator: 6 [new_demod,5] product(one,A)=A.
% 1.94/2.13 ** KEPT (pick-wt=7): 7 [] product(A,difference(A,B))=B.
% 1.94/2.13 ---> New Demodulator: 8 [new_demod,7] product(A,difference(A,B))=B.
% 1.94/2.13 ** KEPT (pick-wt=7): 9 [] difference(A,product(A,B))=B.
% 1.94/2.13 ---> New Demodulator: 10 [new_demod,9] difference(A,product(A,B))=B.
% 1.94/2.13 ** KEPT (pick-wt=7): 11 [] quotient(product(A,B),B)=A.
% 1.94/2.13 ---> New Demodulator: 12 [new_demod,11] quotient(product(A,B),B)=A.
% 1.94/2.13 ** KEPT (pick-wt=7): 13 [] product(quotient(A,B),B)=A.
% 1.94/2.13 ---> New Demodulator: 14 [new_demod,13] product(quotient(A,B),B)=A.
% 1.94/2.13 ** KEPT (pick-wt=15): 16 [copy,15,flip.1] quotient(product(A,product(B,C)),C)=difference(C,product(product(C,A),B)).
% 1.94/2.13 ---> New Demodulator: 17 [new_demod,16] quotient(product(A,product(B,C)),C)=difference(C,product(product(C,A),B)).
% 1.94/2.13 ** KEPT (pick-wt=19): 19 [copy,18,demod,17,flip.1] quotient(difference(A,product(product(A,B),C)),C)=difference(product(C,A),product(C,product(A,B))).
% 1.94/2.13 ---> New Demodulator: 20 [new_demod,19] quotient(difference(A,product(product(A,B),C)),C)=difference(product(C,A),product(C,product(A,B))).
% 1.94/2.13 ** KEPT (pick-wt=6): 21 [] i(A)=difference(A,one).
% 1.94/2.13 ---> New Demodulator: 22 [new_demod,21] i(A)=difference(A,one).
% 1.94/2.13 ** KEPT (pick-wt=6): 23 [] j(A)=quotient(one,A).
% 1.94/2.13 ---> New Demodulator: 24 [new_demod,23] j(A)=quotient(one,A).
% 1.94/2.13 ** KEPT (pick-wt=11): 26 [copy,25,demod,22,24,flip.1] product(A,quotient(one,A))=product(difference(A,one),A).
% 1.94/2.13 ---> New Demodulator: 27 [new_demod,26] product(A,quotient(one,A))=product(difference(A,one),A).
% 1.94/2.13 ** KEPT (pick-wt=8): 29 [copy,28,demod,22] eta(A)=product(difference(A,one),A).
% 1.94/2.13 ---> New Demodulator: 30 [new_demod,29] eta(A)=product(difference(A,one),A).
% 1.94/2.13 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.94/2.13 >>>> Starting back demodulation with 4.
% 1.94/2.13 >>>> Starting back demodulation with 6.
% 1.94/2.13 >>>> Starting back demodulation with 8.
% 1.94/2.13 >>>> Starting back demodulation with 10.
% 1.94/2.13 >>>> Starting back demodulation with 12.
% 1.94/2.13 >>>> Starting back demodulation with 14.
% 1.94/2.17 >>>> Starting back demodulation with 17.
% 1.94/2.17 >>>> Starting back demodulation with 20.
% 1.94/2.17 >>>> Starting back demodulation with 22.
% 1.94/2.17 >> back demodulating 1 with 22.
% 1.94/2.17 >>>> Starting back demodulation with 24.
% 1.94/2.17 >>>> Starting back demodulation with 27.
% 1.94/2.17 >>>> Starting back demodulation with 30.
% 1.94/2.17
% 1.94/2.17 ======= end of input processing =======
% 1.94/2.17
% 1.94/2.17 =========== start of search ===========
% 1.94/2.17
% 1.94/2.17
% 1.94/2.17 Resetting weight limit to 17.
% 1.94/2.17
% 1.94/2.17
% 1.94/2.17 Resetting weight limit to 17.
% 1.94/2.17
% 1.94/2.17 sos_size=34
% 1.94/2.17
% 1.94/2.17
% 1.94/2.17 Resetting weight limit to 11.
% 1.94/2.17
% 1.94/2.17
% 1.94/2.17 Resetting weight limit to 11.
% 1.94/2.17
% 1.94/2.17 sos_size=20
% 1.94/2.17
% 1.94/2.17 Search stopped because sos empty.
% 1.94/2.17
% 1.94/2.17
% 1.94/2.17 Search stopped because sos empty.
% 1.94/2.17
% 1.94/2.17 ============ end of search ============
% 1.94/2.17
% 1.94/2.17 -------------- statistics -------------
% 1.94/2.17 clauses given 87
% 1.94/2.17 clauses generated 1648
% 1.94/2.17 clauses kept 162
% 1.94/2.17 clauses forward subsumed 909
% 1.94/2.17 clauses back subsumed 0
% 1.94/2.17 Kbytes malloced 5859
% 1.94/2.17
% 1.94/2.17 ----------- times (seconds) -----------
% 1.94/2.17 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 1.94/2.17 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.94/2.17 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.94/2.17
% 1.94/2.17 Process 20899 finished Wed Jul 27 05:38:56 2022
% 1.94/2.17 Otter interrupted
% 1.94/2.17 PROOF NOT FOUND
%------------------------------------------------------------------------------