TSTP Solution File: GRP519-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP519-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:47 EDT 2022
% Result : Unsatisfiable 0.66s 1.05s
% Output : Refutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 2
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 2 RR)
% Number of literals : 34 ( 0 equ; 1 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)),C),
file('GRP519-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP519-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(A,multiply(multiply(inverse(B),C),multiply(multiply(inverse(multiply(A,D)),B),D))),C),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(4,plain,
equal(multiply(multiply(inverse(multiply(inverse(multiply(A,B)),C)),D),C),multiply(A,multiply(D,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,1]),1]),
[iquote('para(1,1),flip(1)')] ).
cnf(6,plain,
equal(multiply(A,multiply(B,multiply(multiply(inverse(multiply(A,C)),D),C))),multiply(multiply(inverse(multiply(inverse(D),E)),B),E)),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(7,plain,
equal(multiply(multiply(inverse(multiply(inverse(A),B)),C),B),multiply(D,multiply(C,multiply(multiply(inverse(multiply(D,E)),A),E)))),
inference(flip,[status(thm),theory(equality)],[6]),
[iquote('flip(6)')] ).
cnf(8,plain,
equal(multiply(multiply(inverse(A),B),A),B),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(9,plain,
equal(multiply(multiply(inverse(A),B),multiply(multiply(inverse(B),C),A)),C),
inference(para,[status(thm),theory(equality)],[8,1]),
[iquote('para(8,1)')] ).
cnf(10,plain,
equal(multiply(multiply(inverse(A),A),B),B),
inference(para,[status(thm),theory(equality)],[8,9]),
[iquote('para(8,9)')] ).
cnf(14,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,multiply(C,B))),C),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(15,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,C)),multiply(inverse(B),C)),
inference(para,[status(thm),theory(equality)],[8,14]),
[iquote('para(8,14)')] ).
cnf(16,plain,
equal(multiply(inverse(A),multiply(B,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14]),15]),
[iquote('back_demod(14),demod([15])')] ).
cnf(17,plain,
equal(multiply(inverse(multiply(multiply(inverse(multiply(A,B)),C),B)),C),A),
inference(para,[status(thm),theory(equality)],[8,14]),
[iquote('para(8,14)')] ).
cnf(19,plain,
equal(multiply(inverse(multiply(A,B)),A),inverse(B)),
inference(para,[status(thm),theory(equality)],[16,16]),
[iquote('para(16,16)')] ).
cnf(21,plain,
equal(inverse(multiply(A,B)),multiply(inverse(A),inverse(B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,16]),1]),
[iquote('para(19,16),flip(1)')] ).
cnf(22,plain,
equal(multiply(multiply(multiply(multiply(inverse(inverse(A)),inverse(inverse(B))),inverse(C)),inverse(B)),C),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[17]),21,21,21,21]),
[iquote('back_demod(17),demod([21,21,21,21])')] ).
cnf(27,plain,
equal(multiply(multiply(multiply(inverse(inverse(A)),inverse(B)),C),B),multiply(D,multiply(C,multiply(multiply(multiply(inverse(D),inverse(E)),A),E)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[7]),21,21]),
[iquote('back_demod(7),demod([21,21])')] ).
cnf(28,plain,
equal(multiply(A,multiply(B,multiply(multiply(multiply(inverse(A),inverse(C)),D),C))),multiply(multiply(multiply(inverse(inverse(D)),inverse(E)),B),E)),
inference(flip,[status(thm),theory(equality)],[27]),
[iquote('flip(27)')] ).
cnf(30,plain,
equal(multiply(multiply(multiply(multiply(inverse(inverse(A)),inverse(inverse(B))),inverse(C)),D),C),multiply(A,multiply(D,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),21,21,21]),
[iquote('back_demod(4),demod([21,21,21])')] ).
cnf(31,plain,
equal(multiply(A,multiply(inverse(B),B)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[22]),30]),
[iquote('back_demod(22),demod([30])')] ).
cnf(32,plain,
equal(multiply(A,multiply(multiply(inverse(B),C),multiply(multiply(multiply(inverse(A),inverse(D)),B),D))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),21]),
[iquote('back_demod(3),demod([21])')] ).
cnf(36,plain,
equal(multiply(multiply(inverse(A),B),multiply(C,A)),multiply(C,B)),
inference(para,[status(thm),theory(equality)],[16,9]),
[iquote('para(16,9)')] ).
cnf(41,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[31,36]),21,10]),
[iquote('para(31,36),demod([21,10])')] ).
cnf(42,plain,
equal(multiply(A,multiply(inverse(A),B)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,41]),1]),
[iquote('para(8,41),flip(1)')] ).
cnf(50,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[42,16]),1]),
[iquote('para(42,16),flip(1)')] ).
cnf(53,plain,
equal(multiply(multiply(multiply(multiply(A,B),inverse(C)),D),C),multiply(A,multiply(D,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[30]),50,50]),
[iquote('back_demod(30),demod([50,50])')] ).
cnf(54,plain,
equal(multiply(A,multiply(B,multiply(multiply(multiply(inverse(A),inverse(C)),D),C))),multiply(multiply(multiply(D,inverse(E)),B),E)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[28]),50]),
[iquote('back_demod(28),demod([50])')] ).
cnf(55,plain,
equal(multiply(multiply(multiply(A,inverse(B)),C),B),multiply(D,multiply(C,multiply(multiply(multiply(inverse(D),inverse(E)),A),E)))),
inference(flip,[status(thm),theory(equality)],[54]),
[iquote('flip(54)')] ).
cnf(76,plain,
equal(multiply(A,multiply(B,multiply(multiply(multiply(inverse(A),inverse(C)),D),C))),multiply(B,D)),
inference(para,[status(thm),theory(equality)],[16,32]),
[iquote('para(16,32)')] ).
cnf(79,plain,
equal(multiply(multiply(multiply(A,inverse(B)),C),B),multiply(C,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[55]),76]),
[iquote('back_demod(55),demod([76])')] ).
cnf(81,plain,
equal(multiply(A,multiply(B,C)),multiply(B,multiply(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[53]),79]),
[iquote('back_demod(53),demod([79])')] ).
cnf(100,plain,
equal(multiply(A,multiply(B,C)),multiply(multiply(A,C),B)),
inference(para,[status(thm),theory(equality)],[81,41]),
[iquote('para(81,41)')] ).
cnf(109,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[41,100]),1]),
[iquote('para(41,100),flip(1)')] ).
cnf(110,plain,
$false,
inference(conflict,[status(thm)],[109,2]),
[iquote('conflict(109,2)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP519-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/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 05:44:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.66/1.05 ----- EQP 0.9e, May 2009 -----
% 0.66/1.05 The job began on n021.cluster.edu, Mon Jun 13 05:44:57 2022
% 0.66/1.05 The command was "./eqp09e".
% 0.66/1.05
% 0.66/1.05 set(prolog_style_variables).
% 0.66/1.05 set(lrpo).
% 0.66/1.05 set(basic_paramod).
% 0.66/1.05 set(functional_subsume).
% 0.66/1.05 set(ordered_paramod).
% 0.66/1.05 set(prime_paramod).
% 0.66/1.05 set(para_pairs).
% 0.66/1.05 assign(pick_given_ratio,4).
% 0.66/1.05 clear(print_kept).
% 0.66/1.05 clear(print_new_demod).
% 0.66/1.05 clear(print_back_demod).
% 0.66/1.05 clear(print_given).
% 0.66/1.05 assign(max_mem,64000).
% 0.66/1.05 end_of_commands.
% 0.66/1.05
% 0.66/1.05 Usable:
% 0.66/1.05 end_of_list.
% 0.66/1.05
% 0.66/1.05 Sos:
% 0.66/1.05 0 (wt=-1) [] multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C.
% 0.66/1.05 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.66/1.05 end_of_list.
% 0.66/1.05
% 0.66/1.05 Demodulators:
% 0.66/1.05 end_of_list.
% 0.66/1.05
% 0.66/1.05 Passive:
% 0.66/1.05 end_of_list.
% 0.66/1.05
% 0.66/1.05 Starting to process input.
% 0.66/1.05
% 0.66/1.05 ** KEPT: 1 (wt=12) [] multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C.
% 0.66/1.05 1 is a new demodulator.
% 0.66/1.05
% 0.66/1.05 ** KEPT: 2 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.66/1.05 ---------------- PROOF FOUND ----------------
% 0.66/1.05 % SZS status Unsatisfiable
% 0.66/1.05
% 0.66/1.05
% 0.66/1.05 After processing input:
% 0.66/1.05
% 0.66/1.05 Usable:
% 0.66/1.05 end_of_list.
% 0.66/1.05
% 0.66/1.05 Sos:
% 0.66/1.05 2 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.66/1.05 1 (wt=12) [] multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C.
% 0.66/1.05 end_of_list.
% 0.66/1.05
% 0.66/1.05 Demodulators:
% 0.66/1.05 1 (wt=12) [] multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C.
% 0.66/1.05 end_of_list.
% 0.66/1.05
% 0.66/1.05 Passive:
% 0.66/1.05 end_of_list.
% 0.66/1.05
% 0.66/1.05 UNIT CONFLICT from 109 and 2 at 0.01 seconds.
% 0.66/1.05
% 0.66/1.05 ---------------- PROOF ----------------
% 0.66/1.05 % SZS output start Refutation
% See solution above
% 0.66/1.06 ------------ end of proof -------------
% 0.66/1.06
% 0.66/1.06
% 0.66/1.06 ------------- memory usage ------------
% 0.66/1.06 Memory dynamically allocated (tp_alloc): 488.
% 0.66/1.06 type (bytes each) gets frees in use avail bytes
% 0.66/1.06 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.66/1.06 term ( 16) 7032 5371 1661 25 32.5 K
% 0.66/1.06 gen_ptr ( 8) 8647 2045 6602 33 51.8 K
% 0.66/1.06 context ( 808) 4638 4636 2 6 6.3 K
% 0.66/1.06 trail ( 12) 756 756 0 5 0.1 K
% 0.66/1.06 bt_node ( 68) 1880 1877 3 12 1.0 K
% 0.66/1.06 ac_position (285432) 0 0 0 0 0.0 K
% 0.66/1.06 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.66/1.06 ac_match_free_vars_pos (4020)
% 0.66/1.06 0 0 0 0 0.0 K
% 0.66/1.06 discrim ( 12) 1354 628 726 0 8.5 K
% 0.66/1.06 flat ( 40) 12095 12095 0 29 1.1 K
% 0.66/1.06 discrim_pos ( 12) 320 320 0 1 0.0 K
% 0.66/1.06 fpa_head ( 12) 478 0 478 0 5.6 K
% 0.66/1.06 fpa_tree ( 28) 379 379 0 25 0.7 K
% 0.66/1.06 fpa_pos ( 36) 179 179 0 1 0.0 K
% 0.66/1.06 literal ( 12) 419 310 109 1 1.3 K
% 0.66/1.06 clause ( 24) 419 310 109 1 2.6 K
% 0.66/1.06 list ( 12) 129 73 56 3 0.7 K
% 0.66/1.06 list_pos ( 20) 482 199 283 0 5.5 K
% 0.66/1.06 pair_index ( 40) 2 0 2 0 0.1 K
% 0.66/1.06
% 0.66/1.06 -------------- statistics -------------
% 0.66/1.06 Clauses input 2
% 0.66/1.06 Usable input 0
% 0.66/1.06 Sos input 2
% 0.66/1.06 Demodulators input 0
% 0.66/1.06 Passive input 0
% 0.66/1.06
% 0.66/1.06 Processed BS (before search) 2
% 0.66/1.06 Forward subsumed BS 0
% 0.66/1.06 Kept BS 2
% 0.66/1.06 New demodulators BS 1
% 0.66/1.06 Back demodulated BS 0
% 0.66/1.06
% 0.66/1.06 Clauses or pairs given 281
% 0.66/1.06 Clauses generated 262
% 0.66/1.06 Forward subsumed 155
% 0.66/1.06 Deleted by weight 0
% 0.66/1.06 Deleted by variable count 0
% 0.66/1.06 Kept 107
% 0.66/1.06 New demodulators 69
% 0.66/1.06 Back demodulated 41
% 0.66/1.06 Ordered paramod prunes 0
% 0.66/1.06 Basic paramod prunes 801
% 0.66/1.06 Prime paramod prunes 49
% 0.66/1.06 Semantic prunes 0
% 0.66/1.06
% 0.66/1.06 Rewrite attmepts 2191
% 0.66/1.06 Rewrites 221
% 0.66/1.06
% 0.66/1.06 FPA overloads 0
% 0.66/1.06 FPA underloads 0
% 0.66/1.06
% 0.66/1.06 Usable size 0
% 0.66/1.06 Sos size 67
% 0.66/1.06 Demodulators size 41
% 0.66/1.06 Passive size 0
% 0.66/1.06 Disabled size 41
% 0.66/1.06
% 0.66/1.06 Proofs found 1
% 0.66/1.06
% 0.66/1.06 ----------- times (seconds) ----------- Mon Jun 13 05:44:57 2022
% 0.66/1.06
% 0.66/1.06 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.66/1.06 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.66/1.06 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.66/1.06 input time 0.00
% 0.66/1.06 paramodulation time 0.00
% 0.66/1.06 demodulation time 0.00
% 0.66/1.06 orient time 0.00
% 0.66/1.06 weigh time 0.00
% 0.66/1.06 forward subsume time 0.00
% 0.66/1.06 back demod find time 0.00
% 0.66/1.06 conflict time 0.00
% 0.66/1.06 LRPO time 0.00
% 0.66/1.06 store clause time 0.00
% 0.66/1.06 disable clause time 0.00
% 0.66/1.06 prime paramod time 0.00
% 0.66/1.06 semantics time 0.00
% 0.66/1.06
% 0.66/1.06 EQP interrupted
%------------------------------------------------------------------------------