TSTP Solution File: GRP776+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP776+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:48 EDT 2022
% Result : Unknown 2.40s 2.65s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : GRP776+1 : TPTP v8.1.0. Released v4.1.0.
% 0.02/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n016.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:19:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.68/1.91 ----- Otter 3.3f, August 2004 -----
% 1.68/1.91 The process was started by sandbox2 on n016.cluster.edu,
% 1.68/1.91 Wed Jul 27 05:19:52 2022
% 1.68/1.91 The command was "./otter". The process ID is 25987.
% 1.68/1.91
% 1.68/1.91 set(prolog_style_variables).
% 1.68/1.91 set(auto).
% 1.68/1.91 dependent: set(auto1).
% 1.68/1.91 dependent: set(process_input).
% 1.68/1.91 dependent: clear(print_kept).
% 1.68/1.91 dependent: clear(print_new_demod).
% 1.68/1.91 dependent: clear(print_back_demod).
% 1.68/1.91 dependent: clear(print_back_sub).
% 1.68/1.91 dependent: set(control_memory).
% 1.68/1.91 dependent: assign(max_mem, 12000).
% 1.68/1.91 dependent: assign(pick_given_ratio, 4).
% 1.68/1.91 dependent: assign(stats_level, 1).
% 1.68/1.91 dependent: assign(max_seconds, 10800).
% 1.68/1.91 clear(print_given).
% 1.68/1.91
% 1.68/1.91 formula_list(usable).
% 1.68/1.91 all A (A=A).
% 1.68/1.91 all B A (g(A)&g(B)->g(product(A,B))).
% 1.68/1.91 all A (g(A)->g(inv(A))).
% 1.68/1.91 g(eh).
% 1.68/1.91 all C B A (g(A)&g(B)&g(C)->product(product(A,B),C)=product(A,product(B,C))).
% 1.68/1.91 all A (g(A)->product(eh,A)=A).
% 1.68/1.91 all A (g(A)->product(A,eh)=A).
% 1.68/1.91 all A (g(A)->product(A,inv(A))=eh).
% 1.68/1.91 all A (g(A)->product(inv(A),A)=eh).
% 1.68/1.91 all B A (h(A)&h(B)->h(sum(A,B))).
% 1.68/1.91 all B A (h(A)->h(opp(B))).
% 1.68/1.91 h(eg).
% 1.68/1.91 all C B A (h(A)&h(B)&h(C)->sum(sum(A,B),C)=sum(A,sum(B,C))).
% 1.68/1.91 all A (h(A)->sum(eg,A)=A).
% 1.68/1.91 all A (h(A)->sum(A,eg)=A).
% 1.68/1.91 all A (h(A)->sum(A,opp(A))=eg).
% 1.68/1.91 all A (h(A)->sum(opp(A),A)=eg).
% 1.68/1.91 all A (g(A)->h(f(A))).
% 1.68/1.91 all B A (f(product(A,B))=sum(f(A),f(B))).
% 1.68/1.91 -(all X0 (f(eh)=eg& (-g(X0)|f(inv(X0))=opp(f(X0))))).
% 1.68/1.91 end_of_list.
% 1.68/1.91
% 1.68/1.91 -------> usable clausifies to:
% 1.68/1.91
% 1.68/1.91 list(usable).
% 1.68/1.91 0 [] A=A.
% 1.68/1.91 0 [] -g(A)| -g(B)|g(product(A,B)).
% 1.68/1.91 0 [] -g(A)|g(inv(A)).
% 1.68/1.91 0 [] g(eh).
% 1.68/1.91 0 [] -g(A)| -g(B)| -g(C)|product(product(A,B),C)=product(A,product(B,C)).
% 1.68/1.91 0 [] -g(A)|product(eh,A)=A.
% 1.68/1.91 0 [] -g(A)|product(A,eh)=A.
% 1.68/1.91 0 [] -g(A)|product(A,inv(A))=eh.
% 1.68/1.91 0 [] -g(A)|product(inv(A),A)=eh.
% 1.68/1.91 0 [] -h(A)| -h(B)|h(sum(A,B)).
% 1.68/1.91 0 [] -h(A)|h(opp(B)).
% 1.68/1.91 0 [] h(eg).
% 1.68/1.91 0 [] -h(A)| -h(B)| -h(C)|sum(sum(A,B),C)=sum(A,sum(B,C)).
% 1.68/1.91 0 [] -h(A)|sum(eg,A)=A.
% 1.68/1.91 0 [] -h(A)|sum(A,eg)=A.
% 1.68/1.91 0 [] -h(A)|sum(A,opp(A))=eg.
% 1.68/1.91 0 [] -h(A)|sum(opp(A),A)=eg.
% 1.68/1.91 0 [] -g(A)|h(f(A)).
% 1.68/1.91 0 [] f(product(A,B))=sum(f(A),f(B)).
% 1.68/1.91 0 [] f(eh)!=eg|g($c1).
% 1.68/1.91 0 [] f(eh)!=eg|f(inv($c1))!=opp(f($c1)).
% 1.68/1.91 end_of_list.
% 1.68/1.91
% 1.68/1.91 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 1.68/1.91
% 1.68/1.91 This is a Horn set with equality. The strategy will be
% 1.68/1.91 Knuth-Bendix and hyper_res, with positive clauses in
% 1.68/1.91 sos and nonpositive clauses in usable.
% 1.68/1.91
% 1.68/1.91 dependent: set(knuth_bendix).
% 1.68/1.91 dependent: set(anl_eq).
% 1.68/1.91 dependent: set(para_from).
% 1.68/1.91 dependent: set(para_into).
% 1.68/1.91 dependent: clear(para_from_right).
% 1.68/1.91 dependent: clear(para_into_right).
% 1.68/1.91 dependent: set(para_from_vars).
% 1.68/1.91 dependent: set(eq_units_both_ways).
% 1.68/1.91 dependent: set(dynamic_demod_all).
% 1.68/1.91 dependent: set(dynamic_demod).
% 1.68/1.91 dependent: set(order_eq).
% 1.68/1.91 dependent: set(back_demod).
% 1.68/1.91 dependent: set(lrpo).
% 1.68/1.91 dependent: set(hyper_res).
% 1.68/1.91 dependent: clear(order_hyper).
% 1.68/1.91
% 1.68/1.91 ------------> process usable:
% 1.68/1.91 ** KEPT (pick-wt=8): 1 [] -g(A)| -g(B)|g(product(A,B)).
% 1.68/1.91 ** KEPT (pick-wt=5): 2 [] -g(A)|g(inv(A)).
% 1.68/1.91 ** KEPT (pick-wt=17): 3 [] -g(A)| -g(B)| -g(C)|product(product(A,B),C)=product(A,product(B,C)).
% 1.68/1.91 ** KEPT (pick-wt=7): 4 [] -g(A)|product(eh,A)=A.
% 1.68/1.91 ** KEPT (pick-wt=7): 5 [] -g(A)|product(A,eh)=A.
% 1.68/1.91 ** KEPT (pick-wt=8): 6 [] -g(A)|product(A,inv(A))=eh.
% 1.68/1.91 ** KEPT (pick-wt=8): 7 [] -g(A)|product(inv(A),A)=eh.
% 1.68/1.91 ** KEPT (pick-wt=8): 8 [] -h(A)| -h(B)|h(sum(A,B)).
% 1.68/1.91 ** KEPT (pick-wt=5): 9 [] -h(A)|h(opp(B)).
% 1.68/1.91 ** KEPT (pick-wt=17): 10 [] -h(A)| -h(B)| -h(C)|sum(sum(A,B),C)=sum(A,sum(B,C)).
% 1.68/1.91 ** KEPT (pick-wt=7): 11 [] -h(A)|sum(eg,A)=A.
% 1.68/1.91 ** KEPT (pick-wt=7): 12 [] -h(A)|sum(A,eg)=A.
% 1.68/1.91 ** KEPT (pick-wt=8): 13 [] -h(A)|sum(A,opp(A))=eg.
% 1.68/1.91 ** KEPT (pick-wt=8): 14 [] -h(A)|sum(opp(A),A)=eg.
% 1.68/1.91 ** KEPT (pick-wt=5): 15 [] -g(A)|h(f(A)).
% 1.68/1.91 ** KEPT (pick-wt=6): 16 [] f(eh)!=eg|g($c1).
% 1.68/1.91 ** KEPT (pick-wt=11): 18 [copy,17,flip.2] f(eh)!=eg|opp(f($c1))!=f(inv($c1)).
% 1.68/1.91
% 1.68/1.91 ------------> process sos:
% 1.68/1.91 ** KEPT (pick-wt=3): 19 [] A=A.
% 1.68/1.91 ** KEPT (pick-wt=2): 20 [] g(eh).
% 1.68/1.91 ** KEPT (pick-wt=2): 21 [] h(eg).
% 1.68/1.91 ** KEPT (pick-wt=10): 22 [] f(product(A,B))=sum(f(A),f(B)).
% 1.68/1.91 ---> New Demodulator: 23 [new_demod,22] f(product(A,B))=sum(f(A),f(B)).
% 1.68/1.91 Following clause subsumed by 19 during input processing: 0 [copy,19,flip.1] A=A.
% 1.68/1.91 >>>> Starting back demodulation with 23.
% 1.68/1.91
% 1.68/1.91 ======= end of input processing =======
% 2.40/2.65
% 2.40/2.65 =========== start of search ===========
% 2.40/2.65
% 2.40/2.65
% 2.40/2.65 Resetting weight limit to 18.
% 2.40/2.65
% 2.40/2.65
% 2.40/2.65 Resetting weight limit to 18.
% 2.40/2.65
% 2.40/2.65 sos_size=1168
% 2.40/2.65
% 2.40/2.65
% 2.40/2.65 Resetting weight limit to 6.
% 2.40/2.65
% 2.40/2.65
% 2.40/2.65 Resetting weight limit to 6.
% 2.40/2.65
% 2.40/2.65 sos_size=108
% 2.40/2.65
% 2.40/2.65 Search stopped because sos empty.
% 2.40/2.65
% 2.40/2.65
% 2.40/2.65 Search stopped because sos empty.
% 2.40/2.65
% 2.40/2.65 ============ end of search ============
% 2.40/2.65
% 2.40/2.65 -------------- statistics -------------
% 2.40/2.65 clauses given 194
% 2.40/2.65 clauses generated 51209
% 2.40/2.65 clauses kept 1897
% 2.40/2.65 clauses forward subsumed 2161
% 2.40/2.65 clauses back subsumed 3
% 2.40/2.65 Kbytes malloced 5859
% 2.40/2.65
% 2.40/2.65 ----------- times (seconds) -----------
% 2.40/2.65 user CPU time 0.74 (0 hr, 0 min, 0 sec)
% 2.40/2.65 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.40/2.65 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.40/2.65
% 2.40/2.65 Process 25987 finished Wed Jul 27 05:19:54 2022
% 2.40/2.65 Otter interrupted
% 2.40/2.65 PROOF NOT FOUND
%------------------------------------------------------------------------------