TSTP Solution File: KLE139+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KLE139+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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:48 EDT 2022
% Result : Theorem 2.87s 3.09s
% Output : Refutation 2.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 5 RR)
% Number of literals : 18 ( 17 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
strong_iteration(dollar_c1) != addition(multiplication(strong_iteration(dollar_c1),dollar_c1),one),
file('KLE139+1.p',unknown),
[] ).
cnf(7,plain,
addition(multiplication(strong_iteration(dollar_c1),dollar_c1),one) != strong_iteration(dollar_c1),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[6])]),
[iquote('copy,6,flip.1')] ).
cnf(8,axiom,
A = A,
file('KLE139+1.p',unknown),
[] ).
cnf(9,axiom,
addition(A,B) = addition(B,A),
file('KLE139+1.p',unknown),
[] ).
cnf(10,axiom,
addition(A,addition(B,C)) = addition(addition(A,B),C),
file('KLE139+1.p',unknown),
[] ).
cnf(11,plain,
addition(addition(A,B),C) = addition(A,addition(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[10])]),
[iquote('copy,10,flip.1')] ).
cnf(17,axiom,
multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C),
file('KLE139+1.p',unknown),
[] ).
cnf(19,plain,
multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[17])]),
[iquote('copy,17,flip.1')] ).
cnf(26,axiom,
multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
file('KLE139+1.p',unknown),
[] ).
cnf(29,axiom,
multiplication(zero,A) = zero,
file('KLE139+1.p',unknown),
[] ).
cnf(32,axiom,
addition(one,multiplication(star(A),A)) = star(A),
file('KLE139+1.p',unknown),
[] ).
cnf(37,axiom,
strong_iteration(A) = addition(star(A),multiplication(strong_iteration(A),zero)),
file('KLE139+1.p',unknown),
[] ).
cnf(39,plain,
addition(star(A),multiplication(strong_iteration(A),zero)) = strong_iteration(A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[37])]),
[iquote('copy,37,flip.1')] ).
cnf(54,plain,
addition(one,multiplication(strong_iteration(dollar_c1),dollar_c1)) != strong_iteration(dollar_c1),
inference(para_from,[status(thm),theory(equality)],[9,7]),
[iquote('para_from,9.1.1,7.1.1')] ).
cnf(246,plain,
addition(one,addition(multiplication(star(A),A),B)) = addition(star(A),B),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[32,11])]),
[iquote('para_from,32.1.1,11.1.1.1,flip.1')] ).
cnf(316,plain,
multiplication(strong_iteration(A),B) = addition(multiplication(star(A),B),multiplication(strong_iteration(A),zero)),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[39,26]),19,29]),
[iquote('para_from,38.1.1,26.1.1.1,demod,19,29')] ).
cnf(3507,plain,
strong_iteration(dollar_c1) != strong_iteration(dollar_c1),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[316,54]),246,39]),
[iquote('para_from,316.1.1,54.1.1.2,demod,246,39')] ).
cnf(3508,plain,
$false,
inference(binary,[status(thm)],[3507,8]),
[iquote('binary,3507.1,8.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KLE139+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n015.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:39:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.92/2.11 ----- Otter 3.3f, August 2004 -----
% 1.92/2.11 The process was started by sandbox on n015.cluster.edu,
% 1.92/2.11 Wed Jul 27 06:39:26 2022
% 1.92/2.11 The command was "./otter". The process ID is 6407.
% 1.92/2.11
% 1.92/2.11 set(prolog_style_variables).
% 1.92/2.11 set(auto).
% 1.92/2.11 dependent: set(auto1).
% 1.92/2.11 dependent: set(process_input).
% 1.92/2.11 dependent: clear(print_kept).
% 1.92/2.11 dependent: clear(print_new_demod).
% 1.92/2.11 dependent: clear(print_back_demod).
% 1.92/2.11 dependent: clear(print_back_sub).
% 1.92/2.11 dependent: set(control_memory).
% 1.92/2.11 dependent: assign(max_mem, 12000).
% 1.92/2.11 dependent: assign(pick_given_ratio, 4).
% 1.92/2.11 dependent: assign(stats_level, 1).
% 1.92/2.11 dependent: assign(max_seconds, 10800).
% 1.92/2.11 clear(print_given).
% 1.92/2.11
% 1.92/2.11 formula_list(usable).
% 1.92/2.11 all A (A=A).
% 1.92/2.11 all A B (addition(A,B)=addition(B,A)).
% 1.92/2.11 all C B A (addition(A,addition(B,C))=addition(addition(A,B),C)).
% 1.92/2.11 all A (addition(A,zero)=A).
% 1.92/2.11 all A (addition(A,A)=A).
% 1.92/2.11 all A B C (multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C)).
% 1.92/2.11 all A (multiplication(A,one)=A).
% 1.92/2.11 all A (multiplication(one,A)=A).
% 1.92/2.11 all A B C (multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C))).
% 1.92/2.11 all A B C (multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C))).
% 1.92/2.11 all A (multiplication(zero,A)=zero).
% 1.92/2.11 all A (addition(one,multiplication(A,star(A)))=star(A)).
% 1.92/2.11 all A (addition(one,multiplication(star(A),A))=star(A)).
% 1.92/2.11 all A B C (le_q(addition(multiplication(A,C),B),C)->le_q(multiplication(star(A),B),C)).
% 1.92/2.11 all A B C (le_q(addition(multiplication(C,A),B),C)->le_q(multiplication(B,star(A)),C)).
% 1.92/2.11 all A (strong_iteration(A)=addition(multiplication(A,strong_iteration(A)),one)).
% 1.92/2.11 all A B C (le_q(C,addition(multiplication(A,C),B))->le_q(C,multiplication(strong_iteration(A),B))).
% 1.92/2.11 all A (strong_iteration(A)=addition(star(A),multiplication(strong_iteration(A),zero))).
% 1.92/2.11 all A B (le_q(A,B)<->addition(A,B)=B).
% 1.92/2.11 -(all X0 (strong_iteration(X0)=addition(multiplication(strong_iteration(X0),X0),one))).
% 1.92/2.11 end_of_list.
% 1.92/2.11
% 1.92/2.11 -------> usable clausifies to:
% 1.92/2.11
% 1.92/2.11 list(usable).
% 1.92/2.11 0 [] A=A.
% 1.92/2.11 0 [] addition(A,B)=addition(B,A).
% 1.92/2.11 0 [] addition(A,addition(B,C))=addition(addition(A,B),C).
% 1.92/2.11 0 [] addition(A,zero)=A.
% 1.92/2.11 0 [] addition(A,A)=A.
% 1.92/2.11 0 [] multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C).
% 1.92/2.11 0 [] multiplication(A,one)=A.
% 1.92/2.11 0 [] multiplication(one,A)=A.
% 1.92/2.11 0 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.92/2.11 0 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.92/2.11 0 [] multiplication(zero,A)=zero.
% 1.92/2.11 0 [] addition(one,multiplication(A,star(A)))=star(A).
% 1.92/2.11 0 [] addition(one,multiplication(star(A),A))=star(A).
% 1.92/2.11 0 [] -le_q(addition(multiplication(A,C),B),C)|le_q(multiplication(star(A),B),C).
% 1.92/2.11 0 [] -le_q(addition(multiplication(C,A),B),C)|le_q(multiplication(B,star(A)),C).
% 1.92/2.11 0 [] strong_iteration(A)=addition(multiplication(A,strong_iteration(A)),one).
% 1.92/2.11 0 [] -le_q(C,addition(multiplication(A,C),B))|le_q(C,multiplication(strong_iteration(A),B)).
% 1.92/2.11 0 [] strong_iteration(A)=addition(star(A),multiplication(strong_iteration(A),zero)).
% 1.92/2.11 0 [] -le_q(A,B)|addition(A,B)=B.
% 1.92/2.11 0 [] le_q(A,B)|addition(A,B)!=B.
% 1.92/2.11 0 [] strong_iteration($c1)!=addition(multiplication(strong_iteration($c1),$c1),one).
% 1.92/2.11 end_of_list.
% 1.92/2.11
% 1.92/2.11 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.92/2.11
% 1.92/2.11 This is a Horn set with equality. The strategy will be
% 1.92/2.11 Knuth-Bendix and hyper_res, with positive clauses in
% 1.92/2.11 sos and nonpositive clauses in usable.
% 1.92/2.11
% 1.92/2.11 dependent: set(knuth_bendix).
% 1.92/2.11 dependent: set(anl_eq).
% 1.92/2.11 dependent: set(para_from).
% 1.92/2.11 dependent: set(para_into).
% 1.92/2.11 dependent: clear(para_from_right).
% 1.92/2.11 dependent: clear(para_into_right).
% 1.92/2.11 dependent: set(para_from_vars).
% 1.92/2.11 dependent: set(eq_units_both_ways).
% 1.92/2.11 dependent: set(dynamic_demod_all).
% 1.92/2.11 dependent: set(dynamic_demod).
% 1.92/2.11 dependent: set(order_eq).
% 1.92/2.11 dependent: set(back_demod).
% 1.92/2.11 dependent: set(lrpo).
% 1.92/2.11 dependent: set(hyper_res).
% 1.92/2.11 dependent: clear(order_hyper).
% 1.92/2.11
% 1.92/2.11 ------------> process usable:
% 1.92/2.11 ** KEPT (pick-wt=13): 1 [] -le_q(addition(multiplication(A,B),C),B)|le_q(multiplication(star(A),C),B).
% 1.92/2.11 ** KEPT (pick-wt=13): 2 [] -le_q(addition(multiplication(A,B),C),A)|le_q(multiplication(C,star(B)),A).
% 1.92/2.11 ** KEPT (pick-wt=13): 3 [] -le_q(A,addition(multiplication(B,A),C))|le_q(A,multiplication(strong_iteration(B),C)).
% 2.87/3.09 ** KEPT (pick-wt=8): 4 [] -le_q(A,B)|addition(A,B)=B.
% 2.87/3.09 ** KEPT (pick-wt=8): 5 [] le_q(A,B)|addition(A,B)!=B.
% 2.87/3.09 ** KEPT (pick-wt=9): 7 [copy,6,flip.1] addition(multiplication(strong_iteration($c1),$c1),one)!=strong_iteration($c1).
% 2.87/3.09
% 2.87/3.09 ------------> process sos:
% 2.87/3.09 ** KEPT (pick-wt=3): 8 [] A=A.
% 2.87/3.09 ** KEPT (pick-wt=7): 9 [] addition(A,B)=addition(B,A).
% 2.87/3.09 ** KEPT (pick-wt=11): 11 [copy,10,flip.1] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 2.87/3.09 ---> New Demodulator: 12 [new_demod,11] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 2.87/3.09 ** KEPT (pick-wt=5): 13 [] addition(A,zero)=A.
% 2.87/3.09 ---> New Demodulator: 14 [new_demod,13] addition(A,zero)=A.
% 2.87/3.09 ** KEPT (pick-wt=5): 15 [] addition(A,A)=A.
% 2.87/3.09 ---> New Demodulator: 16 [new_demod,15] addition(A,A)=A.
% 2.87/3.09 ** KEPT (pick-wt=11): 18 [copy,17,flip.1] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 2.87/3.09 ---> New Demodulator: 19 [new_demod,18] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 2.87/3.09 ** KEPT (pick-wt=5): 20 [] multiplication(A,one)=A.
% 2.87/3.09 ---> New Demodulator: 21 [new_demod,20] multiplication(A,one)=A.
% 2.87/3.09 ** KEPT (pick-wt=5): 22 [] multiplication(one,A)=A.
% 2.87/3.09 ---> New Demodulator: 23 [new_demod,22] multiplication(one,A)=A.
% 2.87/3.09 ** KEPT (pick-wt=13): 24 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 2.87/3.09 ---> New Demodulator: 25 [new_demod,24] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 2.87/3.09 ** KEPT (pick-wt=13): 26 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 2.87/3.09 ---> New Demodulator: 27 [new_demod,26] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 2.87/3.09 ** KEPT (pick-wt=5): 28 [] multiplication(zero,A)=zero.
% 2.87/3.09 ---> New Demodulator: 29 [new_demod,28] multiplication(zero,A)=zero.
% 2.87/3.09 ** KEPT (pick-wt=9): 30 [] addition(one,multiplication(A,star(A)))=star(A).
% 2.87/3.09 ---> New Demodulator: 31 [new_demod,30] addition(one,multiplication(A,star(A)))=star(A).
% 2.87/3.09 ** KEPT (pick-wt=9): 32 [] addition(one,multiplication(star(A),A))=star(A).
% 2.87/3.09 ---> New Demodulator: 33 [new_demod,32] addition(one,multiplication(star(A),A))=star(A).
% 2.87/3.09 ** KEPT (pick-wt=9): 35 [copy,34,flip.1] addition(multiplication(A,strong_iteration(A)),one)=strong_iteration(A).
% 2.87/3.09 ---> New Demodulator: 36 [new_demod,35] addition(multiplication(A,strong_iteration(A)),one)=strong_iteration(A).
% 2.87/3.09 ** KEPT (pick-wt=10): 38 [copy,37,flip.1] addition(star(A),multiplication(strong_iteration(A),zero))=strong_iteration(A).
% 2.87/3.09 ---> New Demodulator: 39 [new_demod,38] addition(star(A),multiplication(strong_iteration(A),zero))=strong_iteration(A).
% 2.87/3.09 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] A=A.
% 2.87/3.09 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] addition(A,B)=addition(B,A).
% 2.87/3.09 >>>> Starting back demodulation with 12.
% 2.87/3.09 >>>> Starting back demodulation with 14.
% 2.87/3.09 >>>> Starting back demodulation with 16.
% 2.87/3.09 >>>> Starting back demodulation with 19.
% 2.87/3.09 >>>> Starting back demodulation with 21.
% 2.87/3.09 >>>> Starting back demodulation with 23.
% 2.87/3.09 >>>> Starting back demodulation with 25.
% 2.87/3.09 >>>> Starting back demodulation with 27.
% 2.87/3.09 >>>> Starting back demodulation with 29.
% 2.87/3.09 >>>> Starting back demodulation with 31.
% 2.87/3.09 >>>> Starting back demodulation with 33.
% 2.87/3.09 >>>> Starting back demodulation with 36.
% 2.87/3.09 >>>> Starting back demodulation with 39.
% 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 9.
% 2.87/3.09
% 2.87/3.09
% 2.87/3.09 Resetting weight limit to 9.
% 2.87/3.09
% 2.87/3.09 sos_size=1796
% 2.87/3.09
% 2.87/3.09
% 2.87/3.09 Resetting weight limit to 8.
% 2.87/3.09
% 2.87/3.09
% 2.87/3.09 Resetting weight limit to 8.
% 2.87/3.09
% 2.87/3.09 sos_size=1907
% 2.87/3.09
% 2.87/3.09 -------- PROOF --------
% 2.87/3.09
% 2.87/3.09 ----> UNIT CONFLICT at 0.98 sec ----> 3508 [binary,3507.1,8.1] $F.
% 2.87/3.09
% 2.87/3.09 Length of proof is 8. Level of proof is 3.
% 2.87/3.09
% 2.87/3.09 ---------------- PROOF ----------------
% 2.87/3.09 % SZS status Theorem
% 2.87/3.09 % SZS output start Refutation
% See solution above
% 2.87/3.10 ------------ end of proof -------------
% 2.87/3.10
% 2.87/3.10
% 2.87/3.10 Search stopped by max_proofs option.
% 2.87/3.10
% 2.87/3.10
% 2.87/3.10 Search stopped by max_proofs option.
% 2.87/3.10
% 2.87/3.10 ============ end of search ============
% 2.87/3.10
% 2.87/3.10 -------------- statistics -------------
% 2.87/3.10 clauses given 706
% 2.87/3.10 clauses generated 120997
% 2.87/3.10 clauses kept 3300
% 2.87/3.10 clauses forward subsumed 37161
% 2.87/3.10 clauses back subsumed 708
% 2.87/3.10 Kbytes malloced 6835
% 2.87/3.10
% 2.87/3.10 ----------- times (seconds) -----------
% 2.87/3.10 user CPU time 0.98 (0 hr, 0 min, 0 sec)
% 2.87/3.10 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.87/3.10 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 2.87/3.10
% 2.87/3.10 That finishes the proof of the theorem.
% 2.87/3.10
% 2.87/3.10 Process 6407 finished Wed Jul 27 06:39:29 2022
% 2.87/3.10 Otter interrupted
% 2.87/3.10 PROOF FOUND
%------------------------------------------------------------------------------