%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP612-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n023.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.84s 1.19s
% Output : Refutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 1
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 2 RR)
% Number of literals : 43 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 122 ( 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('GRP612-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(b,a),multiply(a,b)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
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(23,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(26,plain,
equal(inverse(A),multiply(double_divide(B,multiply(A,C)),multiply(C,B))),
inference(para,[status(thm),theory(equality)],[23,2]),
[iquote('para(23,2)')] ).
cnf(27,plain,
equal(multiply(double_divide(A,multiply(B,C)),multiply(C,A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[26]),
[iquote('flip(26)')] ).
cnf(44,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(47,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,44]),
[iquote('para(3,44)')] ).
cnf(48,plain,
equal(multiply(A,multiply(multiply(double_divide(B,A),C),B)),C),
inference(para,[status(thm),theory(equality)],[6,44]),
[iquote('para(6,44)')] ).
cnf(58,plain,
equal(multiply(multiply(double_divide(A,B),C),A),multiply(multiply(double_divide(D,B),C),D)),
inference(para,[status(thm),theory(equality)],[48,44]),
[iquote('para(48,44)')] ).
cnf(65,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,44]),
[iquote('para(20,44)')] ).
cnf(68,plain,
equal(multiply(double_divide(A,double_divide(A,multiply(B,C))),inverse(B)),C),
inference(para,[status(thm),theory(equality)],[27,3]),
[iquote('para(27,3)')] ).
cnf(73,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)],[27,44]),47]),
[iquote('para(27,44),demod([47])')] ).
cnf(85,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,73]),2]),1]),
[iquote('para(3,73),demod([2]),flip(1)')] ).
cnf(137,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,65]),85]),
[iquote('para(2,65),demod([85])')] ).
cnf(231,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,58]),1]),
[iquote('para(18,58),flip(1)')] ).
cnf(232,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)],[137]),231]),
[iquote('back_demod(137),demod([231])')] ).
cnf(233,plain,
equal(multiply(multiply(A,inverse(A)),B),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[65]),231]),
[iquote('back_demod(65),demod([231])')] ).
cnf(239,plain,
equal(multiply(double_divide(A,B),multiply(B,A)),multiply(C,inverse(C))),
inference(para,[status(thm),theory(equality)],[233,3]),
[iquote('para(233,3)')] ).
cnf(282,plain,
equal(multiply(double_divide(A,B),A),multiply(double_divide(C,B),C)),
inference(para,[status(thm),theory(equality)],[232,3]),
[iquote('para(232,3)')] ).
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)],[23,282]),1]),
[iquote('para(23,282),flip(1)')] ).
cnf(332,plain,
equal(multiply(double_divide(A,double_divide(A,B)),multiply(C,inverse(C))),B),
inference(para,[status(thm),theory(equality)],[239,3]),
[iquote('para(239,3)')] ).
cnf(351,plain,
equal(multiply(A,multiply(B,inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[282,68]),295]),
[iquote('para(282,68),demod([295])')] ).
cnf(355,plain,
equal(multiply(A,inverse(A)),multiply(B,inverse(B))),
inference(para,[status(thm),theory(equality)],[233,351]),
[iquote('para(233,351)')] ).
cnf(364,plain,
equal(multiply(A,multiply(B,inverse(B))),A),
inference(para,[status(thm),theory(equality)],[355,351]),
[iquote('para(355,351)')] ).
cnf(365,plain,
equal(double_divide(A,double_divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[332]),364]),
[iquote('back_demod(332),demod([364])')] ).
cnf(375,plain,
equal(inverse(A),multiply(double_divide(B,A),B)),
inference(para,[status(thm),theory(equality)],[365,2]),
[iquote('para(365,2)')] ).
cnf(384,plain,
equal(multiply(double_divide(A,double_divide(B,C)),A),multiply(C,B)),
inference(para,[status(thm),theory(equality)],[375,2]),
[iquote('para(375,2)')] ).
cnf(385,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]),384]),
[iquote('back_demod(295),demod([384])')] ).
cnf(423,plain,
equal(multiply(A,multiply(inverse(A),B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[233]),385]),
[iquote('back_demod(233),demod([385])')] ).
cnf(528,plain,
equal(multiply(A,B),multiply(B,inverse(inverse(A)))),
inference(para,[status(thm),theory(equality)],[351,423]),
[iquote('para(351,423)')] ).
cnf(529,plain,
equal(multiply(A,inverse(inverse(B))),multiply(B,A)),
inference(flip,[status(thm),theory(equality)],[528]),
[iquote('flip(528)')] ).
cnf(532,plain,
equal(inverse(inverse(A)),A),
inference(para,[status(thm),theory(equality)],[423,364]),
[iquote('para(423,364)')] ).
cnf(533,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[529]),532]),
[iquote('back_demod(529),demod([532])')] ).
cnf(534,plain,
$false,
inference(conflict,[status(thm)],[533,4]),
[iquote('conflict(533,4)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GRP612-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.08/0.14 % Command : tptp2X_and_run_eqp %s
% 0.16/0.36 % Computer : n023.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 600
% 0.16/0.36 % DateTime : Mon Jun 13 21:38:06 EDT 2022
% 0.16/0.36 % CPUTime :
% 0.84/1.19 ----- EQP 0.9e, May 2009 -----
% 0.84/1.19 The job began on n023.cluster.edu, Mon Jun 13 21:38:06 2022
% 0.84/1.19 The command was "./eqp09e".
% 0.84/1.19
% 0.84/1.19 set(prolog_style_variables).
% 0.84/1.19 set(lrpo).
% 0.84/1.19 set(basic_paramod).
% 0.84/1.19 set(functional_subsume).
% 0.84/1.19 set(ordered_paramod).
% 0.84/1.19 set(prime_paramod).
% 0.84/1.19 set(para_pairs).
% 0.84/1.19 assign(pick_given_ratio,4).
% 0.84/1.19 clear(print_kept).
% 0.84/1.19 clear(print_new_demod).
% 0.84/1.19 clear(print_back_demod).
% 0.84/1.19 clear(print_given).
% 0.84/1.19 assign(max_mem,64000).
% 0.84/1.19 end_of_commands.
% 0.84/1.19
% 0.84/1.19 Usable:
% 0.84/1.19 end_of_list.
% 0.84/1.19
% 0.84/1.19 Sos:
% 0.84/1.19 0 (wt=-1) [] inverse(double_divide(inverse(double_divide(inverse(double_divide(A,B)),C)),double_divide(A,C))) = B.
% 0.84/1.19 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.84/1.19 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.84/1.19 end_of_list.
% 0.84/1.19
% 0.84/1.19 Demodulators:
% 0.84/1.19 end_of_list.
% 0.84/1.19
% 0.84/1.19 Passive:
% 0.84/1.19 end_of_list.
% 0.84/1.19
% 0.84/1.19 Starting to process input.
% 0.84/1.19
% 0.84/1.19 ** KEPT: 1 (wt=14) [] inverse(double_divide(inverse(double_divide(inverse(double_divide(A,B)),C)),double_divide(A,C))) = B.
% 0.84/1.19 1 is a new demodulator.
% 0.84/1.19
% 0.84/1.19 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.84/1.19 2 is a new demodulator.
% 0.84/1.19 -> 2 back demodulating 1.
% 0.84/1.19
% 0.84/1.19 ** KEPT: 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(double_divide(A,B),multiply(B,multiply(C,A))) = C.
% 0.84/1.19 3 is a new demodulator.
% 0.84/1.19
% 0.84/1.19 ** KEPT: 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.84/1.19 ---------------- PROOF FOUND ----------------
% 0.84/1.19 % SZS status Unsatisfiable
% 0.84/1.19
% 0.84/1.19
% 0.84/1.19 After processing input:
% 0.84/1.19
% 0.84/1.19 Usable:
% 0.84/1.19 end_of_list.
% 0.84/1.19
% 0.84/1.19 Sos:
% 0.84/1.19 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.84/1.19 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.84/1.19 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(double_divide(A,B),multiply(B,multiply(C,A))) = C.
% 0.84/1.19 end_of_list.
% 0.84/1.19
% 0.84/1.19 Demodulators:
% 0.84/1.19 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.84/1.19 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(double_divide(A,B),multiply(B,multiply(C,A))) = C.
% 0.84/1.19 end_of_list.
% 0.84/1.19
% 0.84/1.19 Passive:
% 0.84/1.19 end_of_list.
% 0.84/1.19
% 0.84/1.19 UNIT CONFLICT from 533 and 4 at 0.02 seconds.
% 0.84/1.19
% 0.84/1.19 ---------------- PROOF ----------------
% 0.84/1.19 % SZS output start Refutation
% See solution above
% 0.84/1.19 ------------ end of proof -------------
% 0.84/1.19
% 0.84/1.19
% 0.84/1.19 ------------- memory usage ------------
% 0.84/1.19 Memory dynamically allocated (tp_alloc): 976.
% 0.84/1.19 type (bytes each) gets frees in use avail bytes
% 0.84/1.19 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.84/1.19 term ( 16) 24346 14721 9625 22 186.3 K
% 0.84/1.19 gen_ptr ( 8) 45214 6484 38730 42 302.9 K
% 0.84/1.19 context ( 808) 16469 16467 2 3 3.9 K
% 0.84/1.19 trail ( 12) 3971 3971 0 8 0.1 K
% 0.84/1.19 bt_node ( 68) 4872 4867 5 14 1.3 K
% 0.84/1.19 ac_position (285432) 0 0 0 0 0.0 K
% 0.84/1.19 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.84/1.19 ac_match_free_vars_pos (4020)
% 0.84/1.19 0 0 0 0 0.0 K
% 0.84/1.19 discrim ( 12) 7024 2572 4452 310 55.8 K
% 0.84/1.19 flat ( 40) 57119 57119 0 32 1.2 K
% 0.84/1.19 discrim_pos ( 12) 650 650 0 1 0.0 K
% 0.84/1.19 fpa_head ( 12) 2459 0 2459 0 28.8 K
% 0.84/1.19 fpa_tree ( 28) 777 777 0 9 0.2 K
% 0.84/1.19 fpa_pos ( 36) 766 766 0 1 0.0 K
% 0.84/1.19 literal ( 12) 1655 1122 533 1 6.3 K
% 0.84/1.19 clause ( 24) 1655 1122 533 1 12.5 K
% 0.84/1.19 list ( 12) 292 235 57 3 0.7 K
% 0.84/1.19 list_pos ( 20) 2231 843 1388 3 27.2 K
% 0.84/1.19 pair_index ( 40) 2 0 2 0 0.1 K
% 0.84/1.19
% 0.84/1.19 -------------- statistics -------------
% 0.84/1.19 Clauses input 3
% 0.84/1.19 Usable input 0
% 0.84/1.19 Sos input 3
% 0.84/1.19 Demodulators input 0
% 0.84/1.19 Passive input 0
% 0.84/1.19
% 0.84/1.19 Processed BS (before search) 4
% 0.84/1.19 Forward subsumed BS 0
% 0.84/1.19 Kept BS 4
% 0.84/1.19 New demodulators BS 3
% 0.84/1.19 Back demodulated BS 1
% 0.84/1.19
% 0.84/1.19 Clauses or pairs given 792
% 0.84/1.19 Clauses generated 888
% 0.84/1.19 Forward subsumed 359
% 0.84/1.19 Deleted by weight 0
% 0.84/1.19 Deleted by variable count 0
% 0.84/1.19 Kept 529
% 0.84/1.19 New demodulators 230
% 0.84/1.19 Back demodulated 184
% 0.84/1.19 Ordered paramod prunes 0
% 0.84/1.19 Basic paramod prunes 2599
% 0.84/1.19 Prime paramod prunes 21
% 0.84/1.19 Semantic prunes 0
% 0.84/1.19
% 0.84/1.19 Rewrite attmepts 8291
% 0.84/1.19 Rewrites 401
% 0.84/1.19
% 0.84/1.19 FPA overloads 0
% 0.84/1.19 FPA underloads 0
% 0.84/1.19
% 0.84/1.19 Usable size 0
% 0.84/1.19 Sos size 347
% 0.84/1.19 Demodulators size 134
% 0.84/1.19 Passive size 0
% 0.84/1.19 Disabled size 185
% 0.84/1.19
% 0.84/1.19 Proofs found 1
% 0.84/1.19
% 0.84/1.19 ----------- times (seconds) ----------- Mon Jun 13 21:38:07 2022
% 0.84/1.19
% 0.84/1.19 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.84/1.19 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.84/1.19 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 0.84/1.19 input time 0.00
% 0.84/1.19 paramodulation time 0.01
% 0.84/1.19 demodulation time 0.00
% 0.84/1.19 orient time 0.00
% 0.84/1.19 weigh time 0.00
% 0.84/1.19 forward subsume time 0.00
% 0.84/1.19 back demod find time 0.00
% 0.84/1.19 conflict time 0.00
% 0.84/1.19 LRPO time 0.00
% 0.84/1.19 store clause time 0.00
% 0.84/1.19 disable clause time 0.00
% 0.84/1.19 prime paramod time 0.00
% 0.84/1.19 semantics time 0.00
% 0.84/1.19
% 0.84/1.19 EQP interrupted
%------------------------------------------------------------------------------