TSTP Solution File: BOO005-4 by EQP---0.9e

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : EQP---0.9e
% Problem  : BOO005-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_eqp %s

% Computer : n032.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:04 EDT 2022

% Result   : Unsatisfiable 0.48s 0.88s
% Output   : Refutation 0.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   12 (  12 unt;   0 nHn;   2 RR)
%            Number of literals    :   12 (   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   :   19 (   1 sgn)

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

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

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

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

cnf(5,plain,
    equal(add(multiply(add(A,B),A),multiply(add(A,B),C)),add(A,multiply(B,C))),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),4]),
    [iquote('back_demod(3),demod([4])')] ).

cnf(7,plain,
    equal(multiply(A,multiplicative_identity),A),
    file('BOO005-4.p',unknown),
    [] ).

cnf(8,plain,
    equal(add(A,inverse(A)),multiplicative_identity),
    file('BOO005-4.p',unknown),
    [] ).

cnf(10,plain,
    ~ equal(add(a,multiplicative_identity),multiplicative_identity),
    file('BOO005-4.p',unknown),
    [] ).

cnf(21,plain,
    equal(multiply(multiplicative_identity,A),A),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,2]),1]),
    [iquote('para(7,2),flip(1)')] ).

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

cnf(70,plain,
    equal(add(A,multiplicative_identity),multiplicative_identity),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,34]),8]),1]),
    [iquote('para(7,34),demod([8]),flip(1)')] ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : BOO005-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.10  % Command  : tptp2X_and_run_eqp %s
