TSTP Solution File: RNG008-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : RNG008-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:02 EDT 2022
% Result : Unsatisfiable 2.58s 2.83s
% Output : Refutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 20
% Syntax : Number of clauses : 66 ( 54 unt; 0 nHn; 30 RR)
% Number of literals : 101 ( 13 equ; 36 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; 4 con; 0-2 aty)
% Number of variables : 113 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ sum(A,B,C)
| ~ sum(B,D,E)
| ~ sum(C,D,F)
| sum(A,E,F) ),
file('RNG008-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ sum(A,B,C)
| ~ sum(B,D,E)
| ~ sum(A,E,F)
| sum(C,D,F) ),
file('RNG008-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ sum(A,B,C)
| sum(B,A,C) ),
file('RNG008-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ product(A,B,C)
| ~ product(B,D,E)
| ~ product(C,D,F)
| product(A,E,F) ),
file('RNG008-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ product(A,B,C)
| ~ product(B,D,E)
| ~ product(A,E,F)
| product(C,D,F) ),
file('RNG008-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ product(A,B,C)
| ~ product(A,D,E)
| ~ sum(B,D,F)
| ~ product(A,F,G)
| sum(C,E,G) ),
file('RNG008-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ product(A,B,C)
| ~ product(A,D,E)
| ~ sum(B,D,F)
| ~ sum(C,E,G)
| product(A,F,G) ),
file('RNG008-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('RNG008-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('RNG008-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ sum(A,B,C)
| ~ sum(A,B,D)
| C = D ),
file('RNG008-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ product(A,B,C)
| ~ product(A,B,D)
| C = D ),
file('RNG008-1.p',unknown),
[] ).
cnf(12,axiom,
~ product(b,a,c),
file('RNG008-1.p',unknown),
[] ).
cnf(14,axiom,
sum(additive_identity,A,A),
file('RNG008-1.p',unknown),
[] ).
cnf(15,axiom,
sum(A,additive_identity,A),
file('RNG008-1.p',unknown),
[] ).
cnf(16,axiom,
product(A,B,multiply(A,B)),
file('RNG008-1.p',unknown),
[] ).
cnf(17,axiom,
sum(A,B,add(A,B)),
file('RNG008-1.p',unknown),
[] ).
cnf(18,axiom,
sum(additive_inverse(A),A,additive_identity),
file('RNG008-1.p',unknown),
[] ).
cnf(19,axiom,
sum(A,additive_inverse(A),additive_identity),
file('RNG008-1.p',unknown),
[] ).
cnf(20,axiom,
product(A,A,A),
file('RNG008-1.p',unknown),
[] ).
cnf(21,axiom,
product(a,b,c),
file('RNG008-1.p',unknown),
[] ).
cnf(26,plain,
product(c,b,c),
inference(hyper,[status(thm)],[21,5,21,20]),
[iquote('hyper,21,5,21,20')] ).
cnf(27,plain,
product(a,c,c),
inference(hyper,[status(thm)],[21,4,20,21]),
[iquote('hyper,21,4,20,21')] ).
cnf(37,plain,
multiply(A,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[16,11,20])]),
[iquote('hyper,16,11,20,flip.1')] ).
cnf(39,plain,
sum(A,multiply(additive_identity,A),A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[16,8,20,16,15]),37]),
[iquote('hyper,16,8,20,16,15,demod,37')] ).
cnf(45,plain,
sum(A,multiply(A,additive_identity),A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[16,6,20,16,15]),37]),
[iquote('hyper,16,6,20,16,15,demod,37')] ).
cnf(50,plain,
product(c,A,multiply(a,multiply(b,A))),
inference(hyper,[status(thm)],[16,5,21,16]),
[iquote('hyper,16,5,21,16')] ).
cnf(65,plain,
product(A,multiply(B,multiply(A,B)),multiply(A,B)),
inference(hyper,[status(thm)],[16,4,16,20]),
[iquote('hyper,16,4,16,20')] ).
cnf(66,plain,
( product(A,B,C)
| ~ product(D,E,multiply(A,B))
| ~ product(D,E,C) ),
inference(para_into,[status(thm),theory(equality)],[16,11]),
[iquote('para_into,16.1.3,11.3.1')] ).
cnf(83,plain,
product(multiply(c,a),c,c),
inference(hyper,[status(thm)],[27,5,16,20]),
[iquote('hyper,27,5,16,20')] ).
cnf(86,plain,
product(A,c,multiply(multiply(A,a),c)),
inference(hyper,[status(thm)],[27,4,16,16]),
[iquote('hyper,27,4,16,16')] ).
cnf(95,plain,
additive_inverse(additive_identity) = additive_identity,
inference(hyper,[status(thm)],[18,10,15]),
[iquote('hyper,18,10,15')] ).
cnf(107,plain,
sum(multiply(A,additive_inverse(A)),A,multiply(A,additive_identity)),
inference(hyper,[status(thm)],[18,6,16,20,16]),
[iquote('hyper,18,6,16,20,16')] ).
cnf(110,plain,
sum(additive_identity,A,additive_inverse(additive_inverse(A))),
inference(hyper,[status(thm)],[18,2,18,15]),
[iquote('hyper,18,2,18,15')] ).
cnf(121,plain,
add(A,additive_identity) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[17,10,15])]),
[iquote('hyper,17,10,15,flip.1')] ).
cnf(123,plain,
add(additive_identity,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[17,10,14])]),
[iquote('hyper,17,10,14,flip.1')] ).
cnf(130,plain,
product(add(c,b),b,add(c,b)),
inference(hyper,[status(thm)],[17,9,26,20,17]),
[iquote('hyper,17,9,26,20,17')] ).
cnf(185,plain,
product(a,add(c,a),add(c,a)),
inference(hyper,[status(thm)],[17,7,27,20,17]),
[iquote('hyper,17,7,27,20,17')] ).
cnf(242,plain,
sum(A,B,add(B,A)),
inference(hyper,[status(thm)],[17,3]),
[iquote('hyper,17,3')] ).
cnf(244,plain,
sum(add(A,additive_inverse(B)),B,A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[17,2,17,18]),121]),
[iquote('hyper,17,2,17,18,demod,121')] ).
cnf(263,plain,
sum(A,multiply(additive_inverse(A),A),multiply(additive_identity,A)),
inference(hyper,[status(thm)],[19,8,20,16,16]),
[iquote('hyper,19,8,20,16,16')] ).
cnf(276,plain,
sum(A,multiply(A,additive_inverse(A)),multiply(A,additive_identity)),
inference(hyper,[status(thm)],[19,6,20,16,16]),
[iquote('hyper,19,6,20,16,16')] ).
cnf(374,plain,
sum(additive_identity,multiply(additive_identity,A),additive_identity),
inference(hyper,[status(thm)],[39,2,18,18]),
[iquote('hyper,39,2,18,18')] ).
cnf(558,plain,
sum(additive_identity,multiply(A,additive_identity),additive_identity),
inference(hyper,[status(thm)],[45,2,18,18]),
[iquote('hyper,45,2,18,18')] ).
cnf(930,plain,
multiply(multiply(c,a),c) = c,
inference(hyper,[status(thm)],[83,11,16]),
[iquote('hyper,83,11,16')] ).
cnf(1011,plain,
additive_inverse(additive_inverse(A)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[110,10,17]),123])]),
[iquote('hyper,110,10,17,demod,123,flip.1')] ).
cnf(1142,plain,
sum(add(A,B),additive_inverse(A),B),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[242,2,242,19]),123]),
[iquote('hyper,242,2,242,19,demod,123')] ).
cnf(1143,plain,
sum(add(additive_inverse(A),B),A,B),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[242,2,242,18]),123]),
[iquote('hyper,242,2,242,18,demod,123')] ).
cnf(1342,plain,
multiply(additive_identity,A) = additive_identity,
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[374,10,242]),121]),
[iquote('hyper,374,10,242,demod,121')] ).
cnf(1362,plain,
sum(A,multiply(additive_inverse(A),A),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[263]),1342]),
[iquote('back_demod,263,demod,1342')] ).
cnf(1381,plain,
multiply(A,additive_identity) = additive_identity,
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[558,10,242]),121]),
[iquote('hyper,558,10,242,demod,121')] ).
cnf(1393,plain,
sum(A,multiply(A,additive_inverse(A)),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[276]),1381]),
[iquote('back_demod,276,demod,1381')] ).
cnf(1398,plain,
sum(multiply(A,additive_inverse(A)),A,additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[107]),1381]),
[iquote('back_demod,107,demod,1381')] ).
cnf(2613,plain,
sum(additive_identity,multiply(A,additive_inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[1362,2,1142,244]),95,1011]),
[iquote('hyper,1362,2,1142,244,demod,95,1011')] ).
cnf(2826,plain,
multiply(A,additive_inverse(A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2613,10,242]),121]),
[iquote('hyper,2613,10,242,demod,121')] ).
cnf(2828,plain,
sum(A,A,additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2613,2,1143,1393]),95,123,95,123,2826,95,123,95,123,2826,2826]),
[iquote('hyper,2613,2,1143,1393,demod,95,123,95,123,2826,95,123,95,123,2826,2826')] ).
cnf(2835,plain,
sum(A,add(A,B),B),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2613,1,1398,17]),2826,2826]),
[iquote('hyper,2613,1,1398,17,demod,2826,2826')] ).
cnf(2914,plain,
sum(add(A,B),B,A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2828,2,17,1143]),95,123]),
[iquote('hyper,2828,2,17,1143,demod,95,123')] ).
cnf(3079,plain,
product(add(c,b),c,additive_identity),
inference(hyper,[status(thm)],[130,7,20,2914,2828]),
[iquote('hyper,130,7,20,2914,2828')] ).
cnf(3086,plain,
product(b,c,c),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[3079,9,86,2835,242]),930,123]),
[iquote('hyper,3079,9,86,2835,242,demod,930,123')] ).
cnf(3146,plain,
multiply(multiply(b,a),c) = c,
inference(hyper,[status(thm)],[3086,11,86]),
[iquote('hyper,3086,11,86')] ).
cnf(3196,plain,
product(c,a,multiply(b,a)),
inference(hyper,[status(thm)],[3086,5,50,65]),
[iquote('hyper,3086,5,50,65')] ).
cnf(3254,plain,
multiply(c,a) = multiply(b,a),
inference(hyper,[status(thm)],[3196,11,16]),
[iquote('hyper,3196,11,16')] ).
cnf(3300,plain,
product(c,add(c,a),additive_identity),
inference(hyper,[status(thm)],[185,9,20,2914,2828]),
[iquote('hyper,185,9,20,2914,2828')] ).
cnf(3310,plain,
product(c,a,c),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[3300,7,86,2835,242]),3254,3146,123]),
[iquote('hyper,3300,7,86,2835,242,demod,3254,3146,123')] ).
cnf(3348,plain,
product(b,a,c),
inference(hyper,[status(thm)],[3310,66,3196]),
[iquote('hyper,3310,66,3196')] ).
cnf(3349,plain,
$false,
inference(binary,[status(thm)],[3348,12]),
[iquote('binary,3348.1,12.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : RNG008-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n019.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 02:11:37 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.92/2.11 ----- Otter 3.3f, August 2004 -----
% 1.92/2.11 The process was started by sandbox2 on n019.cluster.edu,
% 1.92/2.11 Wed Jul 27 02:11:37 2022
% 1.92/2.11 The command was "./otter". The process ID is 8635.
% 1.92/2.11
% 1.92/2.11 set(prolog_style_variables).
% 1.92/2.11 set(auto).
% 1.92/2.11 dependent: set(auto1).
% 1.92/2.11 dependent: set(process_input).
% 1.92/2.11 dependent: clear(print_kept).
% 1.92/2.11 dependent: clear(print_new_demod).
% 1.92/2.11 dependent: clear(print_back_demod).
% 1.92/2.11 dependent: clear(print_back_sub).
% 1.92/2.11 dependent: set(control_memory).
% 1.92/2.11 dependent: assign(max_mem, 12000).
% 1.92/2.11 dependent: assign(pick_given_ratio, 4).
% 1.92/2.11 dependent: assign(stats_level, 1).
% 1.92/2.11 dependent: assign(max_seconds, 10800).
% 1.92/2.11 clear(print_given).
% 1.92/2.11
% 1.92/2.11 list(usable).
% 1.92/2.11 0 [] A=A.
% 1.92/2.11 0 [] sum(additive_identity,X,X).
% 1.92/2.11 0 [] sum(X,additive_identity,X).
% 1.92/2.11 0 [] product(X,Y,multiply(X,Y)).
% 1.92/2.11 0 [] sum(X,Y,add(X,Y)).
% 1.92/2.11 0 [] sum(additive_inverse(X),X,additive_identity).
% 1.92/2.11 0 [] sum(X,additive_inverse(X),additive_identity).
% 1.92/2.11 0 [] -sum(X,Y,U)| -sum(Y,Z,V)| -sum(U,Z,W)|sum(X,V,W).
% 1.92/2.11 0 [] -sum(X,Y,U)| -sum(Y,Z,V)| -sum(X,V,W)|sum(U,Z,W).
% 1.92/2.11 0 [] -sum(X,Y,Z)|sum(Y,X,Z).
% 1.92/2.11 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(U,Z,W)|product(X,V,W).
% 1.92/2.11 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(X,V,W)|product(U,Z,W).
% 1.92/2.11 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -product(X,V3,V4)|sum(V1,V2,V4).
% 1.92/2.11 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(X,V3,V4).
% 1.92/2.11 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -product(V3,X,V4)|sum(V1,V2,V4).
% 1.92/2.11 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(V3,X,V4).
% 1.92/2.11 0 [] -sum(X,Y,U)| -sum(X,Y,V)|U=V.
% 1.92/2.11 0 [] -product(X,Y,U)| -product(X,Y,V)|U=V.
% 1.92/2.11 0 [] product(X,X,X).
% 1.92/2.11 0 [] product(a,b,c).
% 1.92/2.11 0 [] -product(b,a,c).
% 1.92/2.11 end_of_list.
% 1.92/2.11
% 1.92/2.11 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=5.
% 1.92/2.11
% 1.92/2.11 This is a Horn set with equality. The strategy will be
% 1.92/2.11 Knuth-Bendix and hyper_res, with positive clauses in
% 1.92/2.11 sos and nonpositive clauses in usable.
% 1.92/2.11
% 1.92/2.11 dependent: set(knuth_bendix).
% 1.92/2.11 dependent: set(anl_eq).
% 1.92/2.11 dependent: set(para_from).
% 1.92/2.11 dependent: set(para_into).
% 1.92/2.11 dependent: clear(para_from_right).
% 1.92/2.11 dependent: clear(para_into_right).
% 1.92/2.11 dependent: set(para_from_vars).
% 1.92/2.11 dependent: set(eq_units_both_ways).
% 1.92/2.11 dependent: set(dynamic_demod_all).
% 1.92/2.11 dependent: set(dynamic_demod).
% 1.92/2.11 dependent: set(order_eq).
% 1.92/2.11 dependent: set(back_demod).
% 1.92/2.11 dependent: set(lrpo).
% 1.92/2.11 dependent: set(hyper_res).
% 1.92/2.11 dependent: clear(order_hyper).
% 1.92/2.11
% 1.92/2.11 ------------> process usable:
% 1.92/2.11 ** KEPT (pick-wt=16): 1 [] -sum(A,B,C)| -sum(B,D,E)| -sum(C,D,F)|sum(A,E,F).
% 1.92/2.11 ** KEPT (pick-wt=16): 2 [] -sum(A,B,C)| -sum(B,D,E)| -sum(A,E,F)|sum(C,D,F).
% 1.92/2.11 ** KEPT (pick-wt=8): 3 [] -sum(A,B,C)|sum(B,A,C).
% 1.92/2.11 ** KEPT (pick-wt=16): 4 [] -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 1.92/2.11 ** KEPT (pick-wt=16): 5 [] -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 1.92/2.11 ** 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.92/2.11 ** 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.92/2.11 ** 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.92/2.11 ** 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.92/2.11 ** KEPT (pick-wt=11): 10 [] -sum(A,B,C)| -sum(A,B,D)|C=D.
% 1.92/2.11 ** KEPT (pick-wt=11): 11 [] -product(A,B,C)| -product(A,B,D)|C=D.
% 1.92/2.11 ** KEPT (pick-wt=4): 12 [] -product(b,a,c).
% 1.92/2.11
% 1.92/2.11 ------------> process sos:
% 1.92/2.11 ** KEPT (pick-wt=3): 13 [] A=A.
% 1.92/2.11 ** KEPT (pick-wt=4): 14 [] sum(additive_identity,A,A).
% 1.92/2.11 ** KEPT (pick-wt=4): 15 [] sum(A,additive_identity,A).
% 1.92/2.11 ** KEPT (pick-wt=6): 16 [] product(A,B,multiply(A,B)).
% 1.92/2.11 ** KEPT (pick-wt=6): 17 [] sum(A,B,add(A,B)).
% 1.92/2.11 ** KEPT (pick-wt=5): 18 [] sum(additive_inverse(A),A,additive_identity).
% 1.92/2.11 ** KEPT (pick-wt=5): 19 [] sum(A,additive_inverse(A),additive_identity).
% 1.92/2.11 ** KEPT (pick-wt=4): 20 [] product(A,A,A).
% 1.92/2.11 ** KEPT (pick-wt=4): 21 [] product(a,b,c).
% 1.92/2.11 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] A=A.
% 1.92/2.11
% 1.92/2.11 ======= end of input processing =======
% 1.92/2.11
% 1.92/2.11 =========== start of search ===========
% 1.92/2.11
% 1.92/2.11
% 1.92/2.11 Resetting weight limit to 8.
% 1.92/2.11
% 1.92/2.11
% 1.92/2.11 Resetting weight limit to 8.
% 2.58/2.83
% 2.58/2.83 sos_size=1876
% 2.58/2.83
% 2.58/2.83 -------- PROOF --------
% 2.58/2.83
% 2.58/2.83 ----> UNIT CONFLICT at 0.88 sec ----> 3349 [binary,3348.1,12.1] $F.
% 2.58/2.83
% 2.58/2.83 Length of proof is 45. Level of proof is 15.
% 2.58/2.83
% 2.58/2.83 ---------------- PROOF ----------------
% 2.58/2.83 % SZS status Unsatisfiable
% 2.58/2.83 % SZS output start Refutation
% See solution above
% 2.58/2.83 ------------ end of proof -------------
% 2.58/2.83
% 2.58/2.83
% 2.58/2.83 Search stopped by max_proofs option.
% 2.58/2.83
% 2.58/2.83
% 2.58/2.83 Search stopped by max_proofs option.
% 2.58/2.83
% 2.58/2.83 ============ end of search ============
% 2.58/2.83
% 2.58/2.83 -------------- statistics -------------
% 2.58/2.83 clauses given 173
% 2.58/2.83 clauses generated 235265
% 2.58/2.83 clauses kept 3268
% 2.58/2.83 clauses forward subsumed 89978
% 2.58/2.83 clauses back subsumed 39
% 2.58/2.83 Kbytes malloced 5859
% 2.58/2.83
% 2.58/2.83 ----------- times (seconds) -----------
% 2.58/2.83 user CPU time 0.88 (0 hr, 0 min, 0 sec)
% 2.58/2.83 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.58/2.83 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.58/2.83
% 2.58/2.83 That finishes the proof of the theorem.
% 2.58/2.83
% 2.58/2.83 Process 8635 finished Wed Jul 27 02:11:39 2022
% 2.58/2.83 Otter interrupted
% 2.58/2.83 PROOF FOUND
%------------------------------------------------------------------------------