↑ Up

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

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

% Computer : n021.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 : Sun Jul 17 04:34:13 EDT 2022

% Result   : Unsatisfiable 0.75s 1.38s
% Output   : Refutation 0.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   54 (  54 unt;   0 nHn;   2 RR)
%            Number of literals    :   54 (   0 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :  136 (  20 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,plain,
    equal(meet(A,join(A,B)),A),
    file('LAT006-1.p',unknown),
    [] ).

cnf(2,plain,
    equal(meet(A,join(B,C)),join(meet(C,A),meet(B,A))),
    file('LAT006-1.p',unknown),
    [] ).

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

cnf(4,plain,
    ~ equal(meet(meet(a,b),c),meet(a,meet(b,c))),
    file('LAT006-1.p',unknown),
    [] ).

cnf(5,plain,
    equal(join(meet(A,B),meet(B,B)),B),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,2]),1]),
    [iquote('para(1,2),flip(1)')] ).

cnf(7,plain,
    equal(meet(meet(A,B),B),meet(A,B)),
    inference(para,[status(thm),theory(equality)],[5,1]),
    [iquote('para(5,1)')] ).

cnf(8,plain,
    equal(meet(meet(A,B),meet(B,join(C,A))),meet(A,B)),
    inference(para,[status(thm),theory(equality)],[3,1]),
    [iquote('para(3,1)')] ).

cnf(9,plain,
    equal(join(A,meet(B,join(A,C))),meet(join(A,C),join(B,A))),
    inference(para,[status(thm),theory(equality)],[1,3]),
    [iquote('para(1,3)')] ).

cnf(13,plain,
    equal(meet(A,meet(B,join(C,D))),join(meet(meet(C,B),A),meet(meet(D,B),A))),
    inference(para,[status(thm),theory(equality)],[3,2]),
    [iquote('para(3,2)')] ).

cnf(14,plain,
    equal(join(meet(meet(A,B),C),meet(meet(D,B),C)),meet(C,meet(B,join(A,D)))),
    inference(flip,[status(thm),theory(equality)],[13]),
    [iquote('flip(13)')] ).

cnf(21,plain,
    equal(meet(A,B),join(meet(meet(B,B),A),meet(meet(C,B),A))),
    inference(para,[status(thm),theory(equality)],[5,2]),
    [iquote('para(5,2)')] ).

cnf(22,plain,
    equal(join(meet(meet(A,A),B),meet(meet(C,A),B)),meet(B,A)),
    inference(flip,[status(thm),theory(equality)],[21]),
    [iquote('flip(21)')] ).

cnf(29,plain,
    equal(meet(meet(meet(A,A),B),meet(B,A)),meet(meet(A,A),B)),
    inference(para,[status(thm),theory(equality)],[5,8]),
    [iquote('para(5,8)')] ).

cnf(30,plain,
    equal(meet(join(A,B),join(A,A)),join(A,A)),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,9]),1]),
    [iquote('para(1,9),flip(1)')] ).

cnf(33,plain,
    equal(join(meet(A,join(B,B)),join(B,B)),join(B,B)),
    inference(para,[status(thm),theory(equality)],[30,5]),
    [iquote('para(30,5)')] ).

cnf(34,plain,
    equal(meet(join(meet(A,A),B),A),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,30]),5]),
    [iquote('para(5,30),demod([5])')] ).

cnf(35,plain,
    equal(join(A,meet(A,A)),A),
    inference(para,[status(thm),theory(equality)],[34,5]),
    [iquote('para(34,5)')] ).

cnf(36,plain,
    equal(meet(A,A),A),
    inference(para,[status(thm),theory(equality)],[35,1]),
    [iquote('para(35,1)')] ).

cnf(37,plain,
    equal(join(A,A),A),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[35]),36]),
    [iquote('back_demod(35),demod([36])')] ).

cnf(38,plain,
    equal(join(meet(A,B),B),B),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[33]),37,37,37]),
    [iquote('back_demod(33),demod([37,37,37])')] ).

cnf(39,plain,
    equal(meet(join(A,B),A),A),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[30]),37,37]),
    [iquote('back_demod(30),demod([37,37])')] ).

