TSTP Solution File: BOO014-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : BOO014-3 : TPTP v8.1.0. Bugfixed v2.2.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 12:47:35 EDT 2022
% Result : Unsatisfiable 2.83s 3.06s
% Output : Refutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 23
% Syntax : Number of clauses : 57 ( 46 unt; 0 nHn; 33 RR)
% Number of literals : 91 ( 14 equ; 35 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 89 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ sum(A,B,C)
| sum(B,A,C) ),
file('BOO014-3.p',unknown),
[] ).
cnf(2,axiom,
( ~ product(A,B,C)
| product(B,A,C) ),
file('BOO014-3.p',unknown),
[] ).
cnf(3,axiom,
( ~ product(A,B,C)
| ~ product(A,D,E)
| ~ sum(B,D,F)
| ~ product(A,F,G)
| sum(C,E,G) ),
file('BOO014-3.p',unknown),
[] ).
cnf(5,axiom,
( ~ product(A,B,C)
| ~ product(D,B,E)
| ~ sum(A,D,F)
| ~ product(F,B,G)
| sum(C,E,G) ),
file('BOO014-3.p',unknown),
[] ).
cnf(6,axiom,
( ~ product(A,B,C)
| ~ product(D,B,E)
| ~ sum(A,D,F)
| ~ sum(C,E,G)
| product(F,B,G) ),
file('BOO014-3.p',unknown),
[] ).
cnf(8,axiom,
( ~ sum(A,B,C)
| ~ sum(A,D,E)
| ~ product(B,D,F)
| ~ product(C,E,G)
| sum(A,F,G) ),
file('BOO014-3.p',unknown),
[] ).
cnf(9,axiom,
( ~ sum(A,B,C)
| ~ sum(D,B,E)
| ~ product(A,D,F)
| ~ sum(F,B,G)
| product(C,E,G) ),
file('BOO014-3.p',unknown),
[] ).
cnf(10,axiom,
( ~ sum(A,B,C)
| ~ sum(D,B,E)
| ~ product(A,D,F)
| ~ product(C,E,G)
| sum(F,B,G) ),
file('BOO014-3.p',unknown),
[] ).
cnf(11,axiom,
( ~ sum(A,B,C)
| ~ sum(A,B,D)
| C = D ),
file('BOO014-3.p',unknown),
[] ).
cnf(12,axiom,
( ~ product(A,B,C)
| ~ product(A,B,D)
| C = D ),
file('BOO014-3.p',unknown),
[] ).
cnf(13,axiom,
( ~ sum(A,B,multiplicative_identity)
| ~ sum(A,C,multiplicative_identity)
| ~ product(A,B,additive_identity)
| ~ product(A,C,additive_identity)
| B = C ),
file('BOO014-3.p',unknown),
[] ).
cnf(14,axiom,
inverse(x_plus_y) != x_inverse_times_y_inverse,
file('BOO014-3.p',unknown),
[] ).
cnf(16,axiom,
sum(A,B,add(A,B)),
file('BOO014-3.p',unknown),
[] ).
cnf(17,axiom,
product(A,B,multiply(A,B)),
file('BOO014-3.p',unknown),
[] ).
cnf(18,axiom,
sum(additive_identity,A,A),
file('BOO014-3.p',unknown),
[] ).
cnf(20,axiom,
product(multiplicative_identity,A,A),
file('BOO014-3.p',unknown),
[] ).
cnf(21,axiom,
product(A,multiplicative_identity,A),
file('BOO014-3.p',unknown),
[] ).
cnf(22,axiom,
sum(inverse(A),A,multiplicative_identity),
file('BOO014-3.p',unknown),
[] ).
cnf(23,axiom,
sum(A,inverse(A),multiplicative_identity),
file('BOO014-3.p',unknown),
[] ).
cnf(25,axiom,
product(A,inverse(A),additive_identity),
file('BOO014-3.p',unknown),
[] ).
cnf(27,axiom,
inverse(inverse(A)) = A,
file('BOO014-3.p',unknown),
[] ).
cnf(28,axiom,
sum(x,y,x_plus_y),
file('BOO014-3.p',unknown),
[] ).
cnf(29,axiom,
product(inverse(x),inverse(y),x_inverse_times_y_inverse),
file('BOO014-3.p',unknown),
[] ).
cnf(45,plain,
add(additive_identity,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[16,11,18])]),
[iquote('hyper,16,11,18,flip.1')] ).
cnf(47,plain,
product(A,add(multiplicative_identity,A),A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[16,9,18,16,21]),45]),
[iquote('hyper,16,9,18,16,21,demod,45')] ).
cnf(60,plain,
sum(A,B,add(B,A)),
inference(hyper,[status(thm)],[16,1]),
[iquote('hyper,16,1')] ).
cnf(70,plain,
sum(y,x,x_plus_y),
inference(hyper,[status(thm)],[28,1]),
[iquote('hyper,28,1')] ).
cnf(98,plain,
add(inverse(A),A) = multiplicative_identity,
inference(hyper,[status(thm)],[22,11,16]),
[iquote('hyper,22,11,16')] ).
cnf(100,plain,
product(multiplicative_identity,add(multiplicative_identity,A),multiplicative_identity),
inference(hyper,[status(thm)],[22,9,22,16,21]),
[iquote('hyper,22,9,22,16,21')] ).
cnf(115,plain,
multiply(A,multiplicative_identity) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[17,12,21])]),
[iquote('hyper,17,12,21,flip.1')] ).
cnf(117,plain,
multiply(multiplicative_identity,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[17,12,20])]),
[iquote('hyper,17,12,20,flip.1')] ).
cnf(270,plain,
sum(A,A,multiply(A,add(multiplicative_identity,multiplicative_identity))),
inference(hyper,[status(thm)],[17,3,21,21,16]),
[iquote('hyper,17,3,21,21,16')] ).
cnf(282,plain,
product(A,B,multiply(B,A)),
inference(hyper,[status(thm)],[17,2]),
[iquote('hyper,17,2')] ).
cnf(413,plain,
multiply(A,inverse(A)) = additive_identity,
inference(hyper,[status(thm)],[25,12,17]),
[iquote('hyper,25,12,17')] ).
cnf(573,plain,
add(multiplicative_identity,multiplicative_identity) = multiplicative_identity,
inference(hyper,[status(thm)],[47,12,20]),
[iquote('hyper,47,12,20')] ).
cnf(663,plain,
sum(A,A,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[270]),573,115]),
[iquote('back_demod,270,demod,573,115')] ).
cnf(1389,plain,
sum(x_inverse_times_y_inverse,inverse(y),multiply(add(multiplicative_identity,inverse(x)),inverse(y))),
inference(hyper,[status(thm)],[60,5,29,20,17]),
[iquote('hyper,60,5,29,20,17')] ).
cnf(1480,plain,
sum(x_inverse_times_y_inverse,inverse(x),multiply(inverse(x),add(multiplicative_identity,inverse(y)))),
inference(hyper,[status(thm)],[60,3,29,21,17]),
[iquote('hyper,60,3,29,21,17')] ).
cnf(1511,plain,
sum(multiply(A,B),A,multiply(A,add(multiplicative_identity,B))),
inference(hyper,[status(thm)],[60,3,17,21,17]),
[iquote('hyper,60,3,17,21,17')] ).
cnf(2482,plain,
add(multiplicative_identity,A) = multiplicative_identity,
inference(hyper,[status(thm)],[100,12,20]),
[iquote('hyper,100,12,20')] ).
cnf(2484,plain,
sum(multiplicative_identity,A,multiplicative_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[100,10,16,16,17]),2482,2482,2482,115]),
[iquote('hyper,100,10,16,16,17,demod,2482,2482,2482,115')] ).
cnf(2499,plain,
sum(multiply(A,B),A,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1511]),2482,115]),
[iquote('back_demod,1511,demod,2482,115')] ).
cnf(2500,plain,
sum(x_inverse_times_y_inverse,inverse(x),inverse(x)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1480]),2482,115]),
[iquote('back_demod,1480,demod,2482,115')] ).
cnf(2505,plain,
sum(x_inverse_times_y_inverse,inverse(y),inverse(y)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1389]),2482,117]),
[iquote('back_demod,1389,demod,2482,117')] ).
cnf(2522,plain,
multiply(inverse(y),inverse(x)) = x_inverse_times_y_inverse,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[282,12,29])]),
[iquote('hyper,282,12,29,flip.1')] ).
cnf(2611,plain,
product(x,x_plus_y,x),
inference(hyper,[status(thm)],[2499,9,663,70,17]),
[iquote('hyper,2499,9,663,70,17')] ).
cnf(2613,plain,
product(y,x_plus_y,y),
inference(hyper,[status(thm)],[2499,9,663,28,17]),
[iquote('hyper,2499,9,663,28,17')] ).
cnf(2648,plain,
product(multiplicative_identity,add(inverse(x),x_plus_y),multiplicative_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2611,9,60,60,23]),98]),
[iquote('hyper,2611,9,60,60,23,demod,98')] ).
cnf(2676,plain,
product(multiplicative_identity,add(inverse(y),x_plus_y),multiplicative_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2613,9,60,60,23]),98]),
[iquote('hyper,2613,9,60,60,23,demod,98')] ).
cnf(2756,plain,
sum(multiply(x,x_inverse_times_y_inverse),additive_identity,additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2500,5,282,282,25]),27,27,413]),
[iquote('hyper,2500,5,282,282,25,demod,27,27,413')] ).
cnf(2786,plain,
sum(multiply(y,x_inverse_times_y_inverse),additive_identity,additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2505,5,282,282,25]),27,27,413]),
[iquote('hyper,2505,5,282,282,25,demod,27,27,413')] ).
cnf(2818,plain,
product(x,x_inverse_times_y_inverse,additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2756,9,60,60,17]),45,45]),
[iquote('hyper,2756,9,60,60,17,demod,45,45')] ).
cnf(2835,plain,
product(x_plus_y,x_inverse_times_y_inverse,additive_identity),
inference(hyper,[status(thm)],[2786,6,17,2818,70]),
[iquote('hyper,2786,6,17,2818,70')] ).
cnf(2855,plain,
sum(x_plus_y,inverse(x),multiplicative_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2648,10,2484,60,282]),115]),
[iquote('hyper,2648,10,2484,60,282,demod,115')] ).
cnf(2863,plain,
sum(x_plus_y,x_inverse_times_y_inverse,multiplicative_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2676,8,2855,60,282]),2522]),
[iquote('hyper,2676,8,2855,60,282,demod,2522')] ).
cnf(2876,plain,
inverse(x_plus_y) = x_inverse_times_y_inverse,
inference(hyper,[status(thm)],[2863,13,23,25,2835]),
[iquote('hyper,2863,13,23,25,2835')] ).
cnf(2878,plain,
$false,
inference(binary,[status(thm)],[2876,14]),
[iquote('binary,2876.1,14.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : BOO014-3 : TPTP v8.1.0. Bugfixed v2.2.0.
% 0.07/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:33:00 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.89/2.09 ----- Otter 3.3f, August 2004 -----
% 1.89/2.09 The process was started by sandbox on n013.cluster.edu,
% 1.89/2.09 Wed Jul 27 02:33:00 2022
% 1.89/2.09 The command was "./otter". The process ID is 448.
% 1.89/2.09
% 1.89/2.09 set(prolog_style_variables).
% 1.89/2.09 set(auto).
% 1.89/2.09 dependent: set(auto1).
% 1.89/2.09 dependent: set(process_input).
% 1.89/2.09 dependent: clear(print_kept).
% 1.89/2.09 dependent: clear(print_new_demod).
% 1.89/2.09 dependent: clear(print_back_demod).
% 1.89/2.09 dependent: clear(print_back_sub).
% 1.89/2.09 dependent: set(control_memory).
% 1.89/2.09 dependent: assign(max_mem, 12000).
% 1.89/2.09 dependent: assign(pick_given_ratio, 4).
% 1.89/2.09 dependent: assign(stats_level, 1).
% 1.89/2.09 dependent: assign(max_seconds, 10800).
% 1.89/2.09 clear(print_given).
% 1.89/2.09
% 1.89/2.09 list(usable).
% 1.89/2.09 0 [] A=A.
% 1.89/2.09 0 [] sum(X,Y,add(X,Y)).
% 1.89/2.09 0 [] product(X,Y,multiply(X,Y)).
% 1.89/2.09 0 [] -sum(X,Y,Z)|sum(Y,X,Z).
% 1.89/2.09 0 [] -product(X,Y,Z)|product(Y,X,Z).
% 1.89/2.09 0 [] sum(additive_identity,X,X).
% 1.89/2.09 0 [] sum(X,additive_identity,X).
% 1.89/2.09 0 [] product(multiplicative_identity,X,X).
% 1.89/2.09 0 [] product(X,multiplicative_identity,X).
% 1.89/2.09 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -product(X,V3,V4)|sum(V1,V2,V4).
% 1.89/2.09 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(X,V3,V4).
% 1.89/2.09 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -product(V3,X,V4)|sum(V1,V2,V4).
% 1.89/2.09 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(V3,X,V4).
% 1.89/2.09 0 [] -sum(X,Y,V1)| -sum(X,Z,V2)| -product(Y,Z,V3)| -sum(X,V3,V4)|product(V1,V2,V4).
% 1.89/2.09 0 [] -sum(X,Y,V1)| -sum(X,Z,V2)| -product(Y,Z,V3)| -product(V1,V2,V4)|sum(X,V3,V4).
% 1.89/2.09 0 [] -sum(Y,X,V1)| -sum(Z,X,V2)| -product(Y,Z,V3)| -sum(V3,X,V4)|product(V1,V2,V4).
% 1.89/2.09 0 [] -sum(Y,X,V1)| -sum(Z,X,V2)| -product(Y,Z,V3)| -product(V1,V2,V4)|sum(V3,X,V4).
% 1.89/2.09 0 [] sum(inverse(X),X,multiplicative_identity).
% 1.89/2.09 0 [] sum(X,inverse(X),multiplicative_identity).
% 1.89/2.09 0 [] product(inverse(X),X,additive_identity).
% 1.89/2.09 0 [] product(X,inverse(X),additive_identity).
% 1.89/2.09 0 [] -sum(X,Y,U)| -sum(X,Y,V)|U=V.
% 1.89/2.09 0 [] -product(X,Y,U)| -product(X,Y,V)|U=V.
% 1.89/2.09 0 [] inverse(inverse(X))=X.
% 1.89/2.09 0 [] -sum(X,Y,multiplicative_identity)| -sum(X,Z,multiplicative_identity)| -product(X,Y,additive_identity)| -product(X,Z,additive_identity)|Y=Z.
% 1.89/2.09 0 [] sum(x,y,x_plus_y).
% 1.89/2.09 0 [] product(inverse(x),inverse(y),x_inverse_times_y_inverse).
% 1.89/2.09 0 [] inverse(x_plus_y)!=x_inverse_times_y_inverse.
% 1.89/2.09 end_of_list.
% 1.89/2.09
% 1.89/2.09 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=5.
% 1.89/2.09
% 1.89/2.09 This is a Horn set with equality. The strategy will be
% 1.89/2.09 Knuth-Bendix and hyper_res, with positive clauses in
% 1.89/2.09 sos and nonpositive clauses in usable.
% 1.89/2.09
% 1.89/2.09 dependent: set(knuth_bendix).
% 1.89/2.09 dependent: set(anl_eq).
% 1.89/2.09 dependent: set(para_from).
% 1.89/2.09 dependent: set(para_into).
% 1.89/2.09 dependent: clear(para_from_right).
% 1.89/2.09 dependent: clear(para_into_right).
% 1.89/2.09 dependent: set(para_from_vars).
% 1.89/2.09 dependent: set(eq_units_both_ways).
% 1.89/2.09 dependent: set(dynamic_demod_all).
% 1.89/2.09 dependent: set(dynamic_demod).
% 1.89/2.09 dependent: set(order_eq).
% 1.89/2.09 dependent: set(back_demod).
% 1.89/2.09 dependent: set(lrpo).
% 1.89/2.09 dependent: set(hyper_res).
% 1.89/2.09 dependent: clear(order_hyper).
% 1.89/2.09
% 1.89/2.09 ------------> process usable:
% 1.89/2.09 ** KEPT (pick-wt=8): 1 [] -sum(A,B,C)|sum(B,A,C).
% 1.89/2.09 ** KEPT (pick-wt=8): 2 [] -product(A,B,C)|product(B,A,C).
% 1.89/2.09 ** KEPT (pick-wt=20): 3 [] -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -product(A,F,G)|sum(C,E,G).
% 1.89/2.09 ** KEPT (pick-wt=20): 4 [] -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -sum(C,E,G)|product(A,F,G).
% 1.89/2.09 ** KEPT (pick-wt=20): 5 [] -product(A,B,C)| -product(D,B,E)| -sum(A,D,F)| -product(F,B,G)|sum(C,E,G).
% 1.89/2.09 ** KEPT (pick-wt=20): 6 [] -product(A,B,C)| -product(D,B,E)| -sum(A,D,F)| -sum(C,E,G)|product(F,B,G).
% 1.89/2.09 ** KEPT (pick-wt=20): 7 [] -sum(A,B,C)| -sum(A,D,E)| -product(B,D,F)| -sum(A,F,G)|product(C,E,G).
% 1.89/2.09 ** KEPT (pick-wt=20): 8 [] -sum(A,B,C)| -sum(A,D,E)| -product(B,D,F)| -product(C,E,G)|sum(A,F,G).
% 1.89/2.09 ** KEPT (pick-wt=20): 9 [] -sum(A,B,C)| -sum(D,B,E)| -product(A,D,F)| -sum(F,B,G)|product(C,E,G).
% 1.89/2.09 ** KEPT (pick-wt=20): 10 [] -sum(A,B,C)| -sum(D,B,E)| -product(A,D,F)| -product(C,E,G)|sum(F,B,G).
% 1.89/2.09 ** KEPT (pick-wt=11): 11 [] -sum(A,B,C)| -sum(A,B,D)|C=D.
% 1.89/2.09 ** KEPT (pick-wt=11): 12 [] -product(A,B,C)| -product(A,B,D)|C=D.
% 1.89/2.09 ** KEPT (pick-wt=19): 13 [] -sum(A,B,multiplicative_identity)| -sum(A,C,multiplicative_identity)| -product(A,B,additive_identity)| -product(A,C,additive_identity)|B=C.
% 2.83/3.06 ** KEPT (pick-wt=4): 14 [] inverse(x_plus_y)!=x_inverse_times_y_inverse.
% 2.83/3.06
% 2.83/3.06 ------------> process sos:
% 2.83/3.06 ** KEPT (pick-wt=3): 15 [] A=A.
% 2.83/3.06 ** KEPT (pick-wt=6): 16 [] sum(A,B,add(A,B)).
% 2.83/3.06 ** KEPT (pick-wt=6): 17 [] product(A,B,multiply(A,B)).
% 2.83/3.06 ** KEPT (pick-wt=4): 18 [] sum(additive_identity,A,A).
% 2.83/3.06 ** KEPT (pick-wt=4): 19 [] sum(A,additive_identity,A).
% 2.83/3.06 ** KEPT (pick-wt=4): 20 [] product(multiplicative_identity,A,A).
% 2.83/3.06 ** KEPT (pick-wt=4): 21 [] product(A,multiplicative_identity,A).
% 2.83/3.06 ** KEPT (pick-wt=5): 22 [] sum(inverse(A),A,multiplicative_identity).
% 2.83/3.06 ** KEPT (pick-wt=5): 23 [] sum(A,inverse(A),multiplicative_identity).
% 2.83/3.06 ** KEPT (pick-wt=5): 24 [] product(inverse(A),A,additive_identity).
% 2.83/3.06 ** KEPT (pick-wt=5): 25 [] product(A,inverse(A),additive_identity).
% 2.83/3.06 ** KEPT (pick-wt=5): 26 [] inverse(inverse(A))=A.
% 2.83/3.06 ---> New Demodulator: 27 [new_demod,26] inverse(inverse(A))=A.
% 2.83/3.06 ** KEPT (pick-wt=4): 28 [] sum(x,y,x_plus_y).
% 2.83/3.06 ** KEPT (pick-wt=6): 29 [] product(inverse(x),inverse(y),x_inverse_times_y_inverse).
% 2.83/3.06 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] A=A.
% 2.83/3.06 >>>> Starting back demodulation with 27.
% 2.83/3.06
% 2.83/3.06 ======= end of input processing =======
% 2.83/3.06
% 2.83/3.06 =========== start of search ===========
% 2.83/3.06
% 2.83/3.06
% 2.83/3.06 Resetting weight limit to 8.
% 2.83/3.06
% 2.83/3.06
% 2.83/3.06 Resetting weight limit to 8.
% 2.83/3.06
% 2.83/3.06 sos_size=2270
% 2.83/3.06
% 2.83/3.06
% 2.83/3.06 Resetting weight limit to 7.
% 2.83/3.06
% 2.83/3.06
% 2.83/3.06 Resetting weight limit to 7.
% 2.83/3.06
% 2.83/3.06 sos_size=626
% 2.83/3.06
% 2.83/3.06
% 2.83/3.06 Resetting weight limit to 6.
% 2.83/3.06
% 2.83/3.06
% 2.83/3.06 Resetting weight limit to 6.
% 2.83/3.06
% 2.83/3.06 sos_size=557
% 2.83/3.06
% 2.83/3.06 -------- PROOF --------
% 2.83/3.06
% 2.83/3.06 ----> UNIT CONFLICT at 0.96 sec ----> 2878 [binary,2876.1,14.1] $F.
% 2.83/3.06
% 2.83/3.06 Length of proof is 33. Level of proof is 9.
% 2.83/3.06
% 2.83/3.06 ---------------- PROOF ----------------
% 2.83/3.06 % SZS status Unsatisfiable
% 2.83/3.06 % SZS output start Refutation
% See solution above
% 2.83/3.06 ------------ end of proof -------------
% 2.83/3.06
% 2.83/3.06
% 2.83/3.06 Search stopped by max_proofs option.
% 2.83/3.06
% 2.83/3.06
% 2.83/3.06 Search stopped by max_proofs option.
% 2.83/3.06
% 2.83/3.06 ============ end of search ============
% 2.83/3.06
% 2.83/3.06 -------------- statistics -------------
% 2.83/3.06 clauses given 212
% 2.83/3.06 clauses generated 236201
% 2.83/3.06 clauses kept 2808
% 2.83/3.06 clauses forward subsumed 127111
% 2.83/3.06 clauses back subsumed 146
% 2.83/3.06 Kbytes malloced 4882
% 2.83/3.06
% 2.83/3.06 ----------- times (seconds) -----------
% 2.83/3.06 user CPU time 0.96 (0 hr, 0 min, 0 sec)
% 2.83/3.06 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.83/3.06 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.83/3.06
% 2.83/3.06 That finishes the proof of the theorem.
% 2.83/3.06
% 2.83/3.06 Process 448 finished Wed Jul 27 02:33:02 2022
% 2.83/3.06 Otter interrupted
% 2.83/3.06 PROOF FOUND
%------------------------------------------------------------------------------