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

View Problem - Process Solution

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

% Computer : n013.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 : Mon Jul 18 19:15:08 EDT 2022

% Result   : Unsatisfiable 0.63s 1.04s
% Output   : Refutation 0.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   30 (  30 unt;   0 nHn;   4 RR)
%            Number of literals    :   30 (   0 equ;   1 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    :    9 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :   34 (   0 sgn)

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

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

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

cnf(5,plain,
    equal(join(meet(A,B),complement(join(complement(A),B))),A),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),4]),
    [iquote('back_demod(3),demod([4])')] ).

cnf(7,plain,
    equal(composition(A,one),A),
    file('REL001-1.p',unknown),
    [] ).

cnf(9,plain,
    equal(converse(converse(A)),A),
    file('REL001-1.p',unknown),
    [] ).

cnf(11,plain,
    equal(converse(composition(A,B)),composition(converse(B),converse(A))),
    file('REL001-1.p',unknown),
    [] ).

cnf(12,plain,
    equal(join(composition(converse(A),complement(composition(A,B))),complement(B)),complement(B)),
    file('REL001-1.p',unknown),
    [] ).

cnf(13,plain,
    equal(join(A,complement(A)),top),
    inference(flip,[status(thm),theory(equality)],[1]),
    [iquote('flip(1)')] ).

cnf(14,plain,
    equal(meet(A,complement(A)),zero),
    inference(flip,[status(thm),theory(equality)],[1]),
    [iquote('flip(1)')] ).

cnf(15,plain,
    ~ equal(join(zero,sk1),sk1),
    file('REL001-1.p',unknown),
    [] ).

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

cnf(25,plain,
    equal(meet(complement(A),A),zero),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,19]),1]),
    [iquote('para(14,19),flip(1)')] ).

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

cnf(29,plain,
    equal(composition(converse(one),converse(A)),converse(A)),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,11]),1]),
    [iquote('para(7,11),flip(1)')] ).

cnf(30,plain,
    equal(composition(converse(one),A),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,29]),9]),
    [iquote('para(9,29),demod([9])')] ).

cnf(31,plain,
    equal(converse(one),one),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[30,7]),1]),
    [iquote('para(30,7),flip(1)')] ).

cnf(32,plain,
    equal(composition(one,A),A),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[30]),31]),
    [iquote('back_demod(30),demod([31])')] ).

cnf(37,plain,
    equal(complement(top),zero),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,4]),14]),
    [iquote('para(13,4),demod([14])')] ).

cnf(59,plain,
    equal(join(meet(A,complement(complement(A))),zero),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,5]),37]),
    [iquote('para(13,5),demod([37])')] ).

cnf(139,plain,
    equal(join(meet(complement(complement(A)),A),zero),A),
    inference(para,[status(thm),theory(equality)],[19,59]),
    [iquote('para(19,59)')] ).

cnf(145,plain,
    equal(join(zero,complement(join(complement(complement(A)),A))),complement(A)),
    inference(para,[status(thm),theory(equality)],[25,5]),
    [iquote('para(25,5)')] ).

cnf(146,plain,
    equal(join(zero,meet(complement(complement(A)),A)),A),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[139,1]),1]),
    [iquote('para(139,1),flip(1)')] ).

cnf(147,plain,
    equal(complement(complement(A)),A),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[25,28]),146]),1]),
    [iquote('para(25,28),demod([146]),flip(1)')] ).

cnf(148,plain,
    equal(join(zero,complement(join(A,A))),complement(A)),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[145]),147]),
    [iquote('back_demod(145),demod([147])')] ).

cnf(213,plain,
    equal(join(complement(A),complement(A)),complement(A)),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[31,12]),32,32]),
    [iquote('para(31,12),demod([32,32])')] ).

cnf(232,plain,
    equal(join(A,A),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[147,213]),147,147]),
    [iquote('para(147,213),demod([147,147])')] ).

cnf(233,plain,
    equal(join(zero,complement(A)),complement(A)),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[148]),232]),
    [iquote('back_demod(148),demod([232])')] ).

