TSTP Solution File: KLE065+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KLE065+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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:39 EDT 2022
% Result : Theorem 1.86s 2.01s
% Output : Refutation 1.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 25 ( 19 unt; 0 nHn; 9 RR)
% Number of literals : 31 ( 23 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ le_q(A,B)
| addition(A,B) = B ),
file('KLE065+1.p',unknown),
[] ).
cnf(2,axiom,
( le_q(A,B)
| addition(A,B) != B ),
file('KLE065+1.p',unknown),
[] ).
cnf(3,axiom,
multiplication(dollar_c2,domain(dollar_c1)) != zero,
file('KLE065+1.p',unknown),
[] ).
cnf(4,axiom,
A = A,
file('KLE065+1.p',unknown),
[] ).
cnf(5,axiom,
addition(A,B) = addition(B,A),
file('KLE065+1.p',unknown),
[] ).
cnf(9,axiom,
addition(A,zero) = A,
file('KLE065+1.p',unknown),
[] ).
cnf(19,axiom,
multiplication(one,A) = A,
file('KLE065+1.p',unknown),
[] ).
cnf(22,axiom,
multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
file('KLE065+1.p',unknown),
[] ).
cnf(26,axiom,
multiplication(zero,A) = zero,
file('KLE065+1.p',unknown),
[] ).
cnf(28,axiom,
addition(A,multiplication(domain(A),A)) = multiplication(domain(A),A),
file('KLE065+1.p',unknown),
[] ).
cnf(30,axiom,
domain(multiplication(A,B)) = domain(multiplication(A,domain(B))),
file('KLE065+1.p',unknown),
[] ).
cnf(32,plain,
domain(multiplication(A,domain(B))) = domain(multiplication(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[30])]),
[iquote('copy,30,flip.1')] ).
cnf(33,axiom,
addition(domain(A),one) = one,
file('KLE065+1.p',unknown),
[] ).
cnf(36,axiom,
domain(zero) = zero,
file('KLE065+1.p',unknown),
[] ).
cnf(40,axiom,
multiplication(dollar_c2,dollar_c1) = zero,
file('KLE065+1.p',unknown),
[] ).
cnf(42,plain,
( zero = A
| ~ le_q(A,zero) ),
inference(para_into,[status(thm),theory(equality)],[9,1]),
[iquote('para_into,9.1.1,1.2.1')] ).
cnf(46,plain,
addition(zero,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[5,9])]),
[iquote('para_into,5.1.1,9.1.1,flip.1')] ).
cnf(60,plain,
le_q(zero,A),
inference(hyper,[status(thm)],[46,2]),
[iquote('hyper,46,2')] ).
cnf(64,plain,
addition(one,domain(A)) = one,
inference(para_into,[status(thm),theory(equality)],[33,5]),
[iquote('para_into,33.1.1,5.1.1')] ).
cnf(73,plain,
( multiplication(A,B) = zero
| ~ le_q(A,zero) ),
inference(para_from,[status(thm),theory(equality)],[42,26]),
[iquote('para_from,42.1.1,26.1.1.1')] ).
cnf(104,plain,
addition(A,multiplication(domain(B),A)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[22,64]),19,19])]),
[iquote('para_into,22.1.1.1,64.1.1,demod,19,19,flip.1')] ).
cnf(110,plain,
multiplication(domain(A),A) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[28]),104])]),
[iquote('back_demod,28,demod,104,flip.1')] ).
cnf(251,plain,
( A = zero
| ~ le_q(domain(A),zero) ),
inference(para_into,[status(thm),theory(equality)],[73,110]),
[iquote('para_into,73.1.1,110.1.1')] ).
cnf(298,plain,
( zero != zero
| ~ le_q(zero,zero) ),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[251,3]),32,40,36]),
[iquote('para_from,251.1.1,3.1.1,demod,32,40,36')] ).
cnf(304,plain,
$false,
inference(hyper,[status(thm)],[298,4,60]),
[iquote('hyper,298,4,60')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : KLE065+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Jul 27 06:23:08 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.80/1.99 ----- Otter 3.3f, August 2004 -----
% 1.80/1.99 The process was started by sandbox2 on n021.cluster.edu,
% 1.80/1.99 Wed Jul 27 06:23:08 2022
% 1.80/1.99 The command was "./otter". The process ID is 32055.
% 1.80/1.99
% 1.80/1.99 set(prolog_style_variables).
% 1.80/1.99 set(auto).
% 1.80/1.99 dependent: set(auto1).
% 1.80/1.99 dependent: set(process_input).
% 1.80/1.99 dependent: clear(print_kept).
% 1.80/1.99 dependent: clear(print_new_demod).
% 1.80/1.99 dependent: clear(print_back_demod).
% 1.80/1.99 dependent: clear(print_back_sub).
% 1.80/1.99 dependent: set(control_memory).
% 1.80/1.99 dependent: assign(max_mem, 12000).
% 1.80/1.99 dependent: assign(pick_given_ratio, 4).
% 1.80/1.99 dependent: assign(stats_level, 1).
% 1.80/1.99 dependent: assign(max_seconds, 10800).
% 1.80/1.99 clear(print_given).
% 1.80/1.99
% 1.80/1.99 formula_list(usable).
% 1.80/1.99 all A (A=A).
% 1.80/1.99 all A B (addition(A,B)=addition(B,A)).
% 1.80/1.99 all C B A (addition(A,addition(B,C))=addition(addition(A,B),C)).
% 1.80/1.99 all A (addition(A,zero)=A).
% 1.80/1.99 all A (addition(A,A)=A).
% 1.80/1.99 all A B C (multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C)).
% 1.80/1.99 all A (multiplication(A,one)=A).
% 1.80/1.99 all A (multiplication(one,A)=A).
% 1.80/1.99 all A B C (multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C))).
% 1.80/1.99 all A B C (multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C))).
% 1.80/1.99 all A (multiplication(A,zero)=zero).
% 1.80/1.99 all A (multiplication(zero,A)=zero).
% 1.80/1.99 all A B (le_q(A,B)<->addition(A,B)=B).
% 1.80/1.99 all X0 (addition(X0,multiplication(domain(X0),X0))=multiplication(domain(X0),X0)).
% 1.80/1.99 all X0 X1 (domain(multiplication(X0,X1))=domain(multiplication(X0,domain(X1)))).
% 1.80/1.99 all X0 (addition(domain(X0),one)=one).
% 1.80/1.99 domain(zero)=zero.
% 1.80/1.99 all X0 X1 (domain(addition(X0,X1))=addition(domain(X0),domain(X1))).
% 1.80/1.99 -(all X0 X1 (multiplication(X0,X1)=zero->multiplication(X0,domain(X1))=zero)).
% 1.80/1.99 end_of_list.
% 1.80/1.99
% 1.80/1.99 -------> usable clausifies to:
% 1.80/1.99
% 1.80/1.99 list(usable).
% 1.80/1.99 0 [] A=A.
% 1.80/1.99 0 [] addition(A,B)=addition(B,A).
% 1.80/1.99 0 [] addition(A,addition(B,C))=addition(addition(A,B),C).
% 1.80/1.99 0 [] addition(A,zero)=A.
% 1.80/1.99 0 [] addition(A,A)=A.
% 1.80/1.99 0 [] multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C).
% 1.80/1.99 0 [] multiplication(A,one)=A.
% 1.80/1.99 0 [] multiplication(one,A)=A.
% 1.80/1.99 0 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.80/1.99 0 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.80/1.99 0 [] multiplication(A,zero)=zero.
% 1.80/1.99 0 [] multiplication(zero,A)=zero.
% 1.80/1.99 0 [] -le_q(A,B)|addition(A,B)=B.
% 1.80/1.99 0 [] le_q(A,B)|addition(A,B)!=B.
% 1.80/1.99 0 [] addition(X0,multiplication(domain(X0),X0))=multiplication(domain(X0),X0).
% 1.80/1.99 0 [] domain(multiplication(X0,X1))=domain(multiplication(X0,domain(X1))).
% 1.80/1.99 0 [] addition(domain(X0),one)=one.
% 1.80/1.99 0 [] domain(zero)=zero.
% 1.80/1.99 0 [] domain(addition(X0,X1))=addition(domain(X0),domain(X1)).
% 1.80/1.99 0 [] multiplication($c2,$c1)=zero.
% 1.80/1.99 0 [] multiplication($c2,domain($c1))!=zero.
% 1.80/1.99 end_of_list.
% 1.80/1.99
% 1.80/1.99 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.80/1.99
% 1.80/1.99 This is a Horn set with equality. The strategy will be
% 1.80/1.99 Knuth-Bendix and hyper_res, with positive clauses in
% 1.80/1.99 sos and nonpositive clauses in usable.
% 1.80/1.99
% 1.80/1.99 dependent: set(knuth_bendix).
% 1.80/1.99 dependent: set(anl_eq).
% 1.80/1.99 dependent: set(para_from).
% 1.80/1.99 dependent: set(para_into).
% 1.80/1.99 dependent: clear(para_from_right).
% 1.80/1.99 dependent: clear(para_into_right).
% 1.80/1.99 dependent: set(para_from_vars).
% 1.80/1.99 dependent: set(eq_units_both_ways).
% 1.80/1.99 dependent: set(dynamic_demod_all).
% 1.80/1.99 dependent: set(dynamic_demod).
% 1.80/1.99 dependent: set(order_eq).
% 1.80/1.99 dependent: set(back_demod).
% 1.80/1.99 dependent: set(lrpo).
% 1.80/1.99 dependent: set(hyper_res).
% 1.80/1.99 dependent: clear(order_hyper).
% 1.80/1.99
% 1.80/1.99 ------------> process usable:
% 1.80/1.99 ** KEPT (pick-wt=8): 1 [] -le_q(A,B)|addition(A,B)=B.
% 1.80/1.99 ** KEPT (pick-wt=8): 2 [] le_q(A,B)|addition(A,B)!=B.
% 1.80/1.99 ** KEPT (pick-wt=6): 3 [] multiplication($c2,domain($c1))!=zero.
% 1.80/1.99
% 1.80/1.99 ------------> process sos:
% 1.80/1.99 ** KEPT (pick-wt=3): 4 [] A=A.
% 1.80/1.99 ** KEPT (pick-wt=7): 5 [] addition(A,B)=addition(B,A).
% 1.80/1.99 ** KEPT (pick-wt=11): 7 [copy,6,flip.1] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 1.80/1.99 ---> New Demodulator: 8 [new_demod,7] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 1.80/1.99 ** KEPT (pick-wt=5): 9 [] addition(A,zero)=A.
% 1.80/1.99 ---> New Demodulator: 10 [new_demod,9] addition(A,zero)=A.
% 1.80/1.99 ** KEPT (pick-wt=5): 11 [] addition(A,A)=A.
% 1.80/1.99 ---> New Demodulator: 12 [new_demod,11] addition(A,A)=A.
% 1.86/2.01 ** KEPT (pick-wt=11): 14 [copy,13,flip.1] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 1.86/2.01 ---> New Demodulator: 15 [new_demod,14] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 1.86/2.01 ** KEPT (pick-wt=5): 16 [] multiplication(A,one)=A.
% 1.86/2.01 ---> New Demodulator: 17 [new_demod,16] multiplication(A,one)=A.
% 1.86/2.01 ** KEPT (pick-wt=5): 18 [] multiplication(one,A)=A.
% 1.86/2.01 ---> New Demodulator: 19 [new_demod,18] multiplication(one,A)=A.
% 1.86/2.01 ** KEPT (pick-wt=13): 20 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.86/2.01 ---> New Demodulator: 21 [new_demod,20] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.86/2.01 ** KEPT (pick-wt=13): 22 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.86/2.01 ---> New Demodulator: 23 [new_demod,22] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.86/2.01 ** KEPT (pick-wt=5): 24 [] multiplication(A,zero)=zero.
% 1.86/2.01 ---> New Demodulator: 25 [new_demod,24] multiplication(A,zero)=zero.
% 1.86/2.01 ** KEPT (pick-wt=5): 26 [] multiplication(zero,A)=zero.
% 1.86/2.01 ---> New Demodulator: 27 [new_demod,26] multiplication(zero,A)=zero.
% 1.86/2.01 ** KEPT (pick-wt=11): 28 [] addition(A,multiplication(domain(A),A))=multiplication(domain(A),A).
% 1.86/2.01 ---> New Demodulator: 29 [new_demod,28] addition(A,multiplication(domain(A),A))=multiplication(domain(A),A).
% 1.86/2.01 ** KEPT (pick-wt=10): 31 [copy,30,flip.1] domain(multiplication(A,domain(B)))=domain(multiplication(A,B)).
% 1.86/2.01 ---> New Demodulator: 32 [new_demod,31] domain(multiplication(A,domain(B)))=domain(multiplication(A,B)).
% 1.86/2.01 ** KEPT (pick-wt=6): 33 [] addition(domain(A),one)=one.
% 1.86/2.01 ---> New Demodulator: 34 [new_demod,33] addition(domain(A),one)=one.
% 1.86/2.01 ** KEPT (pick-wt=4): 35 [] domain(zero)=zero.
% 1.86/2.01 ---> New Demodulator: 36 [new_demod,35] domain(zero)=zero.
% 1.86/2.01 ** KEPT (pick-wt=10): 37 [] domain(addition(A,B))=addition(domain(A),domain(B)).
% 1.86/2.01 ---> New Demodulator: 38 [new_demod,37] domain(addition(A,B))=addition(domain(A),domain(B)).
% 1.86/2.01 ** KEPT (pick-wt=5): 39 [] multiplication($c2,$c1)=zero.
% 1.86/2.01 ---> New Demodulator: 40 [new_demod,39] multiplication($c2,$c1)=zero.
% 1.86/2.01 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 1.86/2.01 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] addition(A,B)=addition(B,A).
% 1.86/2.01 >>>> Starting back demodulation with 8.
% 1.86/2.01 >>>> Starting back demodulation with 10.
% 1.86/2.01 >>>> Starting back demodulation with 12.
% 1.86/2.01 >>>> Starting back demodulation with 15.
% 1.86/2.01 >>>> Starting back demodulation with 17.
% 1.86/2.01 >>>> Starting back demodulation with 19.
% 1.86/2.01 >>>> Starting back demodulation with 21.
% 1.86/2.01 >>>> Starting back demodulation with 23.
% 1.86/2.01 >>>> Starting back demodulation with 25.
% 1.86/2.01 >>>> Starting back demodulation with 27.
% 1.86/2.01 >>>> Starting back demodulation with 29.
% 1.86/2.01 >>>> Starting back demodulation with 32.
% 1.86/2.01 >>>> Starting back demodulation with 34.
% 1.86/2.01 >>>> Starting back demodulation with 36.
% 1.86/2.01 >>>> Starting back demodulation with 38.
% 1.86/2.01 >>>> Starting back demodulation with 40.
% 1.86/2.01
% 1.86/2.01 ======= end of input processing =======
% 1.86/2.01
% 1.86/2.01 =========== start of search ===========
% 1.86/2.01
% 1.86/2.01 -------- PROOF --------
% 1.86/2.01
% 1.86/2.01 -----> EMPTY CLAUSE at 0.01 sec ----> 304 [hyper,298,4,60] $F.
% 1.86/2.01
% 1.86/2.01 Length of proof is 10. Level of proof is 5.
% 1.86/2.01
% 1.86/2.01 ---------------- PROOF ----------------
% 1.86/2.01 % SZS status Theorem
% 1.86/2.01 % SZS output start Refutation
% See solution above
% 1.86/2.01 ------------ end of proof -------------
% 1.86/2.01
% 1.86/2.01
% 1.86/2.01 Search stopped by max_proofs option.
% 1.86/2.01
% 1.86/2.01
% 1.86/2.01 Search stopped by max_proofs option.
% 1.86/2.01
% 1.86/2.01 ============ end of search ============
% 1.86/2.01
% 1.86/2.01 -------------- statistics -------------
% 1.86/2.01 clauses given 58
% 1.86/2.01 clauses generated 1036
% 1.86/2.01 clauses kept 257
% 1.86/2.01 clauses forward subsumed 809
% 1.86/2.01 clauses back subsumed 14
% 1.86/2.01 Kbytes malloced 1953
% 1.86/2.01
% 1.86/2.01 ----------- times (seconds) -----------
% 1.86/2.01 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.86/2.01 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.86/2.01 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.86/2.01
% 1.86/2.01 That finishes the proof of the theorem.
% 1.86/2.01
% 1.86/2.01 Process 32055 finished Wed Jul 27 06:23:09 2022
% 1.86/2.01 Otter interrupted
% 1.86/2.01 PROOF FOUND
%------------------------------------------------------------------------------