TSTP Solution File: GRP052-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP052-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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:55:58 EDT 2022
% Result : Unknown 2.65s 2.39s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP052-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 04:53:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 2.65/2.38 ----- Otter 3.3f, August 2004 -----
% 2.65/2.38 The process was started by sandbox on n021.cluster.edu,
% 2.65/2.38 Wed Jul 27 04:53:08 2022
% 2.65/2.38 The command was "./otter". The process ID is 16453.
% 2.65/2.38
% 2.65/2.38 set(prolog_style_variables).
% 2.65/2.38 set(auto).
% 2.65/2.38 dependent: set(auto1).
% 2.65/2.38 dependent: set(process_input).
% 2.65/2.38 dependent: clear(print_kept).
% 2.65/2.38 dependent: clear(print_new_demod).
% 2.65/2.38 dependent: clear(print_back_demod).
% 2.65/2.38 dependent: clear(print_back_sub).
% 2.65/2.38 dependent: set(control_memory).
% 2.65/2.38 dependent: assign(max_mem, 12000).
% 2.65/2.38 dependent: assign(pick_given_ratio, 4).
% 2.65/2.38 dependent: assign(stats_level, 1).
% 2.65/2.38 dependent: assign(max_seconds, 10800).
% 2.65/2.38 clear(print_given).
% 2.65/2.38
% 2.65/2.38 list(usable).
% 2.65/2.38 0 [] A=A.
% 2.65/2.38 0 [] multiply(Z,inverse(multiply(multiply(multiply(inverse(Y),Y),inverse(multiply(inverse(multiply(Z,inverse(Y))),X))),Y)))=X.
% 2.65/2.38 0 [] multiply(inverse(a1),a1)!=multiply(inverse(b1),b1)|multiply(multiply(inverse(b2),b2),a2)!=a2|multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)).
% 2.65/2.38 end_of_list.
% 2.65/2.38
% 2.65/2.38 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 2.65/2.38
% 2.65/2.38 This is a Horn set with equality. The strategy will be
% 2.65/2.38 Knuth-Bendix and hyper_res, with positive clauses in
% 2.65/2.38 sos and nonpositive clauses in usable.
% 2.65/2.38
% 2.65/2.38 dependent: set(knuth_bendix).
% 2.65/2.38 dependent: set(anl_eq).
% 2.65/2.38 dependent: set(para_from).
% 2.65/2.38 dependent: set(para_into).
% 2.65/2.38 dependent: clear(para_from_right).
% 2.65/2.38 dependent: clear(para_into_right).
% 2.65/2.38 dependent: set(para_from_vars).
% 2.65/2.38 dependent: set(eq_units_both_ways).
% 2.65/2.38 dependent: set(dynamic_demod_all).
% 2.65/2.38 dependent: set(dynamic_demod).
% 2.65/2.38 dependent: set(order_eq).
% 2.65/2.38 dependent: set(back_demod).
% 2.65/2.38 dependent: set(lrpo).
% 2.65/2.38 dependent: set(hyper_res).
% 2.65/2.38 dependent: clear(order_hyper).
% 2.65/2.38
% 2.65/2.38 ------------> process usable:
% 2.65/2.38 ** KEPT (pick-wt=28): 2 [copy,1,flip.1] multiply(inverse(b1),b1)!=multiply(inverse(a1),a1)|multiply(multiply(inverse(b2),b2),a2)!=a2|multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)).
% 2.65/2.38
% 2.65/2.38 ------------> process sos:
% 2.65/2.38 ** KEPT (pick-wt=3): 3 [] A=A.
% 2.65/2.38 ** KEPT (pick-wt=20): 4 [] multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)))=C.
% 2.65/2.38 ---> New Demodulator: 5 [new_demod,4] multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)))=C.
% 2.65/2.38 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 2.65/2.38 >>>> Starting back demodulation with 5.
% 2.65/2.38
% 2.65/2.38 ======= end of input processing =======
% 2.65/2.38
% 2.65/2.38 =========== start of search ===========
% 2.65/2.38
% 2.65/2.38
% 2.65/2.38 Resetting weight limit to 32.
% 2.65/2.38
% 2.65/2.38
% 2.65/2.38 Resetting weight limit to 32.
% 2.65/2.38
% 2.65/2.38 sos_size=52
% 2.65/2.38
% 2.65/2.38
% 2.65/2.38 Resetting weight limit to 27.
% 2.65/2.38
% 2.65/2.38
% 2.65/2.38 Resetting weight limit to 27.
% 2.65/2.38
% 2.65/2.38 sos_size=65
% 2.65/2.38
% 2.65/2.38
% 2.65/2.38 Resetting weight limit to 13.
% 2.65/2.38
% 2.65/2.38
% 2.65/2.38 Resetting weight limit to 13.
% 2.65/2.38
% 2.65/2.38 sos_size=37
% 2.65/2.38
% 2.65/2.38 Search stopped because sos empty.
% 2.65/2.38
% 2.65/2.38
% 2.65/2.38 Search stopped because sos empty.
% 2.65/2.38
% 2.65/2.38 ============ end of search ============
% 2.65/2.38
% 2.65/2.38 -------------- statistics -------------
% 2.65/2.38 clauses given 85
% 2.65/2.38 clauses generated 10618
% 2.65/2.38 clauses kept 293
% 2.65/2.38 clauses forward subsumed 1590
% 2.65/2.38 clauses back subsumed 59
% 2.65/2.38 Kbytes malloced 7812
% 2.65/2.38
% 2.65/2.38 ----------- times (seconds) -----------
% 2.65/2.38 user CPU time 0.41 (0 hr, 0 min, 0 sec)
% 2.65/2.38 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.65/2.38 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.65/2.38
% 2.65/2.38 Process 16453 finished Wed Jul 27 04:53:10 2022
% 2.65/2.38 Otter interrupted
% 2.65/2.38 PROOF NOT FOUND
%------------------------------------------------------------------------------