%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUN085+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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:10:33 EDT 2022
% Result : Theorem 1.80s 1.98s
% Output : Refutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 27
% Syntax : Number of clauses : 67 ( 59 unt; 0 nHn; 27 RR)
% Number of literals : 76 ( 34 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 6 con; 0-2 aty)
% Number of variables : 72 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ r1(A)
| A = dollar_c1 ),
file('NUN085+2.p',unknown),
[] ).
cnf(2,axiom,
( A != dollar_c1
| r1(A) ),
file('NUN085+2.p',unknown),
[] ).
cnf(3,axiom,
( ~ r2(A,B)
| B = dollar_f1(A) ),
file('NUN085+2.p',unknown),
[] ).
cnf(5,axiom,
( ~ r3(A,B,C)
| C = dollar_f2(A,B) ),
file('NUN085+2.p',unknown),
[] ).
cnf(7,axiom,
( ~ r4(A,B,C)
| C = dollar_f3(A,B) ),
file('NUN085+2.p',unknown),
[] ).
cnf(10,axiom,
( ~ r1(A)
| A != B
| ~ r2(C,B) ),
file('NUN085+2.p',unknown),
[] ).
cnf(12,axiom,
A = A,
file('NUN085+2.p',unknown),
[] ).
cnf(13,axiom,
r2(A,dollar_f4(B,A)),
file('NUN085+2.p',unknown),
[] ).
cnf(14,axiom,
r3(A,dollar_f4(A,B),dollar_f5(A,B)),
file('NUN085+2.p',unknown),
[] ).
cnf(15,axiom,
dollar_f5(A,B) = dollar_f7(A,B),
file('NUN085+2.p',unknown),
[] ).
cnf(17,plain,
dollar_f7(A,B) = dollar_f5(A,B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[15])]),
[iquote('copy,15,flip.1')] ).
cnf(18,axiom,
r2(dollar_f6(A,B),dollar_f7(A,B)),
file('NUN085+2.p',unknown),
[] ).
cnf(19,plain,
r2(dollar_f6(A,B),dollar_f5(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[18]),17]),
[iquote('copy,18,demod,17')] ).
cnf(20,axiom,
r3(A,B,dollar_f6(A,B)),
file('NUN085+2.p',unknown),
[] ).
cnf(25,axiom,
r3(dollar_f10(A,B),A,dollar_f11(A,B)),
file('NUN085+2.p',unknown),
[] ).
cnf(26,axiom,
r4(A,B,dollar_f10(A,B)),
file('NUN085+2.p',unknown),
[] ).
cnf(27,axiom,
r1(dollar_f12(A)),
file('NUN085+2.p',unknown),
[] ).
cnf(28,axiom,
r3(A,dollar_f12(A),dollar_f13(A)),
file('NUN085+2.p',unknown),
[] ).
cnf(30,axiom,
dollar_f13(A) = A,
file('NUN085+2.p',unknown),
[] ).
cnf(31,axiom,
r1(dollar_f14(A)),
file('NUN085+2.p',unknown),
[] ).
cnf(32,axiom,
r4(A,dollar_f14(A),dollar_f16(A)),
file('NUN085+2.p',unknown),
[] ).
cnf(33,axiom,
r1(dollar_f15(A)),
file('NUN085+2.p',unknown),
[] ).
cnf(35,axiom,
dollar_f16(A) = dollar_f15(A),
file('NUN085+2.p',unknown),
[] ).
cnf(43,axiom,
r1(dollar_c2),
file('NUN085+2.p',unknown),
[] ).
cnf(44,axiom,
r3(dollar_c2,dollar_c4,dollar_c6),
file('NUN085+2.p',unknown),
[] ).
cnf(45,axiom,
r1(dollar_c3),
file('NUN085+2.p',unknown),
[] ).
cnf(46,axiom,
r2(dollar_c3,dollar_c4),
file('NUN085+2.p',unknown),
[] ).
cnf(48,axiom,
dollar_c6 = dollar_c5,
file('NUN085+2.p',unknown),
[] ).
cnf(49,axiom,
r1(dollar_c5),
file('NUN085+2.p',unknown),
[] ).
cnf(51,plain,
r3(A,dollar_f12(A),A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[28]),30]),
[iquote('back_demod,28,demod,30')] ).
cnf(52,plain,
r4(A,dollar_f14(A),dollar_f15(A)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[32]),35]),
[iquote('back_demod,32,demod,35')] ).
cnf(53,plain,
r3(dollar_c2,dollar_c4,dollar_c5),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[44]),48]),
[iquote('back_demod,44,demod,48')] ).
cnf(57,plain,
r1(dollar_c1),
inference(hyper,[status(thm)],[12,2]),
[iquote('hyper,12,2')] ).
cnf(59,plain,
dollar_c2 = dollar_c1,
inference(hyper,[status(thm)],[43,1]),
[iquote('hyper,43,1')] ).
cnf(60,plain,
r3(dollar_c1,dollar_c4,dollar_c5),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[53]),59]),
[iquote('back_demod,53,demod,59')] ).
cnf(62,plain,
dollar_c3 = dollar_c1,
inference(hyper,[status(thm)],[45,1]),
[iquote('hyper,45,1')] ).
cnf(63,plain,
r2(dollar_c1,dollar_c4),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[46]),62]),
[iquote('back_demod,46,demod,62')] ).
cnf(65,plain,
dollar_c5 = dollar_c1,
inference(hyper,[status(thm)],[49,1]),
[iquote('hyper,49,1')] ).
cnf(66,plain,
r3(dollar_c1,dollar_c4,dollar_c1),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[60]),65]),
[iquote('back_demod,60,demod,65')] ).
cnf(73,plain,
dollar_f4(A,B) = dollar_f1(B),
inference(hyper,[status(thm)],[13,3]),
[iquote('hyper,13,3')] ).
cnf(74,plain,
dollar_f1(A) = dollar_f4(B,A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[73])]),
[iquote('copy,73,flip.1')] ).
cnf(81,plain,
dollar_f12(A) = dollar_c1,
inference(hyper,[status(thm)],[27,1]),
[iquote('hyper,27,1')] ).
cnf(82,plain,
r3(A,dollar_c1,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[51]),81]),
[iquote('back_demod,51,demod,81')] ).
cnf(84,plain,
dollar_f14(A) = dollar_c1,
inference(hyper,[status(thm)],[31,1]),
[iquote('hyper,31,1')] ).
cnf(85,plain,
r4(A,dollar_c1,dollar_f15(A)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[52]),84]),
[iquote('back_demod,52,demod,84')] ).
cnf(87,plain,
dollar_f15(A) = dollar_c1,
inference(hyper,[status(thm)],[33,1]),
[iquote('hyper,33,1')] ).
cnf(88,plain,
r4(A,dollar_c1,dollar_c1),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[85]),87]),
[iquote('back_demod,85,demod,87')] ).
cnf(96,plain,
dollar_f5(A,B) = dollar_f2(A,dollar_f4(A,B)),
inference(hyper,[status(thm)],[14,5]),
[iquote('hyper,14,5')] ).
cnf(97,plain,
r2(dollar_f6(A,B),dollar_f2(A,dollar_f4(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[19]),96]),
[iquote('back_demod,19,demod,96')] ).
cnf(100,plain,
dollar_f1(dollar_c1) = dollar_c4,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[63,3])]),
[iquote('hyper,63,3,flip.1')] ).
cnf(112,plain,
dollar_f6(A,B) = dollar_f2(A,B),
inference(hyper,[status(thm)],[20,5]),
[iquote('hyper,20,5')] ).
cnf(113,plain,
r2(dollar_f2(A,B),dollar_f2(A,dollar_f4(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[97]),112]),
[iquote('back_demod,97,demod,112')] ).
cnf(117,plain,
( dollar_f1(A) = B
| ~ r2(A,B) ),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[30,3]),30]),
[iquote('para_into,29.1.1,3.2.1,demod,30')] ).
cnf(124,plain,
dollar_f2(dollar_c1,dollar_c4) = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[66,5])]),
[iquote('hyper,66,5,flip.1')] ).
cnf(146,plain,
dollar_f2(A,dollar_c1) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[82,5])]),
[iquote('hyper,82,5,flip.1')] ).
cnf(151,plain,
dollar_f3(A,dollar_c1) = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[88,7])]),
[iquote('hyper,88,7,flip.1')] ).
cnf(228,plain,
dollar_f3(A,B) = dollar_f10(A,B),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[26,7])]),
[iquote('hyper,26,7,flip.1')] ).
cnf(247,plain,
dollar_f10(A,dollar_c1) = dollar_c1,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[151]),228]),
[iquote('back_demod,151,demod,228')] ).
cnf(276,plain,
r3(dollar_c1,A,dollar_f11(A,dollar_c1)),
inference(para_from,[status(thm),theory(equality)],[247,25]),
[iquote('para_from,247.1.1,25.1.1')] ).
cnf(321,plain,
dollar_f4(A,dollar_c1) = dollar_c4,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[74,100])]),
[iquote('para_into,74.1.1,100.1.1,flip.1')] ).
cnf(457,plain,
dollar_f2(dollar_c1,A) = dollar_f11(A,dollar_c1),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[276,5])]),
[iquote('hyper,276,5,flip.1')] ).
cnf(463,plain,
dollar_f11(dollar_c4,dollar_c1) = dollar_c1,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[124]),457]),
[iquote('back_demod,124,demod,457')] ).
cnf(680,plain,
( A = dollar_c4
| ~ r2(dollar_c1,A) ),
inference(para_from,[status(thm),theory(equality)],[117,100]),
[iquote('para_from,117.1.1,100.1.1')] ).
cnf(1257,plain,
r2(A,dollar_f2(A,dollar_c4)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[113,146]),321]),
[iquote('para_into,113.1.1,145.1.1,demod,321')] ).
cnf(1279,plain,
dollar_c4 = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[1257,680]),457,463])]),
[iquote('hyper,1257,680,demod,457,463,flip.1')] ).
cnf(1293,plain,
r2(A,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1257]),1279,146]),
[iquote('back_demod,1257,demod,1279,146')] ).
cnf(1672,plain,
$false,
inference(hyper,[status(thm)],[1293,10,57,12]),
[iquote('hyper,1293,10,57,12')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUN085+2 : TPTP v8.1.0. Released v7.3.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n012.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 02:36:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.62/1.83 ----- Otter 3.3f, August 2004 -----
% 1.62/1.83 The process was started by sandbox2 on n012.cluster.edu,
% 1.62/1.83 Wed Jul 27 02:36:35 2022
% 1.62/1.83 The command was "./otter". The process ID is 1260.
% 1.62/1.83
% 1.62/1.83 set(prolog_style_variables).
% 1.62/1.83 set(auto).
% 1.62/1.83 dependent: set(auto1).
% 1.62/1.83 dependent: set(process_input).
% 1.62/1.83 dependent: clear(print_kept).
% 1.62/1.83 dependent: clear(print_new_demod).
% 1.62/1.83 dependent: clear(print_back_demod).
% 1.62/1.83 dependent: clear(print_back_sub).
% 1.62/1.83 dependent: set(control_memory).
% 1.62/1.83 dependent: assign(max_mem, 12000).
% 1.62/1.83 dependent: assign(pick_given_ratio, 4).
% 1.62/1.83 dependent: assign(stats_level, 1).
% 1.62/1.83 dependent: assign(max_seconds, 10800).
% 1.62/1.83 clear(print_given).
% 1.62/1.83
% 1.62/1.83 formula_list(usable).
% 1.62/1.83 all A (A=A).
% 1.62/1.83 exists Y24 all X19 (-r1(X19)&X19!=Y24|r1(X19)&X19=Y24).
% 1.62/1.83 all X11 exists Y21 all X12 (-r2(X11,X12)&X12!=Y21|r2(X11,X12)&X12=Y21).
% 1.62/1.83 all X13 X14 exists Y22 all X15 (-r3(X13,X14,X15)&X15!=Y22|r3(X13,X14,X15)&X15=Y22).
% 1.62/1.83 all X16 X17 exists Y23 all X18 (-r4(X16,X17,X18)&X18!=Y23|r4(X16,X17,X18)&X18=Y23).
% 1.62/1.83 all X1 X8 exists Y4 ((exists Y5 ((exists Y15 (r2(X8,Y15)&r3(X1,Y15,Y5)))&Y5=Y4))& (exists Y7 (r2(Y7,Y4)&r3(X1,X8,Y7)))).
% 1.62/1.83 all X2 X9 exists Y2 ((exists Y3 ((exists Y14 (r2(X9,Y14)&r4(X2,Y14,Y3)))&Y3=Y2))& (exists Y6 (r3(Y6,X2,Y2)&r4(X2,X9,Y6)))).
% 1.62/1.83 all X3 X10 ((all Y12 ((all Y13 (-r2(X3,Y13)|Y13!=Y12))| -r2(X10,Y12)))|X3=X10).
% 1.62/1.83 all X4 exists Y9 ((exists Y16 (r1(Y16)&r3(X4,Y16,Y9)))&Y9=X4).
% 1.62/1.83 all X5 exists Y8 ((exists Y17 (r1(Y17)&r4(X5,Y17,Y8)))& (exists Y18 (r1(Y18)&Y8=Y18))).
% 1.62/1.83 all X6 ((exists Y19 (r1(Y19)&X6=Y19))| (exists Y1 Y11 (r2(Y1,Y11)&X6=Y11))).
% 1.62/1.83 all X7 Y10 ((all Y20 (-r1(Y20)|Y20!=Y10))| -r2(X7,Y10)).
% 1.62/1.83 -(all Y1 ((all Y2 ((all Y3 (-r1(Y3)| -r3(Y3,Y2,Y1)))| (all Y4 (-r1(Y4)| -r2(Y4,Y2)))))| (all Y5 (Y1!=Y5| -r1(Y5))))).
% 1.62/1.83 end_of_list.
% 1.62/1.83
% 1.62/1.83 -------> usable clausifies to:
% 1.62/1.83
% 1.62/1.83 list(usable).
% 1.62/1.83 0 [] A=A.
% 1.62/1.83 0 [] -r1(X19)|X19=$c1.
% 1.62/1.83 0 [] X19!=$c1|r1(X19).
% 1.62/1.83 0 [] -r2(X11,X12)|X12=$f1(X11).
% 1.62/1.83 0 [] X12!=$f1(X11)|r2(X11,X12).
% 1.62/1.83 0 [] -r3(X13,X14,X15)|X15=$f2(X13,X14).
% 1.62/1.83 0 [] X15!=$f2(X13,X14)|r3(X13,X14,X15).
% 1.62/1.83 0 [] -r4(X16,X17,X18)|X18=$f3(X16,X17).
% 1.62/1.83 0 [] X18!=$f3(X16,X17)|r4(X16,X17,X18).
% 1.62/1.83 0 [] r2(X8,$f4(X1,X8)).
% 1.62/1.83 0 [] r3(X1,$f4(X1,X8),$f5(X1,X8)).
% 1.62/1.83 0 [] $f5(X1,X8)=$f7(X1,X8).
% 1.62/1.83 0 [] r2($f6(X1,X8),$f7(X1,X8)).
% 1.62/1.83 0 [] r3(X1,X8,$f6(X1,X8)).
% 1.62/1.83 0 [] r2(X9,$f8(X2,X9)).
% 1.62/1.83 0 [] r4(X2,$f8(X2,X9),$f9(X2,X9)).
% 1.62/1.83 0 [] $f9(X2,X9)=$f11(X2,X9).
% 1.62/1.83 0 [] r3($f10(X2,X9),X2,$f11(X2,X9)).
% 1.62/1.83 0 [] r4(X2,X9,$f10(X2,X9)).
% 1.62/1.83 0 [] -r2(X3,Y13)|Y13!=Y12| -r2(X10,Y12)|X3=X10.
% 1.62/1.83 0 [] r1($f12(X4)).
% 1.62/1.83 0 [] r3(X4,$f12(X4),$f13(X4)).
% 1.62/1.83 0 [] $f13(X4)=X4.
% 1.62/1.83 0 [] r1($f14(X5)).
% 1.62/1.83 0 [] r4(X5,$f14(X5),$f16(X5)).
% 1.62/1.83 0 [] r1($f15(X5)).
% 1.62/1.83 0 [] $f16(X5)=$f15(X5).
% 1.62/1.83 0 [] r1($f17(X6))|r2($f19(X6),$f18(X6)).
% 1.62/1.83 0 [] r1($f17(X6))|X6=$f18(X6).
% 1.62/1.83 0 [] X6=$f17(X6)|r2($f19(X6),$f18(X6)).
% 1.62/1.83 0 [] X6=$f17(X6)|X6=$f18(X6).
% 1.62/1.83 0 [] -r1(Y20)|Y20!=Y10| -r2(X7,Y10).
% 1.62/1.83 0 [] r1($c2).
% 1.62/1.83 0 [] r3($c2,$c4,$c6).
% 1.62/1.83 0 [] r1($c3).
% 1.62/1.83 0 [] r2($c3,$c4).
% 1.62/1.83 0 [] $c6=$c5.
% 1.62/1.83 0 [] r1($c5).
% 1.62/1.83 end_of_list.
% 1.62/1.83
% 1.62/1.83 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.62/1.83
% 1.62/1.83 This ia a non-Horn set with equality. The strategy will be
% 1.62/1.83 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.62/1.83 deletion, with positive clauses in sos and nonpositive
% 1.62/1.83 clauses in usable.
% 1.62/1.84
% 1.62/1.84 dependent: set(knuth_bendix).
% 1.62/1.84 dependent: set(anl_eq).
% 1.62/1.84 dependent: set(para_from).
% 1.62/1.84 dependent: set(para_into).
% 1.62/1.84 dependent: clear(para_from_right).
% 1.62/1.84 dependent: clear(para_into_right).
% 1.62/1.84 dependent: set(para_from_vars).
% 1.62/1.84 dependent: set(eq_units_both_ways).
% 1.62/1.84 dependent: set(dynamic_demod_all).
% 1.62/1.84 dependent: set(dynamic_demod).
% 1.62/1.84 dependent: set(order_eq).
% 1.62/1.84 dependent: set(back_demod).
% 1.62/1.84 dependent: set(lrpo).
% 1.62/1.84 dependent: set(hyper_res).
% 1.62/1.84 dependent: set(unit_deletion).
% 1.62/1.84 dependent: set(factor).
% 1.62/1.84
% 1.62/1.84 ------------> process usable:
% 1.62/1.84 ** KEPT (pick-wt=5): 1 [] -r1(A)|A=$c1.
% 1.62/1.84 ** KEPT (pick-wt=5): 2 [] A!=$c1|r1(A).
% 1.62/1.84 ** KEPT (pick-wt=7): 3 [] -r2(A,B)|B=$f1(A).
% 1.62/1.84 ** KEPT (pick-wt=7): 4 [] A!=$f1(B)|r2(B,A).
% 1.62/1.84 ** KEPT (pick-wt=9): 5 [] -r3(A,B,C)|C=$f2(A,B).
% 1.62/1.84 ** KEPT (pick-wt=9): 6 [] A!=$f2(B,C)|r3(B,C,A).
% 1.62/1.84 ** KEPT (pick-wt=9): 7 [] -r4(A,B,C)|C=$f3(A,B).
% 1.62/1.84 ** KEPT (pick-wt=9): 8 [] A!=$f3(B,C)|r4(B,C,A).
% 1.62/1.84 ** KEPT (pick-wt=12): 9 [] -r2(A,B)|B!=C| -r2(D,C)|A=D.
% 1.62/1.84 ** KEPT (pick-wt=8): 10 [] -r1(A)|A!=B| -r2(C,B).
% 1.80/1.98
% 1.80/1.98 ------------> process sos:
% 1.80/1.98 ** KEPT (pick-wt=3): 12 [] A=A.
% 1.80/1.98 ** KEPT (pick-wt=5): 13 [] r2(A,$f4(B,A)).
% 1.80/1.98 ** KEPT (pick-wt=8): 14 [] r3(A,$f4(A,B),$f5(A,B)).
% 1.80/1.98 ** KEPT (pick-wt=7): 16 [copy,15,flip.1] $f7(A,B)=$f5(A,B).
% 1.80/1.98 ---> New Demodulator: 17 [new_demod,16] $f7(A,B)=$f5(A,B).
% 1.80/1.98 ** KEPT (pick-wt=7): 19 [copy,18,demod,17] r2($f6(A,B),$f5(A,B)).
% 1.80/1.98 ** KEPT (pick-wt=6): 20 [] r3(A,B,$f6(A,B)).
% 1.80/1.98 ** KEPT (pick-wt=5): 21 [] r2(A,$f8(B,A)).
% 1.80/1.98 ** KEPT (pick-wt=8): 22 [] r4(A,$f8(A,B),$f9(A,B)).
% 1.80/1.98 ** KEPT (pick-wt=7): 23 [] $f9(A,B)=$f11(A,B).
% 1.80/1.98 ---> New Demodulator: 24 [new_demod,23] $f9(A,B)=$f11(A,B).
% 1.80/1.98 ** KEPT (pick-wt=8): 25 [] r3($f10(A,B),A,$f11(A,B)).
% 1.80/1.98 ** KEPT (pick-wt=6): 26 [] r4(A,B,$f10(A,B)).
% 1.80/1.98 ** KEPT (pick-wt=3): 27 [] r1($f12(A)).
% 1.80/1.98 ** KEPT (pick-wt=6): 28 [] r3(A,$f12(A),$f13(A)).
% 1.80/1.98 ** KEPT (pick-wt=4): 29 [] $f13(A)=A.
% 1.80/1.98 ---> New Demodulator: 30 [new_demod,29] $f13(A)=A.
% 1.80/1.98 ** KEPT (pick-wt=3): 31 [] r1($f14(A)).
% 1.80/1.98 ** KEPT (pick-wt=6): 32 [] r4(A,$f14(A),$f16(A)).
% 1.80/1.98 ** KEPT (pick-wt=3): 33 [] r1($f15(A)).
% 1.80/1.98 ** KEPT (pick-wt=5): 34 [] $f16(A)=$f15(A).
% 1.80/1.98 ---> New Demodulator: 35 [new_demod,34] $f16(A)=$f15(A).
% 1.80/1.98 ** KEPT (pick-wt=8): 36 [] r1($f17(A))|r2($f19(A),$f18(A)).
% 1.80/1.98 ** KEPT (pick-wt=7): 38 [copy,37,flip.2] r1($f17(A))|$f18(A)=A.
% 1.80/1.98 ** KEPT (pick-wt=9): 40 [copy,39,flip.1] $f17(A)=A|r2($f19(A),$f18(A)).
% 1.80/1.98 ** KEPT (pick-wt=8): 42 [copy,41,flip.1,flip.2] $f17(A)=A|$f18(A)=A.
% 1.80/1.98 ** KEPT (pick-wt=2): 43 [] r1($c2).
% 1.80/1.98 ** KEPT (pick-wt=4): 44 [] r3($c2,$c4,$c6).
% 1.80/1.98 ** KEPT (pick-wt=2): 45 [] r1($c3).
% 1.80/1.98 ** KEPT (pick-wt=3): 46 [] r2($c3,$c4).
% 1.80/1.98 ** KEPT (pick-wt=3): 47 [] $c6=$c5.
% 1.80/1.98 ---> New Demodulator: 48 [new_demod,47] $c6=$c5.
% 1.80/1.98 ** KEPT (pick-wt=2): 49 [] r1($c5).
% 1.80/1.98 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] A=A.
% 1.80/1.98 12 back subsumes 11.
% 1.80/1.98 >>>> Starting back demodulation with 17.
% 1.80/1.98 >>>> Starting back demodulation with 24.
% 1.80/1.98 >> back demodulating 22 with 24.
% 1.80/1.98 >>>> Starting back demodulation with 30.
% 1.80/1.98 >> back demodulating 28 with 30.
% 1.80/1.98 >>>> Starting back demodulation with 35.
% 1.80/1.98 >> back demodulating 32 with 35.
% 1.80/1.98 >>>> Starting back demodulation with 48.
% 1.80/1.98 >> back demodulating 44 with 48.
% 1.80/1.98
% 1.80/1.98 ======= end of input processing =======
% 1.80/1.98
% 1.80/1.98 =========== start of search ===========
% 1.80/1.98
% 1.80/1.98 -------- PROOF --------
% 1.80/1.98
% 1.80/1.98 -----> EMPTY CLAUSE at 0.15 sec ----> 1672 [hyper,1293,10,57,12] $F.
% 1.80/1.98
% 1.80/1.98 Length of proof is 39. Level of proof is 10.
% 1.80/1.98
% 1.80/1.98 ---------------- PROOF ----------------
% 1.80/1.98 % SZS status Theorem
% 1.80/1.98 % SZS output start Refutation
% See solution above
% 1.80/1.98 ------------ end of proof -------------
% 1.80/1.98
% 1.80/1.98
% 1.80/1.98 Search stopped by max_proofs option.
% 1.80/1.98
% 1.80/1.98
% 1.80/1.98 Search stopped by max_proofs option.
% 1.80/1.98
% 1.80/1.98 ============ end of search ============
% 1.80/1.98
% 1.80/1.98 -------------- statistics -------------
% 1.80/1.98 clauses given 124
% 1.80/1.98 clauses generated 3098
% 1.80/1.98 clauses kept 1612
% 1.80/1.98 clauses forward subsumed 2566
% 1.80/1.98 clauses back subsumed 173
% 1.80/1.98 Kbytes malloced 2929
% 1.80/1.98
% 1.80/1.98 ----------- times (seconds) -----------
% 1.80/1.98 user CPU time 0.15 (0 hr, 0 min, 0 sec)
% 1.80/1.98 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.80/1.98 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.80/1.98
% 1.80/1.98 That finishes the proof of the theorem.
% 1.80/1.98
% 1.80/1.98 Process 1260 finished Wed Jul 27 02:36:37 2022
% 1.80/1.98 Otter interrupted
% 1.80/1.98 PROOF FOUND
%------------------------------------------------------------------------------