TSTP Solution File: GRP596-1 by EQP---0.9e

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : EQP---0.9e
% Problem  : GRP596-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_eqp %s

% Computer : n025.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:08 EDT 2022

% Result   : Unsatisfiable 0.83s 1.19s
% Output   : Refutation 0.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :    1
% Syntax   : Number of clauses     :   46 (  46 unt;   0 nHn;   4 RR)
%            Number of literals    :   46 (   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   :  135 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,plain,
    equal(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(C,B)))))),C),
    file('GRP596-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(multiply(multiply(multiply(A,B),C),double_divide(C,A)),B),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),2,2,2]),
    [iquote('back_demod(1),demod([2,2,2])')] ).

cnf(4,plain,
    ~ equal(multiply(b,a),multiply(a,b)),
    inference(flip,[status(thm),theory(equality)],[1]),
    [iquote('flip(1)')] ).

cnf(5,plain,
    equal(multiply(multiply(A,B),double_divide(B,multiply(multiply(C,A),D))),double_divide(D,C)),
    inference(para,[status(thm),theory(equality)],[3,3]),
    [iquote('para(3,3)')] ).

cnf(6,plain,
    equal(multiply(A,double_divide(double_divide(B,C),multiply(C,A))),B),
    inference(para,[status(thm),theory(equality)],[3,3]),
    [iquote('para(3,3)')] ).

cnf(7,plain,
    equal(multiply(multiply(A,B),double_divide(B,C)),double_divide(double_divide(A,D),multiply(D,C))),
    inference(para,[status(thm),theory(equality)],[6,3]),
    [iquote('para(6,3)')] ).

cnf(8,plain,
    equal(double_divide(double_divide(A,B),multiply(B,C)),multiply(multiply(A,D),double_divide(D,C))),
    inference(flip,[status(thm),theory(equality)],[7]),
    [iquote('flip(7)')] ).

cnf(18,plain,
    equal(double_divide(multiply(A,double_divide(B,multiply(C,A))),C),B),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,5]),1]),
    [iquote('para(6,5),flip(1)')] ).

cnf(19,plain,
    equal(inverse(A),multiply(B,multiply(C,double_divide(A,multiply(B,C))))),
    inference(para,[status(thm),theory(equality)],[18,2]),
    [iquote('para(18,2)')] ).

cnf(20,plain,
    equal(multiply(A,multiply(B,double_divide(C,multiply(A,B)))),inverse(C)),
    inference(flip,[status(thm),theory(equality)],[19]),
    [iquote('flip(19)')] ).

cnf(23,plain,
    equal(double_divide(double_divide(multiply(A,B),C),multiply(C,A)),B),
    inference(para,[status(thm),theory(equality)],[7,3]),
    [iquote('para(7,3)')] ).

cnf(26,plain,
    equal(inverse(A),multiply(multiply(B,C),double_divide(multiply(C,A),B))),
    inference(para,[status(thm),theory(equality)],[23,2]),
    [iquote('para(23,2)')] ).

cnf(27,plain,
    equal(multiply(multiply(A,B),double_divide(multiply(B,C),A)),inverse(C)),
    inference(flip,[status(thm),theory(equality)],[26]),
    [iquote('flip(26)')] ).

cnf(29,plain,
    equal(double_divide(double_divide(A,B),multiply(B,multiply(multiply(C,A),D))),double_divide(D,C)),
    inference(para,[status(thm),theory(equality)],[7,5]),
    [iquote('para(7,5)')] ).

cnf(40,plain,
    equal(multiply(multiply(multiply(multiply(A,B),C),double_divide(multiply(B,D),A)),D),C),
    inference(para,[status(thm),theory(equality)],[23,3]),
    [iquote('para(23,3)')] ).

cnf(49,plain,
    equal(multiply(A,multiply(multiply(B,C),double_divide(C,A))),B),
    inference(para,[status(thm),theory(equality)],[8,6]),
    [iquote('para(8,6)')] ).

cnf(55,plain,
    equal(multiply(multiply(A,multiply(B,double_divide(C,A))),C),B),
    inference(para,[status(thm),theory(equality)],[6,49]),
    [iquote('para(6,49)')] ).

cnf(77,plain,
    equal(multiply(inverse(A),double_divide(double_divide(multiply(B,A),C),C)),B),
    inference(para,[status(thm),theory(equality)],[27,3]),
    [iquote('para(27,3)')] ).

cnf(78,plain,
    equal(multiply(multiply(A,B),double_divide(double_divide(multiply(C,double_divide(B,A)),D),D)),C),
    inference(para,[status(thm),theory(equality)],[2,77]),
    [iquote('para(2,77)')] ).