cnf(40,plain,
    equal(meet(meet(A,B),meet(B,A)),meet(A,B)),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[29]),36,36]),
    [iquote('back_demod(29),demod([36,36])')] ).

cnf(42,plain,
    equal(join(meet(A,B),meet(meet(C,A),B)),meet(B,A)),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[22]),36]),
    [iquote('back_demod(22),demod([36])')] ).

cnf(61,plain,
    equal(join(meet(A,B),meet(B,A)),meet(B,A)),
    inference(para,[status(thm),theory(equality)],[40,38]),
    [iquote('para(40,38)')] ).

cnf(72,plain,
    equal(join(A,meet(B,A)),meet(A,join(B,A))),
    inference(para,[status(thm),theory(equality)],[36,3]),
    [iquote('para(36,3)')] ).

cnf(73,plain,
    equal(meet(A,join(B,A)),join(A,meet(B,A))),
    inference(flip,[status(thm),theory(equality)],[72]),
    [iquote('flip(72)')] ).

cnf(86,plain,
    equal(join(A,meet(B,A)),A),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[38,73]),36,7]),1]),
    [iquote('para(38,73),demod([36,7]),flip(1)')] ).

cnf(129,plain,
    equal(meet(A,B),meet(B,A)),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[40,86]),61]),
    [iquote('para(40,86),demod([61])')] ).

cnf(135,plain,
    equal(join(A,meet(A,B)),A),
    inference(para,[status(thm),theory(equality)],[129,86]),
    [iquote('para(129,86)')] ).

cnf(149,plain,
    equal(meet(A,meet(B,C)),meet(meet(C,B),A)),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[37,13]),37]),
    [iquote('para(37,13),demod([37])')] ).

cnf(150,plain,
    equal(meet(meet(A,B),C),meet(C,meet(B,A))),
    inference(flip,[status(thm),theory(equality)],[149]),
    [iquote('flip(149)')] ).

cnf(171,plain,
    equal(join(meet(A,meet(B,C)),meet(C,B)),meet(meet(B,C),join(meet(C,B),A))),
    inference(para,[status(thm),theory(equality)],[40,3]),
    [iquote('para(40,3)')] ).

cnf(172,plain,
    equal(meet(meet(A,B),join(meet(B,A),C)),join(meet(C,meet(A,B)),meet(B,A))),
    inference(flip,[status(thm),theory(equality)],[171]),
    [iquote('flip(171)')] ).

cnf(178,plain,
    equal(join(meet(meet(A,B),meet(B,C)),meet(C,B)),meet(meet(B,C),meet(B,join(A,C)))),
    inference(para,[status(thm),theory(equality)],[40,14]),
    [iquote('para(40,14)')] ).

cnf(179,plain,
    equal(meet(meet(A,B),meet(A,join(C,B))),join(meet(meet(C,A),meet(A,B)),meet(B,A))),
    inference(flip,[status(thm),theory(equality)],[178]),
    [iquote('flip(178)')] ).

cnf(197,plain,
    equal(meet(meet(A,B),join(meet(B,A),C)),meet(B,A)),
    inference(para,[status(thm),theory(equality)],[149,39]),
    [iquote('para(149,39)')] ).

cnf(198,plain,
    equal(join(meet(A,meet(B,C)),meet(C,B)),meet(C,B)),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[172]),197]),1]),
    [iquote('back_demod(172),demod([197]),flip(1)')] ).

cnf(199,plain,
    equal(meet(meet(A,B),meet(A,join(C,B))),meet(B,A)),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[179]),198]),
    [iquote('back_demod(179),demod([198])')] ).

cnf(294,plain,
    equal(meet(meet(meet(A,B),C),meet(C,B)),meet(meet(A,B),C)),
    inference(para,[status(thm),theory(equality)],[86,8]),
    [iquote('para(86,8)')] ).

cnf(363,plain,
    equal(join(meet(A,B),meet(meet(C,B),A)),meet(A,B)),
    inference(para,[status(thm),theory(equality)],[129,42]),
    [iquote('para(129,42)')] ).

