TSTP Solution File: GRP760+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP760+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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 2.87s 3.09s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP760+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n027.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:30:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.87/3.09 ----- Otter 3.3f, August 2004 -----
% 2.87/3.09 The process was started by sandbox on n027.cluster.edu,
% 2.87/3.09 Wed Jul 27 05:30:51 2022
% 2.87/3.09 The command was "./otter". The process ID is 30396.
% 2.87/3.09
% 2.87/3.09 set(prolog_style_variables).
% 2.87/3.09 set(auto).
% 2.87/3.09 dependent: set(auto1).
% 2.87/3.09 dependent: set(process_input).
% 2.87/3.09 dependent: clear(print_kept).
% 2.87/3.09 dependent: clear(print_new_demod).
% 2.87/3.09 dependent: clear(print_back_demod).
% 2.87/3.09 dependent: clear(print_back_sub).
% 2.87/3.09 dependent: set(control_memory).
% 2.87/3.09 dependent: assign(max_mem, 12000).
% 2.87/3.09 dependent: assign(pick_given_ratio, 4).
% 2.87/3.09 dependent: assign(stats_level, 1).
% 2.87/3.09 dependent: assign(max_seconds, 10800).
% 2.87/3.09 clear(print_given).
% 2.87/3.09
% 2.87/3.09 formula_list(usable).
% 2.87/3.09 all A (A=A).
% 2.87/3.09 all A (mult(A,i(A))=e).
% 2.87/3.09 all A (mult(A,e)=A).
% 2.87/3.09 all B A C (mult(A,mult(B,C))=mult(mult(A,B),C)).
% 2.87/3.09 mult(a,a)=e.
% 2.87/3.09 a!=e.
% 2.87/3.09 all A exists B (mult(B,B)=A).
% 2.87/3.09 end_of_list.
% 2.87/3.09
% 2.87/3.09 -------> usable clausifies to:
% 2.87/3.09
% 2.87/3.09 list(usable).
% 2.87/3.09 0 [] A=A.
% 2.87/3.09 0 [] mult(A,i(A))=e.
% 2.87/3.09 0 [] mult(A,e)=A.
% 2.87/3.09 0 [] mult(A,mult(B,C))=mult(mult(A,B),C).
% 2.87/3.09 0 [] mult(a,a)=e.
% 2.87/3.09 0 [] a!=e.
% 2.87/3.09 0 [] mult($f1(A),$f1(A))=A.
% 2.87/3.09 end_of_list.
% 2.87/3.09
% 2.87/3.09 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.87/3.09
% 2.87/3.09 All clauses are units, and equality is present; the
% 2.87/3.09 strategy will be Knuth-Bendix with positive clauses in sos.
% 2.87/3.09
% 2.87/3.09 dependent: set(knuth_bendix).
% 2.87/3.09 dependent: set(anl_eq).
% 2.87/3.09 dependent: set(para_from).
% 2.87/3.09 dependent: set(para_into).
% 2.87/3.09 dependent: clear(para_from_right).
% 2.87/3.09 dependent: clear(para_into_right).
% 2.87/3.09 dependent: set(para_from_vars).
% 2.87/3.09 dependent: set(eq_units_both_ways).
% 2.87/3.09 dependent: set(dynamic_demod_all).
% 2.87/3.09 dependent: set(dynamic_demod).
% 2.87/3.09 dependent: set(order_eq).
% 2.87/3.09 dependent: set(back_demod).
% 2.87/3.09 dependent: set(lrpo).
% 2.87/3.09
% 2.87/3.09 ------------> process usable:
% 2.87/3.09 ** KEPT (pick-wt=3): 2 [copy,1,flip.1] e!=a.
% 2.87/3.09
% 2.87/3.09 ------------> process sos:
% 2.87/3.09 ** KEPT (pick-wt=3): 3 [] A=A.
% 2.87/3.09 ** KEPT (pick-wt=6): 4 [] mult(A,i(A))=e.
% 2.87/3.09 ---> New Demodulator: 5 [new_demod,4] mult(A,i(A))=e.
% 2.87/3.09 ** KEPT (pick-wt=5): 6 [] mult(A,e)=A.
% 2.87/3.09 ---> New Demodulator: 7 [new_demod,6] mult(A,e)=A.
% 2.87/3.09 ** KEPT (pick-wt=11): 9 [copy,8,flip.1] mult(mult(A,B),C)=mult(A,mult(B,C)).
% 2.87/3.09 ---> New Demodulator: 10 [new_demod,9] mult(mult(A,B),C)=mult(A,mult(B,C)).
% 2.87/3.09 ** KEPT (pick-wt=5): 11 [] mult(a,a)=e.
% 2.87/3.09 ---> New Demodulator: 12 [new_demod,11] mult(a,a)=e.
% 2.87/3.09 ** KEPT (pick-wt=7): 13 [] mult($f1(A),$f1(A))=A.
% 2.87/3.09 ---> New Demodulator: 14 [new_demod,13] mult($f1(A),$f1(A))=A.
% 2.87/3.09 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 2.87/3.09 >>>> Starting back demodulation with 5.
% 2.87/3.09 >>>> Starting back demodulation with 7.
% 2.87/3.09 >>>> Starting back demodulation with 10.
% 2.87/3.09 >>>> Starting back demodulation with 12.
% 2.87/3.09 >>>> Starting back demodulation with 14.
% 2.87/3.09
% 2.87/3.09 ======= end of input processing =======
% 2.87/3.09
% 2.87/3.09 =========== start of search ===========
% 2.87/3.09
% 2.87/3.09
% 2.87/3.09 Resetting weight limit to 18.
% 2.87/3.09
% 2.87/3.09
% 2.87/3.09 Resetting weight limit to 18.
% 2.87/3.09
% 2.87/3.09 sos_size=189
% 2.87/3.09
% 2.87/3.09 Search stopped because sos empty.
% 2.87/3.09
% 2.87/3.09
% 2.87/3.09 Search stopped because sos empty.
% 2.87/3.09
% 2.87/3.09 ============ end of search ============
% 2.87/3.09
% 2.87/3.09 -------------- statistics -------------
% 2.87/3.09 clauses given 271
% 2.87/3.09 clauses generated 43826
% 2.87/3.09 clauses kept 421
% 2.87/3.09 clauses forward subsumed 4078
% 2.87/3.09 clauses back subsumed 0
% 2.87/3.09 Kbytes malloced 7812
% 2.87/3.09
% 2.87/3.09 ----------- times (seconds) -----------
% 2.87/3.09 user CPU time 1.21 (0 hr, 0 min, 1 sec)
% 2.87/3.09 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.87/3.09 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 2.87/3.09
% 2.87/3.09 Process 30396 finished Wed Jul 27 05:30:54 2022
% 2.87/3.09 Otter interrupted
% 2.87/3.09 PROOF NOT FOUND
%------------------------------------------------------------------------------