TSTP Solution File: GRP022-2 by EQP---0.9e

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : EQP---0.9e
% Problem  : GRP022-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_eqp %s

% Computer : n021.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:44:23 EDT 2022

% Result   : Unsatisfiable 0.43s 1.05s
% Output   : Refutation 0.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :    8 (   8 unt;   0 nHn;   2 RR)
%            Number of literals    :    8 (   0 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,plain,
    equal(multiply(identity,A),A),
    file('GRP022-2.p',unknown),
    [] ).

cnf(2,plain,
    equal(multiply(inverse(A),A),identity),
    file('GRP022-2.p',unknown),
    [] ).

cnf(3,plain,
    equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
    file('GRP022-2.p',unknown),
    [] ).

cnf(4,plain,
    equal(multiply(A,identity),A),
    file('GRP022-2.p',unknown),
    [] ).

cnf(6,plain,
    ~ equal(inverse(inverse(a)),a),
    file('GRP022-2.p',unknown),
    [] ).

cnf(8,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)],[2,3]),1]),1]),
    [iquote('para(2,3),demod([1]),flip(1)')] ).

cnf(9,plain,
    equal(inverse(inverse(A)),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,8]),4]),
    [iquote('para(2,8),demod([4])')] ).

cnf(10,plain,
    $false,
    inference(conflict,[status(thm)],[9,6]),
    [iquote('conflict(9,6)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GRP022-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13  % Command  : tptp2X_and_run_eqp %s
% 0.13/0.34  % Computer : n021.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 13:55:13 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.43/1.05  ----- EQP 0.9e, May 2009 -----
% 0.43/1.05  The job began on n021.cluster.edu, Tue Jun 14 13:55:13 2022
% 0.43/1.05  The command was "./eqp09e".
% 0.43/1.05  
% 0.43/1.05  set(prolog_style_variables).
% 0.43/1.05  set(lrpo).
% 0.43/1.05  set(basic_paramod).
% 0.43/1.05  set(functional_subsume).
% 0.43/1.05  set(ordered_paramod).
% 0.43/1.05  set(prime_paramod).
% 0.43/1.05  set(para_pairs).
% 0.43/1.05  assign(pick_given_ratio,4).
% 0.43/1.05  clear(print_kept).
% 0.43/1.05  clear(print_new_demod).
% 0.43/1.05  clear(print_back_demod).
% 0.43/1.05  clear(print_given).
% 0.43/1.05  assign(max_mem,64000).
% 0.43/1.05  end_of_commands.
% 0.43/1.05  
% 0.43/1.05  Usable:
% 0.43/1.05  end_of_list.
% 0.43/1.05  
% 0.43/1.05  Sos:
% 0.43/1.05  0 (wt=-1) [] multiply(identity,A) = A.
% 0.43/1.05  0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.43/1.05  0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.05  0 (wt=-1) [] multiply(A,identity) = A.
% 0.43/1.05  0 (wt=-1) [] multiply(A,inverse(A)) = identity.
% 0.43/1.05  0 (wt=-1) [] -(inverse(inverse(a)) = a).
% 0.43/1.05  end_of_list.
% 0.43/1.05  
% 0.43/1.05  Demodulators:
% 0.43/1.05  end_of_list.
% 0.43/1.05  
% 0.43/1.05  Passive:
% 0.43/1.05  end_of_list.
% 0.43/1.05  
% 0.43/1.05  Starting to process input.
% 0.43/1.05  
% 0.43/1.05  ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.43/1.05  1 is a new demodulator.
% 0.43/1.05  
% 0.43/1.05  ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.43/1.05  2 is a new demodulator.
% 0.43/1.05  
% 0.43/1.05  ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.05  3 is a new demodulator.
% 0.43/1.05  
% 0.43/1.05  ** KEPT: 4 (wt=5) [] multiply(A,identity) = A.
% 0.43/1.05  4 is a new demodulator.
% 0.43/1.05  
% 0.43/1.05  ** KEPT: 5 (wt=6) [] multiply(A,inverse(A)) = identity.
% 0.43/1.05  5 is a new demodulator.
% 0.43/1.05  
% 0.43/1.05  ** KEPT: 6 (wt=5) [] -(inverse(inverse(a)) = a).
% 0.43/1.05  ---------------- PROOF FOUND ----------------
% 0.43/1.05  % SZS status Unsatisfiable
% 0.43/1.05  
% 0.43/1.05  
% 0.43/1.05  After processing input:
% 0.43/1.05  
% 0.43/1.05  Usable:
% 0.43/1.05  end_of_list.
% 0.43/1.05  
% 0.43/1.05  Sos:
% 0.43/1.05  1 (wt=5) [] multiply(identity,A) = A.
% 0.43/1.05  4 (wt=5) [] multiply(A,identity) = A.
% 0.43/1.05  6 (wt=5) [] -(inverse(inverse(a)) = a).
% 0.43/1.05  2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.43/1.05  5 (wt=6) [] multiply(A,inverse(A)) = identity.
% 0.43/1.05  3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.05  end_of_list.
% 0.43/1.05  
% 0.43/1.05  Demodulators:
% 0.43/1.05  1 (wt=5) [] multiply(identity,A) = A.
% 0.43/1.05  2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.43/1.05  3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.05  4 (wt=5) [] multiply(A,identity) = A.
% 0.43/1.05  5 (wt=6) [] multiply(A,inverse(A)) = identity.
% 0.43/1.05  end_of_list.
% 0.43/1.05  
% 0.43/1.05  Passive:
% 0.43/1.05  end_of_list.
% 0.43/1.05  
% 0.43/1.05  UNIT CONFLICT from 9 and 6 at   0.00 seconds.
% 0.43/1.05  
% 0.43/1.05  ---------------- PROOF ----------------
% 0.43/1.05  % SZS output start Refutation
% See solution above
% 0.43/1.05  ------------ end of proof -------------
% 0.43/1.05  
% 0.43/1.05  
% 0.43/1.05  ------------- memory usage ------------
% 0.43/1.05  Memory dynamically allocated (tp_alloc): 488.
% 0.43/1.05    type (bytes each)        gets      frees     in use      avail      bytes
% 0.43/1.05  sym_ent (  96)               55          0         55          0      5.2 K
% 0.43/1.05  term (  16)                 624        565         59         22      1.5 K
% 0.43/1.05  gen_ptr (   8)              266        115        151          7      1.2 K
% 0.43/1.05  context ( 808)              287        285          2          3      3.9 K
% 0.43/1.05  trail (  12)                 10         10          0          3      0.0 K
% 0.43/1.05  bt_node (  68)              116        113          3          2      0.3 K
% 0.43/1.05  ac_position (285432)          0          0          0          0      0.0 K
% 0.43/1.05  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.43/1.05  ac_match_free_vars_pos (4020)
% 0.43/1.05                                0          0          0          0      0.0 K
% 0.43/1.05  discrim (  12)               58          0         58          0      0.7 K
% 0.43/1.05  flat (  40)                 271        271          0          6      0.2 K
% 0.43/1.05  discrim_pos (  12)           15         15          0          1      0.0 K
% 0.43/1.05  fpa_head (  12)              53          0         53          0      0.6 K
% 0.43/1.05  fpa_tree (  28)              10         10          0          3      0.1 K
% 0.43/1.05  fpa_pos (  36)               16         16          0          1      0.0 K
% 0.43/1.05  literal (  12)               30         21          9          1      0.1 K
% 0.43/1.05  clause (  24)                30         21          9          1      0.2 K
% 0.43/1.05  list (  12)                  66         10         56          3      0.7 K
% 0.43/1.05  list_pos (  20)              37          6         31          0      0.6 K
% 0.43/1.05  pair_index (   40)              2          0          2          0      0.1 K
% 0.43/1.05  
% 0.43/1.05  -------------- statistics -------------
% 0.43/1.05  Clauses input                  6
% 0.43/1.05    Usable input                   0
% 0.43/1.05    Sos input                      6
% 0.43/1.05    Demodulators input             0
% 0.43/1.05    Passive input                  0
% 0.43/1.05  
% 0.43/1.05  Processed BS (before search)   6
% 0.43/1.05  Forward subsumed BS            0
% 0.43/1.05  Kept BS                        6
% 0.43/1.05  New demodulators BS            5
% 0.43/1.05  Back demodulated BS            0
% 0.43/1.05  
% 0.43/1.05  Clauses or pairs given        29
% 0.43/1.05  Clauses generated             16
% 0.43/1.05  Forward subsumed              13
% 0.43/1.05  Deleted by weight              0
% 0.43/1.05  Deleted by variable count      0
% 0.43/1.05  Kept                           3
% 0.43/1.05  New demodulators               2
% 0.43/1.05  Back demodulated               0
% 0.43/1.05  Ordered paramod prunes         0
% 0.43/1.05  Basic paramod prunes          18
% 0.43/1.05  Prime paramod prunes           1
% 0.43/1.05  Semantic prunes                0
% 0.43/1.05  
% 0.43/1.05  Rewrite attmepts             106
% 0.43/1.05  Rewrites                      14
% 0.43/1.05  
% 0.43/1.05  FPA overloads                  0
% 0.43/1.05  FPA underloads                 0
% 0.43/1.05  
% 0.43/1.05  Usable size                    0
% 0.43/1.05  Sos size                       8
% 0.43/1.05  Demodulators size              7
% 0.43/1.05  Passive size                   0
% 0.43/1.05  Disabled size                  0
% 0.43/1.05  
% 0.43/1.05  Proofs found                   1
% 0.43/1.05  
% 0.43/1.05  ----------- times (seconds) ----------- Tue Jun 14 13:55:13 2022
% 0.43/1.05  
% 0.43/1.05  user CPU time             0.00   (0 hr, 0 min, 0 sec)
% 0.43/1.05  system CPU time           0.00   (0 hr, 0 min, 0 sec)
% 0.43/1.05  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.43/1.05  input time                0.00
% 0.43/1.05  paramodulation time       0.00
% 0.43/1.05  demodulation time         0.00
% 0.43/1.05  orient time               0.00
% 0.43/1.05  weigh time                0.00
% 0.43/1.05  forward subsume time      0.00
% 0.43/1.05  back demod find time      0.00
% 0.43/1.05  conflict time             0.00
% 0.43/1.05  LRPO time                 0.00
% 0.43/1.05  store clause time         0.00
% 0.43/1.05  disable clause time       0.00
% 0.43/1.05  prime paramod time        0.00
% 0.43/1.05  semantics time            0.00
% 0.43/1.05  
% 0.43/1.05  EQP interrupted
%------------------------------------------------------------------------------