TSTP Solution File: RNG039-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : RNG039-1 : TPTP v8.1.0. Released v1.0.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:12:09 EDT 2022
% Result : Unsatisfiable 1.89s 2.07s
% Output : Refutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of clauses : 29 ( 24 unt; 0 nHn; 18 RR)
% Number of literals : 45 ( 14 equ; 19 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 44 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
( ~ product(A,B,C)
| ~ product(A,D,E)
| ~ sum(B,D,F)
| ~ sum(C,E,G)
| product(A,F,G) ),
file('RNG039-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ product(A,B,C)
| ~ product(D,B,E)
| ~ sum(A,D,F)
| ~ product(F,B,G)
| sum(C,E,G) ),
file('RNG039-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ product(A,B,C)
| ~ product(D,B,E)
| ~ sum(A,D,F)
| ~ sum(C,E,G)
| product(F,B,G) ),
file('RNG039-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ sum(A,B,C)
| ~ sum(A,B,D)
| C = D ),
file('RNG039-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ product(A,B,C)
| ~ product(A,B,D)
| C = D ),
file('RNG039-1.p',unknown),
[] ).
cnf(12,axiom,
c != d,
file('RNG039-1.p',unknown),
[] ).
cnf(13,plain,
d != c,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[12])]),
[iquote('copy,12,flip.1')] ).
cnf(17,axiom,
product(A,B,multiply(A,B)),
file('RNG039-1.p',unknown),
[] ).
cnf(21,axiom,
sum(A,add(A,B),B),
file('RNG039-1.p',unknown),
[] ).
cnf(23,axiom,
sum(A,A,additive_identity),
file('RNG039-1.p',unknown),
[] ).
cnf(27,axiom,
add(A,A) = additive_identity,
file('RNG039-1.p',unknown),
[] ).
cnf(34,axiom,
sum(A,B,add(B,A)),
file('RNG039-1.p',unknown),
[] ).
cnf(40,axiom,
product(a,multiply(b,A),multiply(B,A)),
file('RNG039-1.p',unknown),
[] ).
cnf(42,axiom,
product(a,multiply(b,c),c),
file('RNG039-1.p',unknown),
[] ).
cnf(45,axiom,
product(b,multiply(a,d),d),
file('RNG039-1.p',unknown),
[] ).
cnf(47,axiom,
product(a,d,multiply(c,a)),
file('RNG039-1.p',unknown),
[] ).
cnf(84,plain,
product(additive_identity,A,additive_identity),
inference(hyper,[status(thm)],[17,9,17,23,23]),
[iquote('hyper,17,9,17,23,23')] ).
cnf(91,plain,
product(A,additive_identity,additive_identity),
inference(hyper,[status(thm)],[17,7,17,23,23]),
[iquote('hyper,17,7,17,23,23')] ).
cnf(359,plain,
multiply(additive_identity,A) = additive_identity,
inference(hyper,[status(thm)],[84,11,17]),
[iquote('hyper,84,11,17')] ).
cnf(367,plain,
multiply(A,additive_identity) = additive_identity,
inference(hyper,[status(thm)],[91,11,17]),
[iquote('hyper,91,11,17')] ).
cnf(1262,plain,
multiply(b,multiply(a,d)) = d,
inference(hyper,[status(thm)],[45,11,17]),
[iquote('hyper,45,11,17')] ).
cnf(1389,plain,
multiply(c,a) = multiply(a,d),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[47,11,17])]),
[iquote('hyper,47,11,17,flip.1')] ).
cnf(1395,plain,
multiply(A,c) = c,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[40,11,42])]),
[iquote('hyper,40,11,42,flip.1')] ).
cnf(1425,plain,
sum(c,c,c),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[40,8,42,17,21]),27,1395,1395,1395]),
[iquote('hyper,40,8,42,17,21,demod,27,1395,1395,1395')] ).
cnf(1569,plain,
c = additive_identity,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[1425,10,34]),27])]),
[iquote('hyper,1425,10,34,demod,27,flip.1')] ).
cnf(1592,plain,
multiply(a,d) = additive_identity,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1389]),1569,359])]),
[iquote('back_demod,1389,demod,1569,359,flip.1')] ).
cnf(1657,plain,
d != additive_identity,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[13]),1569]),
[iquote('back_demod,13,demod,1569')] ).
cnf(1688,plain,
d = additive_identity,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1262]),1592,367])]),
[iquote('back_demod,1262,demod,1592,367,flip.1')] ).
cnf(1690,plain,
$false,
inference(binary,[status(thm)],[1688,1657]),
[iquote('binary,1688.1,1657.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : RNG039-1 : TPTP v8.1.0. Released v1.0.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:09:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.75/1.97 ----- Otter 3.3f, August 2004 -----
% 1.75/1.97 The process was started by sandbox on n012.cluster.edu,
% 1.75/1.97 Wed Jul 27 02:09:20 2022
% 1.75/1.97 The command was "./otter". The process ID is 28455.
% 1.75/1.97
% 1.75/1.97 set(prolog_style_variables).
% 1.75/1.97 set(auto).
% 1.75/1.97 dependent: set(auto1).
% 1.75/1.97 dependent: set(process_input).
% 1.75/1.97 dependent: clear(print_kept).
% 1.75/1.97 dependent: clear(print_new_demod).
% 1.75/1.97 dependent: clear(print_back_demod).
% 1.75/1.97 dependent: clear(print_back_sub).
% 1.75/1.97 dependent: set(control_memory).
% 1.75/1.97 dependent: assign(max_mem, 12000).
% 1.75/1.97 dependent: assign(pick_given_ratio, 4).
% 1.75/1.97 dependent: assign(stats_level, 1).
% 1.75/1.97 dependent: assign(max_seconds, 10800).
% 1.75/1.97 clear(print_given).
% 1.75/1.97
% 1.75/1.97 list(usable).
% 1.75/1.97 0 [] A=A.
% 1.75/1.97 0 [] sum(additive_identity,X,X).
% 1.75/1.97 0 [] sum(X,additive_identity,X).
% 1.75/1.97 0 [] product(X,Y,multiply(X,Y)).
% 1.75/1.97 0 [] sum(X,Y,add(X,Y)).
% 1.75/1.97 0 [] sum(additive_inverse(X),X,additive_identity).
% 1.75/1.97 0 [] sum(X,additive_inverse(X),additive_identity).
% 1.75/1.97 0 [] -sum(X,Y,U)| -sum(Y,Z,V)| -sum(U,Z,W)|sum(X,V,W).
% 1.75/1.97 0 [] -sum(X,Y,U)| -sum(Y,Z,V)| -sum(X,V,W)|sum(U,Z,W).
% 1.75/1.97 0 [] -sum(X,Y,Z)|sum(Y,X,Z).
% 1.75/1.97 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(U,Z,W)|product(X,V,W).
% 1.75/1.97 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(X,V,W)|product(U,Z,W).
% 1.75/1.97 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -product(X,V3,V4)|sum(V1,V2,V4).
% 1.75/1.97 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(X,V3,V4).
% 1.75/1.97 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -product(V3,X,V4)|sum(V1,V2,V4).
% 1.75/1.97 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(V3,X,V4).
% 1.75/1.97 0 [] -sum(X,Y,U)| -sum(X,Y,V)|U=V.
% 1.75/1.97 0 [] -product(X,Y,U)| -product(X,Y,V)|U=V.
% 1.75/1.97 0 [] sum(A,add(A,B),B).
% 1.75/1.97 0 [] sum(add(A,B),B,A).
% 1.75/1.97 0 [] sum(A,A,additive_identity).
% 1.75/1.97 0 [] add(A,additive_identity)=A.
% 1.75/1.97 0 [] add(A,A)=additive_identity.
% 1.75/1.97 0 [] multiply(A,A)=A.
% 1.75/1.97 0 [] multiply(a,b)=c.
% 1.75/1.97 0 [] multiply(b,a)=d.
% 1.75/1.97 0 [] sum(A,B,add(B,A)).
% 1.75/1.97 0 [] product(a,c,c).
% 1.75/1.97 0 [] product(b,d,d).
% 1.75/1.97 0 [] product(c,b,c).
% 1.75/1.97 0 [] product(d,a,d).
% 1.75/1.97 0 [] product(A,multiply(A,B),multiply(A,B)).
% 1.75/1.97 0 [] product(a,multiply(b,A),multiply(B,A)).
% 1.75/1.97 0 [] product(a,b,multiply(c,b)).
% 1.75/1.97 0 [] product(a,multiply(b,c),c).
% 1.75/1.97 0 [] product(b,multiply(a,A),multiply(d,A)).
% 1.75/1.97 0 [] product(b,a,multiply(d,a)).
% 1.75/1.97 0 [] product(b,multiply(a,d),d).
% 1.75/1.97 0 [] product(b,c,multiply(d,b)).
% 1.75/1.97 0 [] product(a,d,multiply(c,a)).
% 1.75/1.97 0 [] product(multiply(A,B),B,multiply(A,B)).
% 1.75/1.97 0 [] product(multiply(A,a),b,multiply(A,c)).
% 1.75/1.97 0 [] product(a,b,multiply(a,c)).
% 1.75/1.97 0 [] product(multiply(c,a),b,c).
% 1.75/1.97 0 [] product(d,b,multiply(b,c)).
% 1.75/1.97 0 [] product(multiply(A,b),a,multiply(A,d)).
% 1.75/1.97 0 [] product(b,a,multiply(b,d)).
% 1.75/1.97 0 [] product(multiply(d,b),a,d).
% 1.75/1.97 0 [] product(c,a,multiply(a,d)).
% 1.75/1.97 0 [] product(a,add(b,a),add(c,a)).
% 1.75/1.97 0 [] product(a,add(a,b),add(a,c)).
% 1.75/1.97 0 [] product(b,add(a,b),add(d,b)).
% 1.75/1.97 0 [] product(b,add(b,a),add(b,d)).
% 1.75/1.97 0 [] product(add(a,b),b,add(c,b)).
% 1.75/1.97 0 [] product(add(b,a),b,add(b,c)).
% 1.75/1.97 0 [] product(add(b,a),a,add(d,a)).
% 1.75/1.97 0 [] product(add(a,b),a,add(a,d)).
% 1.75/1.97 0 [] product(A,A,A).
% 1.75/1.97 0 [] product(a,b,c).
% 1.75/1.97 0 [] product(b,a,d).
% 1.75/1.97 0 [] c!=d.
% 1.75/1.97 end_of_list.
% 1.75/1.97
% 1.75/1.97 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=5.
% 1.75/1.97
% 1.75/1.97 This is a Horn set with equality. The strategy will be
% 1.75/1.97 Knuth-Bendix and hyper_res, with positive clauses in
% 1.75/1.97 sos and nonpositive clauses in usable.
% 1.75/1.97
% 1.75/1.97 dependent: set(knuth_bendix).
% 1.75/1.97 dependent: set(anl_eq).
% 1.75/1.97 dependent: set(para_from).
% 1.75/1.97 dependent: set(para_into).
% 1.75/1.97 dependent: clear(para_from_right).
% 1.75/1.97 dependent: clear(para_into_right).
% 1.75/1.97 dependent: set(para_from_vars).
% 1.75/1.97 dependent: set(eq_units_both_ways).
% 1.75/1.97 dependent: set(dynamic_demod_all).
% 1.75/1.97 dependent: set(dynamic_demod).
% 1.75/1.97 dependent: set(order_eq).
% 1.75/1.97 dependent: set(back_demod).
% 1.75/1.97 dependent: set(lrpo).
% 1.75/1.97 dependent: set(hyper_res).
% 1.75/1.97 dependent: clear(order_hyper).
% 1.75/1.97
% 1.75/1.97 ------------> process usable:
% 1.75/1.97 ** KEPT (pick-wt=16): 1 [] -sum(A,B,C)| -sum(B,D,E)| -sum(C,D,F)|sum(A,E,F).
% 1.75/1.97 ** KEPT (pick-wt=16): 2 [] -sum(A,B,C)| -sum(B,D,E)| -sum(A,E,F)|sum(C,D,F).
% 1.75/1.97 ** KEPT (pick-wt=8): 3 [] -sum(A,B,C)|sum(B,A,C).
% 1.75/1.97 ** KEPT (pick-wt=16): 4 [] -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 1.75/1.97 ** KEPT (pick-wt=16): 5 [] -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 1.75/1.97 ** KEPT (pick-wt=20): 6 [] -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -product(A,F,G)|sum(C,E,G).
% 1.89/2.07 ** KEPT (pick-wt=20): 7 [] -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -sum(C,E,G)|product(A,F,G).
% 1.89/2.07 ** KEPT (pick-wt=20): 8 [] -product(A,B,C)| -product(D,B,E)| -sum(A,D,F)| -product(F,B,G)|sum(C,E,G).
% 1.89/2.07 ** KEPT (pick-wt=20): 9 [] -product(A,B,C)| -product(D,B,E)| -sum(A,D,F)| -sum(C,E,G)|product(F,B,G).
% 1.89/2.07 ** KEPT (pick-wt=11): 10 [] -sum(A,B,C)| -sum(A,B,D)|C=D.
% 1.89/2.07 ** KEPT (pick-wt=11): 11 [] -product(A,B,C)| -product(A,B,D)|C=D.
% 1.89/2.07 ** KEPT (pick-wt=3): 13 [copy,12,flip.1] d!=c.
% 1.89/2.07
% 1.89/2.07 ------------> process sos:
% 1.89/2.07 ** KEPT (pick-wt=3): 14 [] A=A.
% 1.89/2.07 ** KEPT (pick-wt=4): 15 [] sum(additive_identity,A,A).
% 1.89/2.07 ** KEPT (pick-wt=4): 16 [] sum(A,additive_identity,A).
% 1.89/2.07 ** KEPT (pick-wt=6): 17 [] product(A,B,multiply(A,B)).
% 1.89/2.07 ** KEPT (pick-wt=6): 18 [] sum(A,B,add(A,B)).
% 1.89/2.07 ** KEPT (pick-wt=5): 19 [] sum(additive_inverse(A),A,additive_identity).
% 1.89/2.07 ** KEPT (pick-wt=5): 20 [] sum(A,additive_inverse(A),additive_identity).
% 1.89/2.07 ** KEPT (pick-wt=6): 21 [] sum(A,add(A,B),B).
% 1.89/2.07 ** KEPT (pick-wt=6): 22 [] sum(add(A,B),B,A).
% 1.89/2.07 ** KEPT (pick-wt=4): 23 [] sum(A,A,additive_identity).
% 1.89/2.07 ** KEPT (pick-wt=5): 24 [] add(A,additive_identity)=A.
% 1.89/2.07 ---> New Demodulator: 25 [new_demod,24] add(A,additive_identity)=A.
% 1.89/2.07 ** KEPT (pick-wt=5): 26 [] add(A,A)=additive_identity.
% 1.89/2.07 ---> New Demodulator: 27 [new_demod,26] add(A,A)=additive_identity.
% 1.89/2.07 ** KEPT (pick-wt=5): 28 [] multiply(A,A)=A.
% 1.89/2.07 ---> New Demodulator: 29 [new_demod,28] multiply(A,A)=A.
% 1.89/2.07 ** KEPT (pick-wt=5): 30 [] multiply(a,b)=c.
% 1.89/2.07 ---> New Demodulator: 31 [new_demod,30] multiply(a,b)=c.
% 1.89/2.07 ** KEPT (pick-wt=5): 32 [] multiply(b,a)=d.
% 1.89/2.07 ---> New Demodulator: 33 [new_demod,32] multiply(b,a)=d.
% 1.89/2.07 ** KEPT (pick-wt=6): 34 [] sum(A,B,add(B,A)).
% 1.89/2.07 ** KEPT (pick-wt=4): 35 [] product(a,c,c).
% 1.89/2.07 ** KEPT (pick-wt=4): 36 [] product(b,d,d).
% 1.89/2.07 ** KEPT (pick-wt=4): 37 [] product(c,b,c).
% 1.89/2.07 ** KEPT (pick-wt=4): 38 [] product(d,a,d).
% 1.89/2.07 ** KEPT (pick-wt=8): 39 [] product(A,multiply(A,B),multiply(A,B)).
% 1.89/2.07 ** KEPT (pick-wt=8): 40 [] product(a,multiply(b,A),multiply(B,A)).
% 1.89/2.07 ** KEPT (pick-wt=6): 41 [] product(a,b,multiply(c,b)).
% 1.89/2.07 ** KEPT (pick-wt=6): 42 [] product(a,multiply(b,c),c).
% 1.89/2.07 ** KEPT (pick-wt=8): 43 [] product(b,multiply(a,A),multiply(d,A)).
% 1.89/2.07 ** KEPT (pick-wt=6): 44 [] product(b,a,multiply(d,a)).
% 1.89/2.07 ** KEPT (pick-wt=6): 45 [] product(b,multiply(a,d),d).
% 1.89/2.07 ** KEPT (pick-wt=6): 46 [] product(b,c,multiply(d,b)).
% 1.89/2.07 ** KEPT (pick-wt=6): 47 [] product(a,d,multiply(c,a)).
% 1.89/2.07 ** KEPT (pick-wt=8): 48 [] product(multiply(A,B),B,multiply(A,B)).
% 1.89/2.07 ** KEPT (pick-wt=8): 49 [] product(multiply(A,a),b,multiply(A,c)).
% 1.89/2.07 ** KEPT (pick-wt=6): 50 [] product(a,b,multiply(a,c)).
% 1.89/2.07 ** KEPT (pick-wt=6): 51 [] product(multiply(c,a),b,c).
% 1.89/2.07 ** KEPT (pick-wt=6): 52 [] product(d,b,multiply(b,c)).
% 1.89/2.07 ** KEPT (pick-wt=8): 53 [] product(multiply(A,b),a,multiply(A,d)).
% 1.89/2.07 ** KEPT (pick-wt=6): 54 [] product(b,a,multiply(b,d)).
% 1.89/2.07 ** KEPT (pick-wt=6): 55 [] product(multiply(d,b),a,d).
% 1.89/2.07 ** KEPT (pick-wt=6): 56 [] product(c,a,multiply(a,d)).
% 1.89/2.07 ** KEPT (pick-wt=8): 57 [] product(a,add(b,a),add(c,a)).
% 1.89/2.07 ** KEPT (pick-wt=8): 58 [] product(a,add(a,b),add(a,c)).
% 1.89/2.07 ** KEPT (pick-wt=8): 59 [] product(b,add(a,b),add(d,b)).
% 1.89/2.07 ** KEPT (pick-wt=8): 60 [] product(b,add(b,a),add(b,d)).
% 1.89/2.07 ** KEPT (pick-wt=8): 61 [] product(add(a,b),b,add(c,b)).
% 1.89/2.07 ** KEPT (pick-wt=8): 62 [] product(add(b,a),b,add(b,c)).
% 1.89/2.07 ** KEPT (pick-wt=8): 63 [] product(add(b,a),a,add(d,a)).
% 1.89/2.07 ** KEPT (pick-wt=8): 64 [] product(add(a,b),a,add(a,d)).
% 1.89/2.07 ** KEPT (pick-wt=4): 65 [] product(A,A,A).
% 1.89/2.07 ** KEPT (pick-wt=4): 66 [] product(a,b,c).
% 1.89/2.07 ** KEPT (pick-wt=4): 67 [] product(b,a,d).
% 1.89/2.07 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] A=A.
% 1.89/2.07 >>>> Starting back demodulation with 25.
% 1.89/2.07 >>>> Starting back demodulation with 27.
% 1.89/2.07 >>>> Starting back demodulation with 29.
% 1.89/2.07 >>>> Starting back demodulation with 31.
% 1.89/2.07 >>>> Starting back demodulation with 33.
% 1.89/2.07
% 1.89/2.07 ======= end of input processing =======
% 1.89/2.07
% 1.89/2.07 =========== start of search ===========
% 1.89/2.07
% 1.89/2.07 -------- PROOF --------
% 1.89/2.07
% 1.89/2.07 ----> UNIT CONFLICT at 0.11 sec ----> 1690 [binary,1688.1,1657.1] $F.
% 1.89/2.07
% 1.89/2.07 Length of proof is 13. Level of proof is 5.
% 1.89/2.07
% 1.89/2.07 ---------------- PROOF ----------------
% 1.89/2.07 % SZS status Unsatisfiable
% 1.89/2.07 % SZS output start Refutation
% See solution above
% 1.89/2.07 ------------ end of proof -------------
% 1.89/2.07
% 1.89/2.07
% 1.89/2.07 Search stopped by max_proofs option.
% 1.89/2.07
% 1.89/2.07
% 1.89/2.07 Search stopped by max_proofs option.
% 1.89/2.07
% 1.89/2.07 ============ end of search ============
% 1.89/2.07
% 1.89/2.07 -------------- statistics -------------
% 1.89/2.07 clauses given 42
% 1.89/2.07 clauses generated 9354
% 1.89/2.07 clauses kept 1656
% 1.89/2.07 clauses forward subsumed 8564
% 1.89/2.07 clauses back subsumed 27
% 1.89/2.07 Kbytes malloced 2929
% 1.89/2.07
% 1.89/2.07 ----------- times (seconds) -----------
% 1.89/2.07 user CPU time 0.11 (0 hr, 0 min, 0 sec)
% 1.89/2.07 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.89/2.07 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.89/2.07
% 1.89/2.07 That finishes the proof of the theorem.
% 1.89/2.07
% 1.89/2.07 Process 28455 finished Wed Jul 27 02:09:22 2022
% 1.89/2.07 Otter interrupted
% 1.89/2.07 PROOF FOUND
%------------------------------------------------------------------------------