cnf(239,plain,
    equal(join(zero,A),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[147,233]),147]),
    [iquote('para(147,233),demod([147])')] ).

cnf(240,plain,
    $false,
    inference(conflict,[status(thm)],[239,15]),
    [iquote('conflict(239,15)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : REL001-1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12  % Command  : tptp2X_and_run_eqp %s
% 0.11/0.33  % Computer : n013.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 : Fri Jul  8 08:52:14 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.63/1.04  ----- EQP 0.9e, May 2009 -----
% 0.63/1.04  The job began on n013.cluster.edu, Fri Jul  8 08:52:15 2022
% 0.63/1.04  The command was "./eqp09e".
% 0.63/1.04  
% 0.63/1.04  set(prolog_style_variables).
% 0.63/1.04  set(lrpo).
% 0.63/1.04  set(basic_paramod).
% 0.63/1.04  set(functional_subsume).
% 0.63/1.04  set(ordered_paramod).
% 0.63/1.04  set(prime_paramod).
% 0.63/1.04  set(para_pairs).
% 0.63/1.04  assign(pick_given_ratio,4).
% 0.63/1.04  clear(print_kept).
% 0.63/1.04  clear(print_new_demod).
% 0.63/1.04  clear(print_back_demod).
% 0.63/1.04  clear(print_given).
% 0.63/1.04  assign(max_mem,64000).
% 0.63/1.04  end_of_commands.
% 0.63/1.04  
% 0.63/1.04  Usable:
% 0.63/1.04  end_of_list.
% 0.63/1.04  
% 0.63/1.04  Sos:
% 0.63/1.04  0 (wt=-1) [] join(A,B) = join(B,A).
% 0.63/1.04  0 (wt=-1) [] join(A,join(B,C)) = join(join(A,B),C).
% 0.63/1.04  0 (wt=-1) [] A = join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))).
% 0.63/1.04  0 (wt=-1) [] meet(A,B) = complement(join(complement(A),complement(B))).
% 0.63/1.04  0 (wt=-1) [] composition(A,composition(B,C)) = composition(composition(A,B),C).
% 0.63/1.04  0 (wt=-1) [] composition(A,one) = A.
% 0.63/1.04  0 (wt=-1) [] composition(join(A,B),C) = join(composition(A,C),composition(B,C)).
% 0.63/1.04  0 (wt=-1) [] converse(converse(A)) = A.
% 0.63/1.04  0 (wt=-1) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.63/1.04  0 (wt=-1) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.63/1.04  0 (wt=-1) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.63/1.04  0 (wt=-1) [] top = join(A,complement(A)).
% 0.63/1.04  0 (wt=-1) [] zero = meet(A,complement(A)).
% 0.63/1.04  0 (wt=-1) [] -(join(zero,sk1) = sk1).
% 0.63/1.04  end_of_list.
% 0.63/1.04  
% 0.63/1.04  Demodulators:
% 0.63/1.04  end_of_list.
% 0.63/1.04  
% 0.63/1.04  Passive:
% 0.63/1.04  end_of_list.
% 0.63/1.04  
% 0.63/1.04  Starting to process input.
% 0.63/1.04  
% 0.63/1.04  ** KEPT: 1 (wt=7) [] join(A,B) = join(B,A).
% 0.63/1.04  clause forward subsumed: 0 (wt=7) [flip(1)] join(B,A) = join(A,B).
% 0.63/1.04  
% 0.63/1.04  ** KEPT: 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.63/1.04  2 is a new demodulator.
% 0.63/1.04  
% 0.63/1.04  ** KEPT: 3 (wt=14) [flip(1)] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A.
% 0.63/1.04  3 is a new demodulator.
% 0.63/1.04  
% 0.63/1.04  ** KEPT: 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.63/1.04  4 is a new demodulator.
% 0.63/1.04      -> 4 back demodulating 3.
% 0.63/1.04  
% 0.63/1.04  ** KEPT: 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.63/1.04  5 is a new demodulator.
% 0.63/1.04  
% 0.63/1.04  ** KEPT: 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.63/1.04  6 is a new demodulator.
% 0.63/1.04  
% 0.63/1.04  ** KEPT: 7 (wt=5) [] composition(A,one) = A.
% 0.63/1.04  7 is a new demodulator.
% 0.63/1.04  
% 0.63/1.04  ** KEPT: 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.63/1.04  8 is a new demodulator.
% 0.63/1.04  
% 0.63/1.04  ** KEPT: 9 (wt=5) [] converse(converse(A)) = A.
% 0.63/1.04  9 is a new demodulator.
% 0.63/1.04  
% 0.63/1.04  ** KEPT: 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.63/1.04  10 is a new demodulator.
% 0.63/1.04  
% 0.63/1.04  ** KEPT: 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.63/1.04  11 is a new demodulator.
% 0.63/1.04  
% 0.63/1.04  ** KEPT: 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.63/1.04  12 is a new demodulator.
% 0.63/1.04  
% 0.63/1.04  ** KEPT: 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.63/1.04  13 is a new demodulator.
% 0.63/1.04  
% 0.63/1.04  ** KEPT: 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.63/1.04  14 is a new demodulator.
% 0.63/1.04  
% 0.63/1.04  ** KEPT: 15 (wt=5) [] -(join(zero,sk1) = sk1).
% 0.63/1.04  ---------------- PROOF FOUND ----------------
% 0.63/1.04  % SZS status Unsatisfiable
% 0.63/1.04  
% 0.63/1.04  
% 0.63/1.04  After processing input:
% 0.63/1.04  
% 0.63/1.04  Usable:
% 0.63/1.04  end_of_list.
% 0.63/1.04  
% 0.63/1.04  Sos:
% 0.63/1.04  7 (wt=5) [] composition(A,one) = A.
% 0.63/1.04  9 (wt=5) [] converse(converse(A)) = A.
% 0.63/1.04  15 (wt=5) [] -(join(zero,sk1) = sk1).
% 0.63/1.04  13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.63/1.04  14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.63/1.04  1 (wt=7) [] join(A,B) = join(B,A).
% 0.63/1.04  4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.63/1.04  10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.63/1.04  11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.63/1.04  2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.63/1.04  5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.63/1.04  6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.63/1.04  8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.63/1.04  12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.63/1.04  end_of_list.
% 0.63/1.04  
% 0.63/1.04  Demodulators:
% 0.63/1.04  2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.63/1.04  4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.63/1.04  5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.63/1.04  6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.63/1.04  7 (wt=5) [] composition(A,one) = A.
% 0.63/1.04  8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.63/1.04  9 (wt=5) [] converse(converse(A)) = A.
% 0.63/1.04  10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.63/1.04  11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.63/1.04  12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.63/1.04  13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.63/1.04  14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.63/1.04  end_of_list.
% 0.63/1.04  
% 0.63/1.04  Passive:
% 0.63/1.04  end_of_list.
% 0.63/1.04  
% 0.63/1.04  UNIT CONFLICT from 239 and 15 at   0.01 seconds.
% 0.63/1.04  
% 0.63/1.04  ---------------- PROOF ----------------
% 0.63/1.04  % SZS output start Refutation
% See solution above
% 0.63/1.04  ------------ end of proof -------------
% 0.63/1.04  
% 0.63/1.04  
% 0.63/1.04  ------------- memory usage ------------
% 0.63/1.04  Memory dynamically allocated (tp_alloc): 488.
% 0.63/1.04    type (bytes each)        gets      frees     in use      avail      bytes
% 0.63/1.04  sym_ent (  96)               60          0         60          0      5.6 K
% 0.63/1.04  term (  16)               12284       9177       3107         14     60.0 K
% 0.63/1.04  gen_ptr (   8)            14795       3136      11659         29     91.3 K
% 0.63/1.04  context ( 808)            17715      17713          2          4      4.7 K
% 0.63/1.04  trail (  12)               1070       1070          0          5      0.1 K
% 0.63/1.04  bt_node (  68)             7913       7911          2         12      0.9 K
% 0.63/1.04  ac_position (285432)          0          0          0          0      0.0 K
% 0.63/1.04  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.63/1.04  ac_match_free_vars_pos (4020)
% 0.63/1.04                                0          0          0          0      0.0 K
% 0.63/1.04  discrim (  12)             2858        645       2213          0     25.9 K
% 0.63/1.04  flat (  40)               20058      20058          0         21      0.8 K
% 0.63/1.04  discrim_pos (  12)          549        549          0          1      0.0 K
% 0.63/1.04  fpa_head (  12)            1438          0       1438          0     16.9 K
% 0.63/1.04  fpa_tree (  28)             758        758          0          9      0.2 K
% 0.63/1.04  fpa_pos (  36)              441        441          0          1      0.0 K
% 0.63/1.04  literal (  12)              859        620        239          1      2.8 K
% 0.63/1.04  clause (  24)               859        620        239          1      5.6 K
% 0.63/1.04  list (  12)                 261        205         56          4      0.7 K
% 0.63/1.04  list_pos (  20)            1056        325        731          0     14.3 K
% 0.63/1.04  pair_index (   40)              2          0          2          0      0.1 K
% 0.63/1.04  
% 0.63/1.04  -------------- statistics -------------
% 0.63/1.04  Clauses input                 14
% 0.63/1.04    Usable input                   0
% 0.63/1.04    Sos input                     14
% 0.63/1.04    Demodulators input             0
% 0.63/1.04    Passive input                  0
% 0.63/1.04  
% 0.63/1.04  Processed BS (before search)  16
% 0.63/1.04  Forward subsumed BS            1
% 0.63/1.04  Kept BS                       15
% 0.63/1.04  New demodulators BS           13
% 0.63/1.04  Back demodulated BS            1
% 0.63/1.04  
% 0.63/1.04  Clauses or pairs given      1713
% 0.63/1.04  Clauses generated            526
% 0.63/1.04  Forward subsumed             302
% 0.63/1.04  Deleted by weight              0
% 0.63/1.04  Deleted by variable count      0
% 0.63/1.04  Kept                         224
% 0.63/1.04  New demodulators             189
% 0.63/1.04  Back demodulated              62
% 0.63/1.04  Ordered paramod prunes         0
% 0.63/1.04  Basic paramod prunes        3861
% 0.63/1.04  Prime paramod prunes           3
% 0.63/1.04  Semantic prunes                0
% 0.63/1.04  
% 0.63/1.04  Rewrite attmepts            4851
% 0.63/1.04  Rewrites                     480
% 0.63/1.04  
% 0.63/1.04  FPA overloads                  0
% 0.63/1.04  FPA underloads                 0
% 0.63/1.04  
% 0.63/1.04  Usable size                    0
% 0.63/1.04  Sos size                     175
% 0.63/1.04  Demodulators size            143
% 0.63/1.04  Passive size                   0
% 0.63/1.04  Disabled size                 63
% 0.63/1.04  
% 0.63/1.04  Proofs found                   1
% 0.63/1.04  
% 0.63/1.04  ----------- times (seconds) ----------- Fri Jul  8 08:52:15 2022
% 0.63/1.04  
% 0.63/1.04  user CPU time             0.01   (0 hr, 0 min, 0 sec)
% 0.63/1.04  system CPU time           0.03   (0 hr, 0 min, 0 sec)
% 0.63/1.04  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.63/1.04  input time                0.00
% 0.63/1.04  paramodulation time       0.00
% 0.63/1.04  demodulation time         0.00
% 0.63/1.04  orient time               0.00
% 0.63/1.04  weigh time                0.00
% 0.63/1.04  forward subsume time      0.00
% 0.63/1.04  back demod find time      0.00
% 0.63/1.04  conflict time             0.00
% 0.63/1.04  LRPO time                 0.00
% 0.63/1.04  store clause time         0.00
% 0.63/1.04  disable clause time       0.00
% 0.63/1.04  prime paramod time        0.00
% 0.63/1.04  semantics time            0.00
% 0.63/1.04  
% 0.63/1.04  EQP interrupted
%------------------------------------------------------------------------------