%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP512-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n011.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:45 EDT 2022
% Result : Unsatisfiable 0.78s 1.16s
% Output : Refutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 1
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 2 RR)
% Number of literals : 32 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))),B),
file('GRP512-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(b,a),multiply(a,b)),
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(20,plain,
equal(inverse(multiply(A,multiply(B,inverse(multiply(multiply(A,B),C))))),C),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,3]),1]),
[iquote('para(4,3),flip(1)')] ).
cnf(21,plain,
equal(multiply(multiply(multiply(A,B),multiply(C,inverse(multiply(multiply(A,C),D)))),D),B),
inference(para,[status(thm),theory(equality)],[20,1]),
[iquote('para(20,1)')] ).
cnf(22,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(23,plain,
equal(multiply(multiply(multiply(A,B),inverse(multiply(A,C))),C),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[21]),22]),
[iquote('back_demod(21),demod([22])')] ).
cnf(24,plain,
equal(inverse(multiply(A,inverse(multiply(A,B)))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[20]),22]),
[iquote('back_demod(20),demod([22])')] ).
cnf(31,plain,
equal(multiply(multiply(A,inverse(B)),inverse(A)),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,3]),1]),
[iquote('para(5,3),demod([1])')] ).
cnf(39,plain,
equal(multiply(inverse(A),inverse(multiply(B,inverse(A)))),inverse(B)),
inference(para,[status(thm),theory(equality)],[31,31]),
[iquote('para(31,31)')] ).
cnf(40,plain,
equal(multiply(inverse(multiply(A,B)),B),inverse(A)),
inference(para,[status(thm),theory(equality)],[24,39]),
[iquote('para(24,39)')] ).
cnf(52,plain,
equal(inverse(multiply(A,inverse(B))),multiply(inverse(A),inverse(inverse(B)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[39,31]),1]),
[iquote('para(39,31),flip(1)')] ).
cnf(66,plain,
equal(multiply(inverse(A),inverse(inverse(multiply(A,B)))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[24]),52]),
[iquote('back_demod(24),demod([52])')] ).
cnf(75,plain,
equal(inverse(inverse(multiply(A,B))),multiply(B,inverse(inverse(A)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[66,31]),1]),
[iquote('para(66,31),flip(1)')] ).
cnf(84,plain,
equal(multiply(inverse(A),multiply(B,inverse(inverse(A)))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[66]),75]),
[iquote('back_demod(66),demod([75])')] ).
cnf(106,plain,
equal(multiply(multiply(multiply(inverse(multiply(A,B)),C),inverse(inverse(A))),B),C),
inference(para,[status(thm),theory(equality)],[40,23]),
[iquote('para(40,23)')] ).
cnf(113,plain,
equal(multiply(multiply(multiply(multiply(A,inverse(B)),C),inverse(A)),inverse(inverse(B))),C),
inference(para,[status(thm),theory(equality)],[31,1]),
[iquote('para(31,1)')] ).
cnf(173,plain,
equal(multiply(multiply(A,B),inverse(A)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,5]),52,75,84]),
[iquote('para(23,5),demod([52,75,84])')] ).
cnf(177,plain,
equal(multiply(A,inverse(multiply(B,A))),inverse(B)),
inference(para,[status(thm),theory(equality)],[173,173]),
[iquote('para(173,173)')] ).
cnf(179,plain,
equal(inverse(multiply(A,B)),multiply(inverse(A),inverse(B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[177,173]),1]),
[iquote('para(177,173),flip(1)')] ).
cnf(181,plain,
equal(multiply(A,multiply(inverse(B),inverse(A))),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[177]),179]),
[iquote('back_demod(177),demod([179])')] ).
cnf(226,plain,
equal(multiply(multiply(multiply(multiply(inverse(A),inverse(B)),C),inverse(inverse(A))),B),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[106]),179]),
[iquote('back_demod(106),demod([179])')] ).
cnf(239,plain,
equal(multiply(inverse(inverse(A)),inverse(inverse(B))),multiply(B,inverse(inverse(A)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[75]),179,179]),
[iquote('back_demod(75),demod([179,179])')] ).
cnf(240,plain,
equal(multiply(A,inverse(inverse(B))),multiply(inverse(inverse(B)),inverse(inverse(A)))),
inference(flip,[status(thm),theory(equality)],[239]),
[iquote('flip(239)')] ).
cnf(248,plain,
equal(multiply(multiply(multiply(A,inverse(B)),C),inverse(A)),multiply(inverse(B),C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[113,84]),1]),
[iquote('para(113,84),flip(1)')] ).
cnf(249,plain,
equal(multiply(multiply(inverse(A),B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[226]),248]),
[iquote('back_demod(226),demod([248])')] ).
cnf(250,plain,
equal(inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[249,173]),179,181]),
[iquote('para(249,173),demod([179,181])')] ).
cnf(253,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[240]),250,250,250]),
[iquote('back_demod(240),demod([250,250,250])')] ).
cnf(254,plain,
$false,
inference(conflict,[status(thm)],[253,2]),
[iquote('conflict(253,2)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP512-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 06:11:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.78/1.16 ----- EQP 0.9e, May 2009 -----
% 0.78/1.16 The job began on n011.cluster.edu, Mon Jun 13 06:11:04 2022
% 0.78/1.16 The command was "./eqp09e".
% 0.78/1.16
% 0.78/1.16 set(prolog_style_variables).
% 0.78/1.16 set(lrpo).
% 0.78/1.16 set(basic_paramod).
% 0.78/1.16 set(functional_subsume).
% 0.78/1.16 set(ordered_paramod).
% 0.78/1.16 set(prime_paramod).
% 0.78/1.16 set(para_pairs).
% 0.78/1.16 assign(pick_given_ratio,4).
% 0.78/1.16 clear(print_kept).
% 0.78/1.16 clear(print_new_demod).
% 0.78/1.16 clear(print_back_demod).
% 0.78/1.16 clear(print_given).
% 0.78/1.16 assign(max_mem,64000).
% 0.78/1.16 end_of_commands.
% 0.78/1.16
% 0.78/1.16 Usable:
% 0.78/1.16 end_of_list.
% 0.78/1.16
% 0.78/1.16 Sos:
% 0.78/1.16 0 (wt=-1) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.78/1.16 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.78/1.16 end_of_list.
% 0.78/1.16
% 0.78/1.16 Demodulators:
% 0.78/1.16 end_of_list.
% 0.78/1.16
% 0.78/1.16 Passive:
% 0.78/1.16 end_of_list.
% 0.78/1.16
% 0.78/1.16 Starting to process input.
% 0.78/1.16
% 0.78/1.16 ** KEPT: 1 (wt=12) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.78/1.16 1 is a new demodulator.
% 0.78/1.16
% 0.78/1.16 ** KEPT: 2 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.78/1.16 ---------------- PROOF FOUND ----------------
% 0.78/1.16 % SZS status Unsatisfiable
% 0.78/1.16
% 0.78/1.16
% 0.78/1.16 After processing input:
% 0.78/1.16
% 0.78/1.16 Usable:
% 0.78/1.16 end_of_list.
% 0.78/1.16
% 0.78/1.16 Sos:
% 0.78/1.16 2 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.78/1.16 1 (wt=12) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.78/1.16 end_of_list.
% 0.78/1.16
% 0.78/1.16 Demodulators:
% 0.78/1.16 1 (wt=12) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.78/1.16 end_of_list.
% 0.78/1.16
% 0.78/1.16 Passive:
% 0.78/1.16 end_of_list.
% 0.78/1.16
% 0.78/1.16 UNIT CONFLICT from 253 and 2 at 0.01 seconds.
% 0.78/1.16
% 0.78/1.16 ---------------- PROOF ----------------
% 0.78/1.16 % SZS output start Refutation
% See solution above
% 0.78/1.16 ------------ end of proof -------------
% 0.78/1.16
% 0.78/1.16
% 0.78/1.16 ------------- memory usage ------------
% 0.78/1.16 Memory dynamically allocated (tp_alloc): 488.
% 0.78/1.16 type (bytes each) gets frees in use avail bytes
% 0.78/1.16 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.78/1.16 term ( 16) 12927 7699 5228 21 101.5 K
% 0.78/1.16 gen_ptr ( 8) 30723 6651 24072 31 188.3 K
% 0.78/1.16 context ( 808) 8385 8383 2 7 7.1 K
% 0.78/1.16 trail ( 12) 2513 2513 0 8 0.1 K
% 0.78/1.16 bt_node ( 68) 1381 1378 3 12 1.0 K
% 0.78/1.16 ac_position (285432) 0 0 0 0 0.0 K
% 0.78/1.16 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.78/1.16 ac_match_free_vars_pos (4020)
% 0.78/1.16 0 0 0 0 0.0 K
% 0.78/1.16 discrim ( 12) 5342 3563 1779 77 21.8 K
% 0.78/1.16 flat ( 40) 32481 32481 0 41 1.6 K
% 0.78/1.16 discrim_pos ( 12) 563 563 0 1 0.0 K
% 0.78/1.16 fpa_head ( 12) 1663 0 1663 0 19.5 K
% 0.78/1.16 fpa_tree ( 28) 1039 1039 0 17 0.5 K
% 0.78/1.16 fpa_pos ( 36) 447 447 0 1 0.0 K
% 0.78/1.16 literal ( 12) 690 437 253 1 3.0 K
% 0.78/1.16 clause ( 24) 690 437 253 1 6.0 K
% 0.78/1.16 list ( 12) 253 196 57 2 0.7 K
% 0.78/1.16 list_pos ( 20) 1343 819 524 7 10.4 K
% 0.78/1.16 pair_index ( 40) 2 0 2 0 0.1 K
% 0.78/1.16
% 0.78/1.16 -------------- statistics -------------
% 0.78/1.16 Clauses input 2
% 0.78/1.16 Usable input 0
% 0.78/1.16 Sos input 2
% 0.78/1.16 Demodulators input 0
% 0.78/1.16 Passive input 0
% 0.78/1.16
% 0.78/1.16 Processed BS (before search) 2
% 0.78/1.16 Forward subsumed BS 0
% 0.78/1.16 Kept BS 2
% 0.78/1.16 New demodulators BS 1
% 0.78/1.16 Back demodulated BS 0
% 0.78/1.16
% 0.78/1.16 Clauses or pairs given 138
% 0.78/1.16 Clauses generated 382
% 0.78/1.16 Forward subsumed 131
% 0.78/1.16 Deleted by weight 0
% 0.78/1.16 Deleted by variable count 0
% 0.78/1.16 Kept 251
% 0.78/1.16 New demodulators 193
% 0.78/1.16 Back demodulated 171
% 0.78/1.16 Ordered paramod prunes 0
% 0.78/1.16 Basic paramod prunes 259
% 0.78/1.16 Prime paramod prunes 7
% 0.78/1.16 Semantic prunes 0
% 0.78/1.16
% 0.78/1.16 Rewrite attmepts 5672
% 0.78/1.16 Rewrites 509
% 0.78/1.16
% 0.78/1.16 FPA overloads 0
% 0.78/1.16 FPA underloads 0
% 0.78/1.16
% 0.78/1.16 Usable size 0
% 0.78/1.16 Sos size 81
% 0.78/1.16 Demodulators size 62
% 0.78/1.16 Passive size 0
% 0.78/1.16 Disabled size 171
% 0.78/1.16
% 0.78/1.16 Proofs found 1
% 0.78/1.16
% 0.78/1.16 ----------- times (seconds) ----------- Mon Jun 13 06:11:04 2022
% 0.78/1.16
% 0.78/1.16 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.78/1.16 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.78/1.16 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.78/1.16 input time 0.00
% 0.78/1.16 paramodulation time 0.00
% 0.78/1.16 demodulation time 0.00
% 0.78/1.16 orient time 0.00
% 0.78/1.16 weigh time 0.00
% 0.78/1.16 forward subsume time 0.00
% 0.78/1.16 back demod find time 0.00
% 0.78/1.16 conflict time 0.00
% 0.78/1.16 LRPO time 0.00
% 0.78/1.16 store clause time 0.00
% 0.78/1.16 disable clause time 0.00
% 0.78/1.16 prime paramod time 0.00
% 0.78/1.16 semantics time 0.00
% 0.78/1.16
% 0.78/1.16 EQP interrupted
%------------------------------------------------------------------------------