↑ Up

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

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

% Computer : n015.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:54 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,plain,
    equal(divide(divide(identity,divide(divide(divide(A,B),C),A)),C),B),
    file('GRP543-1.p',unknown),
    [] ).

cnf(2,plain,
    equal(multiply(A,B),divide(A,divide(identity,B))),
    file('GRP543-1.p',unknown),
    [] ).

cnf(4,plain,
    equal(divide(A,A),identity),
    inference(flip,[status(thm),theory(equality)],[1]),
    [iquote('flip(1)')] ).

cnf(5,plain,
    ~ equal(divide(divide(a3,divide(identity,b3)),divide(identity,c3)),divide(a3,divide(identity,divide(b3,divide(identity,c3))))),
    inference(demod,[status(thm),theory(equality)],[2,2,2,2]),
    [iquote('demod([2,2,2,2])')] ).

cnf(6,plain,
    equal(divide(divide(identity,divide(divide(A,B),divide(identity,divide(divide(divide(C,A),D),C)))),B),D),
    inference(para,[status(thm),theory(equality)],[1,1]),
    [iquote('para(1,1)')] ).

cnf(7,plain,
    equal(divide(divide(divide(A,B),C),A),divide(divide(identity,divide(B,identity)),C)),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,1]),1]),
    [iquote('para(1,1),flip(1)')] ).

cnf(8,plain,
    equal(divide(divide(identity,divide(divide(A,B),divide(identity,divide(divide(identity,divide(A,identity)),C)))),B),C),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[6]),7]),
    [iquote('back_demod(6),demod([7])')] ).

cnf(9,plain,
    equal(divide(divide(identity,divide(divide(identity,divide(A,identity)),B)),B),A),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),7]),
    [iquote('back_demod(1),demod([7])')] ).

cnf(10,plain,
    equal(divide(divide(identity,divide(identity,A)),A),identity),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,9]),4]),
    [iquote('para(4,9),demod([4])')] ).

cnf(11,plain,
    equal(divide(identity,divide(identity,divide(A,identity))),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,9]),4]),
    [iquote('para(4,9),demod([4])')] ).

cnf(12,plain,
    equal(divide(divide(identity,A),divide(identity,divide(A,identity))),identity),
    inference(para,[status(thm),theory(equality)],[11,10]),
    [iquote('para(11,10)')] ).

cnf(13,plain,
    equal(divide(A,divide(A,identity)),identity),
    inference(para,[status(thm),theory(equality)],[11,10]),
    [iquote('para(11,10)')] ).

cnf(15,plain,
    equal(divide(identity,divide(divide(identity,divide(A,identity)),identity)),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,9]),4]),
    [iquote('para(13,9),demod([4])')] ).

cnf(17,plain,
    equal(divide(A,identity),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,9]),4,11]),
    [iquote('para(12,9),demod([4,11])')] ).

cnf(18,plain,
    equal(divide(identity,divide(identity,A)),A),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[15]),17,17]),
    [iquote('back_demod(15),demod([17,17])')] ).

cnf(19,plain,
    equal(divide(divide(identity,divide(divide(identity,A),B)),B),A),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[9]),17]),
    [iquote('back_demod(9),demod([17])')] ).

cnf(20,plain,
    equal(divide(divide(identity,divide(divide(A,B),divide(identity,divide(divide(identity,A),C)))),B),C),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),17]),
    [iquote('back_demod(8),demod([17])')] ).

cnf(22,plain,
    equal(divide(divide(identity,divide(A,B)),B),divide(identity,A)),
    inference(para,[status(thm),theory(equality)],[18,19]),
    [iquote('para(18,19)')] ).

cnf(23,plain,
    equal(divide(divide(identity,divide(divide(identity,A),B)),A),B),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,20]),18]),
    [iquote('para(4,20),demod([18])')] ).

cnf(24,plain,
    equal(divide(divide(identity,divide(A,B)),divide(identity,A)),B),
    inference(para,[status(thm),theory(equality)],[18,23]),
    [iquote('para(18,23)')] ).

