TSTP Solution File: GRP416-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP416-1 : TPTP v8.1.0. Released v2.6.0.
% 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:56:58 EDT 2022
% Result : Unsatisfiable 2.12s 2.33s
% Output : Refutation 2.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 2
% Syntax : Number of clauses : 53 ( 53 unt; 0 nHn; 5 RR)
% Number of literals : 53 ( 52 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 16 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 154 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('GRP416-1.p',unknown),
[] ).
cnf(4,axiom,
inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,inverse(C)))),inverse(multiply(inverse(A),A)))))) = C,
file('GRP416-1.p',unknown),
[] ).
cnf(5,plain,
inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(A,B)),multiply(A,inverse(C)))),inverse(multiply(inverse(B),B)))),inverse(multiply(inverse(multiply(C,multiply(B,inverse(D)))),inverse(multiply(inverse(inverse(multiply(inverse(multiply(inverse(multiply(A,B)),multiply(A,inverse(C)))),inverse(multiply(inverse(B),B))))),inverse(multiply(inverse(multiply(inverse(multiply(A,B)),multiply(A,inverse(C)))),inverse(multiply(inverse(B),B)))))))))) = D,
inference(para_into,[status(thm),theory(equality)],[4,4]),
[iquote('para_into,3.1.1.1.2.1.1.1.1,3.1.1')] ).
cnf(7,plain,
inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,C))),inverse(multiply(inverse(A),A)))))) = multiply(D,inverse(multiply(inverse(multiply(inverse(multiply(E,D)),multiply(E,inverse(C)))),inverse(multiply(inverse(D),D))))),
inference(para_into,[status(thm),theory(equality)],[4,4]),
[iquote('para_into,3.1.1.1.2.1.1.1.2.2,3.1.1')] ).
cnf(10,plain,
multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,inverse(C)))),inverse(multiply(inverse(A),A))))) = inverse(multiply(D,inverse(multiply(inverse(multiply(inverse(multiply(E,D)),multiply(E,C))),inverse(multiply(inverse(D),D)))))),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[7])]),
[iquote('copy,7,flip.1')] ).
cnf(17,plain,
multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,inverse(inverse(C))))),inverse(multiply(inverse(A),A))))) = C,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[7,4])]),
[iquote('para_into,7.1.1,3.1.1,flip.1')] ).
cnf(39,plain,
inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),C)),inverse(multiply(inverse(A),A)))))) = multiply(inverse(multiply(inverse(multiply(D,B)),multiply(D,inverse(inverse(C))))),inverse(multiply(inverse(B),B))),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[17,7]),17]),
[iquote('para_from,16.1.1,7.1.1.1.2.1.1.1.2,demod,17')] ).
cnf(40,plain,
multiply(inverse(multiply(inverse(multiply(A,B)),multiply(A,inverse(inverse(C))))),inverse(multiply(inverse(B),B))) = inverse(multiply(D,inverse(multiply(inverse(multiply(inverse(multiply(B,D)),C)),inverse(multiply(inverse(D),D)))))),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[39])]),
[iquote('copy,39,flip.1')] ).
cnf(59,plain,
multiply(inverse(multiply(inverse(multiply(A,B)),multiply(A,inverse(inverse(multiply(B,inverse(C))))))),inverse(multiply(inverse(B),B))) = C,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[39,4])]),
[iquote('para_into,39.1.1,3.1.1,flip.1')] ).
cnf(160,plain,
multiply(inverse(multiply(inverse(multiply(A,B)),multiply(A,C))),inverse(multiply(inverse(B),B))) = multiply(inverse(multiply(inverse(multiply(D,B)),multiply(D,C))),inverse(multiply(inverse(B),B))),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[59,7]),4]),
[iquote('para_into,58.1.1.1.1.2.2.1,7.1.1,demod,4')] ).
cnf(161,plain,
inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(B,C)),multiply(B,inverse(inverse(multiply(C,inverse(D))))))),A)),D)),inverse(multiply(inverse(A),A)))))) = multiply(inverse(C),C),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[59,7]),17]),
[iquote('para_from,58.1.1,7.1.1.1.2.1.1.1.2,demod,17')] ).
cnf(169,plain,
multiply(A,inverse(inverse(multiply(B,inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),inverse(multiply(inverse(B),B)))))))) = C,
inference(para_from,[status(thm),theory(equality)],[40,17]),
[iquote('para_from,40.1.1,16.1.1.2.1')] ).
cnf(171,plain,
inverse(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(B,C)),A)),D)),inverse(multiply(inverse(A),A))))))) = multiply(B,inverse(inverse(multiply(C,inverse(multiply(inverse(D),inverse(multiply(inverse(C),C)))))))),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[169,169])]),
[iquote('para_into,168.1.1.2.1.1.2.1.1.1,168.1.1,flip.1')] ).
cnf(172,plain,
multiply(A,inverse(inverse(multiply(B,inverse(multiply(inverse(multiply(inverse(multiply(C,B)),multiply(C,D))),inverse(multiply(inverse(B),B)))))))) = multiply(A,D),
inference(para_into,[status(thm),theory(equality)],[169,160]),
[iquote('para_into,168.1.1.2.1.1.2.1,160.1.1')] ).
cnf(174,plain,
multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),C)),inverse(multiply(inverse(A),A))))) = multiply(D,inverse(multiply(inverse(multiply(inverse(multiply(B,D)),C)),inverse(multiply(inverse(D),D))))),
inference(para_from,[status(thm),theory(equality)],[169,17]),
[iquote('para_from,168.1.1,16.1.1.2.1.1.1.2')] ).
cnf(178,plain,
inverse(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,C))),inverse(multiply(inverse(A),A))))))) = C,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[172,169]),169])]),
[iquote('para_from,172.1.1,168.1.1.2.1.1.2.1.1.1,demod,169,flip.1')] ).
cnf(180,plain,
multiply(inverse(multiply(A,B)),inverse(inverse(multiply(multiply(A,C),inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(D,B)),multiply(D,C))),E)),inverse(multiply(inverse(multiply(A,C)),multiply(A,C))))))))) = E,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[178,160]),171]),
[iquote('para_into,177.1.1.1.1.2.1.1.1.1.1,160.1.1,demod,171')] ).
cnf(192,plain,
inverse(multiply(inverse(multiply(inverse(A),A)),inverse(multiply(inverse(multiply(inverse(B),B)),inverse(multiply(inverse(inverse(multiply(inverse(A),A))),inverse(multiply(inverse(A),A)))))))) = multiply(inverse(A),A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[161,160]),59]),
[iquote('para_into,161.1.1.1.2.1.1.1.1.1,160.1.1,demod,59')] ).
cnf(196,plain,
multiply(inverse(multiply(A,B)),multiply(A,inverse(inverse(multiply(B,inverse(multiply(inverse(C),inverse(multiply(inverse(B),B))))))))) = C,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[180,174]),171]),
[iquote('para_into,180.1.1.2.1.1,174.1.1,demod,171')] ).
cnf(201,plain,
multiply(inverse(multiply(A,B)),multiply(A,C)) = multiply(inverse(multiply(D,B)),multiply(D,C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[196,160]),178]),
[iquote('para_into,196.1.1.2.2.1.1.2.1,160.1.1,demod,178')] ).
cnf(203,plain,
multiply(inverse(multiply(A,inverse(multiply(inverse(B),B)))),multiply(A,inverse(multiply(inverse(B),B)))) = multiply(inverse(C),C),
inference(para_into,[status(thm),theory(equality)],[196,192]),
[iquote('para_into,196.1.1.2.2.1,192.1.1')] ).
cnf(225,plain,
multiply(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,C)),multiply(B,inverse(D)))),inverse(multiply(inverse(C),C)))))),multiply(A,E)) = multiply(D,multiply(C,E)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[201,10]),178])]),
[iquote('para_into,201.1.1.1.1,10.1.1,demod,178,flip.1')] ).
cnf(264,plain,
multiply(inverse(A),A) = multiply(inverse(B),B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[203,59]),59]),
[iquote('para_into,203.1.1.1.1,58.1.1,demod,59')] ).
cnf(289,plain,
multiply(inverse(inverse(A)),inverse(multiply(inverse(multiply(inverse(B),B)),inverse(multiply(inverse(inverse(inverse(A))),inverse(inverse(A))))))) = A,
inference(para_from,[status(thm),theory(equality)],[264,17]),
[iquote('para_from,264.1.1,16.1.1.2.1.1.1')] ).
cnf(294,plain,
multiply(inverse(multiply(inverse(A),B)),multiply(inverse(C),C)) = multiply(inverse(multiply(D,B)),multiply(D,A)),
inference(para_from,[status(thm),theory(equality)],[264,201]),
[iquote('para_from,264.1.1,201.1.1.2')] ).
cnf(295,plain,
inverse(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(B),B)),inverse(multiply(inverse(A),A))))))) = A,
inference(para_from,[status(thm),theory(equality)],[264,178]),
[iquote('para_from,264.1.1,177.1.1.1.1.2.1.1.1')] ).
cnf(301,plain,
inverse(multiply(inverse(A),inverse(multiply(inverse(multiply(inverse(B),B)),inverse(multiply(inverse(inverse(A)),inverse(A))))))) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[264,5]),59,59,59]),
[iquote('para_from,264.1.1,5.1.1.1.2.1.1.1,demod,59,59,59')] ).
cnf(312,plain,
multiply(inverse(multiply(inverse(A),A)),multiply(inverse(B),inverse(inverse(multiply(B,inverse(multiply(inverse(C),inverse(multiply(inverse(B),B))))))))) = C,
inference(para_from,[status(thm),theory(equality)],[264,196]),
[iquote('para_from,264.1.1,196.1.1.1.1')] ).
cnf(323,plain,
inverse(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,C))),inverse(multiply(inverse(D),D))))))) = C,
inference(para_from,[status(thm),theory(equality)],[264,178]),
[iquote('para_from,264.1.1,177.1.1.1.1.2.1.2.1')] ).
cnf(336,plain,
multiply(multiply(inverse(A),A),a2) != a2,
inference(para_from,[status(thm),theory(equality)],[264,1]),
[iquote('para_from,264.1.1,1.1.1.1')] ).
cnf(338,plain,
multiply(inverse(multiply(A,B)),multiply(A,C)) = multiply(inverse(multiply(inverse(C),B)),multiply(inverse(D),D)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[294])]),
[iquote('copy,294,flip.1')] ).
cnf(340,plain,
inverse(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(B),B)),inverse(multiply(inverse(C),C))))))) = A,
inference(para_into,[status(thm),theory(equality)],[295,264]),
[iquote('para_into,295.1.1.1.1.2.1.2.1,264.1.1')] ).
cnf(352,plain,
multiply(A,multiply(inverse(B),B)) = multiply(A,multiply(inverse(C),C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[294,10]),323,225]),
[iquote('para_into,294.1.1.1.1,10.1.1,demod,323,225')] ).
cnf(362,plain,
multiply(inverse(A),A) = multiply(inverse(multiply(inverse(B),B)),multiply(inverse(C),C)),
inference(para_into,[status(thm),theory(equality)],[352,264]),
[iquote('para_into,352.1.1,264.1.1')] ).
cnf(365,plain,
multiply(inverse(multiply(inverse(A),A)),multiply(inverse(B),B)) = multiply(inverse(C),C),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[362])]),
[iquote('copy,362,flip.1')] ).
cnf(368,plain,
inverse(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(B),B)),inverse(multiply(inverse(multiply(inverse(C),C)),multiply(inverse(D),D)))))))) = A,
inference(para_from,[status(thm),theory(equality)],[352,340]),
[iquote('para_from,352.1.1,340.1.1.1.1.2.1.2.1')] ).
cnf(374,plain,
multiply(multiply(inverse(multiply(inverse(A),A)),multiply(inverse(B),B)),a2) != a2,
inference(para_from,[status(thm),theory(equality)],[352,336]),
[iquote('para_from,352.1.1,336.1.1.1')] ).
cnf(487,plain,
inverse(multiply(inverse(A),inverse(multiply(inverse(multiply(inverse(B),B)),inverse(multiply(inverse(C),C)))))) = A,
inference(para_into,[status(thm),theory(equality)],[301,264]),
[iquote('para_into,301.1.1.1.2.1.2.1,264.1.1')] ).
cnf(493,plain,
inverse(multiply(inverse(A),multiply(inverse(B),B))) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[487,487]),487]),
[iquote('para_into,486.1.1.1.2.1.2,486.1.1,demod,487')] ).
cnf(532,plain,
inverse(inverse(multiply(A,multiply(inverse(B),B)))) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[368]),493,493]),
[iquote('back_demod,368,demod,493,493')] ).
cnf(557,plain,
multiply(A,multiply(inverse(A),B)) = multiply(B,multiply(inverse(C),C)),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[487,338]),487]),
[iquote('para_from,486.1.1,338.1.1.1,demod,487')] ).
cnf(572,plain,
multiply(A,multiply(inverse(B),B)) = multiply(C,multiply(inverse(C),A)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[557])]),
[iquote('copy,557,flip.1')] ).
cnf(586,plain,
inverse(multiply(inverse(A),A)) = multiply(inverse(B),B),
inference(para_into,[status(thm),theory(equality)],[493,365]),
[iquote('para_into,492.1.1.1,365.1.1')] ).
cnf(592,plain,
multiply(inverse(A),A) = inverse(multiply(inverse(B),B)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[586])]),
[iquote('copy,586,flip.1')] ).
cnf(643,plain,
multiply(inverse(multiply(inverse(A),A)),a2) != a2,
inference(para_from,[status(thm),theory(equality)],[592,374]),
[iquote('para_from,592.1.1,374.1.1.1')] ).
cnf(649,plain,
inverse(multiply(inverse(A),inverse(multiply(inverse(B),B)))) = A,
inference(para_from,[status(thm),theory(equality)],[592,493]),
[iquote('para_from,592.1.1,492.1.1.1.2')] ).
cnf(664,plain,
multiply(inverse(multiply(inverse(A),A)),multiply(inverse(B),inverse(inverse(multiply(B,C))))) = C,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[312]),649]),
[iquote('back_demod,312,demod,649')] ).
cnf(670,plain,
multiply(inverse(inverse(A)),multiply(inverse(B),B)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[289]),649]),
[iquote('back_demod,289,demod,649')] ).
cnf(886,plain,
multiply(A,multiply(inverse(A),inverse(inverse(B)))) = B,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[572,670])]),
[iquote('para_into,572.1.1,670.1.1,flip.1')] ).
cnf(890,plain,
inverse(inverse(multiply(A,multiply(inverse(A),B)))) = B,
inference(para_from,[status(thm),theory(equality)],[572,532]),
[iquote('para_from,572.1.1,532.1.1.1.1')] ).
cnf(894,plain,
inverse(inverse(multiply(A,B))) = multiply(inverse(inverse(A)),inverse(inverse(B))),
inference(para_into,[status(thm),theory(equality)],[890,886]),
[iquote('para_into,890.1.1.1.1.2,885.1.1')] ).
cnf(895,plain,
multiply(inverse(multiply(inverse(A),A)),B) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[664]),894,886]),
[iquote('back_demod,664,demod,894,886')] ).
cnf(897,plain,
$false,
inference(binary,[status(thm)],[895,643]),
[iquote('binary,895.1,643.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP416-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n020.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 05:34:38 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.12/2.33 ----- Otter 3.3f, August 2004 -----
% 2.12/2.33 The process was started by sandbox on n020.cluster.edu,
% 2.12/2.33 Wed Jul 27 05:34:38 2022
% 2.12/2.33 The command was "./otter". The process ID is 3486.
% 2.12/2.33
% 2.12/2.33 set(prolog_style_variables).
% 2.12/2.33 set(auto).
% 2.12/2.33 dependent: set(auto1).
% 2.12/2.33 dependent: set(process_input).
% 2.12/2.33 dependent: clear(print_kept).
% 2.12/2.33 dependent: clear(print_new_demod).
% 2.12/2.33 dependent: clear(print_back_demod).
% 2.12/2.33 dependent: clear(print_back_sub).
% 2.12/2.33 dependent: set(control_memory).
% 2.12/2.33 dependent: assign(max_mem, 12000).
% 2.12/2.33 dependent: assign(pick_given_ratio, 4).
% 2.12/2.33 dependent: assign(stats_level, 1).
% 2.12/2.33 dependent: assign(max_seconds, 10800).
% 2.12/2.33 clear(print_given).
% 2.12/2.33
% 2.12/2.33 list(usable).
% 2.12/2.33 0 [] A=A.
% 2.12/2.33 0 [] inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,inverse(C)))),inverse(multiply(inverse(A),A))))))=C.
% 2.12/2.33 0 [] multiply(multiply(inverse(b2),b2),a2)!=a2.
% 2.12/2.33 end_of_list.
% 2.12/2.33
% 2.12/2.33 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.12/2.33
% 2.12/2.33 All clauses are units, and equality is present; the
% 2.12/2.33 strategy will be Knuth-Bendix with positive clauses in sos.
% 2.12/2.33
% 2.12/2.33 dependent: set(knuth_bendix).
% 2.12/2.33 dependent: set(anl_eq).
% 2.12/2.33 dependent: set(para_from).
% 2.12/2.33 dependent: set(para_into).
% 2.12/2.33 dependent: clear(para_from_right).
% 2.12/2.33 dependent: clear(para_into_right).
% 2.12/2.33 dependent: set(para_from_vars).
% 2.12/2.33 dependent: set(eq_units_both_ways).
% 2.12/2.33 dependent: set(dynamic_demod_all).
% 2.12/2.33 dependent: set(dynamic_demod).
% 2.12/2.33 dependent: set(order_eq).
% 2.12/2.33 dependent: set(back_demod).
% 2.12/2.33 dependent: set(lrpo).
% 2.12/2.33
% 2.12/2.33 ------------> process usable:
% 2.12/2.33 ** KEPT (pick-wt=8): 1 [] multiply(multiply(inverse(b2),b2),a2)!=a2.
% 2.12/2.33
% 2.12/2.33 ------------> process sos:
% 2.12/2.33 ** KEPT (pick-wt=3): 2 [] A=A.
% 2.12/2.33 ** KEPT (pick-wt=22): 3 [] inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,inverse(C)))),inverse(multiply(inverse(A),A))))))=C.
% 2.12/2.33 ---> New Demodulator: 4 [new_demod,3] inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,inverse(C)))),inverse(multiply(inverse(A),A))))))=C.
% 2.12/2.33 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 2.12/2.33 >>>> Starting back demodulation with 4.
% 2.12/2.33
% 2.12/2.33 ======= end of input processing =======
% 2.12/2.33
% 2.12/2.33 =========== start of search ===========
% 2.12/2.33
% 2.12/2.33
% 2.12/2.33 Resetting weight limit to 39.
% 2.12/2.33
% 2.12/2.33
% 2.12/2.33 Resetting weight limit to 39.
% 2.12/2.33
% 2.12/2.33 sos_size=97
% 2.12/2.33
% 2.12/2.33
% 2.12/2.33 Resetting weight limit to 29.
% 2.12/2.33
% 2.12/2.33
% 2.12/2.33 Resetting weight limit to 29.
% 2.12/2.33
% 2.12/2.33 sos_size=148
% 2.12/2.33
% 2.12/2.33
% 2.12/2.33 Resetting weight limit to 18.
% 2.12/2.33
% 2.12/2.33
% 2.12/2.33 Resetting weight limit to 18.
% 2.12/2.33
% 2.12/2.33 sos_size=330
% 2.12/2.33
% 2.12/2.33
% 2.12/2.33 Resetting weight limit to 13.
% 2.12/2.33
% 2.12/2.33
% 2.12/2.33 Resetting weight limit to 13.
% 2.12/2.33
% 2.12/2.33 sos_size=313
% 2.12/2.33
% 2.12/2.33 -------- PROOF --------
% 2.12/2.33
% 2.12/2.33 ----> UNIT CONFLICT at 0.33 sec ----> 897 [binary,895.1,643.1] $F.
% 2.12/2.33
% 2.12/2.33 Length of proof is 50. Level of proof is 22.
% 2.12/2.33
% 2.12/2.33 ---------------- PROOF ----------------
% 2.12/2.33 % SZS status Unsatisfiable
% 2.12/2.33 % SZS output start Refutation
% See solution above
% 2.12/2.33 ------------ end of proof -------------
% 2.12/2.33
% 2.12/2.33
% 2.12/2.33 Search stopped by max_proofs option.
% 2.12/2.33
% 2.12/2.33
% 2.12/2.33 Search stopped by max_proofs option.
% 2.12/2.33
% 2.12/2.33 ============ end of search ============
% 2.12/2.33
% 2.12/2.33 -------------- statistics -------------
% 2.12/2.33 clauses given 80
% 2.12/2.33 clauses generated 8494
% 2.12/2.33 clauses kept 700
% 2.12/2.33 clauses forward subsumed 2221
% 2.12/2.33 clauses back subsumed 17
% 2.12/2.33 Kbytes malloced 7812
% 2.12/2.33
% 2.12/2.33 ----------- times (seconds) -----------
% 2.12/2.33 user CPU time 0.33 (0 hr, 0 min, 0 sec)
% 2.12/2.33 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.12/2.33 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.12/2.33
% 2.12/2.33 That finishes the proof of the theorem.
% 2.12/2.33
% 2.12/2.33 Process 3486 finished Wed Jul 27 05:34:40 2022
% 2.12/2.33 Otter interrupted
% 2.12/2.33 PROOF FOUND
%------------------------------------------------------------------------------