TSTP Solution File: GRP515-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP515-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n014.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:46 EDT 2022
% Result : Unsatisfiable 0.73s 1.11s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 2
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 4 RR)
% Number of literals : 33 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))),B),
file('GRP515-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP515-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(A,multiply(B,inverse(multiply(A,multiply(multiply(B,C),inverse(multiply(D,C))))))),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(7,plain,
equal(multiply(A,multiply(B,inverse(B))),A),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(8,plain,
equal(multiply(A,multiply(B,inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,1]),7]),
[iquote('para(7,1),demod([7])')] ).
cnf(9,plain,
equal(multiply(A,multiply(B,inverse(multiply(A,multiply(B,inverse(C)))))),C),
inference(para,[status(thm),theory(equality)],[8,1]),
[iquote('para(8,1)')] ).
cnf(10,plain,
equal(multiply(A,multiply(multiply(B,multiply(C,inverse(A))),inverse(C))),B),
inference(para,[status(thm),theory(equality)],[8,1]),
[iquote('para(8,1)')] ).
cnf(13,plain,
equal(multiply(A,multiply(multiply(B,C),inverse(B))),multiply(A,C)),
inference(para,[status(thm),theory(equality)],[1,9]),
[iquote('para(1,9)')] ).
cnf(18,plain,
equal(multiply(multiply(A,B),multiply(C,inverse(multiply(C,B)))),A),
inference(para,[status(thm),theory(equality)],[1,10]),
[iquote('para(1,10)')] ).
cnf(21,plain,
equal(multiply(A,multiply(B,inverse(multiply(A,multiply(C,inverse(multiply(C,D))))))),multiply(B,D)),
inference(para,[status(thm),theory(equality)],[18,1]),
[iquote('para(18,1)')] ).
cnf(23,plain,
equal(multiply(multiply(A,B),multiply(C,inverse(A))),multiply(C,B)),
inference(para,[status(thm),theory(equality)],[18,9]),
[iquote('para(18,9)')] ).
cnf(24,plain,
equal(multiply(A,B),multiply(multiply(C,B),multiply(A,inverse(C)))),
inference(flip,[status(thm),theory(equality)],[23]),
[iquote('flip(23)')] ).
cnf(29,plain,
~ equal(multiply(multiply(A,c3),multiply(multiply(a3,b3),inverse(A))),multiply(a3,multiply(b3,c3))),
inference(para,[status(thm),theory(equality)],[24,2]),
[iquote('para(24,2)')] ).
cnf(33,plain,
equal(multiply(multiply(A,B),C),multiply(multiply(A,C),B)),
inference(para,[status(thm),theory(equality)],[23,13]),
[iquote('para(23,13)')] ).
cnf(34,plain,
equal(multiply(A,multiply(multiply(B,inverse(multiply(B,C))),C)),A),
inference(para,[status(thm),theory(equality)],[33,7]),
[iquote('para(33,7)')] ).
cnf(39,plain,
equal(multiply(A,inverse(multiply(A,inverse(B)))),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[34,8]),1]),
[iquote('para(34,8),flip(1)')] ).
cnf(40,plain,
equal(multiply(multiply(A,inverse(B)),B),A),
inference(para,[status(thm),theory(equality)],[39,8]),
[iquote('para(39,8)')] ).
cnf(41,plain,
equal(multiply(A,inverse(multiply(B,inverse(B)))),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[40,7]),1]),
[iquote('para(40,7),flip(1)')] ).
cnf(42,plain,
equal(multiply(A,B),multiply(B,inverse(inverse(A)))),
inference(para,[status(thm),theory(equality)],[40,8]),
[iquote('para(40,8)')] ).
cnf(43,plain,
equal(multiply(A,inverse(inverse(B))),multiply(B,A)),
inference(flip,[status(thm),theory(equality)],[42]),
[iquote('flip(42)')] ).
cnf(44,plain,
equal(multiply(multiply(A,inverse(A)),B),B),
inference(para,[status(thm),theory(equality)],[41,8]),
[iquote('para(41,8)')] ).
cnf(47,plain,
equal(inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[42,7]),44]),
[iquote('para(42,7),demod([44])')] ).
cnf(48,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[43]),47]),
[iquote('back_demod(43),demod([47])')] ).
cnf(50,plain,
equal(multiply(inverse(A),multiply(B,A)),B),
inference(para,[status(thm),theory(equality)],[47,8]),
[iquote('para(47,8)')] ).
cnf(51,plain,
equal(multiply(A,multiply(inverse(A),B)),B),
inference(para,[status(thm),theory(equality)],[48,8]),
[iquote('para(48,8)')] ).
cnf(81,plain,
equal(inverse(multiply(inverse(A),inverse(B))),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[39,51]),1]),
[iquote('para(39,51),flip(1)')] ).
cnf(82,plain,
equal(inverse(multiply(A,B)),multiply(inverse(A),inverse(B))),
inference(para,[status(thm),theory(equality)],[81,47]),
[iquote('para(81,47)')] ).
cnf(93,plain,
equal(multiply(A,multiply(B,multiply(inverse(A),C))),multiply(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[21]),82,51,82,47]),
[iquote('back_demod(21),demod([82,51,82,47])')] ).
cnf(171,plain,
equal(multiply(multiply(inverse(A),B),multiply(A,C)),multiply(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,50]),82,47]),
[iquote('para(23,50),demod([82,47])')] ).
cnf(172,plain,
equal(multiply(multiply(A,B),multiply(inverse(A),C)),multiply(B,C)),
inference(para,[status(thm),theory(equality)],[47,171]),
[iquote('para(47,171)')] ).
cnf(175,plain,
equal(multiply(A,multiply(B,C)),multiply(B,multiply(C,A))),
inference(para,[status(thm),theory(equality)],[50,93]),
[iquote('para(50,93)')] ).
cnf(196,plain,
~ equal(multiply(c3,multiply(a3,b3)),multiply(a3,multiply(b3,c3))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[48,29]),172]),
[iquote('para(48,29),demod([172])')] ).
cnf(197,plain,
$false,
inference(conflict,[status(thm)],[196,175]),
[iquote('conflict(196,175)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP515-1 : TPTP v8.1.0. Released v2.6.0.
% 0.08/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n014.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 22:06:22 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.73/1.11 ----- EQP 0.9e, May 2009 -----
% 0.73/1.11 The job began on n014.cluster.edu, Mon Jun 13 22:06:22 2022
% 0.73/1.11 The command was "./eqp09e".
% 0.73/1.11
% 0.73/1.11 set(prolog_style_variables).
% 0.73/1.11 set(lrpo).
% 0.73/1.11 set(basic_paramod).
% 0.73/1.11 set(functional_subsume).
% 0.73/1.11 set(ordered_paramod).
% 0.73/1.11 set(prime_paramod).
% 0.73/1.11 set(para_pairs).
% 0.73/1.11 assign(pick_given_ratio,4).
% 0.73/1.11 clear(print_kept).
% 0.73/1.11 clear(print_new_demod).
% 0.73/1.11 clear(print_back_demod).
% 0.73/1.11 clear(print_given).
% 0.73/1.11 assign(max_mem,64000).
% 0.73/1.11 end_of_commands.
% 0.73/1.11
% 0.73/1.11 Usable:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Sos:
% 0.73/1.11 0 (wt=-1) [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B.
% 0.73/1.11 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Demodulators:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Passive:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Starting to process input.
% 0.73/1.11
% 0.73/1.11 ** KEPT: 1 (wt=12) [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B.
% 0.73/1.11 1 is a new demodulator.
% 0.73/1.11
% 0.73/1.11 ** KEPT: 2 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.73/1.11 ---------------- PROOF FOUND ----------------
% 0.73/1.11 % SZS status Unsatisfiable
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 After processing input:
% 0.73/1.11
% 0.73/1.11 Usable:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Sos:
% 0.73/1.11 2 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.73/1.11 1 (wt=12) [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B.
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Demodulators:
% 0.73/1.11 1 (wt=12) [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B.
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Passive:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 UNIT CONFLICT from 196 and 175 at 0.01 seconds.
% 0.73/1.11
% 0.73/1.11 ---------------- PROOF ----------------
% 0.73/1.11 % SZS output start Refutation
% See solution above
% 0.73/1.11 ------------ end of proof -------------
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 ------------- memory usage ------------
% 0.73/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.73/1.11 type (bytes each) gets frees in use avail bytes
% 0.73/1.11 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.73/1.11 term ( 16) 13673 10963 2710 18 52.5 K
% 0.73/1.11 gen_ptr ( 8) 15584 4710 10874 32 85.2 K
% 0.73/1.11 context ( 808) 10418 10416 2 5 5.5 K
% 0.73/1.11 trail ( 12) 1781 1781 0 6 0.1 K
% 0.73/1.11 bt_node ( 68) 5258 5255 3 17 1.3 K
% 0.73/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.11 ac_match_free_vars_pos (4020)
% 0.73/1.11 0 0 0 0 0.0 K
% 0.73/1.11 discrim ( 12) 2009 1003 1006 87 12.8 K
% 0.73/1.11 flat ( 40) 23224 23224 0 22 0.9 K
% 0.73/1.11 discrim_pos ( 12) 732 732 0 1 0.0 K
% 0.73/1.11 fpa_head ( 12) 626 0 626 0 7.3 K
% 0.73/1.11 fpa_tree ( 28) 897 897 0 29 0.8 K
% 0.73/1.11 fpa_pos ( 36) 332 332 0 1 0.0 K
% 0.73/1.11 literal ( 12) 939 743 196 0 2.3 K
% 0.73/1.11 clause ( 24) 939 743 196 0 4.6 K
% 0.73/1.11 list ( 12) 195 139 56 3 0.7 K
% 0.73/1.11 list_pos ( 20) 901 425 476 1 9.3 K
% 0.73/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.11
% 0.73/1.11 -------------- statistics -------------
% 0.73/1.11 Clauses input 2
% 0.73/1.11 Usable input 0
% 0.73/1.11 Sos input 2
% 0.73/1.11 Demodulators input 0
% 0.73/1.11 Passive input 0
% 0.73/1.11
% 0.73/1.11 Processed BS (before search) 2
% 0.73/1.11 Forward subsumed BS 0
% 0.73/1.11 Kept BS 2
% 0.73/1.11 New demodulators BS 1
% 0.73/1.11 Back demodulated BS 0
% 0.73/1.11
% 0.73/1.11 Clauses or pairs given 660
% 0.73/1.11 Clauses generated 616
% 0.73/1.11 Forward subsumed 422
% 0.73/1.11 Deleted by weight 0
% 0.73/1.11 Deleted by variable count 0
% 0.73/1.11 Kept 194
% 0.73/1.11 New demodulators 135
% 0.73/1.11 Back demodulated 89
% 0.73/1.11 Ordered paramod prunes 0
% 0.73/1.11 Basic paramod prunes 1793
% 0.73/1.11 Prime paramod prunes 78
% 0.73/1.11 Semantic prunes 0
% 0.73/1.11
% 0.73/1.11 Rewrite attmepts 4388
% 0.73/1.11 Rewrites 514
% 0.73/1.11
% 0.73/1.11 FPA overloads 0
% 0.73/1.11 FPA underloads 0
% 0.73/1.11
% 0.73/1.11 Usable size 0
% 0.73/1.11 Sos size 106
% 0.73/1.11 Demodulators size 69
% 0.73/1.11 Passive size 0
% 0.73/1.11 Disabled size 89
% 0.73/1.11
% 0.73/1.11 Proofs found 1
% 0.73/1.11
% 0.73/1.11 ----------- times (seconds) ----------- Mon Jun 13 22:06:22 2022
% 0.73/1.11
% 0.73/1.11 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.73/1.11 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.73/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.11 input time 0.00
% 0.73/1.11 paramodulation time 0.00
% 0.73/1.11 demodulation time 0.00
% 0.73/1.11 orient time 0.00
% 0.73/1.11 weigh time 0.00
% 0.73/1.11 forward subsume time 0.00
% 0.73/1.11 back demod find time 0.00
% 0.73/1.11 conflict time 0.00
% 0.73/1.11 LRPO time 0.00
% 0.73/1.11 store clause time 0.00
% 0.73/1.11 disable clause time 0.00
% 0.73/1.11 prime paramod time 0.00
% 0.73/1.11 semantics time 0.00
% 0.73/1.11
% 0.73/1.11 EQP interrupted
%------------------------------------------------------------------------------