TSTP Solution File: GRP483-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP483-1 : TPTP v8.1.0. Released v2.6.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 12:57:05 EDT 2022
% Result : Unsatisfiable 2.00s 2.24s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of clauses : 54 ( 54 unt; 0 nHn; 7 RR)
% Number of literals : 54 ( 53 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('GRP483-1.p',unknown),
[] ).
cnf(3,axiom,
double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(double_divide(C,double_divide(D,double_divide(D,identity))),double_divide(A,identity))),B) = C,
file('GRP483-1.p',unknown),
[] ).
cnf(6,axiom,
multiply(A,B) = double_divide(double_divide(B,A),identity),
file('GRP483-1.p',unknown),
[] ).
cnf(8,axiom,
inverse(A) = double_divide(A,identity),
file('GRP483-1.p',unknown),
[] ).
cnf(9,axiom,
identity = double_divide(A,inverse(A)),
file('GRP483-1.p',unknown),
[] ).
cnf(11,plain,
double_divide(A,double_divide(A,identity)) = identity,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[9]),8])]),
[iquote('copy,9,demod,8,flip.1')] ).
cnf(12,plain,
double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity) != double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1]),6,6,6,6])]),
[iquote('back_demod,1,demod,6,6,6,6,flip.1')] ).
cnf(13,plain,
double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(double_divide(C,identity),double_divide(A,identity))),B) = C,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[3]),11]),
[iquote('back_demod,3,demod,11')] ).
cnf(15,plain,
double_divide(double_divide(double_divide(A,B),double_divide(double_divide(C,identity),double_divide(A,identity))),double_divide(double_divide(D,double_divide(identity,identity)),double_divide(double_divide(B,identity),double_divide(D,identity)))) = C,
inference(para_into,[status(thm),theory(equality)],[13,13]),
[iquote('para_into,13.1.1.1.1.2,13.1.1')] ).
cnf(19,plain,
double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,identity))),B) = A,
inference(para_into,[status(thm),theory(equality)],[13,11]),
[iquote('para_into,13.1.1.1.1,10.1.1')] ).
cnf(21,plain,
double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(C,double_divide(A,identity))),B) = double_divide(double_divide(D,double_divide(identity,identity)),double_divide(double_divide(C,identity),double_divide(D,identity))),
inference(para_into,[status(thm),theory(equality)],[13,13]),
[iquote('para_into,13.1.1.1.2.1,13.1.1')] ).
cnf(24,plain,
double_divide(double_divide(double_divide(double_divide(A,identity),double_divide(B,identity)),identity),B) = A,
inference(para_into,[status(thm),theory(equality)],[13,11]),
[iquote('para_into,13.1.1.1.2,10.1.1')] ).
cnf(26,plain,
double_divide(double_divide(A,double_divide(identity,identity)),double_divide(double_divide(B,identity),double_divide(A,identity))) = double_divide(double_divide(double_divide(C,double_divide(D,identity)),double_divide(B,double_divide(C,identity))),D),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[21])]),
[iquote('copy,21,flip.1')] ).
cnf(30,plain,
double_divide(double_divide(identity,double_divide(A,double_divide(B,identity))),B) = double_divide(identity,double_divide(double_divide(A,identity),double_divide(identity,identity))),
inference(para_into,[status(thm),theory(equality)],[19,19]),
[iquote('para_into,19.1.1.1.2.1,19.1.1')] ).
cnf(31,plain,
double_divide(identity,double_divide(double_divide(A,identity),double_divide(identity,identity))) = double_divide(double_divide(B,double_divide(identity,identity)),double_divide(double_divide(A,identity),double_divide(B,identity))),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[19,13]),30]),
[iquote('para_into,19.1.1.1.2.1,13.1.1,demod,30')] ).
cnf(32,plain,
double_divide(double_divide(identity,double_divide(double_divide(A,identity),B)),double_divide(identity,double_divide(double_divide(B,identity),double_divide(identity,identity)))) = A,
inference(para_into,[status(thm),theory(equality)],[19,19]),
[iquote('para_into,19.1.1.1.2.2,19.1.1')] ).
cnf(36,plain,
double_divide(double_divide(identity,identity),double_divide(A,identity)) = A,
inference(para_into,[status(thm),theory(equality)],[19,11]),
[iquote('para_into,19.1.1.1.2,10.1.1')] ).
cnf(38,plain,
double_divide(identity,double_divide(double_divide(double_divide(A,identity),identity),double_divide(identity,identity))) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[19]),30]),
[iquote('back_demod,19,demod,30')] ).
cnf(40,plain,
double_divide(double_divide(A,double_divide(identity,identity)),double_divide(double_divide(B,identity),double_divide(A,identity))) = double_divide(identity,double_divide(double_divide(B,identity),double_divide(identity,identity))),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[31])]),
[iquote('copy,31,flip.1')] ).
cnf(41,plain,
double_divide(double_divide(A,double_divide(identity,identity)),double_divide(double_divide(B,identity),double_divide(A,identity))) = double_divide(double_divide(identity,identity),B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[36,13])]),
[iquote('para_into,36.1.1.2,13.1.1,flip.1')] ).
cnf(44,plain,
double_divide(identity,identity) = identity,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[36,11])]),
[iquote('para_into,36.1.1,10.1.1,flip.1')] ).
cnf(46,plain,
double_divide(double_divide(A,identity),double_divide(double_divide(B,identity),double_divide(A,identity))) = double_divide(identity,double_divide(double_divide(B,identity),identity)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[40]),44,44]),
[iquote('back_demod,40,demod,44,44')] ).
cnf(52,plain,
double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(C,double_divide(A,identity))),B) = double_divide(identity,double_divide(double_divide(C,identity),identity)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[26]),44,46])]),
[iquote('back_demod,26,demod,44,46,flip.1')] ).
cnf(55,plain,
double_divide(double_divide(double_divide(A,B),double_divide(double_divide(C,identity),double_divide(A,identity))),double_divide(identity,double_divide(double_divide(B,identity),identity))) = C,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[15]),44,46]),
[iquote('back_demod,15,demod,44,46')] ).
cnf(58,plain,
double_divide(identity,double_divide(double_divide(A,identity),identity)) = double_divide(identity,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[41]),44,46,44]),
[iquote('back_demod,41,demod,44,46,44')] ).
cnf(60,plain,
double_divide(identity,double_divide(A,identity)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[38]),44,58]),
[iquote('back_demod,38,demod,44,58')] ).
cnf(61,plain,
double_divide(double_divide(identity,double_divide(double_divide(A,identity),B)),double_divide(B,identity)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[32]),44,60]),
[iquote('back_demod,32,demod,44,60')] ).
cnf(63,plain,
double_divide(double_divide(identity,double_divide(A,double_divide(B,identity))),B) = double_divide(A,identity),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[30]),44,60]),
[iquote('back_demod,29,demod,44,60')] ).
cnf(66,plain,
double_divide(double_divide(A,identity),identity) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[13]),52,60]),
[iquote('back_demod,13,demod,52,60')] ).
cnf(67,plain,
double_divide(double_divide(double_divide(A,B),double_divide(double_divide(C,identity),double_divide(A,identity))),double_divide(identity,B)) = C,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[55]),66]),
[iquote('back_demod,55,demod,66')] ).
cnf(71,plain,
double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(C,double_divide(A,identity))),B) = double_divide(identity,C),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[52]),66]),
[iquote('back_demod,51,demod,66')] ).
cnf(83,plain,
double_divide(double_divide(double_divide(A,double_divide(B,identity)),identity),B) = double_divide(A,identity),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[24,24]),44,66]),
[iquote('para_into,24.1.1.1.1.1,24.1.1,demod,44,66')] ).
cnf(87,plain,
double_divide(identity,A) = double_divide(A,identity),
inference(para_from,[status(thm),theory(equality)],[66,60]),
[iquote('para_from,65.1.1,59.1.1.2')] ).
cnf(88,plain,
double_divide(A,identity) = double_divide(identity,A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[87])]),
[iquote('copy,87,flip.1')] ).
cnf(91,plain,
double_divide(double_divide(identity,double_divide(A,B)),double_divide(B,identity)) = double_divide(A,identity),
inference(para_into,[status(thm),theory(equality)],[61,66]),
[iquote('para_into,61.1.1.1.2.1,65.1.1')] ).
cnf(93,plain,
double_divide(double_divide(identity,A),identity) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[61,66]),44]),
[iquote('para_into,61.1.1.1.2,65.1.1,demod,44')] ).
cnf(95,plain,
double_divide(identity,double_divide(double_divide(double_divide(c3,b3),identity),a3)) != double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity),
inference(para_from,[status(thm),theory(equality)],[88,12]),
[iquote('para_from,88.1.1,12.1.1')] ).
cnf(98,plain,
double_divide(identity,double_divide(identity,A)) = A,
inference(para_from,[status(thm),theory(equality)],[88,60]),
[iquote('para_from,88.1.1,59.1.1.2')] ).
cnf(101,plain,
double_divide(double_divide(identity,double_divide(A,B)),double_divide(identity,B)) = double_divide(A,identity),
inference(para_into,[status(thm),theory(equality)],[63,93]),
[iquote('para_into,63.1.1.1.2.2,93.1.1')] ).
cnf(111,plain,
double_divide(A,double_divide(identity,B)) = double_divide(A,double_divide(B,identity)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[101,83]),60,66]),
[iquote('para_into,101.1.1.1.2,83.1.1,demod,60,66')] ).
cnf(116,plain,
double_divide(double_divide(A,B),A) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[67,98]),44,66,98]),
[iquote('para_into,67.1.1.1.1,97.1.1,demod,44,66,98')] ).
cnf(142,plain,
double_divide(A,double_divide(B,A)) = B,
inference(para_into,[status(thm),theory(equality)],[116,116]),
[iquote('para_into,115.1.1.1,115.1.1')] ).
cnf(147,plain,
double_divide(double_divide(double_divide(identity,A),B),double_divide(A,identity)) = B,
inference(para_into,[status(thm),theory(equality)],[116,111]),
[iquote('para_into,115.1.1,111.1.1')] ).
cnf(164,plain,
double_divide(double_divide(A,double_divide(B,identity)),identity) = double_divide(B,double_divide(A,identity)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[142,83])]),
[iquote('para_into,141.1.1.2,83.1.1,flip.1')] ).
cnf(170,plain,
double_divide(identity,double_divide(double_divide(double_divide(c3,b3),identity),a3)) != double_divide(double_divide(b3,a3),double_divide(c3,identity)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[95]),164]),
[iquote('back_demod,95,demod,164')] ).
cnf(193,plain,
double_divide(double_divide(double_divide(identity,A),B),identity) = double_divide(double_divide(identity,B),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[147,101]),142])]),
[iquote('para_from,147.1.1,101.1.1.1.2,demod,142,flip.1')] ).
cnf(206,plain,
double_divide(double_divide(A,double_divide(B,double_divide(double_divide(identity,A),C))),C) = double_divide(identity,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[71,147]),193]),
[iquote('para_into,71.1.1.1.1,147.1.1,demod,193')] ).
cnf(215,plain,
double_divide(double_divide(double_divide(A,double_divide(B,identity)),C),B) = double_divide(identity,double_divide(double_divide(identity,A),C)),
inference(para_into,[status(thm),theory(equality)],[71,147]),
[iquote('para_into,71.1.1.1.2,147.1.1')] ).
cnf(217,plain,
double_divide(identity,double_divide(double_divide(identity,A),double_divide(B,identity))) = double_divide(B,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[71,91]),215,98]),
[iquote('para_into,71.1.1.1.2,91.1.1,demod,215,98')] ).
cnf(220,plain,
double_divide(A,B) = double_divide(identity,double_divide(double_divide(identity,B),double_divide(A,identity))),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[217])]),
[iquote('copy,217,flip.1')] ).
cnf(629,plain,
double_divide(identity,double_divide(double_divide(double_divide(identity,b3),double_divide(c3,identity)),a3)) != double_divide(double_divide(b3,a3),double_divide(c3,identity)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[170,220]),116]),
[iquote('para_into,170.1.1.2.1.1,220.1.1,demod,116')] ).
cnf(1635,plain,
double_divide(double_divide(A,B),C) = double_divide(identity,double_divide(double_divide(double_divide(identity,A),C),B)),
inference(para_into,[status(thm),theory(equality)],[206,116]),
[iquote('para_into,206.1.1.1.2,115.1.1')] ).
cnf(1665,plain,
double_divide(identity,double_divide(double_divide(double_divide(identity,A),B),C)) = double_divide(double_divide(A,C),B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1635])]),
[iquote('copy,1635,flip.1')] ).
cnf(1666,plain,
$false,
inference(binary,[status(thm)],[1665,629]),
[iquote('binary,1665.1,629.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP483-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n025.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 05:38:45 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.00/2.24 ----- Otter 3.3f, August 2004 -----
% 2.00/2.24 The process was started by sandbox on n025.cluster.edu,
% 2.00/2.24 Wed Jul 27 05:38:45 2022
% 2.00/2.24 The command was "./otter". The process ID is 8018.
% 2.00/2.24
% 2.00/2.24 set(prolog_style_variables).
% 2.00/2.24 set(auto).
% 2.00/2.24 dependent: set(auto1).
% 2.00/2.24 dependent: set(process_input).
% 2.00/2.24 dependent: clear(print_kept).
% 2.00/2.24 dependent: clear(print_new_demod).
% 2.00/2.24 dependent: clear(print_back_demod).
% 2.00/2.24 dependent: clear(print_back_sub).
% 2.00/2.24 dependent: set(control_memory).
% 2.00/2.24 dependent: assign(max_mem, 12000).
% 2.00/2.24 dependent: assign(pick_given_ratio, 4).
% 2.00/2.24 dependent: assign(stats_level, 1).
% 2.00/2.24 dependent: assign(max_seconds, 10800).
% 2.00/2.24 clear(print_given).
% 2.00/2.24
% 2.00/2.24 list(usable).
% 2.00/2.24 0 [] A=A.
% 2.00/2.24 0 [] double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(double_divide(C,double_divide(D,double_divide(D,identity))),double_divide(A,identity))),B)=C.
% 2.00/2.24 0 [] multiply(A,B)=double_divide(double_divide(B,A),identity).
% 2.00/2.24 0 [] inverse(A)=double_divide(A,identity).
% 2.00/2.24 0 [] identity=double_divide(A,inverse(A)).
% 2.00/2.24 0 [] multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)).
% 2.00/2.24 end_of_list.
% 2.00/2.24
% 2.00/2.24 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.00/2.24
% 2.00/2.24 All clauses are units, and equality is present; the
% 2.00/2.24 strategy will be Knuth-Bendix with positive clauses in sos.
% 2.00/2.24
% 2.00/2.24 dependent: set(knuth_bendix).
% 2.00/2.24 dependent: set(anl_eq).
% 2.00/2.24 dependent: set(para_from).
% 2.00/2.24 dependent: set(para_into).
% 2.00/2.24 dependent: clear(para_from_right).
% 2.00/2.24 dependent: clear(para_into_right).
% 2.00/2.24 dependent: set(para_from_vars).
% 2.00/2.24 dependent: set(eq_units_both_ways).
% 2.00/2.24 dependent: set(dynamic_demod_all).
% 2.00/2.24 dependent: set(dynamic_demod).
% 2.00/2.24 dependent: set(order_eq).
% 2.00/2.24 dependent: set(back_demod).
% 2.00/2.24 dependent: set(lrpo).
% 2.00/2.24
% 2.00/2.24 ------------> process usable:
% 2.00/2.24 ** KEPT (pick-wt=11): 1 [] multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)).
% 2.00/2.24
% 2.00/2.24 ------------> process sos:
% 2.00/2.24 ** KEPT (pick-wt=3): 2 [] A=A.
% 2.00/2.24 ** KEPT (pick-wt=21): 3 [] double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(double_divide(C,double_divide(D,double_divide(D,identity))),double_divide(A,identity))),B)=C.
% 2.00/2.24 ---> New Demodulator: 4 [new_demod,3] double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(double_divide(C,double_divide(D,double_divide(D,identity))),double_divide(A,identity))),B)=C.
% 2.00/2.24 ** KEPT (pick-wt=9): 5 [] multiply(A,B)=double_divide(double_divide(B,A),identity).
% 2.00/2.24 ---> New Demodulator: 6 [new_demod,5] multiply(A,B)=double_divide(double_divide(B,A),identity).
% 2.00/2.24 ** KEPT (pick-wt=6): 7 [] inverse(A)=double_divide(A,identity).
% 2.00/2.24 ---> New Demodulator: 8 [new_demod,7] inverse(A)=double_divide(A,identity).
% 2.00/2.24 ** KEPT (pick-wt=7): 10 [copy,9,demod,8,flip.1] double_divide(A,double_divide(A,identity))=identity.
% 2.00/2.24 ---> New Demodulator: 11 [new_demod,10] double_divide(A,double_divide(A,identity))=identity.
% 2.00/2.24 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 2.00/2.24 >>>> Starting back demodulation with 4.
% 2.00/2.24 >>>> Starting back demodulation with 6.
% 2.00/2.24 >> back demodulating 1 with 6.
% 2.00/2.24 >>>> Starting back demodulation with 8.
% 2.00/2.24 >>>> Starting back demodulation with 11.
% 2.00/2.24 >> back demodulating 3 with 11.
% 2.00/2.24 >>>> Starting back demodulation with 14.
% 2.00/2.24
% 2.00/2.24 ======= end of input processing =======
% 2.00/2.24
% 2.00/2.24 =========== start of search ===========
% 2.00/2.24
% 2.00/2.24 -------- PROOF --------
% 2.00/2.24
% 2.00/2.24 ----> UNIT CONFLICT at 0.13 sec ----> 1666 [binary,1665.1,629.1] $F.
% 2.00/2.24
% 2.00/2.24 Length of proof is 48. Level of proof is 19.
% 2.00/2.24
% 2.00/2.24 ---------------- PROOF ----------------
% 2.00/2.24 % SZS status Unsatisfiable
% 2.00/2.24 % SZS output start Refutation
% See solution above
% 2.00/2.24 ------------ end of proof -------------
% 2.00/2.24
% 2.00/2.24
% 2.00/2.24 Search stopped by max_proofs option.
% 2.00/2.24
% 2.00/2.24
% 2.00/2.24 Search stopped by max_proofs option.
% 2.00/2.24
% 2.00/2.24 ============ end of search ============
% 2.00/2.24
% 2.00/2.24 -------------- statistics -------------
% 2.00/2.24 clauses given 111
% 2.00/2.24 clauses generated 10808
% 2.00/2.24 clauses kept 1120
% 2.00/2.24 clauses forward subsumed 10424
% 2.00/2.24 clauses back subsumed 12
% 2.00/2.24 Kbytes malloced 2929
% 2.00/2.24
% 2.00/2.24 ----------- times (seconds) -----------
% 2.00/2.24 user CPU time 0.13 (0 hr, 0 min, 0 sec)
% 2.00/2.24 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.24 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.00/2.24
% 2.00/2.24 That finishes the proof of the theorem.
% 2.00/2.24
% 2.00/2.24 Process 8018 finished Wed Jul 27 05:38:47 2022
% 2.00/2.24 Otter interrupted
% 2.00/2.24 PROOF FOUND
%------------------------------------------------------------------------------