TSTP Solution File: GRP614-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP614-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n005.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:13 EDT 2022
% Result : Unsatisfiable 0.71s 1.09s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 2
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 4 RR)
% Number of literals : 39 ( 0 equ; 3 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 : 79 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(inverse(double_divide(inverse(double_divide(A,inverse(B))),C)),double_divide(A,C)),B),
file('GRP614-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(multiply(A,multiply(inverse(B),C)),double_divide(C,A)),B),
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(multiply(inverse(b2),b2),a2),a2),
file('GRP614-1.p',unknown),
[] ).
cnf(7,plain,
equal(double_divide(multiply(double_divide(A,B),multiply(inverse(C),multiply(B,multiply(inverse(D),A)))),D),C),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(17,plain,
equal(multiply(A,multiply(double_divide(B,C),multiply(inverse(D),multiply(C,multiply(inverse(A),B))))),inverse(D)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,2]),1]),
[iquote('para(7,2),flip(1)')] ).
cnf(82,plain,
equal(double_divide(multiply(inverse(A),inverse(B)),B),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,7]),3]),
[iquote('para(17,7),demod([3])')] ).
cnf(84,plain,
equal(double_divide(multiply(inverse(A),multiply(B,C)),double_divide(C,B)),A),
inference(para,[status(thm),theory(equality)],[2,82]),
[iquote('para(2,82)')] ).
cnf(85,plain,
equal(multiply(A,multiply(inverse(B),inverse(A))),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[82,2]),1]),
[iquote('para(82,2),flip(1)')] ).
cnf(91,plain,
equal(double_divide(inverse(A),double_divide(inverse(B),B)),A),
inference(para,[status(thm),theory(equality)],[85,3]),
[iquote('para(85,3)')] ).
cnf(93,plain,
equal(double_divide(multiply(A,B),double_divide(inverse(C),C)),double_divide(B,A)),
inference(para,[status(thm),theory(equality)],[2,91]),
[iquote('para(2,91)')] ).
cnf(95,plain,
equal(double_divide(inverse(A),double_divide(inverse(inverse(B)),inverse(A))),B),
inference(para,[status(thm),theory(equality)],[85,84]),
[iquote('para(85,84)')] ).
cnf(109,plain,
equal(double_divide(multiply(A,inverse(A)),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[93,84]),
[iquote('para(93,84)')] ).
cnf(110,plain,
equal(multiply(inverse(A),multiply(B,inverse(B))),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[109,2]),1]),
[iquote('para(109,2),flip(1)')] ).
cnf(111,plain,
equal(double_divide(multiply(inverse(A),inverse(B)),A),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[109,3]),110]),
[iquote('para(109,3),demod([110])')] ).
cnf(112,plain,
equal(multiply(A,multiply(inverse(A),inverse(B))),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[111,2]),1]),
[iquote('para(111,2),flip(1)')] ).
cnf(114,plain,
equal(inverse(inverse(inverse(A))),inverse(A)),
inference(para,[status(thm),theory(equality)],[112,110]),
[iquote('para(112,110)')] ).
cnf(115,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[114,82]),82]),1]),
[iquote('para(114,82),demod([82]),flip(1)')] ).
cnf(125,plain,
equal(double_divide(inverse(A),double_divide(B,inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[95]),115]),
[iquote('back_demod(95),demod([115])')] ).
cnf(138,plain,
equal(double_divide(multiply(A,inverse(B)),B),inverse(A)),
inference(para,[status(thm),theory(equality)],[115,82]),
[iquote('para(115,82)')] ).
cnf(141,plain,
equal(double_divide(A,double_divide(inverse(B),B)),inverse(A)),
inference(para,[status(thm),theory(equality)],[115,91]),
[iquote('para(115,91)')] ).
cnf(142,plain,
equal(inverse(A),double_divide(A,double_divide(inverse(B),B))),
inference(flip,[status(thm),theory(equality)],[141]),
[iquote('flip(141)')] ).
cnf(145,plain,
equal(double_divide(A,double_divide(B,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[115,125]),115]),
[iquote('para(115,125),demod([115])')] ).
cnf(148,plain,
equal(inverse(A),multiply(double_divide(A,B),B)),
inference(para,[status(thm),theory(equality)],[145,2]),
[iquote('para(145,2)')] ).
cnf(149,plain,
equal(multiply(double_divide(A,B),B),inverse(A)),
inference(flip,[status(thm),theory(equality)],[148]),
[iquote('flip(148)')] ).
cnf(161,plain,
equal(multiply(A,multiply(B,inverse(A))),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[138,2]),115]),1]),
[iquote('para(138,2),demod([115]),flip(1)')] ).
cnf(177,plain,
~ equal(multiply(multiply(double_divide(b2,double_divide(inverse(A),A)),b2),a2),a2),
inference(para,[status(thm),theory(equality)],[142,4]),
[iquote('para(142,4)')] ).
cnf(188,plain,
equal(double_divide(inverse(A),B),multiply(inverse(B),A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[149,138]),2]),
[iquote('para(149,138),demod([2])')] ).
cnf(190,plain,
equal(multiply(inverse(A),inverse(B)),double_divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[115,188]),1]),
[iquote('para(115,188),flip(1)')] ).
cnf(195,plain,
equal(double_divide(double_divide(A,B),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[111]),190]),
[iquote('back_demod(111),demod([190])')] ).
cnf(199,plain,
equal(double_divide(double_divide(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[82]),190]),
[iquote('back_demod(82),demod([190])')] ).
cnf(213,plain,
equal(double_divide(A,double_divide(A,B)),B),
inference(para,[status(thm),theory(equality)],[145,195]),
[iquote('para(145,195)')] ).
cnf(214,plain,
equal(double_divide(A,B),double_divide(B,A)),
inference(para,[status(thm),theory(equality)],[199,195]),
[iquote('para(199,195)')] ).
cnf(223,plain,
equal(inverse(A),multiply(double_divide(B,A),B)),
inference(para,[status(thm),theory(equality)],[213,2]),
[iquote('para(213,2)')] ).
cnf(227,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[214,2]),2]),
[iquote('para(214,2),demod([2])')] ).
cnf(230,plain,
equal(multiply(multiply(A,inverse(B)),B),A),
inference(para,[status(thm),theory(equality)],[227,161]),
[iquote('para(227,161)')] ).
cnf(253,plain,
equal(multiply(double_divide(A,double_divide(B,C)),A),multiply(C,B)),
inference(para,[status(thm),theory(equality)],[223,2]),
[iquote('para(223,2)')] ).
cnf(254,plain,
~ equal(multiply(multiply(A,inverse(A)),a2),a2),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[177]),253]),
[iquote('back_demod(177),demod([253])')] ).
cnf(255,plain,
$false,
inference(conflict,[status(thm)],[254,230]),
[iquote('conflict(254,230)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GRP614-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n005.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 17:42:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.09 ----- EQP 0.9e, May 2009 -----
% 0.71/1.09 The job began on n005.cluster.edu, Mon Jun 13 17:42:39 2022
% 0.71/1.09 The command was "./eqp09e".
% 0.71/1.09
% 0.71/1.09 set(prolog_style_variables).
% 0.71/1.09 set(lrpo).
% 0.71/1.09 set(basic_paramod).
% 0.71/1.09 set(functional_subsume).
% 0.71/1.09 set(ordered_paramod).
% 0.71/1.09 set(prime_paramod).
% 0.71/1.09 set(para_pairs).
% 0.71/1.09 assign(pick_given_ratio,4).
% 0.71/1.09 clear(print_kept).
% 0.71/1.09 clear(print_new_demod).
% 0.71/1.09 clear(print_back_demod).
% 0.71/1.09 clear(print_given).
% 0.71/1.09 assign(max_mem,64000).
% 0.71/1.09 end_of_commands.
% 0.71/1.09
% 0.71/1.09 Usable:
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Sos:
% 0.71/1.09 0 (wt=-1) [] double_divide(inverse(double_divide(inverse(double_divide(A,inverse(B))),C)),double_divide(A,C)) = B.
% 0.71/1.09 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.71/1.09 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Demodulators:
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Passive:
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Starting to process input.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 1 (wt=14) [] double_divide(inverse(double_divide(inverse(double_divide(A,inverse(B))),C)),double_divide(A,C)) = B.
% 0.71/1.09 1 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.71/1.09 2 is a new demodulator.
% 0.71/1.09 -> 2 back demodulating 1.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(A,multiply(inverse(B),C)),double_divide(C,A)) = B.
% 0.71/1.09 3 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.71/1.09 ---------------- PROOF FOUND ----------------
% 0.71/1.09 % SZS status Unsatisfiable
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 After processing input:
% 0.71/1.09
% 0.71/1.09 Usable:
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Sos:
% 0.71/1.09 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.71/1.09 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.71/1.09 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(A,multiply(inverse(B),C)),double_divide(C,A)) = B.
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Demodulators:
% 0.71/1.09 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.71/1.09 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(A,multiply(inverse(B),C)),double_divide(C,A)) = B.
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Passive:
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 UNIT CONFLICT from 254 and 230 at 0.02 seconds.
% 0.71/1.09
% 0.71/1.09 ---------------- PROOF ----------------
% 0.71/1.09 % SZS output start Refutation
% See solution above
% 0.71/1.09 ------------ end of proof -------------
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 ------------- memory usage ------------
% 0.71/1.09 Memory dynamically allocated (tp_alloc): 488.
% 0.71/1.09 type (bytes each) gets frees in use avail bytes
% 0.71/1.09 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.71/1.09 term ( 16) 13661 9588 4073 19 78.9 K
% 0.71/1.09 gen_ptr ( 8) 20609 2896 17713 38 138.7 K
% 0.71/1.09 context ( 808) 13251 13249 2 2 3.2 K
% 0.71/1.09 trail ( 12) 1975 1975 0 8 0.1 K
% 0.71/1.09 bt_node ( 68) 6393 6391 2 19 1.4 K
% 0.71/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.09 ac_match_free_vars_pos (4020)
% 0.71/1.09 0 0 0 0 0.0 K
% 0.71/1.09 discrim ( 12) 3706 754 2952 8 34.7 K
% 0.71/1.09 flat ( 40) 28143 28143 0 29 1.1 K
% 0.71/1.09 discrim_pos ( 12) 374 374 0 1 0.0 K
% 0.71/1.09 fpa_head ( 12) 1263 0 1263 0 14.8 K
% 0.71/1.09 fpa_tree ( 28) 977 977 0 11 0.3 K
% 0.71/1.09 fpa_pos ( 36) 420 420 0 1 0.0 K
% 0.71/1.09 literal ( 12) 819 565 254 0 3.0 K
% 0.71/1.09 clause ( 24) 819 565 254 0 6.0 K
% 0.71/1.09 list ( 12) 225 168 57 3 0.7 K
% 0.71/1.09 list_pos ( 20) 1020 230 790 3 15.5 K
% 0.71/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.09
% 0.71/1.09 -------------- statistics -------------
% 0.71/1.09 Clauses input 3
% 0.71/1.09 Usable input 0
% 0.71/1.09 Sos input 3
% 0.71/1.09 Demodulators input 0
% 0.71/1.09 Passive input 0
% 0.71/1.09
% 0.71/1.09 Processed BS (before search) 4
% 0.71/1.09 Forward subsumed BS 0
% 0.71/1.09 Kept BS 4
% 0.71/1.09 New demodulators BS 3
% 0.71/1.09 Back demodulated BS 1
% 0.71/1.09
% 0.71/1.09 Clauses or pairs given 912
% 0.71/1.09 Clauses generated 514
% 0.71/1.09 Forward subsumed 264
% 0.71/1.09 Deleted by weight 0
% 0.71/1.09 Deleted by variable count 0
% 0.71/1.09 Kept 250
% 0.71/1.09 New demodulators 163
% 0.71/1.09 Back demodulated 45
% 0.71/1.09 Ordered paramod prunes 0
% 0.71/1.09 Basic paramod prunes 4096
% 0.71/1.09 Prime paramod prunes 9
% 0.71/1.09 Semantic prunes 0
% 0.71/1.09
% 0.71/1.09 Rewrite attmepts 4529
% 0.71/1.09 Rewrites 307
% 0.71/1.09
% 0.71/1.09 FPA overloads 0
% 0.71/1.09 FPA underloads 0
% 0.71/1.09
% 0.71/1.09 Usable size 0
% 0.71/1.09 Sos size 207
% 0.71/1.09 Demodulators size 123
% 0.71/1.09 Passive size 0
% 0.71/1.09 Disabled size 46
% 0.71/1.09
% 0.71/1.09 Proofs found 1
% 0.71/1.09
% 0.71/1.09 ----------- times (seconds) ----------- Mon Jun 13 17:42:39 2022
% 0.71/1.09
% 0.71/1.09 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.71/1.09 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.71/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.09 input time 0.00
% 0.71/1.09 paramodulation time 0.01
% 0.71/1.09 demodulation time 0.00
% 0.71/1.09 orient time 0.00
% 0.71/1.09 weigh time 0.00
% 0.71/1.09 forward subsume time 0.00
% 0.71/1.09 back demod find time 0.00
% 0.71/1.09 conflict time 0.00
% 0.71/1.09 LRPO time 0.00
% 0.71/1.09 store clause time 0.00
% 0.71/1.09 disable clause time 0.00
% 0.71/1.09 prime paramod time 0.00
% 0.71/1.09 semantics time 0.00
% 0.71/1.09
% 0.71/1.09 EQP interrupted
%------------------------------------------------------------------------------