TSTP Solution File: COL001-1 by EQP---0.9e

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : EQP---0.9e
% Problem  : COL001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_eqp %s

% Computer : n024.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:07 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,plain,
    equal(apply(apply(apply(s,A),B),C),apply(apply(A,C),apply(B,C))),
    file('COL001-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(k,A),B),A),
    file('COL001-1.p',unknown),
    [] ).

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

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

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

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

cnf(31,plain,
    equal(apply(A,apply(B,apply(C,B))),apply(apply(apply(s,apply(s,apply(k,A))),C),B)),
    inference(para,[status(thm),theory(equality)],[6,2]),
    [iquote('para(6,2)')] ).

cnf(58,plain,
    ~ equal(apply(apply(apply(s,apply(s,apply(k,combinator))),A),B),apply(B,apply(A,B))),
    inference(para,[status(thm),theory(equality)],[31,4]),
    [iquote('para(31,4)')] ).

cnf(59,plain,
    ~ equal(apply(A,apply(B,A)),apply(apply(apply(s,apply(s,apply(k,combinator))),B),A)),
    inference(flip,[status(thm),theory(equality)],[58]),
    [iquote('flip(58)')] ).

cnf(74,plain,
    equal(apply(apply(apply(s,apply(s,A)),apply(k,B)),apply(k,C)),apply(apply(A,B),C)),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,7]),1]),
    [iquote('para(8,7),flip(1)')] ).

