TSTP Solution File: GRP511-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP511-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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:57:09 EDT 2022
% Result : Unsatisfiable 1.93s 2.10s
% Output : Refutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of clauses : 40 ( 40 unt; 0 nHn; 2 RR)
% Number of literals : 40 ( 39 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 122 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('GRP511-1.p',unknown),
[] ).
cnf(4,axiom,
multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B,
file('GRP511-1.p',unknown),
[] ).
cnf(5,plain,
multiply(multiply(A,B),inverse(multiply(multiply(multiply(C,A),D),B))) = inverse(multiply(C,D)),
inference(para_into,[status(thm),theory(equality)],[4,4]),
[iquote('para_into,3.1.1.1.1,3.1.1')] ).
cnf(7,plain,
multiply(A,inverse(multiply(multiply(B,A),inverse(multiply(B,C))))) = C,
inference(para_into,[status(thm),theory(equality)],[4,4]),
[iquote('para_into,3.1.1.1,3.1.1')] ).
cnf(9,plain,
multiply(multiply(multiply(multiply(multiply(A,B),C),D),inverse(multiply(A,C))),inverse(B)) = D,
inference(para_into,[status(thm),theory(equality)],[4,4]),
[iquote('para_into,3.1.1.2.1,3.1.1')] ).
cnf(15,plain,
multiply(A,inverse(multiply(multiply(B,A),inverse(C)))) = inverse(multiply(multiply(D,B),inverse(multiply(D,C)))),
inference(para_into,[status(thm),theory(equality)],[7,7]),
[iquote('para_into,7.1.1.2.1.2.1,7.1.1')] ).
cnf(18,plain,
inverse(multiply(multiply(A,B),inverse(multiply(A,C)))) = multiply(D,inverse(multiply(multiply(B,D),inverse(C)))),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[15])]),
[iquote('copy,15,flip.1')] ).
cnf(19,plain,
multiply(multiply(multiply(A,B),inverse(multiply(multiply(C,A),inverse(multiply(C,D))))),inverse(D)) = B,
inference(para_from,[status(thm),theory(equality)],[7,4]),
[iquote('para_from,7.1.1,3.1.1.2.1')] ).
cnf(23,plain,
multiply(multiply(A,B),inverse(multiply(C,B))) = inverse(multiply(multiply(D,C),inverse(multiply(D,A)))),
inference(para_from,[status(thm),theory(equality)],[7,4]),
[iquote('para_from,7.1.1,3.1.1.1.1')] ).
cnf(24,plain,
inverse(multiply(multiply(A,B),inverse(multiply(A,C)))) = multiply(multiply(C,D),inverse(multiply(B,D))),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[23])]),
[iquote('copy,23,flip.1')] ).
cnf(31,plain,
multiply(multiply(inverse(multiply(multiply(A,B),inverse(multiply(A,C)))),D),inverse(multiply(multiply(C,E),D))) = inverse(multiply(B,E)),
inference(para_into,[status(thm),theory(equality)],[5,7]),
[iquote('para_into,5.1.1.2.1.1.1,7.1.1')] ).
cnf(34,plain,
multiply(multiply(A,B),inverse(multiply(C,B))) = inverse(multiply(D,inverse(multiply(multiply(E,multiply(D,A)),inverse(multiply(E,C)))))),
inference(para_into,[status(thm),theory(equality)],[5,7]),
[iquote('para_into,5.1.1.2.1.1,7.1.1')] ).
cnf(43,plain,
inverse(multiply(A,multiply(B,inverse(multiply(multiply(A,B),C))))) = C,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[5,7])]),
[iquote('para_into,5.1.1,7.1.1,flip.1')] ).
cnf(44,plain,
inverse(multiply(A,B)) = multiply(multiply(inverse(multiply(multiply(C,A),inverse(multiply(C,D)))),E),inverse(multiply(multiply(D,B),E))),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[31])]),
[iquote('copy,31,flip.1')] ).
cnf(62,plain,
inverse(multiply(multiply(A,multiply(B,C)),inverse(multiply(A,D)))) = inverse(multiply(B,multiply(C,inverse(D)))),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[43,7])]),
[iquote('para_into,42.1.1.1.2.2.1,7.1.1,flip.1')] ).
cnf(73,plain,
multiply(multiply(A,B),inverse(multiply(C,B))) = inverse(multiply(D,inverse(multiply(D,multiply(A,inverse(C)))))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[34]),62]),
[iquote('back_demod,34,demod,62')] ).
cnf(80,plain,
multiply(multiply(multiply(A,B),multiply(C,inverse(multiply(multiply(A,C),D)))),D) = B,
inference(para_from,[status(thm),theory(equality)],[43,4]),
[iquote('para_from,42.1.1,3.1.1.2')] ).
cnf(94,plain,
multiply(multiply(A,inverse(B)),inverse(A)) = inverse(B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[9,9]),4]),
[iquote('para_into,9.1.1.1.1,9.1.1,demod,4')] ).
cnf(126,plain,
multiply(multiply(A,B),inverse(A)) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[94,43]),43]),
[iquote('para_into,94.1.1.1.2,42.1.1,demod,43')] ).
cnf(133,plain,
inverse(multiply(multiply(A,B),inverse(multiply(A,C)))) = multiply(C,inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[94,7])]),
[iquote('para_into,94.1.1.1,7.1.1,flip.1')] ).
cnf(137,plain,
multiply(A,inverse(multiply(multiply(B,A),C))) = inverse(multiply(B,C)),
inference(para_into,[status(thm),theory(equality)],[94,4]),
[iquote('para_into,94.1.1.1,3.1.1')] ).
cnf(147,plain,
inverse(multiply(A,multiply(B,inverse(C)))) = multiply(C,inverse(multiply(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[62]),133])]),
[iquote('back_demod,61,demod,133,flip.1')] ).
cnf(150,plain,
inverse(multiply(A,B)) = multiply(multiply(multiply(C,inverse(A)),D),inverse(multiply(multiply(C,B),D))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[44]),133]),
[iquote('back_demod,44,demod,133')] ).
cnf(155,plain,
multiply(multiply(A,B),inverse(multiply(C,B))) = multiply(A,inverse(C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[24]),133])]),
[iquote('back_demod,24,demod,133,flip.1')] ).
cnf(156,plain,
multiply(multiply(multiply(A,B),multiply(C,inverse(A))),inverse(C)) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[19]),133]),
[iquote('back_demod,19,demod,133')] ).
cnf(159,plain,
inverse(multiply(A,inverse(B))) = multiply(B,inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[18]),133,137])]),
[iquote('back_demod,18,demod,133,137,flip.1')] ).
cnf(163,plain,
multiply(A,multiply(multiply(B,C),inverse(multiply(B,A)))) = C,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[7]),159]),
[iquote('back_demod,7,demod,159')] ).
cnf(185,plain,
multiply(multiply(multiply(A,B),inverse(multiply(A,C))),C) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[80]),137]),
[iquote('back_demod,80,demod,137')] ).
cnf(193,plain,
multiply(multiply(A,B),inverse(multiply(A,C))) = multiply(B,inverse(C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[73]),155,147,147])]),
[iquote('back_demod,73,demod,155,147,147,flip.1')] ).
cnf(195,plain,
inverse(multiply(A,B)) = multiply(inverse(A),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[150])]),155,193])]),
[iquote('copy,150,flip.1,demod,155,193,flip.1')] ).
cnf(218,plain,
multiply(multiply(multiply(A,B),multiply(inverse(A),inverse(C))),C) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[185]),195]),
[iquote('back_demod,185,demod,195')] ).
cnf(222,plain,
multiply(A,multiply(multiply(B,C),multiply(inverse(B),inverse(A)))) = C,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[163]),195]),
[iquote('back_demod,163,demod,195')] ).
cnf(228,plain,
multiply(multiply(A,B),multiply(inverse(A),inverse(C))) = multiply(B,inverse(C)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[193]),195]),
[iquote('back_demod,192,demod,195')] ).
cnf(271,plain,
multiply(A,multiply(B,inverse(A))) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[222]),228]),
[iquote('back_demod,222,demod,228')] ).
cnf(275,plain,
multiply(multiply(A,inverse(B)),B) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[218]),228]),
[iquote('back_demod,218,demod,228')] ).
cnf(286,plain,
inverse(inverse(A)) = A,
inference(para_into,[status(thm),theory(equality)],[275,126]),
[iquote('para_into,275.1.1,126.1.1')] ).
cnf(331,plain,
multiply(inverse(A),multiply(B,A)) = B,
inference(para_from,[status(thm),theory(equality)],[286,271]),
[iquote('para_from,285.1.1,271.1.1.2.2')] ).
cnf(341,plain,
multiply(multiply(A,multiply(B,C)),inverse(B)) = multiply(A,C),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[156,331]),286]),
[iquote('para_into,156.1.1.1.1,331.1.1,demod,286')] ).
cnf(473,plain,
multiply(multiply(A,B),C) = multiply(A,multiply(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[341,331]),286]),
[iquote('para_into,341.1.1.1.2,331.1.1,demod,286')] ).
cnf(475,plain,
$false,
inference(binary,[status(thm)],[473,1]),
[iquote('binary,473.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP511-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n011.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 05:17:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.93/2.10 ----- Otter 3.3f, August 2004 -----
% 1.93/2.10 The process was started by sandbox on n011.cluster.edu,
% 1.93/2.10 Wed Jul 27 05:17:10 2022
% 1.93/2.10 The command was "./otter". The process ID is 15491.
% 1.93/2.10
% 1.93/2.10 set(prolog_style_variables).
% 1.93/2.10 set(auto).
% 1.93/2.10 dependent: set(auto1).
% 1.93/2.10 dependent: set(process_input).
% 1.93/2.10 dependent: clear(print_kept).
% 1.93/2.10 dependent: clear(print_new_demod).
% 1.93/2.10 dependent: clear(print_back_demod).
% 1.93/2.10 dependent: clear(print_back_sub).
% 1.93/2.10 dependent: set(control_memory).
% 1.93/2.10 dependent: assign(max_mem, 12000).
% 1.93/2.10 dependent: assign(pick_given_ratio, 4).
% 1.93/2.10 dependent: assign(stats_level, 1).
% 1.93/2.10 dependent: assign(max_seconds, 10800).
% 1.93/2.10 clear(print_given).
% 1.93/2.10
% 1.93/2.10 list(usable).
% 1.93/2.10 0 [] A=A.
% 1.93/2.10 0 [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C)))=B.
% 1.93/2.10 0 [] multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)).
% 1.93/2.10 end_of_list.
% 1.93/2.10
% 1.93/2.10 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.93/2.10
% 1.93/2.10 All clauses are units, and equality is present; the
% 1.93/2.10 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.93/2.10
% 1.93/2.10 dependent: set(knuth_bendix).
% 1.93/2.10 dependent: set(anl_eq).
% 1.93/2.10 dependent: set(para_from).
% 1.93/2.10 dependent: set(para_into).
% 1.93/2.10 dependent: clear(para_from_right).
% 1.93/2.10 dependent: clear(para_into_right).
% 1.93/2.10 dependent: set(para_from_vars).
% 1.93/2.10 dependent: set(eq_units_both_ways).
% 1.93/2.10 dependent: set(dynamic_demod_all).
% 1.93/2.10 dependent: set(dynamic_demod).
% 1.93/2.10 dependent: set(order_eq).
% 1.93/2.10 dependent: set(back_demod).
% 1.93/2.10 dependent: set(lrpo).
% 1.93/2.10
% 1.93/2.10 ------------> process usable:
% 1.93/2.10 ** KEPT (pick-wt=11): 1 [] multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)).
% 1.93/2.10
% 1.93/2.10 ------------> process sos:
% 1.93/2.10 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.93/2.10 ** KEPT (pick-wt=12): 3 [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C)))=B.
% 1.93/2.10 ---> New Demodulator: 4 [new_demod,3] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C)))=B.
% 1.93/2.10 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.93/2.10 >>>> Starting back demodulation with 4.
% 1.93/2.10
% 1.93/2.10 ======= end of input processing =======
% 1.93/2.10
% 1.93/2.10 =========== start of search ===========
% 1.93/2.10
% 1.93/2.10 -------- PROOF --------
% 1.93/2.10
% 1.93/2.10 ----> UNIT CONFLICT at 0.02 sec ----> 475 [binary,473.1,1.1] $F.
% 1.93/2.10
% 1.93/2.10 Length of proof is 37. Level of proof is 12.
% 1.93/2.10
% 1.93/2.10 ---------------- PROOF ----------------
% 1.93/2.10 % SZS status Unsatisfiable
% 1.93/2.10 % SZS output start Refutation
% See solution above
% 1.93/2.10 ------------ end of proof -------------
% 1.93/2.10
% 1.93/2.10
% 1.93/2.10 Search stopped by max_proofs option.
% 1.93/2.10
% 1.93/2.10
% 1.93/2.10 Search stopped by max_proofs option.
% 1.93/2.10
% 1.93/2.10 ============ end of search ============
% 1.93/2.10
% 1.93/2.10 -------------- statistics -------------
% 1.93/2.10 clauses given 35
% 1.93/2.10 clauses generated 615
% 1.93/2.10 clauses kept 276
% 1.93/2.10 clauses forward subsumed 574
% 1.93/2.10 clauses back subsumed 2
% 1.93/2.10 Kbytes malloced 2929
% 1.93/2.10
% 1.93/2.10 ----------- times (seconds) -----------
% 1.93/2.10 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.93/2.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.10 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.93/2.10
% 1.93/2.10 That finishes the proof of the theorem.
% 1.93/2.10
% 1.93/2.10 Process 15491 finished Wed Jul 27 05:17:12 2022
% 1.93/2.10 Otter interrupted
% 1.93/2.10 PROOF FOUND
%------------------------------------------------------------------------------