↑ Up

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

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

% Computer : n020.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:21 EDT 2022

% Result   : Unsatisfiable 0.73s 1.22s
% Output   : Refutation 0.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   54 (  54 unt;   0 nHn;   7 RR)
%            Number of literals    :   54 (   0 equ;   1 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    :   11 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :   66 (   7 sgn)

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

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

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('REL011-2.p',unknown),
    [] ).

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

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

cnf(10,plain,
    equal(converse(join(A,B)),join(converse(A),converse(B))),
    file('REL011-2.p',unknown),
    [] ).

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

cnf(12,plain,
    equal(join(composition(converse(A),complement(composition(A,B))),complement(B)),complement(B)),
    file('REL011-2.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(16,plain,
    equal(join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)),meet(composition(A,meet(B,composition(converse(A),C))),C)),
    file('REL011-2.p',unknown),
    [] ).

cnf(18,plain,
    equal(meet(sk1,composition(converse(sk2),sk3)),zero),
    file('REL011-2.p',unknown),
    [] ).

cnf(19,plain,
    ~ equal(meet(composition(sk2,sk1),sk3),zero),
    file('REL011-2.p',unknown),
    [] ).

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

cnf(24,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(29,plain,
    equal(meet(complement(A),A),zero),
    inference(para,[status(thm),theory(equality)],[24,14]),
    [iquote('para(24,14)')] ).

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

cnf(36,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(38,plain,
    equal(composition(converse(one),A),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,36]),9]),
    [iquote('para(9,36),demod([9])')] ).

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

cnf(40,plain,
    equal(composition(one,A),A),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[38]),39]),
    [iquote('back_demod(38),demod([39])')] ).

cnf(45,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(64,plain,
    equal(join(meet(A,complement(complement(A))),zero),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,5]),45]),
    [iquote('para(13,5),demod([45])')] ).

cnf(70,plain,
    equal(join(zero,meet(A,A)),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,5]),4]),
    [iquote('para(14,5),demod([4])')] ).

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

cnf(117,plain,
    equal(join(meet(composition(sk2,sk1),sk3),meet(composition(sk2,zero),sk3)),meet(composition(sk2,zero),sk3)),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[18,16]),18]),
    [iquote('para(18,16),demod([18])')] ).

cnf(157,plain,
    equal(join(complement(A),join(A,B)),join(top,B)),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,2]),1]),
    [iquote('para(23,2),flip(1)')] ).

cnf(206,plain,
    equal(join(meet(complement(complement(A)),A),zero),A),
    inference(para,[status(thm),theory(equality)],[24,64]),
    [iquote('para(24,64)')] ).

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

cnf(218,plain,
    equal(complement(complement(A)),A),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[29,32]),213]),1]),
    [iquote('para(29,32),demod([213]),flip(1)')] ).

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

cnf(290,plain,
    equal(complement(join(A,B)),meet(complement(A),complement(B))),
    inference(para,[status(thm),theory(equality)],[218,238]),
    [iquote('para(218,238)')] ).

cnf(315,plain,
    equal(join(complement(A),complement(A)),complement(A)),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[39,12]),40,40]),
    [iquote('para(39,12),demod([40,40])')] ).

cnf(320,plain,
    equal(join(A,composition(B,A)),composition(join(one,B),A)),
    inference(para,[status(thm),theory(equality)],[40,8]),
    [iquote('para(40,8)')] ).

cnf(327,plain,
    equal(join(A,A),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[218,315]),218,218]),
    [iquote('para(218,315),demod([218,218])')] ).

cnf(347,plain,
    equal(join(top,A),top),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[327,157]),23]),1]),
    [iquote('para(327,157),demod([23]),flip(1)')] ).

cnf(364,plain,
    equal(join(composition(converse(A),complement(composition(A,top))),zero),zero),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[45,12]),45]),
    [iquote('para(45,12),demod([45])')] ).

