TSTP Solution File: GRP510-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP510-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n008.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 : 600s
% DateTime : Sat Jul 16 08:47:45 EDT 2022
% Result : Unsatisfiable 0.71s 1.13s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 2
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 3 RR)
% Number of literals : 43 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))),B),
file('GRP510-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(multiply(inverse(b2),b2),a2),a2),
file('GRP510-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),inverse(multiply(multiply(multiply(C,A),D),B))),inverse(multiply(C,D))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(4,plain,
equal(multiply(A,inverse(multiply(multiply(B,A),inverse(multiply(B,C))))),C),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(5,plain,
equal(multiply(multiply(multiply(multiply(multiply(A,B),C),D),inverse(multiply(A,C))),inverse(B)),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(11,plain,
equal(multiply(multiply(A,inverse(multiply(B,C))),inverse(A)),inverse(multiply(B,C))),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(18,plain,
equal(multiply(A,inverse(multiply(multiply(B,A),C))),inverse(multiply(B,C))),
inference(para,[status(thm),theory(equality)],[1,11]),
[iquote('para(1,11)')] ).
cnf(19,plain,
equal(inverse(multiply(A,inverse(multiply(A,B)))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),18]),
[iquote('back_demod(4),demod([18])')] ).
cnf(25,plain,
equal(multiply(multiply(multiply(A,B),inverse(multiply(A,C))),C),B),
inference(para,[status(thm),theory(equality)],[19,1]),
[iquote('para(19,1)')] ).
cnf(27,plain,
equal(multiply(multiply(A,inverse(B)),inverse(A)),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,3]),1]),
[iquote('para(5,3),demod([1])')] ).
cnf(35,plain,
equal(multiply(inverse(A),inverse(multiply(B,inverse(A)))),inverse(B)),
inference(para,[status(thm),theory(equality)],[27,27]),
[iquote('para(27,27)')] ).
cnf(36,plain,
equal(multiply(inverse(multiply(A,B)),B),inverse(A)),
inference(para,[status(thm),theory(equality)],[19,35]),
[iquote('para(19,35)')] ).
cnf(39,plain,
equal(inverse(inverse(inverse(A))),inverse(A)),
inference(para,[status(thm),theory(equality)],[35,19]),
[iquote('para(35,19)')] ).
cnf(45,plain,
equal(inverse(multiply(inverse(multiply(A,B)),inverse(inverse(A)))),B),
inference(para,[status(thm),theory(equality)],[36,19]),
[iquote('para(36,19)')] ).
cnf(57,plain,
equal(inverse(multiply(A,inverse(B))),multiply(inverse(A),inverse(inverse(B)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[35,27]),1]),
[iquote('para(35,27),flip(1)')] ).
cnf(63,plain,
equal(multiply(inverse(inverse(multiply(A,B))),inverse(A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[45]),57,39]),
[iquote('back_demod(45),demod([57,39])')] ).
cnf(80,plain,
equal(multiply(inverse(inverse(multiply(inverse(inverse(A)),B))),inverse(A)),B),
inference(para,[status(thm),theory(equality)],[39,63]),
[iquote('para(39,63)')] ).
cnf(90,plain,
equal(multiply(A,inverse(multiply(B,A))),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[63,27]),39]),
[iquote('para(63,27),demod([39])')] ).
cnf(91,plain,
equal(inverse(inverse(multiply(A,B))),multiply(B,inverse(inverse(A)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[36,90]),1]),
[iquote('para(36,90),flip(1)')] ).
cnf(94,plain,
equal(multiply(multiply(A,inverse(inverse(B))),inverse(B)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[80]),91,39]),
[iquote('back_demod(80),demod([91,39])')] ).
cnf(114,plain,
equal(multiply(multiply(A,inverse(B)),inverse(inverse(B))),A),
inference(para,[status(thm),theory(equality)],[39,94]),
[iquote('para(39,94)')] ).
cnf(122,plain,
equal(inverse(multiply(multiply(A,B),C)),inverse(multiply(A,multiply(B,C)))),
inference(para,[status(thm),theory(equality)],[18,3]),
[iquote('para(18,3)')] ).
cnf(150,plain,
equal(multiply(A,inverse(multiply(B,multiply(A,C)))),inverse(multiply(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[18]),122]),
[iquote('back_demod(18),demod([122])')] ).
cnf(153,plain,
equal(multiply(multiply(A,B),inverse(multiply(C,multiply(A,multiply(D,B))))),inverse(multiply(C,D))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),122,122]),
[iquote('back_demod(3),demod([122,122])')] ).
cnf(158,plain,
equal(inverse(multiply(A,B)),multiply(inverse(A),inverse(B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[90,27]),1]),
[iquote('para(90,27),flip(1)')] ).
cnf(162,plain,
equal(multiply(multiply(A,B),multiply(inverse(C),multiply(inverse(A),multiply(inverse(D),inverse(B))))),multiply(inverse(C),inverse(D))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[153]),158,158,158,158]),
[iquote('back_demod(153),demod([158,158,158,158])')] ).
cnf(165,plain,
equal(multiply(A,multiply(inverse(B),multiply(inverse(A),inverse(C)))),multiply(inverse(B),inverse(C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[150]),158,158,158]),
[iquote('back_demod(150),demod([158,158,158])')] ).
cnf(204,plain,
equal(multiply(inverse(inverse(A)),inverse(inverse(B))),multiply(B,inverse(inverse(A)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[91]),158,158]),
[iquote('back_demod(91),demod([158,158])')] ).
cnf(205,plain,
equal(multiply(A,inverse(inverse(B))),multiply(inverse(inverse(B)),inverse(inverse(A)))),
inference(flip,[status(thm),theory(equality)],[204]),
[iquote('flip(204)')] ).
cnf(210,plain,
equal(multiply(multiply(multiply(A,B),multiply(inverse(A),inverse(C))),C),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[25]),158]),
[iquote('back_demod(25),demod([158])')] ).
cnf(216,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[94,27]),1]),
[iquote('para(94,27),flip(1)')] ).
cnf(218,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[205]),216,216,216]),
[iquote('back_demod(205),demod([216,216,216])')] ).
cnf(245,plain,
equal(multiply(multiply(A,inverse(B)),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[114]),216]),
[iquote('back_demod(114),demod([216])')] ).
cnf(246,plain,
equal(multiply(multiply(A,B),inverse(B)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[94]),216]),
[iquote('back_demod(94),demod([216])')] ).
cnf(251,plain,
~ equal(multiply(multiply(b2,inverse(b2)),a2),a2),
inference(para,[status(thm),theory(equality)],[218,2]),
[iquote('para(218,2)')] ).
cnf(283,plain,
equal(multiply(multiply(A,B),multiply(inverse(A),inverse(B))),multiply(inverse(C),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[165,162]),216]),
[iquote('para(165,162),demod([216])')] ).
cnf(284,plain,
equal(multiply(inverse(A),A),multiply(multiply(B,C),multiply(inverse(B),inverse(C)))),
inference(flip,[status(thm),theory(equality)],[283]),
[iquote('flip(283)')] ).
cnf(297,plain,
equal(multiply(A,inverse(A)),multiply(multiply(B,C),multiply(inverse(B),inverse(C)))),
inference(para,[status(thm),theory(equality)],[216,284]),
[iquote('para(216,284)')] ).
cnf(298,plain,
equal(multiply(multiply(A,B),multiply(inverse(A),inverse(B))),multiply(C,inverse(C))),
inference(flip,[status(thm),theory(equality)],[297]),
[iquote('flip(297)')] ).
cnf(590,plain,
equal(multiply(multiply(A,B),multiply(inverse(A),inverse(C))),multiply(B,inverse(C))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[210,246]),1]),
[iquote('para(210,246),flip(1)')] ).
cnf(591,plain,
equal(multiply(A,inverse(A)),multiply(B,inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[298]),590]),
[iquote('back_demod(298),demod([590])')] ).
cnf(596,plain,
equal(multiply(multiply(A,inverse(A)),B),B),
inference(para,[status(thm),theory(equality)],[591,245]),
[iquote('para(591,245)')] ).
cnf(597,plain,
$false,
inference(conflict,[status(thm)],[596,251]),
[iquote('conflict(596,251)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP510-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.14/0.32 % Computer : n008.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 600
% 0.14/0.32 % DateTime : Mon Jun 13 10:30:07 EDT 2022
% 0.14/0.32 % CPUTime :
% 0.71/1.13 ----- EQP 0.9e, May 2009 -----
% 0.71/1.13 The job began on n008.cluster.edu, Mon Jun 13 10:30:08 2022
% 0.71/1.13 The command was "./eqp09e".
% 0.71/1.13
% 0.71/1.13 set(prolog_style_variables).
% 0.71/1.13 set(lrpo).
% 0.71/1.13 set(basic_paramod).
% 0.71/1.13 set(functional_subsume).
% 0.71/1.13 set(ordered_paramod).
% 0.71/1.13 set(prime_paramod).
% 0.71/1.13 set(para_pairs).
% 0.71/1.13 assign(pick_given_ratio,4).
% 0.71/1.13 clear(print_kept).
% 0.71/1.13 clear(print_new_demod).
% 0.71/1.13 clear(print_back_demod).
% 0.71/1.13 clear(print_given).
% 0.71/1.13 assign(max_mem,64000).
% 0.71/1.13 end_of_commands.
% 0.71/1.13
% 0.71/1.13 Usable:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Sos:
% 0.71/1.13 0 (wt=-1) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.71/1.13 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Demodulators:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Passive:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Starting to process input.
% 0.71/1.13
% 0.71/1.13 ** KEPT: 1 (wt=12) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.71/1.13 1 is a new demodulator.
% 0.71/1.13
% 0.71/1.13 ** KEPT: 2 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.71/1.13 ---------------- PROOF FOUND ----------------
% 0.71/1.13 % SZS status Unsatisfiable
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 After processing input:
% 0.71/1.13
% 0.71/1.13 Usable:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Sos:
% 0.71/1.13 2 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.71/1.13 1 (wt=12) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Demodulators:
% 0.71/1.13 1 (wt=12) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Passive:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 UNIT CONFLICT from 596 and 251 at 0.04 seconds.
% 0.71/1.13
% 0.71/1.13 ---------------- PROOF ----------------
% 0.71/1.13 % SZS output start Refutation
% See solution above
% 0.71/1.13 ------------ end of proof -------------
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 ------------- memory usage ------------
% 0.71/1.13 Memory dynamically allocated (tp_alloc): 1464.
% 0.71/1.13 type (bytes each) gets frees in use avail bytes
% 0.71/1.13 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.71/1.13 term ( 16) 38701 25833 12868 23 249.4 K
% 0.71/1.13 gen_ptr ( 8) 69917 10122 59795 42 467.5 K
% 0.71/1.13 context ( 808) 28226 28224 2 9 8.7 K
% 0.71/1.13 trail ( 12) 10963 10963 0 11 0.1 K
% 0.71/1.13 bt_node ( 68) 9346 9342 4 32 2.4 K
% 0.71/1.13 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.13 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.13 ac_match_free_vars_pos (4020)
% 0.71/1.13 0 0 0 0 0.0 K
% 0.71/1.13 discrim ( 12) 11518 4332 7186 0 84.2 K
% 0.71/1.13 flat ( 40) 96023 96023 0 53 2.1 K
% 0.71/1.13 discrim_pos ( 12) 1616 1616 0 1 0.0 K
% 0.71/1.13 fpa_head ( 12) 2101 0 2101 0 24.6 K
% 0.71/1.13 fpa_tree ( 28) 3321 3321 0 25 0.7 K
% 0.71/1.13 fpa_pos ( 36) 1049 1049 0 1 0.0 K
% 0.71/1.13 literal ( 12) 1902 1306 596 1 7.0 K
% 0.71/1.13 clause ( 24) 1902 1306 596 1 14.0 K
% 0.71/1.13 list ( 12) 512 456 56 3 0.7 K
% 0.71/1.13 list_pos ( 20) 2647 961 1686 12 33.2 K
% 0.71/1.13 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.13
% 0.71/1.13 -------------- statistics -------------
% 0.71/1.13 Clauses input 2
% 0.71/1.13 Usable input 0
% 0.71/1.13 Sos input 2
% 0.71/1.13 Demodulators input 0
% 0.71/1.13 Passive input 0
% 0.71/1.13
% 0.71/1.13 Processed BS (before search) 2
% 0.71/1.13 Forward subsumed BS 0
% 0.71/1.13 Kept BS 2
% 0.71/1.13 New demodulators BS 1
% 0.71/1.13 Back demodulated BS 0
% 0.71/1.13
% 0.71/1.13 Clauses or pairs given 772
% 0.71/1.13 Clauses generated 1147
% 0.71/1.13 Forward subsumed 553
% 0.71/1.13 Deleted by weight 0
% 0.71/1.13 Deleted by variable count 0
% 0.71/1.13 Kept 594
% 0.71/1.13 New demodulators 452
% 0.71/1.13 Back demodulated 202
% 0.71/1.13 Ordered paramod prunes 0
% 0.71/1.13 Basic paramod prunes 2742
% 0.71/1.13 Prime paramod prunes 63
% 0.71/1.13 Semantic prunes 0
% 0.71/1.13
% 0.71/1.13 Rewrite attmepts 15443
% 0.71/1.13 Rewrites 1400
% 0.71/1.13
% 0.71/1.13 FPA overloads 0
% 0.71/1.13 FPA underloads 0
% 0.71/1.13
% 0.71/1.13 Usable size 0
% 0.71/1.13 Sos size 393
% 0.71/1.13 Demodulators size 305
% 0.71/1.13 Passive size 0
% 0.71/1.13 Disabled size 202
% 0.71/1.13
% 0.71/1.13 Proofs found 1
% 0.71/1.13
% 0.71/1.13 ----------- times (seconds) ----------- Mon Jun 13 10:30:08 2022
% 0.71/1.13
% 0.71/1.13 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.71/1.13 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.71/1.13 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.13 input time 0.00
% 0.71/1.13 paramodulation time 0.01
% 0.71/1.13 demodulation time 0.00
% 0.71/1.13 orient time 0.01
% 0.71/1.13 weigh time 0.00
% 0.71/1.13 forward subsume time 0.00
% 0.71/1.13 back demod find time 0.01
% 0.71/1.13 conflict time 0.00
% 0.71/1.13 LRPO time 0.00
% 0.71/1.13 store clause time 0.01
% 0.71/1.13 disable clause time 0.00
% 0.71/1.13 prime paramod time 0.00
% 0.71/1.13 semantics time 0.00
% 0.71/1.13
% 0.71/1.13 EQP interrupted
%------------------------------------------------------------------------------