↑ Up

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

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

% Computer : n028.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 : Fri Jul 15 00:23:20 EDT 2022

% Result   : Unsatisfiable 0.41s 1.05s
% Output   : Refutation 0.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   11 (  11 unt;   0 nHn;   3 RR)
%            Number of literals    :   11 (   0 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,plain,
    equal(apply(apply(apply(b,A),B),C),apply(A,apply(B,C))),
    file('COL064-2.p',unknown),
    [] ).

cnf(2,plain,
    equal(apply(apply(t,A),B),apply(B,A)),
    file('COL064-2.p',unknown),
    [] ).

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

cnf(4,plain,
    ~ equal(apply(apply(apply(apply(t,apply(apply(b,b),t)),apply(b,apply(b,apply(t,x)))),y),z),apply(apply(z,x),y)),
    inference(demod,[status(thm),theory(equality)],[1,1,1]),
    [iquote('demod([1,1,1])')] ).

cnf(16,plain,
    equal(apply(apply(apply(t,A),apply(b,B)),C),apply(B,apply(A,C))),
    inference(para,[status(thm),theory(equality)],[3,1]),
    [iquote('para(3,1)')] ).

cnf(17,plain,
    ~ equal(apply(apply(z,x),y),apply(apply(t,x),apply(apply(b,apply(t,y)),z))),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),16,1,1]),1]),
    [iquote('back_demod(4),demod([16,1,1]),flip(1)')] ).

cnf(18,plain,
    equal(apply(apply(t,A),apply(apply(b,B),C)),apply(B,apply(C,A))),
    inference(para,[status(thm),theory(equality)],[3,1]),
    [iquote('para(3,1)')] ).

cnf(19,plain,
    equal(apply(A,apply(B,C)),apply(apply(t,C),apply(apply(b,A),B))),
    inference(flip,[status(thm),theory(equality)],[18]),
    [iquote('flip(18)')] ).

cnf(46,plain,
    equal(apply(apply(t,A),apply(apply(b,apply(t,B)),C)),apply(apply(C,A),B)),
    inference(para,[status(thm),theory(equality)],[19,2]),
    [iquote('para(19,2)')] ).

cnf(47,plain,
    equal(apply(apply(A,B),C),apply(apply(t,B),apply(apply(b,apply(t,C)),A))),
    inference(flip,[status(thm),theory(equality)],[46]),
    [iquote('flip(46)')] ).

