↑ Up

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

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

% Computer : n017.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:13 EDT 2022

% Result   : Unsatisfiable 0.40s 1.05s
% Output   : Refutation 0.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of clauses     :    8 (   8 unt;   0 nHn;   3 RR)
%            Number of literals    :    8 (   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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   15 (   0 sgn)

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

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

cnf(3,plain,
    equal(apply(apply(l,A),B),apply(A,apply(B,B))),
    file('COL030-1.p',unknown),
    [] ).

cnf(5,plain,
    ~ equal(apply(f(A),apply(A,f(A))),apply(A,f(A))),
    inference(flip,[status(thm),theory(equality)],[1]),
    [iquote('flip(1)')] ).

cnf(15,plain,
    equal(apply(apply(apply(s,l),A),B),apply(B,apply(apply(A,B),apply(A,B)))),
    inference(para,[status(thm),theory(equality)],[2,3]),
    [iquote('para(2,3)')] ).

cnf(16,plain,
    equal(apply(A,apply(apply(B,A),apply(B,A))),apply(apply(apply(s,l),B),A)),
    inference(flip,[status(thm),theory(equality)],[15]),
    [iquote('flip(15)')] ).

cnf(67,plain,
    ~ equal(apply(f(apply(apply(s,A),B)),apply(apply(A,f(apply(apply(s,A),B))),apply(B,f(apply(apply(s,A),B))))),apply(apply(apply(s,A),B),f(apply(apply(s,A),B)))),
    inference(para,[status(thm),theory(equality)],[1,5]),
    [iquote('para(1,5)')] ).

cnf(68,plain,
    $false,
    inference(conflict,[status(thm)],[67,16]),
    [iquote('conflict(67,16)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : COL030-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12  % Command  : tptp2X_and_run_eqp %s
% 0.12/0.33  % Computer : n017.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:25:26 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.40/1.05  ----- EQP 0.9e, May 2009 -----
% 0.40/1.05  The job began on n017.cluster.edu, Tue May 31 08:25:26 2022
% 0.40/1.05  The command was "./eqp09e".
% 0.40/1.05  
% 0.40/1.05  set(prolog_style_variables).
% 0.40/1.05  set(lrpo).
% 0.40/1.05  set(basic_paramod).
% 0.40/1.05  set(functional_subsume).
% 0.40/1.05  set(ordered_paramod).
% 0.40/1.05  set(prime_paramod).
% 0.40/1.05  set(para_pairs).
% 0.40/1.05  assign(pick_given_ratio,4).
% 0.40/1.05  clear(print_kept).
% 0.40/1.05  clear(print_new_demod).
% 0.40/1.05  clear(print_back_demod).
% 0.40/1.05  clear(print_given).
% 0.40/1.05  assign(max_mem,64000).
% 0.40/1.05  end_of_commands.
% 0.40/1.05  
% 0.40/1.05  Usable:
% 0.40/1.05  end_of_list.
% 0.40/1.05  
% 0.40/1.05  Sos:
% 0.40/1.05  0 (wt=-1) [] apply(apply(apply(s,A),B),C) = apply(apply(A,C),apply(B,C)).
% 0.40/1.05  0 (wt=-1) [] apply(apply(l,A),B) = apply(A,apply(B,B)).
% 0.40/1.05  0 (wt=-1) [] -(apply(A,f(A)) = apply(f(A),apply(A,f(A)))).
% 0.40/1.05  end_of_list.
% 0.40/1.05  
% 0.40/1.05  Demodulators:
% 0.40/1.05  end_of_list.
% 0.40/1.05  
% 0.40/1.05  Passive:
% 0.40/1.05  end_of_list.
% 0.40/1.05  
% 0.40/1.05  Starting to process input.
% 0.40/1.05  
% 0.40/1.05  ** KEPT: 1 (wt=15) [] apply(apply(apply(s,A),B),C) = apply(apply(A,C),apply(B,C)).
% 0.40/1.05  
% 0.40/1.05  ** KEPT: 2 (wt=15) [flip(1)] apply(apply(A,B),apply(C,B)) = apply(apply(apply(s,A),C),B).
% 0.40/1.05  clause forward subsumed: 0 (wt=15) [flip(2)] apply(apply(apply(s,A),C),B) = apply(apply(A,B),apply(C,B)).
% 0.40/1.05  
% 0.40/1.05  ** KEPT: 3 (wt=11) [] apply(apply(l,A),B) = apply(A,apply(B,B)).
% 0.40/1.05  
% 0.40/1.05  ** KEPT: 4 (wt=11) [flip(3)] apply(A,apply(B,B)) = apply(apply(l,A),B).
% 0.40/1.05  clause forward subsumed: 0 (wt=11) [flip(4)] apply(apply(l,A),B) = apply(A,apply(B,B)).
% 0.40/1.05  
% 0.40/1.05  ** KEPT: 5 (wt=12) [flip(1)] -(apply(f(A),apply(A,f(A))) = apply(A,f(A))).
% 0.40/1.05  ---------------- PROOF FOUND ----------------
% 0.40/1.05  % SZS status Unsatisfiable
% 0.40/1.05  
% 0.40/1.05  
% 0.40/1.05  After processing input:
% 0.40/1.05  
% 0.40/1.05  Usable:
% 0.40/1.05  end_of_list.
% 0.40/1.05  
% 0.40/1.05  Sos:
% 0.40/1.05  3 (wt=11) [] apply(apply(l,A),B) = apply(A,apply(B,B)).
% 0.40/1.05  4 (wt=11) [flip(3)] apply(A,apply(B,B)) = apply(apply(l,A),B).
% 0.40/1.05  5 (wt=12) [flip(1)] -(apply(f(A),apply(A,f(A))) = apply(A,f(A))).
% 0.40/1.05  1 (wt=15) [] apply(apply(apply(s,A),B),C) = apply(apply(A,C),apply(B,C)).
% 0.40/1.05  2 (wt=15) [flip(1)] apply(apply(A,B),apply(C,B)) = apply(apply(apply(s,A),C),B).
% 0.40/1.05  end_of_list.
% 0.40/1.05  
% 0.40/1.05  Demodulators:
% 0.40/1.05  end_of_list.
% 0.40/1.05  
% 0.40/1.05  Passive:
% 0.40/1.05  end_of_list.
% 0.40/1.05  
% 0.40/1.05  UNIT CONFLICT from 67 and 16 at   0.00 seconds.
% 0.40/1.05  
% 0.40/1.05  ---------------- PROOF ----------------
% 0.40/1.05  % SZS output start Refutation
% See solution above
% 0.40/1.05  ------------ end of proof -------------
% 0.40/1.05  
% 0.40/1.05  
% 0.40/1.05  ------------- memory usage ------------
% 0.40/1.05  Memory dynamically allocated (tp_alloc): 488.
% 0.40/1.05    type (bytes each)        gets      frees     in use      avail      bytes
% 0.40/1.05  sym_ent (  96)               55          0         55          0      5.2 K
% 0.40/1.05  term (  16)                3037       1683       1354         38     26.9 K
% 0.40/1.05  gen_ptr (   8)             5080        145       4935          7     38.6 K
% 0.40/1.05  context ( 808)             1819       1817          2          2      3.2 K
% 0.40/1.05  trail (  12)                 54         54          0          4      0.0 K
% 0.40/1.05  bt_node (  68)              279        276          3          4      0.5 K
% 0.40/1.05  ac_position (285432)          0          0          0          0      0.0 K
% 0.40/1.05  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.40/1.05  ac_match_free_vars_pos (4020)
% 0.40/1.05                                0          0          0          0      0.0 K
% 0.40/1.05  discrim (  12)              946          0        946          0     11.1 K
% 0.40/1.05  flat (  40)                3627       3627          0         27      1.1 K
% 0.40/1.05  discrim_pos (  12)           36         36          0          1      0.0 K
% 0.40/1.05  fpa_head (  12)             318          0        318          0      3.7 K
% 0.40/1.05  fpa_tree (  28)              69         69          0         21      0.6 K
% 0.40/1.05  fpa_pos (  36)               69         69          0          1      0.0 K
% 0.40/1.05  literal (  12)              213        146         67          1      0.8 K
% 0.40/1.05  clause (  24)               213        146         67          1      1.6 K
% 0.40/1.05  list (  12)                  61          5         56          3      0.7 K
% 0.40/1.05  list_pos (  20)             203          3        200          0      3.9 K
% 0.40/1.05  pair_index (   40)              2          0          2          0      0.1 K
% 0.40/1.05  
% 0.40/1.05  -------------- statistics -------------
% 0.40/1.05  Clauses input                  3
% 0.40/1.05    Usable input                   0
% 0.40/1.05    Sos input                      3
% 0.40/1.05    Demodulators input             0
% 0.40/1.05    Passive input                  0
% 0.40/1.05  
% 0.40/1.05  Processed BS (before search)   7
% 0.40/1.05  Forward subsumed BS            2
% 0.40/1.05  Kept BS                        5
% 0.40/1.05  New demodulators BS            0
% 0.40/1.05  Back demodulated BS            0
% 0.40/1.05  
% 0.40/1.05  Clauses or pairs given        20
% 0.40/1.05  Clauses generated            100
% 0.40/1.05  Forward subsumed              38
% 0.40/1.05  Deleted by weight              0
% 0.40/1.05  Deleted by variable count      0
% 0.40/1.05  Kept                          62
% 0.40/1.05  New demodulators               2
% 0.40/1.05  Back demodulated               0
% 0.40/1.05  Ordered paramod prunes         0
% 0.40/1.05  Basic paramod prunes           4
% 0.40/1.05  Prime paramod prunes           0
% 0.40/1.05  Semantic prunes                0
% 0.40/1.05  
% 0.40/1.05  Rewrite attmepts            1280
% 0.40/1.05  Rewrites                       0
% 0.40/1.05  
% 0.40/1.05  FPA overloads                  0
% 0.40/1.05  FPA underloads                 0
% 0.40/1.05  
% 0.40/1.05  Usable size                    0
% 0.40/1.05  Sos size                      66
% 0.40/1.05  Demodulators size              2
% 0.40/1.05  Passive size                   0
% 0.40/1.05  Disabled size                  0
% 0.40/1.05  
% 0.40/1.05  Proofs found                   1
% 0.40/1.05  
% 0.40/1.05  ----------- times (seconds) ----------- Tue May 31 08:25:26 2022
% 0.40/1.05  
% 0.40/1.05  user CPU time             0.00   (0 hr, 0 min, 0 sec)
% 0.40/1.05  system CPU time           0.01   (0 hr, 0 min, 0 sec)
% 0.40/1.05  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.40/1.05  input time                0.00
% 0.40/1.05  paramodulation time       0.00
% 0.40/1.05  demodulation time         0.00
% 0.40/1.05  orient time               0.00
% 0.40/1.05  weigh time                0.00
% 0.40/1.05  forward subsume time      0.00
% 0.40/1.05  back demod find time      0.00
% 0.40/1.05  conflict time             0.00
% 0.40/1.05  LRPO time                 0.00
% 0.40/1.05  store clause time         0.00
% 0.40/1.05  disable clause time       0.00
% 0.40/1.05  prime paramod time        0.00
% 0.40/1.05  semantics time            0.00
% 0.40/1.05  
% 0.40/1.05  EQP interrupted
%------------------------------------------------------------------------------