↑ Up

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

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

% Computer : n029.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:54 EDT 2022

% Result   : Unsatisfiable 1.21s 1.63s
% Output   : Refutation 1.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   33 (  33 unt;   0 nHn;   6 RR)
%            Number of literals    :   33 (   0 equ;   5 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;   3 con; 0-2 aty)
%            Number of variables   :   72 (  11 sgn)

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

cnf(3,plain,
    equal(meet(A,join(A,B)),A),
    file('LAT143-1.p',unknown),
    [] ).

cnf(4,plain,
    equal(join(A,meet(A,B)),A),
    file('LAT143-1.p',unknown),
    [] ).

cnf(5,plain,
    equal(meet(A,B),meet(B,A)),
    file('LAT143-1.p',unknown),
    [] ).

cnf(6,plain,
    equal(join(A,B),join(B,A)),
    file('LAT143-1.p',unknown),
    [] ).

cnf(7,plain,
    equal(meet(meet(A,B),C),meet(A,meet(B,C))),
    file('LAT143-1.p',unknown),
    [] ).

cnf(8,plain,
    equal(join(join(A,B),C),join(A,join(B,C))),
    file('LAT143-1.p',unknown),
    [] ).

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

cnf(10,plain,
    ~ equal(meet(a,join(meet(a,b),join(meet(a,c),meet(c,join(a,b))))),meet(a,join(meet(a,b),meet(a,c)))),
    inference(flip,[status(thm),theory(equality)],[1]),
    [iquote('flip(1)')] ).

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

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

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

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

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

cnf(22,plain,
    equal(meet(A,meet(B,A)),meet(A,B)),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,13]),7]),
    [iquote('para(4,13),demod([7])')] ).

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

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

cnf(51,plain,
    ~ equal(meet(a,join(meet(b,a),join(meet(a,c),meet(c,join(a,b))))),meet(a,join(meet(a,b),meet(a,c)))),
    inference(para,[status(thm),theory(equality)],[5,10]),
    [iquote('para(5,10)')] ).

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

cnf(74,plain,
    equal(join(meet(A,B),meet(A,join(meet(A,B),meet(C,A)))),join(meet(A,B),meet(A,C))),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,9]),7,22,7,22,7,22]),
    [iquote('para(14,9),demod([7,22,7,22,7,22])')] ).

cnf(90,plain,
    equal(join(meet(A,join(meet(B,A),C)),meet(B,A)),meet(A,join(meet(B,A),C))),
    inference(para,[status(thm),theory(equality)],[18,12]),
    [iquote('para(18,12)')] ).

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

cnf(128,plain,
    equal(join(meet(A,join(B,C)),meet(B,A)),meet(A,join(B,C))),
    inference(para,[status(thm),theory(equality)],[59,12]),
    [iquote('para(59,12)')] ).

cnf(352,plain,
    equal(meet(A,join(meet(B,A),meet(C,join(A,B)))),join(meet(B,A),meet(A,C))),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[42,6]),90]),1]),
    [iquote('para(42,6),demod([90]),flip(1)')] ).

cnf(556,plain,
    ~ equal(join(meet(b,a),meet(a,c)),meet(a,join(meet(a,b),meet(a,c)))),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,51]),128,352]),
    [iquote('para(6,51),demod([128,352])')] ).

cnf(961,plain,
    equal(join(meet(A,B),meet(B,join(A,C))),meet(B,join(A,C))),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[128,6]),1]),
    [iquote('para(128,6),flip(1)')] ).

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

cnf(2873,plain,
    equal(join(meet(A,meet(B,C)),meet(B,join(A,D))),meet(B,join(A,D))),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[128,106]),7,961]),
    [iquote('para(128,106),demod([7,961])')] ).

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

cnf(2880,plain,
    equal(meet(A,join(meet(A,B),meet(A,C))),join(meet(A,B),meet(A,C))),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[966]),2874]),
    [iquote('back_demod(966),demod([2874])')] ).

cnf(2893,plain,
    ~ equal(join(meet(b,a),meet(a,c)),join(meet(a,b),meet(a,c))),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[556]),2880]),
    [iquote('back_demod(556),demod([2880])')] ).

cnf(2899,plain,
    ~ equal(join(meet(a,b),meet(a,c)),join(meet(a,b),meet(a,c))),
    inference(para,[status(thm),theory(equality)],[5,2893]),
    [iquote('para(5,2893)')] ).