cnf(48,plain,
    $false,
    inference(conflict,[status(thm)],[47,17]),
    [iquote('conflict(47,17)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : COL064-2 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.11/0.12  % Command  : tptp2X_and_run_eqp %s
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue May 31 08:19:20 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.41/1.05  ----- EQP 0.9e, May 2009 -----
% 0.41/1.05  The job began on n028.cluster.edu, Tue May 31 08:19:21 2022
% 0.41/1.05  The command was "./eqp09e".
% 0.41/1.05  
% 0.41/1.05  set(prolog_style_variables).
% 0.41/1.05  set(lrpo).
% 0.41/1.05  set(basic_paramod).
% 0.41/1.05  set(functional_subsume).
% 0.41/1.05  set(ordered_paramod).
% 0.41/1.05  set(prime_paramod).
% 0.41/1.05  set(para_pairs).
% 0.41/1.05  assign(pick_given_ratio,4).
% 0.41/1.05  clear(print_kept).
% 0.41/1.05  clear(print_new_demod).
% 0.41/1.05  clear(print_back_demod).
% 0.41/1.05  clear(print_given).
% 0.41/1.05  assign(max_mem,64000).
% 0.41/1.05  end_of_commands.
% 0.41/1.05  
% 0.41/1.05  Usable:
% 0.41/1.05  end_of_list.
% 0.41/1.05  
% 0.41/1.05  Sos:
% 0.41/1.05  0 (wt=-1) [] apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)).
% 0.41/1.05  0 (wt=-1) [] apply(apply(t,A),B) = apply(B,A).
% 0.41/1.05  0 (wt=-1) [] -(apply(apply(apply(apply(apply(b,apply(t,apply(apply(b,b),t))),apply(apply(b,b),apply(apply(b,b),t))),x),y),z) = apply(apply(z,x),y)).
% 0.41/1.05  end_of_list.
% 0.41/1.05  
% 0.41/1.05  Demodulators:
% 0.41/1.05  end_of_list.
% 0.41/1.05  
% 0.41/1.05  Passive:
% 0.41/1.05  end_of_list.
% 0.41/1.05  
% 0.41/1.05  Starting to process input.
% 0.41/1.05  
% 0.41/1.05  ** KEPT: 1 (wt=13) [] apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)).
% 0.41/1.05  1 is a new demodulator.
% 0.41/1.05  
% 0.41/1.05  ** KEPT: 2 (wt=9) [] apply(apply(t,A),B) = apply(B,A).
% 0.41/1.05  
% 0.41/1.05  ** KEPT: 3 (wt=9) [flip(2)] apply(A,B) = apply(apply(t,B),A).
% 0.41/1.05  clause forward subsumed: 0 (wt=9) [flip(3)] apply(apply(t,B),A) = apply(A,B).
% 0.41/1.05  
% 0.41/1.05  ** KEPT: 4 (wt=25) [demod([1,1,1])] -(apply(apply(apply(apply(t,apply(apply(b,b),t)),apply(b,apply(b,apply(t,x)))),y),z) = apply(apply(z,x),y)).
% 0.41/1.05  ---------------- PROOF FOUND ----------------
% 0.41/1.05  % SZS status Unsatisfiable
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  After processing input:
% 0.41/1.05  
% 0.41/1.05  Usable:
% 0.41/1.05  end_of_list.
% 0.41/1.05  
% 0.41/1.05  Sos:
% 0.41/1.05  2 (wt=9) [] apply(apply(t,A),B) = apply(B,A).
% 0.41/1.05  3 (wt=9) [flip(2)] apply(A,B) = apply(apply(t,B),A).
% 0.41/1.05  1 (wt=13) [] apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)).
% 0.41/1.05  4 (wt=25) [demod([1,1,1])] -(apply(apply(apply(apply(t,apply(apply(b,b),t)),apply(b,apply(b,apply(t,x)))),y),z) = apply(apply(z,x),y)).
% 0.41/1.05  end_of_list.
% 0.41/1.05  
% 0.41/1.05  Demodulators:
% 0.41/1.05  1 (wt=13) [] apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)).
% 0.41/1.05  end_of_list.
% 0.41/1.05  
% 0.41/1.05  Passive:
% 0.41/1.05  end_of_list.
% 0.41/1.05  
% 0.41/1.05  UNIT CONFLICT from 47 and 17 at   0.00 seconds.
% 0.41/1.05  
% 0.41/1.05  ---------------- PROOF ----------------
% 0.41/1.05  % SZS output start Refutation
% See solution above
% 0.41/1.05  ------------ end of proof -------------
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  ------------- memory usage ------------
% 0.41/1.05  Memory dynamically allocated (tp_alloc): 488.
% 0.41/1.05    type (bytes each)        gets      frees     in use      avail      bytes
% 0.41/1.05  sym_ent (  96)               57          0         57          0      5.3 K
% 0.41/1.05  term (  16)                3495       2742        753         26     15.0 K
% 0.41/1.05  gen_ptr (   8)             3299        454       2845         10     22.3 K
% 0.41/1.05  context ( 808)             2420       2418          2          3      3.9 K
% 0.41/1.05  trail (  12)                 54         54          0          3      0.0 K
% 0.41/1.05  bt_node (  68)              822        819          3          6      0.6 K
% 0.41/1.05  ac_position (285432)          0          0          0          0      0.0 K
% 0.41/1.05  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.41/1.05  ac_match_free_vars_pos (4020)
% 0.41/1.05                                0          0          0          0      0.0 K
% 0.41/1.05  discrim (  12)              497         25        472          0      5.5 K
% 0.41/1.05  flat (  40)                6543       6543          0         19      0.7 K
% 0.41/1.05  discrim_pos (  12)          103        103          0          1      0.0 K
% 0.41/1.05  fpa_head (  12)             260          0        260          0      3.0 K
% 0.41/1.05  fpa_tree (  28)             158        158          0         15      0.4 K
% 0.41/1.05  fpa_pos (  36)               66         66          0          1      0.0 K
% 0.41/1.05  literal (  12)              226        179         47          1      0.6 K
% 0.41/1.05  clause (  24)               226        179         47          1      1.1 K
% 0.41/1.05  list (  12)                  78         22         56          3      0.7 K
% 0.41/1.05  list_pos (  20)             162          7        155          0      3.0 K
% 0.41/1.05  pair_index (   40)              2          0          2          0      0.1 K
% 0.41/1.05  
% 0.41/1.05  -------------- statistics -------------
% 0.41/1.05  Clauses input                  3
% 0.41/1.05    Usable input                   0
% 0.41/1.05    Sos input                      3
% 0.41/1.05    Demodulators input             0
% 0.41/1.05    Passive input                  0
% 0.41/1.05  
% 0.41/1.05  Processed BS (before search)   5
% 0.41/1.05  Forward subsumed BS            1
% 0.41/1.05  Kept BS                        4
% 0.41/1.05  New demodulators BS            1
% 0.41/1.05  Back demodulated BS            0
% 0.41/1.05  
% 0.41/1.05  Clauses or pairs given        59
% 0.41/1.05  Clauses generated            121
% 0.41/1.05  Forward subsumed              78
% 0.41/1.05  Deleted by weight              0
% 0.41/1.05  Deleted by variable count      0
% 0.41/1.05  Kept                          43
% 0.41/1.05  New demodulators              18
% 0.41/1.05  Back demodulated               1
% 0.41/1.05  Ordered paramod prunes         0
% 0.41/1.05  Basic paramod prunes         114
% 0.41/1.05  Prime paramod prunes           0
% 0.41/1.05  Semantic prunes                0
% 0.41/1.05  
% 0.41/1.05  Rewrite attmepts            1419
% 0.41/1.05  Rewrites                      53
% 0.41/1.05  
% 0.41/1.05  FPA overloads                  0
% 0.41/1.05  FPA underloads                 0
% 0.41/1.05  
% 0.41/1.05  Usable size                    0
% 0.41/1.05  Sos size                      45
% 0.41/1.05  Demodulators size             19
% 0.41/1.05  Passive size                   0
% 0.41/1.05  Disabled size                  1
% 0.41/1.05  
% 0.41/1.05  Proofs found                   1
% 0.41/1.05  
% 0.41/1.05  ----------- times (seconds) ----------- Tue May 31 08:19:21 2022
% 0.41/1.05  
% 0.41/1.05  user CPU time             0.00   (0 hr, 0 min, 0 sec)
% 0.41/1.05  system CPU time           0.00   (0 hr, 0 min, 0 sec)
% 0.41/1.05  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.41/1.05  input time                0.00
% 0.41/1.05  paramodulation time       0.00
% 0.41/1.05  demodulation time         0.00
% 0.41/1.05  orient time               0.00
% 0.41/1.05  weigh time                0.00
% 0.41/1.05  forward subsume time      0.00
% 0.41/1.05  back demod find time      0.00
% 0.41/1.05  conflict time             0.00
% 0.41/1.05  LRPO time                 0.00
% 0.41/1.05  store clause time         0.00
% 0.41/1.05  disable clause time       0.00
% 0.41/1.05  prime paramod time        0.00
% 0.41/1.05  semantics time            0.00
% 0.41/1.05  
% 0.41/1.05  EQP interrupted
%------------------------------------------------------------------------------