cnf(401,plain,
    equal(meet(complement(A),complement(A)),complement(A)),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[327,290]),1]),
    [iquote('para(327,290),flip(1)')] ).

cnf(404,plain,
    equal(join(zero,complement(A)),complement(A)),
    inference(para,[status(thm),theory(equality)],[401,70]),
    [iquote('para(401,70)')] ).

cnf(406,plain,
    equal(join(zero,A),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[218,404]),218]),
    [iquote('para(218,404),demod([218])')] ).

cnf(414,plain,
    equal(meet(A,A),A),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[70]),406]),
    [iquote('back_demod(70),demod([406])')] ).

cnf(415,plain,
    equal(join(A,zero),A),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[71]),414]),
    [iquote('back_demod(71),demod([414])')] ).

cnf(417,plain,
    equal(composition(converse(A),complement(composition(A,top))),zero),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[364]),415]),
    [iquote('back_demod(364),demod([415])')] ).

cnf(512,plain,
    equal(meet(zero,complement(A)),zero),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[347,290]),45,45]),1]),
    [iquote('para(347,290),demod([45,45]),flip(1)')] ).

cnf(638,plain,
    equal(meet(zero,A),zero),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[512,32]),406]),
    [iquote('para(512,32),demod([406])')] ).

cnf(683,plain,
    equal(composition(join(one,A),top),top),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[347,320]),1]),
    [iquote('para(347,320),flip(1)')] ).

cnf(717,plain,
    equal(composition(join(one,converse(A)),zero),zero),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[683,417]),10,39,45]),
    [iquote('para(683,417),demod([10,39,45])')] ).

cnf(718,plain,
    equal(composition(join(one,A),zero),zero),
    inference(para,[status(thm),theory(equality)],[9,717]),
    [iquote('para(9,717)')] ).

cnf(745,plain,
    equal(composition(A,zero),zero),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[406,320]),718]),
    [iquote('para(406,320),demod([718])')] ).

cnf(753,plain,
    equal(meet(composition(sk2,sk1),sk3),zero),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[117]),745,638,415,745,638]),
    [iquote('back_demod(117),demod([745,638,415,745,638])')] ).

