TSTP Solution File: GRP442-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP442-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n021.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:23 EDT 2022
% Result : Unsatisfiable 1.13s 1.51s
% Output : Refutation 1.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 1
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 3 RR)
% Number of literals : 32 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 3 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 : 128 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(inverse(multiply(A,multiply(B,multiply(multiply(C,inverse(C)),inverse(multiply(D,multiply(A,B))))))),D),
file('GRP442-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(4,plain,
equal(inverse(multiply(A,multiply(multiply(multiply(B,inverse(B)),inverse(multiply(C,multiply(D,A)))),multiply(multiply(E,inverse(E)),C)))),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(9,plain,
equal(inverse(multiply(multiply(multiply(A,inverse(A)),inverse(multiply(B,multiply(C,D)))),multiply(multiply(multiply(E,inverse(E)),B),multiply(multiply(F,inverse(F)),C)))),D),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(14,plain,
equal(inverse(multiply(multiply(multiply(A,inverse(A)),B),multiply(multiply(multiply(C,inverse(C)),D),multiply(multiply(E,inverse(E)),F)))),multiply(multiply(G,inverse(G)),inverse(multiply(B,multiply(D,F))))),
inference(para,[status(thm),theory(equality)],[9,1]),
[iquote('para(9,1)')] ).
cnf(15,plain,
equal(multiply(multiply(A,inverse(A)),inverse(multiply(B,multiply(C,D)))),inverse(multiply(multiply(multiply(E,inverse(E)),B),multiply(multiply(multiply(F,inverse(F)),C),multiply(multiply(G,inverse(G)),D))))),
inference(flip,[status(thm),theory(equality)],[14]),
[iquote('flip(14)')] ).
cnf(49,plain,
equal(inverse(multiply(A,multiply(B,inverse(multiply(multiply(multiply(C,inverse(C)),D),multiply(multiply(multiply(E,inverse(E)),A),multiply(multiply(F,inverse(F)),B))))))),D),
inference(para,[status(thm),theory(equality)],[15,1]),
[iquote('para(15,1)')] ).
cnf(59,plain,
equal(inverse(multiply(inverse(multiply(A,multiply(B,multiply(multiply(C,inverse(C)),D)))),multiply(A,B))),D),
inference(para,[status(thm),theory(equality)],[4,49]),
[iquote('para(4,49)')] ).
cnf(61,plain,
equal(inverse(multiply(A,multiply(B,multiply(multiply(C,inverse(C)),D)))),inverse(multiply(A,multiply(B,multiply(multiply(E,inverse(E)),D))))),
inference(para,[status(thm),theory(equality)],[59,1]),
[iquote('para(59,1)')] ).
cnf(67,plain,
equal(inverse(multiply(A,multiply(multiply(multiply(B,inverse(B)),C),multiply(multiply(D,inverse(D)),inverse(multiply(E,multiply(A,multiply(multiply(F,inverse(F)),C)))))))),E),
inference(para,[status(thm),theory(equality)],[61,1]),
[iquote('para(61,1)')] ).
cnf(88,plain,
equal(inverse(multiply(multiply(multiply(A,inverse(A)),B),multiply(multiply(multiply(C,inverse(C)),inverse(multiply(D,multiply(E,multiply(multiply(F,inverse(F)),B))))),multiply(multiply(G,inverse(G)),D)))),E),
inference(para,[status(thm),theory(equality)],[67,1]),
[iquote('para(67,1)')] ).
cnf(133,plain,
equal(multiply(multiply(A,inverse(A)),B),multiply(multiply(C,inverse(C)),B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[88,1]),9]),
[iquote('para(88,1),demod([9])')] ).
cnf(146,plain,
equal(multiply(A,inverse(A)),multiply(B,inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[133,1]),1]),
[iquote('para(133,1),demod([1])')] ).
cnf(154,plain,
equal(inverse(multiply(A,multiply(inverse(A),multiply(multiply(B,inverse(B)),inverse(multiply(C,multiply(D,inverse(D)))))))),C),
inference(para,[status(thm),theory(equality)],[146,1]),
[iquote('para(146,1)')] ).
cnf(155,plain,
equal(multiply(multiply(A,multiply(B,multiply(multiply(C,inverse(C)),inverse(multiply(D,multiply(A,B)))))),D),multiply(E,inverse(E))),
inference(para,[status(thm),theory(equality)],[1,146]),
[iquote('para(1,146)')] ).
cnf(337,plain,
equal(multiply(multiply(A,inverse(A)),inverse(multiply(inverse(multiply(B,multiply(C,D))),multiply(B,C)))),D),
inference(para,[status(thm),theory(equality)],[14,9]),
[iquote('para(14,9)')] ).
cnf(344,plain,
equal(inverse(multiply(A,multiply(inverse(A),B))),inverse(multiply(C,multiply(inverse(C),B)))),
inference(para,[status(thm),theory(equality)],[337,154]),
[iquote('para(337,154)')] ).
cnf(349,plain,
equal(inverse(multiply(A,multiply(B,inverse(B)))),inverse(multiply(C,multiply(inverse(C),inverse(inverse(A)))))),
inference(para,[status(thm),theory(equality)],[146,344]),
[iquote('para(146,344)')] ).
cnf(656,plain,
equal(inverse(multiply(A,inverse(A))),inverse(multiply(B,multiply(inverse(B),inverse(multiply(C,inverse(C))))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[155,349]),1]),
[iquote('para(155,349),demod([1])')] ).
cnf(657,plain,
equal(inverse(multiply(A,multiply(inverse(A),inverse(multiply(B,inverse(B)))))),inverse(multiply(C,inverse(C)))),
inference(flip,[status(thm),theory(equality)],[656]),
[iquote('flip(656)')] ).
cnf(695,plain,
equal(inverse(multiply(inverse(A),multiply(inverse(multiply(B,inverse(B))),multiply(multiply(C,inverse(C)),inverse(multiply(D,inverse(D))))))),A),
inference(para,[status(thm),theory(equality)],[657,1]),
[iquote('para(657,1)')] ).
cnf(700,plain,
equal(inverse(multiply(inverse(A),multiply(inverse(multiply(B,inverse(B))),multiply(C,inverse(C))))),A),
inference(para,[status(thm),theory(equality)],[146,695]),
[iquote('para(146,695)')] ).
cnf(713,plain,
equal(inverse(multiply(A,multiply(B,multiply(multiply(multiply(inverse(C),multiply(inverse(multiply(D,inverse(D))),multiply(E,inverse(E)))),C),inverse(multiply(F,multiply(A,B))))))),F),
inference(para,[status(thm),theory(equality)],[700,1]),
[iquote('para(700,1)')] ).
cnf(942,plain,
equal(inverse(multiply(A,multiply(B,multiply(C,inverse(C))))),multiply(inverse(multiply(A,B)),multiply(inverse(multiply(D,inverse(D))),multiply(E,inverse(E))))),
inference(para,[status(thm),theory(equality)],[146,713]),
[iquote('para(146,713)')] ).
cnf(2801,plain,
equal(multiply(inverse(multiply(inverse(A),inverse(multiply(B,inverse(B))))),multiply(inverse(multiply(C,inverse(C))),multiply(D,inverse(D)))),A),
inference(para,[status(thm),theory(equality)],[942,700]),
[iquote('para(942,700)')] ).
cnf(2809,plain,
equal(multiply(inverse(A),inverse(multiply(B,inverse(B)))),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2801,700]),1]),
[iquote('para(2801,700),flip(1)')] ).
cnf(2816,plain,
equal(multiply(inverse(inverse(A)),multiply(inverse(multiply(B,inverse(B))),multiply(C,inverse(C)))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[2801]),2809]),
[iquote('back_demod(2801),demod([2809])')] ).
cnf(2830,plain,
equal(multiply(A,multiply(inverse(A),B)),multiply(C,multiply(inverse(C),B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[344,2816]),2816]),
[iquote('para(344,2816),demod([2816])')] ).
cnf(2867,plain,
equal(multiply(inverse(A),A),multiply(B,multiply(inverse(B),multiply(inverse(multiply(C,inverse(C))),multiply(D,inverse(D)))))),
inference(para,[status(thm),theory(equality)],[2816,2830]),
[iquote('para(2816,2830)')] ).
cnf(2868,plain,
equal(multiply(A,multiply(inverse(A),multiply(inverse(multiply(B,inverse(B))),multiply(C,inverse(C))))),multiply(inverse(D),D)),
inference(flip,[status(thm),theory(equality)],[2867]),
[iquote('flip(2867)')] ).
cnf(2869,plain,
~ equal(multiply(A,multiply(inverse(A),multiply(inverse(multiply(B,inverse(B))),multiply(C,inverse(C))))),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[2867,2]),
[iquote('para(2867,2)')] ).
cnf(2870,plain,
$false,
inference(conflict,[status(thm)],[2869,2868]),
[iquote('conflict(2869,2868)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP442-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 13:01:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.13/1.51 ----- EQP 0.9e, May 2009 -----
% 1.13/1.51 The job began on n021.cluster.edu, Mon Jun 13 13:01:57 2022
% 1.13/1.51 The command was "./eqp09e".
% 1.13/1.51
% 1.13/1.51 set(prolog_style_variables).
% 1.13/1.51 set(lrpo).
% 1.13/1.51 set(basic_paramod).
% 1.13/1.51 set(functional_subsume).
% 1.13/1.51 set(ordered_paramod).
% 1.13/1.51 set(prime_paramod).
% 1.13/1.51 set(para_pairs).
% 1.13/1.51 assign(pick_given_ratio,4).
% 1.13/1.51 clear(print_kept).
% 1.13/1.51 clear(print_new_demod).
% 1.13/1.51 clear(print_back_demod).
% 1.13/1.51 clear(print_given).
% 1.13/1.51 assign(max_mem,64000).
% 1.13/1.51 end_of_commands.
% 1.13/1.51
% 1.13/1.51 Usable:
% 1.13/1.51 end_of_list.
% 1.13/1.51
% 1.13/1.51 Sos:
% 1.13/1.51 0 (wt=-1) [] inverse(multiply(A,multiply(B,multiply(multiply(C,inverse(C)),inverse(multiply(D,multiply(A,B))))))) = D.
% 1.13/1.51 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 1.13/1.51 end_of_list.
% 1.13/1.51
% 1.13/1.51 Demodulators:
% 1.13/1.51 end_of_list.
% 1.13/1.51
% 1.13/1.51 Passive:
% 1.13/1.51 end_of_list.
% 1.13/1.51
% 1.13/1.51 Starting to process input.
% 1.13/1.51
% 1.13/1.51 ** KEPT: 1 (wt=18) [] inverse(multiply(A,multiply(B,multiply(multiply(C,inverse(C)),inverse(multiply(D,multiply(A,B))))))) = D.
% 1.13/1.51 1 is a new demodulator.
% 1.13/1.51
% 1.13/1.51 ** KEPT: 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 1.13/1.51 ---------------- PROOF FOUND ----------------
% 1.13/1.51 % SZS status Unsatisfiable
% 1.13/1.51
% 1.13/1.51
% 1.13/1.51 After processing input:
% 1.13/1.51
% 1.13/1.51 Usable:
% 1.13/1.51 end_of_list.
% 1.13/1.51
% 1.13/1.51 Sos:
% 1.13/1.51 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 1.13/1.51 1 (wt=18) [] inverse(multiply(A,multiply(B,multiply(multiply(C,inverse(C)),inverse(multiply(D,multiply(A,B))))))) = D.
% 1.13/1.51 end_of_list.
% 1.13/1.51
% 1.13/1.51 Demodulators:
% 1.13/1.51 1 (wt=18) [] inverse(multiply(A,multiply(B,multiply(multiply(C,inverse(C)),inverse(multiply(D,multiply(A,B))))))) = D.
% 1.13/1.51 end_of_list.
% 1.13/1.51
% 1.13/1.51 Passive:
% 1.13/1.51 end_of_list.
% 1.13/1.51
% 1.13/1.51 UNIT CONFLICT from 2869 and 2868 at 0.33 seconds.
% 1.13/1.51
% 1.13/1.51 ---------------- PROOF ----------------
% 1.13/1.51 % SZS output start Refutation
% See solution above
% 1.13/1.51 ------------ end of proof -------------
% 1.13/1.51
% 1.13/1.51
% 1.13/1.51 ------------- memory usage ------------
% 1.13/1.51 Memory dynamically allocated (tp_alloc): 11718.
% 1.13/1.51 type (bytes each) gets frees in use avail bytes
% 1.13/1.51 sym_ent ( 96) 56 0 56 0 5.2 K
% 1.13/1.51 term ( 16) 287159 150565 136594 34 2657.3 K
% 1.13/1.51 gen_ptr ( 8) 924525 13136 911389 31 7120.5 K
% 1.13/1.51 context ( 808) 212475 212473 2 2 3.2 K
% 1.13/1.51 trail ( 12) 39722 39722 0 27 0.3 K
% 1.13/1.51 bt_node ( 68) 51243 51239 4 69 4.8 K
% 1.13/1.51 ac_position (285432) 0 0 0 0 0.0 K
% 1.13/1.51 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.13/1.51 ac_match_free_vars_pos (4020)
% 1.13/1.51 0 0 0 0 0.0 K
% 1.13/1.51 discrim ( 12) 86355 2138 84217 840 996.8 K
% 1.13/1.51 flat ( 40) 1059151 1059151 0 119 4.6 K
% 1.13/1.51 discrim_pos ( 12) 2359 2359 0 1 0.0 K
% 1.13/1.51 fpa_head ( 12) 7390 0 7390 0 86.6 K
% 1.13/1.51 fpa_tree ( 28) 10281 10281 0 25 0.7 K
% 1.13/1.51 fpa_pos ( 36) 3923 3923 0 1 0.0 K
% 1.13/1.51 literal ( 12) 10634 7765 2869 1 33.6 K
% 1.13/1.51 clause ( 24) 10634 7765 2869 1 67.3 K
% 1.13/1.51 list ( 12) 1113 1057 56 3 0.7 K
% 1.13/1.51 list_pos ( 20) 9954 626 9328 215 186.4 K
% 1.13/1.51 pair_index ( 40) 2 0 2 0 0.1 K
% 1.13/1.51
% 1.13/1.51 -------------- statistics -------------
% 1.13/1.51 Clauses input 2
% 1.13/1.51 Usable input 0
% 1.13/1.51 Sos input 2
% 1.13/1.51 Demodulators input 0
% 1.13/1.51 Passive input 0
% 1.13/1.51
% 1.13/1.51 Processed BS (before search) 2
% 1.13/1.51 Forward subsumed BS 0
% 1.13/1.51 Kept BS 2
% 1.13/1.51 New demodulators BS 1
% 1.13/1.51 Back demodulated BS 0
% 1.13/1.51
% 1.13/1.51 Clauses or pairs given 4694
% 1.13/1.51 Clauses generated 5088
% 1.13/1.51 Forward subsumed 2221
% 1.13/1.51 Deleted by weight 0
% 1.13/1.51 Deleted by variable count 0
% 1.13/1.51 Kept 2867
% 1.13/1.51 New demodulators 1053
% 1.13/1.51 Back demodulated 147
% 1.13/1.51 Ordered paramod prunes 0
% 1.13/1.51 Basic paramod prunes 58671
% 1.13/1.51 Prime paramod prunes 6
% 1.13/1.51 Semantic prunes 0
% 1.13/1.51
% 1.13/1.51 Rewrite attmepts 125229
% 1.13/1.51 Rewrites 589
% 1.13/1.51
% 1.13/1.51 FPA overloads 0
% 1.13/1.51 FPA underloads 0
% 1.13/1.51
% 1.13/1.51 Usable size 0
% 1.13/1.51 Sos size 2721
% 1.13/1.51 Demodulators size 1018
% 1.13/1.51 Passive size 0
% 1.13/1.51 Disabled size 147
% 1.13/1.51
% 1.13/1.51 Proofs found 1
% 1.13/1.51
% 1.13/1.51 ----------- times (seconds) ----------- Mon Jun 13 13:01:58 2022
% 1.13/1.51
% 1.13/1.51 user CPU time 0.33 (0 hr, 0 min, 0 sec)
% 1.13/1.51 system CPU time 0.10 (0 hr, 0 min, 0 sec)
% 1.13/1.51 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.13/1.51 input time 0.00
% 1.13/1.51 paramodulation time 0.03
% 1.13/1.51 demodulation time 0.05
% 1.13/1.51 orient time 0.02
% 1.13/1.51 weigh time 0.00
% 1.13/1.51 forward subsume time 0.01
% 1.13/1.51 back demod find time 0.02
% 1.13/1.51 conflict time 0.01
% 1.13/1.51 LRPO time 0.01
% 1.13/1.51 store clause time 0.14
% 1.13/1.51 disable clause time 0.00
% 1.13/1.51 prime paramod time 0.01
% 1.13/1.51 semantics time 0.00
% 1.13/1.51
% 1.13/1.51 EQP interrupted
%------------------------------------------------------------------------------