%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP611-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:48:12 EDT 2022
% Result : Unsatisfiable 0.47s 1.14s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 2
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 2 RR)
% Number of literals : 48 ( 0 equ; 1 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 158 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(inverse(double_divide(inverse(double_divide(inverse(double_divide(A,B)),C)),double_divide(A,C))),B),
file('GRP611-1.p',unknown),
[] ).
cnf(2,plain,
equal(inverse(double_divide(A,B)),multiply(B,A)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(multiply(double_divide(A,B),multiply(B,multiply(C,A))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),2,2,2]),
[iquote('back_demod(1),demod([2,2,2])')] ).
cnf(4,plain,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP611-1.p',unknown),
[] ).
cnf(5,plain,
equal(multiply(double_divide(multiply(A,multiply(B,C)),D),multiply(D,B)),double_divide(C,A)),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(6,plain,
equal(multiply(double_divide(multiply(A,B),double_divide(B,C)),A),C),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(7,plain,
equal(multiply(double_divide(A,B),multiply(B,C)),double_divide(multiply(A,D),double_divide(D,C))),
inference(para,[status(thm),theory(equality)],[6,3]),
[iquote('para(6,3)')] ).
cnf(8,plain,
equal(double_divide(multiply(A,B),double_divide(B,C)),multiply(double_divide(A,D),multiply(D,C))),
inference(flip,[status(thm),theory(equality)],[7]),
[iquote('flip(7)')] ).
cnf(18,plain,
equal(double_divide(A,multiply(double_divide(multiply(B,A),C),B)),C),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,5]),1]),
[iquote('para(6,5),flip(1)')] ).
cnf(19,plain,
equal(inverse(A),multiply(multiply(double_divide(multiply(B,C),A),B),C)),
inference(para,[status(thm),theory(equality)],[18,2]),
[iquote('para(18,2)')] ).
cnf(20,plain,
equal(multiply(multiply(double_divide(multiply(A,B),C),A),B),inverse(C)),
inference(flip,[status(thm),theory(equality)],[19]),
[iquote('flip(19)')] ).
cnf(24,plain,
equal(double_divide(multiply(A,B),double_divide(B,multiply(C,A))),C),
inference(para,[status(thm),theory(equality)],[7,3]),
[iquote('para(7,3)')] ).
cnf(27,plain,
equal(inverse(A),multiply(double_divide(B,multiply(A,C)),multiply(C,B))),
inference(para,[status(thm),theory(equality)],[24,2]),
[iquote('para(24,2)')] ).
cnf(28,plain,
equal(multiply(double_divide(A,multiply(B,C)),multiply(C,A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[27]),
[iquote('flip(27)')] ).
cnf(48,plain,
equal(multiply(double_divide(A,double_divide(A,multiply(B,C))),inverse(B)),C),
inference(para,[status(thm),theory(equality)],[28,3]),
[iquote('para(28,3)')] ).
cnf(50,plain,
equal(multiply(double_divide(A,double_divide(A,multiply(double_divide(B,C),D))),multiply(C,B)),D),
inference(para,[status(thm),theory(equality)],[2,48]),
[iquote('para(2,48)')] ).
cnf(51,plain,
equal(multiply(multiply(double_divide(A,B),multiply(B,C)),A),C),
inference(para,[status(thm),theory(equality)],[8,6]),
[iquote('para(8,6)')] ).
cnf(52,plain,
equal(multiply(double_divide(A,B),multiply(B,C)),multiply(double_divide(A,D),multiply(D,C))),
inference(para,[status(thm),theory(equality)],[51,3]),
[iquote('para(51,3)')] ).
cnf(54,plain,
equal(multiply(multiply(double_divide(A,double_divide(B,C)),D),A),multiply(C,multiply(D,B))),
inference(para,[status(thm),theory(equality)],[3,51]),
[iquote('para(3,51)')] ).
cnf(55,plain,
equal(multiply(A,multiply(multiply(double_divide(B,A),C),B)),C),
inference(para,[status(thm),theory(equality)],[6,51]),
[iquote('para(6,51)')] ).
cnf(65,plain,
equal(multiply(multiply(double_divide(A,B),C),A),multiply(multiply(double_divide(D,B),C),D)),
inference(para,[status(thm),theory(equality)],[55,51]),
[iquote('para(55,51)')] ).
cnf(66,plain,
equal(multiply(multiply(double_divide(A,multiply(double_divide(multiply(B,C),D),B)),inverse(D)),A),C),
inference(para,[status(thm),theory(equality)],[20,51]),
[iquote('para(20,51)')] ).
cnf(67,plain,
equal(multiply(multiply(A,B),multiply(inverse(A),C)),multiply(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[28,51]),54]),
[iquote('para(28,51),demod([54])')] ).
cnf(73,plain,
equal(multiply(multiply(A,multiply(B,C)),D),multiply(B,multiply(multiply(A,C),D))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,67]),2]),1]),
[iquote('para(3,67),demod([2]),flip(1)')] ).
cnf(127,plain,
equal(multiply(A,multiply(multiply(double_divide(B,multiply(double_divide(multiply(C,D),double_divide(E,A)),C)),E),B)),D),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,66]),73]),
[iquote('para(2,66),demod([73])')] ).
cnf(151,plain,
equal(multiply(A,multiply(double_divide(multiply(B,C),multiply(A,D)),B)),double_divide(C,D)),
inference(para,[status(thm),theory(equality)],[24,5]),
[iquote('para(24,5)')] ).
cnf(185,plain,
equal(multiply(double_divide(multiply(A,B),C),multiply(C,D)),double_divide(E,double_divide(E,multiply(double_divide(B,A),D)))),
inference(para,[status(thm),theory(equality)],[50,3]),
[iquote('para(50,3)')] ).
cnf(186,plain,
equal(double_divide(A,double_divide(A,multiply(double_divide(B,C),D))),multiply(double_divide(multiply(C,B),E),multiply(E,D))),
inference(flip,[status(thm),theory(equality)],[185]),
[iquote('flip(185)')] ).
cnf(201,plain,
equal(multiply(A,multiply(double_divide(B,multiply(A,C)),D)),multiply(double_divide(multiply(C,B),E),multiply(E,D))),
inference(para,[status(thm),theory(equality)],[24,52]),
[iquote('para(24,52)')] ).
cnf(202,plain,
equal(multiply(double_divide(multiply(A,B),C),multiply(C,D)),multiply(E,multiply(double_divide(B,multiply(E,A)),D))),
inference(flip,[status(thm),theory(equality)],[201]),
[iquote('flip(201)')] ).
cnf(228,plain,
equal(multiply(multiply(double_divide(A,multiply(double_divide(multiply(B,C),D),B)),E),A),multiply(multiply(D,E),C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[18,65]),1]),
[iquote('para(18,65),flip(1)')] ).
cnf(229,plain,
equal(multiply(A,multiply(multiply(double_divide(B,A),B),C)),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[127]),228]),
[iquote('back_demod(127),demod([228])')] ).
cnf(230,plain,
equal(multiply(multiply(A,inverse(A)),B),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[66]),228]),
[iquote('back_demod(66),demod([228])')] ).
cnf(235,plain,
equal(multiply(double_divide(A,B),multiply(B,A)),multiply(C,inverse(C))),
inference(para,[status(thm),theory(equality)],[230,3]),
[iquote('para(230,3)')] ).
cnf(279,plain,
equal(multiply(double_divide(A,B),A),multiply(double_divide(C,B),C)),
inference(para,[status(thm),theory(equality)],[229,3]),
[iquote('para(229,3)')] ).
cnf(294,plain,
equal(multiply(double_divide(A,multiply(double_divide(multiply(B,C),D),B)),A),multiply(D,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[18,279]),1]),
[iquote('para(18,279),flip(1)')] ).
cnf(295,plain,
equal(multiply(double_divide(A,double_divide(B,multiply(C,D))),A),multiply(C,multiply(D,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[24,279]),1]),
[iquote('para(24,279),flip(1)')] ).
cnf(321,plain,
equal(multiply(double_divide(A,double_divide(A,B)),multiply(C,inverse(C))),B),
inference(para,[status(thm),theory(equality)],[235,3]),
[iquote('para(235,3)')] ).
cnf(336,plain,
equal(multiply(A,multiply(B,inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[279,48]),295]),
[iquote('para(279,48),demod([295])')] ).
cnf(340,plain,
equal(multiply(A,inverse(A)),multiply(B,inverse(B))),
inference(para,[status(thm),theory(equality)],[230,336]),
[iquote('para(230,336)')] ).
cnf(349,plain,
equal(multiply(A,multiply(B,inverse(B))),A),
inference(para,[status(thm),theory(equality)],[340,336]),
[iquote('para(340,336)')] ).
cnf(350,plain,
equal(double_divide(A,double_divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[321]),349]),
[iquote('back_demod(321),demod([349])')] ).
cnf(355,plain,
equal(multiply(double_divide(multiply(A,B),C),multiply(C,D)),multiply(double_divide(B,A),D)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[186]),350]),1]),
[iquote('back_demod(186),demod([350]),flip(1)')] ).
cnf(363,plain,
equal(multiply(A,multiply(double_divide(B,multiply(A,C)),D)),multiply(double_divide(B,C),D)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[202]),355]),1]),
[iquote('back_demod(202),demod([355]),flip(1)')] ).
cnf(366,plain,
equal(multiply(double_divide(multiply(A,B),C),A),double_divide(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[151]),363]),
[iquote('back_demod(151),demod([363])')] ).
cnf(376,plain,
equal(multiply(double_divide(A,double_divide(B,C)),A),multiply(C,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[294]),366]),
[iquote('back_demod(294),demod([366])')] ).
cnf(377,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[295]),376]),
[iquote('back_demod(295),demod([376])')] ).
cnf(378,plain,
$false,
inference(conflict,[status(thm)],[377,4]),
[iquote('conflict(377,4)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP611-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 02:16:09 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.47/1.14 ----- EQP 0.9e, May 2009 -----
% 0.47/1.14 The job began on n019.cluster.edu, Tue Jun 14 02:16:10 2022
% 0.47/1.14 The command was "./eqp09e".
% 0.47/1.14
% 0.47/1.14 set(prolog_style_variables).
% 0.47/1.14 set(lrpo).
% 0.47/1.14 set(basic_paramod).
% 0.47/1.14 set(functional_subsume).
% 0.47/1.14 set(ordered_paramod).
% 0.47/1.14 set(prime_paramod).
% 0.47/1.14 set(para_pairs).
% 0.47/1.14 assign(pick_given_ratio,4).
% 0.47/1.14 clear(print_kept).
% 0.47/1.14 clear(print_new_demod).
% 0.47/1.14 clear(print_back_demod).
% 0.47/1.14 clear(print_given).
% 0.47/1.14 assign(max_mem,64000).
% 0.47/1.14 end_of_commands.
% 0.47/1.14
% 0.47/1.14 Usable:
% 0.47/1.14 end_of_list.
% 0.47/1.14
% 0.47/1.14 Sos:
% 0.47/1.14 0 (wt=-1) [] inverse(double_divide(inverse(double_divide(inverse(double_divide(A,B)),C)),double_divide(A,C))) = B.
% 0.47/1.14 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.47/1.14 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.47/1.14 end_of_list.
% 0.47/1.14
% 0.47/1.14 Demodulators:
% 0.47/1.14 end_of_list.
% 0.47/1.14
% 0.47/1.14 Passive:
% 0.47/1.14 end_of_list.
% 0.47/1.14
% 0.47/1.14 Starting to process input.
% 0.47/1.14
% 0.47/1.14 ** KEPT: 1 (wt=14) [] inverse(double_divide(inverse(double_divide(inverse(double_divide(A,B)),C)),double_divide(A,C))) = B.
% 0.47/1.14 1 is a new demodulator.
% 0.47/1.14
% 0.47/1.14 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.47/1.14 2 is a new demodulator.
% 0.47/1.14 -> 2 back demodulating 1.
% 0.47/1.14
% 0.47/1.14 ** KEPT: 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(double_divide(A,B),multiply(B,multiply(C,A))) = C.
% 0.47/1.14 3 is a new demodulator.
% 0.47/1.14
% 0.47/1.14 ** KEPT: 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.47/1.14 ---------------- PROOF FOUND ----------------
% 0.47/1.14 % SZS status Unsatisfiable
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 After processing input:
% 0.47/1.14
% 0.47/1.14 Usable:
% 0.47/1.14 end_of_list.
% 0.47/1.14
% 0.47/1.14 Sos:
% 0.47/1.14 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.47/1.14 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(double_divide(A,B),multiply(B,multiply(C,A))) = C.
% 0.47/1.14 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.47/1.14 end_of_list.
% 0.47/1.14
% 0.47/1.14 Demodulators:
% 0.47/1.14 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.47/1.14 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(double_divide(A,B),multiply(B,multiply(C,A))) = C.
% 0.47/1.14 end_of_list.
% 0.47/1.14
% 0.47/1.14 Passive:
% 0.47/1.14 end_of_list.
% 0.47/1.14
% 0.47/1.14 UNIT CONFLICT from 377 and 4 at 0.02 seconds.
% 0.47/1.14
% 0.47/1.14 ---------------- PROOF ----------------
% 0.47/1.14 % SZS output start Refutation
% See solution above
% 0.47/1.14 ------------ end of proof -------------
% 0.47/1.14
% 0.47/1.14
% 0.47/1.14 ------------- memory usage ------------
% 0.47/1.14 Memory dynamically allocated (tp_alloc): 976.
% 0.47/1.14 type (bytes each) gets frees in use avail bytes
% 0.47/1.14 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.47/1.14 term ( 16) 16803 10186 6617 22 128.2 K
% 0.47/1.14 gen_ptr ( 8) 28901 2463 26438 47 206.9 K
% 0.47/1.14 context ( 808) 11816 11814 2 3 3.9 K
% 0.47/1.14 trail ( 12) 2547 2547 0 8 0.1 K
% 0.47/1.14 bt_node ( 68) 3993 3989 4 15 1.3 K
% 0.47/1.14 ac_position (285432) 0 0 0 0 0.0 K
% 0.47/1.14 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.47/1.14 ac_match_free_vars_pos (4020)
% 0.47/1.14 0 0 0 0 0.0 K
% 0.47/1.14 discrim ( 12) 4975 772 4203 165 51.2 K
% 0.47/1.14 flat ( 40) 37578 37578 0 32 1.2 K
% 0.47/1.14 discrim_pos ( 12) 332 332 0 1 0.0 K
% 0.47/1.14 fpa_head ( 12) 2121 0 2121 0 24.9 K
% 0.47/1.14 fpa_tree ( 28) 507 507 0 9 0.2 K
% 0.47/1.14 fpa_pos ( 36) 546 546 0 1 0.0 K
% 0.47/1.14 literal ( 12) 1136 759 377 1 4.4 K
% 0.47/1.14 clause ( 24) 1136 759 377 1 8.9 K
% 0.47/1.14 list ( 12) 228 166 62 0 0.7 K
% 0.47/1.14 list_pos ( 20) 1466 252 1214 6 23.8 K
% 0.47/1.14 pair_index ( 40) 2 0 2 0 0.1 K
% 0.47/1.14
% 0.47/1.14 -------------- statistics -------------
% 0.47/1.14 Clauses input 3
% 0.47/1.14 Usable input 0
% 0.47/1.14 Sos input 3
% 0.47/1.14 Demodulators input 0
% 0.47/1.14 Passive input 0
% 0.47/1.14
% 0.47/1.14 Processed BS (before search) 4
% 0.47/1.14 Forward subsumed BS 0
% 0.47/1.14 Kept BS 4
% 0.47/1.14 New demodulators BS 3
% 0.47/1.14 Back demodulated BS 1
% 0.47/1.14
% 0.47/1.14 Clauses or pairs given 603
% 0.47/1.14 Clauses generated 611
% 0.47/1.14 Forward subsumed 238
% 0.47/1.14 Deleted by weight 0
% 0.47/1.14 Deleted by variable count 0
% 0.47/1.14 Kept 373
% 0.47/1.14 New demodulators 166
% 0.47/1.14 Back demodulated 53
% 0.47/1.14 Ordered paramod prunes 0
% 0.47/1.14 Basic paramod prunes 2333
% 0.47/1.14 Prime paramod prunes 18
% 0.47/1.14 Semantic prunes 0
% 0.47/1.14
% 0.47/1.14 Rewrite attmepts 5399
% 0.47/1.14 Rewrites 171
% 0.47/1.14
% 0.47/1.14 FPA overloads 0
% 0.47/1.14 FPA underloads 0
% 0.47/1.14
% 0.47/1.14 Usable size 0
% 0.47/1.14 Sos size 322
% 0.47/1.14 Demodulators size 136
% 0.47/1.14 Passive size 0
% 0.47/1.14 Disabled size 54
% 0.47/1.14
% 0.47/1.14 Proofs found 1
% 0.47/1.14
% 0.47/1.14 ----------- times (seconds) ----------- Tue Jun 14 02:16:10 2022
% 0.47/1.14
% 0.47/1.14 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.47/1.14 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.47/1.14 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.47/1.14 input time 0.00
% 0.47/1.14 paramodulation time 0.00
% 0.47/1.14 demodulation time 0.00
% 0.47/1.14 orient time 0.00
% 0.47/1.14 weigh time 0.00
% 0.47/1.14 forward subsume time 0.00
% 0.47/1.14 back demod find time 0.00
% 0.47/1.14 conflict time 0.00
% 0.47/1.14 LRPO time 0.00
% 0.47/1.14 store clause time 0.01
% 0.47/1.14 disable clause time 0.00
% 0.47/1.14 prime paramod time 0.00
% 0.47/1.14 semantics time 0.00
% 0.47/1.14
% 0.47/1.14 EQP interrupted
%------------------------------------------------------------------------------