↑ Up

EQP---0.9e.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : EQP---0.9e
% Problem  : BOO002-2 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_eqp %s

% Computer : n029.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 : Thu Jul 14 23:37:02 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,plain,
    equal(multiply(multiply(A,B,C),D,multiply(A,B,E)),multiply(A,B,multiply(C,D,E))),
    file('BOO002-2.p',unknown),
    [] ).

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

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

cnf(4,plain,
    equal(multiply(inverse(A),A,B),B),
    file('BOO002-2.p',unknown),
    [] ).

cnf(5,plain,
    equal(multiply(A,B,A),A),
    file('BOO002-2.p',unknown),
    [] ).

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

cnf(7,plain,
    equal(multiply(multiply(A,B,multiply(C,D,E)),F,multiply(multiply(A,B,C),D,G)),multiply(multiply(A,B,C),D,multiply(multiply(A,B,E),F,G))),
    inference(para,[status(thm),theory(equality)],[1,1]),
    [iquote('para(1,1)')] ).

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

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

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

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

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

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

cnf(17,plain,
    equal(multiply(A,B,multiply(C,A,B)),multiply(C,A,B)),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,10]),1]),
    [iquote('para(2,10),flip(1)')] ).

cnf(26,plain,
    equal(multiply(multiply(A,B,multiply(C,D,E)),F,D),multiply(multiply(A,B,C),D,multiply(multiply(A,B,E),F,D))),
    inference(para,[status(thm),theory(equality)],[2,7]),
    [iquote('para(2,7)')] ).

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

cnf(83,plain,
    equal(multiply(A,multiply(B,C,A),multiply(D,B,multiply(B,C,A))),multiply(B,C,A)),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,14]),11,13]),
    [iquote('para(13,14),demod([11,13])')] ).

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

cnf(119,plain,
    equal(multiply(A,B,multiply(C,B,multiply(D,A,B))),multiply(C,B,multiply(D,A,B))),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,17]),11]),
    [iquote('para(11,17),demod([11])')] ).

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

cnf(164,plain,
    equal(multiply(A,B,multiply(C,D,multiply(A,B,C))),multiply(A,B,C)),
    inference(para,[status(thm),theory(equality)],[27,13]),
    [iquote('para(27,13)')] ).

cnf(217,plain,
    equal(multiply(multiply(A,B,C),D,C),multiply(C,multiply(A,B,C),multiply(A,D,C))),
    inference(para,[status(thm),theory(equality)],[94,16]),
    [iquote('para(94,16)')] ).

cnf(298,plain,
    equal(multiply(A,multiply(B,C,A),multiply(D,C,multiply(B,C,A))),multiply(B,C,A)),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,120]),11,13]),
    [iquote('para(13,120),demod([11,13])')] ).

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

cnf(425,plain,
    equal(multiply(multiply(A,B,C),D,multiply(C,D,A)),multiply(C,D,A)),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[164,299]),26,5,299,164]),
    [iquote('para(164,299),demod([26,5,299,164])')] ).

cnf(566,plain,
    equal(multiply(multiply(A,B,C),D,multiply(B,D,C)),multiply(B,D,C)),
    inference(para,[status(thm),theory(equality)],[299,425]),
    [iquote('para(299,425)')] ).

cnf(569,plain,
    equal(multiply(A,multiply(B,inverse(C),A),multiply(B,C,A)),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,566]),217,4]),
    [iquote('para(4,566),demod([217,4])')] ).

cnf(571,plain,
    equal(multiply(A,inverse(A),B),B),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,569]),94]),
    [iquote('para(3,569),demod([94])')] ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : BOO002-2 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13  % Command  : tptp2X_and_run_eqp %s
