TSTP Solution File: GRP588-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP588-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n027.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:06 EDT 2022
% Result : Unsatisfiable 0.79s 1.19s
% Output : Refutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% 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 : 7 ( 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 : 104 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(A,B),inverse(C))),B))),C),
file('GRP588-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(double_divide(A,multiply(B,multiply(inverse(C),double_divide(A,B)))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),2,2]),
[iquote('back_demod(1),demod([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(multiply(A,multiply(inverse(B),double_divide(C,A))),C),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,2]),1]),
[iquote('para(3,2),flip(1)')] ).
cnf(6,plain,
equal(double_divide(A,multiply(B,multiply(multiply(C,D),double_divide(A,B)))),double_divide(D,C)),
inference(para,[status(thm),theory(equality)],[2,3]),
[iquote('para(2,3)')] ).
cnf(8,plain,
equal(double_divide(A,multiply(multiply(B,multiply(inverse(C),double_divide(A,B))),multiply(inverse(D),C))),D),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(12,plain,
equal(double_divide(A,multiply(B,inverse(C))),double_divide(multiply(inverse(C),double_divide(double_divide(A,B),D)),D)),
inference(para,[status(thm),theory(equality)],[5,6]),
[iquote('para(5,6)')] ).
cnf(14,plain,
equal(multiply(A,multiply(inverse(B),double_divide(double_divide(C,D),A))),multiply(multiply(D,inverse(B)),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,2]),2]),
[iquote('para(12,2),demod([2])')] ).
cnf(24,plain,
equal(double_divide(multiply(inverse(A),B),inverse(B)),A),
inference(para,[status(thm),theory(equality)],[5,8]),
[iquote('para(5,8)')] ).
cnf(26,plain,
equal(multiply(inverse(A),multiply(inverse(B),A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[24,2]),1]),
[iquote('para(24,2),flip(1)')] ).
cnf(29,plain,
equal(double_divide(multiply(inverse(A),B),multiply(inverse(B),multiply(inverse(C),A))),C),
inference(para,[status(thm),theory(equality)],[24,3]),
[iquote('para(24,3)')] ).
cnf(45,plain,
equal(double_divide(multiply(inverse(A),A),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[26,29]),
[iquote('para(26,29)')] ).
cnf(46,plain,
equal(multiply(inverse(A),multiply(inverse(B),B)),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[45,2]),1]),
[iquote('para(45,2),flip(1)')] ).
cnf(47,plain,
equal(double_divide(multiply(inverse(A),A),multiply(B,C)),double_divide(C,B)),
inference(para,[status(thm),theory(equality)],[2,45]),
[iquote('para(2,45)')] ).
cnf(50,plain,
equal(multiply(multiply(A,B),multiply(inverse(C),C)),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[47,2]),2]),1]),
[iquote('para(47,2),demod([2]),flip(1)')] ).
cnf(279,plain,
equal(multiply(A,multiply(inverse(B),double_divide(C,A))),multiply(inverse(C),inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[45,14]),50]),
[iquote('para(45,14),demod([50])')] ).
cnf(280,plain,
equal(multiply(inverse(A),inverse(B)),multiply(C,multiply(inverse(B),double_divide(A,C)))),
inference(flip,[status(thm),theory(equality)],[279]),
[iquote('flip(279)')] ).
cnf(285,plain,
equal(multiply(multiply(A,B),inverse(C)),multiply(D,multiply(inverse(C),double_divide(double_divide(B,A),D)))),
inference(para,[status(thm),theory(equality)],[2,280]),
[iquote('para(2,280)')] ).
cnf(286,plain,
equal(multiply(A,multiply(inverse(B),double_divide(double_divide(C,D),A))),multiply(multiply(D,C),inverse(B))),
inference(flip,[status(thm),theory(equality)],[285]),
[iquote('flip(285)')] ).
cnf(289,plain,
equal(multiply(inverse(multiply(inverse(A),A)),inverse(B)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[45,279]),26]),1]),
[iquote('para(45,279),demod([26]),flip(1)')] ).
cnf(290,plain,
equal(multiply(inverse(multiply(inverse(A),A)),multiply(B,C)),multiply(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,289]),2]),
[iquote('para(2,289),demod([2])')] ).
cnf(296,plain,
equal(double_divide(inverse(A),inverse(multiply(inverse(B),B))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[289,47]),45]),1]),
[iquote('para(289,47),demod([45]),flip(1)')] ).
cnf(305,plain,
equal(double_divide(inverse(A),multiply(inverse(B),A)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[296,3]),290]),
[iquote('para(296,3),demod([290])')] ).
cnf(309,plain,
equal(double_divide(inverse(multiply(inverse(A),B)),inverse(A)),B),
inference(para,[status(thm),theory(equality)],[26,305]),
[iquote('para(26,305)')] ).
cnf(320,plain,
equal(double_divide(inverse(inverse(A)),inverse(A)),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[289,305]),
[iquote('para(289,305)')] ).
cnf(322,plain,
equal(inverse(multiply(inverse(A),A)),multiply(inverse(B),inverse(inverse(B)))),
inference(para,[status(thm),theory(equality)],[320,2]),
[iquote('para(320,2)')] ).
cnf(358,plain,
equal(double_divide(inverse(A),multiply(inverse(B),inverse(inverse(B)))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[322,24]),46]),
[iquote('para(322,24),demod([46])')] ).
cnf(362,plain,
equal(inverse(inverse(A)),A),
inference(para,[status(thm),theory(equality)],[358,305]),
[iquote('para(358,305)')] ).
cnf(375,plain,
equal(double_divide(multiply(inverse(A),inverse(B)),B),A),
inference(para,[status(thm),theory(equality)],[362,24]),
[iquote('para(362,24)')] ).
cnf(378,plain,
equal(double_divide(inverse(A),multiply(B,A)),inverse(B)),
inference(para,[status(thm),theory(equality)],[362,305]),
[iquote('para(362,305)')] ).
cnf(386,plain,
equal(double_divide(inverse(multiply(A,B)),A),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[362,309]),362]),
[iquote('para(362,309),demod([362])')] ).
cnf(391,plain,
equal(multiply(A,inverse(multiply(A,B))),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[386,2]),1]),
[iquote('para(386,2),flip(1)')] ).
cnf(420,plain,
equal(multiply(multiply(A,B),inverse(B)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[378,2]),362]),1]),
[iquote('para(378,2),demod([362]),flip(1)')] ).
cnf(445,plain,
equal(inverse(multiply(A,B)),double_divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[420,378]),362]),1]),
[iquote('para(420,378),demod([362]),flip(1)')] ).
cnf(453,plain,
equal(multiply(A,double_divide(B,A)),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[391]),445]),
[iquote('back_demod(391),demod([445])')] ).
cnf(459,plain,
equal(double_divide(double_divide(A,B),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[386]),445]),
[iquote('back_demod(386),demod([445])')] ).
cnf(509,plain,
equal(multiply(inverse(A),inverse(B)),double_divide(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[375,459]),1]),
[iquote('para(375,459),flip(1)')] ).
cnf(514,plain,
equal(multiply(A,multiply(inverse(B),double_divide(C,A))),double_divide(C,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[280]),509]),1]),
[iquote('back_demod(280),demod([509]),flip(1)')] ).
cnf(557,plain,
equal(multiply(multiply(A,B),inverse(C)),double_divide(double_divide(B,A),C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[286]),514]),1]),
[iquote('back_demod(286),demod([514]),flip(1)')] ).
cnf(567,plain,
equal(double_divide(double_divide(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[420]),557]),
[iquote('back_demod(420),demod([557])')] ).
cnf(707,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[567,453]),2]),
[iquote('para(567,453),demod([2])')] ).
cnf(708,plain,
$false,
inference(conflict,[status(thm)],[707,4]),
[iquote('conflict(707,4)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP588-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.08/0.14 % Command : tptp2X_and_run_eqp %s
% 0.15/0.35 % Computer : n027.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jun 13 22:55:17 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.79/1.19 ----- EQP 0.9e, May 2009 -----
% 0.79/1.19 The job began on n027.cluster.edu, Mon Jun 13 22:55:18 2022
% 0.79/1.19 The command was "./eqp09e".
% 0.79/1.19
% 0.79/1.19 set(prolog_style_variables).
% 0.79/1.19 set(lrpo).
% 0.79/1.19 set(basic_paramod).
% 0.79/1.19 set(functional_subsume).
% 0.79/1.19 set(ordered_paramod).
% 0.79/1.19 set(prime_paramod).
% 0.79/1.19 set(para_pairs).
% 0.79/1.19 assign(pick_given_ratio,4).
% 0.79/1.19 clear(print_kept).
% 0.79/1.19 clear(print_new_demod).
% 0.79/1.19 clear(print_back_demod).
% 0.79/1.19 clear(print_given).
% 0.79/1.19 assign(max_mem,64000).
% 0.79/1.19 end_of_commands.
% 0.79/1.19
% 0.79/1.19 Usable:
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 Sos:
% 0.79/1.19 0 (wt=-1) [] double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(A,B),inverse(C))),B))) = C.
% 0.79/1.19 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.79/1.19 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 Demodulators:
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 Passive:
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 Starting to process input.
% 0.79/1.19
% 0.79/1.19 ** KEPT: 1 (wt=14) [] double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(A,B),inverse(C))),B))) = C.
% 0.79/1.19 1 is a new demodulator.
% 0.79/1.19
% 0.79/1.19 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.79/1.19 2 is a new demodulator.
% 0.79/1.19 -> 2 back demodulating 1.
% 0.79/1.19
% 0.79/1.19 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(A,multiply(B,multiply(inverse(C),double_divide(A,B)))) = C.
% 0.79/1.19 3 is a new demodulator.
% 0.79/1.19
% 0.79/1.19 ** KEPT: 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.79/1.19 ---------------- PROOF FOUND ----------------
% 0.79/1.19 % SZS status Unsatisfiable
% 0.79/1.19
% 0.79/1.19
% 0.79/1.19 After processing input:
% 0.79/1.19
% 0.79/1.19 Usable:
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 Sos:
% 0.79/1.19 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.79/1.19 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.79/1.19 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(A,multiply(B,multiply(inverse(C),double_divide(A,B)))) = C.
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 Demodulators:
% 0.79/1.19 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.79/1.19 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(A,multiply(B,multiply(inverse(C),double_divide(A,B)))) = C.
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 Passive:
% 0.79/1.19 end_of_list.
% 0.79/1.19
% 0.79/1.19 UNIT CONFLICT from 707 and 4 at 0.05 seconds.
% 0.79/1.19
% 0.79/1.19 ---------------- PROOF ----------------
% 0.79/1.19 % SZS output start Refutation
% See solution above
% 0.79/1.19 ------------ end of proof -------------
% 0.79/1.19
% 0.79/1.19
% 0.79/1.19 ------------- memory usage ------------
% 0.79/1.19 Memory dynamically allocated (tp_alloc): 1464.
% 0.79/1.19 type (bytes each) gets frees in use avail bytes
% 0.79/1.19 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.79/1.19 term ( 16) 38600 24175 14425 20 279.4 K
% 0.79/1.19 gen_ptr ( 8) 75268 12443 62825 42 491.1 K
% 0.79/1.19 context ( 808) 27840 27838 2 3 3.9 K
% 0.79/1.19 trail ( 12) 5232 5232 0 8 0.1 K
% 0.79/1.19 bt_node ( 68) 7595 7592 3 17 1.3 K
% 0.79/1.19 ac_position (285432) 0 0 0 0 0.0 K
% 0.79/1.19 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.79/1.19 ac_match_free_vars_pos (4020)
% 0.79/1.19 0 0 0 0 0.0 K
% 0.79/1.19 discrim ( 12) 10379 4650 5729 963 78.4 K
% 0.79/1.19 flat ( 40) 103628 103628 0 35 1.4 K
% 0.79/1.19 discrim_pos ( 12) 1113 1113 0 1 0.0 K
% 0.79/1.19 fpa_head ( 12) 2599 0 2599 0 30.5 K
% 0.79/1.19 fpa_tree ( 28) 1942 1942 0 21 0.6 K
% 0.79/1.19 fpa_pos ( 36) 1017 1017 0 1 0.0 K
% 0.79/1.19 literal ( 12) 2399 1692 707 1 8.3 K
% 0.79/1.19 clause ( 24) 2399 1692 707 1 16.6 K
% 0.79/1.19 list ( 12) 369 313 56 5 0.7 K
% 0.79/1.19 list_pos ( 20) 3121 1467 1654 89 34.0 K
% 0.79/1.19 pair_index ( 40) 2 0 2 0 0.1 K
% 0.79/1.19
% 0.79/1.19 -------------- statistics -------------
% 0.79/1.19 Clauses input 3
% 0.79/1.19 Usable input 0
% 0.79/1.19 Sos input 3
% 0.79/1.19 Demodulators input 0
% 0.79/1.19 Passive input 0
% 0.79/1.19
% 0.79/1.19 Processed BS (before search) 4
% 0.79/1.19 Forward subsumed BS 0
% 0.79/1.19 Kept BS 4
% 0.79/1.19 New demodulators BS 3
% 0.79/1.19 Back demodulated BS 1
% 0.79/1.19
% 0.79/1.19 Clauses or pairs given 1437
% 0.79/1.19 Clauses generated 1329
% 0.79/1.19 Forward subsumed 626
% 0.79/1.19 Deleted by weight 0
% 0.79/1.19 Deleted by variable count 0
% 0.79/1.19 Kept 703
% 0.79/1.19 New demodulators 307
% 0.79/1.19 Back demodulated 321
% 0.79/1.19 Ordered paramod prunes 0
% 0.79/1.19 Basic paramod prunes 6747
% 0.79/1.19 Prime paramod prunes 10
% 0.79/1.19 Semantic prunes 0
% 0.79/1.19
% 0.79/1.19 Rewrite attmepts 15089
% 0.79/1.19 Rewrites 745
% 0.79/1.19
% 0.79/1.19 FPA overloads 0
% 0.79/1.19 FPA underloads 0
% 0.79/1.19
% 0.79/1.19 Usable size 0
% 0.79/1.19 Sos size 384
% 0.79/1.19 Demodulators size 180
% 0.79/1.19 Passive size 0
% 0.79/1.19 Disabled size 322
% 0.79/1.19
% 0.79/1.19 Proofs found 1
% 0.79/1.19
% 0.79/1.19 ----------- times (seconds) ----------- Mon Jun 13 22:55:18 2022
% 0.79/1.19
% 0.79/1.19 user CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.79/1.19 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.79/1.19 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.79/1.19 input time 0.00
% 0.79/1.19 paramodulation time 0.01
% 0.79/1.19 demodulation time 0.01
% 0.79/1.19 orient time 0.01
% 0.79/1.19 weigh time 0.00
% 0.79/1.19 forward subsume time 0.00
% 0.79/1.19 back demod find time 0.00
% 0.79/1.19 conflict time 0.00
% 0.79/1.19 LRPO time 0.00
% 0.79/1.19 store clause time 0.01
% 0.79/1.19 disable clause time 0.00
% 0.79/1.19 prime paramod time 0.00
% 0.79/1.19 semantics time 0.00
% 0.79/1.19
% 0.79/1.19 EQP interrupted
%------------------------------------------------------------------------------