cnf(75,plain,
    $false,
    inference(conflict,[status(thm)],[74,59]),
    [iquote('conflict(74,59)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : COL001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : tptp2X_and_run_eqp %s
% 0.13/0.35  % Computer : n024.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue May 31 15:54:21 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.47/1.11  ----- EQP 0.9e, May 2009 -----
% 0.47/1.11  The job began on n024.cluster.edu, Tue May 31 15:54:22 2022
% 0.47/1.11  The command was "./eqp09e".
% 0.47/1.11  
% 0.47/1.11  set(prolog_style_variables).
% 0.47/1.11  set(lrpo).
% 0.47/1.11  set(basic_paramod).
% 0.47/1.11  set(functional_subsume).
% 0.47/1.11  set(ordered_paramod).
% 0.47/1.11  set(prime_paramod).
% 0.47/1.11  set(para_pairs).
% 0.47/1.11  assign(pick_given_ratio,4).
% 0.47/1.11  clear(print_kept).
% 0.47/1.11  clear(print_new_demod).
% 0.47/1.11  clear(print_back_demod).
% 0.47/1.11  clear(print_given).
% 0.47/1.11  assign(max_mem,64000).
% 0.47/1.11  end_of_commands.
% 0.47/1.11  
% 0.47/1.11  Usable:
% 0.47/1.11  end_of_list.
% 0.47/1.11  
% 0.47/1.11  Sos:
% 0.47/1.11  0 (wt=-1) [] apply(apply(apply(s,A),B),C) = apply(apply(A,C),apply(B,C)).
% 0.47/1.11  0 (wt=-1) [] apply(apply(k,A),B) = A.
% 0.47/1.11  0 (wt=-1) [] -(A = apply(combinator,A)).
% 0.47/1.11  end_of_list.
% 0.47/1.11  
% 0.47/1.11  Demodulators:
% 0.47/1.11  end_of_list.
% 0.47/1.11  
% 0.47/1.11  Passive:
% 0.47/1.11  end_of_list.
% 0.47/1.11  
% 0.47/1.11  Starting to process input.
% 0.47/1.11  
% 0.47/1.11  ** KEPT: 1 (wt=15) [] apply(apply(apply(s,A),B),C) = apply(apply(A,C),apply(B,C)).
% 0.47/1.11  
% 0.47/1.11  ** KEPT: 2 (wt=15) [flip(1)] apply(apply(A,B),apply(C,B)) = apply(apply(apply(s,A),C),B).
% 0.47/1.11  clause forward subsumed: 0 (wt=15) [flip(2)] apply(apply(apply(s,A),C),B) = apply(apply(A,B),apply(C,B)).
% 0.47/1.11  
% 0.47/1.11  ** KEPT: 3 (wt=7) [] apply(apply(k,A),B) = A.
% 0.47/1.11  3 is a new demodulator.
% 0.47/1.11  
% 0.47/1.11  ** KEPT: 4 (wt=5) [flip(1)] -(apply(combinator,A) = A).
% 0.47/1.11  ---------------- PROOF FOUND ----------------
% 0.47/1.11  % SZS status Unsatisfiable
% 0.47/1.11  
% 0.47/1.11  
% 0.47/1.11  After processing input:
% 0.47/1.11  
% 0.47/1.11  Usable:
% 0.47/1.11  end_of_list.
% 0.47/1.11  
% 0.47/1.11  Sos:
% 0.47/1.11  4 (wt=5) [flip(1)] -(apply(combinator,A) = A).
% 0.47/1.11  3 (wt=7) [] apply(apply(k,A),B) = A.
% 0.47/1.11  1 (wt=15) [] apply(apply(apply(s,A),B),C) = apply(apply(A,C),apply(B,C)).
% 0.47/1.11  2 (wt=15) [flip(1)] apply(apply(A,B),apply(C,B)) = apply(apply(apply(s,A),C),B).
% 0.47/1.11  end_of_list.
% 0.47/1.11  
% 0.47/1.11  Demodulators:
% 0.47/1.11  3 (wt=7) [] apply(apply(k,A),B) = A.
% 0.47/1.11  end_of_list.
% 0.47/1.11  
% 0.47/1.11  Passive:
% 0.47/1.11  end_of_list.
% 0.47/1.11  
% 0.47/1.11  UNIT CONFLICT from 74 and 59 at   0.00 seconds.
% 0.47/1.11  
% 0.47/1.11  ---------------- PROOF ----------------
% 0.47/1.11  % SZS output start Refutation
% See solution above
% 0.47/1.11  ------------ end of proof -------------
% 0.47/1.11  
% 0.47/1.11  
% 0.47/1.11  ------------- memory usage ------------
% 0.47/1.11  Memory dynamically allocated (tp_alloc): 488.
% 0.47/1.11    type (bytes each)        gets      frees     in use      avail      bytes
% 0.47/1.11  sym_ent (  96)               55          0         55          0      5.2 K
% 0.47/1.11  term (  16)                3539       2101       1438         20     28.2 K
% 0.47/1.11  gen_ptr (   8)             5860        245       5615         11     44.0 K
% 0.47/1.11  context ( 808)             2688       2686          2          2      3.2 K
% 0.47/1.11  trail (  12)                433        433          0          6      0.1 K
% 0.47/1.11  bt_node (  68)             1084       1079          5          5      0.7 K
% 0.47/1.11  ac_position (285432)          0          0          0          0      0.0 K
% 0.47/1.11  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.47/1.11  ac_match_free_vars_pos (4020)
% 0.47/1.11                                0          0          0          0      0.0 K
% 0.47/1.11  discrim (  12)              976          0        976          0     11.4 K
% 0.47/1.11  flat (  40)                7451       7451          0         25      1.0 K
% 0.47/1.11  discrim_pos (  12)           57         57          0          1      0.0 K
% 0.47/1.11  fpa_head (  12)             281          0        281          0      3.3 K
% 0.47/1.11  fpa_tree (  28)             395        395          0         25      0.7 K
% 0.47/1.11  fpa_pos (  36)               85         85          0          1      0.0 K
% 0.47/1.11  literal (  12)              239        165         74          1      0.9 K
% 0.47/1.11  clause (  24)               239        165         74          1      1.8 K
% 0.47/1.11  list (  12)                  70         14         56          3      0.7 K
% 0.47/1.11  list_pos (  20)             233          3        230          0      4.5 K
% 0.47/1.11  pair_index (   40)              2          0          2          0      0.1 K
% 0.47/1.11  
% 0.47/1.11  -------------- statistics -------------
% 0.47/1.11  Clauses input                  3
% 0.47/1.11    Usable input                   0
% 0.47/1.11    Sos input                      3
% 0.47/1.11    Demodulators input             0
% 0.47/1.11    Passive input                  0
% 0.47/1.11  
% 0.47/1.11  Processed BS (before search)   5
% 0.47/1.11  Forward subsumed BS            1
% 0.47/1.11  Kept BS                        4
% 0.47/1.11  New demodulators BS            1
% 0.47/1.11  Back demodulated BS            0
% 0.47/1.11  
% 0.47/1.11  Clauses or pairs given        80
% 0.47/1.11  Clauses generated            126
% 0.47/1.11  Forward subsumed              56
% 0.47/1.11  Deleted by weight              0
% 0.47/1.11  Deleted by variable count      0
% 0.47/1.11  Kept                          70
% 0.47/1.11  New demodulators              10
% 0.47/1.11  Back demodulated               0
% 0.47/1.11  Ordered paramod prunes         0
% 0.47/1.11  Basic paramod prunes         118
% 0.47/1.11  Prime paramod prunes           0
% 0.47/1.11  Semantic prunes                0
% 0.47/1.11  
% 0.47/1.11  Rewrite attmepts            1564
% 0.47/1.11  Rewrites                      23
% 0.47/1.11  
% 0.47/1.11  FPA overloads                  0
% 0.47/1.11  FPA underloads                 0
% 0.47/1.11  
% 0.47/1.11  Usable size                    0
% 0.47/1.11  Sos size                      73
% 0.47/1.11  Demodulators size             11
% 0.47/1.11  Passive size                   0
% 0.47/1.11  Disabled size                  0
% 0.47/1.11  
% 0.47/1.11  Proofs found                   1
% 0.47/1.11  
% 0.47/1.11  ----------- times (seconds) ----------- Tue May 31 15:54:22 2022
% 0.47/1.11  
% 0.47/1.11  user CPU time             0.00   (0 hr, 0 min, 0 sec)
% 0.47/1.11  system CPU time           0.00   (0 hr, 0 min, 0 sec)
% 0.47/1.11  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.47/1.11  input time                0.00
% 0.47/1.11  paramodulation time       0.00
% 0.47/1.11  demodulation time         0.00
% 0.47/1.11  orient time               0.00
% 0.47/1.11  weigh time                0.00
% 0.47/1.11  forward subsume time      0.00
% 0.47/1.11  back demod find time      0.00
% 0.47/1.11  conflict time             0.00
% 0.47/1.11  LRPO time                 0.00
% 0.47/1.11  store clause time         0.00
% 0.47/1.11  disable clause time       0.00
% 0.47/1.11  prime paramod time        0.00
% 0.47/1.11  semantics time            0.00
% 0.47/1.11  
% 0.47/1.11  EQP interrupted
%------------------------------------------------------------------------------