↑ Up

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

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

% Computer : n023.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:30 EDT 2022

% Result   : Unsatisfiable 0.74s 1.18s
% Output   : Refutation 0.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   22 (  22 unt;   0 nHn;   2 RR)
%            Number of literals    :   22 (   0 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   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   :   45 (   9 sgn)

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

cnf(3,plain,
    equal(multiply(add(A,B),add(A,inverse(B))),A),
    file('BOO029-1.p',unknown),
    [] ).

cnf(4,plain,
    equal(multiply(A,add(B,add(A,C))),A),
    file('BOO029-1.p',unknown),
    [] ).

cnf(6,plain,
    equal(add(multiply(A,B),multiply(A,inverse(B))),A),
    file('BOO029-1.p',unknown),
    [] ).

cnf(7,plain,
    equal(add(A,B),add(B,A)),
    file('BOO029-1.p',unknown),
    [] ).

cnf(8,plain,
    equal(multiply(A,B),multiply(B,A)),
    file('BOO029-1.p',unknown),
    [] ).

cnf(9,plain,
    equal(add(add(A,B),C),add(A,add(B,C))),
    file('BOO029-1.p',unknown),
    [] ).

cnf(11,plain,
    equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
    file('BOO029-1.p',unknown),
    [] ).

cnf(13,plain,
    ~ equal(add(b,inverse(b)),add(a,inverse(a))),
    file('BOO029-1.p',unknown),
    [] ).

cnf(26,plain,
    equal(multiply(A,add(B,A)),A),
    inference(para,[status(thm),theory(equality)],[1,4]),
    [iquote('para(1,4)')] ).

cnf(29,plain,
    equal(multiply(A,add(A,B)),A),
    inference(para,[status(thm),theory(equality)],[7,26]),
    [iquote('para(7,26)')] ).

cnf(30,plain,
    equal(multiply(add(A,B),B),B),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,8]),1]),
    [iquote('para(26,8),flip(1)')] ).

cnf(37,plain,
    equal(multiply(A,multiply(B,add(C,A))),multiply(A,B)),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,4]),11]),
    [iquote('para(6,4),demod([11])')] ).

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

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

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

cnf(189,plain,
    equal(add(A,multiply(inverse(A),B)),add(B,A)),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[117]),188]),
    [iquote('back_demod(117),demod([188])')] ).

cnf(200,plain,
    equal(add(A,add(inverse(B),B)),add(B,inverse(B))),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,189]),9]),1]),
    [iquote('para(26,189),demod([9]),flip(1)')] ).

cnf(369,plain,
    equal(multiply(A,add(B,inverse(B))),A),
    inference(para,[status(thm),theory(equality)],[200,29]),
    [iquote('para(200,29)')] ).

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

