TSTP Solution File: KLE037+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KLE037+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:34 EDT 2022
% Result : Theorem 1.96s 2.18s
% Output : Refutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 16 unt; 0 nHn; 6 RR)
% Number of literals : 24 ( 11 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ le_q(A,B)
| addition(A,B) = B ),
file('KLE037+1.p',unknown),
[] ).
cnf(2,axiom,
( le_q(A,B)
| addition(A,B) != B ),
file('KLE037+1.p',unknown),
[] ).
cnf(5,axiom,
~ le_q(one,star(dollar_c1)),
file('KLE037+1.p',unknown),
[] ).
cnf(7,axiom,
addition(A,B) = addition(B,A),
file('KLE037+1.p',unknown),
[] ).
cnf(8,axiom,
addition(A,addition(B,C)) = addition(addition(A,B),C),
file('KLE037+1.p',unknown),
[] ).
cnf(10,plain,
addition(addition(A,B),C) = addition(A,addition(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[8])]),
[iquote('copy,8,flip.1')] ).
cnf(13,axiom,
addition(A,A) = A,
file('KLE037+1.p',unknown),
[] ).
cnf(31,axiom,
le_q(addition(one,multiplication(star(A),A)),star(A)),
file('KLE037+1.p',unknown),
[] ).
cnf(43,plain,
( addition(A,B) = A
| ~ le_q(B,A) ),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[7,1])]),
[iquote('para_into,7.1.1,1.2.1,flip.1')] ).
cnf(57,plain,
addition(A,addition(A,B)) = addition(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[10,13])]),
[iquote('para_into,9.1.1.1,13.1.1,flip.1')] ).
cnf(189,plain,
addition(one,addition(multiplication(star(A),A),star(A))) = star(A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[31,1]),10]),
[iquote('hyper,31,1,demod,10')] ).
cnf(440,plain,
le_q(A,addition(A,B)),
inference(hyper,[status(thm)],[57,2]),
[iquote('hyper,57,2')] ).
cnf(461,plain,
le_q(A,addition(B,A)),
inference(para_into,[status(thm),theory(equality)],[440,7]),
[iquote('para_into,440.1.2,7.1.1')] ).
cnf(463,plain,
le_q(A,addition(B,addition(C,A))),
inference(para_into,[status(thm),theory(equality)],[461,10]),
[iquote('para_into,461.1.2,9.1.1')] ).
cnf(471,plain,
( le_q(A,B)
| ~ le_q(addition(C,A),B) ),
inference(para_into,[status(thm),theory(equality)],[463,43]),
[iquote('para_into,463.1.2,43.1.1')] ).
cnf(514,plain,
le_q(multiplication(star(A),A),star(A)),
inference(hyper,[status(thm)],[471,31]),
[iquote('hyper,471,31')] ).
cnf(522,plain,
addition(multiplication(star(A),A),star(A)) = star(A),
inference(hyper,[status(thm)],[514,1]),
[iquote('hyper,514,1')] ).
cnf(523,plain,
addition(one,star(A)) = star(A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[189]),522]),
[iquote('back_demod,189,demod,522')] ).
cnf(560,plain,
le_q(one,star(A)),
inference(hyper,[status(thm)],[523,2]),
[iquote('hyper,523,2')] ).
cnf(561,plain,
$false,
inference(binary,[status(thm)],[560,5]),
[iquote('binary,560.1,5.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KLE037+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:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.96/2.16 ----- Otter 3.3f, August 2004 -----
% 1.96/2.16 The process was started by sandbox on n015.cluster.edu,
% 1.96/2.16 Wed Jul 27 06:39:56 2022
% 1.96/2.16 The command was "./otter". The process ID is 8171.
% 1.96/2.16
% 1.96/2.16 set(prolog_style_variables).
% 1.96/2.16 set(auto).
% 1.96/2.16 dependent: set(auto1).
% 1.96/2.16 dependent: set(process_input).
% 1.96/2.16 dependent: clear(print_kept).
% 1.96/2.16 dependent: clear(print_new_demod).
% 1.96/2.16 dependent: clear(print_back_demod).
% 1.96/2.16 dependent: clear(print_back_sub).
% 1.96/2.16 dependent: set(control_memory).
% 1.96/2.16 dependent: assign(max_mem, 12000).
% 1.96/2.16 dependent: assign(pick_given_ratio, 4).
% 1.96/2.16 dependent: assign(stats_level, 1).
% 1.96/2.16 dependent: assign(max_seconds, 10800).
% 1.96/2.16 clear(print_given).
% 1.96/2.16
% 1.96/2.16 formula_list(usable).
% 1.96/2.16 all A (A=A).
% 1.96/2.16 all A B (addition(A,B)=addition(B,A)).
% 1.96/2.16 all C B A (addition(A,addition(B,C))=addition(addition(A,B),C)).
% 1.96/2.16 all A (addition(A,zero)=A).
% 1.96/2.16 all A (addition(A,A)=A).
% 1.96/2.16 all A B C (multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C)).
% 1.96/2.16 all A (multiplication(A,one)=A).
% 1.96/2.16 all A (multiplication(one,A)=A).
% 1.96/2.16 all A B C (multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C))).
% 1.96/2.16 all A B C (multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C))).
% 1.96/2.16 all A (multiplication(A,zero)=zero).
% 1.96/2.16 all A (multiplication(zero,A)=zero).
% 1.96/2.16 all A B (le_q(A,B)<->addition(A,B)=B).
% 1.96/2.16 all A le_q(addition(one,multiplication(A,star(A))),star(A)).
% 1.96/2.16 all A le_q(addition(one,multiplication(star(A),A)),star(A)).
% 1.96/2.16 all A B C (le_q(addition(multiplication(A,B),C),B)->le_q(multiplication(star(A),C),B)).
% 1.96/2.16 all A B C (le_q(addition(multiplication(A,B),C),A)->le_q(multiplication(C,star(B)),A)).
% 1.96/2.16 -(all X0 le_q(one,star(X0))).
% 1.96/2.16 end_of_list.
% 1.96/2.16
% 1.96/2.16 -------> usable clausifies to:
% 1.96/2.16
% 1.96/2.16 list(usable).
% 1.96/2.16 0 [] A=A.
% 1.96/2.16 0 [] addition(A,B)=addition(B,A).
% 1.96/2.16 0 [] addition(A,addition(B,C))=addition(addition(A,B),C).
% 1.96/2.16 0 [] addition(A,zero)=A.
% 1.96/2.16 0 [] addition(A,A)=A.
% 1.96/2.16 0 [] multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C).
% 1.96/2.16 0 [] multiplication(A,one)=A.
% 1.96/2.16 0 [] multiplication(one,A)=A.
% 1.96/2.16 0 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.96/2.16 0 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.96/2.16 0 [] multiplication(A,zero)=zero.
% 1.96/2.16 0 [] multiplication(zero,A)=zero.
% 1.96/2.16 0 [] -le_q(A,B)|addition(A,B)=B.
% 1.96/2.16 0 [] le_q(A,B)|addition(A,B)!=B.
% 1.96/2.16 0 [] le_q(addition(one,multiplication(A,star(A))),star(A)).
% 1.96/2.16 0 [] le_q(addition(one,multiplication(star(A),A)),star(A)).
% 1.96/2.16 0 [] -le_q(addition(multiplication(A,B),C),B)|le_q(multiplication(star(A),C),B).
% 1.96/2.16 0 [] -le_q(addition(multiplication(A,B),C),A)|le_q(multiplication(C,star(B)),A).
% 1.96/2.16 0 [] -le_q(one,star($c1)).
% 1.96/2.16 end_of_list.
% 1.96/2.16
% 1.96/2.16 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.96/2.16
% 1.96/2.16 This is a Horn set with equality. The strategy will be
% 1.96/2.16 Knuth-Bendix and hyper_res, with positive clauses in
% 1.96/2.16 sos and nonpositive clauses in usable.
% 1.96/2.16
% 1.96/2.16 dependent: set(knuth_bendix).
% 1.96/2.16 dependent: set(anl_eq).
% 1.96/2.16 dependent: set(para_from).
% 1.96/2.16 dependent: set(para_into).
% 1.96/2.16 dependent: clear(para_from_right).
% 1.96/2.16 dependent: clear(para_into_right).
% 1.96/2.16 dependent: set(para_from_vars).
% 1.96/2.16 dependent: set(eq_units_both_ways).
% 1.96/2.16 dependent: set(dynamic_demod_all).
% 1.96/2.16 dependent: set(dynamic_demod).
% 1.96/2.16 dependent: set(order_eq).
% 1.96/2.16 dependent: set(back_demod).
% 1.96/2.16 dependent: set(lrpo).
% 1.96/2.16 dependent: set(hyper_res).
% 1.96/2.16 dependent: clear(order_hyper).
% 1.96/2.16
% 1.96/2.16 ------------> process usable:
% 1.96/2.16 ** KEPT (pick-wt=8): 1 [] -le_q(A,B)|addition(A,B)=B.
% 1.96/2.16 ** KEPT (pick-wt=8): 2 [] le_q(A,B)|addition(A,B)!=B.
% 1.96/2.16 ** KEPT (pick-wt=13): 3 [] -le_q(addition(multiplication(A,B),C),B)|le_q(multiplication(star(A),C),B).
% 1.96/2.16 ** KEPT (pick-wt=13): 4 [] -le_q(addition(multiplication(A,B),C),A)|le_q(multiplication(C,star(B)),A).
% 1.96/2.16 ** KEPT (pick-wt=4): 5 [] -le_q(one,star($c1)).
% 1.96/2.16
% 1.96/2.16 ------------> process sos:
% 1.96/2.16 ** KEPT (pick-wt=3): 6 [] A=A.
% 1.96/2.16 ** KEPT (pick-wt=7): 7 [] addition(A,B)=addition(B,A).
% 1.96/2.16 ** KEPT (pick-wt=11): 9 [copy,8,flip.1] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 1.96/2.16 ---> New Demodulator: 10 [new_demod,9] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 1.96/2.16 ** KEPT (pick-wt=5): 11 [] addition(A,zero)=A.
% 1.96/2.16 ---> New Demodulator: 12 [new_demod,11] addition(A,zero)=A.
% 1.96/2.18 ** KEPT (pick-wt=5): 13 [] addition(A,A)=A.
% 1.96/2.18 ---> New Demodulator: 14 [new_demod,13] addition(A,A)=A.
% 1.96/2.18 ** KEPT (pick-wt=11): 16 [copy,15,flip.1] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 1.96/2.18 ---> New Demodulator: 17 [new_demod,16] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 1.96/2.18 ** KEPT (pick-wt=5): 18 [] multiplication(A,one)=A.
% 1.96/2.18 ---> New Demodulator: 19 [new_demod,18] multiplication(A,one)=A.
% 1.96/2.18 ** KEPT (pick-wt=5): 20 [] multiplication(one,A)=A.
% 1.96/2.18 ---> New Demodulator: 21 [new_demod,20] multiplication(one,A)=A.
% 1.96/2.18 ** KEPT (pick-wt=13): 22 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.96/2.18 ---> New Demodulator: 23 [new_demod,22] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.96/2.18 ** KEPT (pick-wt=13): 24 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.96/2.18 ---> New Demodulator: 25 [new_demod,24] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.96/2.18 ** KEPT (pick-wt=5): 26 [] multiplication(A,zero)=zero.
% 1.96/2.18 ---> New Demodulator: 27 [new_demod,26] multiplication(A,zero)=zero.
% 1.96/2.18 ** KEPT (pick-wt=5): 28 [] multiplication(zero,A)=zero.
% 1.96/2.18 ---> New Demodulator: 29 [new_demod,28] multiplication(zero,A)=zero.
% 1.96/2.18 ** KEPT (pick-wt=9): 30 [] le_q(addition(one,multiplication(A,star(A))),star(A)).
% 1.96/2.18 ** KEPT (pick-wt=9): 31 [] le_q(addition(one,multiplication(star(A),A)),star(A)).
% 1.96/2.18 Following clause subsumed by 6 during input processing: 0 [copy,6,flip.1] A=A.
% 1.96/2.18 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] addition(A,B)=addition(B,A).
% 1.96/2.18 >>>> Starting back demodulation with 10.
% 1.96/2.18 >>>> Starting back demodulation with 12.
% 1.96/2.18 >>>> Starting back demodulation with 14.
% 1.96/2.18 >>>> Starting back demodulation with 17.
% 1.96/2.18 >>>> Starting back demodulation with 19.
% 1.96/2.18 >>>> Starting back demodulation with 21.
% 1.96/2.18 >>>> Starting back demodulation with 23.
% 1.96/2.18 >>>> Starting back demodulation with 25.
% 1.96/2.18 >>>> Starting back demodulation with 27.
% 1.96/2.18 >>>> Starting back demodulation with 29.
% 1.96/2.18
% 1.96/2.18 ======= end of input processing =======
% 1.96/2.18
% 1.96/2.18 =========== start of search ===========
% 1.96/2.18
% 1.96/2.18 -------- PROOF --------
% 1.96/2.18
% 1.96/2.18 ----> UNIT CONFLICT at 0.02 sec ----> 561 [binary,560.1,5.1] $F.
% 1.96/2.18
% 1.96/2.18 Length of proof is 12. Level of proof is 10.
% 1.96/2.18
% 1.96/2.18 ---------------- PROOF ----------------
% 1.96/2.18 % SZS status Theorem
% 1.96/2.18 % SZS output start Refutation
% See solution above
% 1.96/2.18 ------------ end of proof -------------
% 1.96/2.18
% 1.96/2.18
% 1.96/2.18 Search stopped by max_proofs option.
% 1.96/2.18
% 1.96/2.18
% 1.96/2.18 Search stopped by max_proofs option.
% 1.96/2.18
% 1.96/2.18 ============ end of search ============
% 1.96/2.18
% 1.96/2.18 -------------- statistics -------------
% 1.96/2.18 clauses given 93
% 1.96/2.18 clauses generated 1879
% 1.96/2.18 clauses kept 512
% 1.96/2.18 clauses forward subsumed 1384
% 1.96/2.18 clauses back subsumed 103
% 1.96/2.18 Kbytes malloced 1953
% 1.96/2.18
% 1.96/2.18 ----------- times (seconds) -----------
% 1.96/2.18 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.96/2.18 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.96/2.18 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.96/2.18
% 1.96/2.18 That finishes the proof of the theorem.
% 1.96/2.18
% 1.96/2.18 Process 8171 finished Wed Jul 27 06:39:58 2022
% 1.96/2.18 Otter interrupted
% 1.96/2.18 PROOF FOUND
%------------------------------------------------------------------------------