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