TSTP Solution File: KLE166+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KLE166+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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 13:00:54 EDT 2022
% Result : Unknown 108.13s 108.30s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KLE166+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n020.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 06:31:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.93/2.11 ----- Otter 3.3f, August 2004 -----
% 1.93/2.11 The process was started by sandbox on n020.cluster.edu,
% 1.93/2.11 Wed Jul 27 06:31:23 2022
% 1.93/2.11 The command was "./otter". The process ID is 20100.
% 1.93/2.11
% 1.93/2.11 set(prolog_style_variables).
% 1.93/2.11 set(auto).
% 1.93/2.11 dependent: set(auto1).
% 1.93/2.11 dependent: set(process_input).
% 1.93/2.11 dependent: clear(print_kept).
% 1.93/2.11 dependent: clear(print_new_demod).
% 1.93/2.11 dependent: clear(print_back_demod).
% 1.93/2.11 dependent: clear(print_back_sub).
% 1.93/2.11 dependent: set(control_memory).
% 1.93/2.11 dependent: assign(max_mem, 12000).
% 1.93/2.11 dependent: assign(pick_given_ratio, 4).
% 1.93/2.11 dependent: assign(stats_level, 1).
% 1.93/2.11 dependent: assign(max_seconds, 10800).
% 1.93/2.11 clear(print_given).
% 1.93/2.11
% 1.93/2.11 formula_list(usable).
% 1.93/2.11 all A (A=A).
% 1.93/2.11 all A B (addition(A,B)=addition(B,A)).
% 1.93/2.11 all C B A (addition(A,addition(B,C))=addition(addition(A,B),C)).
% 1.93/2.11 all A (addition(A,zero)=A).
% 1.93/2.11 all A (addition(A,A)=A).
% 1.93/2.11 all A B C (multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C)).
% 1.93/2.11 all A (multiplication(A,one)=A).
% 1.93/2.11 all A (multiplication(one,A)=A).
% 1.93/2.11 all A B C (multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C))).
% 1.93/2.11 all A B C (multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C))).
% 1.93/2.11 all A (multiplication(zero,A)=zero).
% 1.93/2.11 all A (addition(one,multiplication(A,star(A)))=star(A)).
% 1.93/2.11 all A (addition(one,multiplication(star(A),A))=star(A)).
% 1.93/2.11 all A B C (le_q(addition(multiplication(A,C),B),C)->le_q(multiplication(star(A),B),C)).
% 1.93/2.11 all A B C (le_q(addition(multiplication(C,A),B),C)->le_q(multiplication(B,star(A)),C)).
% 1.93/2.11 all A (strong_iteration(A)=addition(multiplication(A,strong_iteration(A)),one)).
% 1.93/2.11 all A B C (le_q(C,addition(multiplication(A,C),B))->le_q(C,multiplication(strong_iteration(A),B))).
% 1.93/2.11 all A (strong_iteration(A)=addition(star(A),multiplication(strong_iteration(A),zero))).
% 1.93/2.11 all A B (le_q(A,B)<->addition(A,B)=B).
% 1.93/2.11 -(all X0 X1 (le_q(multiplication(X0,X1),multiplication(X1,strong_iteration(addition(X1,X0))))-> (multiplication(strong_iteration(addition(X1,X0)),zero)=zero<->addition(multiplication(strong_iteration(X1),zero),multiplication(strong_iteration(X0),zero))=zero))).
% 1.93/2.11 end_of_list.
% 1.93/2.11
% 1.93/2.11 -------> usable clausifies to:
% 1.93/2.11
% 1.93/2.11 list(usable).
% 1.93/2.11 0 [] A=A.
% 1.93/2.11 0 [] addition(A,B)=addition(B,A).
% 1.93/2.11 0 [] addition(A,addition(B,C))=addition(addition(A,B),C).
% 1.93/2.11 0 [] addition(A,zero)=A.
% 1.93/2.11 0 [] addition(A,A)=A.
% 1.93/2.11 0 [] multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C).
% 1.93/2.11 0 [] multiplication(A,one)=A.
% 1.93/2.11 0 [] multiplication(one,A)=A.
% 1.93/2.11 0 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.93/2.11 0 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.93/2.11 0 [] multiplication(zero,A)=zero.
% 1.93/2.11 0 [] addition(one,multiplication(A,star(A)))=star(A).
% 1.93/2.11 0 [] addition(one,multiplication(star(A),A))=star(A).
% 1.93/2.11 0 [] -le_q(addition(multiplication(A,C),B),C)|le_q(multiplication(star(A),B),C).
% 1.93/2.11 0 [] -le_q(addition(multiplication(C,A),B),C)|le_q(multiplication(B,star(A)),C).
% 1.93/2.11 0 [] strong_iteration(A)=addition(multiplication(A,strong_iteration(A)),one).
% 1.93/2.11 0 [] -le_q(C,addition(multiplication(A,C),B))|le_q(C,multiplication(strong_iteration(A),B)).
% 1.93/2.11 0 [] strong_iteration(A)=addition(star(A),multiplication(strong_iteration(A),zero)).
% 1.93/2.11 0 [] -le_q(A,B)|addition(A,B)=B.
% 1.93/2.11 0 [] le_q(A,B)|addition(A,B)!=B.
% 1.93/2.11 0 [] le_q(multiplication($c2,$c1),multiplication($c1,strong_iteration(addition($c1,$c2)))).
% 1.93/2.11 0 [] multiplication(strong_iteration(addition($c1,$c2)),zero)=zero|addition(multiplication(strong_iteration($c1),zero),multiplication(strong_iteration($c2),zero))=zero.
% 1.93/2.11 0 [] multiplication(strong_iteration(addition($c1,$c2)),zero)!=zero|addition(multiplication(strong_iteration($c1),zero),multiplication(strong_iteration($c2),zero))!=zero.
% 1.93/2.11 end_of_list.
% 1.93/2.11
% 1.93/2.11 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 1.93/2.11
% 1.93/2.11 This ia a non-Horn set with equality. The strategy will be
% 1.93/2.11 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.93/2.11 deletion, with positive clauses in sos and nonpositive
% 1.93/2.11 clauses in usable.
% 1.93/2.11
% 1.93/2.11 dependent: set(knuth_bendix).
% 1.93/2.11 dependent: set(anl_eq).
% 1.93/2.11 dependent: set(para_from).
% 1.93/2.11 dependent: set(para_into).
% 1.93/2.11 dependent: clear(para_from_right).
% 1.93/2.11 dependent: clear(para_into_right).
% 1.93/2.11 dependent: set(para_from_vars).
% 1.93/2.11 dependent: set(eq_units_both_ways).
% 1.93/2.11 dependent: set(dynamic_demod_all).
% 1.93/2.11 dependent: set(dynamic_demod).
% 1.93/2.11 dependent: set(order_eq).
% 1.93/2.11 dependent: set(back_demod).
% 1.93/2.11 dependent: set(lrpo).
% 1.93/2.11 dependent: set(hyper_res).
% 1.93/2.11 dependent: set(unit_deletion).
% 1.93/2.11 dependent: set(factor).
% 1.93/2.11
% 1.93/2.11 ------------> process usable:
% 1.93/2.11 ** KEPT (pick-wt=13): 1 [] -le_q(addition(multiplication(A,B),C),B)|le_q(multiplication(star(A),C),B).
% 1.93/2.11 ** KEPT (pick-wt=13): 2 [] -le_q(addition(multiplication(A,B),C),A)|le_q(multiplication(C,star(B)),A).
% 1.93/2.11 ** KEPT (pick-wt=13): 3 [] -le_q(A,addition(multiplication(B,A),C))|le_q(A,multiplication(strong_iteration(B),C)).
% 1.93/2.11 ** KEPT (pick-wt=8): 4 [] -le_q(A,B)|addition(A,B)=B.
% 1.93/2.11 ** KEPT (pick-wt=8): 5 [] le_q(A,B)|addition(A,B)!=B.
% 1.93/2.11 ** KEPT (pick-wt=19): 6 [] multiplication(strong_iteration(addition($c1,$c2)),zero)!=zero|addition(multiplication(strong_iteration($c1),zero),multiplication(strong_iteration($c2),zero))!=zero.
% 1.93/2.11
% 1.93/2.11 ------------> process sos:
% 1.93/2.11 ** KEPT (pick-wt=3): 7 [] A=A.
% 1.93/2.11 ** KEPT (pick-wt=7): 8 [] addition(A,B)=addition(B,A).
% 1.93/2.11 ** KEPT (pick-wt=11): 10 [copy,9,flip.1] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 1.93/2.11 ---> New Demodulator: 11 [new_demod,10] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 1.93/2.11 ** KEPT (pick-wt=5): 12 [] addition(A,zero)=A.
% 1.93/2.11 ---> New Demodulator: 13 [new_demod,12] addition(A,zero)=A.
% 1.93/2.11 ** KEPT (pick-wt=5): 14 [] addition(A,A)=A.
% 1.93/2.11 ---> New Demodulator: 15 [new_demod,14] addition(A,A)=A.
% 1.93/2.11 ** KEPT (pick-wt=11): 17 [copy,16,flip.1] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 1.93/2.11 ---> New Demodulator: 18 [new_demod,17] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 1.93/2.11 ** KEPT (pick-wt=5): 19 [] multiplication(A,one)=A.
% 1.93/2.11 ---> New Demodulator: 20 [new_demod,19] multiplication(A,one)=A.
% 1.93/2.11 ** KEPT (pick-wt=5): 21 [] multiplication(one,A)=A.
% 1.93/2.11 ---> New Demodulator: 22 [new_demod,21] multiplication(one,A)=A.
% 1.93/2.11 ** KEPT (pick-wt=13): 23 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.93/2.11 ---> New Demodulator: 24 [new_demod,23] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.93/2.11 ** KEPT (pick-wt=13): 25 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.93/2.11 ---> New Demodulator: 26 [new_demod,25] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.93/2.11 ** KEPT (pick-wt=5): 27 [] multiplication(zero,A)=zero.
% 1.93/2.11 ---> New Demodulator: 28 [new_demod,27] multiplication(zero,A)=zero.
% 1.93/2.11 ** KEPT (pick-wt=9): 29 [] addition(one,multiplication(A,star(A)))=star(A).
% 1.93/2.11 ---> New Demodulator: 30 [new_demod,29] addition(one,multiplication(A,star(A)))=star(A).
% 1.93/2.11 ** KEPT (pick-wt=9): 31 [] addition(one,multiplication(star(A),A))=star(A).
% 1.93/2.11 ---> New Demodulator: 32 [new_demod,31] addition(one,multiplication(star(A),A))=star(A).
% 1.93/2.11 ** KEPT (pick-wt=9): 34 [copy,33,flip.1] addition(multiplication(A,strong_iteration(A)),one)=strong_iteration(A).
% 1.93/2.11 ---> New Demodulator: 35 [new_demod,34] addition(multiplication(A,strong_iteration(A)),one)=strong_iteration(A).
% 1.93/2.11 ** KEPT (pick-wt=10): 37 [copy,36,flip.1] addition(star(A),multiplication(strong_iteration(A),zero))=strong_iteration(A).
% 1.93/2.11 ---> New Demodulator: 38 [new_demod,37] addition(star(A),multiplication(strong_iteration(A),zero))=strong_iteration(A).
% 1.93/2.11 ** KEPT (pick-wt=10): 39 [] le_q(multiplication($c2,$c1),multiplication($c1,strong_iteration(addition($c1,$c2)))).
% 1.93/2.11 ** KEPT (pick-wt=19): 40 [] multiplication(strong_iteration(addition($c1,$c2)),zero)=zero|addition(multiplication(strong_iteration($c1),zero),multiplication(strong_iteration($c2),zero))=zero.
% 1.93/2.11 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] A=A.
% 1.93/2.11 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] addition(A,B)=addition(B,A).
% 1.93/2.11 >>>> Starting back demodulation with 11.
% 1.93/2.11 >>>> Starting back demodulation with 13.
% 1.93/2.11 >>>> Starting back demodulation with 15.
% 1.93/2.11 >>>> Starting back demodulation with 18.
% 1.93/2.11 >>>> Starting back demodulation with 20.
% 1.93/2.11 >>>> Starting back demodulation with 22.
% 108.13/108.30 >>>> Starting back demodulation with 24.
% 108.13/108.30 >>>> Starting back demodulation with 26.
% 108.13/108.30 >>>> Starting back demodulation with 28.
% 108.13/108.30 >>>> Starting back demodulation with 30.
% 108.13/108.30 >>>> Starting back demodulation with 32.
% 108.13/108.30 >>>> Starting back demodulation with 35.
% 108.13/108.30 >>>> Starting back demodulation with 38.
% 108.13/108.30
% 108.13/108.30 ======= end of input processing =======
% 108.13/108.30
% 108.13/108.30 =========== start of search ===========
% 108.13/108.30
% 108.13/108.30
% 108.13/108.30 Resetting weight limit to 9.
% 108.13/108.30
% 108.13/108.30
% 108.13/108.30 Resetting weight limit to 9.
% 108.13/108.30
% 108.13/108.30 sos_size=1174
% 108.13/108.30
% 108.13/108.30
% 108.13/108.30 Resetting weight limit to 8.
% 108.13/108.30
% 108.13/108.30
% 108.13/108.30 Resetting weight limit to 8.
% 108.13/108.30
% 108.13/108.30 sos_size=1153
% 108.13/108.30
% 108.13/108.30 Search stopped because sos empty.
% 108.13/108.30
% 108.13/108.30
% 108.13/108.30 Search stopped because sos empty.
% 108.13/108.30
% 108.13/108.30 ============ end of search ============
% 108.13/108.30
% 108.13/108.30 -------------- statistics -------------
% 108.13/108.30 clauses given 1932
% 108.13/108.30 clauses generated 1867858
% 108.13/108.30 clauses kept 2543
% 108.13/108.30 clauses forward subsumed 295385
% 108.13/108.30 clauses back subsumed 609
% 108.13/108.30 Kbytes malloced 7812
% 108.13/108.30
% 108.13/108.30 ----------- times (seconds) -----------
% 108.13/108.30 user CPU time 106.19 (0 hr, 1 min, 46 sec)
% 108.13/108.30 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 108.13/108.30 wall-clock time 108 (0 hr, 1 min, 48 sec)
% 108.13/108.30
% 108.13/108.30 Process 20100 finished Wed Jul 27 06:33:11 2022
% 108.13/108.30 Otter interrupted
% 108.13/108.30 PROOF NOT FOUND
%------------------------------------------------------------------------------