↑ Up

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

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

% Computer : n016.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:33 EDT 2022

% Result   : Unsatisfiable 0.40s 0.98s
% Output   : Refutation 0.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   11 (  11 unt;   0 nHn;   4 RR)
%            Number of literals    :   11 (   0 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   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   :   32 (   0 sgn)

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

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

cnf(3,plain,
    equal(divide(A,inverse(B)),multiply(A,B)),
    inference(flip,[status(thm),theory(equality)],[2]),
    [iquote('flip(2)')] ).

cnf(4,plain,
    ~ equal(multiply(inverse(b1),b1),multiply(inverse(a1),a1)),
    inference(flip,[status(thm),theory(equality)],[1]),
    [iquote('flip(1)')] ).

cnf(5,plain,
    ~ equal(divide(inverse(b1),inverse(b1)),multiply(inverse(a1),a1)),
    inference(para,[status(thm),theory(equality)],[2,4]),
    [iquote('para(2,4)')] ).

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

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

cnf(29,plain,
    equal(divide(A,A),divide(divide(B,B),divide(divide(divide(C,divide(D,E)),inverse(D)),multiply(C,E)))),
    inference(flip,[status(thm),theory(equality)],[28]),
    [iquote('flip(28)')] ).

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

cnf(43,plain,
    ~ equal(divide(divide(A,A),divide(divide(divide(B,divide(C,D)),inverse(C)),multiply(B,D))),multiply(inverse(a1),a1)),
    inference(para,[status(thm),theory(equality)],[29,5]),
    [iquote('para(29,5)')] ).

cnf(44,plain,
    $false,
    inference(conflict,[status(thm)],[43,35]),
    [iquote('conflict(43,35)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : GRP466-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.12  % Command  : tptp2X_and_run_eqp %s
% 0.12/0.32  % Computer : n016.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Tue Jun 14 09:54:30 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.40/0.98  ----- EQP 0.9e, May 2009 -----
% 0.40/0.98  The job began on n016.cluster.edu, Tue Jun 14 09:54:31 2022
% 0.40/0.98  The command was "./eqp09e".
% 0.40/0.98  
% 0.40/0.98  set(prolog_style_variables).
% 0.40/0.98  set(lrpo).
% 0.40/0.98  set(basic_paramod).
% 0.40/0.98  set(functional_subsume).
% 0.40/0.98  set(ordered_paramod).
% 0.40/0.98  set(prime_paramod).
% 0.40/0.98  set(para_pairs).
% 0.40/0.98  assign(pick_given_ratio,4).
% 0.40/0.98  clear(print_kept).
% 0.40/0.98  clear(print_new_demod).
% 0.40/0.98  clear(print_back_demod).
% 0.40/0.98  clear(print_given).
% 0.40/0.98  assign(max_mem,64000).
% 0.40/0.98  end_of_commands.
% 0.40/0.98  
% 0.40/0.98  Usable:
% 0.40/0.98  end_of_list.
% 0.40/0.98  
% 0.40/0.98  Sos:
% 0.40/0.98  0 (wt=-1) [] divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D)))) = C.
% 0.40/0.98  0 (wt=-1) [] multiply(A,B) = divide(A,inverse(B)).
% 0.40/0.98  0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.40/0.98  end_of_list.
% 0.40/0.98  
% 0.40/0.98  Demodulators:
% 0.40/0.98  end_of_list.
% 0.40/0.98  
% 0.40/0.98  Passive:
% 0.40/0.98  end_of_list.
% 0.40/0.98  
% 0.40/0.98  Starting to process input.
% 0.40/0.98  
% 0.40/0.98  ** KEPT: 1 (wt=16) [] divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D)))) = C.
% 0.40/0.98  1 is a new demodulator.
% 0.40/0.98  
% 0.40/0.98  ** KEPT: 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.40/0.98  
% 0.40/0.98  ** KEPT: 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.40/0.98  clause forward subsumed: 0 (wt=8) [flip(3)] multiply(A,B) = divide(A,inverse(B)).
% 0.40/0.98  
% 0.40/0.98  ** KEPT: 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.40/0.98  ---------------- PROOF FOUND ----------------
% 0.40/0.98  % SZS status Unsatisfiable
% 0.40/0.98  
% 0.40/0.98  
% 0.40/0.98  After processing input:
% 0.40/0.98  
% 0.40/0.98  Usable:
% 0.40/0.98  end_of_list.
% 0.40/0.98  
% 0.40/0.98  Sos:
% 0.40/0.98  2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.40/0.98  3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.40/0.98  4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.40/0.98  1 (wt=16) [] divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D)))) = C.
% 0.40/0.98  end_of_list.
% 0.40/0.98  
% 0.40/0.98  Demodulators:
% 0.40/0.98  1 (wt=16) [] divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D)))) = C.
% 0.40/0.98  end_of_list.
% 0.40/0.98  
% 0.40/0.98  Passive:
% 0.40/0.98  end_of_list.
% 0.40/0.98  
% 0.40/0.98  UNIT CONFLICT from 43 and 35 at   0.00 seconds.
% 0.40/0.98  
% 0.40/0.98  ---------------- PROOF ----------------
% 0.40/0.98  % SZS output start Refutation
% See solution above
% 0.40/0.98  ------------ end of proof -------------
% 0.40/0.98  
% 0.40/0.98  
% 0.40/0.98  ------------- memory usage ------------
% 0.40/0.98  Memory dynamically allocated (tp_alloc): 488.
% 0.40/0.98    type (bytes each)        gets      frees     in use      avail      bytes
% 0.40/0.98  sym_ent (  96)               57          0         57          0      5.3 K
% 0.40/0.98  term (  16)                2823       1824        999         23     19.8 K
% 0.40/0.98  gen_ptr (   8)             4826        206       4620         10     36.2 K
% 0.40/0.98  context ( 808)             1902       1900          2          2      3.2 K
% 0.40/0.98  trail (  12)                 78         78          0          8      0.1 K
% 0.40/0.98  bt_node (  68)              721        717          4         19      1.5 K
% 0.40/0.98  ac_position (285432)          0          0          0          0      0.0 K
% 0.40/0.98  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.40/0.98  ac_match_free_vars_pos (4020)
% 0.40/0.98                                0          0          0          0      0.0 K
% 0.40/0.98  discrim (  12)              772          0        772          0      9.0 K
% 0.40/0.98  flat (  40)                4793       4793          0         43      1.7 K
% 0.40/0.98  discrim_pos (  12)           36         36          0          1      0.0 K
% 0.40/0.98  fpa_head (  12)             566          0        566          0      6.6 K
% 0.40/0.98  fpa_tree (  28)             157        157          0         25      0.7 K
% 0.40/0.98  fpa_pos (  36)               57         57          0          1      0.0 K
% 0.40/0.98  literal (  12)              145        102         43          1      0.5 K
% 0.40/0.98  clause (  24)               145        102         43          1      1.0 K
% 0.40/0.98  list (  12)                  73         17         56          3      0.7 K
% 0.40/0.98  list_pos (  20)             143          3        140          0      2.7 K
% 0.40/0.98  pair_index (   40)              2          0          2          0      0.1 K
% 0.40/0.98  
% 0.40/0.98  -------------- statistics -------------
% 0.40/0.98  Clauses input                  3
% 0.40/0.98    Usable input                   0
% 0.40/0.98    Sos input                      3
% 0.40/0.98    Demodulators input             0
% 0.40/0.98    Passive input                  0
% 0.40/0.98  
% 0.40/0.98  Processed BS (before search)   5
% 0.40/0.98  Forward subsumed BS            1
% 0.40/0.98  Kept BS                        4
% 0.40/0.98  New demodulators BS            1
% 0.40/0.98  Back demodulated BS            0
% 0.40/0.98  
% 0.40/0.98  Clauses or pairs given        74
% 0.40/0.98  Clauses generated             79
% 0.40/0.98  Forward subsumed              40
% 0.40/0.98  Deleted by weight              0
% 0.40/0.98  Deleted by variable count      0
% 0.40/0.98  Kept                          39
% 0.40/0.98  New demodulators              13
% 0.40/0.98  Back demodulated               0
% 0.40/0.98  Ordered paramod prunes         0
% 0.40/0.98  Basic paramod prunes         164
% 0.40/0.98  Prime paramod prunes           0
% 0.40/0.98  Semantic prunes                0
% 0.40/0.98  
% 0.40/0.98  Rewrite attmepts             974
% 0.40/0.98  Rewrites                      14
% 0.40/0.98  
% 0.40/0.98  FPA overloads                  0
% 0.40/0.98  FPA underloads                 0
% 0.40/0.98  
% 0.40/0.98  Usable size                    0
% 0.40/0.98  Sos size                      42
% 0.40/0.98  Demodulators size             14
% 0.40/0.98  Passive size                   0
% 0.40/0.98  Disabled size                  0
% 0.40/0.98  
% 0.40/0.98  Proofs found                   1
% 0.40/0.98  
% 0.40/0.98  ----------- times (seconds) ----------- Tue Jun 14 09:54:31 2022
% 0.40/0.98  
% 0.40/0.98  user CPU time             0.00   (0 hr, 0 min, 0 sec)
% 0.40/0.98  system CPU time           0.00   (0 hr, 0 min, 0 sec)
% 0.40/0.98  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.40/0.98  input time                0.00
% 0.40/0.98  paramodulation time       0.00
% 0.40/0.98  demodulation time         0.00
% 0.40/0.98  orient time               0.00
% 0.40/0.98  weigh time                0.00
% 0.40/0.98  forward subsume time      0.00
% 0.40/0.98  back demod find time      0.00
% 0.40/0.98  conflict time             0.00
% 0.40/0.98  LRPO time                 0.00
% 0.40/0.98  store clause time         0.00
% 0.40/0.98  disable clause time       0.00
% 0.40/0.98  prime paramod time        0.00
% 0.40/0.98  semantics time            0.00
% 0.40/0.98  
% 0.40/0.98  EQP interrupted
%------------------------------------------------------------------------------