TSTP Solution File: GRP745+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP745+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:45 EDT 2022
% Result : Unknown 4.52s 4.73s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.11 % Problem : GRP745+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.14/0.33 % Computer : n020.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Wed Jul 27 05:19:23 EDT 2022
% 0.14/0.33 % CPUTime :
% 1.94/2.13 ----- Otter 3.3f, August 2004 -----
% 1.94/2.13 The process was started by sandbox2 on n020.cluster.edu,
% 1.94/2.13 Wed Jul 27 05:19:23 2022
% 1.94/2.13 The command was "./otter". The process ID is 12967.
% 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 formula_list(usable).
% 1.94/2.13 all A (A=A).
% 1.94/2.13 all B A (mult(A,ld(A,B))=B).
% 1.94/2.13 all B A (ld(A,mult(A,B))=B).
% 1.94/2.13 all B A (mult(rd(A,B),B)=A).
% 1.94/2.13 all B A (rd(mult(A,B),B)=A).
% 1.94/2.13 all A (mult(A,unit)=A).
% 1.94/2.13 all A (mult(unit,A)=A).
% 1.94/2.13 all C B A (mult(mult(mult(A,B),C),B)=mult(A,mult(mult(B,C),B))).
% 1.94/2.13 all X0 X1 X2 (mult(mult(X0,X1),X2)=mult(X0,mult(X1,X2))&mult(mult(X0,X2),X1)=mult(X0,mult(X2,X1))|mult(mult(X0,X1),X2)=mult(X0,mult(X2,X1))&mult(mult(X0,X2),X1)=mult(X0,mult(X1,X2))).
% 1.94/2.13 mult(a,mult(b,mult(c,a)))!=mult(mult(mult(a,b),c),a).
% 1.94/2.13 end_of_list.
% 1.94/2.13
% 1.94/2.13 -------> usable clausifies to:
% 1.94/2.13
% 1.94/2.13 list(usable).
% 1.94/2.13 0 [] A=A.
% 1.94/2.13 0 [] mult(A,ld(A,B))=B.
% 1.94/2.13 0 [] ld(A,mult(A,B))=B.
% 1.94/2.13 0 [] mult(rd(A,B),B)=A.
% 1.94/2.13 0 [] rd(mult(A,B),B)=A.
% 1.94/2.13 0 [] mult(A,unit)=A.
% 1.94/2.13 0 [] mult(unit,A)=A.
% 1.94/2.13 0 [] mult(mult(mult(A,B),C),B)=mult(A,mult(mult(B,C),B)).
% 1.94/2.13 0 [] mult(mult(X0,X1),X2)=mult(X0,mult(X1,X2))|mult(mult(X0,X1),X2)=mult(X0,mult(X2,X1)).
% 1.94/2.13 0 [] mult(mult(X0,X1),X2)=mult(X0,mult(X1,X2))|mult(mult(X0,X2),X1)=mult(X0,mult(X1,X2)).
% 1.94/2.13 0 [] mult(mult(X0,X2),X1)=mult(X0,mult(X2,X1))|mult(mult(X0,X1),X2)=mult(X0,mult(X2,X1)).
% 1.94/2.13 0 [] mult(mult(X0,X2),X1)=mult(X0,mult(X2,X1))|mult(mult(X0,X2),X1)=mult(X0,mult(X1,X2)).
% 1.94/2.13 0 [] mult(a,mult(b,mult(c,a)))!=mult(mult(mult(a,b),c),a).
% 1.94/2.13 end_of_list.
% 1.94/2.13
% 1.94/2.13 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 1.94/2.13
% 1.94/2.13 This ia a non-Horn set with equality. The strategy will be
% 1.94/2.13 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.94/2.13 deletion, with positive clauses in sos and nonpositive
% 1.94/2.13 clauses in usable.
% 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 dependent: set(hyper_res).
% 1.94/2.13 dependent: set(unit_deletion).
% 1.94/2.13 dependent: set(factor).
% 1.94/2.13
% 1.94/2.13 ------------> process usable:
% 1.94/2.13 ** KEPT (pick-wt=15): 2 [copy,1,flip.1] mult(mult(mult(a,b),c),a)!=mult(a,mult(b,mult(c,a))).
% 1.94/2.13
% 1.94/2.13 ------------> process sos:
% 1.94/2.13 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.94/2.13 ** KEPT (pick-wt=7): 4 [] mult(A,ld(A,B))=B.
% 1.94/2.13 ---> New Demodulator: 5 [new_demod,4] mult(A,ld(A,B))=B.
% 1.94/2.13 ** KEPT (pick-wt=7): 6 [] ld(A,mult(A,B))=B.
% 1.94/2.13 ---> New Demodulator: 7 [new_demod,6] ld(A,mult(A,B))=B.
% 1.94/2.13 ** KEPT (pick-wt=7): 8 [] mult(rd(A,B),B)=A.
% 1.94/2.13 ---> New Demodulator: 9 [new_demod,8] mult(rd(A,B),B)=A.
% 1.94/2.13 ** KEPT (pick-wt=7): 10 [] rd(mult(A,B),B)=A.
% 1.94/2.13 ---> New Demodulator: 11 [new_demod,10] rd(mult(A,B),B)=A.
% 1.94/2.13 ** KEPT (pick-wt=5): 12 [] mult(A,unit)=A.
% 1.94/2.13 ---> New Demodulator: 13 [new_demod,12] mult(A,unit)=A.
% 1.94/2.13 ** KEPT (pick-wt=5): 14 [] mult(unit,A)=A.
% 1.94/2.13 ---> New Demodulator: 15 [new_demod,14] mult(unit,A)=A.
% 1.94/2.13 ** KEPT (pick-wt=15): 16 [] mult(mult(mult(A,B),C),B)=mult(A,mult(mult(B,C),B)).
% 1.94/2.13 ---> New Demodulator: 17 [new_demod,16] mult(mult(mult(A,B),C),B)=mult(A,mult(mult(B,C),B)).
% 1.94/2.13 ** KEPT (pick-wt=22): 18 [] mult(mult(A,B),C)=mult(A,mult(B,C))|mult(mult(A,B),C)=mult(A,mult(C,B)).
% 1.94/2.13 ** KEPT (pick-wt=22): 19 [] mult(mult(A,B),C)=mult(A,mult(B,C))|mult(mult(A,C),B)=mult(A,mult(B,C)).
% 1.94/2.13 Following clause subsumed by 19 during input processing: 0 [] mult(mult(A,B),C)=mult(A,mult(B,C))|mult(mult(A,C),B)=mult(A,mult(B,C)).
% 1.94/2.13 Following clause subsumed by 18 during input processing: 0 [] mult(mult(A,B),C)=mult(A,mult(B,C))|mult(mult(A,B),C)=mult(A,mult(C,B)).
% 1.94/2.13 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 4.52/4.73 >>>> Starting back demodulation with 5.
% 4.52/4.73 >>>> Starting back demodulation with 7.
% 4.52/4.73 >>>> Starting back demodulation with 9.
% 4.52/4.73 >>>> Starting back demodulation with 11.
% 4.52/4.73 >>>> Starting back demodulation with 13.
% 4.52/4.73 >>>> Starting back demodulation with 15.
% 4.52/4.73 >>>> Starting back demodulation with 17.
% 4.52/4.73 >>>> Starting back demodulation with 21.
% 4.52/4.73
% 4.52/4.73 ======= end of input processing =======
% 4.52/4.73
% 4.52/4.73 =========== start of search ===========
% 4.52/4.73
% 4.52/4.73
% 4.52/4.73 Resetting weight limit to 13.
% 4.52/4.73
% 4.52/4.73
% 4.52/4.73 Resetting weight limit to 13.
% 4.52/4.73
% 4.52/4.73 sos_size=312
% 4.52/4.73
% 4.52/4.73 Search stopped because sos empty.
% 4.52/4.73
% 4.52/4.73
% 4.52/4.73 Search stopped because sos empty.
% 4.52/4.73
% 4.52/4.73 ============ end of search ============
% 4.52/4.73
% 4.52/4.73 -------------- statistics -------------
% 4.52/4.73 clauses given 206
% 4.52/4.73 clauses generated 164292
% 4.52/4.73 clauses kept 745
% 4.52/4.73 clauses forward subsumed 2346
% 4.52/4.73 clauses back subsumed 1
% 4.52/4.73 Kbytes malloced 6835
% 4.52/4.73
% 4.52/4.73 ----------- times (seconds) -----------
% 4.52/4.73 user CPU time 2.56 (0 hr, 0 min, 2 sec)
% 4.52/4.73 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 4.52/4.73 wall-clock time 5 (0 hr, 0 min, 5 sec)
% 4.52/4.73
% 4.52/4.73 Process 12967 finished Wed Jul 27 05:19:28 2022
% 4.52/4.73 Otter interrupted
% 4.52/4.73 PROOF NOT FOUND
%------------------------------------------------------------------------------