cnf(754,plain,
    $false,
    inference(conflict,[status(thm)],[753,19]),
    [iquote('conflict(753,19)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : REL011-2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : tptp2X_and_run_eqp %s
% 0.12/0.33  % Computer : n020.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 : Fri Jul  8 14:16:43 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.68/1.09  ----- EQP 0.9e, May 2009 -----
% 0.68/1.09  The job began on n020.cluster.edu, Fri Jul  8 14:16:44 2022
% 0.68/1.09  The command was "./eqp09e".
% 0.68/1.09  
% 0.68/1.09  set(prolog_style_variables).
% 0.68/1.09  set(lrpo).
% 0.68/1.09  set(basic_paramod).
% 0.68/1.09  set(functional_subsume).
% 0.68/1.09  set(ordered_paramod).
% 0.68/1.09  set(prime_paramod).
% 0.68/1.09  set(para_pairs).
% 0.68/1.09  assign(pick_given_ratio,4).
% 0.68/1.09  clear(print_kept).
% 0.68/1.09  clear(print_new_demod).
% 0.68/1.09  clear(print_back_demod).
% 0.68/1.09  clear(print_given).
% 0.68/1.09  assign(max_mem,64000).
% 0.68/1.09  end_of_commands.
% 0.68/1.09  
% 0.68/1.09  Usable:
% 0.68/1.09  end_of_list.
% 0.68/1.09  
% 0.68/1.09  Sos:
% 0.68/1.09  0 (wt=-1) [] join(A,B) = join(B,A).
% 0.68/1.09  0 (wt=-1) [] join(A,join(B,C)) = join(join(A,B),C).
% 0.68/1.09  0 (wt=-1) [] A = join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))).
% 0.68/1.09  0 (wt=-1) [] meet(A,B) = complement(join(complement(A),complement(B))).
% 0.68/1.09  0 (wt=-1) [] composition(A,composition(B,C)) = composition(composition(A,B),C).
% 0.68/1.09  0 (wt=-1) [] composition(A,one) = A.
% 0.68/1.09  0 (wt=-1) [] composition(join(A,B),C) = join(composition(A,C),composition(B,C)).
% 0.68/1.09  0 (wt=-1) [] converse(converse(A)) = A.
% 0.68/1.09  0 (wt=-1) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.68/1.09  0 (wt=-1) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.68/1.09  0 (wt=-1) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.68/1.09  0 (wt=-1) [] top = join(A,complement(A)).
% 0.68/1.09  0 (wt=-1) [] zero = meet(A,complement(A)).
% 0.68/1.09  0 (wt=-1) [] join(meet(composition(A,B),C),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C)))) = composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))).
% 0.68/1.09  0 (wt=-1) [] join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)) = meet(composition(A,meet(B,composition(converse(A),C))),C).
% 0.68/1.09  0 (wt=-1) [] join(meet(composition(A,B),C),meet(composition(meet(A,composition(C,converse(B))),B),C)) = meet(composition(meet(A,composition(C,converse(B))),B),C).
% 0.68/1.09  0 (wt=-1) [] meet(sk1,composition(converse(sk2),sk3)) = zero.
% 0.68/1.09  0 (wt=-1) [] -(meet(composition(sk2,sk1),sk3) = zero).
% 0.68/1.09  end_of_list.
% 0.68/1.09  
% 0.68/1.09  Demodulators:
% 0.68/1.09  end_of_list.
% 0.68/1.09  
% 0.68/1.09  Passive:
% 0.68/1.09  end_of_list.
% 0.68/1.09  
% 0.68/1.09  Starting to process input.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 1 (wt=7) [] join(A,B) = join(B,A).
% 0.68/1.09  clause forward subsumed: 0 (wt=7) [flip(1)] join(B,A) = join(A,B).
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.68/1.09  2 is a new demodulator.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 3 (wt=14) [flip(1)] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A.
% 0.68/1.09  3 is a new demodulator.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.68/1.09  4 is a new demodulator.
% 0.68/1.09      -> 4 back demodulating 3.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.68/1.09  5 is a new demodulator.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.68/1.09  6 is a new demodulator.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 7 (wt=5) [] composition(A,one) = A.
% 0.68/1.09  7 is a new demodulator.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.68/1.09  8 is a new demodulator.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 9 (wt=5) [] converse(converse(A)) = A.
% 0.68/1.09  9 is a new demodulator.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.68/1.09  10 is a new demodulator.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.68/1.09  11 is a new demodulator.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.68/1.09  12 is a new demodulator.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.68/1.09  13 is a new demodulator.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.68/1.09  14 is a new demodulator.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 15 (wt=33) [] join(meet(composition(A,B),C),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C)))) = composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))).
% 0.68/1.09  15 is a new demodulator.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 16 (wt=27) [] join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)) = meet(composition(A,meet(B,composition(converse(A),C))),C).
% 0.68/1.09  16 is a new demodulator.
% 0.68/1.09  
% 0.68/1.09  ** KEPT: 17 (wt=27) [] join(meet(composition(A,B),C),meet(composition(meet(A,composition(C,converse(B))),B),C)) = meet(composition(meet(A,composition(C,converse(B))),B),C).
% 0.73/1.22  17 is a new demodulator.
% 0.73/1.22  
% 0.73/1.22  ** KEPT: 18 (wt=8) [] meet(sk1,composition(converse(sk2),sk3)) = zero.
% 0.73/1.22  18 is a new demodulator.
% 0.73/1.22  
% 0.73/1.22  ** KEPT: 19 (wt=7) [] -(meet(composition(sk2,sk1),sk3) = zero).
% 0.73/1.22  ---------------- PROOF FOUND ----------------
% 0.73/1.22  % SZS status Unsatisfiable
% 0.73/1.22  
% 0.73/1.22  
% 0.73/1.22  After processing input:
% 0.73/1.22  
% 0.73/1.22  Usable:
% 0.73/1.22  end_of_list.
% 0.73/1.22  
% 0.73/1.22  Sos:
% 0.73/1.22  7 (wt=5) [] composition(A,one) = A.
% 0.73/1.22  9 (wt=5) [] converse(converse(A)) = A.
% 0.73/1.22  13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.73/1.22  14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.73/1.22  1 (wt=7) [] join(A,B) = join(B,A).
% 0.73/1.22  19 (wt=7) [] -(meet(composition(sk2,sk1),sk3) = zero).
% 0.73/1.22  18 (wt=8) [] meet(sk1,composition(converse(sk2),sk3)) = zero.
% 0.73/1.22  4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.73/1.22  10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.73/1.22  11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.73/1.22  2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.73/1.22  5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.73/1.22  6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.73/1.22  8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.73/1.22  12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.73/1.22  16 (wt=27) [] join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)) = meet(composition(A,meet(B,composition(converse(A),C))),C).
% 0.73/1.22  17 (wt=27) [] join(meet(composition(A,B),C),meet(composition(meet(A,composition(C,converse(B))),B),C)) = meet(composition(meet(A,composition(C,converse(B))),B),C).
% 0.73/1.22  15 (wt=33) [] join(meet(composition(A,B),C),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C)))) = composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))).
% 0.73/1.22  end_of_list.
% 0.73/1.22  
% 0.73/1.22  Demodulators:
% 0.73/1.22  2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.73/1.22  4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.73/1.22  5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.73/1.22  6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.73/1.22  7 (wt=5) [] composition(A,one) = A.
% 0.73/1.22  8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.73/1.22  9 (wt=5) [] converse(converse(A)) = A.
% 0.73/1.22  10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.73/1.22  11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.73/1.22  12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.73/1.22  13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.73/1.22  14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.73/1.22  15 (wt=33) [] join(meet(composition(A,B),C),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C)))) = composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))).
% 0.73/1.22  16 (wt=27) [] join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)) = meet(composition(A,meet(B,composition(converse(A),C))),C).
% 0.73/1.22  17 (wt=27) [] join(meet(composition(A,B),C),meet(composition(meet(A,composition(C,converse(B))),B),C)) = meet(composition(meet(A,composition(C,converse(B))),B),C).
% 0.73/1.22  18 (wt=8) [] meet(sk1,composition(converse(sk2),sk3)) = zero.
% 0.73/1.22  end_of_list.
% 0.73/1.22  
% 0.73/1.22  Passive:
% 0.73/1.22  end_of_list.
% 0.73/1.22  
% 0.73/1.22  UNIT CONFLICT from 753 and 19 at   0.07 seconds.
% 0.73/1.22  
% 0.73/1.22  ---------------- PROOF ----------------
% 0.73/1.22  % SZS output start Refutation
% See solution above
% 0.73/1.22  ------------ end of proof -------------
% 0.73/1.22  
% 0.73/1.22  
% 0.73/1.22  ------------- memory usage ------------
% 0.73/1.22  Memory dynamically allocated (tp_alloc): 1953.
% 0.73/1.22    type (bytes each)        gets      frees     in use      avail      bytes
% 0.73/1.22  sym_ent (  96)               62          0         62          0      5.8 K
% 0.73/1.22  term (  16)               65308      47715      17593         37    341.4 K
% 0.73/1.22  gen_ptr (   8)            95705      14533      81172         53    634.6 K
% 0.73/1.22  context ( 808)            89469      89467          2          4      4.7 K
% 0.73/1.22  trail (  12)               4370       4370          0          6      0.1 K
% 0.73/1.22  bt_node (  68)            37711      37708          3         23      1.7 K
% 0.73/1.22  ac_position (285432)          0          0          0          0      0.0 K
% 0.73/1.22  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.73/1.22  ac_match_free_vars_pos (4020)
% 0.73/1.22                                0          0          0          0      0.0 K
% 0.73/1.22  discrim (  12)            18143       3790      14353        350    172.3 K
% 0.73/1.22  flat (  40)              115300     115300          0         49      1.9 K
% 0.73/1.22  discrim_pos (  12)         3085       3085          0          1      0.0 K
% 0.73/1.22  fpa_head (  12)            6957          0       6957          0     81.5 K
% 0.73/1.22  fpa_tree (  28)            3554       3554          0         19      0.5 K
% 0.73/1.22  fpa_pos (  36)             1386       1386          0          1      0.0 K
% 0.73/1.22  literal (  12)             2861       2108        753          1      8.8 K
% 0.73/1.22  clause (  24)              2861       2108        753          1     17.7 K
% 0.73/1.22  list (  12)                 692        635         57          3      0.7 K
% 0.73/1.22  list_pos (  20)            3415       1265       2150         22     42.4 K
% 0.73/1.22  pair_index (   40)              2          0          2          0      0.1 K
% 0.73/1.22  
% 0.73/1.22  -------------- statistics -------------
% 0.73/1.22  Clauses input                 18
% 0.73/1.22    Usable input                   0
% 0.73/1.22    Sos input                     18
% 0.73/1.22    Demodulators input             0
% 0.73/1.22    Passive input                  0
% 0.73/1.22  
% 0.73/1.22  Processed BS (before search)  20
% 0.73/1.22  Forward subsumed BS            1
% 0.73/1.22  Kept BS                       19
% 0.73/1.22  New demodulators BS           17
% 0.73/1.22  Back demodulated BS            1
% 0.73/1.22  
% 0.73/1.22  Clauses or pairs given      6737
% 0.73/1.22  Clauses generated           1924
% 0.73/1.22  Forward subsumed            1190
% 0.73/1.22  Deleted by weight              0
% 0.73/1.22  Deleted by variable count      0
% 0.73/1.22  Kept                         734
% 0.73/1.22  New demodulators             616
% 0.73/1.22  Back demodulated             251
% 0.73/1.22  Ordered paramod prunes         0
% 0.73/1.22  Basic paramod prunes       17019
% 0.73/1.22  Prime paramod prunes         109
% 0.73/1.22  Semantic prunes                0
% 0.73/1.22  
% 0.73/1.22  Rewrite attmepts           27581
% 0.73/1.22  Rewrites                    2849
% 0.73/1.22  
% 0.73/1.22  FPA overloads                  0
% 0.73/1.22  FPA underloads                 0
% 0.73/1.22  
% 0.73/1.22  Usable size                    0
% 0.73/1.22  Sos size                     500
% 0.73/1.22  Demodulators size            397
% 0.73/1.22  Passive size                   0
% 0.73/1.22  Disabled size                252
% 0.73/1.22  
% 0.73/1.22  Proofs found                   1
% 0.73/1.22  
% 0.73/1.22  ----------- times (seconds) ----------- Fri Jul  8 14:16:44 2022
% 0.73/1.22  
% 0.73/1.22  user CPU time             0.07   (0 hr, 0 min, 0 sec)
% 0.73/1.22  system CPU time           0.07   (0 hr, 0 min, 0 sec)
% 0.73/1.22  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.73/1.22  input time                0.00
% 0.73/1.22  paramodulation time       0.02
% 0.73/1.22  demodulation time         0.01
% 0.73/1.22  orient time               0.01
% 0.73/1.22  weigh time                0.00
% 0.73/1.22  forward subsume time      0.00
% 0.73/1.22  back demod find time      0.00
% 0.73/1.22  conflict time             0.00
% 0.73/1.22  LRPO time                 0.00
% 0.73/1.22  store clause time         0.01
% 0.73/1.22  disable clause time       0.00
% 0.73/1.22  prime paramod time        0.00
% 0.73/1.22  semantics time            0.00
% 0.73/1.22  
% 0.73/1.22  EQP interrupted
%------------------------------------------------------------------------------