cnf(2900,plain,
    $false,
    inference(conflict,[status(thm)],[2899]),
    [iquote('xx_conflict(2899)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : LAT143-1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12  % Command  : tptp2X_and_run_eqp %s
% 0.11/0.33  % Computer : n029.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Thu Jun 30 13:13:38 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 1.21/1.63  ----- EQP 0.9e, May 2009 -----
% 1.21/1.63  The job began on n029.cluster.edu, Thu Jun 30 13:13:39 2022
% 1.21/1.63  The command was "./eqp09e".
% 1.21/1.63  
% 1.21/1.63  set(prolog_style_variables).
% 1.21/1.63  set(lrpo).
% 1.21/1.63  set(basic_paramod).
% 1.21/1.63  set(functional_subsume).
% 1.21/1.63  set(ordered_paramod).
% 1.21/1.63  set(prime_paramod).
% 1.21/1.63  set(para_pairs).
% 1.21/1.63  assign(pick_given_ratio,4).
% 1.21/1.63  clear(print_kept).
% 1.21/1.63  clear(print_new_demod).
% 1.21/1.63  clear(print_back_demod).
% 1.21/1.63  clear(print_given).
% 1.21/1.63  assign(max_mem,64000).
% 1.21/1.63  end_of_commands.
% 1.21/1.63  
% 1.21/1.63  Usable:
% 1.21/1.63  end_of_list.
% 1.21/1.63  
% 1.21/1.63  Sos:
% 1.21/1.63  0 (wt=-1) [] meet(A,A) = A.
% 1.21/1.63  0 (wt=-1) [] join(A,A) = A.
% 1.21/1.63  0 (wt=-1) [] meet(A,join(A,B)) = A.
% 1.21/1.63  0 (wt=-1) [] join(A,meet(A,B)) = A.
% 1.21/1.63  0 (wt=-1) [] meet(A,B) = meet(B,A).
% 1.21/1.63  0 (wt=-1) [] join(A,B) = join(B,A).
% 1.21/1.63  0 (wt=-1) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 1.21/1.63  0 (wt=-1) [] join(join(A,B),C) = join(A,join(B,C)).
% 1.21/1.63  0 (wt=-1) [] join(meet(A,B),meet(B,C)) = join(meet(A,B),meet(B,join(meet(A,B),meet(C,join(A,B))))).
% 1.21/1.63  0 (wt=-1) [] -(meet(a,join(meet(a,b),meet(a,c))) = meet(a,join(meet(a,b),join(meet(a,c),meet(c,join(a,b)))))).
% 1.21/1.63  end_of_list.
% 1.21/1.63  
% 1.21/1.63  Demodulators:
% 1.21/1.63  end_of_list.
% 1.21/1.63  
% 1.21/1.63  Passive:
% 1.21/1.63  end_of_list.
% 1.21/1.63  
% 1.21/1.63  Starting to process input.
% 1.21/1.63  
% 1.21/1.63  ** KEPT: 1 (wt=5) [] meet(A,A) = A.
% 1.21/1.63  1 is a new demodulator.
% 1.21/1.63  
% 1.21/1.63  ** KEPT: 2 (wt=5) [] join(A,A) = A.
% 1.21/1.63  2 is a new demodulator.
% 1.21/1.63  
% 1.21/1.63  ** KEPT: 3 (wt=7) [] meet(A,join(A,B)) = A.
% 1.21/1.63  3 is a new demodulator.
% 1.21/1.63  
% 1.21/1.63  ** KEPT: 4 (wt=7) [] join(A,meet(A,B)) = A.
% 1.21/1.63  4 is a new demodulator.
% 1.21/1.63  
% 1.21/1.63  ** KEPT: 5 (wt=7) [] meet(A,B) = meet(B,A).
% 1.21/1.63  clause forward subsumed: 0 (wt=7) [flip(5)] meet(B,A) = meet(A,B).
% 1.21/1.63  
% 1.21/1.63  ** KEPT: 6 (wt=7) [] join(A,B) = join(B,A).
% 1.21/1.63  clause forward subsumed: 0 (wt=7) [flip(6)] join(B,A) = join(A,B).
% 1.21/1.63  
% 1.21/1.63  ** KEPT: 7 (wt=11) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 1.21/1.63  7 is a new demodulator.
% 1.21/1.63  
% 1.21/1.63  ** KEPT: 8 (wt=11) [] join(join(A,B),C) = join(A,join(B,C)).
% 1.21/1.63  8 is a new demodulator.
% 1.21/1.63  
% 1.21/1.63  ** KEPT: 9 (wt=23) [flip(1)] join(meet(A,B),meet(B,join(meet(A,B),meet(C,join(A,B))))) = join(meet(A,B),meet(B,C)).
% 1.21/1.63  9 is a new demodulator.
% 1.21/1.63  
% 1.21/1.63  ** KEPT: 10 (wt=25) [flip(1)] -(meet(a,join(meet(a,b),join(meet(a,c),meet(c,join(a,b))))) = meet(a,join(meet(a,b),meet(a,c)))).
% 1.21/1.63  ---------------- PROOF FOUND ----------------
% 1.21/1.63  % SZS status Unsatisfiable
% 1.21/1.63  
% 1.21/1.63  
% 1.21/1.63  After processing input:
% 1.21/1.63  
% 1.21/1.63  Usable:
% 1.21/1.63  end_of_list.
% 1.21/1.63  
% 1.21/1.63  Sos:
% 1.21/1.63  1 (wt=5) [] meet(A,A) = A.
% 1.21/1.63  2 (wt=5) [] join(A,A) = A.
% 1.21/1.63  3 (wt=7) [] meet(A,join(A,B)) = A.
% 1.21/1.63  4 (wt=7) [] join(A,meet(A,B)) = A.
% 1.21/1.63  5 (wt=7) [] meet(A,B) = meet(B,A).
% 1.21/1.63  6 (wt=7) [] join(A,B) = join(B,A).
% 1.21/1.63  7 (wt=11) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 1.21/1.63  8 (wt=11) [] join(join(A,B),C) = join(A,join(B,C)).
% 1.21/1.63  9 (wt=23) [flip(1)] join(meet(A,B),meet(B,join(meet(A,B),meet(C,join(A,B))))) = join(meet(A,B),meet(B,C)).
% 1.21/1.63  10 (wt=25) [flip(1)] -(meet(a,join(meet(a,b),join(meet(a,c),meet(c,join(a,b))))) = meet(a,join(meet(a,b),meet(a,c)))).
% 1.21/1.63  end_of_list.
% 1.21/1.63  
% 1.21/1.63  Demodulators:
% 1.21/1.63  1 (wt=5) [] meet(A,A) = A.
% 1.21/1.63  2 (wt=5) [] join(A,A) = A.
% 1.21/1.63  3 (wt=7) [] meet(A,join(A,B)) = A.
% 1.21/1.63  4 (wt=7) [] join(A,meet(A,B)) = A.
% 1.21/1.63  7 (wt=11) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 1.21/1.63  8 (wt=11) [] join(join(A,B),C) = join(A,join(B,C)).
% 1.21/1.63  9 (wt=23) [flip(1)] join(meet(A,B),meet(B,join(meet(A,B),meet(C,join(A,B))))) = join(meet(A,B),meet(B,C)).
% 1.21/1.63  end_of_list.
% 1.21/1.63  
% 1.21/1.63  Passive:
% 1.21/1.63  end_of_list.
% 1.21/1.63  
% 1.21/1.63  UNIT CONFLICT from 2899 and x=x at   0.29 seconds.
% 1.21/1.63  
% 1.21/1.63  ---------------- PROOF ----------------
% 1.21/1.63  % SZS output start Refutation
% See solution above
% 1.21/1.63  ------------ end of proof -------------
% 1.21/1.63  
% 1.21/1.63  
% 1.21/1.63  ------------- memory usage ------------
% 1.21/1.63  Memory dynamically allocated (tp_alloc): 5371.
% 1.21/1.63    type (bytes each)        gets      frees     in use      avail      bytes
% 1.21/1.63  sym_ent (  96)               56          0         56          0      5.2 K
% 1.21/1.63  term (  16)              591826     519495      72331         26   1401.9 K
% 1.21/1.63  gen_ptr (   8)           433948     100200     333748         32   2607.7 K
% 1.21/1.63  context ( 808)           336230     336228          2          7      7.1 K
% 1.21/1.63  trail (  12)             134658     134658          0          6      0.1 K
% 1.21/1.63  bt_node (  68)           119691     119688          3         26      1.9 K
% 1.21/1.63  ac_position (285432)          0          0          0          0      0.0 K
% 1.21/1.63  ac_match_pos (14044)          0          0          0          0      0.0 K
% 1.21/1.63  ac_match_free_vars_pos (4020)
% 1.21/1.63                                0          0          0          0      0.0 K
% 1.21/1.63  discrim (  12)            55402       6570      48832         89    573.3 K
% 1.21/1.63  flat (  40)             1206987    1206987          0         91      3.6 K
% 1.21/1.63  discrim_pos (  12)        32762      32762          0          1      0.0 K
% 1.21/1.63  fpa_head (  12)            5501          0       5501          0     64.5 K
% 1.21/1.63  fpa_tree (  28)           11116      11116          0         41      1.1 K
% 1.21/1.63  fpa_pos (  36)             5243       5243          0          1      0.0 K
% 1.21/1.63  literal (  12)            24129      21230       2899          1     34.0 K
% 1.21/1.63  clause (  24)             24129      21230       2899          1     68.0 K
% 1.21/1.63  list (  12)                2404       2348         56          3      0.7 K
% 1.21/1.63  list_pos (  20)           11775       1650      10125          6    197.9 K
% 1.21/1.63  pair_index (   40)              2          0          2          0      0.1 K
% 1.21/1.63  
% 1.21/1.63  -------------- statistics -------------
% 1.21/1.63  Clauses input                 10
% 1.21/1.63    Usable input                   0
% 1.21/1.63    Sos input                     10
% 1.21/1.63    Demodulators input             0
% 1.21/1.63    Passive input                  0
% 1.21/1.63  
% 1.21/1.63  Processed BS (before search)  12
% 1.21/1.63  Forward subsumed BS            2
% 1.21/1.63  Kept BS                       10
% 1.21/1.63  New demodulators BS            7
% 1.21/1.63  Back demodulated BS            0
% 1.21/1.63  
% 1.21/1.63  Clauses or pairs given     16112
% 1.21/1.63  Clauses generated          15623
% 1.21/1.63  Forward subsumed           12734
% 1.21/1.63  Deleted by weight              0
% 1.21/1.63  Deleted by variable count      0
% 1.21/1.63  Kept                        2889
% 1.21/1.63  New demodulators            2338
% 1.21/1.63  Back demodulated             363
% 1.21/1.63  Ordered paramod prunes         0
% 1.21/1.63  Basic paramod prunes       40464
% 1.21/1.63  Prime paramod prunes         820
% 1.21/1.63  Semantic prunes                0
% 1.21/1.63  
% 1.21/1.63  Rewrite attmepts          173200
% 1.21/1.63  Rewrites                   28517
% 1.21/1.63  
% 1.21/1.63  FPA overloads                  0
% 1.21/1.63  FPA underloads                 0
% 1.21/1.63  
% 1.21/1.63  Usable size                    0
% 1.21/1.63  Sos size                    2535
% 1.21/1.63  Demodulators size           2157
% 1.21/1.63  Passive size                   0
% 1.21/1.63  Disabled size                363
% 1.21/1.63  
% 1.21/1.63  Proofs found                   1
% 1.21/1.63  
% 1.21/1.63  ----------- times (seconds) ----------- Thu Jun 30 13:13:39 2022
% 1.21/1.63  
% 1.21/1.63  user CPU time             0.29   (0 hr, 0 min, 0 sec)
% 1.21/1.63  system CPU time           0.29   (0 hr, 0 min, 0 sec)
% 1.21/1.63  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 1.21/1.63  input time                0.00
% 1.21/1.63  paramodulation time       0.07
% 1.21/1.63  demodulation time         0.04
% 1.21/1.63  orient time               0.03
% 1.21/1.63  weigh time                0.01
% 1.21/1.63  forward subsume time      0.02
% 1.21/1.63  back demod find time      0.02
% 1.21/1.63  conflict time             0.00
% 1.21/1.63  LRPO time                 0.02
% 1.21/1.63  store clause time         0.05
% 1.21/1.63  disable clause time       0.00
% 1.21/1.63  prime paramod time        0.02
% 1.21/1.63  semantics time            0.00
% 1.21/1.63  
% 1.21/1.63  EQP interrupted
%------------------------------------------------------------------------------