cnf(85,plain,
    equal(multiply(multiply(A,B),double_divide(B,inverse(C))),double_divide(double_divide(multiply(A,C),D),D)),
    inference(para,[status(thm),theory(equality)],[77,3]),
    [iquote('para(77,3)')] ).

cnf(86,plain,
    equal(double_divide(double_divide(multiply(A,B),C),C),multiply(multiply(A,D),double_divide(D,inverse(B)))),
    inference(flip,[status(thm),theory(equality)],[85]),
    [iquote('flip(85)')] ).

cnf(96,plain,
    equal(multiply(multiply(A,multiply(multiply(B,C),D)),double_divide(C,A)),multiply(B,D)),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[29,2]),2]),1]),
    [iquote('para(29,2),demod([2]),flip(1)')] ).

cnf(150,plain,
    equal(multiply(multiply(A,double_divide(multiply(B,C),multiply(D,A))),C),double_divide(B,D)),
    inference(para,[status(thm),theory(equality)],[23,5]),
    [iquote('para(23,5)')] ).

cnf(209,plain,
    equal(multiply(multiply(A,double_divide(multiply(B,C),D)),C),multiply(multiply(A,E),double_divide(E,multiply(D,B)))),
    inference(para,[status(thm),theory(equality)],[49,40]),
    [iquote('para(49,40)')] ).

cnf(210,plain,
    equal(multiply(multiply(A,B),double_divide(B,multiply(C,D))),multiply(multiply(A,double_divide(multiply(D,E),C)),E)),
    inference(flip,[status(thm),theory(equality)],[209]),
    [iquote('flip(209)')] ).

cnf(296,plain,
    equal(multiply(multiply(A,B),double_divide(B,multiply(C,D))),double_divide(double_divide(multiply(A,double_divide(D,C)),E),E)),
    inference(para,[status(thm),theory(equality)],[78,3]),
    [iquote('para(78,3)')] ).

cnf(297,plain,
    equal(double_divide(double_divide(multiply(A,double_divide(B,C)),D),D),multiply(multiply(A,E),double_divide(E,multiply(C,B)))),
    inference(flip,[status(thm),theory(equality)],[296]),
    [iquote('flip(296)')] ).

cnf(313,plain,
    equal(multiply(A,double_divide(double_divide(B,C),C)),multiply(A,B)),
    inference(para,[status(thm),theory(equality)],[96,55]),
    [iquote('para(96,55)')] ).

cnf(323,plain,
    equal(multiply(inverse(A),multiply(B,A)),B),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[77]),313]),
    [iquote('back_demod(77),demod([313])')] ).

cnf(324,plain,
    equal(multiply(inverse(multiply(A,B)),A),inverse(B)),
    inference(para,[status(thm),theory(equality)],[323,323]),
    [iquote('para(323,323)')] ).

cnf(327,plain,
    equal(inverse(multiply(A,B)),multiply(inverse(A),inverse(B))),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[324,323]),1]),
    [iquote('para(324,323),flip(1)')] ).

cnf(380,plain,
    equal(multiply(multiply(A,B),double_divide(B,inverse(C))),multiply(A,C)),
    inference(para,[status(thm),theory(equality)],[323,3]),
    [iquote('para(323,3)')] ).

cnf(381,plain,
    equal(double_divide(double_divide(multiply(A,B),C),C),multiply(A,B)),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[86]),380]),
    [iquote('back_demod(86),demod([380])')] ).

cnf(382,plain,
    equal(multiply(multiply(A,B),double_divide(B,multiply(C,D))),multiply(A,double_divide(D,C))),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[297]),381]),1]),
    [iquote('back_demod(297),demod([381]),flip(1)')] ).

cnf(390,plain,
    equal(multiply(multiply(A,double_divide(multiply(B,C),D)),C),multiply(A,double_divide(B,D))),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[210]),382]),1]),
    [iquote('back_demod(210),demod([382]),flip(1)')] ).

cnf(396,plain,
    equal(multiply(A,double_divide(B,multiply(C,A))),double_divide(B,C)),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[150]),390]),
    [iquote('back_demod(150),demod([390])')] ).

cnf(448,plain,
    equal(multiply(A,double_divide(B,A)),inverse(B)),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[20]),396]),
    [iquote('back_demod(20),demod([396])')] ).

cnf(462,plain,
    equal(multiply(multiply(A,B),inverse(B)),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[448,323]),2]),
    [iquote('para(448,323),demod([2])')] ).

cnf(464,plain,
    equal(multiply(inverse(inverse(A)),B),multiply(B,A)),
    inference(para,[status(thm),theory(equality)],[462,323]),
    [iquote('para(462,323)')] ).

cnf(465,plain,
    equal(multiply(A,B),multiply(inverse(inverse(B)),A)),
    inference(flip,[status(thm),theory(equality)],[464]),
    [iquote('flip(464)')] ).

