TSTP Solution File: NUN068+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUN068+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:29 EDT 2022
% Result : Theorem 2.41s 2.59s
% Output : Refutation 2.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 20
% Syntax : Number of clauses : 48 ( 20 unt; 20 nHn; 10 RR)
% Number of literals : 81 ( 38 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 1 con; 0-2 aty)
% Number of variables : 62 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ r1(A)
| A = dollar_c1 ),
file('NUN068+2.p',unknown),
[] ).
cnf(2,axiom,
( A != dollar_c1
| r1(A) ),
file('NUN068+2.p',unknown),
[] ).
cnf(3,axiom,
( ~ r2(A,B)
| B = dollar_f1(A) ),
file('NUN068+2.p',unknown),
[] ).
cnf(4,axiom,
( A != dollar_f1(B)
| r2(B,A) ),
file('NUN068+2.p',unknown),
[] ).
cnf(9,axiom,
( ~ r2(A,B)
| B != C
| ~ r2(D,C)
| A = D ),
file('NUN068+2.p',unknown),
[] ).
cnf(10,axiom,
( ~ r1(A)
| A != B
| ~ r2(C,B) ),
file('NUN068+2.p',unknown),
[] ).
cnf(12,axiom,
A = A,
file('NUN068+2.p',unknown),
[] ).
cnf(13,axiom,
r2(A,dollar_f4(B,A)),
file('NUN068+2.p',unknown),
[] ).
cnf(21,axiom,
r2(A,dollar_f8(B,A)),
file('NUN068+2.p',unknown),
[] ).
cnf(30,axiom,
dollar_f13(A) = A,
file('NUN068+2.p',unknown),
[] ).
cnf(36,axiom,
( r1(dollar_f17(A))
| r2(dollar_f19(A),dollar_f18(A)) ),
file('NUN068+2.p',unknown),
[] ).
cnf(37,axiom,
( r1(dollar_f17(A))
| A = dollar_f18(A) ),
file('NUN068+2.p',unknown),
[] ).
cnf(38,plain,
( r1(dollar_f17(A))
| dollar_f18(A) = A ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[37])]),
[iquote('copy,37,flip.2')] ).
cnf(39,axiom,
( A = dollar_f17(A)
| r2(dollar_f19(A),dollar_f18(A)) ),
file('NUN068+2.p',unknown),
[] ).
cnf(40,plain,
( dollar_f17(A) = A
| r2(dollar_f19(A),dollar_f18(A)) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[39])]),
[iquote('copy,39,flip.1')] ).
cnf(41,axiom,
( A = dollar_f17(A)
| A = dollar_f18(A) ),
file('NUN068+2.p',unknown),
[] ).
cnf(42,plain,
( dollar_f17(A) = A
| dollar_f18(A) = A ),
inference(flip,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[41])])]),
[iquote('copy,41,flip.1,flip.2')] ).
cnf(43,axiom,
( r1(dollar_f20(A))
| r1(dollar_f22(A)) ),
file('NUN068+2.p',unknown),
[] ).
cnf(44,axiom,
( r1(dollar_f20(A))
| A = dollar_f22(A) ),
file('NUN068+2.p',unknown),
[] ).
cnf(45,plain,
( r1(dollar_f20(A))
| dollar_f22(A) = A ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[44])]),
[iquote('copy,44,flip.2')] ).
cnf(46,axiom,
( r2(dollar_f20(A),dollar_f21(A))
| r1(dollar_f22(A)) ),
file('NUN068+2.p',unknown),
[] ).
cnf(47,axiom,
( r2(dollar_f20(A),dollar_f21(A))
| A = dollar_f22(A) ),
file('NUN068+2.p',unknown),
[] ).
cnf(48,plain,
( r2(dollar_f20(A),dollar_f21(A))
| dollar_f22(A) = A ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[47])]),
[iquote('copy,47,flip.2')] ).
cnf(49,axiom,
( A = dollar_f21(A)
| r1(dollar_f22(A)) ),
file('NUN068+2.p',unknown),
[] ).
cnf(50,plain,
( dollar_f21(A) = A
| r1(dollar_f22(A)) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[49])]),
[iquote('copy,49,flip.1')] ).
cnf(51,axiom,
( A = dollar_f21(A)
| A = dollar_f22(A) ),
file('NUN068+2.p',unknown),
[] ).
cnf(52,plain,
( dollar_f21(A) = A
| dollar_f22(A) = A ),
inference(flip,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[51])])]),
[iquote('copy,51,flip.1,flip.2')] ).
cnf(58,plain,
r2(A,dollar_f1(A)),
inference(hyper,[status(thm)],[12,4]),
[iquote('hyper,12,4')] ).
cnf(59,plain,
r1(dollar_c1),
inference(hyper,[status(thm)],[12,2]),
[iquote('hyper,12,2')] ).
cnf(60,plain,
( r1(A)
| ~ r2(dollar_c1,B)
| B != C
| ~ r2(A,C) ),
inference(para_into,[status(thm),theory(equality)],[59,9]),
[iquote('para_into,59.1.1,9.4.1')] ).
cnf(75,plain,
dollar_f4(A,B) = dollar_f1(B),
inference(hyper,[status(thm)],[13,3]),
[iquote('hyper,13,3')] ).
cnf(76,plain,
dollar_f1(A) = dollar_f4(B,A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[75])]),
[iquote('copy,75,flip.1')] ).
cnf(86,plain,
( dollar_c1 = A
| ~ r1(A) ),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[30,1]),30]),
[iquote('para_into,29.1.1,1.2.1,demod,30')] ).
cnf(116,plain,
dollar_f8(A,B) = dollar_f1(B),
inference(hyper,[status(thm)],[21,3]),
[iquote('hyper,21,3')] ).
cnf(117,plain,
dollar_f1(A) = dollar_f8(B,A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[116])]),
[iquote('copy,116,flip.1')] ).
cnf(300,plain,
( r1(dollar_f20(A))
| r1(A) ),
inference(factor_simp,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[45,43])]),
[iquote('para_from,45.2.1,43.2.1,factor_simp')] ).
cnf(315,plain,
( r1(A)
| r2(dollar_f19(A),dollar_f18(A)) ),
inference(factor_simp,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[40,36])]),
[iquote('para_from,40.1.1,36.1.1,factor_simp')] ).
cnf(327,plain,
r1(dollar_f20(dollar_f1(A))),
inference(hyper,[status(thm)],[300,10,117,21]),
[iquote('hyper,300,10,117,21')] ).
cnf(343,plain,
dollar_f20(dollar_f1(A)) = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[327,86])]),
[iquote('hyper,327,86,flip.1')] ).
cnf(361,plain,
dollar_f18(dollar_f1(A)) = dollar_f1(A),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[42,10,38,58])]),
[iquote('hyper,42,10,38,58,factor_simp')] ).
cnf(503,plain,
( r2(dollar_f20(A),dollar_f21(A))
| r1(A) ),
inference(factor_simp,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[48,46])]),
[iquote('para_from,48.2.1,46.2.1,factor_simp')] ).
cnf(565,plain,
dollar_f21(dollar_f1(A)) = dollar_f1(A),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[52,10,50,58])]),
[iquote('hyper,52,10,50,58,factor_simp')] ).
cnf(1186,plain,
r2(dollar_f19(dollar_f1(A)),dollar_f1(A)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[315,10,565,58]),565,565,361]),
[iquote('hyper,315,10,564,58,demod,565,565,361')] ).
cnf(1220,plain,
dollar_f19(dollar_f1(A)) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[1186,9,58,12])]),
[iquote('hyper,1186,9,58,12,flip.1')] ).
cnf(1227,plain,
dollar_f19(dollar_f4(A,B)) = B,
inference(para_into,[status(thm),theory(equality)],[1220,76]),
[iquote('para_into,1220.1.1.1,76.1.1')] ).
cnf(2408,plain,
r2(dollar_c1,dollar_f1(A)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[503,10,1227,58]),1227,343,1227,565]),
[iquote('hyper,503,10,1226,58,demod,1227,343,1227,565')] ).
cnf(2458,plain,
r1(A),
inference(hyper,[status(thm)],[2408,60,117,21]),
[iquote('hyper,2408,60,117,21')] ).
cnf(2469,plain,
$false,
inference(hyper,[status(thm)],[2458,10,1227,21]),
[iquote('hyper,2458,10,1226,21')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUN068+2 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n026.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:52:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.00/2.19 ----- Otter 3.3f, August 2004 -----
% 2.00/2.19 The process was started by sandbox on n026.cluster.edu,
% 2.00/2.19 Wed Jul 27 02:52:09 2022
% 2.00/2.19 The command was "./otter". The process ID is 6178.
% 2.00/2.19
% 2.00/2.19 set(prolog_style_variables).
% 2.00/2.19 set(auto).
% 2.00/2.19 dependent: set(auto1).
% 2.00/2.19 dependent: set(process_input).
% 2.00/2.19 dependent: clear(print_kept).
% 2.00/2.19 dependent: clear(print_new_demod).
% 2.00/2.19 dependent: clear(print_back_demod).
% 2.00/2.19 dependent: clear(print_back_sub).
% 2.00/2.19 dependent: set(control_memory).
% 2.00/2.19 dependent: assign(max_mem, 12000).
% 2.00/2.19 dependent: assign(pick_given_ratio, 4).
% 2.00/2.19 dependent: assign(stats_level, 1).
% 2.00/2.19 dependent: assign(max_seconds, 10800).
% 2.00/2.19 clear(print_given).
% 2.00/2.19
% 2.00/2.19 formula_list(usable).
% 2.00/2.19 all A (A=A).
% 2.00/2.19 exists Y24 all X19 (-r1(X19)&X19!=Y24|r1(X19)&X19=Y24).
% 2.00/2.19 all X11 exists Y21 all X12 (-r2(X11,X12)&X12!=Y21|r2(X11,X12)&X12=Y21).
% 2.00/2.19 all X13 X14 exists Y22 all X15 (-r3(X13,X14,X15)&X15!=Y22|r3(X13,X14,X15)&X15=Y22).
% 2.00/2.19 all X16 X17 exists Y23 all X18 (-r4(X16,X17,X18)&X18!=Y23|r4(X16,X17,X18)&X18=Y23).
% 2.00/2.19 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)))).
% 2.00/2.19 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)))).
% 2.00/2.19 all X3 X10 ((all Y12 ((all Y13 (-r2(X3,Y13)|Y13!=Y12))| -r2(X10,Y12)))|X3=X10).
% 2.00/2.19 all X4 exists Y9 ((exists Y16 (r1(Y16)&r3(X4,Y16,Y9)))&Y9=X4).
% 2.00/2.19 all X5 exists Y8 ((exists Y17 (r1(Y17)&r4(X5,Y17,Y8)))& (exists Y18 (r1(Y18)&Y8=Y18))).
% 2.00/2.19 all X6 ((exists Y19 (r1(Y19)&X6=Y19))| (exists Y1 Y11 (r2(Y1,Y11)&X6=Y11))).
% 2.00/2.19 all X7 Y10 ((all Y20 (-r1(Y20)|Y20!=Y10))| -r2(X7,Y10)).
% 2.00/2.19 -(exists Y1 ((all Y2 ((all Y3 (-r1(Y3)| -r2(Y3,Y2)))|Y1!=Y2))& (all Y4 (-r1(Y4)|Y1!=Y4)))).
% 2.00/2.19 end_of_list.
% 2.00/2.19
% 2.00/2.19 -------> usable clausifies to:
% 2.00/2.19
% 2.00/2.19 list(usable).
% 2.00/2.19 0 [] A=A.
% 2.00/2.19 0 [] -r1(X19)|X19=$c1.
% 2.00/2.19 0 [] X19!=$c1|r1(X19).
% 2.00/2.19 0 [] -r2(X11,X12)|X12=$f1(X11).
% 2.00/2.19 0 [] X12!=$f1(X11)|r2(X11,X12).
% 2.00/2.19 0 [] -r3(X13,X14,X15)|X15=$f2(X13,X14).
% 2.00/2.19 0 [] X15!=$f2(X13,X14)|r3(X13,X14,X15).
% 2.00/2.19 0 [] -r4(X16,X17,X18)|X18=$f3(X16,X17).
% 2.00/2.19 0 [] X18!=$f3(X16,X17)|r4(X16,X17,X18).
% 2.00/2.19 0 [] r2(X8,$f4(X1,X8)).
% 2.00/2.19 0 [] r3(X1,$f4(X1,X8),$f5(X1,X8)).
% 2.00/2.19 0 [] $f5(X1,X8)=$f7(X1,X8).
% 2.00/2.19 0 [] r2($f6(X1,X8),$f7(X1,X8)).
% 2.00/2.19 0 [] r3(X1,X8,$f6(X1,X8)).
% 2.00/2.19 0 [] r2(X9,$f8(X2,X9)).
% 2.00/2.19 0 [] r4(X2,$f8(X2,X9),$f9(X2,X9)).
% 2.00/2.19 0 [] $f9(X2,X9)=$f11(X2,X9).
% 2.00/2.19 0 [] r3($f10(X2,X9),X2,$f11(X2,X9)).
% 2.00/2.19 0 [] r4(X2,X9,$f10(X2,X9)).
% 2.00/2.19 0 [] -r2(X3,Y13)|Y13!=Y12| -r2(X10,Y12)|X3=X10.
% 2.00/2.19 0 [] r1($f12(X4)).
% 2.00/2.19 0 [] r3(X4,$f12(X4),$f13(X4)).
% 2.00/2.19 0 [] $f13(X4)=X4.
% 2.00/2.19 0 [] r1($f14(X5)).
% 2.00/2.19 0 [] r4(X5,$f14(X5),$f16(X5)).
% 2.00/2.19 0 [] r1($f15(X5)).
% 2.00/2.19 0 [] $f16(X5)=$f15(X5).
% 2.00/2.19 0 [] r1($f17(X6))|r2($f19(X6),$f18(X6)).
% 2.00/2.19 0 [] r1($f17(X6))|X6=$f18(X6).
% 2.00/2.19 0 [] X6=$f17(X6)|r2($f19(X6),$f18(X6)).
% 2.00/2.19 0 [] X6=$f17(X6)|X6=$f18(X6).
% 2.00/2.19 0 [] -r1(Y20)|Y20!=Y10| -r2(X7,Y10).
% 2.00/2.19 0 [] r1($f20(Y1))|r1($f22(Y1)).
% 2.00/2.19 0 [] r1($f20(Y1))|Y1=$f22(Y1).
% 2.00/2.19 0 [] r2($f20(Y1),$f21(Y1))|r1($f22(Y1)).
% 2.00/2.19 0 [] r2($f20(Y1),$f21(Y1))|Y1=$f22(Y1).
% 2.00/2.19 0 [] Y1=$f21(Y1)|r1($f22(Y1)).
% 2.00/2.19 0 [] Y1=$f21(Y1)|Y1=$f22(Y1).
% 2.00/2.19 end_of_list.
% 2.00/2.19
% 2.00/2.19 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 2.00/2.19
% 2.00/2.19 This ia a non-Horn set with equality. The strategy will be
% 2.00/2.19 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.00/2.19 deletion, with positive clauses in sos and nonpositive
% 2.00/2.19 clauses in usable.
% 2.00/2.19
% 2.00/2.19 dependent: set(knuth_bendix).
% 2.00/2.19 dependent: set(anl_eq).
% 2.00/2.19 dependent: set(para_from).
% 2.00/2.19 dependent: set(para_into).
% 2.00/2.19 dependent: clear(para_from_right).
% 2.00/2.19 dependent: clear(para_into_right).
% 2.00/2.19 dependent: set(para_from_vars).
% 2.00/2.19 dependent: set(eq_units_both_ways).
% 2.00/2.19 dependent: set(dynamic_demod_all).
% 2.00/2.19 dependent: set(dynamic_demod).
% 2.00/2.19 dependent: set(order_eq).
% 2.00/2.19 dependent: set(back_demod).
% 2.00/2.19 dependent: set(lrpo).
% 2.00/2.19 dependent: set(hyper_res).
% 2.00/2.19 dependent: set(unit_deletion).
% 2.00/2.19 dependent: set(factor).
% 2.00/2.19
% 2.00/2.19 ------------> process usable:
% 2.00/2.19 ** KEPT (pick-wt=5): 1 [] -r1(A)|A=$c1.
% 2.00/2.19 ** KEPT (pick-wt=5): 2 [] A!=$c1|r1(A).
% 2.00/2.19 ** KEPT (pick-wt=7): 3 [] -r2(A,B)|B=$f1(A).
% 2.00/2.19 ** KEPT (pick-wt=7): 4 [] A!=$f1(B)|r2(B,A).
% 2.00/2.19 ** KEPT (pick-wt=9): 5 [] -r3(A,B,C)|C=$f2(A,B).
% 2.00/2.19 ** KEPT (pick-wt=9): 6 [] A!=$f2(B,C)|r3(B,C,A).
% 2.00/2.19 ** KEPT (pick-wt=9): 7 [] -r4(A,B,C)|C=$f3(A,B).
% 2.00/2.19 ** KEPT (pick-wt=9): 8 [] A!=$f3(B,C)|r4(B,C,A).
% 2.00/2.19 ** KEPT (pick-wt=12): 9 [] -r2(A,B)|B!=C| -r2(D,C)|A=D.
% 2.41/2.59 ** KEPT (pick-wt=8): 10 [] -r1(A)|A!=B| -r2(C,B).
% 2.41/2.59
% 2.41/2.59 ------------> process sos:
% 2.41/2.59 ** KEPT (pick-wt=3): 12 [] A=A.
% 2.41/2.59 ** KEPT (pick-wt=5): 13 [] r2(A,$f4(B,A)).
% 2.41/2.59 ** KEPT (pick-wt=8): 14 [] r3(A,$f4(A,B),$f5(A,B)).
% 2.41/2.59 ** KEPT (pick-wt=7): 16 [copy,15,flip.1] $f7(A,B)=$f5(A,B).
% 2.41/2.59 ---> New Demodulator: 17 [new_demod,16] $f7(A,B)=$f5(A,B).
% 2.41/2.59 ** KEPT (pick-wt=7): 19 [copy,18,demod,17] r2($f6(A,B),$f5(A,B)).
% 2.41/2.59 ** KEPT (pick-wt=6): 20 [] r3(A,B,$f6(A,B)).
% 2.41/2.59 ** KEPT (pick-wt=5): 21 [] r2(A,$f8(B,A)).
% 2.41/2.59 ** KEPT (pick-wt=8): 22 [] r4(A,$f8(A,B),$f9(A,B)).
% 2.41/2.59 ** KEPT (pick-wt=7): 23 [] $f9(A,B)=$f11(A,B).
% 2.41/2.59 ---> New Demodulator: 24 [new_demod,23] $f9(A,B)=$f11(A,B).
% 2.41/2.59 ** KEPT (pick-wt=8): 25 [] r3($f10(A,B),A,$f11(A,B)).
% 2.41/2.59 ** KEPT (pick-wt=6): 26 [] r4(A,B,$f10(A,B)).
% 2.41/2.59 ** KEPT (pick-wt=3): 27 [] r1($f12(A)).
% 2.41/2.59 ** KEPT (pick-wt=6): 28 [] r3(A,$f12(A),$f13(A)).
% 2.41/2.59 ** KEPT (pick-wt=4): 29 [] $f13(A)=A.
% 2.41/2.59 ---> New Demodulator: 30 [new_demod,29] $f13(A)=A.
% 2.41/2.59 ** KEPT (pick-wt=3): 31 [] r1($f14(A)).
% 2.41/2.59 ** KEPT (pick-wt=6): 32 [] r4(A,$f14(A),$f16(A)).
% 2.41/2.59 ** KEPT (pick-wt=3): 33 [] r1($f15(A)).
% 2.41/2.59 ** KEPT (pick-wt=5): 34 [] $f16(A)=$f15(A).
% 2.41/2.59 ---> New Demodulator: 35 [new_demod,34] $f16(A)=$f15(A).
% 2.41/2.59 ** KEPT (pick-wt=8): 36 [] r1($f17(A))|r2($f19(A),$f18(A)).
% 2.41/2.59 ** KEPT (pick-wt=7): 38 [copy,37,flip.2] r1($f17(A))|$f18(A)=A.
% 2.41/2.59 ** KEPT (pick-wt=9): 40 [copy,39,flip.1] $f17(A)=A|r2($f19(A),$f18(A)).
% 2.41/2.59 ** KEPT (pick-wt=8): 42 [copy,41,flip.1,flip.2] $f17(A)=A|$f18(A)=A.
% 2.41/2.59 ** KEPT (pick-wt=6): 43 [] r1($f20(A))|r1($f22(A)).
% 2.41/2.59 ** KEPT (pick-wt=7): 45 [copy,44,flip.2] r1($f20(A))|$f22(A)=A.
% 2.41/2.59 ** KEPT (pick-wt=8): 46 [] r2($f20(A),$f21(A))|r1($f22(A)).
% 2.41/2.59 ** KEPT (pick-wt=9): 48 [copy,47,flip.2] r2($f20(A),$f21(A))|$f22(A)=A.
% 2.41/2.59 ** KEPT (pick-wt=7): 50 [copy,49,flip.1] $f21(A)=A|r1($f22(A)).
% 2.41/2.59 ** KEPT (pick-wt=8): 52 [copy,51,flip.1,flip.2] $f21(A)=A|$f22(A)=A.
% 2.41/2.59 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] A=A.
% 2.41/2.59 12 back subsumes 11.
% 2.41/2.59 >>>> Starting back demodulation with 17.
% 2.41/2.59 >>>> Starting back demodulation with 24.
% 2.41/2.59 >> back demodulating 22 with 24.
% 2.41/2.59 >>>> Starting back demodulation with 30.
% 2.41/2.59 >> back demodulating 28 with 30.
% 2.41/2.59 >>>> Starting back demodulation with 35.
% 2.41/2.59 >> back demodulating 32 with 35.
% 2.41/2.59
% 2.41/2.59 ======= end of input processing =======
% 2.41/2.59
% 2.41/2.59 =========== start of search ===========
% 2.41/2.59
% 2.41/2.59 -------- PROOF --------
% 2.41/2.59
% 2.41/2.59 -----> EMPTY CLAUSE at 0.40 sec ----> 2469 [hyper,2458,10,1226,21] $F.
% 2.41/2.59
% 2.41/2.59 Length of proof is 27. Level of proof is 7.
% 2.41/2.59
% 2.41/2.59 ---------------- PROOF ----------------
% 2.41/2.59 % SZS status Theorem
% 2.41/2.59 % SZS output start Refutation
% See solution above
% 2.41/2.59 ------------ end of proof -------------
% 2.41/2.59
% 2.41/2.59
% 2.41/2.59 Search stopped by max_proofs option.
% 2.41/2.59
% 2.41/2.59
% 2.41/2.59 Search stopped by max_proofs option.
% 2.41/2.59
% 2.41/2.59 ============ end of search ============
% 2.41/2.59
% 2.41/2.59 -------------- statistics -------------
% 2.41/2.59 clauses given 118
% 2.41/2.59 clauses generated 5721
% 2.41/2.59 clauses kept 2426
% 2.41/2.59 clauses forward subsumed 3432
% 2.41/2.59 clauses back subsumed 1408
% 2.41/2.59 Kbytes malloced 3906
% 2.41/2.59
% 2.41/2.59 ----------- times (seconds) -----------
% 2.41/2.59 user CPU time 0.40 (0 hr, 0 min, 0 sec)
% 2.41/2.59 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.41/2.59 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.41/2.59
% 2.41/2.59 That finishes the proof of the theorem.
% 2.41/2.59
% 2.41/2.59 Process 6178 finished Wed Jul 27 02:52:11 2022
% 2.41/2.59 Otter interrupted
% 2.41/2.59 PROOF FOUND
%------------------------------------------------------------------------------