TSTP Solution File: BOO014-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : BOO014-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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 3.36s 3.59s
% Output : Refutation 3.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 23
% Syntax : Number of clauses : 64 ( 54 unt; 0 nHn; 34 RR)
% Number of literals : 94 ( 15 equ; 31 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 : 94 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ sum(A,B,C)
| sum(B,A,C) ),
file('BOO014-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ product(A,B,C)
| product(B,A,C) ),
file('BOO014-1.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-1.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-1.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-1.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-1.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-1.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-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ sum(A,B,C)
| ~ sum(A,B,D)
| C = D ),
file('BOO014-1.p',unknown),
[] ).
cnf(12,axiom,
( ~ product(A,B,C)
| ~ product(A,B,D)
| C = D ),
file('BOO014-1.p',unknown),
[] ).
cnf(13,axiom,
inverse(x_plus_y) != x_inverse_times_y_inverse,
file('BOO014-1.p',unknown),
[] ).
cnf(15,axiom,
sum(A,B,add(A,B)),
file('BOO014-1.p',unknown),
[] ).
cnf(16,axiom,
product(A,B,multiply(A,B)),
file('BOO014-1.p',unknown),
[] ).
cnf(17,axiom,
sum(additive_identity,A,A),
file('BOO014-1.p',unknown),
[] ).
cnf(18,axiom,
sum(A,additive_identity,A),
file('BOO014-1.p',unknown),
[] ).
cnf(19,axiom,
product(multiplicative_identity,A,A),
file('BOO014-1.p',unknown),
[] ).
cnf(20,axiom,
product(A,multiplicative_identity,A),
file('BOO014-1.p',unknown),
[] ).
cnf(21,axiom,
sum(inverse(A),A,multiplicative_identity),
file('BOO014-1.p',unknown),
[] ).
cnf(22,axiom,
sum(A,inverse(A),multiplicative_identity),
file('BOO014-1.p',unknown),
[] ).
cnf(23,axiom,
product(inverse(A),A,additive_identity),
file('BOO014-1.p',unknown),
[] ).
cnf(24,axiom,
product(A,inverse(A),additive_identity),
file('BOO014-1.p',unknown),
[] ).
cnf(25,axiom,
sum(x,y,x_plus_y),
file('BOO014-1.p',unknown),
[] ).
cnf(26,axiom,
product(inverse(x),inverse(y),x_inverse_times_y_inverse),
file('BOO014-1.p',unknown),
[] ).
cnf(36,plain,
add(A,additive_identity) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[15,11,18])]),
[iquote('hyper,15,11,18,flip.1')] ).
cnf(38,plain,
add(additive_identity,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[15,11,17])]),
[iquote('hyper,15,11,17,flip.1')] ).
cnf(40,plain,
product(A,add(multiplicative_identity,A),A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[15,9,17,15,20]),38]),
[iquote('hyper,15,9,17,15,20,demod,38')] ).
cnf(53,plain,
sum(A,B,add(B,A)),
inference(hyper,[status(thm)],[15,1]),
[iquote('hyper,15,1')] ).
cnf(62,plain,
sum(y,x,x_plus_y),
inference(hyper,[status(thm)],[25,1]),
[iquote('hyper,25,1')] ).
cnf(84,plain,
add(inverse(A),A) = multiplicative_identity,
inference(hyper,[status(thm)],[21,11,15]),
[iquote('hyper,21,11,15')] ).
cnf(86,plain,
product(multiplicative_identity,add(multiplicative_identity,A),multiplicative_identity),
inference(hyper,[status(thm)],[21,9,21,15,20]),
[iquote('hyper,21,9,21,15,20')] ).
cnf(98,plain,
multiply(A,multiplicative_identity) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[16,12,20])]),
[iquote('hyper,16,12,20,flip.1')] ).
cnf(100,plain,
multiply(multiplicative_identity,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[16,12,19])]),
[iquote('hyper,16,12,19,flip.1')] ).
cnf(147,plain,
product(multiplicative_identity,add(A,B),add(multiply(inverse(B),A),B)),
inference(hyper,[status(thm)],[16,9,21,15,15]),
[iquote('hyper,16,9,21,15,15')] ).
cnf(155,plain,
product(add(A,B),multiplicative_identity,add(multiply(A,inverse(B)),B)),
inference(hyper,[status(thm)],[16,9,15,21,15]),
[iquote('hyper,16,9,15,21,15')] ).
cnf(253,plain,
sum(A,A,multiply(A,add(multiplicative_identity,multiplicative_identity))),
inference(hyper,[status(thm)],[16,3,20,20,15]),
[iquote('hyper,16,3,20,20,15')] ).
cnf(265,plain,
product(A,B,multiply(B,A)),
inference(hyper,[status(thm)],[16,2]),
[iquote('hyper,16,2')] ).
cnf(411,plain,
multiply(A,inverse(A)) = additive_identity,
inference(hyper,[status(thm)],[24,12,16]),
[iquote('hyper,24,12,16')] ).
cnf(599,plain,
add(multiplicative_identity,multiplicative_identity) = multiplicative_identity,
inference(hyper,[status(thm)],[40,12,19]),
[iquote('hyper,40,12,19')] ).
cnf(689,plain,
sum(A,A,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[253]),599,98]),
[iquote('back_demod,253,demod,599,98')] ).
cnf(1403,plain,
sum(x_inverse_times_y_inverse,inverse(y),multiply(add(multiplicative_identity,inverse(x)),inverse(y))),
inference(hyper,[status(thm)],[53,5,26,19,16]),
[iquote('hyper,53,5,26,19,16')] ).
cnf(1496,plain,
sum(x_inverse_times_y_inverse,inverse(x),multiply(inverse(x),add(multiplicative_identity,inverse(y)))),
inference(hyper,[status(thm)],[53,3,26,20,16]),
[iquote('hyper,53,3,26,20,16')] ).
cnf(1528,plain,
sum(multiply(A,B),A,multiply(A,add(multiplicative_identity,B))),
inference(hyper,[status(thm)],[53,3,16,20,16]),
[iquote('hyper,53,3,16,20,16')] ).
cnf(2463,plain,
add(multiplicative_identity,A) = multiplicative_identity,
inference(hyper,[status(thm)],[86,12,19]),
[iquote('hyper,86,12,19')] ).
cnf(2465,plain,
sum(multiplicative_identity,A,multiplicative_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[86,10,15,15,16]),2463,2463,2463,98]),
[iquote('hyper,86,10,15,15,16,demod,2463,2463,2463,98')] ).
cnf(2480,plain,
sum(multiply(A,B),A,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1528]),2463,98]),
[iquote('back_demod,1528,demod,2463,98')] ).
cnf(2481,plain,
sum(x_inverse_times_y_inverse,inverse(x),inverse(x)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1496]),2463,98]),
[iquote('back_demod,1496,demod,2463,98')] ).
cnf(2486,plain,
sum(x_inverse_times_y_inverse,inverse(y),inverse(y)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1403]),2463,100]),
[iquote('back_demod,1403,demod,2463,100')] ).
cnf(2503,plain,
multiply(inverse(y),inverse(x)) = x_inverse_times_y_inverse,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[265,12,26])]),
[iquote('hyper,265,12,26,flip.1')] ).
cnf(2592,plain,
product(x,x_plus_y,x),
inference(hyper,[status(thm)],[2480,9,689,62,16]),
[iquote('hyper,2480,9,689,62,16')] ).
cnf(2594,plain,
product(y,x_plus_y,y),
inference(hyper,[status(thm)],[2480,9,689,25,16]),
[iquote('hyper,2480,9,689,25,16')] ).
cnf(2629,plain,
product(multiplicative_identity,add(inverse(x),x_plus_y),multiplicative_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2592,9,53,53,22]),84]),
[iquote('hyper,2592,9,53,53,22,demod,84')] ).
cnf(2657,plain,
product(multiplicative_identity,add(inverse(y),x_plus_y),multiplicative_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2594,9,53,53,22]),84]),
[iquote('hyper,2594,9,53,53,22,demod,84')] ).
cnf(2736,plain,
sum(multiply(x,x_inverse_times_y_inverse),additive_identity,additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2481,5,265,265,23]),411]),
[iquote('hyper,2481,5,265,265,23,demod,411')] ).
cnf(2766,plain,
sum(multiply(y,x_inverse_times_y_inverse),additive_identity,additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2486,5,265,265,23]),411]),
[iquote('hyper,2486,5,265,265,23,demod,411')] ).
cnf(2797,plain,
product(x,x_inverse_times_y_inverse,additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2736,9,53,53,16]),38,38]),
[iquote('hyper,2736,9,53,53,16,demod,38,38')] ).
cnf(2812,plain,
product(x_plus_y,x_inverse_times_y_inverse,additive_identity),
inference(hyper,[status(thm)],[2766,6,16,2797,62]),
[iquote('hyper,2766,6,16,2797,62')] ).
cnf(2823,plain,
multiply(x_inverse_times_y_inverse,x_plus_y) = additive_identity,
inference(hyper,[status(thm)],[2812,12,265]),
[iquote('hyper,2812,12,265')] ).
cnf(2829,plain,
sum(x_plus_y,inverse(x),multiplicative_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2629,10,2465,53,265]),98]),
[iquote('hyper,2629,10,2465,53,265,demod,98')] ).
cnf(2837,plain,
sum(x_plus_y,x_inverse_times_y_inverse,multiplicative_identity),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2657,8,2829,53,265]),2503]),
[iquote('hyper,2657,8,2829,53,265,demod,2503')] ).
cnf(2848,plain,
sum(additive_identity,inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[147,10,22,53,23]),411,38]),
[iquote('hyper,147,10,22,53,23,demod,411,38')] ).
cnf(2857,plain,
inverse(inverse(A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2848,11,53]),36]),
[iquote('hyper,2848,11,53,demod,36')] ).
cnf(2864,plain,
sum(additive_identity,x_inverse_times_y_inverse,inverse(x_plus_y)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[155,10,53,2837,23]),2857,2823,38]),
[iquote('hyper,155,10,53,2837,23,demod,2857,2823,38')] ).
cnf(2868,plain,
inverse(x_plus_y) = x_inverse_times_y_inverse,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[2864,11,53]),36])]),
[iquote('hyper,2864,11,53,demod,36,flip.1')] ).
cnf(2870,plain,
$false,
inference(binary,[status(thm)],[2868,13]),
[iquote('binary,2868.1,13.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : BOO014-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n020.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:36:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.90/2.11 ----- Otter 3.3f, August 2004 -----
% 1.90/2.11 The process was started by sandbox on n020.cluster.edu,
% 1.90/2.11 Wed Jul 27 02:36:53 2022
% 1.90/2.11 The command was "./otter". The process ID is 4513.
% 1.90/2.11
% 1.90/2.11 set(prolog_style_variables).
% 1.90/2.11 set(auto).
% 1.90/2.11 dependent: set(auto1).
% 1.90/2.11 dependent: set(process_input).
% 1.90/2.11 dependent: clear(print_kept).
% 1.90/2.11 dependent: clear(print_new_demod).
% 1.90/2.11 dependent: clear(print_back_demod).
% 1.90/2.11 dependent: clear(print_back_sub).
% 1.90/2.11 dependent: set(control_memory).
% 1.90/2.11 dependent: assign(max_mem, 12000).
% 1.90/2.11 dependent: assign(pick_given_ratio, 4).
% 1.90/2.11 dependent: assign(stats_level, 1).
% 1.90/2.11 dependent: assign(max_seconds, 10800).
% 1.90/2.11 clear(print_given).
% 1.90/2.11
% 1.90/2.11 list(usable).
% 1.90/2.11 0 [] A=A.
% 1.90/2.11 0 [] sum(X,Y,add(X,Y)).
% 1.90/2.11 0 [] product(X,Y,multiply(X,Y)).
% 1.90/2.11 0 [] -sum(X,Y,Z)|sum(Y,X,Z).
% 1.90/2.11 0 [] -product(X,Y,Z)|product(Y,X,Z).
% 1.90/2.11 0 [] sum(additive_identity,X,X).
% 1.90/2.11 0 [] sum(X,additive_identity,X).
% 1.90/2.11 0 [] product(multiplicative_identity,X,X).
% 1.90/2.11 0 [] product(X,multiplicative_identity,X).
% 1.90/2.11 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -product(X,V3,V4)|sum(V1,V2,V4).
% 1.90/2.11 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(X,V3,V4).
% 1.90/2.11 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -product(V3,X,V4)|sum(V1,V2,V4).
% 1.90/2.11 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(V3,X,V4).
% 1.90/2.11 0 [] -sum(X,Y,V1)| -sum(X,Z,V2)| -product(Y,Z,V3)| -sum(X,V3,V4)|product(V1,V2,V4).
% 1.90/2.11 0 [] -sum(X,Y,V1)| -sum(X,Z,V2)| -product(Y,Z,V3)| -product(V1,V2,V4)|sum(X,V3,V4).
% 1.90/2.11 0 [] -sum(Y,X,V1)| -sum(Z,X,V2)| -product(Y,Z,V3)| -sum(V3,X,V4)|product(V1,V2,V4).
% 1.90/2.11 0 [] -sum(Y,X,V1)| -sum(Z,X,V2)| -product(Y,Z,V3)| -product(V1,V2,V4)|sum(V3,X,V4).
% 1.90/2.11 0 [] sum(inverse(X),X,multiplicative_identity).
% 1.90/2.11 0 [] sum(X,inverse(X),multiplicative_identity).
% 1.90/2.11 0 [] product(inverse(X),X,additive_identity).
% 1.90/2.11 0 [] product(X,inverse(X),additive_identity).
% 1.90/2.11 0 [] -sum(X,Y,U)| -sum(X,Y,V)|U=V.
% 1.90/2.11 0 [] -product(X,Y,U)| -product(X,Y,V)|U=V.
% 1.90/2.11 0 [] sum(x,y,x_plus_y).
% 1.90/2.11 0 [] product(inverse(x),inverse(y),x_inverse_times_y_inverse).
% 1.90/2.11 0 [] inverse(x_plus_y)!=x_inverse_times_y_inverse.
% 1.90/2.11 end_of_list.
% 1.90/2.11
% 1.90/2.11 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=5.
% 1.90/2.11
% 1.90/2.11 This is a Horn set with equality. The strategy will be
% 1.90/2.11 Knuth-Bendix and hyper_res, with positive clauses in
% 1.90/2.11 sos and nonpositive clauses in usable.
% 1.90/2.11
% 1.90/2.11 dependent: set(knuth_bendix).
% 1.90/2.11 dependent: set(anl_eq).
% 1.90/2.11 dependent: set(para_from).
% 1.90/2.11 dependent: set(para_into).
% 1.90/2.11 dependent: clear(para_from_right).
% 1.90/2.11 dependent: clear(para_into_right).
% 1.90/2.11 dependent: set(para_from_vars).
% 1.90/2.11 dependent: set(eq_units_both_ways).
% 1.90/2.11 dependent: set(dynamic_demod_all).
% 1.90/2.11 dependent: set(dynamic_demod).
% 1.90/2.11 dependent: set(order_eq).
% 1.90/2.11 dependent: set(back_demod).
% 1.90/2.11 dependent: set(lrpo).
% 1.90/2.11 dependent: set(hyper_res).
% 1.90/2.11 dependent: clear(order_hyper).
% 1.90/2.11
% 1.90/2.11 ------------> process usable:
% 1.90/2.11 ** KEPT (pick-wt=8): 1 [] -sum(A,B,C)|sum(B,A,C).
% 1.90/2.11 ** KEPT (pick-wt=8): 2 [] -product(A,B,C)|product(B,A,C).
% 1.90/2.11 ** 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.90/2.11 ** 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.90/2.11 ** 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.90/2.11 ** 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.90/2.11 ** 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.90/2.11 ** 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.90/2.11 ** 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.90/2.11 ** 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.90/2.11 ** KEPT (pick-wt=11): 11 [] -sum(A,B,C)| -sum(A,B,D)|C=D.
% 1.90/2.11 ** KEPT (pick-wt=11): 12 [] -product(A,B,C)| -product(A,B,D)|C=D.
% 1.90/2.11 ** KEPT (pick-wt=4): 13 [] inverse(x_plus_y)!=x_inverse_times_y_inverse.
% 1.90/2.11
% 1.90/2.11 ------------> process sos:
% 1.90/2.11 ** KEPT (pick-wt=3): 14 [] A=A.
% 1.90/2.11 ** KEPT (pick-wt=6): 15 [] sum(A,B,add(A,B)).
% 1.90/2.11 ** KEPT (pick-wt=6): 16 [] product(A,B,multiply(A,B)).
% 1.90/2.11 ** KEPT (pick-wt=4): 17 [] sum(additive_identity,A,A).
% 3.36/3.59 ** KEPT (pick-wt=4): 18 [] sum(A,additive_identity,A).
% 3.36/3.59 ** KEPT (pick-wt=4): 19 [] product(multiplicative_identity,A,A).
% 3.36/3.59 ** KEPT (pick-wt=4): 20 [] product(A,multiplicative_identity,A).
% 3.36/3.59 ** KEPT (pick-wt=5): 21 [] sum(inverse(A),A,multiplicative_identity).
% 3.36/3.59 ** KEPT (pick-wt=5): 22 [] sum(A,inverse(A),multiplicative_identity).
% 3.36/3.59 ** KEPT (pick-wt=5): 23 [] product(inverse(A),A,additive_identity).
% 3.36/3.59 ** KEPT (pick-wt=5): 24 [] product(A,inverse(A),additive_identity).
% 3.36/3.59 ** KEPT (pick-wt=4): 25 [] sum(x,y,x_plus_y).
% 3.36/3.59 ** KEPT (pick-wt=6): 26 [] product(inverse(x),inverse(y),x_inverse_times_y_inverse).
% 3.36/3.59 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] A=A.
% 3.36/3.59
% 3.36/3.59 ======= end of input processing =======
% 3.36/3.59
% 3.36/3.59 =========== start of search ===========
% 3.36/3.59
% 3.36/3.59
% 3.36/3.59 Resetting weight limit to 8.
% 3.36/3.59
% 3.36/3.59
% 3.36/3.59 Resetting weight limit to 8.
% 3.36/3.59
% 3.36/3.59 sos_size=2251
% 3.36/3.59
% 3.36/3.59
% 3.36/3.59 Resetting weight limit to 7.
% 3.36/3.59
% 3.36/3.59
% 3.36/3.59 Resetting weight limit to 7.
% 3.36/3.59
% 3.36/3.59 sos_size=645
% 3.36/3.59
% 3.36/3.59
% 3.36/3.59 Resetting weight limit to 6.
% 3.36/3.59
% 3.36/3.59
% 3.36/3.59 Resetting weight limit to 6.
% 3.36/3.59
% 3.36/3.59 sos_size=576
% 3.36/3.59
% 3.36/3.59 -------- PROOF --------
% 3.36/3.59
% 3.36/3.59 ----> UNIT CONFLICT at 1.48 sec ----> 2870 [binary,2868.1,13.1] $F.
% 3.36/3.59
% 3.36/3.59 Length of proof is 40. Level of proof is 10.
% 3.36/3.59
% 3.36/3.59 ---------------- PROOF ----------------
% 3.36/3.59 % SZS status Unsatisfiable
% 3.36/3.59 % SZS output start Refutation
% See solution above
% 3.36/3.59 ------------ end of proof -------------
% 3.36/3.59
% 3.36/3.59
% 3.36/3.59 Search stopped by max_proofs option.
% 3.36/3.59
% 3.36/3.59
% 3.36/3.59 Search stopped by max_proofs option.
% 3.36/3.59
% 3.36/3.59 ============ end of search ============
% 3.36/3.59
% 3.36/3.59 -------------- statistics -------------
% 3.36/3.59 clauses given 242
% 3.36/3.59 clauses generated 406268
% 3.36/3.59 clauses kept 2798
% 3.36/3.59 clauses forward subsumed 167566
% 3.36/3.59 clauses back subsumed 148
% 3.36/3.59 Kbytes malloced 4882
% 3.36/3.59
% 3.36/3.59 ----------- times (seconds) -----------
% 3.36/3.59 user CPU time 1.48 (0 hr, 0 min, 1 sec)
% 3.36/3.59 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 3.36/3.59 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.36/3.59
% 3.36/3.59 That finishes the proof of the theorem.
% 3.36/3.59
% 3.36/3.59 Process 4513 finished Wed Jul 27 02:36:56 2022
% 3.36/3.59 Otter interrupted
% 3.36/3.59 PROOF FOUND
%------------------------------------------------------------------------------