TSTP Solution File: GRP606-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP606-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:11 EDT 2022
% Result : Unsatisfiable 0.43s 1.17s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 2
% Syntax : Number of clauses : 47 ( 47 unt; 0 nHn; 3 RR)
% Number of literals : 47 ( 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 : 109 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),C),B),
file('GRP606-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(multiply(double_divide(A,B),inverse(C)),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(multiply(inverse(b2),b2),a2),a2),
file('GRP606-1.p',unknown),
[] ).
cnf(5,plain,
equal(double_divide(multiply(multiply(double_divide(A,B),multiply(C,D)),A),B),double_divide(D,C)),
inference(para,[status(thm),theory(equality)],[2,3]),
[iquote('para(2,3)')] ).
cnf(6,plain,
equal(multiply(A,multiply(multiply(double_divide(B,A),inverse(C)),B)),inverse(C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,2]),1]),
[iquote('para(3,2),flip(1)')] ).
cnf(7,plain,
equal(double_divide(multiply(multiply(A,inverse(B)),multiply(multiply(double_divide(C,D),inverse(A)),C)),D),B),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(13,plain,
equal(double_divide(multiply(inverse(A),B),C),double_divide(D,multiply(double_divide(D,double_divide(B,C)),inverse(A)))),
inference(para,[status(thm),theory(equality)],[6,5]),
[iquote('para(6,5)')] ).
cnf(15,plain,
equal(multiply(multiply(double_divide(A,double_divide(B,C)),inverse(D)),A),multiply(C,multiply(inverse(D),B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,2]),2]),
[iquote('para(13,2),demod([2])')] ).
cnf(21,plain,
equal(double_divide(inverse(A),multiply(A,inverse(B))),B),
inference(para,[status(thm),theory(equality)],[6,7]),
[iquote('para(6,7)')] ).
cnf(23,plain,
equal(multiply(multiply(A,inverse(B)),inverse(A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[21,2]),1]),
[iquote('para(21,2),flip(1)')] ).
cnf(25,plain,
equal(double_divide(multiply(multiply(A,inverse(B)),inverse(C)),multiply(C,inverse(A))),B),
inference(para,[status(thm),theory(equality)],[21,3]),
[iquote('para(21,3)')] ).
cnf(31,plain,
equal(double_divide(inverse(A),multiply(B,inverse(B))),A),
inference(para,[status(thm),theory(equality)],[23,25]),
[iquote('para(23,25)')] ).
cnf(32,plain,
equal(multiply(multiply(A,inverse(A)),inverse(B)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[31,2]),1]),
[iquote('para(31,2),flip(1)')] ).
cnf(33,plain,
equal(double_divide(multiply(A,B),multiply(C,inverse(C))),double_divide(B,A)),
inference(para,[status(thm),theory(equality)],[2,31]),
[iquote('para(2,31)')] ).
cnf(36,plain,
equal(multiply(multiply(A,inverse(A)),multiply(B,C)),multiply(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[33,2]),2]),1]),
[iquote('para(33,2),demod([2]),flip(1)')] ).
cnf(80,plain,
equal(multiply(multiply(double_divide(A,B),inverse(C)),A),multiply(inverse(C),inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[31,15]),36]),
[iquote('para(31,15),demod([36])')] ).
cnf(81,plain,
equal(multiply(inverse(A),inverse(B)),multiply(multiply(double_divide(C,B),inverse(A)),C)),
inference(flip,[status(thm),theory(equality)],[80]),
[iquote('flip(80)')] ).
cnf(85,plain,
equal(multiply(inverse(A),multiply(B,C)),multiply(B,multiply(inverse(A),C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,81]),15]),
[iquote('para(2,81),demod([15])')] ).
cnf(86,plain,
equal(multiply(A,multiply(inverse(B),C)),multiply(inverse(B),multiply(A,C))),
inference(flip,[status(thm),theory(equality)],[85]),
[iquote('flip(85)')] ).
cnf(95,plain,
equal(multiply(inverse(A),inverse(multiply(B,inverse(B)))),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[31,80]),23]),1]),
[iquote('para(31,80),demod([23]),flip(1)')] ).
cnf(96,plain,
equal(multiply(multiply(A,B),inverse(multiply(C,inverse(C)))),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,95]),2]),
[iquote('para(2,95),demod([2])')] ).
cnf(98,plain,
equal(double_divide(inverse(multiply(A,inverse(A))),inverse(B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[95,33]),31]),1]),
[iquote('para(95,33),demod([31]),flip(1)')] ).
cnf(99,plain,
equal(double_divide(multiply(A,inverse(B)),inverse(A)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[98,3]),96]),
[iquote('para(98,3),demod([96])')] ).
cnf(103,plain,
equal(double_divide(inverse(A),inverse(multiply(B,inverse(A)))),B),
inference(para,[status(thm),theory(equality)],[23,99]),
[iquote('para(23,99)')] ).
cnf(124,plain,
equal(double_divide(inverse(A),inverse(inverse(A))),multiply(B,inverse(B))),
inference(para,[status(thm),theory(equality)],[95,99]),
[iquote('para(95,99)')] ).
cnf(126,plain,
equal(inverse(multiply(A,inverse(A))),multiply(inverse(inverse(B)),inverse(B))),
inference(para,[status(thm),theory(equality)],[124,2]),
[iquote('para(124,2)')] ).
cnf(172,plain,
equal(double_divide(multiply(inverse(inverse(A)),inverse(A)),inverse(B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[126,21]),32]),
[iquote('para(126,21),demod([32])')] ).
cnf(175,plain,
equal(inverse(inverse(A)),A),
inference(para,[status(thm),theory(equality)],[172,99]),
[iquote('para(172,99)')] ).
cnf(189,plain,
equal(double_divide(A,multiply(inverse(A),inverse(B))),B),
inference(para,[status(thm),theory(equality)],[175,21]),
[iquote('para(175,21)')] ).
cnf(191,plain,
equal(double_divide(A,multiply(B,inverse(B))),inverse(A)),
inference(para,[status(thm),theory(equality)],[175,31]),
[iquote('para(175,31)')] ).
cnf(193,plain,
equal(double_divide(multiply(A,B),inverse(A)),inverse(B)),
inference(para,[status(thm),theory(equality)],[175,99]),
[iquote('para(175,99)')] ).
cnf(201,plain,
equal(double_divide(A,inverse(multiply(B,A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[175,103]),175]),
[iquote('para(175,103),demod([175])')] ).
cnf(206,plain,
equal(multiply(inverse(multiply(A,B)),B),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[201,2]),1]),
[iquote('para(201,2),flip(1)')] ).
cnf(227,plain,
equal(multiply(multiply(A,inverse(A)),B),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[191,2]),175]),1]),
[iquote('para(191,2),demod([175]),flip(1)')] ).
cnf(234,plain,
equal(multiply(inverse(A),multiply(A,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[193,2]),175]),1]),
[iquote('para(193,2),demod([175]),flip(1)')] ).
cnf(283,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)],[234,193]),175]),1]),
[iquote('para(234,193),demod([175]),flip(1)')] ).
cnf(294,plain,
equal(multiply(double_divide(A,B),A),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[206]),283]),
[iquote('back_demod(206),demod([283])')] ).
cnf(300,plain,
equal(double_divide(A,double_divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[201]),283]),
[iquote('back_demod(201),demod([283])')] ).
cnf(342,plain,
equal(multiply(inverse(A),inverse(B)),double_divide(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[189,300]),1]),
[iquote('para(189,300),flip(1)')] ).
cnf(348,plain,
equal(multiply(multiply(double_divide(A,B),inverse(C)),A),double_divide(C,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[81]),342]),1]),
[iquote('back_demod(81),demod([342]),flip(1)')] ).
cnf(401,plain,
equal(multiply(A,multiply(inverse(B),C)),double_divide(B,double_divide(C,A))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[15]),348]),1]),
[iquote('back_demod(15),demod([348]),flip(1)')] ).
cnf(419,plain,
equal(multiply(inverse(A),multiply(B,C)),double_divide(A,double_divide(C,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[86]),401]),1]),
[iquote('back_demod(86),demod([401]),flip(1)')] ).
cnf(425,plain,
equal(double_divide(A,double_divide(B,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[234]),419]),
[iquote('back_demod(234),demod([419])')] ).
cnf(442,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[425,294]),2]),
[iquote('para(425,294),demod([2])')] ).
cnf(445,plain,
~ equal(a2,a2),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[442,4]),227]),
[iquote('para(442,4),demod([227])')] ).
cnf(446,plain,
$false,
inference(conflict,[status(thm)],[445]),
[iquote('xx_conflict(445)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP606-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 12:46:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.17 ----- EQP 0.9e, May 2009 -----
% 0.43/1.17 The job began on n006.cluster.edu, Tue Jun 14 12:46:27 2022
% 0.43/1.17 The command was "./eqp09e".
% 0.43/1.17
% 0.43/1.17 set(prolog_style_variables).
% 0.43/1.17 set(lrpo).
% 0.43/1.17 set(basic_paramod).
% 0.43/1.17 set(functional_subsume).
% 0.43/1.17 set(ordered_paramod).
% 0.43/1.17 set(prime_paramod).
% 0.43/1.17 set(para_pairs).
% 0.43/1.17 assign(pick_given_ratio,4).
% 0.43/1.17 clear(print_kept).
% 0.43/1.17 clear(print_new_demod).
% 0.43/1.17 clear(print_back_demod).
% 0.43/1.17 clear(print_given).
% 0.43/1.17 assign(max_mem,64000).
% 0.43/1.17 end_of_commands.
% 0.43/1.17
% 0.43/1.17 Usable:
% 0.43/1.17 end_of_list.
% 0.43/1.17
% 0.43/1.17 Sos:
% 0.43/1.17 0 (wt=-1) [] double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),C) = B.
% 0.43/1.17 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.43/1.17 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.43/1.17 end_of_list.
% 0.43/1.17
% 0.43/1.17 Demodulators:
% 0.43/1.17 end_of_list.
% 0.43/1.17
% 0.43/1.17 Passive:
% 0.43/1.17 end_of_list.
% 0.43/1.17
% 0.43/1.17 Starting to process input.
% 0.43/1.17
% 0.43/1.17 ** KEPT: 1 (wt=14) [] double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),C) = B.
% 0.43/1.17 1 is a new demodulator.
% 0.43/1.17
% 0.43/1.17 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.43/1.17 2 is a new demodulator.
% 0.43/1.17 -> 2 back demodulating 1.
% 0.43/1.17
% 0.43/1.17 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(double_divide(A,B),inverse(C)),A),B) = C.
% 0.43/1.17 3 is a new demodulator.
% 0.43/1.17
% 0.43/1.17 ** KEPT: 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.43/1.17 ---------------- PROOF FOUND ----------------
% 0.43/1.17 % SZS status Unsatisfiable
% 0.43/1.17
% 0.43/1.17
% 0.43/1.17 After processing input:
% 0.43/1.17
% 0.43/1.17 Usable:
% 0.43/1.17 end_of_list.
% 0.43/1.17
% 0.43/1.17 Sos:
% 0.43/1.17 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.43/1.17 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.43/1.17 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(double_divide(A,B),inverse(C)),A),B) = C.
% 0.43/1.17 end_of_list.
% 0.43/1.17
% 0.43/1.17 Demodulators:
% 0.43/1.17 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.43/1.17 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(double_divide(A,B),inverse(C)),A),B) = C.
% 0.43/1.17 end_of_list.
% 0.43/1.17
% 0.43/1.17 Passive:
% 0.43/1.17 end_of_list.
% 0.43/1.17
% 0.43/1.17 UNIT CONFLICT from 445 and x=x at 0.02 seconds.
% 0.43/1.17
% 0.43/1.17 ---------------- PROOF ----------------
% 0.43/1.17 % SZS output start Refutation
% See solution above
% 0.43/1.17 ------------ end of proof -------------
% 0.43/1.17
% 0.43/1.17
% 0.43/1.17 ------------- memory usage ------------
% 0.43/1.17 Memory dynamically allocated (tp_alloc): 976.
% 0.43/1.17 type (bytes each) gets frees in use avail bytes
% 0.43/1.17 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.43/1.17 term ( 16) 23349 15293 8056 20 156.0 K
% 0.43/1.17 gen_ptr ( 8) 42178 7725 34453 46 269.5 K
% 0.43/1.17 context ( 808) 18454 18452 2 3 3.9 K
% 0.43/1.17 trail ( 12) 2734 2734 0 9 0.1 K
% 0.43/1.17 bt_node ( 68) 6062 6059 3 18 1.4 K
% 0.43/1.17 ac_position (285432) 0 0 0 0 0.0 K
% 0.43/1.17 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.43/1.17 ac_match_free_vars_pos (4020)
% 0.43/1.17 0 0 0 0 0.0 K
% 0.43/1.17 discrim ( 12) 5912 2654 3258 522 44.3 K
% 0.43/1.17 flat ( 40) 54123 54123 0 34 1.3 K
% 0.43/1.17 discrim_pos ( 12) 738 738 0 1 0.0 K
% 0.43/1.17 fpa_head ( 12) 1720 0 1720 0 20.2 K
% 0.43/1.17 fpa_tree ( 28) 1260 1260 0 15 0.4 K
% 0.43/1.17 fpa_pos ( 36) 670 670 0 1 0.0 K
% 0.43/1.17 literal ( 12) 1502 1057 445 1 5.2 K
% 0.43/1.17 clause ( 24) 1502 1057 445 1 10.5 K
% 0.43/1.17 list ( 12) 285 229 56 5 0.7 K
% 0.43/1.17 list_pos ( 20) 1963 902 1061 17 21.1 K
% 0.43/1.17 pair_index ( 40) 2 0 2 0 0.1 K
% 0.43/1.17
% 0.43/1.17 -------------- statistics -------------
% 0.43/1.17 Clauses input 3
% 0.43/1.17 Usable input 0
% 0.43/1.17 Sos input 3
% 0.43/1.17 Demodulators input 0
% 0.43/1.17 Passive input 0
% 0.43/1.17
% 0.43/1.17 Processed BS (before search) 4
% 0.43/1.17 Forward subsumed BS 0
% 0.43/1.17 Kept BS 4
% 0.43/1.17 New demodulators BS 3
% 0.43/1.17 Back demodulated BS 1
% 0.43/1.17
% 0.43/1.17 Clauses or pairs given 1057
% 0.43/1.17 Clauses generated 853
% 0.43/1.17 Forward subsumed 412
% 0.43/1.17 Deleted by weight 0
% 0.43/1.17 Deleted by variable count 0
% 0.43/1.17 Kept 441
% 0.43/1.17 New demodulators 223
% 0.43/1.17 Back demodulated 196
% 0.43/1.17 Ordered paramod prunes 0
% 0.43/1.17 Basic paramod prunes 4311
% 0.43/1.17 Prime paramod prunes 28
% 0.43/1.17 Semantic prunes 0
% 0.43/1.17
% 0.43/1.17 Rewrite attmepts 8657
% 0.43/1.17 Rewrites 507
% 0.43/1.17
% 0.43/1.17 FPA overloads 0
% 0.43/1.17 FPA underloads 0
% 0.43/1.17
% 0.43/1.17 Usable size 0
% 0.43/1.17 Sos size 247
% 0.43/1.17 Demodulators size 123
% 0.43/1.17 Passive size 0
% 0.43/1.17 Disabled size 197
% 0.43/1.17
% 0.43/1.17 Proofs found 1
% 0.43/1.17
% 0.43/1.17 ----------- times (seconds) ----------- Tue Jun 14 12:46:27 2022
% 0.43/1.17
% 0.43/1.17 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.43/1.17 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.43/1.17 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.43/1.17 input time 0.00
% 0.43/1.17 paramodulation time 0.00
% 0.43/1.17 demodulation time 0.00
% 0.43/1.17 orient time 0.00
% 0.43/1.17 weigh time 0.00
% 0.43/1.17 forward subsume time 0.00
% 0.43/1.17 back demod find time 0.00
% 0.43/1.17 conflict time 0.00
% 0.43/1.17 LRPO time 0.00
% 0.43/1.17 store clause time 0.00
% 0.43/1.17 disable clause time 0.00
% 0.43/1.17 prime paramod time 0.00
% 0.43/1.17 semantics time 0.00
% 0.43/1.17
% 0.43/1.17 EQP interrupted
%------------------------------------------------------------------------------