% 0.13/0.34  % Computer : n029.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.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Wed Jun  1 19:53:31 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.73/1.19  ----- EQP 0.9e, May 2009 -----
% 0.73/1.19  The job began on n029.cluster.edu, Wed Jun  1 19:53:31 2022
% 0.73/1.19  The command was "./eqp09e".
% 0.73/1.19  
% 0.73/1.19  set(prolog_style_variables).
% 0.73/1.19  set(lrpo).
% 0.73/1.19  set(basic_paramod).
% 0.73/1.19  set(functional_subsume).
% 0.73/1.19  set(ordered_paramod).
% 0.73/1.19  set(prime_paramod).
% 0.73/1.19  set(para_pairs).
% 0.73/1.19  assign(pick_given_ratio,4).
% 0.73/1.19  clear(print_kept).
% 0.73/1.19  clear(print_new_demod).
% 0.73/1.19  clear(print_back_demod).
% 0.73/1.19  clear(print_given).
% 0.73/1.19  assign(max_mem,64000).
% 0.73/1.19  end_of_commands.
% 0.73/1.19  
% 0.73/1.19  Usable:
% 0.73/1.19  end_of_list.
% 0.73/1.19  
% 0.73/1.19  Sos:
% 0.73/1.19  0 (wt=-1) [] multiply(multiply(A,B,C),D,multiply(A,B,E)) = multiply(A,B,multiply(C,D,E)).
% 0.73/1.19  0 (wt=-1) [] multiply(A,B,B) = B.
% 0.73/1.19  0 (wt=-1) [] multiply(A,A,B) = A.
% 0.73/1.19  0 (wt=-1) [] multiply(inverse(A),A,B) = B.
% 0.73/1.19  0 (wt=-1) [] multiply(A,B,A) = A.
% 0.73/1.19  0 (wt=-1) [] -(multiply(a,inverse(a),b) = b).
% 0.73/1.19  end_of_list.
% 0.73/1.19  
% 0.73/1.19  Demodulators:
% 0.73/1.19  end_of_list.
% 0.73/1.19  
% 0.73/1.19  Passive:
% 0.73/1.19  end_of_list.
% 0.73/1.19  
% 0.73/1.19  Starting to process input.
% 0.73/1.19  
% 0.73/1.19  ** KEPT: 1 (wt=18) [] multiply(multiply(A,B,C),D,multiply(A,B,E)) = multiply(A,B,multiply(C,D,E)).
% 0.73/1.19  1 is a new demodulator.
% 0.73/1.19  
% 0.73/1.19  ** KEPT: 2 (wt=6) [] multiply(A,B,B) = B.
% 0.73/1.19  2 is a new demodulator.
% 0.73/1.19  
% 0.73/1.19  ** KEPT: 3 (wt=6) [] multiply(A,A,B) = A.
% 0.73/1.19  3 is a new demodulator.
% 0.73/1.19  
% 0.73/1.19  ** KEPT: 4 (wt=7) [] multiply(inverse(A),A,B) = B.
% 0.73/1.19  4 is a new demodulator.
% 0.73/1.19  
% 0.73/1.19  ** KEPT: 5 (wt=6) [] multiply(A,B,A) = A.
% 0.73/1.19  5 is a new demodulator.
% 0.73/1.19  
% 0.73/1.19  ** KEPT: 6 (wt=7) [] -(multiply(a,inverse(a),b) = b).
% 0.73/1.19  ---------------- PROOF FOUND ----------------
% 0.73/1.19  % SZS status Unsatisfiable
% 0.73/1.19  
% 0.73/1.19  
% 0.73/1.19  After processing input:
% 0.73/1.19  
% 0.73/1.19  Usable:
% 0.73/1.19  end_of_list.
% 0.73/1.19  
% 0.73/1.19  Sos:
% 0.73/1.19  2 (wt=6) [] multiply(A,B,B) = B.
% 0.73/1.19  3 (wt=6) [] multiply(A,A,B) = A.
% 0.73/1.19  5 (wt=6) [] multiply(A,B,A) = A.
% 0.73/1.19  4 (wt=7) [] multiply(inverse(A),A,B) = B.
% 0.73/1.19  6 (wt=7) [] -(multiply(a,inverse(a),b) = b).
% 0.73/1.19  1 (wt=18) [] multiply(multiply(A,B,C),D,multiply(A,B,E)) = multiply(A,B,multiply(C,D,E)).
% 0.73/1.19  end_of_list.
% 0.73/1.19  
% 0.73/1.19  Demodulators:
% 0.73/1.19  1 (wt=18) [] multiply(multiply(A,B,C),D,multiply(A,B,E)) = multiply(A,B,multiply(C,D,E)).
% 0.73/1.19  2 (wt=6) [] multiply(A,B,B) = B.
% 0.73/1.19  3 (wt=6) [] multiply(A,A,B) = A.
% 0.73/1.19  4 (wt=7) [] multiply(inverse(A),A,B) = B.
% 0.73/1.19  5 (wt=6) [] multiply(A,B,A) = A.
% 0.73/1.19  end_of_list.
% 0.73/1.19  
% 0.73/1.19  Passive:
% 0.73/1.19  end_of_list.
% 0.73/1.19  
% 0.73/1.19  UNIT CONFLICT from 571 and 6 at   0.07 seconds.
% 0.73/1.19  
% 0.73/1.19  ---------------- PROOF ----------------
% 0.73/1.19  % SZS output start Refutation
% See solution above
% 0.73/1.19  ------------ end of proof -------------
% 0.73/1.19  
% 0.73/1.19  
% 0.73/1.19  ------------- memory usage ------------
% 0.73/1.19  Memory dynamically allocated (tp_alloc): 1953.
% 0.73/1.19    type (bytes each)        gets      frees     in use      avail      bytes
% 0.73/1.19  sym_ent (  96)               57          0         57          0      5.3 K
% 0.73/1.19  term (  16)               89976      68204      21772         65    424.3 K
% 0.73/1.19  gen_ptr (   8)            96626       8468      88158         28    689.0 K
% 0.73/1.19  context ( 808)            32712      32710          2          5      5.5 K
% 0.73/1.19  trail (  12)              56269      56269          0         15      0.2 K
% 0.73/1.19  bt_node (  68)            11736      11732          4         21      1.7 K
% 0.73/1.19  ac_position (285432)          0          0          0          0      0.0 K
% 0.73/1.19  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.73/1.19  ac_match_free_vars_pos (4020)
% 0.73/1.19                                0          0          0          0      0.0 K
% 0.73/1.19  discrim (  12)            18732        367      18365         70    216.0 K
% 0.73/1.19  flat (  40)              195778     195778          0         99      3.9 K
% 0.73/1.19  discrim_pos (  12)         2983       2983          0          1      0.0 K
% 0.73/1.19  fpa_head (  12)            1300          0       1300          0     15.2 K
% 0.73/1.19  fpa_tree (  28)            1300       1300          0          9      0.2 K
% 0.73/1.19  fpa_pos (  36)              927        927          0          1      0.0 K
% 0.73/1.19  literal (  12)             2615       2044        571          1      6.7 K
% 0.73/1.19  clause (  24)              2615       2044        571          1     13.4 K
% 0.73/1.19  list (  12)                 415        359         56          3      0.7 K
% 0.73/1.19  list_pos (  20)            2114        105       2009          0     39.2 K
% 0.73/1.19  pair_index (   40)              2          0          2          0      0.1 K
% 0.73/1.19  
% 0.73/1.19  -------------- statistics -------------
% 0.73/1.19  Clauses input                  6
% 0.73/1.19    Usable input                   0
% 0.73/1.19    Sos input                      6
% 0.73/1.19    Demodulators input             0
% 0.73/1.19    Passive input                  0
% 0.73/1.19  
% 0.73/1.19  Processed BS (before search)   6
% 0.73/1.19  Forward subsumed BS            0
% 0.73/1.19  Kept BS                        6
% 0.73/1.19  New demodulators BS            5
% 0.73/1.19  Back demodulated BS            0
% 0.73/1.19  
% 0.73/1.19  Clauses or pairs given       892
% 0.73/1.19  Clauses generated           1710
% 0.73/1.19  Forward subsumed            1145
% 0.73/1.19  Deleted by weight              0
% 0.73/1.19  Deleted by variable count      0
% 0.73/1.19  Kept                         565
% 0.73/1.19  New demodulators             351
% 0.73/1.19  Back demodulated              21
% 0.73/1.19  Ordered paramod prunes         0
% 0.73/1.19  Basic paramod prunes         889
% 0.73/1.19  Prime paramod prunes          98
% 0.73/1.19  Semantic prunes                0
% 0.73/1.19  
% 0.73/1.19  Rewrite attmepts           21502
% 0.73/1.19  Rewrites                    2703
% 0.73/1.19  
% 0.73/1.19  FPA overloads                  0
% 0.73/1.19  FPA underloads                 0
% 0.73/1.19  
% 0.73/1.19  Usable size                    0
% 0.73/1.19  Sos size                     549
% 0.73/1.19  Demodulators size            341
% 0.73/1.19  Passive size                   0
% 0.73/1.19  Disabled size                 21
% 0.73/1.19  
% 0.73/1.19  Proofs found                   1
% 0.73/1.19  
% 0.73/1.19  ----------- times (seconds) ----------- Wed Jun  1 19:53:31 2022
% 0.73/1.19  
% 0.73/1.19  user CPU time             0.07   (0 hr, 0 min, 0 sec)
% 0.73/1.19  system CPU time           0.04   (0 hr, 0 min, 0 sec)
% 0.73/1.19  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.73/1.19  input time                0.00
% 0.73/1.19  paramodulation time       0.01
% 0.73/1.19  demodulation time         0.02
% 0.73/1.19  orient time               0.01
% 0.73/1.19  weigh time                0.00
% 0.73/1.19  forward subsume time      0.00
% 0.73/1.19  back demod find time      0.01
% 0.73/1.19  conflict time             0.00
% 0.73/1.19  LRPO time                 0.00
% 0.73/1.19  store clause time         0.01
% 0.73/1.19  disable clause time       0.00
% 0.73/1.19  prime paramod time        0.00
% 0.73/1.19  semantics time            0.00
% 0.73/1.19  
% 0.73/1.19  EQP interrupted
%------------------------------------------------------------------------------