TSTP Solution File: REL050+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : REL050+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:54:32 EDT 2022
% Result : Theorem 2.21s 2.46s
% Output : Refutation 2.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : REL050+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 8 08:04:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.74/1.00 ============================== Prover9 ===============================
% 0.74/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.00 Process 4526 was started by sandbox on n014.cluster.edu,
% 0.74/1.00 Fri Jul 8 08:04:22 2022
% 0.74/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4372_n014.cluster.edu".
% 0.74/1.00 ============================== end of head ===========================
% 0.74/1.00
% 0.74/1.00 ============================== INPUT =================================
% 0.74/1.00
% 0.74/1.00 % Reading from file /tmp/Prover9_4372_n014.cluster.edu
% 0.74/1.00
% 0.74/1.00 set(prolog_style_variables).
% 0.74/1.00 set(auto2).
% 0.74/1.00 % set(auto2) -> set(auto).
% 0.74/1.00 % set(auto) -> set(auto_inference).
% 0.74/1.00 % set(auto) -> set(auto_setup).
% 0.74/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.00 % set(auto) -> set(auto_limits).
% 0.74/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.00 % set(auto) -> set(auto_denials).
% 0.74/1.00 % set(auto) -> set(auto_process).
% 0.74/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.00 % set(auto2) -> assign(stats, some).
% 0.74/1.00 % set(auto2) -> clear(echo_input).
% 0.74/1.00 % set(auto2) -> set(quiet).
% 0.74/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.00 % set(auto2) -> clear(print_given).
% 0.74/1.00 assign(lrs_ticks,-1).
% 0.74/1.00 assign(sos_limit,10000).
% 0.74/1.00 assign(order,kbo).
% 0.74/1.00 set(lex_order_vars).
% 0.74/1.00 clear(print_given).
% 0.74/1.00
% 0.74/1.00 % formulas(sos). % not echoed (14 formulas)
% 0.74/1.00
% 0.74/1.00 ============================== end of input ==========================
% 0.74/1.00
% 0.74/1.00 % From the command line: assign(max_seconds, 300).
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.00
% 0.74/1.00 % Formulas that are not ordinary clauses:
% 0.74/1.00 1 (all X0 all X1 join(X0,X1) = join(X1,X0)) # label(maddux1_join_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 2 (all X0 all X1 all X2 join(X0,join(X1,X2)) = join(join(X0,X1),X2)) # label(maddux2_join_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 3 (all X0 all X1 X0 = join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1)))) # label(maddux3_a_kind_of_de_Morgan) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 4 (all X0 all X1 meet(X0,X1) = complement(join(complement(X0),complement(X1)))) # label(maddux4_definiton_of_meet) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 5 (all X0 all X1 all X2 composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2)) # label(composition_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 6 (all X0 composition(X0,one) = X0) # label(composition_identity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 7 (all X0 all X1 all X2 composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2))) # label(composition_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 8 (all X0 converse(converse(X0)) = X0) # label(converse_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 9 (all X0 all X1 converse(join(X0,X1)) = join(converse(X0),converse(X1))) # label(converse_additivity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 10 (all X0 all X1 converse(composition(X0,X1)) = composition(converse(X1),converse(X0))) # label(converse_multiplicativity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 11 (all X0 all X1 join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1)) # label(converse_cancellativity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 12 (all X0 top = join(X0,complement(X0))) # label(def_top) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 13 (all X0 zero = meet(X0,complement(X0))) # label(def_zero) # label(axiom) # label(non_clause). [assumption].
% 2.21/2.46 14 -(all X0 complement(composition(X0,top)) = composition(complement(composition(X0,top)),top)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 2.21/2.46
% 2.21/2.46 ============================== end of process non-clausal formulas ===
% 2.21/2.46
% 2.21/2.46 ============================== PROCESS INITIAL CLAUSES ===============
% 2.21/2.46
% 2.21/2.46 ============================== PREDICATE ELIMINATION =================
% 2.21/2.46
% 2.21/2.46 ============================== end predicate elimination =============
% 2.21/2.46
% 2.21/2.46 Auto_denials:
% 2.21/2.46 % copying label goals to answer in negative clause
% 2.21/2.46
% 2.21/2.46 Term ordering decisions:
% 2.21/2.46 Function symbol KB weights: one=1. top=1. zero=1. c1=1. join=1. composition=1. meet=1. complement=1. converse=1.
% 2.21/2.46
% 2.21/2.46 ============================== end of process initial clauses ========
% 2.21/2.46
% 2.21/2.46 ============================== CLAUSES FOR SEARCH ====================
% 2.21/2.46
% 2.21/2.46 ============================== end of clauses for search =============
% 2.21/2.46
% 2.21/2.46 ============================== SEARCH ================================
% 2.21/2.46
% 2.21/2.46 % Starting search at 0.01 seconds.
% 2.21/2.46
% 2.21/2.46 Low Water (keep): wt=38.000, iters=3354
% 2.21/2.46
% 2.21/2.46 Low Water (keep): wt=35.000, iters=3378
% 2.21/2.46
% 2.21/2.46 Low Water (keep): wt=32.000, iters=3358
% 2.21/2.46
% 2.21/2.46 Low Water (keep): wt=31.000, iters=3407
% 2.21/2.46
% 2.21/2.46 Low Water (keep): wt=30.000, iters=3370
% 2.21/2.46
% 2.21/2.46 Low Water (keep): wt=29.000, iters=3336
% 2.21/2.46
% 2.21/2.46 Low Water (keep): wt=28.000, iters=3339
% 2.21/2.46
% 2.21/2.46 Low Water (keep): wt=27.000, iters=3406
% 2.21/2.46
% 2.21/2.46 Low Water (keep): wt=26.000, iters=3336
% 2.21/2.46
% 2.21/2.46 Low Water (keep): wt=25.000, iters=3366
% 2.21/2.46
% 2.21/2.46 Low Water (keep): wt=24.000, iters=3335
% 2.21/2.46
% 2.21/2.46 ============================== PROOF =================================
% 2.21/2.46 % SZS status Theorem
% 2.21/2.46 % SZS output start Refutation
% 2.21/2.46
% 2.21/2.46 % Proof 1 at 1.42 (+ 0.05) seconds: goals.
% 2.21/2.46 % Length of proof is 119.
% 2.21/2.46 % Level of proof is 32.
% 2.21/2.46 % Maximum clause weight is 21.000.
% 2.21/2.46 % Given clauses 513.
% 2.21/2.46
% 2.21/2.46 1 (all X0 all X1 join(X0,X1) = join(X1,X0)) # label(maddux1_join_commutativity) # label(axiom) # label(non_clause). [assumption].
% 2.21/2.46 2 (all X0 all X1 all X2 join(X0,join(X1,X2)) = join(join(X0,X1),X2)) # label(maddux2_join_associativity) # label(axiom) # label(non_clause). [assumption].
% 2.21/2.46 3 (all X0 all X1 X0 = join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1)))) # label(maddux3_a_kind_of_de_Morgan) # label(axiom) # label(non_clause). [assumption].
% 2.21/2.46 4 (all X0 all X1 meet(X0,X1) = complement(join(complement(X0),complement(X1)))) # label(maddux4_definiton_of_meet) # label(axiom) # label(non_clause). [assumption].
% 2.21/2.46 5 (all X0 all X1 all X2 composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2)) # label(composition_associativity) # label(axiom) # label(non_clause). [assumption].
% 2.21/2.46 6 (all X0 composition(X0,one) = X0) # label(composition_identity) # label(axiom) # label(non_clause). [assumption].
% 2.21/2.46 7 (all X0 all X1 all X2 composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2))) # label(composition_distributivity) # label(axiom) # label(non_clause). [assumption].
% 2.21/2.46 8 (all X0 converse(converse(X0)) = X0) # label(converse_idempotence) # label(axiom) # label(non_clause). [assumption].
% 2.21/2.46 9 (all X0 all X1 converse(join(X0,X1)) = join(converse(X0),converse(X1))) # label(converse_additivity) # label(axiom) # label(non_clause). [assumption].
% 2.21/2.46 10 (all X0 all X1 converse(composition(X0,X1)) = composition(converse(X1),converse(X0))) # label(converse_multiplicativity) # label(axiom) # label(non_clause). [assumption].
% 2.21/2.46 11 (all X0 all X1 join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1)) # label(converse_cancellativity) # label(axiom) # label(non_clause). [assumption].
% 2.21/2.46 12 (all X0 top = join(X0,complement(X0))) # label(def_top) # label(axiom) # label(non_clause). [assumption].
% 2.21/2.46 13 (all X0 zero = meet(X0,complement(X0))) # label(def_zero) # label(axiom) # label(non_clause). [assumption].
% 2.21/2.46 14 -(all X0 complement(composition(X0,top)) = composition(complement(composition(X0,top)),top)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 2.21/2.46 15 composition(A,one) = A # label(composition_identity) # label(axiom). [clausify(6)].
% 2.21/2.46 16 converse(converse(A)) = A # label(converse_idempotence) # label(axiom). [clausify(8)].
% 2.21/2.46 17 join(A,complement(A)) = top # label(def_top) # label(axiom). [clausify(12)].
% 2.21/2.46 18 meet(A,complement(A)) = zero # label(def_zero) # label(axiom). [clausify(13)].
% 2.21/2.46 19 join(A,B) = join(B,A) # label(maddux1_join_commutativity) # label(axiom). [clausify(1)].
% 2.21/2.46 20 meet(A,B) = complement(join(complement(A),complement(B))) # label(maddux4_definiton_of_meet) # label(axiom). [clausify(4)].
% 2.21/2.46 21 converse(join(A,B)) = join(converse(A),converse(B)) # label(converse_additivity) # label(axiom). [clausify(9)].
% 2.21/2.46 22 join(converse(A),converse(B)) = converse(join(A,B)). [copy(21),flip(a)].
% 2.21/2.46 23 converse(composition(A,B)) = composition(converse(B),converse(A)) # label(converse_multiplicativity) # label(axiom). [clausify(10)].
% 2.21/2.46 24 composition(converse(A),converse(B)) = converse(composition(B,A)). [copy(23),flip(a)].
% 2.21/2.46 25 join(join(A,B),C) = join(A,join(B,C)) # label(maddux2_join_associativity) # label(axiom). [clausify(2)].
% 2.21/2.46 26 join(A,join(B,C)) = join(C,join(A,B)). [copy(25),rewrite([19(2)]),flip(a)].
% 2.21/2.46 27 composition(composition(A,B),C) = composition(A,composition(B,C)) # label(composition_associativity) # label(axiom). [clausify(5)].
% 2.21/2.46 28 composition(join(A,B),C) = join(composition(A,C),composition(B,C)) # label(composition_distributivity) # label(axiom). [clausify(7)].
% 2.21/2.46 29 join(composition(A,B),composition(C,B)) = composition(join(A,C),B). [copy(28),flip(a)].
% 2.21/2.46 30 complement(A) = join(composition(converse(B),complement(composition(B,A))),complement(A)) # label(converse_cancellativity) # label(axiom). [clausify(11)].
% 2.21/2.46 31 join(complement(A),composition(converse(B),complement(composition(B,A)))) = complement(A). [copy(30),rewrite([19(7)]),flip(a)].
% 2.21/2.46 32 join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A # label(maddux3_a_kind_of_de_Morgan) # label(axiom). [clausify(3)].
% 2.21/2.46 33 join(complement(join(A,complement(B))),complement(join(complement(A),complement(B)))) = B. [copy(32),rewrite([19(6),19(8)]),rewrite([19(6)])].
% 2.21/2.46 34 composition(complement(composition(c1,top)),top) != complement(composition(c1,top)) # label(goals) # label(negated_conjecture) # answer(goals). [clausify(14)].
% 2.21/2.46 35 complement(top) = zero. [back_rewrite(18),rewrite([20(2),17(4)])].
% 2.21/2.46 37 converse(composition(A,converse(B))) = composition(B,converse(A)). [para(16(a,1),24(a,1,1)),flip(a)].
% 2.21/2.46 38 converse(composition(converse(A),B)) = composition(converse(B),A). [para(16(a,1),24(a,1,2)),flip(a)].
% 2.21/2.46 39 join(A,join(B,complement(A))) = join(B,top). [para(17(a,1),26(a,2,2)),rewrite([19(2)])].
% 2.21/2.46 40 composition(A,composition(one,B)) = composition(A,B). [para(15(a,1),27(a,1,1)),flip(a)].
% 2.21/2.46 42 join(converse(composition(A,B)),composition(C,converse(A))) = composition(join(C,converse(B)),converse(A)). [para(24(a,1),29(a,1,1)),rewrite([19(7)])].
% 2.21/2.46 44 join(composition(A,composition(B,C)),composition(D,C)) = composition(join(D,composition(A,B)),C). [para(27(a,1),29(a,1,1)),rewrite([19(6)])].
% 2.21/2.46 46 join(complement(one),composition(converse(A),complement(A))) = complement(one). [para(15(a,1),31(a,1,2,2,1))].
% 2.21/2.46 47 join(complement(A),composition(B,complement(composition(converse(B),A)))) = complement(A). [para(16(a,1),31(a,1,2,1))].
% 2.21/2.46 49 join(complement(converse(A)),composition(B,complement(converse(composition(A,B))))) = complement(converse(A)). [para(24(a,1),31(a,1,2,2,1)),rewrite([16(4)])].
% 2.21/2.46 51 join(zero,complement(join(complement(A),complement(A)))) = A. [para(17(a,1),33(a,1,1,1)),rewrite([35(2)])].
% 2.21/2.46 55 join(complement(A),complement(join(join(B,complement(A)),complement(join(complement(B),complement(A)))))) = join(complement(B),complement(A)). [para(33(a,1),33(a,1,2,1)),rewrite([19(10)])].
% 2.21/2.46 57 join(zero,composition(converse(A),complement(composition(A,top)))) = zero. [para(35(a,1),31(a,1,1)),rewrite([35(9)])].
% 2.21/2.46 59 join(complement(join(top,complement(A))),complement(join(zero,complement(A)))) = A. [para(35(a,1),33(a,1,2,1,1))].
% 2.21/2.46 72 composition(converse(one),A) = A. [para(15(a,1),38(a,1,1)),rewrite([16(2)]),flip(a)].
% 2.21/2.46 78 converse(one) = one. [para(72(a,1),15(a,1)),flip(a)].
% 2.21/2.46 80 composition(join(A,one),B) = join(B,composition(A,B)). [para(72(a,1),29(a,1,1)),rewrite([78(4),19(4)]),flip(a)].
% 2.21/2.46 82 join(complement(A),complement(composition(one,A))) = complement(A). [para(72(a,1),31(a,1,2))].
% 2.21/2.46 83 composition(one,A) = A. [para(72(a,1),40(a,2)),rewrite([78(2),40(4)])].
% 2.21/2.46 84 join(complement(A),complement(A)) = complement(A). [back_rewrite(82),rewrite([83(3)])].
% 2.21/2.46 85 join(zero,complement(complement(A))) = A. [back_rewrite(51),rewrite([84(4)])].
% 2.21/2.46 86 converse(join(A,one)) = join(one,converse(A)). [para(78(a,1),22(a,1,1)),rewrite([19(5)]),flip(a)].
% 2.21/2.46 90 join(top,complement(A)) = top. [para(84(a,1),39(a,1,2)),rewrite([17(2),19(4)]),flip(a)].
% 2.21/2.46 91 join(zero,complement(join(zero,complement(A)))) = A. [back_rewrite(59),rewrite([90(3),35(2)])].
% 2.21/2.46 92 join(top,top) = join(A,top). [para(90(a,1),39(a,1,2)),flip(a)].
% 2.21/2.46 97 join(A,top) = join(B,top). [para(92(a,1),39(a,2)),rewrite([90(3)])].
% 2.21/2.46 98 join(A,top) = c_0. [new_symbol(97)].
% 2.21/2.46 101 join(A,join(B,complement(A))) = c_0. [back_rewrite(39),rewrite([98(5)])].
% 2.21/2.46 107 converse(join(A,composition(A,B))) = composition(join(one,converse(B)),converse(A)). [para(83(a,1),42(a,1,2)),rewrite([19(4),22(4)])].
% 2.21/2.46 112 c_0 = top. [para(85(a,1),101(a,1,2)),rewrite([19(2),17(2)]),flip(a)].
% 2.21/2.46 113 join(A,join(B,complement(A))) = top. [back_rewrite(101),rewrite([112(4)])].
% 2.21/2.46 115 join(A,top) = top. [back_rewrite(98),rewrite([112(3)])].
% 2.21/2.46 126 composition(join(one,converse(A)),converse(B)) = converse(composition(B,join(A,one))). [para(86(a,1),24(a,1,1))].
% 2.21/2.46 133 converse(composition(A,join(B,one))) = converse(join(A,composition(A,B))). [back_rewrite(107),rewrite([126(8)]),flip(a)].
% 2.21/2.46 140 join(zero,complement(A)) = complement(A). [para(85(a,1),91(a,1,2,1))].
% 2.21/2.46 141 complement(complement(A)) = A. [back_rewrite(91),rewrite([140(4),140(4)])].
% 2.21/2.46 142 join(A,zero) = A. [back_rewrite(85),rewrite([141(3),19(2)])].
% 2.21/2.46 147 join(complement(join(A,B)),complement(join(B,complement(A)))) = complement(B). [para(141(a,1),33(a,1,1,1,2)),rewrite([141(5),19(4)])].
% 2.21/2.46 148 complement(zero) = top. [para(35(a,1),141(a,1,1))].
% 2.21/2.46 149 join(A,A) = A. [para(141(a,1),84(a,1,1)),rewrite([141(2),141(3)])].
% 2.21/2.46 153 join(A,join(A,B)) = join(A,B). [para(149(a,1),26(a,1)),rewrite([19(3),26(4,R),19(3),26(3,R),149(2)]),flip(a)].
% 2.21/2.46 154 join(A,complement(join(B,complement(A)))) = A. [para(33(a,1),153(a,1,2)),rewrite([19(4),33(12)])].
% 2.21/2.46 156 join(A,join(B,complement(join(C,complement(A))))) = join(A,B). [para(154(a,1),26(a,2,2)),rewrite([19(4),19(6)])].
% 2.21/2.46 159 join(complement(A),complement(join(A,B))) = complement(A). [para(141(a,1),154(a,1,2,1,2)),rewrite([19(2)])].
% 2.21/2.46 167 join(complement(one),composition(converse(complement(A)),A)) = complement(one). [para(141(a,1),46(a,1,2,2))].
% 2.21/2.46 170 join(complement(converse(A)),complement(converse(join(A,B)))) = complement(converse(A)). [para(22(a,1),159(a,1,2,1))].
% 2.21/2.46 181 join(converse(zero),composition(converse(complement(composition(A,top))),A)) = converse(zero). [para(57(a,1),22(a,2,1)),rewrite([38(8)])].
% 2.21/2.46 221 join(complement(one),converse(complement(one))) = complement(one). [para(15(a,1),167(a,1,2))].
% 2.21/2.46 225 converse(complement(one)) = complement(one). [para(221(a,1),22(a,2,1)),rewrite([16(7),19(6),221(6)]),flip(a)].
% 2.21/2.46 230 converse(top) = top. [para(225(a,1),86(a,2,2)),rewrite([19(4),17(4),17(6)])].
% 2.21/2.46 234 join(top,converse(A)) = top. [para(230(a,1),22(a,1,1)),rewrite([19(5),115(5),230(5)])].
% 2.21/2.46 235 converse(composition(A,top)) = composition(top,converse(A)). [para(230(a,1),24(a,1,1)),flip(a)].
% 2.21/2.46 243 join(top,composition(A,converse(B))) = top. [para(37(a,1),234(a,1,2))].
% 2.21/2.46 245 join(top,composition(A,B)) = top. [para(16(a,1),243(a,1,2,2))].
% 2.21/2.46 261 composition(top,join(one,converse(A))) = top. [para(86(a,1),235(a,2,2)),rewrite([80(4),245(4),230(2)]),flip(a)].
% 2.21/2.46 266 composition(top,join(A,one)) = top. [para(16(a,1),261(a,1,2,2)),rewrite([19(3)])].
% 2.21/2.46 290 join(zero,composition(A,zero)) = zero. [para(266(a,1),49(a,1,2,2,1,1)),rewrite([230(2),35(2),230(5),35(5),80(5),153(6),230(6),35(6)])].
% 2.21/2.46 299 join(complement(A),complement(join(B,A))) = complement(A). [para(154(a,1),55(a,2)),rewrite([141(2),141(4),141(8),55(13)])].
% 2.21/2.46 305 join(A,composition(B,zero)) = A. [para(290(a,1),26(a,1,2)),rewrite([142(2),142(4),19(3)]),flip(a)].
% 2.21/2.46 309 composition(join(A,B),zero) = composition(A,zero). [para(305(a,1),29(a,1)),flip(a)].
% 2.21/2.46 311 composition(A,zero) = zero. [para(305(a,1),80(a,2)),rewrite([309(4)])].
% 2.21/2.46 313 composition(converse(zero),A) = converse(zero). [para(311(a,1),38(a,1,1)),flip(a)].
% 2.21/2.46 322 composition(join(A,composition(B,converse(zero))),C) = join(composition(B,converse(zero)),composition(A,C)). [para(313(a,1),44(a,1,1,2)),flip(a)].
% 2.21/2.46 326 converse(zero) = zero. [para(313(a,1),311(a,1))].
% 2.21/2.46 329 join(zero,composition(A,B)) = composition(A,B). [back_rewrite(322),rewrite([326(2),311(2),142(2),326(3),311(3)]),flip(a)].
% 2.21/2.46 331 composition(zero,A) = zero. [back_rewrite(313),rewrite([326(2),326(4)])].
% 2.21/2.46 332 composition(converse(complement(composition(A,top))),A) = zero. [back_rewrite(181),rewrite([326(2),329(7),326(7)])].
% 2.21/2.46 417 composition(converse(complement(composition(A,top))),composition(A,B)) = zero. [para(332(a,1),27(a,1,1)),rewrite([331(2)]),flip(a)].
% 2.21/2.46 560 join(one,complement(composition(converse(complement(A)),A))) = complement(composition(converse(complement(A)),A)). [para(167(a,1),299(a,1,2,1)),rewrite([141(7),19(6)])].
% 2.21/2.46 1508 composition(A,join(B,one)) = join(A,composition(A,B)). [para(133(a,1),16(a,1,1)),rewrite([16(4)]),flip(a)].
% 2.21/2.46 1968 composition(complement(A),complement(composition(converse(complement(A)),A))) = complement(A). [para(1508(a,2),47(a,1)),rewrite([19(7),560(7)])].
% 2.21/2.46 2511 join(A,complement(join(A,B))) = join(A,complement(B)). [para(147(a,1),156(a,1,2)),flip(a)].
% 2.21/2.46 2939 join(complement(converse(A)),converse(join(A,B))) = top. [para(170(a,1),113(a,1,2)),rewrite([19(5)])].
% 2.21/2.46 2965 join(A,join(B,converse(complement(converse(A))))) = top. [para(2939(a,1),22(a,2,1)),rewrite([16(6),26(5),19(4),26(5,R),19(4),230(7)])].
% 2.21/2.46 2996 join(A,converse(complement(converse(A)))) = top. [para(149(a,1),2965(a,1,2))].
% 2.21/2.46 3033 join(A,complement(converse(complement(converse(A))))) = A. [para(2996(a,1),2511(a,1,2,1)),rewrite([35(2),142(2)]),flip(a)].
% 2.21/2.46 3034 join(converse(A),complement(converse(complement(A)))) = converse(A). [para(16(a,1),3033(a,1,2,1,1,1))].
% 2.21/2.46 3037 join(A,converse(complement(converse(complement(A))))) = converse(complement(converse(complement(A)))). [para(3033(a,1),33(a,1,2,1)),rewrite([141(9),19(8),2511(8),141(6)])].
% 2.21/2.46 3156 converse(complement(converse(complement(A)))) = A. [para(3034(a,1),22(a,2,1)),rewrite([16(2),3037(5),16(6)])].
% 2.21/2.46 3179 complement(converse(complement(A))) = converse(A). [para(3156(a,1),16(a,1,1)),flip(a)].
% 2.21/2.46 3248 converse(complement(A)) = complement(converse(A)). [para(3179(a,1),141(a,1,1)),flip(a)].
% 2.21/2.46 3356 composition(complement(A),complement(composition(complement(converse(A)),A))) = complement(A). [back_rewrite(1968),rewrite([3248(3)])].
% 2.21/2.46 3426 composition(complement(composition(top,converse(A))),composition(A,B)) = zero. [back_rewrite(417),rewrite([3248(4),235(3)])].
% 2.21/2.46 9380 composition(complement(composition(A,top)),top) = complement(composition(A,top)). [para(235(a,1),3356(a,1,2,1,1,1)),rewrite([3426(10),148(5)])].
% 2.21/2.46 9381 $F # answer(goals). [resolve(9380,a,34,a)].
% 2.21/2.46
% 2.21/2.46 % SZS output end Refutation
% 2.21/2.46 ============================== end of proof ==========================
% 2.21/2.46
% 2.21/2.46 ============================== STATISTICS ============================
% 2.21/2.46
% 2.21/2.46 Given=513. Generated=69508. Kept=9360. proofs=1.
% 2.21/2.46 Usable=417. Sos=7403. Demods=7392. Limbo=9, Disabled=1544. Hints=0.
% 2.21/2.46 Megabytes=11.70.
% 2.21/2.46 User_CPU=1.42, System_CPU=0.05, Wall_clock=1.
% 2.21/2.46
% 2.21/2.46 ============================== end of statistics =====================
% 2.21/2.46
% 2.21/2.46 ============================== end of search =========================
% 2.21/2.46
% 2.21/2.46 THEOREM PROVED
% 2.21/2.46 % SZS status Theorem
% 2.21/2.46
% 2.21/2.46 Exiting with 1 proof.
% 2.21/2.46
% 2.21/2.46 Process 4526 exit (max_proofs) Fri Jul 8 08:04:23 2022
% 2.21/2.47 Prover9 interrupted
%------------------------------------------------------------------------------