TSTP Solution File: KLE015+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KLE015+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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:29 EDT 2022
% Result : Theorem 6.31s 6.49s
% Output : Refutation 6.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 22
% Syntax : Number of clauses : 54 ( 42 unt; 0 nHn; 34 RR)
% Number of literals : 72 ( 46 equ; 23 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 58 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ le_q(A,B)
| addition(A,B) = B ),
file('KLE015+1.p',unknown),
[] ).
cnf(2,axiom,
( le_q(A,B)
| addition(A,B) != B ),
file('KLE015+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ test(A)
| complement(dollar_f1(A),A) ),
file('KLE015+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ complement(A,B)
| multiplication(B,A) = zero ),
file('KLE015+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ complement(A,B)
| multiplication(A,B) = zero ),
file('KLE015+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ complement(A,B)
| addition(B,A) = one ),
file('KLE015+1.p',unknown),
[] ).
cnf(8,axiom,
( complement(A,B)
| multiplication(B,A) != zero
| multiplication(A,B) != zero
| addition(B,A) != one ),
file('KLE015+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ test(A)
| c(A) != B
| complement(A,B) ),
file('KLE015+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ test(A)
| c(A) = B
| ~ complement(A,B) ),
file('KLE015+1.p',unknown),
[] ).
cnf(11,axiom,
multiplication(multiplication(addition(dollar_c2,dollar_c1),c(dollar_c2)),c(dollar_c1)) != zero,
file('KLE015+1.p',unknown),
[] ).
cnf(13,axiom,
A = A,
file('KLE015+1.p',unknown),
[] ).
cnf(14,axiom,
addition(A,B) = addition(B,A),
file('KLE015+1.p',unknown),
[] ).
cnf(15,axiom,
addition(A,addition(B,C)) = addition(addition(A,B),C),
file('KLE015+1.p',unknown),
[] ).
cnf(16,plain,
addition(addition(A,B),C) = addition(A,addition(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[15])]),
[iquote('copy,15,flip.1')] ).
cnf(19,axiom,
addition(A,zero) = A,
file('KLE015+1.p',unknown),
[] ).
cnf(20,axiom,
addition(A,A) = A,
file('KLE015+1.p',unknown),
[] ).
cnf(22,axiom,
multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C),
file('KLE015+1.p',unknown),
[] ).
cnf(24,plain,
multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[22])]),
[iquote('copy,22,flip.1')] ).
cnf(28,axiom,
multiplication(one,A) = A,
file('KLE015+1.p',unknown),
[] ).
cnf(29,axiom,
multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)),
file('KLE015+1.p',unknown),
[] ).
cnf(32,axiom,
multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
file('KLE015+1.p',unknown),
[] ).
cnf(36,axiom,
multiplication(zero,A) = zero,
file('KLE015+1.p',unknown),
[] ).
cnf(38,axiom,
test(dollar_c1),
file('KLE015+1.p',unknown),
[] ).
cnf(39,axiom,
test(dollar_c2),
file('KLE015+1.p',unknown),
[] ).
cnf(41,plain,
addition(multiplication(dollar_c2,multiplication(c(dollar_c2),c(dollar_c1))),multiplication(dollar_c1,multiplication(c(dollar_c2),c(dollar_c1)))) != zero,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[11]),32,32,24,24]),
[iquote('back_demod,11,demod,32,32,24,24')] ).
cnf(43,plain,
complement(dollar_f1(dollar_c1),dollar_c1),
inference(hyper,[status(thm)],[38,3]),
[iquote('hyper,38,3')] ).
cnf(44,plain,
complement(dollar_c2,c(dollar_c2)),
inference(hyper,[status(thm)],[39,9,13]),
[iquote('hyper,39,9,13')] ).
cnf(45,plain,
complement(dollar_f1(dollar_c2),dollar_c2),
inference(hyper,[status(thm)],[39,3]),
[iquote('hyper,39,3')] ).
cnf(57,plain,
( complement(A,B)
| multiplication(B,A) != zero
| multiplication(A,B) != zero
| addition(A,B) != one ),
inference(para_from,[status(thm),theory(equality)],[14,8]),
[iquote('para_from,14.1.1,8.4.1')] ).
cnf(59,plain,
addition(dollar_c1,dollar_f1(dollar_c1)) = one,
inference(hyper,[status(thm)],[43,7]),
[iquote('hyper,43,7')] ).
cnf(61,plain,
multiplication(dollar_f1(dollar_c1),dollar_c1) = zero,
inference(hyper,[status(thm)],[43,6]),
[iquote('hyper,43,6')] ).
cnf(64,plain,
multiplication(dollar_c1,dollar_f1(dollar_c1)) = zero,
inference(hyper,[status(thm)],[43,5]),
[iquote('hyper,43,5')] ).
cnf(67,plain,
multiplication(dollar_c2,c(dollar_c2)) = zero,
inference(hyper,[status(thm)],[44,6]),
[iquote('hyper,44,6')] ).
cnf(74,plain,
addition(dollar_c2,dollar_f1(dollar_c2)) = one,
inference(hyper,[status(thm)],[45,7]),
[iquote('hyper,45,7')] ).
cnf(77,plain,
multiplication(dollar_f1(dollar_c2),dollar_c2) = zero,
inference(hyper,[status(thm)],[45,6]),
[iquote('hyper,45,6')] ).
cnf(79,plain,
multiplication(dollar_c2,dollar_f1(dollar_c2)) = zero,
inference(hyper,[status(thm)],[45,5]),
[iquote('hyper,45,5')] ).
cnf(91,plain,
addition(zero,A) = A,
inference(para_into,[status(thm),theory(equality)],[19,14]),
[iquote('para_into,18.1.1,14.1.1')] ).
cnf(103,plain,
addition(A,addition(A,B)) = addition(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[20,16])]),
[iquote('para_from,20.1.1,16.1.1.1,flip.1')] ).
cnf(124,plain,
( addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,C)
| ~ le_q(B,C) ),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,1])]),
[iquote('para_into,29.1.1.2,1.2.1,flip.1')] ).
cnf(194,plain,
addition(dollar_f1(dollar_c1),dollar_c1) = one,
inference(para_into,[status(thm),theory(equality)],[59,14]),
[iquote('para_into,59.1.1,14.1.1')] ).
cnf(205,plain,
complement(dollar_c1,dollar_f1(dollar_c1)),
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[61,8]),64,194]),13,13,13]),
[iquote('para_from,61.1.1,8.2.1,demod,64,194,unit_del,13,13,13')] ).
cnf(222,plain,
c(dollar_c1) = dollar_f1(dollar_c1),
inference(hyper,[status(thm)],[205,10,38]),
[iquote('hyper,205,10,38')] ).
cnf(264,plain,
addition(multiplication(dollar_c2,multiplication(c(dollar_c2),dollar_f1(dollar_c1))),multiplication(dollar_c1,multiplication(c(dollar_c2),dollar_f1(dollar_c1)))) != zero,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[41]),222,222]),
[iquote('back_demod,41,demod,222,222')] ).
cnf(289,plain,
multiplication(dollar_c2,multiplication(c(dollar_c2),A)) = zero,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[67,24]),36])]),
[iquote('para_from,67.1.1,23.1.1.1,demod,36,flip.1')] ).
cnf(291,plain,
multiplication(dollar_c1,multiplication(c(dollar_c2),dollar_f1(dollar_c1))) != zero,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[264]),289,91]),
[iquote('back_demod,264,demod,289,91')] ).
cnf(346,plain,
complement(dollar_c2,dollar_f1(dollar_c2)),
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[74,57]),77,79]),13,13,13]),
[iquote('para_from,74.1.1,57.4.1,demod,77,79,unit_del,13,13,13')] ).
cnf(347,plain,
addition(multiplication(dollar_c2,A),multiplication(dollar_f1(dollar_c2),A)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[74,32]),28])]),
[iquote('para_from,74.1.1,31.1.1.1,demod,28,flip.1')] ).
cnf(353,plain,
c(dollar_c2) = dollar_f1(dollar_c2),
inference(hyper,[status(thm)],[346,10,39]),
[iquote('hyper,346,10,39')] ).
cnf(379,plain,
multiplication(dollar_c1,multiplication(dollar_f1(dollar_c2),dollar_f1(dollar_c1))) != zero,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[291]),353]),
[iquote('back_demod,291,demod,353')] ).
cnf(1517,plain,
le_q(A,addition(A,B)),
inference(hyper,[status(thm)],[103,2]),
[iquote('hyper,103,2')] ).
cnf(1575,plain,
le_q(A,addition(B,A)),
inference(para_into,[status(thm),theory(equality)],[1517,14]),
[iquote('para_into,1517.1.2,14.1.1')] ).
cnf(2672,plain,
( multiplication(dollar_c1,A) = zero
| ~ le_q(A,dollar_f1(dollar_c1)) ),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[124,64]),19,64]),
[iquote('para_into,124.1.1.2,63.1.1,demod,19,64')] ).
cnf(3835,plain,
le_q(multiplication(dollar_f1(dollar_c2),A),A),
inference(para_from,[status(thm),theory(equality)],[347,1575]),
[iquote('para_from,347.1.1,1575.1.2')] ).
cnf(4041,plain,
$false,
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[2672,379]),13,3835]),
[iquote('para_from,2672.1.1,379.1.1,unit_del,13,3835')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE015+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n013.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:28:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.95/2.13 ----- Otter 3.3f, August 2004 -----
% 1.95/2.13 The process was started by sandbox2 on n013.cluster.edu,
% 1.95/2.13 Wed Jul 27 06:28:15 2022
% 1.95/2.13 The command was "./otter". The process ID is 31539.
% 1.95/2.13
% 1.95/2.13 set(prolog_style_variables).
% 1.95/2.13 set(auto).
% 1.95/2.13 dependent: set(auto1).
% 1.95/2.13 dependent: set(process_input).
% 1.95/2.13 dependent: clear(print_kept).
% 1.95/2.13 dependent: clear(print_new_demod).
% 1.95/2.13 dependent: clear(print_back_demod).
% 1.95/2.13 dependent: clear(print_back_sub).
% 1.95/2.13 dependent: set(control_memory).
% 1.95/2.13 dependent: assign(max_mem, 12000).
% 1.95/2.13 dependent: assign(pick_given_ratio, 4).
% 1.95/2.13 dependent: assign(stats_level, 1).
% 1.95/2.13 dependent: assign(max_seconds, 10800).
% 1.95/2.13 clear(print_given).
% 1.95/2.13
% 1.95/2.13 formula_list(usable).
% 1.95/2.13 all A (A=A).
% 1.95/2.13 all A B (addition(A,B)=addition(B,A)).
% 1.95/2.13 all C B A (addition(A,addition(B,C))=addition(addition(A,B),C)).
% 1.95/2.13 all A (addition(A,zero)=A).
% 1.95/2.13 all A (addition(A,A)=A).
% 1.95/2.13 all A B C (multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C)).
% 1.95/2.13 all A (multiplication(A,one)=A).
% 1.95/2.13 all A (multiplication(one,A)=A).
% 1.95/2.13 all A B C (multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C))).
% 1.95/2.13 all A B C (multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C))).
% 1.95/2.13 all A (multiplication(A,zero)=zero).
% 1.95/2.13 all A (multiplication(zero,A)=zero).
% 1.95/2.13 all A B (le_q(A,B)<->addition(A,B)=B).
% 1.95/2.13 all X0 (test(X0)<-> (exists X1 complement(X1,X0))).
% 1.95/2.13 all X0 X1 (complement(X1,X0)<->multiplication(X0,X1)=zero&multiplication(X1,X0)=zero&addition(X0,X1)=one).
% 1.95/2.13 all X0 X1 (test(X0)-> (c(X0)=X1<->complement(X0,X1))).
% 1.95/2.13 all X0 (-test(X0)->c(X0)=zero).
% 1.95/2.13 -(all X0 X1 (test(X1)&test(X0)->multiplication(multiplication(addition(X0,X1),c(X0)),c(X1))=zero)).
% 1.95/2.13 end_of_list.
% 1.95/2.13
% 1.95/2.13 -------> usable clausifies to:
% 1.95/2.13
% 1.95/2.13 list(usable).
% 1.95/2.13 0 [] A=A.
% 1.95/2.13 0 [] addition(A,B)=addition(B,A).
% 1.95/2.13 0 [] addition(A,addition(B,C))=addition(addition(A,B),C).
% 1.95/2.13 0 [] addition(A,zero)=A.
% 1.95/2.13 0 [] addition(A,A)=A.
% 1.95/2.13 0 [] multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C).
% 1.95/2.13 0 [] multiplication(A,one)=A.
% 1.95/2.13 0 [] multiplication(one,A)=A.
% 1.95/2.13 0 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.95/2.13 0 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.95/2.13 0 [] multiplication(A,zero)=zero.
% 1.95/2.13 0 [] multiplication(zero,A)=zero.
% 1.95/2.13 0 [] -le_q(A,B)|addition(A,B)=B.
% 1.95/2.13 0 [] le_q(A,B)|addition(A,B)!=B.
% 1.95/2.13 0 [] -test(X0)|complement($f1(X0),X0).
% 1.95/2.13 0 [] test(X0)| -complement(X1,X0).
% 1.95/2.13 0 [] -complement(X1,X0)|multiplication(X0,X1)=zero.
% 1.95/2.13 0 [] -complement(X1,X0)|multiplication(X1,X0)=zero.
% 1.95/2.13 0 [] -complement(X1,X0)|addition(X0,X1)=one.
% 1.95/2.13 0 [] complement(X1,X0)|multiplication(X0,X1)!=zero|multiplication(X1,X0)!=zero|addition(X0,X1)!=one.
% 1.95/2.13 0 [] -test(X0)|c(X0)!=X1|complement(X0,X1).
% 1.95/2.13 0 [] -test(X0)|c(X0)=X1| -complement(X0,X1).
% 1.95/2.13 0 [] test(X0)|c(X0)=zero.
% 1.95/2.13 0 [] test($c1).
% 1.95/2.13 0 [] test($c2).
% 1.95/2.13 0 [] multiplication(multiplication(addition($c2,$c1),c($c2)),c($c1))!=zero.
% 1.95/2.13 end_of_list.
% 1.95/2.13
% 1.95/2.13 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.95/2.13
% 1.95/2.13 This ia a non-Horn set with equality. The strategy will be
% 1.95/2.13 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.95/2.13 deletion, with positive clauses in sos and nonpositive
% 1.95/2.13 clauses in usable.
% 1.95/2.13
% 1.95/2.13 dependent: set(knuth_bendix).
% 1.95/2.13 dependent: set(anl_eq).
% 1.95/2.13 dependent: set(para_from).
% 1.95/2.13 dependent: set(para_into).
% 1.95/2.13 dependent: clear(para_from_right).
% 1.95/2.13 dependent: clear(para_into_right).
% 1.95/2.13 dependent: set(para_from_vars).
% 1.95/2.13 dependent: set(eq_units_both_ways).
% 1.95/2.13 dependent: set(dynamic_demod_all).
% 1.95/2.13 dependent: set(dynamic_demod).
% 1.95/2.13 dependent: set(order_eq).
% 1.95/2.13 dependent: set(back_demod).
% 1.95/2.13 dependent: set(lrpo).
% 1.95/2.13 dependent: set(hyper_res).
% 1.95/2.13 dependent: set(unit_deletion).
% 1.95/2.13 dependent: set(factor).
% 1.95/2.13
% 1.95/2.13 ------------> process usable:
% 1.95/2.13 ** KEPT (pick-wt=8): 1 [] -le_q(A,B)|addition(A,B)=B.
% 1.95/2.13 ** KEPT (pick-wt=8): 2 [] le_q(A,B)|addition(A,B)!=B.
% 1.95/2.13 ** KEPT (pick-wt=6): 3 [] -test(A)|complement($f1(A),A).
% 1.95/2.13 ** KEPT (pick-wt=5): 4 [] test(A)| -complement(B,A).
% 1.95/2.13 ** KEPT (pick-wt=8): 5 [] -complement(A,B)|multiplication(B,A)=zero.
% 1.95/2.13 ** KEPT (pick-wt=8): 6 [] -complement(A,B)|multiplication(A,B)=zero.
% 1.95/2.13 ** KEPT (pick-wt=8): 7 [] -complement(A,B)|addition(B,A)=one.
% 1.95/2.13 ** KEPT (pick-wt=18): 8 [] complement(A,B)|multiplication(B,A)!=zero|multiplication(A,B)!=zero|addition(B,A)!=one.
% 6.31/6.49 ** KEPT (pick-wt=9): 9 [] -test(A)|c(A)!=B|complement(A,B).
% 6.31/6.49 ** KEPT (pick-wt=9): 10 [] -test(A)|c(A)=B| -complement(A,B).
% 6.31/6.49 ** KEPT (pick-wt=11): 11 [] multiplication(multiplication(addition($c2,$c1),c($c2)),c($c1))!=zero.
% 6.31/6.49
% 6.31/6.49 ------------> process sos:
% 6.31/6.49 ** KEPT (pick-wt=3): 13 [] A=A.
% 6.31/6.49 ** KEPT (pick-wt=7): 14 [] addition(A,B)=addition(B,A).
% 6.31/6.49 ** KEPT (pick-wt=11): 16 [copy,15,flip.1] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 6.31/6.49 ---> New Demodulator: 17 [new_demod,16] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 6.31/6.49 ** KEPT (pick-wt=5): 18 [] addition(A,zero)=A.
% 6.31/6.49 ---> New Demodulator: 19 [new_demod,18] addition(A,zero)=A.
% 6.31/6.49 ** KEPT (pick-wt=5): 20 [] addition(A,A)=A.
% 6.31/6.49 ---> New Demodulator: 21 [new_demod,20] addition(A,A)=A.
% 6.31/6.49 ** KEPT (pick-wt=11): 23 [copy,22,flip.1] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 6.31/6.49 ---> New Demodulator: 24 [new_demod,23] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 6.31/6.49 ** KEPT (pick-wt=5): 25 [] multiplication(A,one)=A.
% 6.31/6.49 ---> New Demodulator: 26 [new_demod,25] multiplication(A,one)=A.
% 6.31/6.49 ** KEPT (pick-wt=5): 27 [] multiplication(one,A)=A.
% 6.31/6.49 ---> New Demodulator: 28 [new_demod,27] multiplication(one,A)=A.
% 6.31/6.49 ** KEPT (pick-wt=13): 29 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 6.31/6.49 ---> New Demodulator: 30 [new_demod,29] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 6.31/6.49 ** KEPT (pick-wt=13): 31 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 6.31/6.49 ---> New Demodulator: 32 [new_demod,31] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 6.31/6.49 ** KEPT (pick-wt=5): 33 [] multiplication(A,zero)=zero.
% 6.31/6.49 ---> New Demodulator: 34 [new_demod,33] multiplication(A,zero)=zero.
% 6.31/6.49 ** KEPT (pick-wt=5): 35 [] multiplication(zero,A)=zero.
% 6.31/6.49 ---> New Demodulator: 36 [new_demod,35] multiplication(zero,A)=zero.
% 6.31/6.49 ** KEPT (pick-wt=6): 37 [] test(A)|c(A)=zero.
% 6.31/6.49 ** KEPT (pick-wt=2): 38 [] test($c1).
% 6.31/6.49 ** KEPT (pick-wt=2): 39 [] test($c2).
% 6.31/6.49 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] A=A.
% 6.31/6.49 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] addition(A,B)=addition(B,A).
% 6.31/6.49 >>>> Starting back demodulation with 17.
% 6.31/6.49 >>>> Starting back demodulation with 19.
% 6.31/6.49 >>>> Starting back demodulation with 21.
% 6.31/6.49 >> back demodulating 12 with 21.
% 6.31/6.49 >>>> Starting back demodulation with 24.
% 6.31/6.49 >> back demodulating 11 with 24.
% 6.31/6.49 >>>> Starting back demodulation with 26.
% 6.31/6.49 >>>> Starting back demodulation with 28.
% 6.31/6.49 >>>> Starting back demodulation with 30.
% 6.31/6.49 >>>> Starting back demodulation with 32.
% 6.31/6.49 >>>> Starting back demodulation with 34.
% 6.31/6.49 >>>> Starting back demodulation with 36.
% 6.31/6.49
% 6.31/6.49 ======= end of input processing =======
% 6.31/6.49
% 6.31/6.49 =========== start of search ===========
% 6.31/6.49
% 6.31/6.49
% 6.31/6.49 Resetting weight limit to 7.
% 6.31/6.49
% 6.31/6.49
% 6.31/6.49 Resetting weight limit to 7.
% 6.31/6.49
% 6.31/6.49 sos_size=2559
% 6.31/6.49
% 6.31/6.49 -------- PROOF --------
% 6.31/6.49
% 6.31/6.49 -----> EMPTY CLAUSE at 4.36 sec ----> 4041 [para_from,2672.1.1,379.1.1,unit_del,13,3835] $F.
% 6.31/6.49
% 6.31/6.49 Length of proof is 31. Level of proof is 8.
% 6.31/6.49
% 6.31/6.49 ---------------- PROOF ----------------
% 6.31/6.49 % SZS status Theorem
% 6.31/6.49 % SZS output start Refutation
% See solution above
% 6.31/6.49 ------------ end of proof -------------
% 6.31/6.49
% 6.31/6.49
% 6.31/6.49 Search stopped by max_proofs option.
% 6.31/6.49
% 6.31/6.49
% 6.31/6.49 Search stopped by max_proofs option.
% 6.31/6.49
% 6.31/6.49 ============ end of search ============
% 6.31/6.49
% 6.31/6.49 -------------- statistics -------------
% 6.31/6.49 clauses given 1063
% 6.31/6.49 clauses generated 207877
% 6.31/6.49 clauses kept 3889
% 6.31/6.49 clauses forward subsumed 38750
% 6.31/6.49 clauses back subsumed 1556
% 6.31/6.49 Kbytes malloced 4882
% 6.31/6.49
% 6.31/6.49 ----------- times (seconds) -----------
% 6.31/6.49 user CPU time 4.36 (0 hr, 0 min, 4 sec)
% 6.31/6.49 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 6.31/6.49 wall-clock time 6 (0 hr, 0 min, 6 sec)
% 6.31/6.49
% 6.31/6.49 That finishes the proof of the theorem.
% 6.31/6.49
% 6.31/6.49 Process 31539 finished Wed Jul 27 06:28:21 2022
% 6.31/6.49 Otter interrupted
% 6.31/6.49 PROOF FOUND
%------------------------------------------------------------------------------