cnf(26,plain,
    equal(divide(divide(identity,divide(divide(A,B),A)),B),identity),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,20]),18]),
    [iquote('para(17,20),demod([18])')] ).

cnf(34,plain,
    equal(divide(divide(identity,A),B),divide(divide(identity,B),A)),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,22]),18]),
    [iquote('para(23,22),demod([18])')] ).

cnf(35,plain,
    equal(divide(A,divide(A,B)),B),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,23]),18]),
    [iquote('para(22,23),demod([18])')] ).

cnf(36,plain,
    equal(divide(divide(identity,divide(divide(identity,A),divide(identity,divide(divide(A,B),C)))),B),C),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,20]),35]),
    [iquote('para(22,20),demod([35])')] ).

cnf(42,plain,
    equal(divide(divide(identity,A),divide(identity,B)),divide(B,A)),
    inference(para,[status(thm),theory(equality)],[35,24]),
    [iquote('para(35,24)')] ).

cnf(50,plain,
    equal(divide(A,divide(identity,B)),divide(B,divide(identity,A))),
    inference(para,[status(thm),theory(equality)],[35,42]),
    [iquote('para(35,42)')] ).

cnf(58,plain,
    equal(divide(identity,divide(divide(A,B),A)),B),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,20]),4,17,22]),
    [iquote('para(26,20),demod([4,17,22])')] ).

cnf(60,plain,
    equal(divide(identity,divide(A,B)),divide(B,A)),
    inference(para,[status(thm),theory(equality)],[35,58]),
    [iquote('para(35,58)')] ).

cnf(65,plain,
    equal(divide(A,divide(identity,divide(B,A))),B),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,60]),35]),1]),
    [iquote('para(22,60),demod([35]),flip(1)')] ).

cnf(75,plain,
    equal(divide(identity,divide(divide(identity,A),B)),divide(A,divide(identity,B))),
    inference(para,[status(thm),theory(equality)],[34,60]),
    [iquote('para(34,60)')] ).

cnf(84,plain,
    equal(divide(divide(A,divide(divide(A,B),C)),B),C),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[36]),75,35]),
    [iquote('back_demod(36),demod([75,35])')] ).

cnf(127,plain,
    ~ equal(divide(divide(b3,divide(identity,a3)),divide(identity,c3)),divide(a3,divide(identity,divide(b3,divide(identity,c3))))),
    inference(para,[status(thm),theory(equality)],[50,5]),
    [iquote('para(50,5)')] ).

cnf(129,plain,
    equal(divide(divide(A,B),C),divide(identity,divide(B,divide(A,C)))),
    inference(para,[status(thm),theory(equality)],[65,84]),
    [iquote('para(65,84)')] ).

cnf(130,plain,
    ~ equal(divide(a3,divide(identity,divide(b3,divide(identity,c3)))),divide(a3,divide(identity,divide(b3,divide(identity,c3))))),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[127]),129,129,35]),
    [iquote('back_demod(127),demod([129,129,35])')] ).

