TSTP Solution File: GRP616-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP616-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n022.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:14 EDT 2022
% Result : Unsatisfiable 0.69s 1.12s
% Output : Refutation 0.69s
% 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(inverse(double_divide(inverse(double_divide(A,inverse(B))),C)),double_divide(A,C)),B),
file('GRP616-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(b,a),multiply(a,b)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,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(15,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)],[8,2]),1]),
[iquote('para(8,2),flip(1)')] ).
cnf(73,plain,
equal(double_divide(multiply(inverse(A),inverse(B)),B),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,8]),3]),
[iquote('para(15,8),demod([3])')] ).
cnf(75,plain,
equal(double_divide(multiply(inverse(A),multiply(B,C)),double_divide(C,B)),A),
inference(para,[status(thm),theory(equality)],[2,73]),
[iquote('para(2,73)')] ).
cnf(76,plain,
equal(multiply(A,multiply(inverse(B),inverse(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(inverse(A),double_divide(inverse(B),B)),A),
inference(para,[status(thm),theory(equality)],[76,3]),
[iquote('para(76,3)')] ).
cnf(84,plain,
equal(double_divide(multiply(A,B),double_divide(inverse(C),C)),double_divide(B,A)),
inference(para,[status(thm),theory(equality)],[2,82]),
[iquote('para(2,82)')] ).
cnf(86,plain,
equal(double_divide(inverse(A),double_divide(inverse(inverse(B)),inverse(A))),B),
inference(para,[status(thm),theory(equality)],[76,75]),
[iquote('para(76,75)')] ).
cnf(98,plain,
equal(double_divide(multiply(A,inverse(A)),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[84,75]),
[iquote('para(84,75)')] ).
cnf(99,plain,
equal(multiply(inverse(A),multiply(B,inverse(B))),inverse(A)),
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(multiply(inverse(A),inverse(B)),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(A,multiply(inverse(A),inverse(B))),inverse(B)),
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(106,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(116,plain,
equal(double_divide(inverse(A),double_divide(B,inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[86]),106]),
[iquote('back_demod(86),demod([106])')] ).
cnf(124,plain,
equal(double_divide(multiply(A,inverse(B)),B),inverse(A)),
inference(para,[status(thm),theory(equality)],[106,73]),
[iquote('para(106,73)')] ).
cnf(131,plain,
equal(double_divide(A,double_divide(B,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[106,116]),106]),
[iquote('para(106,116),demod([106])')] ).
cnf(134,plain,
equal(inverse(A),multiply(double_divide(A,B),B)),
inference(para,[status(thm),theory(equality)],[131,2]),
[iquote('para(131,2)')] ).
cnf(135,plain,
equal(multiply(double_divide(A,B),B),inverse(A)),
inference(flip,[status(thm),theory(equality)],[134]),
[iquote('flip(134)')] ).
cnf(167,plain,
equal(double_divide(inverse(A),B),multiply(inverse(B),A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[135,124]),2]),
[iquote('para(135,124),demod([2])')] ).
cnf(169,plain,
equal(multiply(inverse(A),inverse(B)),double_divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[106,167]),1]),
[iquote('para(106,167),flip(1)')] ).
cnf(172,plain,
equal(double_divide(double_divide(A,B),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[102]),169]),
[iquote('back_demod(102),demod([169])')] ).
cnf(176,plain,
equal(double_divide(double_divide(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[73]),169]),
[iquote('back_demod(73),demod([169])')] ).
cnf(192,plain,
equal(double_divide(A,B),double_divide(B,A)),
inference(para,[status(thm),theory(equality)],[176,172]),
[iquote('para(176,172)')] ).
cnf(204,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[192,2]),2]),
[iquote('para(192,2),demod([2])')] ).
cnf(205,plain,
$false,
inference(conflict,[status(thm)],[204,4]),
[iquote('conflict(204,4)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP616-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.12/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n022.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 : Tue Jun 14 06:13:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.69/1.12 ----- EQP 0.9e, May 2009 -----
% 0.69/1.12 The job began on n022.cluster.edu, Tue Jun 14 06:13:34 2022
% 0.69/1.12 The command was "./eqp09e".
% 0.69/1.12
% 0.69/1.12 set(prolog_style_variables).
% 0.69/1.12 set(lrpo).
% 0.69/1.12 set(basic_paramod).
% 0.69/1.12 set(functional_subsume).
% 0.69/1.12 set(ordered_paramod).
% 0.69/1.12 set(prime_paramod).
% 0.69/1.12 set(para_pairs).
% 0.69/1.12 assign(pick_given_ratio,4).
% 0.69/1.12 clear(print_kept).
% 0.69/1.12 clear(print_new_demod).
% 0.69/1.12 clear(print_back_demod).
% 0.69/1.12 clear(print_given).
% 0.69/1.12 assign(max_mem,64000).
% 0.69/1.12 end_of_commands.
% 0.69/1.12
% 0.69/1.12 Usable:
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Sos:
% 0.69/1.12 0 (wt=-1) [] double_divide(inverse(double_divide(inverse(double_divide(A,inverse(B))),C)),double_divide(A,C)) = B.
% 0.69/1.12 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.69/1.12 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Demodulators:
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Passive:
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Starting to process input.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 1 (wt=14) [] double_divide(inverse(double_divide(inverse(double_divide(A,inverse(B))),C)),double_divide(A,C)) = B.
% 0.69/1.12 1 is a new demodulator.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.69/1.12 2 is a new demodulator.
% 0.69/1.12 -> 2 back demodulating 1.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(A,multiply(inverse(B),C)),double_divide(C,A)) = B.
% 0.69/1.12 3 is a new demodulator.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.69/1.12 ---------------- PROOF FOUND ----------------
% 0.69/1.12 % SZS status Unsatisfiable
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 After processing input:
% 0.69/1.12
% 0.69/1.12 Usable:
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Sos:
% 0.69/1.12 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.69/1.12 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.69/1.12 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(A,multiply(inverse(B),C)),double_divide(C,A)) = B.
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Demodulators:
% 0.69/1.12 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.69/1.12 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(A,multiply(inverse(B),C)),double_divide(C,A)) = B.
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Passive:
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 UNIT CONFLICT from 204 and 4 at 0.01 seconds.
% 0.69/1.12
% 0.69/1.12 ---------------- PROOF ----------------
% 0.69/1.12 % SZS output start Refutation
% See solution above
% 0.69/1.12 ------------ end of proof -------------
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 ------------- memory usage ------------
% 0.69/1.12 Memory dynamically allocated (tp_alloc): 488.
% 0.69/1.12 type (bytes each) gets frees in use avail bytes
% 0.69/1.12 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.69/1.12 term ( 16) 11358 8105 3253 28 63.3 K
% 0.69/1.12 gen_ptr ( 8) 16501 2482 14019 29 109.8 K
% 0.69/1.12 context ( 808) 10176 10174 2 2 3.2 K
% 0.69/1.12 trail ( 12) 1521 1521 0 8 0.1 K
% 0.69/1.12 bt_node ( 68) 4727 4724 3 16 1.3 K
% 0.69/1.12 ac_position (285432) 0 0 0 0 0.0 K
% 0.69/1.12 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.69/1.12 ac_match_free_vars_pos (4020)
% 0.69/1.12 0 0 0 0 0.0 K
% 0.69/1.12 discrim ( 12) 3012 634 2378 0 27.9 K
% 0.69/1.12 flat ( 40) 22607 22607 0 29 1.1 K
% 0.69/1.12 discrim_pos ( 12) 320 320 0 1 0.0 K
% 0.69/1.12 fpa_head ( 12) 1044 0 1044 0 12.2 K
% 0.69/1.12 fpa_tree ( 28) 782 782 0 11 0.3 K
% 0.69/1.12 fpa_pos ( 36) 350 350 0 1 0.0 K
% 0.69/1.12 literal ( 12) 666 462 204 1 2.4 K
% 0.69/1.12 clause ( 24) 666 462 204 1 4.8 K
% 0.69/1.12 list ( 12) 205 149 56 4 0.7 K
% 0.69/1.12 list_pos ( 20) 838 203 635 0 12.4 K
% 0.69/1.12 pair_index ( 40) 2 0 2 0 0.1 K
% 0.69/1.12
% 0.69/1.12 -------------- statistics -------------
% 0.69/1.12 Clauses input 3
% 0.69/1.12 Usable input 0
% 0.69/1.12 Sos input 3
% 0.69/1.12 Demodulators input 0
% 0.69/1.12 Passive input 0
% 0.69/1.12
% 0.69/1.12 Processed BS (before search) 4
% 0.69/1.12 Forward subsumed BS 0
% 0.69/1.12 Kept BS 4
% 0.69/1.12 New demodulators BS 3
% 0.69/1.12 Back demodulated BS 1
% 0.69/1.12
% 0.69/1.12 Clauses or pairs given 698
% 0.69/1.12 Clauses generated 420
% 0.69/1.12 Forward subsumed 220
% 0.69/1.12 Deleted by weight 0
% 0.69/1.12 Deleted by variable count 0
% 0.69/1.12 Kept 200
% 0.69/1.12 New demodulators 143
% 0.69/1.12 Back demodulated 39
% 0.69/1.12 Ordered paramod prunes 0
% 0.69/1.12 Basic paramod prunes 3076
% 0.69/1.12 Prime paramod prunes 9
% 0.69/1.12 Semantic prunes 0
% 0.69/1.12
% 0.69/1.12 Rewrite attmepts 3696
% 0.69/1.12 Rewrites 273
% 0.69/1.12
% 0.69/1.12 FPA overloads 0
% 0.69/1.12 FPA underloads 0
% 0.69/1.12
% 0.69/1.12 Usable size 0
% 0.69/1.12 Sos size 163
% 0.69/1.12 Demodulators size 106
% 0.69/1.12 Passive size 0
% 0.69/1.12 Disabled size 40
% 0.69/1.12
% 0.69/1.12 Proofs found 1
% 0.69/1.12
% 0.69/1.12 ----------- times (seconds) ----------- Tue Jun 14 06:13:34 2022
% 0.69/1.12
% 0.69/1.12 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.69/1.12 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.69/1.12 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.69/1.12 input time 0.00
% 0.69/1.12 paramodulation time 0.00
% 0.69/1.12 demodulation time 0.00
% 0.69/1.12 orient time 0.00
% 0.69/1.12 weigh time 0.00
% 0.69/1.12 forward subsume time 0.00
% 0.69/1.12 back demod find time 0.00
% 0.69/1.12 conflict time 0.00
% 0.69/1.12 LRPO time 0.00
% 0.69/1.12 store clause time 0.00
% 0.69/1.12 disable clause time 0.00
% 0.69/1.12 prime paramod time 0.00
% 0.69/1.12 semantics time 0.00
% 0.69/1.12
% 0.69/1.12 EQP interrupted
%------------------------------------------------------------------------------