TSTP Solution File: NUN071+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUN071+2 : TPTP v8.1.0. Released v7.3.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:10:30 EDT 2022
% Result : Theorem 2.85s 3.05s
% Output : Refutation 2.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 24
% Syntax : Number of clauses : 58 ( 51 unt; 0 nHn; 9 RR)
% Number of literals : 72 ( 29 equ; 16 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 1 con; 0-2 aty)
% Number of variables : 97 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ r1(A)
| A = dollar_c1 ),
file('NUN071+2.p',unknown),
[] ).
cnf(2,axiom,
( A != dollar_c1
| r1(A) ),
file('NUN071+2.p',unknown),
[] ).
cnf(3,axiom,
( ~ r2(A,B)
| B = dollar_f1(A) ),
file('NUN071+2.p',unknown),
[] ).
cnf(5,axiom,
( ~ r3(A,B,C)
| C = dollar_f2(A,B) ),
file('NUN071+2.p',unknown),
[] ).
cnf(7,axiom,
( ~ r4(A,B,C)
| C = dollar_f3(A,B) ),
file('NUN071+2.p',unknown),
[] ).
cnf(11,axiom,
( ~ r4(A,A,B)
| ~ r1(C)
| ~ r2(C,A)
| B != D
| ~ r1(E)
| ~ r2(E,D) ),
file('NUN071+2.p',unknown),
[] ).
cnf(13,plain,
( ~ r4(A,A,B)
| ~ r1(C)
| ~ r2(C,A)
| B != D
| ~ r2(C,D) ),
inference(factor,[status(thm)],[11]),
[iquote('factor,11.2.5')] ).
cnf(15,axiom,
A = A,
file('NUN071+2.p',unknown),
[] ).
cnf(16,axiom,
r2(A,dollar_f4(B,A)),
file('NUN071+2.p',unknown),
[] ).
cnf(17,axiom,
r3(A,dollar_f4(A,B),dollar_f5(A,B)),
file('NUN071+2.p',unknown),
[] ).
cnf(18,axiom,
dollar_f5(A,B) = dollar_f7(A,B),
file('NUN071+2.p',unknown),
[] ).
cnf(20,plain,
dollar_f7(A,B) = dollar_f5(A,B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[18])]),
[iquote('copy,18,flip.1')] ).
cnf(21,axiom,
r2(dollar_f6(A,B),dollar_f7(A,B)),
file('NUN071+2.p',unknown),
[] ).
cnf(22,plain,
r2(dollar_f6(A,B),dollar_f5(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[21]),20]),
[iquote('copy,21,demod,20')] ).
cnf(23,axiom,
r3(A,B,dollar_f6(A,B)),
file('NUN071+2.p',unknown),
[] ).
cnf(24,axiom,
r2(A,dollar_f8(B,A)),
file('NUN071+2.p',unknown),
[] ).
cnf(25,axiom,
r4(A,dollar_f8(A,B),dollar_f9(A,B)),
file('NUN071+2.p',unknown),
[] ).
cnf(27,axiom,
dollar_f9(A,B) = dollar_f11(A,B),
file('NUN071+2.p',unknown),
[] ).
cnf(28,axiom,
r3(dollar_f10(A,B),A,dollar_f11(A,B)),
file('NUN071+2.p',unknown),
[] ).
cnf(29,axiom,
r4(A,B,dollar_f10(A,B)),
file('NUN071+2.p',unknown),
[] ).
cnf(30,axiom,
r1(dollar_f12(A)),
file('NUN071+2.p',unknown),
[] ).
cnf(31,axiom,
r3(A,dollar_f12(A),dollar_f13(A)),
file('NUN071+2.p',unknown),
[] ).
cnf(33,axiom,
dollar_f13(A) = A,
file('NUN071+2.p',unknown),
[] ).
cnf(34,axiom,
r1(dollar_f14(A)),
file('NUN071+2.p',unknown),
[] ).
cnf(35,axiom,
r4(A,dollar_f14(A),dollar_f16(A)),
file('NUN071+2.p',unknown),
[] ).
cnf(36,axiom,
r1(dollar_f15(A)),
file('NUN071+2.p',unknown),
[] ).
cnf(38,axiom,
dollar_f16(A) = dollar_f15(A),
file('NUN071+2.p',unknown),
[] ).
cnf(46,plain,
r4(A,dollar_f8(A,B),dollar_f11(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[25]),27]),
[iquote('back_demod,25,demod,27')] ).
cnf(47,plain,
r3(A,dollar_f12(A),A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[31]),33]),
[iquote('back_demod,31,demod,33')] ).
cnf(48,plain,
r4(A,dollar_f14(A),dollar_f15(A)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[35]),38]),
[iquote('back_demod,35,demod,38')] ).
cnf(52,plain,
r1(dollar_c1),
inference(hyper,[status(thm)],[15,2]),
[iquote('hyper,15,2')] ).
cnf(58,plain,
dollar_f12(A) = dollar_c1,
inference(hyper,[status(thm)],[30,1]),
[iquote('hyper,30,1')] ).
cnf(59,plain,
r3(A,dollar_c1,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[47]),58]),
[iquote('back_demod,47,demod,58')] ).
cnf(61,plain,
dollar_f14(A) = dollar_c1,
inference(hyper,[status(thm)],[34,1]),
[iquote('hyper,34,1')] ).
cnf(62,plain,
r4(A,dollar_c1,dollar_f15(A)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[48]),61]),
[iquote('back_demod,48,demod,61')] ).
cnf(64,plain,
dollar_f15(A) = dollar_c1,
inference(hyper,[status(thm)],[36,1]),
[iquote('hyper,36,1')] ).
cnf(65,plain,
r4(A,dollar_c1,dollar_c1),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[62]),64]),
[iquote('back_demod,62,demod,64')] ).
cnf(68,plain,
dollar_f4(A,B) = dollar_f1(B),
inference(hyper,[status(thm)],[16,3]),
[iquote('hyper,16,3')] ).
cnf(69,plain,
dollar_f1(A) = dollar_f4(B,A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[68])]),
[iquote('copy,68,flip.1')] ).
cnf(85,plain,
dollar_f2(A,dollar_c1) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[59,5])]),
[iquote('hyper,59,5,flip.1')] ).
cnf(92,plain,
dollar_f5(A,B) = dollar_f2(A,dollar_f4(A,B)),
inference(hyper,[status(thm)],[17,5]),
[iquote('hyper,17,5')] ).
cnf(93,plain,
r2(dollar_f6(A,B),dollar_f2(A,dollar_f4(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[22]),92]),
[iquote('back_demod,22,demod,92')] ).
cnf(96,plain,
dollar_f3(A,dollar_c1) = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[65,7])]),
[iquote('hyper,65,7,flip.1')] ).
cnf(107,plain,
dollar_f6(A,B) = dollar_f2(A,B),
inference(hyper,[status(thm)],[23,5]),
[iquote('hyper,23,5')] ).
cnf(108,plain,
r2(dollar_f2(A,B),dollar_f2(A,dollar_f4(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[93]),107]),
[iquote('back_demod,93,demod,107')] ).
cnf(109,plain,
dollar_f8(A,B) = dollar_f1(B),
inference(hyper,[status(thm)],[24,3]),
[iquote('hyper,24,3')] ).
cnf(110,plain,
dollar_f1(A) = dollar_f8(B,A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[109])]),
[iquote('copy,109,flip.1')] ).
cnf(135,plain,
dollar_f3(A,B) = dollar_f10(A,B),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[29,7])]),
[iquote('hyper,29,7,flip.1')] ).
cnf(146,plain,
dollar_f10(A,dollar_c1) = dollar_c1,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[96]),135]),
[iquote('back_demod,96,demod,135')] ).
cnf(174,plain,
r3(dollar_c1,A,dollar_f11(A,dollar_c1)),
inference(para_into,[status(thm),theory(equality)],[28,146]),
[iquote('para_into,28.1.1,146.1.1')] ).
cnf(216,plain,
dollar_f8(A,B) = dollar_f8(C,B),
inference(para_into,[status(thm),theory(equality)],[110,110]),
[iquote('para_into,110.1.1,110.1.1')] ).
cnf(217,plain,
dollar_f4(A,B) = dollar_f8(C,B),
inference(para_into,[status(thm),theory(equality)],[110,69]),
[iquote('para_into,110.1.1,69.1.1')] ).
cnf(247,plain,
dollar_f2(dollar_c1,A) = dollar_f11(A,dollar_c1),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[174,5])]),
[iquote('hyper,174,5,flip.1')] ).
cnf(422,plain,
r4(A,dollar_f8(B,C),dollar_f11(A,C)),
inference(para_from,[status(thm),theory(equality)],[216,46]),
[iquote('para_from,216.1.1,46.1.2')] ).
cnf(2332,plain,
r2(A,dollar_f2(A,dollar_f4(A,dollar_c1))),
inference(para_into,[status(thm),theory(equality)],[108,85]),
[iquote('para_into,108.1.1,85.1.1')] ).
cnf(2346,plain,
r2(A,dollar_f2(A,dollar_f8(B,dollar_c1))),
inference(para_into,[status(thm),theory(equality)],[2332,217]),
[iquote('para_into,2332.1.2.2,217.1.1')] ).
cnf(2355,plain,
r2(dollar_c1,dollar_f11(dollar_f8(A,dollar_c1),dollar_c1)),
inference(para_into,[status(thm),theory(equality)],[2346,247]),
[iquote('para_into,2346.1.2,247.1.1')] ).
cnf(2375,plain,
$false,
inference(hyper,[status(thm)],[422,13,52,24,15,2355]),
[iquote('hyper,422,13,52,24,15,2355')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUN071+2 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 02:34:15 EDT 2022
% 0.18/0.33 % CPUTime :
% 1.96/2.18 ----- Otter 3.3f, August 2004 -----
% 1.96/2.18 The process was started by sandbox2 on n013.cluster.edu,
% 1.96/2.18 Wed Jul 27 02:34:15 2022
% 1.96/2.18 The command was "./otter". The process ID is 4374.
% 1.96/2.18
% 1.96/2.18 set(prolog_style_variables).
% 1.96/2.18 set(auto).
% 1.96/2.18 dependent: set(auto1).
% 1.96/2.18 dependent: set(process_input).
% 1.96/2.18 dependent: clear(print_kept).
% 1.96/2.18 dependent: clear(print_new_demod).
% 1.96/2.18 dependent: clear(print_back_demod).
% 1.96/2.18 dependent: clear(print_back_sub).
% 1.96/2.18 dependent: set(control_memory).
% 1.96/2.18 dependent: assign(max_mem, 12000).
% 1.96/2.18 dependent: assign(pick_given_ratio, 4).
% 1.96/2.18 dependent: assign(stats_level, 1).
% 1.96/2.18 dependent: assign(max_seconds, 10800).
% 1.96/2.18 clear(print_given).
% 1.96/2.18
% 1.96/2.18 formula_list(usable).
% 1.96/2.18 all A (A=A).
% 1.96/2.18 exists Y24 all X19 (-r1(X19)&X19!=Y24|r1(X19)&X19=Y24).
% 1.96/2.18 all X11 exists Y21 all X12 (-r2(X11,X12)&X12!=Y21|r2(X11,X12)&X12=Y21).
% 1.96/2.18 all X13 X14 exists Y22 all X15 (-r3(X13,X14,X15)&X15!=Y22|r3(X13,X14,X15)&X15=Y22).
% 1.96/2.18 all X16 X17 exists Y23 all X18 (-r4(X16,X17,X18)&X18!=Y23|r4(X16,X17,X18)&X18=Y23).
% 1.96/2.18 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.96/2.18 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.96/2.18 all X3 X10 ((all Y12 ((all Y13 (-r2(X3,Y13)|Y13!=Y12))| -r2(X10,Y12)))|X3=X10).
% 1.96/2.18 all X4 exists Y9 ((exists Y16 (r1(Y16)&r3(X4,Y16,Y9)))&Y9=X4).
% 1.96/2.18 all X5 exists Y8 ((exists Y17 (r1(Y17)&r4(X5,Y17,Y8)))& (exists Y18 (r1(Y18)&Y8=Y18))).
% 1.96/2.18 all X6 ((exists Y19 (r1(Y19)&X6=Y19))| (exists Y1 Y11 (r2(Y1,Y11)&X6=Y11))).
% 1.96/2.18 all X7 Y10 ((all Y20 (-r1(Y20)|Y20!=Y10))| -r2(X7,Y10)).
% 1.96/2.18 -(exists Y1 ((exists Y2 (r4(Y2,Y2,Y1)& (exists Y4 (r1(Y4)&r2(Y4,Y2)))))& (exists Y3 (Y1=Y3& (exists Y5 (r1(Y5)&r2(Y5,Y3))))))).
% 1.96/2.18 end_of_list.
% 1.96/2.18
% 1.96/2.18 -------> usable clausifies to:
% 1.96/2.18
% 1.96/2.18 list(usable).
% 1.96/2.18 0 [] A=A.
% 1.96/2.18 0 [] -r1(X19)|X19=$c1.
% 1.96/2.18 0 [] X19!=$c1|r1(X19).
% 1.96/2.18 0 [] -r2(X11,X12)|X12=$f1(X11).
% 1.96/2.18 0 [] X12!=$f1(X11)|r2(X11,X12).
% 1.96/2.18 0 [] -r3(X13,X14,X15)|X15=$f2(X13,X14).
% 1.96/2.18 0 [] X15!=$f2(X13,X14)|r3(X13,X14,X15).
% 1.96/2.18 0 [] -r4(X16,X17,X18)|X18=$f3(X16,X17).
% 1.96/2.18 0 [] X18!=$f3(X16,X17)|r4(X16,X17,X18).
% 1.96/2.18 0 [] r2(X8,$f4(X1,X8)).
% 1.96/2.18 0 [] r3(X1,$f4(X1,X8),$f5(X1,X8)).
% 1.96/2.18 0 [] $f5(X1,X8)=$f7(X1,X8).
% 1.96/2.18 0 [] r2($f6(X1,X8),$f7(X1,X8)).
% 1.96/2.18 0 [] r3(X1,X8,$f6(X1,X8)).
% 1.96/2.18 0 [] r2(X9,$f8(X2,X9)).
% 1.96/2.18 0 [] r4(X2,$f8(X2,X9),$f9(X2,X9)).
% 1.96/2.18 0 [] $f9(X2,X9)=$f11(X2,X9).
% 1.96/2.18 0 [] r3($f10(X2,X9),X2,$f11(X2,X9)).
% 1.96/2.18 0 [] r4(X2,X9,$f10(X2,X9)).
% 1.96/2.18 0 [] -r2(X3,Y13)|Y13!=Y12| -r2(X10,Y12)|X3=X10.
% 1.96/2.18 0 [] r1($f12(X4)).
% 1.96/2.18 0 [] r3(X4,$f12(X4),$f13(X4)).
% 1.96/2.18 0 [] $f13(X4)=X4.
% 1.96/2.18 0 [] r1($f14(X5)).
% 1.96/2.18 0 [] r4(X5,$f14(X5),$f16(X5)).
% 1.96/2.18 0 [] r1($f15(X5)).
% 1.96/2.18 0 [] $f16(X5)=$f15(X5).
% 1.96/2.18 0 [] r1($f17(X6))|r2($f19(X6),$f18(X6)).
% 1.96/2.18 0 [] r1($f17(X6))|X6=$f18(X6).
% 1.96/2.18 0 [] X6=$f17(X6)|r2($f19(X6),$f18(X6)).
% 1.96/2.18 0 [] X6=$f17(X6)|X6=$f18(X6).
% 1.96/2.18 0 [] -r1(Y20)|Y20!=Y10| -r2(X7,Y10).
% 1.96/2.18 0 [] -r4(Y2,Y2,Y1)| -r1(Y4)| -r2(Y4,Y2)|Y1!=Y3| -r1(Y5)| -r2(Y5,Y3).
% 1.96/2.18 end_of_list.
% 1.96/2.18
% 1.96/2.18 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.96/2.18
% 1.96/2.18 This ia a non-Horn set with equality. The strategy will be
% 1.96/2.18 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.96/2.18 deletion, with positive clauses in sos and nonpositive
% 1.96/2.18 clauses in usable.
% 1.96/2.18
% 1.96/2.18 dependent: set(knuth_bendix).
% 1.96/2.18 dependent: set(anl_eq).
% 1.96/2.18 dependent: set(para_from).
% 1.96/2.18 dependent: set(para_into).
% 1.96/2.18 dependent: clear(para_from_right).
% 1.96/2.18 dependent: clear(para_into_right).
% 1.96/2.18 dependent: set(para_from_vars).
% 1.96/2.18 dependent: set(eq_units_both_ways).
% 1.96/2.18 dependent: set(dynamic_demod_all).
% 1.96/2.18 dependent: set(dynamic_demod).
% 1.96/2.18 dependent: set(order_eq).
% 1.96/2.18 dependent: set(back_demod).
% 1.96/2.18 dependent: set(lrpo).
% 1.96/2.18 dependent: set(hyper_res).
% 1.96/2.18 dependent: set(unit_deletion).
% 1.96/2.18 dependent: set(factor).
% 1.96/2.18
% 1.96/2.18 ------------> process usable:
% 1.96/2.18 ** KEPT (pick-wt=5): 1 [] -r1(A)|A=$c1.
% 1.96/2.18 ** KEPT (pick-wt=5): 2 [] A!=$c1|r1(A).
% 1.96/2.18 ** KEPT (pick-wt=7): 3 [] -r2(A,B)|B=$f1(A).
% 1.96/2.18 ** KEPT (pick-wt=7): 4 [] A!=$f1(B)|r2(B,A).
% 1.96/2.18 ** KEPT (pick-wt=9): 5 [] -r3(A,B,C)|C=$f2(A,B).
% 1.96/2.18 ** KEPT (pick-wt=9): 6 [] A!=$f2(B,C)|r3(B,C,A).
% 1.96/2.18 ** KEPT (pick-wt=9): 7 [] -r4(A,B,C)|C=$f3(A,B).
% 1.96/2.18 ** KEPT (pick-wt=9): 8 [] A!=$f3(B,C)|r4(B,C,A).
% 1.96/2.18 ** KEPT (pick-wt=12): 9 [] -r2(A,B)|B!=C| -r2(D,C)|A=D.
% 1.96/2.18 ** KEPT (pick-wt=8): 10 [] -r1(A)|A!=B| -r2(C,B).
% 1.96/2.18 ** KEPT (pick-wt=17): 11 [] -r4(A,A,B)| -r1(C)| -r2(C,A)|B!=D| -r1(E)| -r2(E,D).
% 2.85/3.05
% 2.85/3.05 ------------> process sos:
% 2.85/3.05 ** KEPT (pick-wt=3): 15 [] A=A.
% 2.85/3.05 ** KEPT (pick-wt=5): 16 [] r2(A,$f4(B,A)).
% 2.85/3.05 ** KEPT (pick-wt=8): 17 [] r3(A,$f4(A,B),$f5(A,B)).
% 2.85/3.05 ** KEPT (pick-wt=7): 19 [copy,18,flip.1] $f7(A,B)=$f5(A,B).
% 2.85/3.05 ---> New Demodulator: 20 [new_demod,19] $f7(A,B)=$f5(A,B).
% 2.85/3.05 ** KEPT (pick-wt=7): 22 [copy,21,demod,20] r2($f6(A,B),$f5(A,B)).
% 2.85/3.05 ** KEPT (pick-wt=6): 23 [] r3(A,B,$f6(A,B)).
% 2.85/3.05 ** KEPT (pick-wt=5): 24 [] r2(A,$f8(B,A)).
% 2.85/3.05 ** KEPT (pick-wt=8): 25 [] r4(A,$f8(A,B),$f9(A,B)).
% 2.85/3.05 ** KEPT (pick-wt=7): 26 [] $f9(A,B)=$f11(A,B).
% 2.85/3.05 ---> New Demodulator: 27 [new_demod,26] $f9(A,B)=$f11(A,B).
% 2.85/3.05 ** KEPT (pick-wt=8): 28 [] r3($f10(A,B),A,$f11(A,B)).
% 2.85/3.05 ** KEPT (pick-wt=6): 29 [] r4(A,B,$f10(A,B)).
% 2.85/3.05 ** KEPT (pick-wt=3): 30 [] r1($f12(A)).
% 2.85/3.05 ** KEPT (pick-wt=6): 31 [] r3(A,$f12(A),$f13(A)).
% 2.85/3.05 ** KEPT (pick-wt=4): 32 [] $f13(A)=A.
% 2.85/3.05 ---> New Demodulator: 33 [new_demod,32] $f13(A)=A.
% 2.85/3.05 ** KEPT (pick-wt=3): 34 [] r1($f14(A)).
% 2.85/3.05 ** KEPT (pick-wt=6): 35 [] r4(A,$f14(A),$f16(A)).
% 2.85/3.05 ** KEPT (pick-wt=3): 36 [] r1($f15(A)).
% 2.85/3.05 ** KEPT (pick-wt=5): 37 [] $f16(A)=$f15(A).
% 2.85/3.05 ---> New Demodulator: 38 [new_demod,37] $f16(A)=$f15(A).
% 2.85/3.05 ** KEPT (pick-wt=8): 39 [] r1($f17(A))|r2($f19(A),$f18(A)).
% 2.85/3.05 ** KEPT (pick-wt=7): 41 [copy,40,flip.2] r1($f17(A))|$f18(A)=A.
% 2.85/3.05 ** KEPT (pick-wt=9): 43 [copy,42,flip.1] $f17(A)=A|r2($f19(A),$f18(A)).
% 2.85/3.05 ** KEPT (pick-wt=8): 45 [copy,44,flip.1,flip.2] $f17(A)=A|$f18(A)=A.
% 2.85/3.05 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] A=A.
% 2.85/3.05 15 back subsumes 12.
% 2.85/3.05 >>>> Starting back demodulation with 20.
% 2.85/3.05 >>>> Starting back demodulation with 27.
% 2.85/3.05 >> back demodulating 25 with 27.
% 2.85/3.05 >>>> Starting back demodulation with 33.
% 2.85/3.05 >> back demodulating 31 with 33.
% 2.85/3.05 >>>> Starting back demodulation with 38.
% 2.85/3.05 >> back demodulating 35 with 38.
% 2.85/3.05
% 2.85/3.05 ======= end of input processing =======
% 2.85/3.05
% 2.85/3.05 =========== start of search ===========
% 2.85/3.05
% 2.85/3.05
% 2.85/3.05 Resetting weight limit to 8.
% 2.85/3.05
% 2.85/3.05
% 2.85/3.05 Resetting weight limit to 8.
% 2.85/3.05
% 2.85/3.05 sos_size=1965
% 2.85/3.05
% 2.85/3.05 -------- PROOF --------
% 2.85/3.05
% 2.85/3.05 -----> EMPTY CLAUSE at 0.86 sec ----> 2375 [hyper,422,13,52,24,15,2355] $F.
% 2.85/3.05
% 2.85/3.05 Length of proof is 33. Level of proof is 8.
% 2.85/3.05
% 2.85/3.05 ---------------- PROOF ----------------
% 2.85/3.05 % SZS status Theorem
% 2.85/3.05 % SZS output start Refutation
% See solution above
% 2.85/3.05 ------------ end of proof -------------
% 2.85/3.05
% 2.85/3.05
% 2.85/3.05 Search stopped by max_proofs option.
% 2.85/3.05
% 2.85/3.05
% 2.85/3.05 Search stopped by max_proofs option.
% 2.85/3.05
% 2.85/3.05 ============ end of search ============
% 2.85/3.05
% 2.85/3.05 -------------- statistics -------------
% 2.85/3.05 clauses given 185
% 2.85/3.05 clauses generated 15045
% 2.85/3.05 clauses kept 2319
% 2.85/3.05 clauses forward subsumed 5400
% 2.85/3.05 clauses back subsumed 50
% 2.85/3.05 Kbytes malloced 4882
% 2.85/3.05
% 2.85/3.05 ----------- times (seconds) -----------
% 2.85/3.05 user CPU time 0.86 (0 hr, 0 min, 0 sec)
% 2.85/3.05 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.85/3.05 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.85/3.05
% 2.85/3.05 That finishes the proof of the theorem.
% 2.85/3.05
% 2.85/3.05 Process 4374 finished Wed Jul 27 02:34:17 2022
% 2.85/3.05 Otter interrupted
% 2.85/3.05 PROOF FOUND
%------------------------------------------------------------------------------