TSTP Solution File: GRP600-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP600-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n032.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:09 EDT 2022
% Result : Unsatisfiable 0.54s 0.93s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 1
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 2 RR)
% Number of literals : 30 ( 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 : 62 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(inverse(C),B))))),C),
file('GRP600-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(double_divide(A,B),multiply(multiply(B,inverse(C)),A)),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(8,plain,
equal(double_divide(A,multiply(multiply(multiply(multiply(B,inverse(A)),C),inverse(D)),double_divide(C,B))),D),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(15,plain,
equal(multiply(multiply(multiply(multiply(multiply(A,inverse(B)),C),inverse(D)),double_divide(C,A)),B),inverse(D)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,2]),1]),
[iquote('para(8,2),flip(1)')] ).
cnf(73,plain,
equal(double_divide(A,multiply(inverse(A),inverse(B))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,8]),3]),
[iquote('para(15,8),demod([3])')] ).
cnf(74,plain,
equal(double_divide(double_divide(A,B),multiply(multiply(B,A),inverse(C))),C),
inference(para,[status(thm),theory(equality)],[2,73]),
[iquote('para(2,73)')] ).
cnf(76,plain,
equal(multiply(multiply(inverse(A),inverse(B)),A),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[73,2]),1]),
[iquote('para(73,2),flip(1)')] ).
cnf(82,plain,
equal(double_divide(double_divide(A,inverse(A)),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[76,3]),
[iquote('para(76,3)')] ).
cnf(84,plain,
equal(double_divide(double_divide(A,inverse(A)),multiply(B,C)),double_divide(C,B)),
inference(para,[status(thm),theory(equality)],[2,82]),
[iquote('para(2,82)')] ).
cnf(86,plain,
equal(double_divide(double_divide(inverse(A),inverse(inverse(B))),inverse(A)),B),
inference(para,[status(thm),theory(equality)],[76,74]),
[iquote('para(76,74)')] ).
cnf(98,plain,
equal(double_divide(inverse(A),multiply(inverse(B),B)),A),
inference(para,[status(thm),theory(equality)],[84,74]),
[iquote('para(84,74)')] ).
cnf(99,plain,
equal(multiply(multiply(inverse(A),A),inverse(B)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[98,2]),1]),
[iquote('para(98,2),flip(1)')] ).
cnf(102,plain,
equal(double_divide(A,multiply(inverse(B),inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[98,3]),99]),
[iquote('para(98,3),demod([99])')] ).
cnf(103,plain,
equal(multiply(multiply(inverse(A),inverse(B)),B),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[102,2]),1]),
[iquote('para(102,2),flip(1)')] ).
cnf(105,plain,
equal(inverse(inverse(inverse(A))),inverse(A)),
inference(para,[status(thm),theory(equality)],[103,99]),
[iquote('para(103,99)')] ).
cnf(107,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[105,73]),73]),1]),
[iquote('para(105,73),demod([73]),flip(1)')] ).
cnf(117,plain,
equal(double_divide(double_divide(inverse(A),B),inverse(A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[86]),107]),
[iquote('back_demod(86),demod([107])')] ).
cnf(126,plain,
equal(double_divide(A,multiply(inverse(A),B)),inverse(B)),
inference(para,[status(thm),theory(equality)],[107,73]),
[iquote('para(107,73)')] ).
cnf(132,plain,
equal(double_divide(double_divide(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[107,117]),107]),
[iquote('para(107,117),demod([107])')] ).
cnf(135,plain,
equal(inverse(A),multiply(B,double_divide(B,A))),
inference(para,[status(thm),theory(equality)],[132,2]),
[iquote('para(132,2)')] ).
cnf(136,plain,
equal(multiply(A,double_divide(A,B)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[135]),
[iquote('flip(135)')] ).
cnf(170,plain,
equal(double_divide(A,inverse(B)),multiply(B,inverse(A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[136,126]),2]),
[iquote('para(136,126),demod([2])')] ).
cnf(172,plain,
equal(multiply(inverse(A),inverse(B)),double_divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[107,170]),1]),
[iquote('para(107,170),flip(1)')] ).
cnf(175,plain,
equal(double_divide(A,double_divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[102]),172]),
[iquote('back_demod(102),demod([172])')] ).
cnf(179,plain,
equal(double_divide(A,double_divide(B,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[73]),172]),
[iquote('back_demod(73),demod([172])')] ).
cnf(196,plain,
equal(double_divide(A,B),double_divide(B,A)),
inference(para,[status(thm),theory(equality)],[179,175]),
[iquote('para(179,175)')] ).
cnf(207,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[196,2]),2]),
[iquote('para(196,2),demod([2])')] ).
cnf(208,plain,
$false,
inference(conflict,[status(thm)],[207,4]),
[iquote('conflict(207,4)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP600-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.11/0.11 % Command : tptp2X_and_run_eqp %s
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Mon Jun 13 10:47:26 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.54/0.93 ----- EQP 0.9e, May 2009 -----
% 0.54/0.93 The job began on n032.cluster.edu, Mon Jun 13 10:47:27 2022
% 0.54/0.93 The command was "./eqp09e".
% 0.54/0.93
% 0.54/0.93 set(prolog_style_variables).
% 0.54/0.93 set(lrpo).
% 0.54/0.93 set(basic_paramod).
% 0.54/0.93 set(functional_subsume).
% 0.54/0.93 set(ordered_paramod).
% 0.54/0.93 set(prime_paramod).
% 0.54/0.93 set(para_pairs).
% 0.54/0.93 assign(pick_given_ratio,4).
% 0.54/0.93 clear(print_kept).
% 0.54/0.93 clear(print_new_demod).
% 0.54/0.93 clear(print_back_demod).
% 0.54/0.93 clear(print_given).
% 0.54/0.93 assign(max_mem,64000).
% 0.54/0.93 end_of_commands.
% 0.54/0.93
% 0.54/0.93 Usable:
% 0.54/0.93 end_of_list.
% 0.54/0.93
% 0.54/0.93 Sos:
% 0.54/0.93 0 (wt=-1) [] double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(inverse(C),B))))) = C.
% 0.54/0.93 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.54/0.93 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.54/0.93 end_of_list.
% 0.54/0.93
% 0.54/0.93 Demodulators:
% 0.54/0.93 end_of_list.
% 0.54/0.93
% 0.54/0.93 Passive:
% 0.54/0.93 end_of_list.
% 0.54/0.93
% 0.54/0.93 Starting to process input.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 1 (wt=14) [] double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(inverse(C),B))))) = C.
% 0.54/0.93 1 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.54/0.93 2 is a new demodulator.
% 0.54/0.93 -> 2 back demodulating 1.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(double_divide(A,B),multiply(multiply(B,inverse(C)),A)) = C.
% 0.54/0.93 3 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.54/0.93 ---------------- PROOF FOUND ----------------
% 0.54/0.93 % SZS status Unsatisfiable
% 0.54/0.93
% 0.54/0.93
% 0.54/0.93 After processing input:
% 0.54/0.93
% 0.54/0.93 Usable:
% 0.54/0.93 end_of_list.
% 0.54/0.93
% 0.54/0.93 Sos:
% 0.54/0.93 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.54/0.93 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.54/0.93 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(double_divide(A,B),multiply(multiply(B,inverse(C)),A)) = C.
% 0.54/0.93 end_of_list.
% 0.54/0.93
% 0.54/0.93 Demodulators:
% 0.54/0.93 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.54/0.93 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(double_divide(A,B),multiply(multiply(B,inverse(C)),A)) = C.
% 0.54/0.93 end_of_list.
% 0.54/0.93
% 0.54/0.93 Passive:
% 0.54/0.93 end_of_list.
% 0.54/0.93
% 0.54/0.93 UNIT CONFLICT from 207 and 4 at 0.01 seconds.
% 0.54/0.93
% 0.54/0.93 ---------------- PROOF ----------------
% 0.54/0.93 % SZS output start Refutation
% See solution above
% 0.54/0.93 ------------ end of proof -------------
% 0.54/0.93
% 0.54/0.93
% 0.54/0.93 ------------- memory usage ------------
% 0.54/0.93 Memory dynamically allocated (tp_alloc): 488.
% 0.54/0.93 type (bytes each) gets frees in use avail bytes
% 0.54/0.93 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.54/0.93 term ( 16) 11418 8131 3287 19 63.8 K
% 0.54/0.93 gen_ptr ( 8) 16636 2511 14125 29 110.6 K
% 0.54/0.93 context ( 808) 10211 10209 2 2 3.2 K
% 0.54/0.93 trail ( 12) 1653 1653 0 8 0.1 K
% 0.54/0.93 bt_node ( 68) 4775 4772 3 16 1.3 K
% 0.54/0.93 ac_position (285432) 0 0 0 0 0.0 K
% 0.54/0.93 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.54/0.93 ac_match_free_vars_pos (4020)
% 0.54/0.93 0 0 0 0 0.0 K
% 0.54/0.93 discrim ( 12) 3100 733 2367 0 27.7 K
% 0.54/0.93 flat ( 40) 23125 23125 0 29 1.1 K
% 0.54/0.93 discrim_pos ( 12) 322 322 0 1 0.0 K
% 0.54/0.93 fpa_head ( 12) 1052 0 1052 0 12.3 K
% 0.54/0.93 fpa_tree ( 28) 785 785 0 11 0.3 K
% 0.54/0.93 fpa_pos ( 36) 352 352 0 1 0.0 K
% 0.54/0.93 literal ( 12) 678 471 207 1 2.4 K
% 0.54/0.93 clause ( 24) 678 471 207 1 4.9 K
% 0.54/0.93 list ( 12) 204 148 56 4 0.7 K
% 0.54/0.93 list_pos ( 20) 848 208 640 0 12.5 K
% 0.54/0.93 pair_index ( 40) 2 0 2 0 0.1 K
% 0.54/0.93
% 0.54/0.93 -------------- statistics -------------
% 0.54/0.93 Clauses input 3
% 0.54/0.93 Usable input 0
% 0.54/0.93 Sos input 3
% 0.54/0.93 Demodulators input 0
% 0.54/0.93 Passive input 0
% 0.54/0.93
% 0.54/0.93 Processed BS (before search) 4
% 0.54/0.93 Forward subsumed BS 0
% 0.54/0.93 Kept BS 4
% 0.54/0.93 New demodulators BS 3
% 0.54/0.93 Back demodulated BS 1
% 0.54/0.93
% 0.54/0.93 Clauses or pairs given 699
% 0.54/0.93 Clauses generated 426
% 0.54/0.93 Forward subsumed 223
% 0.54/0.93 Deleted by weight 0
% 0.54/0.93 Deleted by variable count 0
% 0.54/0.93 Kept 203
% 0.54/0.93 New demodulators 142
% 0.54/0.93 Back demodulated 40
% 0.54/0.93 Ordered paramod prunes 0
% 0.54/0.93 Basic paramod prunes 3079
% 0.54/0.93 Prime paramod prunes 7
% 0.54/0.93 Semantic prunes 0
% 0.54/0.93
% 0.54/0.93 Rewrite attmepts 3731
% 0.54/0.93 Rewrites 274
% 0.54/0.93
% 0.54/0.93 FPA overloads 0
% 0.54/0.93 FPA underloads 0
% 0.54/0.93
% 0.54/0.93 Usable size 0
% 0.54/0.93 Sos size 165
% 0.54/0.93 Demodulators size 104
% 0.54/0.93 Passive size 0
% 0.54/0.93 Disabled size 41
% 0.54/0.93
% 0.54/0.93 Proofs found 1
% 0.54/0.93
% 0.54/0.93 ----------- times (seconds) ----------- Mon Jun 13 10:47:27 2022
% 0.54/0.93
% 0.54/0.93 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.54/0.93 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.54/0.93 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.54/0.93 input time 0.00
% 0.54/0.93 paramodulation time 0.00
% 0.54/0.93 demodulation time 0.00
% 0.54/0.93 orient time 0.00
% 0.54/0.93 weigh time 0.00
% 0.54/0.93 forward subsume time 0.00
% 0.54/0.93 back demod find time 0.00
% 0.54/0.93 conflict time 0.00
% 0.54/0.93 LRPO time 0.00
% 0.54/0.93 store clause time 0.00
% 0.54/0.93 disable clause time 0.00
% 0.54/0.93 prime paramod time 0.00
% 0.54/0.93 semantics time 0.00
% 0.54/0.93
% 0.54/0.93 EQP interrupted
%------------------------------------------------------------------------------