%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KLE009+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:27 EDT 2022
% Result : Theorem 3.34s 3.50s
% Output : Refutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 43 ( 33 unt; 0 nHn; 35 RR)
% Number of literals : 59 ( 38 equ; 23 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ test(A)
| complement(dollar_f1(A),A) ),
file('KLE009+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ complement(A,B)
| multiplication(B,A) = zero ),
file('KLE009+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ complement(A,B)
| multiplication(A,B) = zero ),
file('KLE009+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ complement(A,B)
| addition(B,A) = one ),
file('KLE009+1.p',unknown),
[] ).
cnf(8,axiom,
( complement(A,B)
| multiplication(B,A) != zero
| multiplication(A,B) != zero
| addition(B,A) != one ),
file('KLE009+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ test(A)
| c(A) != B
| complement(A,B) ),
file('KLE009+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ test(A)
| c(A) = B
| ~ complement(A,B) ),
file('KLE009+1.p',unknown),
[] ).
cnf(11,axiom,
one != addition(addition(addition(multiplication(dollar_c2,dollar_c1),multiplication(dollar_c2,c(dollar_c1))),multiplication(c(dollar_c2),dollar_c1)),multiplication(c(dollar_c2),c(dollar_c1))),
file('KLE009+1.p',unknown),
[] ).
cnf(12,plain,
addition(addition(addition(multiplication(dollar_c2,dollar_c1),multiplication(dollar_c2,c(dollar_c1))),multiplication(c(dollar_c2),dollar_c1)),multiplication(c(dollar_c2),c(dollar_c1))) != one,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[11])]),
[iquote('copy,11,flip.1')] ).
cnf(14,axiom,
A = A,
file('KLE009+1.p',unknown),
[] ).
cnf(15,axiom,
addition(A,B) = addition(B,A),
file('KLE009+1.p',unknown),
[] ).
cnf(16,axiom,
addition(A,addition(B,C)) = addition(addition(A,B),C),
file('KLE009+1.p',unknown),
[] ).
cnf(18,plain,
addition(addition(A,B),C) = addition(A,addition(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[16])]),
[iquote('copy,16,flip.1')] ).
cnf(29,axiom,
multiplication(one,A) = A,
file('KLE009+1.p',unknown),
[] ).
cnf(32,axiom,
multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
file('KLE009+1.p',unknown),
[] ).
cnf(39,axiom,
test(dollar_c1),
file('KLE009+1.p',unknown),
[] ).
cnf(40,axiom,
test(dollar_c2),
file('KLE009+1.p',unknown),
[] ).
cnf(41,plain,
addition(multiplication(dollar_c2,dollar_c1),addition(multiplication(dollar_c2,c(dollar_c1)),addition(multiplication(c(dollar_c2),dollar_c1),multiplication(c(dollar_c2),c(dollar_c1))))) != one,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[12]),18,18,18]),
[iquote('back_demod,12,demod,18,18,18')] ).
cnf(44,plain,
complement(dollar_f1(dollar_c1),dollar_c1),
inference(hyper,[status(thm)],[39,3]),
[iquote('hyper,39,3')] ).
cnf(45,plain,
complement(dollar_c2,c(dollar_c2)),
inference(hyper,[status(thm)],[40,9,14]),
[iquote('hyper,40,9,14')] ).
cnf(46,plain,
complement(dollar_f1(dollar_c2),dollar_c2),
inference(hyper,[status(thm)],[40,3]),
[iquote('hyper,40,3')] ).
cnf(56,plain,
( addition(A,B) = one
| ~ complement(A,B) ),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[15,7])]),
[iquote('para_into,15.1.1,7.2.1,flip.1')] ).
cnf(58,plain,
( complement(A,B)
| multiplication(B,A) != zero
| multiplication(A,B) != zero
| addition(A,B) != one ),
inference(para_from,[status(thm),theory(equality)],[15,8]),
[iquote('para_from,15.1.1,8.4.1')] ).
cnf(60,plain,
addition(dollar_c1,dollar_f1(dollar_c1)) = one,
inference(hyper,[status(thm)],[44,7]),
[iquote('hyper,44,7')] ).
cnf(62,plain,
multiplication(dollar_f1(dollar_c1),dollar_c1) = zero,
inference(hyper,[status(thm)],[44,6]),
[iquote('hyper,44,6')] ).
cnf(65,plain,
multiplication(dollar_c1,dollar_f1(dollar_c1)) = zero,
inference(hyper,[status(thm)],[44,5]),
[iquote('hyper,44,5')] ).
cnf(66,plain,
addition(c(dollar_c2),dollar_c2) = one,
inference(hyper,[status(thm)],[45,7]),
[iquote('hyper,45,7')] ).
cnf(75,plain,
addition(dollar_c2,dollar_f1(dollar_c2)) = one,
inference(hyper,[status(thm)],[46,7]),
[iquote('hyper,46,7')] ).
cnf(78,plain,
multiplication(dollar_f1(dollar_c2),dollar_c2) = zero,
inference(hyper,[status(thm)],[46,6]),
[iquote('hyper,46,6')] ).
cnf(80,plain,
multiplication(dollar_c2,dollar_f1(dollar_c2)) = zero,
inference(hyper,[status(thm)],[46,5]),
[iquote('hyper,46,5')] ).
cnf(195,plain,
addition(multiplication(dollar_c2,dollar_c1),addition(multiplication(c(dollar_c2),dollar_c1),addition(multiplication(c(dollar_c2),c(dollar_c1)),multiplication(dollar_c2,c(dollar_c1))))) != one,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[41,15]),18]),
[iquote('para_into,41.1.1.2,15.1.1,demod,18')] ).
cnf(213,plain,
addition(dollar_f1(dollar_c1),dollar_c1) = one,
inference(para_into,[status(thm),theory(equality)],[60,15]),
[iquote('para_into,60.1.1,15.1.1')] ).
cnf(224,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)],[62,8]),65,213]),14,14,14]),
[iquote('para_from,62.1.1,8.2.1,demod,65,213,unit_del,14,14,14')] ).
cnf(229,plain,
c(dollar_c1) = dollar_f1(dollar_c1),
inference(hyper,[status(thm)],[224,10,39]),
[iquote('hyper,224,10,39')] ).
cnf(245,plain,
addition(multiplication(dollar_c2,dollar_c1),addition(multiplication(c(dollar_c2),dollar_c1),addition(multiplication(c(dollar_c2),dollar_f1(dollar_c1)),multiplication(dollar_c2,dollar_f1(dollar_c1))))) != one,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[195]),229,229]),
[iquote('back_demod,195,demod,229,229')] ).
cnf(284,plain,
( addition(A,addition(B,C)) = one
| ~ complement(addition(A,B),C) ),
inference(para_into,[status(thm),theory(equality)],[56,18]),
[iquote('para_into,56.1.1,17.1.1')] ).
cnf(296,plain,
addition(multiplication(c(dollar_c2),A),multiplication(dollar_c2,A)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[66,32]),29])]),
[iquote('para_from,66.1.1,32.1.1.1,demod,29,flip.1')] ).
cnf(300,plain,
addition(multiplication(dollar_c2,dollar_c1),addition(multiplication(c(dollar_c2),dollar_c1),dollar_f1(dollar_c1))) != one,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[245]),296]),
[iquote('back_demod,245,demod,296')] ).
cnf(339,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)],[75,32]),29])]),
[iquote('para_from,75.1.1,32.1.1.1,demod,29,flip.1')] ).
cnf(351,plain,
complement(dollar_c2,dollar_f1(dollar_c2)),
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[58,75]),78,80]),14,14,14]),
[iquote('para_into,58.4.1,75.1.1,demod,78,80,unit_del,14,14,14')] ).
cnf(356,plain,
c(dollar_c2) = dollar_f1(dollar_c2),
inference(hyper,[status(thm)],[351,10,40]),
[iquote('hyper,351,10,40')] ).
cnf(378,plain,
addition(multiplication(dollar_c2,dollar_c1),addition(multiplication(dollar_f1(dollar_c2),dollar_c1),dollar_f1(dollar_c1))) != one,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[300]),356]),
[iquote('back_demod,300,demod,356')] ).
cnf(3398,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[378,284]),339]),14,224]),
[iquote('para_into,378.1.1,284.1.1,demod,339,unit_del,14,224')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.11 % Problem : KLE009+1 : TPTP v8.1.0. Released v4.0.0.
% 0.01/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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:35:15 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 sandbox2 on n025.cluster.edu,
% 1.96/2.14 Wed Jul 27 06:35:15 2022
% 1.96/2.14 The command was "./otter". The process ID is 27562.
% 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 (test(X0)<-> (exists X1 complement(X1,X0))).
% 1.96/2.14 all X0 X1 (complement(X1,X0)<->multiplication(X0,X1)=zero&multiplication(X1,X0)=zero&addition(X0,X1)=one).
% 1.96/2.14 all X0 X1 (test(X0)-> (c(X0)=X1<->complement(X0,X1))).
% 1.96/2.14 all X0 (-test(X0)->c(X0)=zero).
% 1.96/2.14 -(all X0 X1 (test(X1)&test(X0)->one=addition(addition(addition(multiplication(X0,X1),multiplication(X0,c(X1))),multiplication(c(X0),X1)),multiplication(c(X0),c(X1))))).
% 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 [] -test(X0)|complement($f1(X0),X0).
% 1.96/2.14 0 [] test(X0)| -complement(X1,X0).
% 1.96/2.14 0 [] -complement(X1,X0)|multiplication(X0,X1)=zero.
% 1.96/2.14 0 [] -complement(X1,X0)|multiplication(X1,X0)=zero.
% 1.96/2.14 0 [] -complement(X1,X0)|addition(X0,X1)=one.
% 1.96/2.14 0 [] complement(X1,X0)|multiplication(X0,X1)!=zero|multiplication(X1,X0)!=zero|addition(X0,X1)!=one.
% 1.96/2.14 0 [] -test(X0)|c(X0)!=X1|complement(X0,X1).
% 1.96/2.14 0 [] -test(X0)|c(X0)=X1| -complement(X0,X1).
% 1.96/2.14 0 [] test(X0)|c(X0)=zero.
% 1.96/2.14 0 [] test($c1).
% 1.96/2.14 0 [] test($c2).
% 1.96/2.14 0 [] one!=addition(addition(addition(multiplication($c2,$c1),multiplication($c2,c($c1))),multiplication(c($c2),$c1)),multiplication(c($c2),c($c1))).
% 1.96/2.14 end_of_list.
% 1.96/2.14
% 1.96/2.14 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.96/2.14
% 1.96/2.14 This ia a non-Horn set with equality. The strategy will be
% 1.96/2.14 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.96/2.14 deletion, with positive clauses in sos and nonpositive
% 1.96/2.14 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: set(unit_deletion).
% 1.96/2.14 dependent: set(factor).
% 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=6): 3 [] -test(A)|complement($f1(A),A).
% 1.96/2.14 ** KEPT (pick-wt=5): 4 [] test(A)| -complement(B,A).
% 1.96/2.14 ** KEPT (pick-wt=8): 5 [] -complement(A,B)|multiplication(B,A)=zero.
% 1.96/2.14 ** KEPT (pick-wt=8): 6 [] -complement(A,B)|multiplication(A,B)=zero.
% 3.34/3.50 ** KEPT (pick-wt=8): 7 [] -complement(A,B)|addition(B,A)=one.
% 3.34/3.50 ** KEPT (pick-wt=18): 8 [] complement(A,B)|multiplication(B,A)!=zero|multiplication(A,B)!=zero|addition(B,A)!=one.
% 3.34/3.50 ** KEPT (pick-wt=9): 9 [] -test(A)|c(A)!=B|complement(A,B).
% 3.34/3.50 ** KEPT (pick-wt=9): 10 [] -test(A)|c(A)=B| -complement(A,B).
% 3.34/3.50 ** KEPT (pick-wt=21): 12 [copy,11,flip.1] addition(addition(addition(multiplication($c2,$c1),multiplication($c2,c($c1))),multiplication(c($c2),$c1)),multiplication(c($c2),c($c1)))!=one.
% 3.34/3.50
% 3.34/3.50 ------------> process sos:
% 3.34/3.50 ** KEPT (pick-wt=3): 14 [] A=A.
% 3.34/3.50 ** KEPT (pick-wt=7): 15 [] addition(A,B)=addition(B,A).
% 3.34/3.50 ** KEPT (pick-wt=11): 17 [copy,16,flip.1] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 3.34/3.50 ---> New Demodulator: 18 [new_demod,17] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 3.34/3.50 ** KEPT (pick-wt=5): 19 [] addition(A,zero)=A.
% 3.34/3.50 ---> New Demodulator: 20 [new_demod,19] addition(A,zero)=A.
% 3.34/3.50 ** KEPT (pick-wt=5): 21 [] addition(A,A)=A.
% 3.34/3.50 ---> New Demodulator: 22 [new_demod,21] addition(A,A)=A.
% 3.34/3.50 ** KEPT (pick-wt=11): 24 [copy,23,flip.1] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 3.34/3.50 ---> New Demodulator: 25 [new_demod,24] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 3.34/3.50 ** KEPT (pick-wt=5): 26 [] multiplication(A,one)=A.
% 3.34/3.50 ---> New Demodulator: 27 [new_demod,26] multiplication(A,one)=A.
% 3.34/3.50 ** KEPT (pick-wt=5): 28 [] multiplication(one,A)=A.
% 3.34/3.50 ---> New Demodulator: 29 [new_demod,28] multiplication(one,A)=A.
% 3.34/3.50 ** KEPT (pick-wt=13): 30 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 3.34/3.50 ---> New Demodulator: 31 [new_demod,30] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 3.34/3.50 ** KEPT (pick-wt=13): 32 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 3.34/3.50 ---> New Demodulator: 33 [new_demod,32] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 3.34/3.50 ** KEPT (pick-wt=5): 34 [] multiplication(A,zero)=zero.
% 3.34/3.50 ---> New Demodulator: 35 [new_demod,34] multiplication(A,zero)=zero.
% 3.34/3.50 ** KEPT (pick-wt=5): 36 [] multiplication(zero,A)=zero.
% 3.34/3.50 ---> New Demodulator: 37 [new_demod,36] multiplication(zero,A)=zero.
% 3.34/3.50 ** KEPT (pick-wt=6): 38 [] test(A)|c(A)=zero.
% 3.34/3.50 ** KEPT (pick-wt=2): 39 [] test($c1).
% 3.34/3.50 ** KEPT (pick-wt=2): 40 [] test($c2).
% 3.34/3.50 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] A=A.
% 3.34/3.50 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] addition(A,B)=addition(B,A).
% 3.34/3.50 >>>> Starting back demodulation with 18.
% 3.34/3.50 >> back demodulating 12 with 18.
% 3.34/3.50 >>>> Starting back demodulation with 20.
% 3.34/3.50 >>>> Starting back demodulation with 22.
% 3.34/3.50 >> back demodulating 13 with 22.
% 3.34/3.50 >>>> Starting back demodulation with 25.
% 3.34/3.50 >>>> Starting back demodulation with 27.
% 3.34/3.50 >>>> Starting back demodulation with 29.
% 3.34/3.50 >>>> Starting back demodulation with 31.
% 3.34/3.50 >>>> Starting back demodulation with 33.
% 3.34/3.50 >>>> Starting back demodulation with 35.
% 3.34/3.50 >>>> Starting back demodulation with 37.
% 3.34/3.50
% 3.34/3.50 ======= end of input processing =======
% 3.34/3.50
% 3.34/3.50 =========== start of search ===========
% 3.34/3.50
% 3.34/3.50
% 3.34/3.50 Resetting weight limit to 7.
% 3.34/3.50
% 3.34/3.50
% 3.34/3.50 Resetting weight limit to 7.
% 3.34/3.50
% 3.34/3.50 sos_size=2426
% 3.34/3.50
% 3.34/3.50 -------- PROOF --------
% 3.34/3.50
% 3.34/3.50 -----> EMPTY CLAUSE at 1.35 sec ----> 3398 [para_into,378.1.1,284.1.1,demod,339,unit_del,14,224] $F.
% 3.34/3.50
% 3.34/3.50 Length of proof is 27. Level of proof is 8.
% 3.34/3.50
% 3.34/3.50 ---------------- PROOF ----------------
% 3.34/3.50 % SZS status Theorem
% 3.34/3.50 % SZS output start Refutation
% See solution above
% 3.34/3.50 ------------ end of proof -------------
% 3.34/3.50
% 3.34/3.50
% 3.34/3.50 Search stopped by max_proofs option.
% 3.34/3.50
% 3.34/3.50
% 3.34/3.50 Search stopped by max_proofs option.
% 3.34/3.50
% 3.34/3.50 ============ end of search ============
% 3.34/3.50
% 3.34/3.50 -------------- statistics -------------
% 3.34/3.50 clauses given 506
% 3.34/3.50 clauses generated 47170
% 3.34/3.50 clauses kept 3245
% 3.34/3.50 clauses forward subsumed 13098
% 3.34/3.50 clauses back subsumed 877
% 3.34/3.50 Kbytes malloced 4882
% 3.34/3.50
% 3.34/3.50 ----------- times (seconds) -----------
% 3.34/3.50 user CPU time 1.35 (0 hr, 0 min, 1 sec)
% 3.34/3.50 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 3.34/3.50 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.34/3.50
% 3.34/3.50 That finishes the proof of the theorem.
% 3.34/3.50
% 3.34/3.50 Process 27562 finished Wed Jul 27 06:35:18 2022
% 3.34/3.50 Otter interrupted
% 3.34/3.50 PROOF FOUND
%------------------------------------------------------------------------------