cnf(131,plain,
    $false,
    inference(conflict,[status(thm)],[130]),
    [iquote('xx_conflict(130)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP543-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.12  % Command  : tptp2X_and_run_eqp %s
% 0.13/0.33  % Computer : n015.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jun 13 17:08:38 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.72/1.10  ----- EQP 0.9e, May 2009 -----
% 0.72/1.10  The job began on n015.cluster.edu, Mon Jun 13 17:08:39 2022
% 0.72/1.10  The command was "./eqp09e".
% 0.72/1.10  
% 0.72/1.10  set(prolog_style_variables).
% 0.72/1.10  set(lrpo).
% 0.72/1.10  set(basic_paramod).
% 0.72/1.10  set(functional_subsume).
% 0.72/1.10  set(ordered_paramod).
% 0.72/1.10  set(prime_paramod).
% 0.72/1.10  set(para_pairs).
% 0.72/1.10  assign(pick_given_ratio,4).
% 0.72/1.10  clear(print_kept).
% 0.72/1.10  clear(print_new_demod).
% 0.72/1.10  clear(print_back_demod).
% 0.72/1.10  clear(print_given).
% 0.72/1.10  assign(max_mem,64000).
% 0.72/1.10  end_of_commands.
% 0.72/1.10  
% 0.72/1.10  Usable:
% 0.72/1.10  end_of_list.
% 0.72/1.10  
% 0.72/1.10  Sos:
% 0.72/1.10  0 (wt=-1) [] divide(divide(identity,divide(divide(divide(A,B),C),A)),C) = B.
% 0.72/1.10  0 (wt=-1) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.10  0 (wt=-1) [] inverse(A) = divide(identity,A).
% 0.72/1.10  0 (wt=-1) [] identity = divide(A,A).
% 0.72/1.10  0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.72/1.10  end_of_list.
% 0.72/1.10  
% 0.72/1.10  Demodulators:
% 0.72/1.10  end_of_list.
% 0.72/1.10  
% 0.72/1.10  Passive:
% 0.72/1.10  end_of_list.
% 0.72/1.10  
% 0.72/1.10  Starting to process input.
% 0.72/1.10  
% 0.72/1.10  ** KEPT: 1 (wt=13) [] divide(divide(identity,divide(divide(divide(A,B),C),A)),C) = B.
% 0.72/1.10  1 is a new demodulator.
% 0.72/1.10  
% 0.72/1.10  ** KEPT: 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.10  2 is a new demodulator.
% 0.72/1.10  
% 0.72/1.10  ** KEPT: 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.72/1.10  3 is a new demodulator.
% 0.72/1.10  
% 0.72/1.10  ** KEPT: 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.10  4 is a new demodulator.
% 0.72/1.10  
% 0.72/1.10  ** KEPT: 5 (wt=19) [demod([2,2,2,2])] -(divide(divide(a3,divide(identity,b3)),divide(identity,c3)) = divide(a3,divide(identity,divide(b3,divide(identity,c3))))).
% 0.72/1.10  ---------------- PROOF FOUND ----------------
% 0.72/1.10  % SZS status Unsatisfiable
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  After processing input:
% 0.72/1.10  
% 0.72/1.10  Usable:
% 0.72/1.10  end_of_list.
% 0.72/1.10  
% 0.72/1.10  Sos:
% 0.72/1.10  4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.10  3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.72/1.10  2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.10  1 (wt=13) [] divide(divide(identity,divide(divide(divide(A,B),C),A)),C) = B.
% 0.72/1.10  5 (wt=19) [demod([2,2,2,2])] -(divide(divide(a3,divide(identity,b3)),divide(identity,c3)) = divide(a3,divide(identity,divide(b3,divide(identity,c3))))).
% 0.72/1.10  end_of_list.
% 0.72/1.10  
% 0.72/1.10  Demodulators:
% 0.72/1.10  1 (wt=13) [] divide(divide(identity,divide(divide(divide(A,B),C),A)),C) = B.
% 0.72/1.10  2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.10  3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.72/1.10  4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.10  end_of_list.
% 0.72/1.10  
% 0.72/1.10  Passive:
% 0.72/1.10  end_of_list.
% 0.72/1.10  
% 0.72/1.10  UNIT CONFLICT from 130 and x=x at   0.01 seconds.
% 0.72/1.10  
% 0.72/1.10  ---------------- PROOF ----------------
% 0.72/1.10  % SZS output start Refutation
% See solution above
% 0.72/1.10  ------------ end of proof -------------
% 0.72/1.10  
% 0.72/1.10  
% 0.72/1.10  ------------- memory usage ------------
% 0.72/1.10  Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.10    type (bytes each)        gets      frees     in use      avail      bytes
% 0.72/1.10  sym_ent (  96)               58          0         58          0      5.4 K
% 0.72/1.10  term (  16)               10269       8388       1881         20     36.6 K
% 0.72/1.10  gen_ptr (   8)            11618       3814       7804         34     61.2 K
% 0.72/1.10  context ( 808)             8600       8598          2          4      4.7 K
% 0.72/1.10  trail (  12)               1278       1278          0          4      0.0 K
% 0.72/1.10  bt_node (  68)             3515       3512          3         12      1.0 K
% 0.72/1.10  ac_position (285432)          0          0          0          0      0.0 K
% 0.72/1.10  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.72/1.10  ac_match_free_vars_pos (4020)
% 0.72/1.10                                0          0          0          0      0.0 K
% 0.72/1.10  discrim (  12)             1661       1002        659         19      7.9 K
% 0.72/1.10  flat (  40)               17445      17445          0         21      0.8 K
% 0.72/1.10  discrim_pos (  12)          625        625          0          1      0.0 K
% 0.72/1.10  fpa_head (  12)             542          0        542          0      6.4 K
% 0.72/1.10  fpa_tree (  28)             679        679          0         43      1.2 K
% 0.72/1.10  fpa_pos (  36)              223        223          0          1      0.0 K
% 0.72/1.10  literal (  12)              588        458        130          0      1.5 K
% 0.72/1.10  clause (  24)               588        458        130          0      3.0 K
% 0.72/1.10  list (  12)                 153         96         57          2      0.7 K
% 0.72/1.10  list_pos (  20)             677        364        313          3      6.2 K
% 0.72/1.10  pair_index (   40)              2          0          2          0      0.1 K
% 0.72/1.10  
% 0.72/1.10  -------------- statistics -------------
% 0.72/1.10  Clauses input                  5
% 0.72/1.10    Usable input                   0
% 0.72/1.10    Sos input                      5
% 0.72/1.10    Demodulators input             0
% 0.72/1.10    Passive input                  0
% 0.72/1.10  
% 0.72/1.10  Processed BS (before search)   5
% 0.72/1.10  Forward subsumed BS            0
% 0.72/1.10  Kept BS                        5
% 0.72/1.10  New demodulators BS            4
% 0.72/1.10  Back demodulated BS            0
% 0.72/1.10  
% 0.72/1.10  Clauses or pairs given       399
% 0.72/1.10  Clauses generated            414
% 0.72/1.10  Forward subsumed             289
% 0.72/1.10  Deleted by weight              0
% 0.72/1.10  Deleted by variable count      0
% 0.72/1.10  Kept                         125
% 0.72/1.10  New demodulators              90
% 0.72/1.10  Back demodulated              74
% 0.72/1.10  Ordered paramod prunes         0
% 0.72/1.10  Basic paramod prunes         997
% 0.72/1.10  Prime paramod prunes          42
% 0.72/1.10  Semantic prunes                0
% 0.72/1.10  
% 0.72/1.10  Rewrite attmepts            4076
% 0.72/1.10  Rewrites                     542
% 0.72/1.10  
% 0.72/1.10  FPA overloads                  0
% 0.72/1.10  FPA underloads                 0
% 0.72/1.10  
% 0.72/1.10  Usable size                    0
% 0.72/1.10  Sos size                      55
% 0.72/1.10  Demodulators size             34
% 0.72/1.10  Passive size                   0
% 0.72/1.10  Disabled size                 74
% 0.72/1.10  
% 0.72/1.10  Proofs found                   1
% 0.72/1.10  
% 0.72/1.10  ----------- times (seconds) ----------- Mon Jun 13 17:08:39 2022
% 0.72/1.10  
% 0.72/1.10  user CPU time             0.01   (0 hr, 0 min, 0 sec)
% 0.72/1.10  system CPU time           0.01   (0 hr, 0 min, 0 sec)
% 0.72/1.10  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.72/1.10  input time                0.00
% 0.72/1.10  paramodulation time       0.00
% 0.72/1.10  demodulation time         0.00
% 0.72/1.10  orient time               0.00
% 0.72/1.10  weigh time                0.00
% 0.72/1.10  forward subsume time      0.00
% 0.72/1.10  back demod find time      0.00
% 0.72/1.10  conflict time             0.00
% 0.72/1.10  LRPO time                 0.00
% 0.72/1.10  store clause time         0.00
% 0.72/1.10  disable clause time       0.00
% 0.72/1.10  prime paramod time        0.00
% 0.72/1.10  semantics time            0.00
% 0.72/1.10  
% 0.72/1.10  EQP interrupted
%------------------------------------------------------------------------------