cnf(392,plain,
    equal(add(A,inverse(A)),add(B,inverse(B))),
    inference(para,[status(thm),theory(equality)],[375,369]),
    [iquote('para(375,369)')] ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : BOO029-1 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13  % Command  : tptp2X_and_run_eqp %s
% 0.13/0.34  % Computer : n023.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 : Thu Jun  2 00:30:41 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.74/1.18  ----- EQP 0.9e, May 2009 -----
% 0.74/1.18  The job began on n023.cluster.edu, Thu Jun  2 00:30:41 2022
% 0.74/1.18  The command was "./eqp09e".
% 0.74/1.18  
% 0.74/1.18  set(prolog_style_variables).
% 0.74/1.18  set(lrpo).
% 0.74/1.18  set(basic_paramod).
% 0.74/1.18  set(functional_subsume).
% 0.74/1.18  set(ordered_paramod).
% 0.74/1.18  set(prime_paramod).
% 0.74/1.18  set(para_pairs).
% 0.74/1.18  assign(pick_given_ratio,4).
% 0.74/1.18  clear(print_kept).
% 0.74/1.18  clear(print_new_demod).
% 0.74/1.18  clear(print_back_demod).
% 0.74/1.18  clear(print_given).
% 0.74/1.18  assign(max_mem,64000).
% 0.74/1.18  end_of_commands.
% 0.74/1.18  
% 0.74/1.18  Usable:
% 0.74/1.18  end_of_list.
% 0.74/1.18  
% 0.74/1.18  Sos:
% 0.74/1.18  0 (wt=-1) [] add(A,multiply(B,multiply(A,C))) = A.
% 0.74/1.18  0 (wt=-1) [] add(add(multiply(A,B),multiply(B,C)),B) = B.
% 0.74/1.18  0 (wt=-1) [] multiply(add(A,B),add(A,inverse(B))) = A.
% 0.74/1.18  0 (wt=-1) [] multiply(A,add(B,add(A,C))) = A.
% 0.74/1.18  0 (wt=-1) [] multiply(multiply(add(A,B),add(B,C)),B) = B.
% 0.74/1.18  0 (wt=-1) [] add(multiply(A,B),multiply(A,inverse(B))) = A.
% 0.74/1.18  0 (wt=-1) [] add(A,B) = add(B,A).
% 0.74/1.18  0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 0.74/1.18  0 (wt=-1) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.74/1.18  0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.74/1.18  0 (wt=-1) [] -(add(b,inverse(b)) = add(a,inverse(a))).
% 0.74/1.18  end_of_list.
% 0.74/1.18  
% 0.74/1.18  Demodulators:
% 0.74/1.18  end_of_list.
% 0.74/1.18  
% 0.74/1.18  Passive:
% 0.74/1.18  end_of_list.
% 0.74/1.18  
% 0.74/1.18  Starting to process input.
% 0.74/1.18  
% 0.74/1.18  ** KEPT: 1 (wt=9) [] add(A,multiply(B,multiply(A,C))) = A.
% 0.74/1.18  1 is a new demodulator.
% 0.74/1.18  
% 0.74/1.18  ** KEPT: 2 (wt=11) [] add(add(multiply(A,B),multiply(B,C)),B) = B.
% 0.74/1.18  2 is a new demodulator.
% 0.74/1.18  
% 0.74/1.18  ** KEPT: 3 (wt=10) [] multiply(add(A,B),add(A,inverse(B))) = A.
% 0.74/1.18  3 is a new demodulator.
% 0.74/1.18  
% 0.74/1.18  ** KEPT: 4 (wt=9) [] multiply(A,add(B,add(A,C))) = A.
% 0.74/1.18  4 is a new demodulator.
% 0.74/1.18  
% 0.74/1.18  ** KEPT: 5 (wt=11) [] multiply(multiply(add(A,B),add(B,C)),B) = B.
% 0.74/1.18  5 is a new demodulator.
% 0.74/1.18  
% 0.74/1.18  ** KEPT: 6 (wt=10) [] add(multiply(A,B),multiply(A,inverse(B))) = A.
% 0.74/1.18  6 is a new demodulator.
% 0.74/1.18  
% 0.74/1.18  ** KEPT: 7 (wt=7) [] add(A,B) = add(B,A).
% 0.74/1.18  clause forward subsumed: 0 (wt=7) [flip(7)] add(B,A) = add(A,B).
% 0.74/1.18  
% 0.74/1.18  ** KEPT: 8 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.74/1.18  clause forward subsumed: 0 (wt=7) [flip(8)] multiply(B,A) = multiply(A,B).
% 0.74/1.18  
% 0.74/1.18  ** KEPT: 9 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.74/1.18  9 is a new demodulator.
% 0.74/1.18      -> 9 back demodulating 2.
% 0.74/1.18  
% 0.74/1.18  ** KEPT: 10 (wt=11) [back_demod(2),demod([9])] add(multiply(A,B),add(multiply(B,C),B)) = B.
% 0.74/1.18  10 is a new demodulator.
% 0.74/1.18  
% 0.74/1.18  ** KEPT: 11 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.74/1.18  11 is a new demodulator.
% 0.74/1.18      -> 11 back demodulating 5.
% 0.74/1.18  
% 0.74/1.18  ** KEPT: 12 (wt=11) [back_demod(5),demod([11])] multiply(add(A,B),multiply(add(B,C),B)) = B.
% 0.74/1.18  12 is a new demodulator.
% 0.74/1.18  
% 0.74/1.18  ** KEPT: 13 (wt=9) [] -(add(b,inverse(b)) = add(a,inverse(a))).
% 0.74/1.18  ---------------- PROOF FOUND ----------------
% 0.74/1.18  % SZS status Unsatisfiable
% 0.74/1.18  
% 0.74/1.18  
% 0.74/1.18  After processing input:
% 0.74/1.18  
% 0.74/1.18  Usable:
% 0.74/1.18  end_of_list.
% 0.74/1.18  
% 0.74/1.18  Sos:
% 0.74/1.18  7 (wt=7) [] add(A,B) = add(B,A).
% 0.74/1.18  8 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.74/1.18  1 (wt=9) [] add(A,multiply(B,multiply(A,C))) = A.
% 0.74/1.18  4 (wt=9) [] multiply(A,add(B,add(A,C))) = A.
% 0.74/1.18  13 (wt=9) [] -(add(b,inverse(b)) = add(a,inverse(a))).
% 0.74/1.18  3 (wt=10) [] multiply(add(A,B),add(A,inverse(B))) = A.
% 0.74/1.18  6 (wt=10) [] add(multiply(A,B),multiply(A,inverse(B))) = A.
% 0.74/1.18  9 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.74/1.18  10 (wt=11) [back_demod(2),demod([9])] add(multiply(A,B),add(multiply(B,C),B)) = B.
% 0.74/1.18  11 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.74/1.18  12 (wt=11) [back_demod(5),demod([11])] multiply(add(A,B),multiply(add(B,C),B)) = B.
% 0.74/1.18  end_of_list.
% 0.74/1.18  
% 0.74/1.18  Demodulators:
% 0.74/1.18  1 (wt=9) [] add(A,multiply(B,multiply(A,C))) = A.
% 0.74/1.18  3 (wt=10) [] multiply(add(A,B),add(A,inverse(B))) = A.
% 0.74/1.18  4 (wt=9) [] multiply(A,add(B,add(A,C))) = A.
% 0.74/1.18  6 (wt=10) [] add(multiply(A,B),multiply(A,inverse(B))) = A.
% 0.74/1.18  9 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.74/1.18  10 (wt=11) [back_demod(2),demod([9])] add(multiply(A,B),add(multiply(B,C),B)) = B.
% 0.74/1.18  11 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.74/1.18  12 (wt=11) [back_demod(5),demod([11])] multiply(add(A,B),multiply(add(B,C),B)) = B.
% 0.74/1.18  end_of_list.
% 0.74/1.18  
% 0.74/1.18  Passive:
% 0.74/1.18  end_of_list.
% 0.74/1.18  
% 0.74/1.18  UNIT CONFLICT from 392 and 13 at   0.02 seconds.
% 0.74/1.18  
% 0.74/1.18  ---------------- PROOF ----------------
% 0.74/1.18  % SZS output start Refutation
% See solution above
% 0.74/1.18  ------------ end of proof -------------
% 0.74/1.18  
% 0.74/1.18  
% 0.74/1.18  ------------- memory usage ------------
% 0.74/1.18  Memory dynamically allocated (tp_alloc): 488.
% 0.74/1.18    type (bytes each)        gets      frees     in use      avail      bytes
% 0.74/1.18  sym_ent (  96)               56          0         56          0      5.2 K
% 0.74/1.18  term (  16)               37168      31725       5443         30    105.4 K
% 0.74/1.18  gen_ptr (   8)            28794       8777      20017         21    156.5 K
% 0.74/1.18  context ( 808)            27594      27592          2          5      5.5 K
% 0.74/1.18  trail (  12)               2556       2556          0          6      0.1 K
% 0.74/1.18  bt_node (  68)            12430      12427          3          9      0.8 K
% 0.74/1.18  ac_position (285432)          0          0          0          0      0.0 K
% 0.74/1.18  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.74/1.18  ac_match_free_vars_pos (4020)
% 0.74/1.18                                0          0          0          0      0.0 K
% 0.74/1.18  discrim (  12)             4393        731       3662          0     42.9 K
% 0.74/1.18  flat (  40)               53583      53583          0         20      0.8 K
% 0.74/1.18  discrim_pos (  12)         1994       1994          0          1      0.0 K
% 0.74/1.18  fpa_head (  12)            1668          0       1668          0     19.5 K
% 0.74/1.18  fpa_tree (  28)             881        881          0          9      0.2 K
% 0.74/1.18  fpa_pos (  36)              746        746          0          1      0.0 K
% 0.74/1.18  literal (  12)             2289       1897        392          1      4.6 K
% 0.74/1.18  clause (  24)              2289       1897        392          1      9.2 K
% 0.74/1.18  list (  12)                 413        357         56          4      0.7 K
% 0.74/1.18  list_pos (  20)            1681        349       1332          0     26.0 K
% 0.74/1.18  pair_index (   40)              2          0          2          0      0.1 K
% 0.74/1.18  
% 0.74/1.18  -------------- statistics -------------
% 0.74/1.18  Clauses input                 11
% 0.74/1.18    Usable input                   0
% 0.74/1.18    Sos input                     11
% 0.74/1.18    Demodulators input             0
% 0.74/1.18    Passive input                  0
% 0.74/1.18  
% 0.74/1.18  Processed BS (before search)  15
% 0.74/1.18  Forward subsumed BS            2
% 0.74/1.18  Kept BS                       13
% 0.74/1.18  New demodulators BS           10
% 0.74/1.18  Back demodulated BS            2
% 0.74/1.18  
% 0.74/1.18  Clauses or pairs given      2427
% 0.74/1.18  Clauses generated           1567
% 0.74/1.18  Forward subsumed            1188
% 0.74/1.18  Deleted by weight              0
% 0.74/1.18  Deleted by variable count      0
% 0.74/1.18  Kept                         379
% 0.74/1.18  New demodulators             344
% 0.74/1.18  Back demodulated              69
% 0.74/1.18  Ordered paramod prunes         0
% 0.74/1.18  Basic paramod prunes        4946
% 0.74/1.18  Prime paramod prunes         116
% 0.74/1.18  Semantic prunes                0
% 0.74/1.18  
% 0.74/1.18  Rewrite attmepts           10386
% 0.74/1.18  Rewrites                    1703
% 0.74/1.18  
% 0.74/1.18  FPA overloads                  0
% 0.74/1.18  FPA underloads                 0
% 0.74/1.18  
% 0.74/1.18  Usable size                    0
% 0.74/1.18  Sos size                     320
% 0.74/1.18  Demodulators size            301
% 0.74/1.18  Passive size                   0
% 0.74/1.18  Disabled size                 71
% 0.74/1.18  
% 0.74/1.18  Proofs found                   1
% 0.74/1.18  
% 0.74/1.18  ----------- times (seconds) ----------- Thu Jun  2 00:30:41 2022
% 0.74/1.18  
% 0.74/1.18  user CPU time             0.02   (0 hr, 0 min, 0 sec)
% 0.74/1.18  system CPU time           0.05   (0 hr, 0 min, 0 sec)
% 0.74/1.18  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.74/1.18  input time                0.00
% 0.74/1.18  paramodulation time       0.01
% 0.74/1.18  demodulation time         0.00
% 0.74/1.18  orient time               0.00
% 0.74/1.18  weigh time                0.00
% 0.74/1.18  forward subsume time      0.00
% 0.74/1.18  back demod find time      0.00
% 0.74/1.18  conflict time             0.00
% 0.74/1.18  LRPO time                 0.00
% 0.74/1.18  store clause time         0.00
% 0.74/1.18  disable clause time       0.00
% 0.74/1.18  prime paramod time        0.00
% 0.74/1.18  semantics time            0.00
% 0.74/1.18  
% 0.74/1.18  EQP interrupted
%------------------------------------------------------------------------------