TSTP Solution File: GRP403-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP403-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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:46:31 EDT 2022
% Result : Unsatisfiable 0.75s 1.46s
% Output : Refutation 0.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 1
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 3 RR)
% Number of literals : 33 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 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 : 129 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),inverse(multiply(B,multiply(inverse(B),B)))))),C),
file('GRP403-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(inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),D)),inverse(multiply(C,multiply(inverse(C),C))))),multiply(A,inverse(multiply(inverse(D),inverse(multiply(B,multiply(inverse(B),B))))))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,1]),1]),
[iquote('para(1,1),flip(1)')] ).
cnf(12,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,inverse(multiply(inverse(C),inverse(multiply(B,multiply(inverse(B),B))))))),C),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(17,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,multiply(C,inverse(multiply(inverse(D),inverse(multiply(E,multiply(inverse(E),E)))))))),multiply(inverse(multiply(inverse(multiply(C,E)),B)),D)),
inference(para,[status(thm),theory(equality)],[4,12]),
[iquote('para(4,12)')] ).
cnf(21,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,C)),multiply(inverse(multiply(inverse(multiply(D,E)),B)),multiply(inverse(multiply(D,E)),C))),
inference(para,[status(thm),theory(equality)],[1,17]),
[iquote('para(1,17)')] ).
cnf(22,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,B)),C)),multiply(inverse(multiply(A,B)),D)),multiply(inverse(multiply(E,C)),multiply(E,D))),
inference(flip,[status(thm),theory(equality)],[21]),
[iquote('flip(21)')] ).
cnf(33,plain,
equal(multiply(inverse(multiply(A,B)),inverse(multiply(inverse(multiply(inverse(multiply(C,D)),multiply(C,E))),inverse(multiply(D,multiply(inverse(D),D)))))),multiply(inverse(multiply(A,B)),E)),
inference(para,[status(thm),theory(equality)],[22,1]),
[iquote('para(22,1)')] ).
cnf(57,plain,
equal(inverse(multiply(inverse(multiply(inverse(multiply(A,B)),multiply(A,C))),inverse(multiply(B,multiply(inverse(B),B))))),C),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[33,1]),1]),1]),
[iquote('para(33,1),demod([1]),flip(1)')] ).
cnf(62,plain,
equal(multiply(inverse(multiply(A,B)),inverse(multiply(C,inverse(multiply(multiply(A,C),multiply(inverse(multiply(A,C)),multiply(A,C))))))),inverse(multiply(B,multiply(inverse(B),B)))),
inference(para,[status(thm),theory(equality)],[57,1]),
[iquote('para(57,1)')] ).
cnf(69,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,C)),multiply(inverse(multiply(D,B)),multiply(D,C))),
inference(para,[status(thm),theory(equality)],[57,12]),
[iquote('para(57,12)')] ).
cnf(102,plain,
equal(multiply(inverse(multiply(A,B)),inverse(multiply(C,inverse(multiply(multiply(A,C),multiply(inverse(multiply(D,C)),multiply(D,C))))))),inverse(multiply(B,multiply(inverse(B),B)))),
inference(para,[status(thm),theory(equality)],[69,62]),
[iquote('para(69,62)')] ).
cnf(103,plain,
equal(inverse(multiply(A,multiply(inverse(A),A))),multiply(inverse(multiply(B,A)),inverse(multiply(C,inverse(multiply(multiply(B,C),multiply(inverse(multiply(D,C)),multiply(D,C)))))))),
inference(flip,[status(thm),theory(equality)],[102]),
[iquote('flip(102)')] ).
cnf(158,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,B)),multiply(A,inverse(C)))),inverse(multiply(B,multiply(inverse(B),B)))),C),
inference(para,[status(thm),theory(equality)],[62,12]),
[iquote('para(62,12)')] ).
cnf(204,plain,
equal(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),multiply(inverse(multiply(D,B)),inverse(multiply(E,inverse(multiply(multiply(D,E),multiply(inverse(multiply(F,E)),multiply(F,E)))))))))),C),
inference(para,[status(thm),theory(equality)],[103,1]),
[iquote('para(103,1)')] ).
cnf(297,plain,
equal(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,C)),multiply(B,D))),multiply(inverse(multiply(E,C)),inverse(multiply(F,inverse(multiply(multiply(E,F),multiply(inverse(multiply(G,F)),multiply(G,F)))))))))),multiply(A,D)),
inference(para,[status(thm),theory(equality)],[69,204]),
[iquote('para(69,204)')] ).
cnf(642,plain,
equal(multiply(A,inverse(multiply(inverse(multiply(B,multiply(C,D))),multiply(B,inverse(multiply(E,inverse(multiply(multiply(C,E),multiply(inverse(multiply(F,E)),multiply(F,E)))))))))),multiply(A,D)),
inference(para,[status(thm),theory(equality)],[69,297]),
[iquote('para(69,297)')] ).
cnf(644,plain,
equal(inverse(multiply(inverse(multiply(A,multiply(B,C))),multiply(A,inverse(multiply(D,inverse(multiply(multiply(B,D),multiply(inverse(multiply(E,D)),multiply(E,D))))))))),C),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[642,1]),1]),1]),
[iquote('para(642,1),demod([1]),flip(1)')] ).
cnf(647,plain,
equal(multiply(A,inverse(multiply(B,inverse(multiply(multiply(C,B),multiply(inverse(multiply(C,B)),multiply(C,B))))))),multiply(A,inverse(multiply(D,inverse(multiply(multiply(C,D),multiply(inverse(multiply(E,D)),multiply(E,D)))))))),
inference(para,[status(thm),theory(equality)],[644,1]),
[iquote('para(644,1)')] ).
cnf(934,plain,
equal(inverse(multiply(A,inverse(multiply(multiply(B,A),multiply(inverse(multiply(C,A)),multiply(C,A)))))),inverse(multiply(D,inverse(multiply(multiply(B,D),multiply(inverse(multiply(B,D)),multiply(B,D))))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[647,1]),1]),
[iquote('para(647,1),demod([1])')] ).
cnf(959,plain,
equal(multiply(A,inverse(multiply(multiply(B,A),multiply(inverse(multiply(B,A)),multiply(B,A))))),multiply(C,inverse(multiply(multiply(B,C),multiply(inverse(multiply(D,C)),multiply(D,C)))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[934,12]),12]),
[iquote('para(934,12),demod([12])')] ).
cnf(992,plain,
equal(multiply(inverse(multiply(A,multiply(B,inverse(C)))),multiply(A,inverse(multiply(D,inverse(multiply(multiply(B,D),multiply(inverse(multiply(E,D)),multiply(E,D)))))))),C),
inference(para,[status(thm),theory(equality)],[959,12]),
[iquote('para(959,12)')] ).
cnf(1199,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,multiply(B,inverse(C)))),D)),C),multiply(inverse(multiply(inverse(multiply(A,multiply(B,inverse(E)))),D)),E)),
inference(para,[status(thm),theory(equality)],[992,17]),
[iquote('para(992,17)')] ).
cnf(1205,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(C,multiply(D,inverse(E)))),F)),E)))),multiply(inverse(multiply(C,multiply(D,inverse(inverse(multiply(B,multiply(inverse(B),B))))))),F)),
inference(para,[status(thm),theory(equality)],[1199,12]),
[iquote('para(1199,12)')] ).
cnf(1206,plain,
equal(multiply(inverse(multiply(A,multiply(B,inverse(inverse(multiply(C,multiply(inverse(C),C))))))),D),multiply(inverse(multiply(E,C)),multiply(E,inverse(multiply(inverse(multiply(inverse(multiply(A,multiply(B,inverse(F)))),D)),F))))),
inference(flip,[status(thm),theory(equality)],[1205]),
[iquote('flip(1205)')] ).
cnf(1307,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,inverse(multiply(inverse(C),C)))),inverse(multiply(B,multiply(inverse(B),B)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1206,158]),158]),
[iquote('para(1206,158),demod([158])')] ).
cnf(1318,plain,
equal(multiply(A,inverse(multiply(inverse(inverse(multiply(B,multiply(inverse(B),B)))),inverse(multiply(B,multiply(inverse(B),B)))))),multiply(A,inverse(multiply(inverse(C),C)))),
inference(para,[status(thm),theory(equality)],[1307,1]),
[iquote('para(1307,1)')] ).
cnf(1416,plain,
equal(inverse(multiply(inverse(A),A)),inverse(multiply(inverse(inverse(multiply(B,multiply(inverse(B),B)))),inverse(multiply(B,multiply(inverse(B),B)))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1318,1]),1]),
[iquote('para(1318,1),demod([1])')] ).
cnf(1422,plain,
equal(multiply(A,inverse(multiply(inverse(multiply(inverse(inverse(multiply(B,multiply(inverse(B),B)))),inverse(multiply(B,multiply(inverse(B),B))))),inverse(multiply(C,multiply(inverse(C),C)))))),multiply(A,C)),
inference(para,[status(thm),theory(equality)],[1416,1]),
[iquote('para(1416,1)')] ).
cnf(1424,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,B)),multiply(inverse(C),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1416,12]),1422]),
[iquote('para(1416,12),demod([1422])')] ).
cnf(1425,plain,
equal(multiply(inverse(A),A),multiply(inverse(multiply(B,C)),multiply(B,C))),
inference(flip,[status(thm),theory(equality)],[1424]),
[iquote('flip(1424)')] ).
cnf(1427,plain,
~ equal(multiply(inverse(multiply(A,B)),multiply(A,B)),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[1425,2]),
[iquote('para(1425,2)')] ).
cnf(1428,plain,
$false,
inference(conflict,[status(thm)],[1427,1424]),
[iquote('conflict(1427,1424)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.13 % Problem : GRP403-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n019.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 11:08:24 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/1.46 ----- EQP 0.9e, May 2009 -----
% 0.75/1.46 The job began on n019.cluster.edu, Tue Jun 14 11:08:25 2022
% 0.75/1.46 The command was "./eqp09e".
% 0.75/1.46
% 0.75/1.46 set(prolog_style_variables).
% 0.75/1.46 set(lrpo).
% 0.75/1.46 set(basic_paramod).
% 0.75/1.46 set(functional_subsume).
% 0.75/1.46 set(ordered_paramod).
% 0.75/1.46 set(prime_paramod).
% 0.75/1.46 set(para_pairs).
% 0.75/1.46 assign(pick_given_ratio,4).
% 0.75/1.46 clear(print_kept).
% 0.75/1.46 clear(print_new_demod).
% 0.75/1.46 clear(print_back_demod).
% 0.75/1.46 clear(print_given).
% 0.75/1.46 assign(max_mem,64000).
% 0.75/1.46 end_of_commands.
% 0.75/1.46
% 0.75/1.46 Usable:
% 0.75/1.46 end_of_list.
% 0.75/1.46
% 0.75/1.46 Sos:
% 0.75/1.46 0 (wt=-1) [] multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),inverse(multiply(B,multiply(inverse(B),B)))))) = C.
% 0.75/1.46 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.75/1.46 end_of_list.
% 0.75/1.46
% 0.75/1.46 Demodulators:
% 0.75/1.46 end_of_list.
% 0.75/1.46
% 0.75/1.46 Passive:
% 0.75/1.46 end_of_list.
% 0.75/1.46
% 0.75/1.46 Starting to process input.
% 0.75/1.46
% 0.75/1.46 ** KEPT: 1 (wt=20) [] multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),inverse(multiply(B,multiply(inverse(B),B)))))) = C.
% 0.75/1.46 1 is a new demodulator.
% 0.75/1.46
% 0.75/1.46 ** KEPT: 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.75/1.46 ---------------- PROOF FOUND ----------------
% 0.75/1.46 % SZS status Unsatisfiable
% 0.75/1.46
% 0.75/1.46
% 0.75/1.46 After processing input:
% 0.75/1.46
% 0.75/1.46 Usable:
% 0.75/1.46 end_of_list.
% 0.75/1.46
% 0.75/1.46 Sos:
% 0.75/1.46 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.75/1.46 1 (wt=20) [] multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),inverse(multiply(B,multiply(inverse(B),B)))))) = C.
% 0.75/1.46 end_of_list.
% 0.75/1.46
% 0.75/1.46 Demodulators:
% 0.75/1.46 1 (wt=20) [] multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),inverse(multiply(B,multiply(inverse(B),B)))))) = C.
% 0.75/1.46 end_of_list.
% 0.75/1.46
% 0.75/1.46 Passive:
% 0.75/1.46 end_of_list.
% 0.75/1.46
% 0.75/1.46 UNIT CONFLICT from 1427 and 1424 at 0.32 seconds.
% 0.75/1.46
% 0.75/1.46 ---------------- PROOF ----------------
% 0.75/1.46 % SZS output start Refutation
% See solution above
% 0.75/1.46 ------------ end of proof -------------
% 0.75/1.46
% 0.75/1.46
% 0.75/1.46 ------------- memory usage ------------
% 0.75/1.46 Memory dynamically allocated (tp_alloc): 13671.
% 0.75/1.46 type (bytes each) gets frees in use avail bytes
% 0.75/1.46 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.75/1.46 term ( 16) 333757 188383 145374 193 2837.6 K
% 0.75/1.46 gen_ptr ( 8) 1138882 30988 1107894 32 8655.7 K
% 0.75/1.46 context ( 808) 226812 226810 2 3 3.9 K
% 0.75/1.46 trail ( 12) 11242 11242 0 11 0.1 K
% 0.75/1.46 bt_node ( 68) 42763 42759 4 573 38.3 K
% 0.75/1.46 ac_position (285432) 0 0 0 0 0.0 K
% 0.75/1.46 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.75/1.46 ac_match_free_vars_pos (4020)
% 0.75/1.46 0 0 0 0 0.0 K
% 0.75/1.46 discrim ( 12) 141046 19224 121822 0 1427.6 K
% 0.75/1.46 flat ( 40) 1495131 1495131 0 1177 46.0 K
% 0.75/1.46 discrim_pos ( 12) 1889 1889 0 1 0.0 K
% 0.75/1.46 fpa_head ( 12) 5248 0 5248 0 61.5 K
% 0.75/1.46 fpa_tree ( 28) 4893 4893 0 21 0.6 K
% 0.75/1.46 fpa_pos ( 36) 1885 1885 0 1 0.0 K
% 0.75/1.46 literal ( 12) 5419 3992 1427 1 16.7 K
% 0.75/1.46 clause ( 24) 5419 3992 1427 1 33.5 K
% 0.75/1.46 list ( 12) 517 461 56 3 0.7 K
% 0.75/1.46 list_pos ( 20) 4992 623 4369 0 85.3 K
% 0.75/1.46 pair_index ( 40) 2 0 2 0 0.1 K
% 0.75/1.46
% 0.75/1.46 -------------- statistics -------------
% 0.75/1.46 Clauses input 2
% 0.75/1.46 Usable input 0
% 0.75/1.46 Sos input 2
% 0.75/1.46 Demodulators input 0
% 0.75/1.46 Passive input 0
% 0.75/1.46
% 0.75/1.46 Processed BS (before search) 2
% 0.75/1.46 Forward subsumed BS 0
% 0.75/1.46 Kept BS 2
% 0.75/1.46 New demodulators BS 1
% 0.75/1.46 Back demodulated BS 0
% 0.75/1.46
% 0.75/1.46 Clauses or pairs given 1707
% 0.75/1.46 Clauses generated 2841
% 0.75/1.46 Forward subsumed 1416
% 0.75/1.46 Deleted by weight 0
% 0.75/1.46 Deleted by variable count 0
% 0.75/1.46 Kept 1425
% 0.75/1.46 New demodulators 457
% 0.75/1.46 Back demodulated 127
% 0.75/1.46 Ordered paramod prunes 0
% 0.75/1.46 Basic paramod prunes 38188
% 0.75/1.46 Prime paramod prunes 73
% 0.75/1.46 Semantic prunes 0
% 0.75/1.46
% 0.75/1.46 Rewrite attmepts 171139
% 0.75/1.46 Rewrites 866
% 0.75/1.46
% 0.75/1.46 FPA overloads 0
% 0.75/1.46 FPA underloads 0
% 0.75/1.46
% 0.75/1.46 Usable size 0
% 0.75/1.46 Sos size 1299
% 0.75/1.46 Demodulators size 345
% 0.75/1.46 Passive size 0
% 0.75/1.46 Disabled size 127
% 0.75/1.46
% 0.75/1.46 Proofs found 1
% 0.75/1.46
% 0.75/1.46 ----------- times (seconds) ----------- Tue Jun 14 11:08:25 2022
% 0.75/1.46
% 0.75/1.46 user CPU time 0.32 (0 hr, 0 min, 0 sec)
% 0.75/1.46 system CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.75/1.46 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.75/1.46 input time 0.00
% 0.75/1.46 paramodulation time 0.04
% 0.75/1.46 demodulation time 0.07
% 0.75/1.46 orient time 0.01
% 0.75/1.46 weigh time 0.01
% 0.75/1.46 forward subsume time 0.01
% 0.75/1.46 back demod find time 0.02
% 0.75/1.46 conflict time 0.00
% 0.75/1.46 LRPO time 0.01
% 0.75/1.46 store clause time 0.13
% 0.75/1.46 disable clause time 0.00
% 0.75/1.46 prime paramod time 0.01
% 0.75/1.46 semantics time 0.00
% 0.75/1.46
% 0.75/1.46 EQP interrupted
%------------------------------------------------------------------------------