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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : EQP---0.9e
% Problem  : GRP590-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_eqp %s

% Computer : n018.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:06 EDT 2022

% Result   : Unsatisfiable 0.75s 1.13s
% Output   : Refutation 0.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   18 (  18 unt;   0 nHn;   3 RR)
%            Number of literals    :   18 (   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   :   36 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,plain,
    equal(double_divide(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(C))))),B),C),
    file('GRP590-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(inverse(A),B),double_divide(B,C)),C),A),
    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('GRP590-1.p',unknown),
    [] ).

cnf(6,plain,
    equal(multiply(A,multiply(multiply(inverse(B),C),double_divide(C,A))),inverse(B)),
    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(inverse(A),multiply(multiply(inverse(B),C),double_divide(C,D))),B),D),A),
    inference(para,[status(thm),theory(equality)],[3,3]),
    [iquote('para(3,3)')] ).

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

cnf(24,plain,
    equal(multiply(inverse(A),multiply(inverse(B),B)),inverse(A)),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,2]),1]),
    [iquote('para(22,2),flip(1)')] ).

cnf(25,plain,
    equal(double_divide(inverse(multiply(inverse(A),A)),inverse(B)),B),
    inference(para,[status(thm),theory(equality)],[24,22]),
    [iquote('para(24,22)')] ).

cnf(33,plain,
    equal(double_divide(multiply(inverse(A),B),inverse(B)),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,3]),24]),
    [iquote('para(22,3),demod([24])')] ).

cnf(34,plain,
    equal(multiply(inverse(A),multiply(inverse(B),A)),inverse(B)),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[33,2]),1]),
    [iquote('para(33,2),flip(1)')] ).

cnf(36,plain,
    equal(double_divide(inverse(A),inverse(multiply(inverse(B),B))),A),
    inference(para,[status(thm),theory(equality)],[24,33]),
    [iquote('para(24,33)')] ).

cnf(39,plain,
    equal(double_divide(inverse(A),inverse(multiply(inverse(A),B))),B),
    inference(para,[status(thm),theory(equality)],[34,33]),
    [iquote('para(34,33)')] ).

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

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

cnf(50,plain,
    ~ equal(multiply(inverse(multiply(inverse(A),A)),a2),a2),
    inference(para,[status(thm),theory(equality)],[47,4]),
    [iquote('para(47,4)')] ).

cnf(99,plain,
    equal(multiply(inverse(multiply(inverse(A),A)),B),B),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[39,25]),1]),
    [iquote('para(39,25),flip(1)')] ).

