TSTP Solution File: GRP613-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP613-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n006.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.70s 1.13s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 1
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 3 RR)
% Number of literals : 37 ( 0 equ; 2 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 : 74 ( 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('GRP613-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(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
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(83,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(85,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(91,plain,
equal(double_divide(inverse(A),double_divide(inverse(B),B)),A),
inference(para,[status(thm),theory(equality)],[83,3]),
[iquote('para(83,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)],[83,85]),
[iquote('para(83,85)')] ).
cnf(107,plain,
equal(double_divide(multiply(A,inverse(A)),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[93,85]),
[iquote('para(93,85)')] ).
cnf(108,plain,
equal(multiply(inverse(A),multiply(B,inverse(B))),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[107,2]),1]),
[iquote('para(107,2),flip(1)')] ).
cnf(110,plain,
equal(double_divide(multiply(inverse(A),inverse(B)),A),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[107,3]),108]),
[iquote('para(107,3),demod([108])')] ).
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)],[110,2]),1]),
[iquote('para(110,2),flip(1)')] ).
cnf(114,plain,
equal(inverse(inverse(inverse(A))),inverse(A)),
inference(para,[status(thm),theory(equality)],[112,108]),
[iquote('para(112,108)')] ).
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(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(185,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(187,plain,
equal(multiply(inverse(A),inverse(B)),double_divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[115,185]),1]),
[iquote('para(115,185),flip(1)')] ).
cnf(192,plain,
equal(double_divide(double_divide(A,B),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[110]),187]),
[iquote('back_demod(110),demod([187])')] ).
cnf(196,plain,
equal(double_divide(double_divide(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[82]),187]),
[iquote('back_demod(82),demod([187])')] ).
cnf(211,plain,
equal(double_divide(A,B),double_divide(B,A)),
inference(para,[status(thm),theory(equality)],[196,192]),
[iquote('para(196,192)')] ).
cnf(224,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[211,2]),2]),
[iquote('para(211,2),demod([2])')] ).
cnf(272,plain,
equal(double_divide(A,multiply(B,inverse(B))),inverse(A)),
inference(para,[status(thm),theory(equality)],[107,196]),
[iquote('para(107,196)')] ).
cnf(282,plain,
~ equal(multiply(b1,inverse(b1)),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[224,4]),
[iquote('para(224,4)')] ).
cnf(299,plain,
equal(multiply(multiply(A,inverse(A)),B),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[272,192]),2]),
[iquote('para(272,192),demod([2])')] ).
cnf(300,plain,
equal(multiply(multiply(inverse(A),A),B),B),
inference(para,[status(thm),theory(equality)],[115,299]),
[iquote('para(115,299)')] ).
cnf(301,plain,
equal(multiply(A,multiply(B,inverse(B))),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[299,224]),1]),
[iquote('para(299,224),flip(1)')] ).
cnf(316,plain,
equal(multiply(inverse(A),A),multiply(B,inverse(B))),
inference(para,[status(thm),theory(equality)],[301,300]),
[iquote('para(301,300)')] ).
cnf(317,plain,
equal(multiply(A,inverse(A)),multiply(inverse(B),B)),
inference(flip,[status(thm),theory(equality)],[316]),
[iquote('flip(316)')] ).
cnf(318,plain,
$false,
inference(conflict,[status(thm)],[317,282]),
[iquote('conflict(317,282)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP613-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 08:58:12 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.70/1.13 ----- EQP 0.9e, May 2009 -----
% 0.70/1.13 The job began on n006.cluster.edu, Mon Jun 13 08:58:12 2022
% 0.70/1.13 The command was "./eqp09e".
% 0.70/1.13
% 0.70/1.13 set(prolog_style_variables).
% 0.70/1.13 set(lrpo).
% 0.70/1.13 set(basic_paramod).
% 0.70/1.13 set(functional_subsume).
% 0.70/1.13 set(ordered_paramod).
% 0.70/1.13 set(prime_paramod).
% 0.70/1.13 set(para_pairs).
% 0.70/1.13 assign(pick_given_ratio,4).
% 0.70/1.13 clear(print_kept).
% 0.70/1.13 clear(print_new_demod).
% 0.70/1.13 clear(print_back_demod).
% 0.70/1.13 clear(print_given).
% 0.70/1.13 assign(max_mem,64000).
% 0.70/1.13 end_of_commands.
% 0.70/1.13
% 0.70/1.13 Usable:
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 Sos:
% 0.70/1.13 0 (wt=-1) [] double_divide(inverse(double_divide(inverse(double_divide(A,inverse(B))),C)),double_divide(A,C)) = B.
% 0.70/1.13 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.70/1.13 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 Demodulators:
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 Passive:
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 Starting to process input.
% 0.70/1.13
% 0.70/1.13 ** KEPT: 1 (wt=14) [] double_divide(inverse(double_divide(inverse(double_divide(A,inverse(B))),C)),double_divide(A,C)) = B.
% 0.70/1.13 1 is a new demodulator.
% 0.70/1.13
% 0.70/1.13 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.70/1.13 2 is a new demodulator.
% 0.70/1.13 -> 2 back demodulating 1.
% 0.70/1.13
% 0.70/1.13 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(A,multiply(inverse(B),C)),double_divide(C,A)) = B.
% 0.70/1.13 3 is a new demodulator.
% 0.70/1.13
% 0.70/1.13 ** KEPT: 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.70/1.13 ---------------- PROOF FOUND ----------------
% 0.70/1.13 % SZS status Unsatisfiable
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 After processing input:
% 0.70/1.13
% 0.70/1.13 Usable:
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 Sos:
% 0.70/1.13 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.70/1.13 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.70/1.13 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(A,multiply(inverse(B),C)),double_divide(C,A)) = B.
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 Demodulators:
% 0.70/1.13 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.70/1.13 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(A,multiply(inverse(B),C)),double_divide(C,A)) = B.
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 Passive:
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 UNIT CONFLICT from 317 and 282 at 0.02 seconds.
% 0.70/1.13
% 0.70/1.13 ---------------- PROOF ----------------
% 0.70/1.13 % SZS output start Refutation
% See solution above
% 0.70/1.13 ------------ end of proof -------------
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 ------------- memory usage ------------
% 0.70/1.13 Memory dynamically allocated (tp_alloc): 488.
% 0.70/1.13 type (bytes each) gets frees in use avail bytes
% 0.70/1.13 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.70/1.13 term ( 16) 18359 13658 4701 19 90.9 K
% 0.70/1.13 gen_ptr ( 8) 23345 3593 19752 36 154.6 K
% 0.70/1.13 context ( 808) 16880 16878 2 2 3.2 K
% 0.70/1.13 trail ( 12) 2237 2237 0 8 0.1 K
% 0.70/1.13 bt_node ( 68) 8378 8375 3 20 1.5 K
% 0.70/1.13 ac_position (285432) 0 0 0 0 0.0 K
% 0.70/1.13 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.70/1.13 ac_match_free_vars_pos (4020)
% 0.70/1.13 0 0 0 0 0.0 K
% 0.70/1.13 discrim ( 12) 4051 752 3299 0 38.7 K
% 0.70/1.13 flat ( 40) 37090 37090 0 31 1.2 K
% 0.70/1.13 discrim_pos ( 12) 584 584 0 1 0.0 K
% 0.70/1.13 fpa_head ( 12) 1252 0 1252 0 14.7 K
% 0.70/1.13 fpa_tree ( 28) 1024 1024 0 13 0.4 K
% 0.70/1.13 fpa_pos ( 36) 503 503 0 1 0.0 K
% 0.70/1.13 literal ( 12) 1200 883 317 1 3.7 K
% 0.70/1.13 clause ( 24) 1200 883 317 1 7.5 K
% 0.70/1.13 list ( 12) 245 189 56 4 0.7 K
% 0.70/1.13 list_pos ( 20) 1229 231 998 0 19.5 K
% 0.70/1.13 pair_index ( 40) 2 0 2 0 0.1 K
% 0.70/1.13
% 0.70/1.13 -------------- statistics -------------
% 0.70/1.13 Clauses input 3
% 0.70/1.13 Usable input 0
% 0.70/1.13 Sos input 3
% 0.70/1.13 Demodulators input 0
% 0.70/1.13 Passive input 0
% 0.70/1.13
% 0.70/1.13 Processed BS (before search) 4
% 0.70/1.13 Forward subsumed BS 0
% 0.70/1.13 Kept BS 4
% 0.70/1.13 New demodulators BS 3
% 0.70/1.13 Back demodulated BS 1
% 0.70/1.13
% 0.70/1.13 Clauses or pairs given 1413
% 0.70/1.13 Clauses generated 742
% 0.70/1.13 Forward subsumed 429
% 0.70/1.13 Deleted by weight 0
% 0.70/1.13 Deleted by variable count 0
% 0.70/1.13 Kept 313
% 0.70/1.13 New demodulators 183
% 0.70/1.13 Back demodulated 45
% 0.70/1.13 Ordered paramod prunes 0
% 0.70/1.13 Basic paramod prunes 6299
% 0.70/1.13 Prime paramod prunes 33
% 0.70/1.13 Semantic prunes 0
% 0.70/1.13
% 0.70/1.13 Rewrite attmepts 5960
% 0.70/1.13 Rewrites 410
% 0.70/1.13
% 0.70/1.13 FPA overloads 0
% 0.70/1.13 FPA underloads 0
% 0.70/1.13
% 0.70/1.13 Usable size 0
% 0.70/1.13 Sos size 270
% 0.70/1.13 Demodulators size 142
% 0.70/1.13 Passive size 0
% 0.70/1.13 Disabled size 46
% 0.70/1.13
% 0.70/1.13 Proofs found 1
% 0.70/1.13
% 0.70/1.13 ----------- times (seconds) ----------- Mon Jun 13 08:58:12 2022
% 0.70/1.13
% 0.70/1.13 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.70/1.13 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.70/1.13 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.70/1.13 input time 0.00
% 0.70/1.13 paramodulation time 0.01
% 0.70/1.13 demodulation time 0.00
% 0.70/1.13 orient time 0.00
% 0.70/1.13 weigh time 0.00
% 0.70/1.13 forward subsume time 0.00
% 0.70/1.13 back demod find time 0.00
% 0.70/1.13 conflict time 0.00
% 0.70/1.13 LRPO time 0.00
% 0.70/1.13 store clause time 0.00
% 0.70/1.13 disable clause time 0.00
% 0.70/1.13 prime paramod time 0.00
% 0.70/1.13 semantics time 0.00
% 0.70/1.13
% 0.70/1.13 EQP interrupted
%------------------------------------------------------------------------------