cnf(400,plain,
    equal(meet(A,B),join(meet(meet(B,C),A),meet(B,A))),
    inference(para,[status(thm),theory(equality)],[135,2]),
    [iquote('para(135,2)')] ).

cnf(402,plain,
    equal(meet(meet(meet(A,B),C),meet(C,A)),meet(meet(A,B),C)),
    inference(para,[status(thm),theory(equality)],[135,8]),
    [iquote('para(135,8)')] ).

cnf(450,plain,
    equal(meet(meet(A,meet(B,C)),meet(A,C)),meet(meet(B,C),A)),
    inference(para,[status(thm),theory(equality)],[86,199]),
    [iquote('para(86,199)')] ).

cnf(957,plain,
    equal(join(meet(meet(A,B),C),meet(A,C)),meet(A,C)),
    inference(para,[status(thm),theory(equality)],[400,129]),
    [iquote('para(400,129)')] ).

cnf(1091,plain,
    equal(join(meet(meet(A,B),C),meet(C,A)),meet(A,C)),
    inference(para,[status(thm),theory(equality)],[129,957]),
    [iquote('para(129,957)')] ).

cnf(1302,plain,
    equal(meet(meet(meet(A,B),C),meet(B,C)),meet(meet(A,B),C)),
    inference(para,[status(thm),theory(equality)],[129,294]),
    [iquote('para(129,294)')] ).

cnf(1534,plain,
    equal(meet(meet(meet(A,B),C),meet(A,C)),meet(meet(A,B),C)),
    inference(para,[status(thm),theory(equality)],[129,402]),
    [iquote('para(129,402)')] ).

cnf(1537,plain,
    equal(meet(meet(A,B),C),meet(meet(C,A),meet(C,meet(A,B)))),
    inference(para,[status(thm),theory(equality)],[402,150]),
    [iquote('para(402,150)')] ).

cnf(1677,plain,
    equal(meet(meet(A,B),meet(A,meet(B,C))),meet(A,meet(B,C))),
    inference(para,[status(thm),theory(equality)],[1537,129]),
    [iquote('para(1537,129)')] ).

cnf(1733,plain,
    equal(meet(meet(A,B),meet(C,B)),meet(A,meet(C,B))),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[450,363]),1091]),1]),
    [iquote('para(450,363),demod([1091]),flip(1)')] ).

cnf(1738,plain,
    equal(meet(meet(A,B),meet(A,C)),meet(meet(A,B),C)),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1534]),1733]),
    [iquote('back_demod(1534),demod([1733])')] ).

cnf(1739,plain,
    equal(meet(meet(A,B),meet(B,C)),meet(A,meet(B,C))),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1677]),1738]),
    [iquote('back_demod(1677),demod([1738])')] ).

cnf(1818,plain,
    equal(meet(meet(A,B),C),meet(A,meet(B,C))),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1302]),1733,1739]),1]),
    [iquote('back_demod(1302),demod([1733,1739]),flip(1)')] ).