cnf(468,plain,
    equal(multiply(A,inverse(inverse(B))),multiply(A,B)),
    inference(para,[status(thm),theory(equality)],[462,462]),
    [iquote('para(462,462)')] ).

cnf(474,plain,
    ~ equal(multiply(inverse(inverse(a)),b),multiply(a,b)),
    inference(para,[status(thm),theory(equality)],[465,4]),
    [iquote('para(465,4)')] ).

cnf(491,plain,
    equal(inverse(inverse(A)),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[465,323]),327,327,468,462]),
    [iquote('para(465,323),demod([327,327,468,462])')] ).

cnf(496,plain,
    ~ equal(multiply(a,b),multiply(a,b)),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[474]),491]),
    [iquote('back_demod(474),demod([491])')] ).

cnf(497,plain,
    $false,
    inference(conflict,[status(thm)],[496]),
    [iquote('xx_conflict(496)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : GRP596-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.03/0.13  % Command  : tptp2X_and_run_eqp %s
% 0.14/0.35  % Computer : n025.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Mon Jun 13 11:14:39 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.83/1.19  ----- EQP 0.9e, May 2009 -----
% 0.83/1.19  The job began on n025.cluster.edu, Mon Jun 13 11:14:39 2022
% 0.83/1.19  The command was "./eqp09e".
% 0.83/1.19  
% 0.83/1.19  set(prolog_style_variables).
% 0.83/1.19  set(lrpo).
% 0.83/1.19  set(basic_paramod).
% 0.83/1.19  set(functional_subsume).
% 0.83/1.19  set(ordered_paramod).
% 0.83/1.19  set(prime_paramod).
% 0.83/1.19  set(para_pairs).
% 0.83/1.19  assign(pick_given_ratio,4).
% 0.83/1.19  clear(print_kept).
% 0.83/1.19  clear(print_new_demod).
% 0.83/1.19  clear(print_back_demod).
% 0.83/1.19  clear(print_given).
% 0.83/1.19  assign(max_mem,64000).
% 0.83/1.19  end_of_commands.
% 0.83/1.19  
% 0.83/1.19  Usable:
% 0.83/1.19  end_of_list.
% 0.83/1.19  
% 0.83/1.19  Sos:
% 0.83/1.19  0 (wt=-1) [] inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(C,B)))))) = C.
% 0.83/1.19  0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.83/1.19  0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.83/1.19  end_of_list.
% 0.83/1.19  
% 0.83/1.19  Demodulators:
% 0.83/1.19  end_of_list.
% 0.83/1.19  
% 0.83/1.19  Passive:
% 0.83/1.19  end_of_list.
% 0.83/1.19  
% 0.83/1.19  Starting to process input.
% 0.83/1.19  
% 0.83/1.19  ** KEPT: 1 (wt=14) [] inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(C,B)))))) = C.
% 0.83/1.19  1 is a new demodulator.
% 0.83/1.19  
% 0.83/1.19  ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.83/1.19  2 is a new demodulator.
% 0.83/1.19      -> 2 back demodulating 1.
% 0.83/1.19  
% 0.83/1.19  ** KEPT: 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(multiply(multiply(A,B),C),double_divide(C,A)) = B.
% 0.83/1.19  3 is a new demodulator.
% 0.83/1.19  
% 0.83/1.19  ** KEPT: 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.83/1.19  ---------------- PROOF FOUND ----------------
% 0.83/1.19  % SZS status Unsatisfiable
% 0.83/1.19  
% 0.83/1.19  
% 0.83/1.19  After processing input:
% 0.83/1.19  
% 0.83/1.19  Usable:
% 0.83/1.19  end_of_list.
% 0.83/1.19  
% 0.83/1.19  Sos:
% 0.83/1.19  4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.83/1.19  2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.83/1.19  3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(multiply(multiply(A,B),C),double_divide(C,A)) = B.
% 0.83/1.19  end_of_list.
% 0.83/1.19  
% 0.83/1.19  Demodulators:
% 0.83/1.19  2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.83/1.19  3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(multiply(multiply(A,B),C),double_divide(C,A)) = B.
% 0.83/1.19  end_of_list.
% 0.83/1.19  
% 0.83/1.19  Passive:
% 0.83/1.19  end_of_list.
% 0.83/1.19  
% 0.83/1.19  UNIT CONFLICT from 496 and x=x at   0.02 seconds.
% 0.83/1.19  
% 0.83/1.19  ---------------- PROOF ----------------
% 0.83/1.19  % SZS output start Refutation
% See solution above
% 0.83/1.20  ------------ end of proof -------------
% 0.83/1.20  
% 0.83/1.20  
% 0.83/1.20  ------------- memory usage ------------
% 0.83/1.20  Memory dynamically allocated (tp_alloc): 976.
% 0.83/1.20    type (bytes each)        gets      frees     in use      avail      bytes
% 0.83/1.20  sym_ent (  96)               56          0         56          0      5.2 K
% 0.83/1.20  term (  16)               22515      13481       9034         22    174.9 K
% 0.83/1.20  gen_ptr (   8)            42002       5727      36275         45    283.8 K
% 0.83/1.20  context ( 808)            14311      14309          2          5      5.5 K
% 0.83/1.20  trail (  12)               4150       4150          0          8      0.1 K
% 0.83/1.20  bt_node (  68)             3821       3818          3         16      1.3 K
% 0.83/1.20  ac_position (285432)          0          0          0          0      0.0 K
% 0.83/1.20  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.83/1.20  ac_match_free_vars_pos (4020)
% 0.83/1.20                                0          0          0          0      0.0 K
% 0.83/1.20  discrim (  12)             6852       2362       4490        389     57.2 K
% 0.83/1.20  flat (  40)               53138      53138          0         32      1.2 K
% 0.83/1.20  discrim_pos (  12)          597        597          0          1      0.0 K
% 0.83/1.20  fpa_head (  12)            2413          0       2413          0     28.3 K
% 0.83/1.20  fpa_tree (  28)            2197       2197          0         25      0.7 K
% 0.83/1.20  fpa_pos (  36)              701        701          0          1      0.0 K
% 0.83/1.20  literal (  12)             1525       1029        496          1      5.8 K
% 0.83/1.20  clause (  24)              1525       1029        496          1     11.6 K
% 0.83/1.20  list (  12)                 265        208         57          6      0.7 K
% 0.83/1.20  list_pos (  20)            2061        774       1287         13     25.4 K
% 0.83/1.20  pair_index (   40)              2          0          2          0      0.1 K
% 0.83/1.20  
% 0.83/1.20  -------------- statistics -------------
% 0.83/1.20  Clauses input                  3
% 0.83/1.20    Usable input                   0
% 0.83/1.20    Sos input                      3
% 0.83/1.20    Demodulators input             0
% 0.83/1.20    Passive input                  0
% 0.83/1.20  
% 0.83/1.20  Processed BS (before search)   4
% 0.83/1.20  Forward subsumed BS            0
% 0.83/1.20  Kept BS                        4
% 0.83/1.20  New demodulators BS            3
% 0.83/1.20  Back demodulated BS            1
% 0.83/1.20  
% 0.83/1.20  Clauses or pairs given       598
% 0.83/1.20  Clauses generated            819
% 0.83/1.20  Forward subsumed             327
% 0.83/1.20  Deleted by weight              0
% 0.83/1.20  Deleted by variable count      0
% 0.83/1.20  Kept                         492
% 0.83/1.20  New demodulators             203
% 0.83/1.20  Back demodulated             169
% 0.83/1.20  Ordered paramod prunes         0
% 0.83/1.20  Basic paramod prunes        1996
% 0.83/1.20  Prime paramod prunes           7
% 0.83/1.20  Semantic prunes                0
% 0.83/1.20  
% 0.83/1.20  Rewrite attmepts            7801
% 0.83/1.20  Rewrites                     374
% 0.83/1.20  
% 0.83/1.20  FPA overloads                  0
% 0.83/1.20  FPA underloads                 0
% 0.83/1.20  
% 0.83/1.20  Usable size                    0
% 0.83/1.20  Sos size                     325
% 0.83/1.20  Demodulators size            133
% 0.83/1.20  Passive size                   0
% 0.83/1.20  Disabled size                170
% 0.83/1.20  
% 0.83/1.20  Proofs found                   1
% 0.83/1.20  
% 0.83/1.20  ----------- times (seconds) ----------- Mon Jun 13 11:14:39 2022
% 0.83/1.20  
% 0.83/1.20  user CPU time             0.03   (0 hr, 0 min, 0 sec)
% 0.83/1.20  system CPU time           0.02   (0 hr, 0 min, 0 sec)
% 0.83/1.20  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.83/1.20  input time                0.00
% 0.83/1.20  paramodulation time       0.00
% 0.83/1.20  demodulation time         0.00
% 0.83/1.20  orient time               0.00
% 0.83/1.20  weigh time                0.00
% 0.83/1.20  forward subsume time      0.00
% 0.83/1.20  back demod find time      0.00
% 0.83/1.20  conflict time             0.00
% 0.83/1.20  LRPO time                 0.00
% 0.83/1.20  store clause time         0.01
% 0.83/1.20  disable clause time       0.00
% 0.83/1.20  prime paramod time        0.00
% 0.83/1.20  semantics time            0.00
% 0.83/1.20  
% 0.83/1.20  EQP interrupted
%------------------------------------------------------------------------------