TSTP Solution File: GRP509-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP509-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n009.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:44 EDT 2022
% Result : Unsatisfiable 0.46s 0.88s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 1
% Syntax : Number of clauses : 45 ( 45 unt; 0 nHn; 3 RR)
% Number of literals : 45 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 93 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))),B),
file('GRP509-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
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(16,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(17,plain,
equal(inverse(multiply(A,inverse(multiply(A,B)))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),16]),
[iquote('back_demod(4),demod([16])')] ).
cnf(25,plain,
equal(inverse(multiply(A,inverse(multiply(multiply(A,B),C)))),multiply(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,16]),1]),
[iquote('para(17,16),flip(1)')] ).
cnf(29,plain,
equal(inverse(multiply(multiply(A,B),C)),inverse(multiply(A,multiply(B,C)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[25,17]),1]),
[iquote('para(25,17),flip(1)')] ).
cnf(36,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)],[16]),29]),
[iquote('back_demod(16),demod([29])')] ).
cnf(47,plain,
equal(inverse(inverse(multiply(A,B))),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[36,17]),
[iquote('para(36,17)')] ).
cnf(53,plain,
equal(multiply(multiply(A,inverse(B)),inverse(A)),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,5]),1]),
[iquote('para(5,5),demod([1])')] ).
cnf(55,plain,
equal(inverse(multiply(A,multiply(inverse(B),inverse(inverse(B))))),inverse(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[53,17]),29]),
[iquote('para(53,17),demod([29])')] ).
cnf(57,plain,
equal(multiply(inverse(A),inverse(multiply(B,inverse(A)))),inverse(B)),
inference(para,[status(thm),theory(equality)],[53,53]),
[iquote('para(53,53)')] ).
cnf(59,plain,
equal(multiply(inverse(multiply(A,B)),B),inverse(A)),
inference(para,[status(thm),theory(equality)],[17,57]),
[iquote('para(17,57)')] ).
cnf(60,plain,
equal(inverse(multiply(inverse(A),inverse(inverse(B)))),inverse(multiply(B,inverse(A)))),
inference(para,[status(thm),theory(equality)],[57,17]),
[iquote('para(57,17)')] ).
cnf(61,plain,
equal(inverse(multiply(A,inverse(B))),inverse(multiply(inverse(B),inverse(inverse(A))))),
inference(flip,[status(thm),theory(equality)],[60]),
[iquote('flip(60)')] ).
cnf(62,plain,
equal(inverse(inverse(inverse(A))),inverse(A)),
inference(para,[status(thm),theory(equality)],[57,17]),
[iquote('para(57,17)')] ).
cnf(67,plain,
equal(inverse(multiply(inverse(multiply(A,B)),inverse(inverse(A)))),B),
inference(para,[status(thm),theory(equality)],[59,17]),
[iquote('para(59,17)')] ).
cnf(68,plain,
equal(inverse(multiply(inverse(multiply(inverse(A),B)),inverse(A))),B),
inference(para,[status(thm),theory(equality)],[62,67]),
[iquote('para(62,67)')] ).
cnf(69,plain,
equal(multiply(inverse(A),multiply(A,inverse(B))),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[59,53]),47]),
[iquote('para(59,53),demod([47])')] ).
cnf(72,plain,
equal(inverse(multiply(inverse(A),inverse(inverse(B)))),multiply(A,inverse(B))),
inference(para,[status(thm),theory(equality)],[69,17]),
[iquote('para(69,17)')] ).
cnf(73,plain,
equal(multiply(multiply(A,B),inverse(A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[67]),72]),
[iquote('back_demod(67),demod([72])')] ).
cnf(74,plain,
equal(inverse(multiply(A,inverse(B))),multiply(B,inverse(A))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[61]),72]),
[iquote('back_demod(61),demod([72])')] ).
cnf(79,plain,
equal(multiply(A,multiply(inverse(A),B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[68]),74,47]),
[iquote('back_demod(68),demod([74,47])')] ).
cnf(85,plain,
equal(multiply(inverse(A),multiply(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,69]),74,73]),
[iquote('para(17,69),demod([74,73])')] ).
cnf(89,plain,
equal(multiply(A,inverse(multiply(B,A))),inverse(B)),
inference(para,[status(thm),theory(equality)],[73,73]),
[iquote('para(73,73)')] ).
cnf(90,plain,
equal(multiply(A,inverse(B)),multiply(inverse(B),A)),
inference(para,[status(thm),theory(equality)],[79,73]),
[iquote('para(79,73)')] ).
cnf(91,plain,
equal(multiply(inverse(A),B),multiply(B,inverse(A))),
inference(flip,[status(thm),theory(equality)],[90]),
[iquote('flip(90)')] ).
cnf(93,plain,
equal(multiply(inverse(inverse(A)),B),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[79,79]),1]),
[iquote('para(79,79),flip(1)')] ).
cnf(94,plain,
equal(multiply(A,inverse(inverse(B))),multiply(B,A)),
inference(para,[status(thm),theory(equality)],[85,73]),
[iquote('para(85,73)')] ).
cnf(95,plain,
equal(multiply(A,B),multiply(B,inverse(inverse(A)))),
inference(flip,[status(thm),theory(equality)],[94]),
[iquote('flip(94)')] ).
cnf(100,plain,
equal(inverse(multiply(A,B)),multiply(inverse(A),inverse(B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[89,73]),1]),
[iquote('para(89,73),flip(1)')] ).
cnf(118,plain,
equal(multiply(inverse(A),multiply(B,inverse(B))),inverse(A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[55]),100,100,62,93]),
[iquote('back_demod(55),demod([100,100,62,93])')] ).
cnf(125,plain,
equal(multiply(A,inverse(inverse(B))),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[47]),100,100,93]),
[iquote('back_demod(47),demod([100,100,93])')] ).
cnf(133,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[95]),125]),
[iquote('back_demod(95),demod([125])')] ).
cnf(151,plain,
equal(multiply(A,multiply(B,inverse(A))),B),
inference(para,[status(thm),theory(equality)],[133,79]),
[iquote('para(133,79)')] ).
cnf(154,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[151,85]),1]),
[iquote('para(151,85),flip(1)')] ).
cnf(156,plain,
~ equal(multiply(b1,inverse(b1)),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[91,2]),
[iquote('para(91,2)')] ).
cnf(157,plain,
equal(multiply(A,multiply(B,inverse(B))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[154,118]),154]),
[iquote('para(154,118),demod([154])')] ).
cnf(162,plain,
equal(multiply(A,inverse(A)),multiply(B,inverse(B))),
inference(para,[status(thm),theory(equality)],[157,73]),
[iquote('para(157,73)')] ).
cnf(163,plain,
equal(multiply(inverse(A),A),multiply(B,inverse(B))),
inference(para,[status(thm),theory(equality)],[154,162]),
[iquote('para(154,162)')] ).
cnf(164,plain,
equal(multiply(A,inverse(A)),multiply(inverse(B),B)),
inference(flip,[status(thm),theory(equality)],[163]),
[iquote('flip(163)')] ).
cnf(165,plain,
$false,
inference(conflict,[status(thm)],[164,156]),
[iquote('conflict(164,156)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : GRP509-1 : TPTP v8.1.0. Released v2.6.0.
% 0.02/0.07 % Command : tptp2X_and_run_eqp %s
% 0.07/0.26 % Computer : n009.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Tue Jun 14 08:03:22 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.46/0.88 ----- EQP 0.9e, May 2009 -----
% 0.46/0.88 The job began on n009.cluster.edu, Tue Jun 14 08:03:23 2022
% 0.46/0.88 The command was "./eqp09e".
% 0.46/0.88
% 0.46/0.88 set(prolog_style_variables).
% 0.46/0.88 set(lrpo).
% 0.46/0.88 set(basic_paramod).
% 0.46/0.88 set(functional_subsume).
% 0.46/0.88 set(ordered_paramod).
% 0.46/0.88 set(prime_paramod).
% 0.46/0.88 set(para_pairs).
% 0.46/0.88 assign(pick_given_ratio,4).
% 0.46/0.88 clear(print_kept).
% 0.46/0.88 clear(print_new_demod).
% 0.46/0.88 clear(print_back_demod).
% 0.46/0.88 clear(print_given).
% 0.46/0.88 assign(max_mem,64000).
% 0.46/0.88 end_of_commands.
% 0.46/0.88
% 0.46/0.88 Usable:
% 0.46/0.88 end_of_list.
% 0.46/0.88
% 0.46/0.88 Sos:
% 0.46/0.88 0 (wt=-1) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.46/0.88 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.46/0.88 end_of_list.
% 0.46/0.88
% 0.46/0.88 Demodulators:
% 0.46/0.88 end_of_list.
% 0.46/0.88
% 0.46/0.88 Passive:
% 0.46/0.88 end_of_list.
% 0.46/0.88
% 0.46/0.88 Starting to process input.
% 0.46/0.88
% 0.46/0.88 ** KEPT: 1 (wt=12) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.46/0.88 1 is a new demodulator.
% 0.46/0.88
% 0.46/0.88 ** KEPT: 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.46/0.88 ---------------- PROOF FOUND ----------------
% 0.46/0.88 % SZS status Unsatisfiable
% 0.46/0.88
% 0.46/0.88
% 0.46/0.88 After processing input:
% 0.46/0.88
% 0.46/0.88 Usable:
% 0.46/0.88 end_of_list.
% 0.46/0.88
% 0.46/0.88 Sos:
% 0.46/0.88 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.46/0.88 1 (wt=12) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.46/0.88 end_of_list.
% 0.46/0.88
% 0.46/0.88 Demodulators:
% 0.46/0.88 1 (wt=12) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.46/0.88 end_of_list.
% 0.46/0.88
% 0.46/0.88 Passive:
% 0.46/0.88 end_of_list.
% 0.46/0.88
% 0.46/0.88 UNIT CONFLICT from 164 and 156 at 0.01 seconds.
% 0.46/0.88
% 0.46/0.88 ---------------- PROOF ----------------
% 0.46/0.88 % SZS output start Refutation
% See solution above
% 0.46/0.88 ------------ end of proof -------------
% 0.46/0.88
% 0.46/0.88
% 0.46/0.88 ------------- memory usage ------------
% 0.46/0.88 Memory dynamically allocated (tp_alloc): 488.
% 0.46/0.88 type (bytes each) gets frees in use avail bytes
% 0.46/0.88 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.46/0.88 term ( 16) 9414 6791 2623 21 51.0 K
% 0.46/0.88 gen_ptr ( 8) 15266 3916 11350 44 89.0 K
% 0.46/0.88 context ( 808) 5616 5614 2 9 8.7 K
% 0.46/0.88 trail ( 12) 1528 1528 0 6 0.1 K
% 0.46/0.88 bt_node ( 68) 1402 1400 2 13 1.0 K
% 0.46/0.88 ac_position (285432) 0 0 0 0 0.0 K
% 0.46/0.88 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.46/0.88 ac_match_free_vars_pos (4020)
% 0.46/0.88 0 0 0 0 0.0 K
% 0.46/0.88 discrim ( 12) 2566 1705 861 84 11.1 K
% 0.46/0.88 flat ( 40) 18318 18318 0 28 1.1 K
% 0.46/0.88 discrim_pos ( 12) 473 473 0 1 0.0 K
% 0.46/0.88 fpa_head ( 12) 1022 0 1022 0 12.0 K
% 0.46/0.88 fpa_tree ( 28) 552 552 0 15 0.4 K
% 0.46/0.88 fpa_pos ( 36) 280 280 0 1 0.0 K
% 0.46/0.88 literal ( 12) 570 406 164 1 1.9 K
% 0.46/0.88 clause ( 24) 570 406 164 1 3.9 K
% 0.46/0.88 list ( 12) 175 119 56 3 0.7 K
% 0.46/0.88 list_pos ( 20) 828 522 306 0 6.0 K
% 0.46/0.88 pair_index ( 40) 2 0 2 0 0.1 K
% 0.46/0.88
% 0.46/0.88 -------------- statistics -------------
% 0.46/0.88 Clauses input 2
% 0.46/0.88 Usable input 0
% 0.46/0.88 Sos input 2
% 0.46/0.88 Demodulators input 0
% 0.46/0.88 Passive input 0
% 0.46/0.88
% 0.46/0.88 Processed BS (before search) 2
% 0.46/0.88 Forward subsumed BS 0
% 0.46/0.88 Kept BS 2
% 0.46/0.88 New demodulators BS 1
% 0.46/0.88 Back demodulated BS 0
% 0.46/0.88
% 0.46/0.88 Clauses or pairs given 164
% 0.46/0.88 Clauses generated 334
% 0.46/0.88 Forward subsumed 172
% 0.46/0.88 Deleted by weight 0
% 0.46/0.88 Deleted by variable count 0
% 0.46/0.88 Kept 162
% 0.46/0.88 New demodulators 115
% 0.46/0.88 Back demodulated 110
% 0.46/0.88 Ordered paramod prunes 0
% 0.46/0.88 Basic paramod prunes 330
% 0.46/0.88 Prime paramod prunes 17
% 0.46/0.88 Semantic prunes 0
% 0.46/0.88
% 0.46/0.88 Rewrite attmepts 3364
% 0.46/0.88 Rewrites 402
% 0.46/0.88
% 0.46/0.88 FPA overloads 0
% 0.46/0.88 FPA underloads 0
% 0.46/0.88
% 0.46/0.88 Usable size 0
% 0.46/0.88 Sos size 53
% 0.46/0.88 Demodulators size 37
% 0.46/0.88 Passive size 0
% 0.46/0.88 Disabled size 110
% 0.46/0.88
% 0.46/0.88 Proofs found 1
% 0.46/0.88
% 0.46/0.88 ----------- times (seconds) ----------- Tue Jun 14 08:03:23 2022
% 0.46/0.88
% 0.46/0.88 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.46/0.88 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.46/0.88 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.46/0.88 input time 0.00
% 0.46/0.88 paramodulation time 0.00
% 0.46/0.88 demodulation time 0.00
% 0.46/0.88 orient time 0.00
% 0.46/0.88 weigh time 0.00
% 0.46/0.88 forward subsume time 0.00
% 0.46/0.88 back demod find time 0.00
% 0.46/0.88 conflict time 0.00
% 0.46/0.88 LRPO time 0.00
% 0.46/0.88 store clause time 0.00
% 0.46/0.88 disable clause time 0.00
% 0.46/0.88 prime paramod time 0.00
% 0.46/0.88 semantics time 0.00
% 0.46/0.88
% 0.46/0.88 EQP interrupted
%------------------------------------------------------------------------------