TSTP Solution File: GRP658-10 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP658-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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:34 EDT 2022
% Result : Unknown 2.13s 2.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP658-10 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n007.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:04:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.13/2.33 ----- Otter 3.3f, August 2004 -----
% 2.13/2.33 The process was started by sandbox on n007.cluster.edu,
% 2.13/2.33 Wed Jul 27 05:04:16 2022
% 2.13/2.33 The command was "./otter". The process ID is 3421.
% 2.13/2.33
% 2.13/2.33 set(prolog_style_variables).
% 2.13/2.33 set(auto).
% 2.13/2.33 dependent: set(auto1).
% 2.13/2.33 dependent: set(process_input).
% 2.13/2.33 dependent: clear(print_kept).
% 2.13/2.33 dependent: clear(print_new_demod).
% 2.13/2.33 dependent: clear(print_back_demod).
% 2.13/2.33 dependent: clear(print_back_sub).
% 2.13/2.33 dependent: set(control_memory).
% 2.13/2.33 dependent: assign(max_mem, 12000).
% 2.13/2.33 dependent: assign(pick_given_ratio, 4).
% 2.13/2.33 dependent: assign(stats_level, 1).
% 2.13/2.33 dependent: assign(max_seconds, 10800).
% 2.13/2.33 clear(print_given).
% 2.13/2.33
% 2.13/2.33 list(usable).
% 2.13/2.33 0 [] A=A.
% 2.13/2.33 0 [] mult(A,ld(A,B))=B.
% 2.13/2.33 0 [] ld(A,mult(A,B))=B.
% 2.13/2.33 0 [] mult(rd(A,B),B)=A.
% 2.13/2.33 0 [] rd(mult(A,B),B)=A.
% 2.13/2.33 0 [] mult(mult(A,mult(B,B)),C)=mult(mult(A,B),mult(B,C)).
% 2.13/2.33 0 [] tuple(mult(X0,x1(X0)),mult(x1_2(X0),X0))!=tuple(x1(X0),x1_2(X0)).
% 2.13/2.33 end_of_list.
% 2.13/2.33
% 2.13/2.33 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.13/2.33
% 2.13/2.33 All clauses are units, and equality is present; the
% 2.13/2.33 strategy will be Knuth-Bendix with positive clauses in sos.
% 2.13/2.33
% 2.13/2.33 dependent: set(knuth_bendix).
% 2.13/2.33 dependent: set(anl_eq).
% 2.13/2.33 dependent: set(para_from).
% 2.13/2.33 dependent: set(para_into).
% 2.13/2.33 dependent: clear(para_from_right).
% 2.13/2.33 dependent: clear(para_into_right).
% 2.13/2.33 dependent: set(para_from_vars).
% 2.13/2.33 dependent: set(eq_units_both_ways).
% 2.13/2.33 dependent: set(dynamic_demod_all).
% 2.13/2.33 dependent: set(dynamic_demod).
% 2.13/2.33 dependent: set(order_eq).
% 2.13/2.33 dependent: set(back_demod).
% 2.13/2.33 dependent: set(lrpo).
% 2.13/2.33
% 2.13/2.33 ------------> process usable:
% 2.13/2.33 ** KEPT (pick-wt=15): 1 [] tuple(mult(A,x1(A)),mult(x1_2(A),A))!=tuple(x1(A),x1_2(A)).
% 2.13/2.33
% 2.13/2.33 ------------> process sos:
% 2.13/2.33 ** KEPT (pick-wt=3): 2 [] A=A.
% 2.13/2.33 ** KEPT (pick-wt=7): 3 [] mult(A,ld(A,B))=B.
% 2.13/2.33 ---> New Demodulator: 4 [new_demod,3] mult(A,ld(A,B))=B.
% 2.13/2.33 ** KEPT (pick-wt=7): 5 [] ld(A,mult(A,B))=B.
% 2.13/2.33 ---> New Demodulator: 6 [new_demod,5] ld(A,mult(A,B))=B.
% 2.13/2.33 ** KEPT (pick-wt=7): 7 [] mult(rd(A,B),B)=A.
% 2.13/2.33 ---> New Demodulator: 8 [new_demod,7] mult(rd(A,B),B)=A.
% 2.13/2.33 ** KEPT (pick-wt=7): 9 [] rd(mult(A,B),B)=A.
% 2.13/2.33 ---> New Demodulator: 10 [new_demod,9] rd(mult(A,B),B)=A.
% 2.13/2.33 ** KEPT (pick-wt=15): 11 [] mult(mult(A,mult(B,B)),C)=mult(mult(A,B),mult(B,C)).
% 2.13/2.33 ---> New Demodulator: 12 [new_demod,11] mult(mult(A,mult(B,B)),C)=mult(mult(A,B),mult(B,C)).
% 2.13/2.33 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 2.13/2.33 >>>> Starting back demodulation with 4.
% 2.13/2.33 >>>> Starting back demodulation with 6.
% 2.13/2.33 >>>> Starting back demodulation with 8.
% 2.13/2.33 >>>> Starting back demodulation with 10.
% 2.13/2.33 >>>> Starting back demodulation with 12.
% 2.13/2.33
% 2.13/2.33 ======= end of input processing =======
% 2.13/2.33
% 2.13/2.33 =========== start of search ===========
% 2.13/2.33
% 2.13/2.33
% 2.13/2.33 Resetting weight limit to 15.
% 2.13/2.33
% 2.13/2.33
% 2.13/2.33 Resetting weight limit to 15.
% 2.13/2.33
% 2.13/2.33 sos_size=48
% 2.13/2.33
% 2.13/2.33
% 2.13/2.33 Resetting weight limit to 11.
% 2.13/2.33
% 2.13/2.33
% 2.13/2.33 Resetting weight limit to 11.
% 2.13/2.33
% 2.13/2.33 sos_size=66
% 2.13/2.33
% 2.13/2.33
% 2.13/2.33 Resetting weight limit to 7.
% 2.13/2.33
% 2.13/2.33
% 2.13/2.33 Resetting weight limit to 7.
% 2.13/2.33
% 2.13/2.33 sos_size=47
% 2.13/2.33
% 2.13/2.33 Search stopped because sos empty.
% 2.13/2.33
% 2.13/2.33
% 2.13/2.33 Search stopped because sos empty.
% 2.13/2.33
% 2.13/2.33 ============ end of search ============
% 2.13/2.33
% 2.13/2.33 -------------- statistics -------------
% 2.13/2.33 clauses given 122
% 2.13/2.33 clauses generated 11828
% 2.13/2.33 clauses kept 185
% 2.13/2.33 clauses forward subsumed 1866
% 2.13/2.33 clauses back subsumed 2
% 2.13/2.33 Kbytes malloced 6835
% 2.13/2.33
% 2.13/2.33 ----------- times (seconds) -----------
% 2.13/2.33 user CPU time 0.54 (0 hr, 0 min, 0 sec)
% 2.13/2.33 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.13/2.33 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.13/2.33
% 2.13/2.33 Process 3421 finished Wed Jul 27 05:04:18 2022
% 2.13/2.33 Otter interrupted
% 2.13/2.33 PROOF NOT FOUND
%------------------------------------------------------------------------------