%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KLE113+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:45 EDT 2022
% Result : Theorem 2.19s 2.36s
% Output : Refutation 2.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 5 RR)
% Number of literals : 22 ( 21 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
forward_diamond(dollar_c1,zero) != zero,
file('KLE113+1.p',unknown),
[] ).
cnf(10,axiom,
addition(A,zero) = A,
file('KLE113+1.p',unknown),
[] ).
cnf(17,axiom,
multiplication(A,one) = A,
file('KLE113+1.p',unknown),
[] ).
cnf(19,axiom,
multiplication(one,A) = A,
file('KLE113+1.p',unknown),
[] ).
cnf(25,axiom,
multiplication(A,zero) = zero,
file('KLE113+1.p',unknown),
[] ).
cnf(28,axiom,
multiplication(antidomain(A),A) = zero,
file('KLE113+1.p',unknown),
[] ).
cnf(32,axiom,
addition(antidomain(antidomain(A)),antidomain(A)) = one,
file('KLE113+1.p',unknown),
[] ).
cnf(35,axiom,
domain(A) = antidomain(antidomain(A)),
file('KLE113+1.p',unknown),
[] ).
cnf(47,axiom,
domain_difference(A,B) = multiplication(domain(A),antidomain(B)),
file('KLE113+1.p',unknown),
[] ).
cnf(48,plain,
multiplication(antidomain(antidomain(A)),antidomain(B)) = domain_difference(A,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[47]),35])]),
[iquote('copy,47,demod,35,flip.1')] ).
cnf(50,axiom,
forward_diamond(A,B) = domain(multiplication(A,domain(B))),
file('KLE113+1.p',unknown),
[] ).
cnf(51,plain,
antidomain(antidomain(multiplication(A,antidomain(antidomain(B))))) = forward_diamond(A,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[50]),35,35])]),
[iquote('copy,50,demod,35,35,flip.1')] ).
cnf(83,plain,
antidomain(one) = zero,
inference(para_into,[status(thm),theory(equality)],[28,17]),
[iquote('para_into,28.1.1,16.1.1')] ).
cnf(164,plain,
antidomain(zero) = one,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[32,83]),83,10]),
[iquote('para_into,32.1.1.1.1,82.1.1,demod,83,10')] ).
cnf(268,plain,
antidomain(A) = domain_difference(one,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[48,83]),164,19]),
[iquote('para_into,48.1.1.1.1,82.1.1,demod,164,19')] ).
cnf(273,plain,
domain_difference(one,domain_difference(one,A)) = domain_difference(A,zero),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[48,164]),268,268,17]),
[iquote('para_into,48.1.1.2,163.1.1,demod,268,268,17')] ).
cnf(279,plain,
domain_difference(A,A) = zero,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[48,28])]),
[iquote('para_into,48.1.1,28.1.1,flip.1')] ).
cnf(311,plain,
domain_difference(one,zero) = one,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[164]),268]),
[iquote('back_demod,163,demod,268')] ).
cnf(338,plain,
domain_difference(one,domain_difference(one,multiplication(A,domain_difference(one,domain_difference(one,B))))) = forward_diamond(A,B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[51]),268,268,268,268]),
[iquote('back_demod,51,demod,268,268,268,268')] ).
cnf(352,plain,
domain_difference(A,zero) = domain_difference(one,domain_difference(one,A)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[273])]),
[iquote('copy,273,flip.1')] ).
cnf(776,plain,
forward_diamond(A,zero) = zero,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[338,352]),279,311,279,25,311,279])]),
[iquote('para_into,338.1.1.2.2.2.2,352.1.1,demod,279,311,279,25,311,279,flip.1')] ).
cnf(778,plain,
$false,
inference(binary,[status(thm)],[776,3]),
[iquote('binary,776.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KLE113+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:40:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.96/2.14 ----- Otter 3.3f, August 2004 -----
% 1.96/2.14 The process was started by sandbox on n015.cluster.edu,
% 1.96/2.14 Wed Jul 27 06:40:27 2022
% 1.96/2.14 The command was "./otter". The process ID is 10862.
% 1.96/2.14
% 1.96/2.14 set(prolog_style_variables).
% 1.96/2.14 set(auto).
% 1.96/2.14 dependent: set(auto1).
% 1.96/2.14 dependent: set(process_input).
% 1.96/2.14 dependent: clear(print_kept).
% 1.96/2.14 dependent: clear(print_new_demod).
% 1.96/2.14 dependent: clear(print_back_demod).
% 1.96/2.14 dependent: clear(print_back_sub).
% 1.96/2.14 dependent: set(control_memory).
% 1.96/2.14 dependent: assign(max_mem, 12000).
% 1.96/2.14 dependent: assign(pick_given_ratio, 4).
% 1.96/2.14 dependent: assign(stats_level, 1).
% 1.96/2.14 dependent: assign(max_seconds, 10800).
% 1.96/2.14 clear(print_given).
% 1.96/2.14
% 1.96/2.14 formula_list(usable).
% 1.96/2.14 all A (A=A).
% 1.96/2.14 all A B (addition(A,B)=addition(B,A)).
% 1.96/2.14 all C B A (addition(A,addition(B,C))=addition(addition(A,B),C)).
% 1.96/2.14 all A (addition(A,zero)=A).
% 1.96/2.14 all A (addition(A,A)=A).
% 1.96/2.14 all A B C (multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C)).
% 1.96/2.14 all A (multiplication(A,one)=A).
% 1.96/2.14 all A (multiplication(one,A)=A).
% 1.96/2.14 all A B C (multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C))).
% 1.96/2.14 all A B C (multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C))).
% 1.96/2.14 all A (multiplication(A,zero)=zero).
% 1.96/2.14 all A (multiplication(zero,A)=zero).
% 1.96/2.14 all A B (le_q(A,B)<->addition(A,B)=B).
% 1.96/2.14 all X0 (multiplication(antidomain(X0),X0)=zero).
% 1.96/2.14 all X0 X1 (addition(antidomain(multiplication(X0,X1)),antidomain(multiplication(X0,antidomain(antidomain(X1)))))=antidomain(multiplication(X0,antidomain(antidomain(X1))))).
% 1.96/2.14 all X0 (addition(antidomain(antidomain(X0)),antidomain(X0))=one).
% 1.96/2.14 all X0 (domain(X0)=antidomain(antidomain(X0))).
% 1.96/2.14 all X0 (multiplication(X0,coantidomain(X0))=zero).
% 1.96/2.14 all X0 X1 (addition(coantidomain(multiplication(X0,X1)),coantidomain(multiplication(coantidomain(coantidomain(X0)),X1)))=coantidomain(multiplication(coantidomain(coantidomain(X0)),X1))).
% 1.96/2.14 all X0 (addition(coantidomain(coantidomain(X0)),coantidomain(X0))=one).
% 1.96/2.14 all X0 (codomain(X0)=coantidomain(coantidomain(X0))).
% 1.96/2.14 all X0 (c(X0)=antidomain(domain(X0))).
% 1.96/2.14 all X0 X1 (domain_difference(X0,X1)=multiplication(domain(X0),antidomain(X1))).
% 1.96/2.14 all X0 X1 (forward_diamond(X0,X1)=domain(multiplication(X0,domain(X1)))).
% 1.96/2.14 all X0 X1 (backward_diamond(X0,X1)=codomain(multiplication(codomain(X1),X0))).
% 1.96/2.14 all X0 X1 (forward_box(X0,X1)=c(forward_diamond(X0,c(X1)))).
% 1.96/2.14 all X0 X1 (backward_box(X0,X1)=c(backward_diamond(X0,c(X1)))).
% 1.96/2.14 -(all X0 (forward_diamond(X0,zero)=zero)).
% 1.96/2.14 end_of_list.
% 1.96/2.14
% 1.96/2.14 -------> usable clausifies to:
% 1.96/2.14
% 1.96/2.14 list(usable).
% 1.96/2.14 0 [] A=A.
% 1.96/2.14 0 [] addition(A,B)=addition(B,A).
% 1.96/2.14 0 [] addition(A,addition(B,C))=addition(addition(A,B),C).
% 1.96/2.14 0 [] addition(A,zero)=A.
% 1.96/2.14 0 [] addition(A,A)=A.
% 1.96/2.14 0 [] multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C).
% 1.96/2.14 0 [] multiplication(A,one)=A.
% 1.96/2.14 0 [] multiplication(one,A)=A.
% 1.96/2.14 0 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.96/2.14 0 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.96/2.14 0 [] multiplication(A,zero)=zero.
% 1.96/2.14 0 [] multiplication(zero,A)=zero.
% 1.96/2.14 0 [] -le_q(A,B)|addition(A,B)=B.
% 1.96/2.14 0 [] le_q(A,B)|addition(A,B)!=B.
% 1.96/2.14 0 [] multiplication(antidomain(X0),X0)=zero.
% 1.96/2.14 0 [] addition(antidomain(multiplication(X0,X1)),antidomain(multiplication(X0,antidomain(antidomain(X1)))))=antidomain(multiplication(X0,antidomain(antidomain(X1)))).
% 1.96/2.14 0 [] addition(antidomain(antidomain(X0)),antidomain(X0))=one.
% 1.96/2.14 0 [] domain(X0)=antidomain(antidomain(X0)).
% 1.96/2.14 0 [] multiplication(X0,coantidomain(X0))=zero.
% 1.96/2.14 0 [] addition(coantidomain(multiplication(X0,X1)),coantidomain(multiplication(coantidomain(coantidomain(X0)),X1)))=coantidomain(multiplication(coantidomain(coantidomain(X0)),X1)).
% 1.96/2.14 0 [] addition(coantidomain(coantidomain(X0)),coantidomain(X0))=one.
% 1.96/2.14 0 [] codomain(X0)=coantidomain(coantidomain(X0)).
% 1.96/2.14 0 [] c(X0)=antidomain(domain(X0)).
% 1.96/2.14 0 [] domain_difference(X0,X1)=multiplication(domain(X0),antidomain(X1)).
% 1.96/2.14 0 [] forward_diamond(X0,X1)=domain(multiplication(X0,domain(X1))).
% 1.96/2.14 0 [] backward_diamond(X0,X1)=codomain(multiplication(codomain(X1),X0)).
% 1.96/2.14 0 [] forward_box(X0,X1)=c(forward_diamond(X0,c(X1))).
% 1.96/2.14 0 [] backward_box(X0,X1)=c(backward_diamond(X0,c(X1))).
% 1.96/2.14 0 [] forward_diamond($c1,zero)!=zero.
% 1.96/2.14 end_of_list.
% 1.96/2.14
% 1.96/2.14 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.96/2.14
% 1.96/2.14 This is a Horn set with equality. The strategy will be
% 1.96/2.14 Knuth-Bendix and hyper_res, with positive clauses in
% 1.96/2.14 sos and nonpositive clauses in usable.
% 1.96/2.14
% 1.96/2.14 dependent: set(knuth_bendix).
% 1.96/2.14 dependent: set(anl_eq).
% 1.96/2.14 dependent: set(para_from).
% 1.96/2.14 dependent: set(para_into).
% 1.96/2.14 dependent: clear(para_from_right).
% 1.96/2.14 dependent: clear(para_into_right).
% 1.96/2.14 dependent: set(para_from_vars).
% 1.96/2.14 dependent: set(eq_units_both_ways).
% 1.96/2.14 dependent: set(dynamic_demod_all).
% 1.96/2.14 dependent: set(dynamic_demod).
% 1.96/2.14 dependent: set(order_eq).
% 1.96/2.14 dependent: set(back_demod).
% 1.96/2.14 dependent: set(lrpo).
% 1.96/2.14 dependent: set(hyper_res).
% 1.96/2.14 dependent: clear(order_hyper).
% 1.96/2.14
% 1.96/2.14 ------------> process usable:
% 1.96/2.14 ** KEPT (pick-wt=8): 1 [] -le_q(A,B)|addition(A,B)=B.
% 1.96/2.14 ** KEPT (pick-wt=8): 2 [] le_q(A,B)|addition(A,B)!=B.
% 1.96/2.14 ** KEPT (pick-wt=5): 3 [] forward_diamond($c1,zero)!=zero.
% 1.96/2.14
% 1.96/2.14 ------------> process sos:
% 1.96/2.14 ** KEPT (pick-wt=3): 4 [] A=A.
% 1.96/2.14 ** KEPT (pick-wt=7): 5 [] addition(A,B)=addition(B,A).
% 1.96/2.14 ** KEPT (pick-wt=11): 7 [copy,6,flip.1] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 1.96/2.14 ---> New Demodulator: 8 [new_demod,7] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 1.96/2.14 ** KEPT (pick-wt=5): 9 [] addition(A,zero)=A.
% 1.96/2.14 ---> New Demodulator: 10 [new_demod,9] addition(A,zero)=A.
% 1.96/2.14 ** KEPT (pick-wt=5): 11 [] addition(A,A)=A.
% 1.96/2.14 ---> New Demodulator: 12 [new_demod,11] addition(A,A)=A.
% 1.96/2.14 ** KEPT (pick-wt=11): 14 [copy,13,flip.1] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 1.96/2.14 ---> New Demodulator: 15 [new_demod,14] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 1.96/2.14 ** KEPT (pick-wt=5): 16 [] multiplication(A,one)=A.
% 1.96/2.14 ---> New Demodulator: 17 [new_demod,16] multiplication(A,one)=A.
% 1.96/2.14 ** KEPT (pick-wt=5): 18 [] multiplication(one,A)=A.
% 1.96/2.14 ---> New Demodulator: 19 [new_demod,18] multiplication(one,A)=A.
% 1.96/2.14 ** KEPT (pick-wt=13): 20 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.96/2.14 ---> New Demodulator: 21 [new_demod,20] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.96/2.14 ** KEPT (pick-wt=13): 22 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.96/2.14 ---> New Demodulator: 23 [new_demod,22] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.96/2.14 ** KEPT (pick-wt=5): 24 [] multiplication(A,zero)=zero.
% 1.96/2.14 ---> New Demodulator: 25 [new_demod,24] multiplication(A,zero)=zero.
% 1.96/2.14 ** KEPT (pick-wt=5): 26 [] multiplication(zero,A)=zero.
% 1.96/2.14 ---> New Demodulator: 27 [new_demod,26] multiplication(zero,A)=zero.
% 1.96/2.14 ** KEPT (pick-wt=6): 28 [] multiplication(antidomain(A),A)=zero.
% 1.96/2.14 ---> New Demodulator: 29 [new_demod,28] multiplication(antidomain(A),A)=zero.
% 1.96/2.14 ** KEPT (pick-wt=18): 30 [] addition(antidomain(multiplication(A,B)),antidomain(multiplication(A,antidomain(antidomain(B)))))=antidomain(multiplication(A,antidomain(antidomain(B)))).
% 1.96/2.14 ---> New Demodulator: 31 [new_demod,30] addition(antidomain(multiplication(A,B)),antidomain(multiplication(A,antidomain(antidomain(B)))))=antidomain(multiplication(A,antidomain(antidomain(B)))).
% 1.96/2.14 ** KEPT (pick-wt=8): 32 [] addition(antidomain(antidomain(A)),antidomain(A))=one.
% 1.96/2.14 ---> New Demodulator: 33 [new_demod,32] addition(antidomain(antidomain(A)),antidomain(A))=one.
% 1.96/2.14 ** KEPT (pick-wt=6): 34 [] domain(A)=antidomain(antidomain(A)).
% 1.96/2.14 ---> New Demodulator: 35 [new_demod,34] domain(A)=antidomain(antidomain(A)).
% 1.96/2.14 ** KEPT (pick-wt=6): 36 [] multiplication(A,coantidomain(A))=zero.
% 1.96/2.14 ---> New Demodulator: 37 [new_demod,36] multiplication(A,coantidomain(A))=zero.
% 1.96/2.14 ** KEPT (pick-wt=18): 38 [] addition(coantidomain(multiplication(A,B)),coantidomain(multiplication(coantidomain(coantidomain(A)),B)))=coantidomain(multiplication(coantidomain(coantidomain(A)),B)).
% 1.96/2.14 ---> New Demodulator: 39 [new_demod,38] addition(coantidomain(multiplication(A,B)),coantidomain(multiplication(coantidomain(coantidomain(A)),B)))=coantidomain(multiplication(coantidomain(coantidomain(A)),B)).
% 1.96/2.14 ** KEPT (pick-wt=8): 40 [] addition(coantidomain(coantidomain(A)),coantidomain(A))=one.
% 2.19/2.36 ---> New Demodulator: 41 [new_demod,40] addition(coantidomain(coantidomain(A)),coantidomain(A))=one.
% 2.19/2.36 ** KEPT (pick-wt=6): 42 [] codomain(A)=coantidomain(coantidomain(A)).
% 2.19/2.36 ---> New Demodulator: 43 [new_demod,42] codomain(A)=coantidomain(coantidomain(A)).
% 2.19/2.36 ** KEPT (pick-wt=7): 45 [copy,44,demod,35] c(A)=antidomain(antidomain(antidomain(A))).
% 2.19/2.36 ---> New Demodulator: 46 [new_demod,45] c(A)=antidomain(antidomain(antidomain(A))).
% 2.19/2.36 ** KEPT (pick-wt=10): 48 [copy,47,demod,35,flip.1] multiplication(antidomain(antidomain(A)),antidomain(B))=domain_difference(A,B).
% 2.19/2.36 ---> New Demodulator: 49 [new_demod,48] multiplication(antidomain(antidomain(A)),antidomain(B))=domain_difference(A,B).
% 2.19/2.36 ** KEPT (pick-wt=11): 51 [copy,50,demod,35,35,flip.1] antidomain(antidomain(multiplication(A,antidomain(antidomain(B)))))=forward_diamond(A,B).
% 2.19/2.36 ---> New Demodulator: 52 [new_demod,51] antidomain(antidomain(multiplication(A,antidomain(antidomain(B)))))=forward_diamond(A,B).
% 2.19/2.36 ** KEPT (pick-wt=11): 54 [copy,53,demod,43,43,flip.1] coantidomain(coantidomain(multiplication(coantidomain(coantidomain(A)),B)))=backward_diamond(B,A).
% 2.19/2.36 ---> New Demodulator: 55 [new_demod,54] coantidomain(coantidomain(multiplication(coantidomain(coantidomain(A)),B)))=backward_diamond(B,A).
% 2.19/2.36 ** KEPT (pick-wt=13): 57 [copy,56,demod,46,46,flip.1] antidomain(antidomain(antidomain(forward_diamond(A,antidomain(antidomain(antidomain(B)))))))=forward_box(A,B).
% 2.19/2.36 ---> New Demodulator: 58 [new_demod,57] antidomain(antidomain(antidomain(forward_diamond(A,antidomain(antidomain(antidomain(B)))))))=forward_box(A,B).
% 2.19/2.36 ** KEPT (pick-wt=13): 60 [copy,59,demod,46,46,flip.1] antidomain(antidomain(antidomain(backward_diamond(A,antidomain(antidomain(antidomain(B)))))))=backward_box(A,B).
% 2.19/2.36 ---> New Demodulator: 61 [new_demod,60] antidomain(antidomain(antidomain(backward_diamond(A,antidomain(antidomain(antidomain(B)))))))=backward_box(A,B).
% 2.19/2.36 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 2.19/2.36 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] addition(A,B)=addition(B,A).
% 2.19/2.36 >>>> Starting back demodulation with 8.
% 2.19/2.36 >>>> Starting back demodulation with 10.
% 2.19/2.36 >>>> Starting back demodulation with 12.
% 2.19/2.36 >>>> Starting back demodulation with 15.
% 2.19/2.36 >>>> Starting back demodulation with 17.
% 2.19/2.36 >>>> Starting back demodulation with 19.
% 2.19/2.36 >>>> Starting back demodulation with 21.
% 2.19/2.36 >>>> Starting back demodulation with 23.
% 2.19/2.36 >>>> Starting back demodulation with 25.
% 2.19/2.36 >>>> Starting back demodulation with 27.
% 2.19/2.36 >>>> Starting back demodulation with 29.
% 2.19/2.36 >>>> Starting back demodulation with 31.
% 2.19/2.36 >>>> Starting back demodulation with 33.
% 2.19/2.36 >>>> Starting back demodulation with 35.
% 2.19/2.36 >>>> Starting back demodulation with 37.
% 2.19/2.36 >>>> Starting back demodulation with 39.
% 2.19/2.36 >>>> Starting back demodulation with 41.
% 2.19/2.36 >>>> Starting back demodulation with 43.
% 2.19/2.36 >>>> Starting back demodulation with 46.
% 2.19/2.36 >>>> Starting back demodulation with 49.
% 2.19/2.36 >>>> Starting back demodulation with 52.
% 2.19/2.36 >>>> Starting back demodulation with 55.
% 2.19/2.36 >>>> Starting back demodulation with 58.
% 2.19/2.36 >>>> Starting back demodulation with 61.
% 2.19/2.36
% 2.19/2.36 ======= end of input processing =======
% 2.19/2.36
% 2.19/2.36 =========== start of search ===========
% 2.19/2.36
% 2.19/2.36
% 2.19/2.36 Resetting weight limit to 8.
% 2.19/2.36
% 2.19/2.36
% 2.19/2.36 Resetting weight limit to 8.
% 2.19/2.36
% 2.19/2.36 sos_size=231
% 2.19/2.36
% 2.19/2.36 -------- PROOF --------
% 2.19/2.36
% 2.19/2.36 ----> UNIT CONFLICT at 0.21 sec ----> 778 [binary,776.1,3.1] $F.
% 2.19/2.36
% 2.19/2.36 Length of proof is 11. Level of proof is 6.
% 2.19/2.36
% 2.19/2.36 ---------------- PROOF ----------------
% 2.19/2.36 % SZS status Theorem
% 2.19/2.36 % SZS output start Refutation
% See solution above
% 2.19/2.36 ------------ end of proof -------------
% 2.19/2.36
% 2.19/2.36
% 2.19/2.36 Search stopped by max_proofs option.
% 2.19/2.36
% 2.19/2.36
% 2.19/2.36 Search stopped by max_proofs option.
% 2.19/2.36
% 2.19/2.36 ============ end of search ============
% 2.19/2.36
% 2.19/2.36 -------------- statistics -------------
% 2.19/2.36 clauses given 346
% 2.19/2.36 clauses generated 38394
% 2.19/2.36 clauses kept 581
% 2.19/2.36 clauses forward subsumed 10845
% 2.19/2.36 clauses back subsumed 42
% 2.19/2.36 Kbytes malloced 6835
% 2.19/2.36
% 2.19/2.36 ----------- times (seconds) -----------
% 2.19/2.36 user CPU time 0.21 (0 hr, 0 min, 0 sec)
% 2.19/2.36 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.19/2.36 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.19/2.36
% 2.19/2.36 That finishes the proof of the theorem.
% 2.19/2.36
% 2.19/2.36 Process 10862 finished Wed Jul 27 06:40:28 2022
% 2.19/2.36 Otter interrupted
% 2.19/2.36 PROOF FOUND
%------------------------------------------------------------------------------