TSTP Solution File: GRP480-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP480-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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:05 EDT 2022
% Result : Unknown 2.13s 2.32s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP480-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n018.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:36:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.13/2.32 ----- Otter 3.3f, August 2004 -----
% 2.13/2.32 The process was started by sandbox2 on n018.cluster.edu,
% 2.13/2.32 Wed Jul 27 05:36:16 2022
% 2.13/2.32 The command was "./otter". The process ID is 25562.
% 2.13/2.32
% 2.13/2.32 set(prolog_style_variables).
% 2.13/2.32 set(auto).
% 2.13/2.32 dependent: set(auto1).
% 2.13/2.32 dependent: set(process_input).
% 2.13/2.32 dependent: clear(print_kept).
% 2.13/2.32 dependent: clear(print_new_demod).
% 2.13/2.32 dependent: clear(print_back_demod).
% 2.13/2.32 dependent: clear(print_back_sub).
% 2.13/2.32 dependent: set(control_memory).
% 2.13/2.32 dependent: assign(max_mem, 12000).
% 2.13/2.32 dependent: assign(pick_given_ratio, 4).
% 2.13/2.32 dependent: assign(stats_level, 1).
% 2.13/2.32 dependent: assign(max_seconds, 10800).
% 2.13/2.32 clear(print_given).
% 2.13/2.32
% 2.13/2.32 list(usable).
% 2.13/2.32 0 [] A=A.
% 2.13/2.32 0 [] divide(inverse(divide(divide(divide(A,A),B),divide(C,divide(B,D)))),D)=C.
% 2.13/2.32 0 [] multiply(A,B)=divide(A,inverse(B)).
% 2.13/2.32 0 [] multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)).
% 2.13/2.32 end_of_list.
% 2.13/2.32
% 2.13/2.32 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.13/2.32
% 2.13/2.32 All clauses are units, and equality is present; the
% 2.13/2.32 strategy will be Knuth-Bendix with positive clauses in sos.
% 2.13/2.32
% 2.13/2.32 dependent: set(knuth_bendix).
% 2.13/2.32 dependent: set(anl_eq).
% 2.13/2.32 dependent: set(para_from).
% 2.13/2.32 dependent: set(para_into).
% 2.13/2.32 dependent: clear(para_from_right).
% 2.13/2.32 dependent: clear(para_into_right).
% 2.13/2.32 dependent: set(para_from_vars).
% 2.13/2.32 dependent: set(eq_units_both_ways).
% 2.13/2.32 dependent: set(dynamic_demod_all).
% 2.13/2.32 dependent: set(dynamic_demod).
% 2.13/2.32 dependent: set(order_eq).
% 2.13/2.32 dependent: set(back_demod).
% 2.13/2.32 dependent: set(lrpo).
% 2.13/2.32
% 2.13/2.32 ------------> process usable:
% 2.13/2.32 ** KEPT (pick-wt=11): 1 [] multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)).
% 2.13/2.32
% 2.13/2.32 ------------> process sos:
% 2.13/2.32 ** KEPT (pick-wt=3): 2 [] A=A.
% 2.13/2.32 ** KEPT (pick-wt=16): 3 [] divide(inverse(divide(divide(divide(A,A),B),divide(C,divide(B,D)))),D)=C.
% 2.13/2.32 ---> New Demodulator: 4 [new_demod,3] divide(inverse(divide(divide(divide(A,A),B),divide(C,divide(B,D)))),D)=C.
% 2.13/2.32 ** KEPT (pick-wt=8): 5 [] multiply(A,B)=divide(A,inverse(B)).
% 2.13/2.32 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 2.13/2.32 >>>> Starting back demodulation with 4.
% 2.13/2.32 ** KEPT (pick-wt=8): 6 [copy,5,flip.1] divide(A,inverse(B))=multiply(A,B).
% 2.13/2.32 Following clause subsumed by 5 during input processing: 0 [copy,6,flip.1] multiply(A,B)=divide(A,inverse(B)).
% 2.13/2.32
% 2.13/2.32 ======= end of input processing =======
% 2.13/2.32
% 2.13/2.32 =========== start of search ===========
% 2.13/2.32
% 2.13/2.32
% 2.13/2.32 Resetting weight limit to 18.
% 2.13/2.32
% 2.13/2.32
% 2.13/2.32 Resetting weight limit to 18.
% 2.13/2.32
% 2.13/2.32 sos_size=178
% 2.13/2.32
% 2.13/2.32
% 2.13/2.32 Resetting weight limit to 17.
% 2.13/2.32
% 2.13/2.32
% 2.13/2.32 Resetting weight limit to 17.
% 2.13/2.32
% 2.13/2.32 sos_size=198
% 2.13/2.32
% 2.13/2.32 Search stopped because sos empty.
% 2.13/2.32
% 2.13/2.32
% 2.13/2.32 Search stopped because sos empty.
% 2.13/2.32
% 2.13/2.32 ============ end of search ============
% 2.13/2.32
% 2.13/2.32 -------------- statistics -------------
% 2.13/2.32 clauses given 238
% 2.13/2.32 clauses generated 75037
% 2.13/2.32 clauses kept 246
% 2.13/2.32 clauses forward subsumed 4321
% 2.13/2.32 clauses back subsumed 1
% 2.13/2.32 Kbytes malloced 7812
% 2.13/2.32
% 2.13/2.32 ----------- times (seconds) -----------
% 2.13/2.32 user CPU time 0.56 (0 hr, 0 min, 0 sec)
% 2.13/2.32 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.13/2.32 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.13/2.32
% 2.13/2.32 Process 25562 finished Wed Jul 27 05:36:18 2022
% 2.13/2.32 Otter interrupted
% 2.13/2.32 PROOF NOT FOUND
%------------------------------------------------------------------------------