cnf(100,plain,
    $false,
    inference(conflict,[status(thm)],[99,50]),
    [iquote('conflict(99,50)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem  : GRP590-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.14  % Command  : tptp2X_and_run_eqp %s
% 0.15/0.36  % Computer : n018.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Mon Jun 13 17:15:57 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.75/1.13  ----- EQP 0.9e, May 2009 -----
% 0.75/1.13  The job began on n018.cluster.edu, Mon Jun 13 17:15:58 2022
% 0.75/1.13  The command was "./eqp09e".
% 0.75/1.13  
% 0.75/1.13  set(prolog_style_variables).
% 0.75/1.13  set(lrpo).
% 0.75/1.13  set(basic_paramod).
% 0.75/1.13  set(functional_subsume).
% 0.75/1.13  set(ordered_paramod).
% 0.75/1.13  set(prime_paramod).
% 0.75/1.13  set(para_pairs).
% 0.75/1.13  assign(pick_given_ratio,4).
% 0.75/1.13  clear(print_kept).
% 0.75/1.13  clear(print_new_demod).
% 0.75/1.13  clear(print_back_demod).
% 0.75/1.13  clear(print_given).
% 0.75/1.13  assign(max_mem,64000).
% 0.75/1.13  end_of_commands.
% 0.75/1.13  
% 0.75/1.13  Usable:
% 0.75/1.13  end_of_list.
% 0.75/1.13  
% 0.75/1.13  Sos:
% 0.75/1.13  0 (wt=-1) [] double_divide(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(C))))),B) = C.
% 0.75/1.13  0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.75/1.13  0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.75/1.13  end_of_list.
% 0.75/1.13  
% 0.75/1.13  Demodulators:
% 0.75/1.13  end_of_list.
% 0.75/1.13  
% 0.75/1.13  Passive:
% 0.75/1.13  end_of_list.
% 0.75/1.13  
% 0.75/1.13  Starting to process input.
% 0.75/1.13  
% 0.75/1.13  ** KEPT: 1 (wt=14) [] double_divide(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(C))))),B) = C.
% 0.75/1.13  1 is a new demodulator.
% 0.75/1.13  
% 0.75/1.13  ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.75/1.13  2 is a new demodulator.
% 0.75/1.13      -> 2 back demodulating 1.
% 0.75/1.13  
% 0.75/1.13  ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(inverse(A),B),double_divide(B,C)),C) = A.
% 0.75/1.13  3 is a new demodulator.
% 0.75/1.13  
% 0.75/1.13  ** KEPT: 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.75/1.13  ---------------- PROOF FOUND ----------------
% 0.75/1.13  % SZS status Unsatisfiable
% 0.75/1.13  
% 0.75/1.13  
% 0.75/1.13  After processing input:
% 0.75/1.13  
% 0.75/1.13  Usable:
% 0.75/1.13  end_of_list.
% 0.75/1.13  
% 0.75/1.13  Sos:
% 0.75/1.13  2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.75/1.13  4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.75/1.13  3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(inverse(A),B),double_divide(B,C)),C) = A.
% 0.75/1.13  end_of_list.
% 0.75/1.13  
% 0.75/1.13  Demodulators:
% 0.75/1.13  2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.75/1.13  3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(inverse(A),B),double_divide(B,C)),C) = A.
% 0.75/1.13  end_of_list.
% 0.75/1.13  
% 0.75/1.13  Passive:
% 0.75/1.13  end_of_list.
% 0.75/1.13  
% 0.75/1.13  UNIT CONFLICT from 99 and 50 at   0.01 seconds.
% 0.75/1.13  
% 0.75/1.13  ---------------- PROOF ----------------
% 0.75/1.13  % SZS output start Refutation
% See solution above
% 0.75/1.13  ------------ end of proof -------------
% 0.75/1.13  
% 0.75/1.13  
% 0.75/1.13  ------------- memory usage ------------
% 0.75/1.13  Memory dynamically allocated (tp_alloc): 488.
% 0.75/1.13    type (bytes each)        gets      frees     in use      avail      bytes
% 0.75/1.13  sym_ent (  96)               56          0         56          0      5.2 K
% 0.75/1.13  term (  16)                5565       4038       1527         18     29.8 K
% 0.75/1.13  gen_ptr (   8)             7385        631       6754         17     52.9 K
% 0.75/1.13  context ( 808)             5709       5707          2          2      3.2 K
% 0.75/1.13  trail (  12)                323        323          0          8      0.1 K
% 0.75/1.13  bt_node (  68)             2867       2862          5         14      1.3 K
% 0.75/1.13  ac_position (285432)          0          0          0          0      0.0 K
% 0.75/1.13  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.75/1.13  ac_match_free_vars_pos (4020)
% 0.75/1.13                                0          0          0          0      0.0 K
% 0.75/1.13  discrim (  12)             1484         25       1459          0     17.1 K
% 0.75/1.13  flat (  40)                9999       9999          0         25      1.0 K
% 0.75/1.13  discrim_pos (  12)          135        135          0          1      0.0 K
% 0.75/1.13  fpa_head (  12)             730          0        730          0      8.6 K
% 0.75/1.13  fpa_tree (  28)             412        412          0         11      0.3 K
% 0.75/1.13  fpa_pos (  36)              172        172          0          1      0.0 K
% 0.75/1.13  literal (  12)              328        229         99          1      1.2 K
% 0.75/1.13  clause (  24)               328        229         99          1      2.3 K
% 0.75/1.13  list (  12)                 132         76         56          4      0.7 K
% 0.75/1.13  list_pos (  20)             372          8        364          0      7.1 K
% 0.75/1.13  pair_index (   40)              2          0          2          0      0.1 K
% 0.75/1.13  
% 0.75/1.13  -------------- statistics -------------
% 0.75/1.13  Clauses input                  3
% 0.75/1.13    Usable input                   0
% 0.75/1.13    Sos input                      3
% 0.75/1.13    Demodulators input             0
% 0.75/1.13    Passive input                  0
% 0.75/1.13  
% 0.75/1.13  Processed BS (before search)   4
% 0.75/1.13  Forward subsumed BS            0
% 0.75/1.13  Kept BS                        4
% 0.75/1.13  New demodulators BS            3
% 0.75/1.13  Back demodulated BS            1
% 0.75/1.13  
% 0.75/1.13  Clauses or pairs given       419
% 0.75/1.13  Clauses generated            208
% 0.75/1.13  Forward subsumed             113
% 0.75/1.13  Deleted by weight              0
% 0.75/1.13  Deleted by variable count      0
% 0.75/1.13  Kept                          95
% 0.75/1.13  New demodulators              70
% 0.75/1.13  Back demodulated               0
% 0.75/1.13  Ordered paramod prunes         0
% 0.75/1.13  Basic paramod prunes        1424
% 0.75/1.13  Prime paramod prunes           0
% 0.75/1.13  Semantic prunes                0
% 0.75/1.13  
% 0.75/1.13  Rewrite attmepts            1707
% 0.75/1.13  Rewrites                     101
% 0.75/1.13  
% 0.75/1.13  FPA overloads                  0
% 0.75/1.13  FPA underloads                 0
% 0.75/1.13  
% 0.75/1.13  Usable size                    0
% 0.75/1.13  Sos size                      97
% 0.75/1.13  Demodulators size             72
% 0.75/1.13  Passive size                   0
% 0.75/1.13  Disabled size                  1
% 0.75/1.13  
% 0.75/1.13  Proofs found                   1
% 0.75/1.13  
% 0.75/1.13  ----------- times (seconds) ----------- Mon Jun 13 17:15:58 2022
% 0.75/1.13  
% 0.75/1.13  user CPU time             0.01   (0 hr, 0 min, 0 sec)
% 0.75/1.13  system CPU time           0.01   (0 hr, 0 min, 0 sec)
% 0.75/1.13  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.75/1.13  input time                0.00
% 0.75/1.13  paramodulation time       0.00
% 0.75/1.13  demodulation time         0.00
% 0.75/1.13  orient time               0.00
% 0.75/1.13  weigh time                0.00
% 0.75/1.13  forward subsume time      0.00
% 0.75/1.13  back demod find time      0.00
% 0.75/1.13  conflict time             0.00
% 0.75/1.13  LRPO time                 0.00
% 0.75/1.13  store clause time         0.00
% 0.75/1.13  disable clause time       0.00
% 0.75/1.13  prime paramod time        0.00
% 0.75/1.13  semantics time            0.00
% 0.75/1.13  
% 0.75/1.13  EQP interrupted
%------------------------------------------------------------------------------