% 0.10/0.28  % Computer : n032.cluster.edu
% 0.10/0.28  % Model    : x86_64 x86_64
% 0.10/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28  % Memory   : 8042.1875MB
% 0.10/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28  % CPULimit : 300
% 0.10/0.28  % WCLimit  : 600
% 0.10/0.28  % DateTime : Wed Jun  1 21:50:30 EDT 2022
% 0.10/0.28  % CPUTime  : 
% 0.48/0.88  ----- EQP 0.9e, May 2009 -----
% 0.48/0.88  The job began on n032.cluster.edu, Wed Jun  1 21:50:30 2022
% 0.48/0.88  The command was "./eqp09e".
% 0.48/0.88  
% 0.48/0.88  set(prolog_style_variables).
% 0.48/0.88  set(lrpo).
% 0.48/0.88  set(basic_paramod).
% 0.48/0.88  set(functional_subsume).
% 0.48/0.88  set(ordered_paramod).
% 0.48/0.88  set(prime_paramod).
% 0.48/0.88  set(para_pairs).
% 0.48/0.88  assign(pick_given_ratio,4).
% 0.48/0.88  clear(print_kept).
% 0.48/0.88  clear(print_new_demod).
% 0.48/0.88  clear(print_back_demod).
% 0.48/0.88  clear(print_given).
% 0.48/0.88  assign(max_mem,64000).
% 0.48/0.88  end_of_commands.
% 0.48/0.88  
% 0.48/0.88  Usable:
% 0.48/0.88  end_of_list.
% 0.48/0.88  
% 0.48/0.88  Sos:
% 0.48/0.88  0 (wt=-1) [] add(A,B) = add(B,A).
% 0.48/0.88  0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 0.48/0.88  0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 0.48/0.88  0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.48/0.88  0 (wt=-1) [] add(A,additive_identity) = A.
% 0.48/0.88  0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 0.48/0.88  0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 0.48/0.88  0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 0.48/0.88  0 (wt=-1) [] -(add(a,multiplicative_identity) = multiplicative_identity).
% 0.48/0.88  end_of_list.
% 0.48/0.88  
% 0.48/0.88  Demodulators:
% 0.48/0.88  end_of_list.
% 0.48/0.88  
% 0.48/0.88  Passive:
% 0.48/0.88  end_of_list.
% 0.48/0.88  
% 0.48/0.88  Starting to process input.
% 0.48/0.88  
% 0.48/0.88  ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.48/0.88  clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.48/0.88  
% 0.48/0.88  ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.48/0.88  clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 0.48/0.88  
% 0.48/0.88  ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 0.48/0.88  3 is a new demodulator.
% 0.48/0.88  
% 0.48/0.88  ** KEPT: 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.48/0.88  4 is a new demodulator.
% 0.48/0.88      -> 4 back demodulating 3.
% 0.48/0.88  
% 0.48/0.88  ** KEPT: 5 (wt=17) [back_demod(3),demod([4])] add(multiply(add(A,B),A),multiply(add(A,B),C)) = add(A,multiply(B,C)).
% 0.48/0.88  5 is a new demodulator.
% 0.48/0.88  
% 0.48/0.88  ** KEPT: 6 (wt=5) [] add(A,additive_identity) = A.
% 0.48/0.88  6 is a new demodulator.
% 0.48/0.88  
% 0.48/0.88  ** KEPT: 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.48/0.88  7 is a new demodulator.
% 0.48/0.88  
% 0.48/0.88  ** KEPT: 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.48/0.88  8 is a new demodulator.
% 0.48/0.88  
% 0.48/0.88  ** KEPT: 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.48/0.88  9 is a new demodulator.
% 0.48/0.88  
% 0.48/0.88  ** KEPT: 10 (wt=5) [] -(add(a,multiplicative_identity) = multiplicative_identity).
% 0.48/0.88  ---------------- PROOF FOUND ----------------
% 0.48/0.88  % SZS status Unsatisfiable
% 0.48/0.88  
% 0.48/0.88  
% 0.48/0.88  After processing input:
% 0.48/0.88  
% 0.48/0.88  Usable:
% 0.48/0.88  end_of_list.
% 0.48/0.88  
% 0.48/0.88  Sos:
% 0.48/0.88  6 (wt=5) [] add(A,additive_identity) = A.
% 0.48/0.88  7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.48/0.88  10 (wt=5) [] -(add(a,multiplicative_identity) = multiplicative_identity).
% 0.48/0.88  8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.48/0.88  9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.48/0.88  1 (wt=7) [] add(A,B) = add(B,A).
% 0.48/0.88  2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.48/0.88  4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.48/0.88  5 (wt=17) [back_demod(3),demod([4])] add(multiply(add(A,B),A),multiply(add(A,B),C)) = add(A,multiply(B,C)).
% 0.48/0.88  end_of_list.
% 0.48/0.88  
% 0.48/0.88  Demodulators:
% 0.48/0.88  4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.48/0.88  5 (wt=17) [back_demod(3),demod([4])] add(multiply(add(A,B),A),multiply(add(A,B),C)) = add(A,multiply(B,C)).
% 0.48/0.88  6 (wt=5) [] add(A,additive_identity) = A.
% 0.48/0.88  7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.48/0.88  8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.48/0.88  9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.48/0.88  end_of_list.
% 0.48/0.88  
% 0.48/0.88  Passive:
% 0.48/0.88  end_of_list.
% 0.48/0.88  
% 0.48/0.88  UNIT CONFLICT from 70 and 10 at   0.00 seconds.
% 0.48/0.88  
% 0.48/0.88  ---------------- PROOF ----------------
% 0.48/0.88  % SZS output start Refutation
% See solution above
% 0.48/0.88  ------------ end of proof -------------
% 0.48/0.88  
% 0.48/0.88  
% 0.48/0.88  ------------- memory usage ------------
% 0.48/0.88  Memory dynamically allocated (tp_alloc): 488.
% 0.48/0.88    type (bytes each)        gets      frees     in use      avail      bytes
% 0.48/0.88  sym_ent (  96)               57          0         57          0      5.3 K
% 0.48/0.88  term (  16)                3243       2246        997         23     19.6 K
% 0.48/0.88  gen_ptr (   8)             3862        401       3461         11     27.1 K
% 0.48/0.88  context ( 808)             2393       2391          2          3      3.9 K
% 0.48/0.88  trail (  12)                101        101          0          4      0.0 K
% 0.48/0.88  bt_node (  68)              826        823          3          8      0.7 K
% 0.48/0.88  ac_position (285432)          0          0          0          0      0.0 K
% 0.48/0.88  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.48/0.88  ac_match_free_vars_pos (4020)
% 0.48/0.88                                0          0          0          0      0.0 K
% 0.48/0.88  discrim (  12)              852         17        835          0      9.8 K
% 0.48/0.88  flat (  40)                4530       4530          0         29      1.1 K
% 0.48/0.88  discrim_pos (  12)           94         94          0          1      0.0 K
% 0.48/0.88  fpa_head (  12)             416          0        416          0      4.9 K
% 0.48/0.88  fpa_tree (  28)              93         93          0          7      0.2 K
% 0.48/0.88  fpa_pos (  36)              107        107          0          1      0.0 K
% 0.48/0.88  literal (  12)              232        162         70          1      0.8 K
% 0.48/0.88  clause (  24)               232        162         70          1      1.7 K
% 0.48/0.88  list (  12)                  96         40         56          4      0.7 K
% 0.48/0.88  list_pos (  20)             255         14        241          0      4.7 K
% 0.48/0.88  pair_index (   40)              2          0          2          0      0.1 K
% 0.48/0.88  
% 0.48/0.88  -------------- statistics -------------
% 0.48/0.88  Clauses input                  9
% 0.48/0.88    Usable input                   0
% 0.48/0.88    Sos input                      9
% 0.48/0.88    Demodulators input             0
% 0.48/0.88    Passive input                  0
% 0.48/0.88  
% 0.48/0.88  Processed BS (before search)  12
% 0.48/0.88  Forward subsumed BS            2
% 0.48/0.88  Kept BS                       10
% 0.48/0.88  New demodulators BS            7
% 0.48/0.88  Back demodulated BS            1
% 0.48/0.88  
% 0.48/0.88  Clauses or pairs given       228
% 0.48/0.88  Clauses generated            128
% 0.48/0.88  Forward subsumed              68
% 0.48/0.88  Deleted by weight              0
% 0.48/0.88  Deleted by variable count      0
% 0.48/0.88  Kept                          60
% 0.48/0.88  New demodulators              30
% 0.48/0.88  Back demodulated               0
% 0.48/0.88  Ordered paramod prunes         0
% 0.48/0.88  Basic paramod prunes         342
% 0.48/0.88  Prime paramod prunes           7
% 0.48/0.88  Semantic prunes                0
% 0.48/0.88  
% 0.48/0.88  Rewrite attmepts            1017
% 0.48/0.88  Rewrites                      66
% 0.48/0.88  
% 0.48/0.88  FPA overloads                  0
% 0.48/0.88  FPA underloads                 0
% 0.48/0.88  
% 0.48/0.88  Usable size                    0
% 0.48/0.88  Sos size                      68
% 0.48/0.88  Demodulators size             36
% 0.48/0.88  Passive size                   0
% 0.48/0.88  Disabled size                  1
% 0.48/0.88  
% 0.48/0.88  Proofs found                   1
% 0.48/0.88  
% 0.48/0.88  ----------- times (seconds) ----------- Wed Jun  1 21:50:30 2022
% 0.48/0.88  
% 0.48/0.88  user CPU time             0.00   (0 hr, 0 min, 0 sec)
% 0.48/0.88  system CPU time           0.00   (0 hr, 0 min, 0 sec)
% 0.48/0.88  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.48/0.88  input time                0.00
% 0.48/0.88  paramodulation time       0.00
% 0.48/0.88  demodulation time         0.00
% 0.48/0.88  orient time               0.00
% 0.48/0.88  weigh time                0.00
% 0.48/0.88  forward subsume time      0.00
% 0.48/0.88  back demod find time      0.00
% 0.48/0.88  conflict time             0.00
% 0.48/0.88  LRPO time                 0.00
% 0.48/0.88  store clause time         0.00
% 0.48/0.88  disable clause time       0.00
% 0.48/0.88  prime paramod time        0.00
% 0.48/0.88  semantics time            0.00
% 0.48/0.88  
% 0.48/0.88  EQP interrupted
%------------------------------------------------------------------------------