cnf(1819,plain,
    $false,
    inference(conflict,[status(thm)],[1818,4]),
    [iquote('conflict(1818,4)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : LAT006-1 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13  % Command  : tptp2X_and_run_eqp %s
% 0.14/0.35  % Computer : n021.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Thu Jun 30 04:40:12 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.75/1.38  ----- EQP 0.9e, May 2009 -----
% 0.75/1.38  The job began on n021.cluster.edu, Thu Jun 30 04:40:13 2022
% 0.75/1.38  The command was "./eqp09e".
% 0.75/1.38  
% 0.75/1.38  set(prolog_style_variables).
% 0.75/1.38  set(lrpo).
% 0.75/1.38  set(basic_paramod).
% 0.75/1.38  set(functional_subsume).
% 0.75/1.38  set(ordered_paramod).
% 0.75/1.38  set(prime_paramod).
% 0.75/1.38  set(para_pairs).
% 0.75/1.38  assign(pick_given_ratio,4).
% 0.75/1.38  clear(print_kept).
% 0.75/1.38  clear(print_new_demod).
% 0.75/1.38  clear(print_back_demod).
% 0.75/1.38  clear(print_given).
% 0.75/1.38  assign(max_mem,64000).
% 0.75/1.38  end_of_commands.
% 0.75/1.38  
% 0.75/1.38  Usable:
% 0.75/1.38  end_of_list.
% 0.75/1.38  
% 0.75/1.38  Sos:
% 0.75/1.38  0 (wt=-1) [] meet(A,join(A,B)) = A.
% 0.75/1.38  0 (wt=-1) [] meet(A,join(B,C)) = join(meet(C,A),meet(B,A)).
% 0.75/1.38  0 (wt=-1) [] -(meet(meet(a,b),c) = meet(a,meet(b,c))).
% 0.75/1.38  end_of_list.
% 0.75/1.38  
% 0.75/1.38  Demodulators:
% 0.75/1.38  end_of_list.
% 0.75/1.38  
% 0.75/1.38  Passive:
% 0.75/1.38  end_of_list.
% 0.75/1.38  
% 0.75/1.38  Starting to process input.
% 0.75/1.38  
% 0.75/1.38  ** KEPT: 1 (wt=7) [] meet(A,join(A,B)) = A.
% 0.75/1.38  1 is a new demodulator.
% 0.75/1.38  
% 0.75/1.38  ** KEPT: 2 (wt=13) [] meet(A,join(B,C)) = join(meet(C,A),meet(B,A)).
% 0.75/1.38  
% 0.75/1.38  ** KEPT: 3 (wt=13) [flip(2)] join(meet(A,B),meet(C,B)) = meet(B,join(C,A)).
% 0.75/1.38  clause forward subsumed: 0 (wt=13) [flip(3)] meet(B,join(C,A)) = join(meet(A,B),meet(C,B)).
% 0.75/1.38  
% 0.75/1.38  ** KEPT: 4 (wt=11) [] -(meet(meet(a,b),c) = meet(a,meet(b,c))).
% 0.75/1.38  ---------------- PROOF FOUND ----------------
% 0.75/1.38  % SZS status Unsatisfiable
% 0.75/1.38  
% 0.75/1.38  
% 0.75/1.38  After processing input:
% 0.75/1.38  
% 0.75/1.38  Usable:
% 0.75/1.38  end_of_list.
% 0.75/1.38  
% 0.75/1.38  Sos:
% 0.75/1.38  1 (wt=7) [] meet(A,join(A,B)) = A.
% 0.75/1.38  4 (wt=11) [] -(meet(meet(a,b),c) = meet(a,meet(b,c))).
% 0.75/1.38  2 (wt=13) [] meet(A,join(B,C)) = join(meet(C,A),meet(B,A)).
% 0.75/1.38  3 (wt=13) [flip(2)] join(meet(A,B),meet(C,B)) = meet(B,join(C,A)).
% 0.75/1.38  end_of_list.
% 0.75/1.38  
% 0.75/1.38  Demodulators:
% 0.75/1.38  1 (wt=7) [] meet(A,join(A,B)) = A.
% 0.75/1.38  end_of_list.
% 0.75/1.38  
% 0.75/1.38  Passive:
% 0.75/1.38  end_of_list.
% 0.75/1.38  
% 0.75/1.38  UNIT CONFLICT from 1818 and 4 at   0.18 seconds.
% 0.75/1.38  
% 0.75/1.38  ---------------- PROOF ----------------
% 0.75/1.38  % SZS output start Refutation
% See solution above
% 0.75/1.38  ------------ end of proof -------------
% 0.75/1.38  
% 0.75/1.38  
% 0.75/1.38  ------------- memory usage ------------
% 0.75/1.38  Memory dynamically allocated (tp_alloc): 3906.
% 0.75/1.38    type (bytes each)        gets      frees     in use      avail      bytes
% 0.75/1.38  sym_ent (  96)               56          0         56          0      5.2 K
% 0.75/1.38  term (  16)              216816     160294      56522         22   1097.3 K
% 0.75/1.38  gen_ptr (   8)           311033      53863     257170         53   2009.6 K
% 0.75/1.38  context ( 808)           118365     118363          2          6      6.3 K
% 0.75/1.38  trail (  12)             179787     179787          0          7      0.1 K
% 0.75/1.38  bt_node (  68)            35459      35454          5         18      1.5 K
% 0.75/1.38  ac_position (285432)          0          0          0          0      0.0 K
% 0.75/1.38  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.75/1.38  ac_match_free_vars_pos (4020)
% 0.75/1.38                                0          0          0          0      0.0 K
% 0.75/1.38  discrim (  12)            44610      19970      24640       1464    305.9 K
% 0.75/1.38  flat (  40)              506263     506263          0        131      5.1 K
% 0.75/1.38  discrim_pos (  12)         9546       9546          0          1      0.0 K
% 0.75/1.38  fpa_head (  12)            4706          0       4706          0     55.1 K
% 0.75/1.38  fpa_tree (  28)            5994       5994          0         31      0.8 K
% 0.75/1.38  fpa_pos (  36)             2779       2779          0          1      0.0 K
% 0.75/1.38  literal (  12)             8552       6734       1818          1     21.3 K
% 0.75/1.38  clause (  24)              8552       6734       1818          1     42.6 K
% 0.75/1.38  list (  12)                1020        963         57          4      0.7 K
% 0.75/1.38  list_pos (  20)            8080       3570       4510        110     90.2 K
% 0.75/1.38  pair_index (   40)              2          0          2          0      0.1 K
% 0.75/1.38  
% 0.75/1.38  -------------- statistics -------------
% 0.75/1.38  Clauses input                  3
% 0.75/1.38    Usable input                   0
% 0.75/1.38    Sos input                      3
% 0.75/1.38    Demodulators input             0
% 0.75/1.38    Passive input                  0
% 0.75/1.38  
% 0.75/1.38  Processed BS (before search)   5
% 0.75/1.38  Forward subsumed BS            1
% 0.75/1.38  Kept BS                        4
% 0.75/1.38  New demodulators BS            1
% 0.75/1.38  Back demodulated BS            0
% 0.75/1.38  
% 0.75/1.38  Clauses or pairs given      6845
% 0.75/1.38  Clauses generated           5432
% 0.75/1.38  Forward subsumed            3618
% 0.75/1.38  Deleted by weight              0
% 0.75/1.38  Deleted by variable count      0
% 0.75/1.38  Kept                        1814
% 0.75/1.38  New demodulators             960
% 0.75/1.38  Back demodulated             807
% 0.75/1.38  Ordered paramod prunes         0
% 0.75/1.38  Basic paramod prunes       23490
% 0.75/1.38  Prime paramod prunes         139
% 0.75/1.38  Semantic prunes                0
% 0.75/1.38  
% 0.75/1.38  Rewrite attmepts           72228
% 0.75/1.38  Rewrites                    8272
% 0.75/1.38  
% 0.75/1.38  FPA overloads                  0
% 0.75/1.38  FPA underloads                 0
% 0.75/1.38  
% 0.75/1.38  Usable size                    0
% 0.75/1.38  Sos size                    1010
% 0.75/1.38  Demodulators size            661
% 0.75/1.38  Passive size                   0
% 0.75/1.38  Disabled size                807
% 0.75/1.38  
% 0.75/1.38  Proofs found                   1
% 0.75/1.38  
% 0.75/1.38  ----------- times (seconds) ----------- Thu Jun 30 04:40:13 2022
% 0.75/1.38  
% 0.75/1.38  user CPU time             0.18   (0 hr, 0 min, 0 sec)
% 0.75/1.38  system CPU time           0.11   (0 hr, 0 min, 0 sec)
% 0.75/1.38  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.75/1.38  input time                0.00
% 0.75/1.38  paramodulation time       0.02
% 0.75/1.38  demodulation time         0.03
% 0.75/1.38  orient time               0.01
% 0.75/1.38  weigh time                0.00
% 0.75/1.38  forward subsume time      0.01
% 0.75/1.38  back demod find time      0.03
% 0.75/1.38  conflict time             0.00
% 0.75/1.38  LRPO time                 0.01
% 0.75/1.38  store clause time         0.03
% 0.75/1.38  disable clause time       0.01
% 0.75/1.38  prime paramod time        0.00
% 0.75/1.38  semantics time            0.00
% 0.75/1.38  
% 0.75/1.38  EQP interrupted
%------------------------------------------------------------------------------