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

View Problem - Process Solution

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

% Computer : n017.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:47:47 EDT 2022

% Result   : Unsatisfiable 0.72s 1.11s
% Output   : Refutation 0.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of clauses     :    7 (   7 unt;   0 nHn;   2 RR)
%            Number of literals    :    7 (   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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,plain,
    equal(multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)),C),
    file('GRP518-1.p',unknown),
    [] ).

cnf(2,plain,
    ~ equal(multiply(multiply(inverse(b2),b2),a2),a2),
    file('GRP518-1.p',unknown),
    [] ).

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

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

cnf(9,plain,
    equal(multiply(multiply(inverse(A),B),multiply(multiply(inverse(B),C),A)),C),
    inference(para,[status(thm),theory(equality)],[8,1]),
    [iquote('para(8,1)')] ).

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

cnf(13,plain,
    $false,
    inference(conflict,[status(thm)],[12,2]),
    [iquote('conflict(12,2)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : GRP518-1 : TPTP v8.1.0. Released v2.6.0.
% 0.13/0.14  % Command  : tptp2X_and_run_eqp %s
% 0.14/0.35  % Computer : n017.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 : Tue Jun 14 12:08:08 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.72/1.11  ----- EQP 0.9e, May 2009 -----
% 0.72/1.11  The job began on n017.cluster.edu, Tue Jun 14 12:08:09 2022
% 0.72/1.11  The command was "./eqp09e".
% 0.72/1.11  
% 0.72/1.11  set(prolog_style_variables).
% 0.72/1.11  set(lrpo).
% 0.72/1.11  set(basic_paramod).
% 0.72/1.11  set(functional_subsume).
% 0.72/1.11  set(ordered_paramod).
% 0.72/1.11  set(prime_paramod).
% 0.72/1.11  set(para_pairs).
% 0.72/1.11  assign(pick_given_ratio,4).
% 0.72/1.11  clear(print_kept).
% 0.72/1.11  clear(print_new_demod).
% 0.72/1.11  clear(print_back_demod).
% 0.72/1.11  clear(print_given).
% 0.72/1.11  assign(max_mem,64000).
% 0.72/1.11  end_of_commands.
% 0.72/1.11  
% 0.72/1.11  Usable:
% 0.72/1.11  end_of_list.
% 0.72/1.11  
% 0.72/1.11  Sos:
% 0.72/1.11  0 (wt=-1) [] multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C.
% 0.72/1.11  0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.72/1.11  end_of_list.
% 0.72/1.11  
% 0.72/1.11  Demodulators:
% 0.72/1.11  end_of_list.
% 0.72/1.11  
% 0.72/1.11  Passive:
% 0.72/1.11  end_of_list.
% 0.72/1.11  
% 0.72/1.11  Starting to process input.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 1 (wt=12) [] multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C.
% 0.72/1.11  1 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 2 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.72/1.11  ---------------- PROOF FOUND ----------------
% 0.72/1.11  % SZS status Unsatisfiable
% 0.72/1.11  
% 0.72/1.11  
% 0.72/1.11  After processing input:
% 0.72/1.11  
% 0.72/1.11  Usable:
% 0.72/1.11  end_of_list.
% 0.72/1.11  
% 0.72/1.11  Sos:
% 0.72/1.11  2 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.72/1.11  1 (wt=12) [] multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C.
% 0.72/1.11  end_of_list.
% 0.72/1.11  
% 0.72/1.11  Demodulators:
% 0.72/1.11  1 (wt=12) [] multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C.
% 0.72/1.11  end_of_list.
% 0.72/1.11  
% 0.72/1.11  Passive:
% 0.72/1.11  end_of_list.
% 0.72/1.11  
% 0.72/1.11  UNIT CONFLICT from 12 and 2 at   0.00 seconds.
% 0.72/1.11  
% 0.72/1.11  ---------------- PROOF ----------------
% 0.72/1.11  % SZS output start Refutation
% See solution above
% 0.72/1.11  ------------ end of proof -------------
% 0.72/1.11  
% 0.72/1.11  
% 0.72/1.11  ------------- memory usage ------------
% 0.72/1.11  Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.11    type (bytes each)        gets      frees     in use      avail      bytes
% 0.72/1.11  sym_ent (  96)               55          0         55          0      5.2 K
% 0.72/1.11  term (  16)                 787        580        207         20      4.4 K
% 0.72/1.11  gen_ptr (   8)              910         61        849          6      6.7 K
% 0.72/1.11  context ( 808)              395        393          2          2      3.2 K
% 0.72/1.11  trail (  12)                 55         55          0          5      0.1 K
% 0.72/1.11  bt_node (  68)              171        165          6          9      1.0 K
% 0.72/1.11  ac_position (285432)          0          0          0          0      0.0 K
% 0.72/1.11  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.72/1.11  ac_match_free_vars_pos (4020)
% 0.72/1.11                                0          0          0          0      0.0 K
% 0.72/1.11  discrim (  12)              183          0        183          0      2.1 K
% 0.72/1.11  flat (  40)                1057       1057          0         27      1.1 K
% 0.72/1.11  discrim_pos (  12)            6          6          0          1      0.0 K
% 0.72/1.11  fpa_head (  12)             154          0        154          0      1.8 K
% 0.72/1.11  fpa_tree (  28)              19         19          0          5      0.1 K
% 0.72/1.11  fpa_pos (  36)               18         18          0          1      0.0 K
% 0.72/1.11  literal (  12)               33         21         12          1      0.2 K
% 0.72/1.11  clause (  24)                33         21         12          1      0.3 K
% 0.72/1.11  list (  12)                  65          9         56          3      0.7 K
% 0.72/1.11  list_pos (  20)              41          2         39          0      0.8 K
% 0.72/1.11  pair_index (   40)              2          0          2          0      0.1 K
% 0.72/1.11  
% 0.72/1.11  -------------- statistics -------------
% 0.72/1.11  Clauses input                  2
% 0.72/1.11    Usable input                   0
% 0.72/1.11    Sos input                      2
% 0.72/1.11    Demodulators input             0
% 0.72/1.11    Passive input                  0
% 0.72/1.11  
% 0.72/1.11  Processed BS (before search)   2
% 0.72/1.11  Forward subsumed BS            0
% 0.72/1.11  Kept BS                        2
% 0.72/1.11  New demodulators BS            1
% 0.72/1.11  Back demodulated BS            0
% 0.72/1.11  
% 0.72/1.11  Clauses or pairs given        11
% 0.72/1.11  Clauses generated             17
% 0.72/1.11  Forward subsumed               7
% 0.72/1.11  Deleted by weight              0
% 0.72/1.11  Deleted by variable count      0
% 0.72/1.11  Kept                          10
% 0.72/1.11  New demodulators               5
% 0.72/1.11  Back demodulated               0
% 0.72/1.11  Ordered paramod prunes         0
% 0.72/1.11  Basic paramod prunes          20
% 0.72/1.11  Prime paramod prunes           2
% 0.72/1.11  Semantic prunes                0
% 0.72/1.11  
% 0.72/1.11  Rewrite attmepts             167
% 0.72/1.11  Rewrites                       1
% 0.72/1.11  
% 0.72/1.11  FPA overloads                  0
% 0.72/1.11  FPA underloads                 0
% 0.72/1.11  
% 0.72/1.11  Usable size                    0
% 0.72/1.11  Sos size                      11
% 0.72/1.11  Demodulators size              6
% 0.72/1.11  Passive size                   0
% 0.72/1.11  Disabled size                  0
% 0.72/1.11  
% 0.72/1.11  Proofs found                   1
% 0.72/1.11  
% 0.72/1.11  ----------- times (seconds) ----------- Tue Jun 14 12:08:09 2022
% 0.72/1.11  
% 0.72/1.11  user CPU time             0.00   (0 hr, 0 min, 0 sec)
% 0.72/1.11  system CPU time           0.00   (0 hr, 0 min, 0 sec)
% 0.72/1.11  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.72/1.11  input time                0.00
% 0.72/1.11  paramodulation time       0.00
% 0.72/1.11  demodulation time         0.00
% 0.72/1.11  orient time               0.00
% 0.72/1.11  weigh time                0.00
% 0.72/1.11  forward subsume time      0.00
% 0.72/1.11  back demod find time      0.00
% 0.72/1.11  conflict time             0.00
% 0.72/1.11  LRPO time                 0.00
% 0.72/1.11  store clause time         0.00
% 0.72/1.11  disable clause time       0.00
% 0.72/1.11  prime paramod time        0.00
% 0.72/1.11  semantics time            0.00
% 0.72/1.11  
% 0.72/1.11  EQP interrupted
%------------------------------------------------------------------------------