TSTP Solution File: BOO014-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : BOO014-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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 1.94s 2.09s
% Output : Refutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 68 ( 68 unt; 0 nHn; 21 RR)
% Number of literals : 68 ( 67 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 81 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
inverse(c) != d,
file('BOO014-2.p',unknown),
[] ).
cnf(3,axiom,
add(A,B) = add(B,A),
file('BOO014-2.p',unknown),
[] ).
cnf(4,axiom,
multiply(A,B) = multiply(B,A),
file('BOO014-2.p',unknown),
[] ).
cnf(5,axiom,
add(multiply(A,B),C) = multiply(add(A,C),add(B,C)),
file('BOO014-2.p',unknown),
[] ).
cnf(6,plain,
multiply(add(A,B),add(C,B)) = add(multiply(A,C),B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[5])]),
[iquote('copy,5,flip.1')] ).
cnf(12,axiom,
multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)),
file('BOO014-2.p',unknown),
[] ).
cnf(14,axiom,
multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)),
file('BOO014-2.p',unknown),
[] ).
cnf(17,axiom,
add(inverse(A),A) = multiplicative_identity,
file('BOO014-2.p',unknown),
[] ).
cnf(20,axiom,
multiply(A,inverse(A)) = additive_identity,
file('BOO014-2.p',unknown),
[] ).
cnf(22,axiom,
multiply(inverse(A),A) = additive_identity,
file('BOO014-2.p',unknown),
[] ).
cnf(24,axiom,
multiply(A,multiplicative_identity) = A,
file('BOO014-2.p',unknown),
[] ).
cnf(26,axiom,
multiply(multiplicative_identity,A) = A,
file('BOO014-2.p',unknown),
[] ).
cnf(28,axiom,
add(A,additive_identity) = A,
file('BOO014-2.p',unknown),
[] ).
cnf(30,axiom,
add(additive_identity,A) = A,
file('BOO014-2.p',unknown),
[] ).
cnf(31,axiom,
add(a,b) = c,
file('BOO014-2.p',unknown),
[] ).
cnf(33,axiom,
multiply(inverse(a),inverse(b)) = d,
file('BOO014-2.p',unknown),
[] ).
cnf(37,plain,
add(add(multiply(A,B),multiply(C,B)),add(multiply(A,C),multiply(C,C))) = add(multiply(A,B),C),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[6]),14,12,12]),
[iquote('back_demod,6,demod,14,12,12')] ).
cnf(39,plain,
add(b,a) = c,
inference(para_into,[status(thm),theory(equality)],[31,3]),
[iquote('para_into,31.1.1,3.1.1')] ).
cnf(45,plain,
multiply(c,A) = add(multiply(b,A),multiply(a,A)),
inference(para_into,[status(thm),theory(equality)],[12,39]),
[iquote('para_into,11.1.1.1,39.1.1')] ).
cnf(47,plain,
add(multiply(additive_identity,A),multiply(B,A)) = multiply(B,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[12,30])]),
[iquote('para_into,11.1.1.1,29.1.1,flip.1')] ).
cnf(51,plain,
add(multiply(inverse(A),B),multiply(A,B)) = B,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[12,17]),26])]),
[iquote('para_into,11.1.1.1,17.1.1,demod,26,flip.1')] ).
cnf(55,plain,
add(multiply(A,inverse(add(A,B))),multiply(B,inverse(add(A,B)))) = additive_identity,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[12,20])]),
[iquote('para_into,11.1.1,19.1.1,flip.1')] ).
cnf(57,plain,
add(multiply(A,B),multiply(A,C)) = add(multiply(B,A),multiply(C,A)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[12,4]),14]),
[iquote('para_into,11.1.1,4.1.1,demod,14')] ).
cnf(59,plain,
multiply(inverse(b),inverse(a)) = d,
inference(para_into,[status(thm),theory(equality)],[33,4]),
[iquote('para_into,33.1.1,4.1.1')] ).
cnf(70,plain,
multiply(A,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[51,22]),30]),
[iquote('para_into,51.1.1.1,21.1.1,demod,30')] ).
cnf(72,plain,
multiply(A,inverse(inverse(A))) = inverse(inverse(A)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[51,20]),30]),
[iquote('para_into,51.1.1.1,19.1.1,demod,30')] ).
cnf(75,plain,
add(multiply(inverse(inverse(b)),inverse(a)),d) = inverse(a),
inference(para_into,[status(thm),theory(equality)],[51,59]),
[iquote('para_into,51.1.1.2,59.1.1')] ).
cnf(79,plain,
multiply(inverse(inverse(A)),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[51,22]),28]),
[iquote('para_into,51.1.1.2,21.1.1,demod,28')] ).
cnf(83,plain,
add(multiply(inverse(A),B),multiply(B,A)) = B,
inference(para_into,[status(thm),theory(equality)],[51,4]),
[iquote('para_into,51.1.1.2,4.1.1')] ).
cnf(85,plain,
add(add(multiply(A,B),multiply(C,B)),add(multiply(A,C),C)) = add(multiply(A,B),C),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[37]),70]),
[iquote('back_demod,37,demod,70')] ).
cnf(93,plain,
add(multiply(A,multiply(inverse(B),C)),multiply(A,multiply(B,C))) = multiply(A,C),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[14,51])]),
[iquote('para_into,13.1.1.2,51.1.1,flip.1')] ).
cnf(95,plain,
multiply(A,c) = add(multiply(A,b),multiply(A,a)),
inference(para_into,[status(thm),theory(equality)],[14,39]),
[iquote('para_into,13.1.1.2,39.1.1')] ).
cnf(108,plain,
add(multiply(inverse(add(A,B)),A),multiply(inverse(add(A,B)),B)) = additive_identity,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[14,22])]),
[iquote('para_into,13.1.1,21.1.1,flip.1')] ).
cnf(132,plain,
inverse(inverse(A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[79,4]),72]),
[iquote('para_into,79.1.1,4.1.1,demod,72')] ).
cnf(135,plain,
add(multiply(b,inverse(a)),d) = inverse(a),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[75]),132]),
[iquote('back_demod,75,demod,132')] ).
cnf(137,plain,
add(multiply(b,inverse(c)),multiply(a,inverse(c))) = additive_identity,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[45,20])]),
[iquote('para_into,45.1.1,19.1.1,flip.1')] ).
cnf(139,plain,
add(multiply(inverse(c),A),add(multiply(b,A),multiply(a,A))) = A,
inference(para_from,[status(thm),theory(equality)],[45,51]),
[iquote('para_from,45.1.1,51.1.1.2')] ).
cnf(180,plain,
multiply(additive_identity,A) = additive_identity,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[47,22]),28,22]),
[iquote('para_into,47.1.1.2,21.1.1,demod,28,22')] ).
cnf(182,plain,
multiply(A,additive_identity) = additive_identity,
inference(para_into,[status(thm),theory(equality)],[180,4]),
[iquote('para_into,179.1.1,4.1.1')] ).
cnf(189,plain,
add(multiply(inverse(a),b),d) = inverse(a),
inference(para_into,[status(thm),theory(equality)],[135,4]),
[iquote('para_into,135.1.1.1,4.1.1')] ).
cnf(221,plain,
add(multiply(multiply(inverse(a),b),A),multiply(d,A)) = multiply(inverse(a),A),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[189,12])]),
[iquote('para_from,189.1.1,11.1.1.1,flip.1')] ).
cnf(245,plain,
add(multiply(A,inverse(add(A,B))),multiply(inverse(add(A,B)),B)) = additive_identity,
inference(para_into,[status(thm),theory(equality)],[55,4]),
[iquote('para_into,55.1.1.2,4.1.1')] ).
cnf(308,plain,
add(multiply(A,B),A) = add(multiply(B,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[57,70]),70]),
[iquote('para_into,57.1.1.2,69.1.1,demod,70')] ).
cnf(372,plain,
add(multiply(b,inverse(c)),multiply(inverse(c),a)) = additive_identity,
inference(para_into,[status(thm),theory(equality)],[137,4]),
[iquote('para_into,137.1.1.2,4.1.1')] ).
cnf(417,plain,
add(A,multiply(A,B)) = add(multiply(B,A),A),
inference(para_into,[status(thm),theory(equality)],[308,3]),
[iquote('para_into,308.1.1,3.1.1')] ).
cnf(422,plain,
add(multiply(A,B),B) = add(B,multiply(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[417])]),
[iquote('copy,417,flip.1')] ).
cnf(522,plain,
add(multiply(A,B),B) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[85,182]),182,28,30,182,30]),
[iquote('para_into,85.1.1.1.1,181.1.1,demod,182,28,30,182,30')] ).
cnf(524,plain,
add(multiply(A,B),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[85,180]),30,180,30,180,30]),
[iquote('para_into,85.1.1.1.1,179.1.1,demod,30,180,30,180,30')] ).
cnf(537,plain,
add(add(A,B),B) = add(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[85,24]),24,522,24]),
[iquote('para_into,85.1.1.1.1,23.1.1,demod,24,522,24')] ).
cnf(545,plain,
add(A,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[85,70]),522,522,522]),
[iquote('para_into,85.1.1.1.2,69.1.1,demod,522,522,522')] ).
cnf(592,plain,
add(A,multiply(A,B)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[422]),522])]),
[iquote('back_demod,422,demod,522,flip.1')] ).
cnf(643,plain,
add(add(multiply(A,b),multiply(A,a)),c) = c,
inference(para_into,[status(thm),theory(equality)],[522,95]),
[iquote('para_into,521.1.1.1,95.1.1')] ).
cnf(646,plain,
add(d,inverse(a)) = inverse(a),
inference(para_into,[status(thm),theory(equality)],[522,59]),
[iquote('para_into,521.1.1.1,59.1.1')] ).
cnf(650,plain,
add(d,inverse(b)) = inverse(b),
inference(para_into,[status(thm),theory(equality)],[522,33]),
[iquote('para_into,521.1.1.1,33.1.1')] ).
cnf(719,plain,
multiply(multiply(A,B),B) = multiply(A,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[93,70]),524])]),
[iquote('para_into,93.1.1.2,69.1.1,demod,524,flip.1')] ).
cnf(733,plain,
multiply(d,a) = additive_identity,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[646,55]),646,132,132,22,28]),
[iquote('para_from,645.1.1,55.1.1.2.2.1,demod,646,132,132,22,28')] ).
cnf(740,plain,
multiply(a,d) = additive_identity,
inference(para_into,[status(thm),theory(equality)],[733,4]),
[iquote('para_into,733.1.1,4.1.1')] ).
cnf(831,plain,
multiply(b,d) = additive_identity,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[650,108]),650,132,132,20,28]),
[iquote('para_from,649.1.1,107.1.1.2.1.1,demod,650,132,132,20,28')] ).
cnf(1027,plain,
multiply(inverse(c),d) = d,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[139,831]),740,545,28]),
[iquote('para_into,139.1.1.2.1,831.1.1,demod,740,545,28')] ).
cnf(1030,plain,
multiply(d,inverse(c)) = d,
inference(para_into,[status(thm),theory(equality)],[1027,4]),
[iquote('para_into,1027.1.1,4.1.1')] ).
cnf(1095,plain,
multiply(inverse(c),a) = additive_identity,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[537,372]),30,372]),
[iquote('para_into,537.1.1.1,371.1.1,demod,30,372')] ).
cnf(1104,plain,
multiply(inverse(add(A,B)),B) = additive_identity,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[537,108]),30,108]),
[iquote('para_into,537.1.1.1,107.1.1,demod,30,108')] ).
cnf(1117,plain,
multiply(A,inverse(add(A,B))) = additive_identity,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[245]),1104,28]),
[iquote('back_demod,245,demod,1104,28')] ).
cnf(1124,plain,
multiply(inverse(a),inverse(c)) = inverse(c),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1095,83]),28]),
[iquote('para_from,1095.1.1,83.1.1.2,demod,28')] ).
cnf(1219,plain,
add(multiply(A,b),c) = c,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[643,719]),592]),
[iquote('para_into,643.1.1.1.1,719.1.1,demod,592')] ).
cnf(1229,plain,
multiply(multiply(A,b),inverse(c)) = additive_identity,
inference(para_from,[status(thm),theory(equality)],[1219,1117]),
[iquote('para_from,1219.1.1,1117.1.1.2.1')] ).
cnf(1253,plain,
inverse(c) = d,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1229,221]),1030,30,1124])]),
[iquote('para_from,1229.1.1,221.1.1.1,demod,1030,30,1124,flip.1')] ).
cnf(1255,plain,
$false,
inference(binary,[status(thm)],[1253,1]),
[iquote('binary,1253.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : BOO014-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 02:33:55 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.77/1.94 ----- Otter 3.3f, August 2004 -----
% 1.77/1.94 The process was started by sandbox2 on n024.cluster.edu,
% 1.77/1.94 Wed Jul 27 02:33:55 2022
% 1.77/1.94 The command was "./otter". The process ID is 335.
% 1.77/1.94
% 1.77/1.94 set(prolog_style_variables).
% 1.77/1.94 set(auto).
% 1.77/1.94 dependent: set(auto1).
% 1.77/1.94 dependent: set(process_input).
% 1.77/1.94 dependent: clear(print_kept).
% 1.77/1.94 dependent: clear(print_new_demod).
% 1.77/1.94 dependent: clear(print_back_demod).
% 1.77/1.94 dependent: clear(print_back_sub).
% 1.77/1.94 dependent: set(control_memory).
% 1.77/1.94 dependent: assign(max_mem, 12000).
% 1.77/1.94 dependent: assign(pick_given_ratio, 4).
% 1.77/1.94 dependent: assign(stats_level, 1).
% 1.77/1.94 dependent: assign(max_seconds, 10800).
% 1.77/1.94 clear(print_given).
% 1.77/1.94
% 1.77/1.94 list(usable).
% 1.77/1.94 0 [] A=A.
% 1.77/1.94 0 [] add(X,Y)=add(Y,X).
% 1.77/1.94 0 [] multiply(X,Y)=multiply(Y,X).
% 1.77/1.94 0 [] add(multiply(X,Y),Z)=multiply(add(X,Z),add(Y,Z)).
% 1.77/1.94 0 [] add(X,multiply(Y,Z))=multiply(add(X,Y),add(X,Z)).
% 1.77/1.94 0 [] multiply(add(X,Y),Z)=add(multiply(X,Z),multiply(Y,Z)).
% 1.77/1.94 0 [] multiply(X,add(Y,Z))=add(multiply(X,Y),multiply(X,Z)).
% 1.77/1.94 0 [] add(X,inverse(X))=multiplicative_identity.
% 1.77/1.94 0 [] add(inverse(X),X)=multiplicative_identity.
% 1.77/1.94 0 [] multiply(X,inverse(X))=additive_identity.
% 1.77/1.94 0 [] multiply(inverse(X),X)=additive_identity.
% 1.77/1.94 0 [] multiply(X,multiplicative_identity)=X.
% 1.77/1.94 0 [] multiply(multiplicative_identity,X)=X.
% 1.77/1.94 0 [] add(X,additive_identity)=X.
% 1.77/1.94 0 [] add(additive_identity,X)=X.
% 1.77/1.94 0 [] add(a,b)=c.
% 1.77/1.94 0 [] multiply(inverse(a),inverse(b))=d.
% 1.77/1.94 0 [] inverse(c)!=d.
% 1.77/1.94 end_of_list.
% 1.77/1.94
% 1.77/1.94 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.77/1.94
% 1.77/1.94 All clauses are units, and equality is present; the
% 1.77/1.94 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.77/1.94
% 1.77/1.94 dependent: set(knuth_bendix).
% 1.77/1.94 dependent: set(anl_eq).
% 1.77/1.94 dependent: set(para_from).
% 1.77/1.94 dependent: set(para_into).
% 1.77/1.94 dependent: clear(para_from_right).
% 1.77/1.94 dependent: clear(para_into_right).
% 1.77/1.94 dependent: set(para_from_vars).
% 1.77/1.94 dependent: set(eq_units_both_ways).
% 1.77/1.94 dependent: set(dynamic_demod_all).
% 1.77/1.94 dependent: set(dynamic_demod).
% 1.77/1.94 dependent: set(order_eq).
% 1.77/1.94 dependent: set(back_demod).
% 1.77/1.94 dependent: set(lrpo).
% 1.77/1.94
% 1.77/1.94 ------------> process usable:
% 1.77/1.94 ** KEPT (pick-wt=4): 1 [] inverse(c)!=d.
% 1.77/1.94
% 1.77/1.94 ------------> process sos:
% 1.77/1.94 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.77/1.94 ** KEPT (pick-wt=7): 3 [] add(A,B)=add(B,A).
% 1.77/1.94 ** KEPT (pick-wt=7): 4 [] multiply(A,B)=multiply(B,A).
% 1.77/1.94 ** KEPT (pick-wt=13): 6 [copy,5,flip.1] multiply(add(A,B),add(C,B))=add(multiply(A,C),B).
% 1.77/1.94 ---> New Demodulator: 7 [new_demod,6] multiply(add(A,B),add(C,B))=add(multiply(A,C),B).
% 1.77/1.94 ** KEPT (pick-wt=13): 9 [copy,8,flip.1] multiply(add(A,B),add(A,C))=add(A,multiply(B,C)).
% 1.77/1.94 ---> New Demodulator: 10 [new_demod,9] multiply(add(A,B),add(A,C))=add(A,multiply(B,C)).
% 1.77/1.94 ** KEPT (pick-wt=13): 11 [] multiply(add(A,B),C)=add(multiply(A,C),multiply(B,C)).
% 1.77/1.94 ---> New Demodulator: 12 [new_demod,11] multiply(add(A,B),C)=add(multiply(A,C),multiply(B,C)).
% 1.77/1.94 ** KEPT (pick-wt=13): 13 [] multiply(A,add(B,C))=add(multiply(A,B),multiply(A,C)).
% 1.77/1.94 ---> New Demodulator: 14 [new_demod,13] multiply(A,add(B,C))=add(multiply(A,B),multiply(A,C)).
% 1.77/1.94 ** KEPT (pick-wt=6): 15 [] add(A,inverse(A))=multiplicative_identity.
% 1.77/1.94 ---> New Demodulator: 16 [new_demod,15] add(A,inverse(A))=multiplicative_identity.
% 1.77/1.94 ** KEPT (pick-wt=6): 17 [] add(inverse(A),A)=multiplicative_identity.
% 1.77/1.94 ---> New Demodulator: 18 [new_demod,17] add(inverse(A),A)=multiplicative_identity.
% 1.77/1.94 ** KEPT (pick-wt=6): 19 [] multiply(A,inverse(A))=additive_identity.
% 1.77/1.94 ---> New Demodulator: 20 [new_demod,19] multiply(A,inverse(A))=additive_identity.
% 1.77/1.94 ** KEPT (pick-wt=6): 21 [] multiply(inverse(A),A)=additive_identity.
% 1.77/1.94 ---> New Demodulator: 22 [new_demod,21] multiply(inverse(A),A)=additive_identity.
% 1.77/1.94 ** KEPT (pick-wt=5): 23 [] multiply(A,multiplicative_identity)=A.
% 1.77/1.94 ---> New Demodulator: 24 [new_demod,23] multiply(A,multiplicative_identity)=A.
% 1.77/1.94 ** KEPT (pick-wt=5): 25 [] multiply(multiplicative_identity,A)=A.
% 1.77/1.94 ---> New Demodulator: 26 [new_demod,25] multiply(multiplicative_identity,A)=A.
% 1.77/1.94 ** KEPT (pick-wt=5): 27 [] add(A,additive_identity)=A.
% 1.77/1.94 ---> New Demodulator: 28 [new_demod,27] add(A,additive_identity)=A.
% 1.77/1.94 ** KEPT (pick-wt=5): 29 [] add(additive_identity,A)=A.
% 1.77/1.94 ---> New Demodulator: 30 [new_demod,29] add(additive_identity,A)=A.
% 1.77/1.94 ** KEPT (pick-wt=5): 31 [] add(a,b)=c.
% 1.94/2.09 ---> New Demodulator: 32 [new_demod,31] add(a,b)=c.
% 1.94/2.09 ** KEPT (pick-wt=7): 33 [] multiply(inverse(a),inverse(b))=d.
% 1.94/2.09 ---> New Demodulator: 34 [new_demod,33] multiply(inverse(a),inverse(b))=d.
% 1.94/2.09 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.94/2.09 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] add(A,B)=add(B,A).
% 1.94/2.09 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] multiply(A,B)=multiply(B,A).
% 1.94/2.09 >>>> Starting back demodulation with 7.
% 1.94/2.09 >>>> Starting back demodulation with 10.
% 1.94/2.09 >>>> Starting back demodulation with 12.
% 1.94/2.09 >> back demodulating 9 with 12.
% 1.94/2.09 >> back demodulating 6 with 12.
% 1.94/2.09 >>>> Starting back demodulation with 14.
% 1.94/2.09 >>>> Starting back demodulation with 16.
% 1.94/2.09 >>>> Starting back demodulation with 18.
% 1.94/2.09 >>>> Starting back demodulation with 20.
% 1.94/2.09 >>>> Starting back demodulation with 22.
% 1.94/2.09 >>>> Starting back demodulation with 24.
% 1.94/2.09 >>>> Starting back demodulation with 26.
% 1.94/2.09 >>>> Starting back demodulation with 28.
% 1.94/2.09 >>>> Starting back demodulation with 30.
% 1.94/2.09 >>>> Starting back demodulation with 32.
% 1.94/2.09 >>>> Starting back demodulation with 34.
% 1.94/2.09 >>>> Starting back demodulation with 36.
% 1.94/2.09 >>>> Starting back demodulation with 38.
% 1.94/2.09
% 1.94/2.09 ======= end of input processing =======
% 1.94/2.09
% 1.94/2.09 =========== start of search ===========
% 1.94/2.09
% 1.94/2.09
% 1.94/2.09 Resetting weight limit to 10.
% 1.94/2.09
% 1.94/2.09
% 1.94/2.09 Resetting weight limit to 10.
% 1.94/2.09
% 1.94/2.09 sos_size=339
% 1.94/2.09
% 1.94/2.09
% 1.94/2.09 Resetting weight limit to 9.
% 1.94/2.09
% 1.94/2.09
% 1.94/2.09 Resetting weight limit to 9.
% 1.94/2.09
% 1.94/2.09 sos_size=332
% 1.94/2.09
% 1.94/2.09 -------- PROOF --------
% 1.94/2.09
% 1.94/2.09 ----> UNIT CONFLICT at 0.15 sec ----> 1255 [binary,1253.1,1.1] $F.
% 1.94/2.09
% 1.94/2.09 Length of proof is 52. Level of proof is 10.
% 1.94/2.09
% 1.94/2.09 ---------------- PROOF ----------------
% 1.94/2.09 % SZS status Unsatisfiable
% 1.94/2.09 % SZS output start Refutation
% See solution above
% 1.94/2.09 ------------ end of proof -------------
% 1.94/2.09
% 1.94/2.09
% 1.94/2.09 Search stopped by max_proofs option.
% 1.94/2.09
% 1.94/2.09
% 1.94/2.09 Search stopped by max_proofs option.
% 1.94/2.09
% 1.94/2.09 ============ end of search ============
% 1.94/2.09
% 1.94/2.09 -------------- statistics -------------
% 1.94/2.09 clauses given 237
% 1.94/2.09 clauses generated 12329
% 1.94/2.09 clauses kept 706
% 1.94/2.09 clauses forward subsumed 7960
% 1.94/2.09 clauses back subsumed 24
% 1.94/2.09 Kbytes malloced 5859
% 1.94/2.09
% 1.94/2.09 ----------- times (seconds) -----------
% 1.94/2.09 user CPU time 0.15 (0 hr, 0 min, 0 sec)
% 1.94/2.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.09 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.94/2.09
% 1.94/2.09 That finishes the proof of the theorem.
% 1.94/2.09
% 1.94/2.09 Process 335 finished Wed Jul 27 02:33:57 2022
% 1.94/2.09 Otter interrupted
% 1.94/2.09 PROOF FOUND
%------------------------------------------------------------------------------