TSTP Solution File: REL027+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : REL027+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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:01 EDT 2022
% Result : Theorem 3.99s 4.27s
% Output : Refutation 3.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : REL027+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jul 8 11:01:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.74/1.01 ============================== Prover9 ===============================
% 0.74/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.01 Process 26149 was started by sandbox2 on n018.cluster.edu,
% 0.74/1.01 Fri Jul 8 11:01:41 2022
% 0.74/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25996_n018.cluster.edu".
% 0.74/1.01 ============================== end of head ===========================
% 0.74/1.01
% 0.74/1.01 ============================== INPUT =================================
% 0.74/1.01
% 0.74/1.01 % Reading from file /tmp/Prover9_25996_n018.cluster.edu
% 0.74/1.01
% 0.74/1.01 set(prolog_style_variables).
% 0.74/1.01 set(auto2).
% 0.74/1.01 % set(auto2) -> set(auto).
% 0.74/1.01 % set(auto) -> set(auto_inference).
% 0.74/1.01 % set(auto) -> set(auto_setup).
% 0.74/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.01 % set(auto) -> set(auto_limits).
% 0.74/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.01 % set(auto) -> set(auto_denials).
% 0.74/1.01 % set(auto) -> set(auto_process).
% 0.74/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.01 % set(auto2) -> assign(stats, some).
% 0.74/1.01 % set(auto2) -> clear(echo_input).
% 0.74/1.01 % set(auto2) -> set(quiet).
% 0.74/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.01 % set(auto2) -> clear(print_given).
% 0.74/1.01 assign(lrs_ticks,-1).
% 0.74/1.01 assign(sos_limit,10000).
% 0.74/1.01 assign(order,kbo).
% 0.74/1.01 set(lex_order_vars).
% 0.74/1.01 clear(print_given).
% 0.74/1.01
% 0.74/1.01 % formulas(sos). % not echoed (17 formulas)
% 0.74/1.01
% 0.74/1.01 ============================== end of input ==========================
% 0.74/1.01
% 0.74/1.01 % From the command line: assign(max_seconds, 300).
% 0.74/1.01
% 0.74/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.01
% 0.74/1.01 % Formulas that are not ordinary clauses:
% 0.74/1.01 1 (all X0 all X1 join(X0,X1) = join(X1,X0)) # label(maddux1_join_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 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.01 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.01 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.01 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.01 6 (all X0 composition(X0,one) = X0) # label(composition_identity) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 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.01 8 (all X0 converse(converse(X0)) = X0) # label(converse_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 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.01 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.01 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.01 12 (all X0 top = join(X0,complement(X0))) # label(def_top) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 13 (all X0 zero = meet(X0,complement(X0))) # label(def_zero) # label(axiom) # label(non_clause). [assumption].
% 3.99/4.27 14 (all X0 all X1 all X2 join(meet(composition(X0,X1),X2),composition(meet(X0,composition(X2,converse(X1))),meet(X1,composition(converse(X0),X2)))) = composition(meet(X0,composition(X2,converse(X1))),meet(X1,composition(converse(X0),X2)))) # label(dedekind_law) # label(axiom) # label(non_clause). [assumption].
% 3.99/4.27 15 (all X0 all X1 all X2 join(meet(composition(X0,X1),X2),meet(composition(X0,meet(X1,composition(converse(X0),X2))),X2)) = meet(composition(X0,meet(X1,composition(converse(X0),X2))),X2)) # label(modular_law_1) # label(axiom) # label(non_clause). [assumption].
% 3.99/4.27 16 (all X0 all X1 all X2 join(meet(composition(X0,X1),X2),meet(composition(meet(X0,composition(X2,converse(X1))),X1),X2)) = meet(composition(meet(X0,composition(X2,converse(X1))),X1),X2)) # label(modular_law_2) # label(axiom) # label(non_clause). [assumption].
% 3.99/4.27 17 -(all X0 (join(X0,one) = one -> meet(complement(composition(X0,top)),one) = meet(complement(X0),one))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 3.99/4.27
% 3.99/4.27 ============================== end of process non-clausal formulas ===
% 3.99/4.27
% 3.99/4.27 ============================== PROCESS INITIAL CLAUSES ===============
% 3.99/4.27
% 3.99/4.27 ============================== PREDICATE ELIMINATION =================
% 3.99/4.27
% 3.99/4.27 ============================== end predicate elimination =============
% 3.99/4.27
% 3.99/4.27 Auto_denials:
% 3.99/4.27 % copying label goals to answer in negative clause
% 3.99/4.27
% 3.99/4.27 Term ordering decisions:
% 3.99/4.27 Function symbol KB weights: one=1. top=1. zero=1. c1=1. composition=1. join=1. meet=1. converse=1. complement=1.
% 3.99/4.27
% 3.99/4.27 ============================== end of process initial clauses ========
% 3.99/4.27
% 3.99/4.27 ============================== CLAUSES FOR SEARCH ====================
% 3.99/4.27
% 3.99/4.27 ============================== end of clauses for search =============
% 3.99/4.27
% 3.99/4.27 ============================== SEARCH ================================
% 3.99/4.27
% 3.99/4.27 % Starting search at 0.02 seconds.
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=128.000, iters=3388
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=104.000, iters=3375
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=76.000, iters=3394
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=74.000, iters=3375
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=72.000, iters=3337
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=71.000, iters=3382
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=69.000, iters=3345
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=67.000, iters=3383
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=66.000, iters=3405
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=65.000, iters=3358
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=64.000, iters=3376
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=62.000, iters=3353
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=61.000, iters=3335
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=60.000, iters=3355
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=59.000, iters=3352
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=58.000, iters=3356
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=57.000, iters=3400
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=56.000, iters=3339
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=55.000, iters=3415
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=54.000, iters=3335
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=53.000, iters=3333
% 3.99/4.27
% 3.99/4.27 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 30 (0.00 of 2.17 sec).
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=51.000, iters=3361
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=49.000, iters=3370
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=48.000, iters=3421
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=46.000, iters=3348
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=45.000, iters=3362
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=44.000, iters=3365
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=43.000, iters=3371
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=41.000, iters=3335
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=40.000, iters=3340
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=39.000, iters=3366
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=38.000, iters=3346
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=37.000, iters=3420
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=35.000, iters=3355
% 3.99/4.27
% 3.99/4.27 Low Water (keep): wt=33.000, iters=3357
% 3.99/4.27
% 3.99/4.27 ============================== PROOF =================================
% 3.99/4.27 % SZS status Theorem
% 3.99/4.27 % SZS output start Refutation
% 3.99/4.27
% 3.99/4.27 % Proof 1 at 3.21 (+ 0.07) seconds: goals.
% 3.99/4.27 % Length of proof is 97.
% 3.99/4.27 % Level of proof is 21.
% 3.99/4.27 % Maximum clause weight is 48.000.
% 3.99/4.27 % Given clauses 607.
% 3.99/4.27
% 3.99/4.27 1 (all X0 all X1 join(X0,X1) = join(X1,X0)) # label(maddux1_join_commutativity) # label(axiom) # label(non_clause). [assumption].
% 3.99/4.27 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].
% 3.99/4.27 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].
% 3.99/4.27 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].
% 3.99/4.27 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].
% 3.99/4.27 6 (all X0 composition(X0,one) = X0) # label(composition_identity) # label(axiom) # label(non_clause). [assumption].
% 3.99/4.27 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].
% 3.99/4.27 8 (all X0 converse(converse(X0)) = X0) # label(converse_idempotence) # label(axiom) # label(non_clause). [assumption].
% 3.99/4.27 9 (all X0 all X1 converse(join(X0,X1)) = join(converse(X0),converse(X1))) # label(converse_additivity) # label(axiom) # label(non_clause). [assumption].
% 3.99/4.27 10 (all X0 all X1 converse(composition(X0,X1)) = composition(converse(X1),converse(X0))) # label(converse_multiplicativity) # label(axiom) # label(non_clause). [assumption].
% 3.99/4.27 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].
% 3.99/4.27 12 (all X0 top = join(X0,complement(X0))) # label(def_top) # label(axiom) # label(non_clause). [assumption].
% 3.99/4.27 13 (all X0 zero = meet(X0,complement(X0))) # label(def_zero) # label(axiom) # label(non_clause). [assumption].
% 3.99/4.27 14 (all X0 all X1 all X2 join(meet(composition(X0,X1),X2),composition(meet(X0,composition(X2,converse(X1))),meet(X1,composition(converse(X0),X2)))) = composition(meet(X0,composition(X2,converse(X1))),meet(X1,composition(converse(X0),X2)))) # label(dedekind_law) # label(axiom) # label(non_clause). [assumption].
% 3.99/4.27 15 (all X0 all X1 all X2 join(meet(composition(X0,X1),X2),meet(composition(X0,meet(X1,composition(converse(X0),X2))),X2)) = meet(composition(X0,meet(X1,composition(converse(X0),X2))),X2)) # label(modular_law_1) # label(axiom) # label(non_clause). [assumption].
% 3.99/4.27 17 -(all X0 (join(X0,one) = one -> meet(complement(composition(X0,top)),one) = meet(complement(X0),one))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 3.99/4.27 18 composition(A,one) = A # label(composition_identity) # label(axiom). [clausify(6)].
% 3.99/4.27 19 converse(converse(A)) = A # label(converse_idempotence) # label(axiom). [clausify(8)].
% 3.99/4.27 20 join(c1,one) = one # label(goals) # label(negated_conjecture). [clausify(17)].
% 3.99/4.27 21 join(A,complement(A)) = top # label(def_top) # label(axiom). [clausify(12)].
% 3.99/4.27 22 meet(A,complement(A)) = zero # label(def_zero) # label(axiom). [clausify(13)].
% 3.99/4.27 23 join(A,B) = join(B,A) # label(maddux1_join_commutativity) # label(axiom). [clausify(1)].
% 3.99/4.27 24 meet(A,B) = complement(join(complement(A),complement(B))) # label(maddux4_definiton_of_meet) # label(axiom). [clausify(4)].
% 3.99/4.27 25 converse(join(A,B)) = join(converse(A),converse(B)) # label(converse_additivity) # label(axiom). [clausify(9)].
% 3.99/4.27 26 join(converse(A),converse(B)) = converse(join(A,B)). [copy(25),flip(a)].
% 3.99/4.27 27 converse(composition(A,B)) = composition(converse(B),converse(A)) # label(converse_multiplicativity) # label(axiom). [clausify(10)].
% 3.99/4.27 28 composition(converse(A),converse(B)) = converse(composition(B,A)). [copy(27),flip(a)].
% 3.99/4.27 29 join(join(A,B),C) = join(A,join(B,C)) # label(maddux2_join_associativity) # label(axiom). [clausify(2)].
% 3.99/4.27 30 join(A,join(B,C)) = join(C,join(A,B)). [copy(29),rewrite([23(2)]),flip(a)].
% 3.99/4.27 31 composition(composition(A,B),C) = composition(A,composition(B,C)) # label(composition_associativity) # label(axiom). [clausify(5)].
% 3.99/4.27 32 composition(join(A,B),C) = join(composition(A,C),composition(B,C)) # label(composition_distributivity) # label(axiom). [clausify(7)].
% 3.99/4.27 33 join(composition(A,B),composition(C,B)) = composition(join(A,C),B). [copy(32),flip(a)].
% 3.99/4.27 34 complement(A) = join(composition(converse(B),complement(composition(B,A))),complement(A)) # label(converse_cancellativity) # label(axiom). [clausify(11)].
% 3.99/4.27 35 join(complement(A),composition(converse(B),complement(composition(B,A)))) = complement(A). [copy(34),rewrite([23(7)]),flip(a)].
% 3.99/4.27 36 join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A # label(maddux3_a_kind_of_de_Morgan) # label(axiom). [clausify(3)].
% 3.99/4.27 37 join(complement(join(A,complement(B))),complement(join(complement(A),complement(B)))) = B. [copy(36),rewrite([23(6),23(8)]),rewrite([23(6)])].
% 3.99/4.27 38 meet(composition(A,meet(B,composition(converse(A),C))),C) = join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)) # label(modular_law_1) # label(axiom). [clausify(15)].
% 3.99/4.27 39 join(complement(join(complement(A),complement(composition(B,C)))),complement(join(complement(A),complement(composition(B,complement(join(complement(C),complement(composition(converse(B),A))))))))) = complement(join(complement(A),complement(composition(B,complement(join(complement(C),complement(composition(converse(B),A)))))))). [copy(38),rewrite([24(3),24(8),23(10),24(13),23(15),24(19),24(24),23(26)]),flip(a)].
% 3.99/4.27 42 composition(meet(A,composition(B,converse(C))),meet(C,composition(converse(A),B))) = join(meet(composition(A,C),B),composition(meet(A,composition(B,converse(C))),meet(C,composition(converse(A),B)))) # label(dedekind_law) # label(axiom). [clausify(14)].
% 3.99/4.27 43 join(complement(join(complement(A),complement(composition(B,C)))),composition(complement(join(complement(B),complement(composition(A,converse(C))))),complement(join(complement(C),complement(composition(converse(B),A)))))) = composition(complement(join(complement(B),complement(composition(A,converse(C))))),complement(join(complement(C),complement(composition(converse(B),A))))). [copy(42),rewrite([24(3),24(9),24(15),23(17),24(21),24(27)]),flip(a)].
% 3.99/4.27 44 meet(complement(composition(c1,top)),one) != meet(complement(c1),one) # label(goals) # label(negated_conjecture) # answer(goals). [clausify(17)].
% 3.99/4.27 45 complement(join(complement(one),complement(complement(composition(c1,top))))) != complement(join(complement(one),complement(complement(c1)))) # answer(goals). [copy(44),rewrite([24(6),23(8),24(13),23(15)])].
% 3.99/4.27 46 join(one,c1) = one. [back_rewrite(20),rewrite([23(3)])].
% 3.99/4.27 47 complement(top) = zero. [back_rewrite(22),rewrite([24(2),21(4)])].
% 3.99/4.27 48 converse(join(A,converse(B))) = join(B,converse(A)). [para(19(a,1),26(a,1,1)),rewrite([23(4)]),flip(a)].
% 3.99/4.27 49 converse(composition(A,converse(B))) = composition(B,converse(A)). [para(19(a,1),28(a,1,1)),flip(a)].
% 3.99/4.27 50 converse(composition(converse(A),B)) = composition(converse(B),A). [para(19(a,1),28(a,1,2)),flip(a)].
% 3.99/4.27 51 join(A,join(B,complement(A))) = join(B,top). [para(21(a,1),30(a,2,2)),rewrite([23(2)])].
% 3.99/4.27 52 composition(A,composition(one,B)) = composition(A,B). [para(18(a,1),31(a,1,1)),flip(a)].
% 3.99/4.27 58 join(complement(one),composition(converse(A),complement(A))) = complement(one). [para(18(a,1),35(a,1,2,2,1))].
% 3.99/4.27 63 join(zero,complement(join(complement(A),complement(A)))) = A. [para(21(a,1),37(a,1,1,1)),rewrite([47(2)])].
% 3.99/4.27 64 join(zero,complement(join(A,complement(complement(A))))) = complement(A). [para(21(a,1),37(a,1,2,1)),rewrite([47(6),23(6)])].
% 3.99/4.27 67 join(complement(A),complement(join(join(B,complement(A)),complement(join(complement(B),complement(A)))))) = join(complement(B),complement(A)). [para(37(a,1),37(a,1,2,1)),rewrite([23(10)])].
% 3.99/4.27 84 join(complement(join(complement(A),complement(B))),composition(complement(join(complement(B),complement(composition(A,converse(one))))),complement(join(complement(one),complement(composition(converse(B),A)))))) = composition(complement(join(complement(B),complement(composition(A,converse(one))))),complement(join(complement(one),complement(composition(converse(B),A))))). [para(18(a,1),43(a,1,1,1,2,1))].
% 3.99/4.27 103 converse(join(A,join(B,converse(C)))) = join(join(C,converse(A)),converse(B)). [para(48(a,1),26(a,1,1)),rewrite([23(7),30(7,R),23(6)]),flip(a)].
% 3.99/4.27 104 join(join(A,converse(B)),converse(C)) = join(A,converse(join(B,C))). [para(48(a,1),26(a,1,2)),rewrite([30(4,R),23(3),26(3),103(7)]),flip(a)].
% 3.99/4.27 112 join(join(A,B),converse(C)) = join(A,join(B,converse(C))). [para(48(a,1),48(a,2,2)),rewrite([104(4),48(4),30(6,R),23(5)])].
% 3.99/4.27 120 converse(join(A,composition(B,converse(C)))) = join(composition(C,converse(B)),converse(A)). [para(49(a,1),26(a,1,1)),rewrite([23(7)]),flip(a)].
% 3.99/4.27 128 composition(converse(one),A) = A. [para(18(a,1),50(a,1,1)),rewrite([19(2)]),flip(a)].
% 3.99/4.27 137 join(top,complement(join(A,complement(B)))) = join(top,complement(A)). [para(37(a,1),51(a,1,2)),rewrite([23(4),51(4),23(3),23(8)]),flip(a)].
% 3.99/4.27 138 join(top,complement(complement(A))) = top. [para(39(a,1),51(a,1,2)),rewrite([21(22),23(8),137(8)]),flip(a)].
% 3.99/4.27 139 converse(one) = one. [para(128(a,1),18(a,1)),flip(a)].
% 3.99/4.27 141 composition(join(A,one),B) = join(B,composition(A,B)). [para(128(a,1),33(a,1,1)),rewrite([139(4),23(4)]),flip(a)].
% 3.99/4.27 143 join(complement(A),complement(composition(one,A))) = complement(A). [para(128(a,1),35(a,1,2))].
% 3.99/4.27 157 composition(one,A) = A. [para(128(a,1),52(a,2)),rewrite([139(2),52(4)])].
% 3.99/4.27 158 join(complement(join(complement(A),complement(B))),composition(complement(join(complement(A),complement(B))),complement(join(complement(one),complement(composition(converse(B),A)))))) = composition(complement(join(complement(A),complement(B))),complement(join(complement(one),complement(composition(converse(B),A))))). [back_rewrite(84),rewrite([139(7),18(7),23(7),139(20),18(20),23(20)])].
% 3.99/4.27 163 join(complement(A),complement(A)) = complement(A). [back_rewrite(143),rewrite([157(3)])].
% 3.99/4.27 164 join(zero,complement(complement(A))) = A. [back_rewrite(63),rewrite([163(4)])].
% 3.99/4.27 165 converse(join(A,one)) = join(one,converse(A)). [para(139(a,1),26(a,1,1)),rewrite([23(5)]),flip(a)].
% 3.99/4.27 166 join(zero,complement(A)) = complement(A). [para(138(a,1),37(a,1,1,1)),rewrite([47(2),47(3),164(5)])].
% 3.99/4.27 169 complement(complement(A)) = A. [back_rewrite(164),rewrite([166(4)])].
% 3.99/4.27 179 complement(join(A,A)) = complement(A). [back_rewrite(64),rewrite([169(3),166(4)])].
% 3.99/4.27 186 complement(join(complement(one),composition(c1,top))) != complement(join(c1,complement(one))) # answer(goals). [back_rewrite(45),rewrite([169(7),169(12),23(11)])].
% 3.99/4.27 221 join(A,A) = A. [para(179(a,1),37(a,1,1,1,2)),rewrite([179(6),37(8)]),flip(a)].
% 3.99/4.27 228 join(A,join(A,B)) = join(A,B). [para(221(a,1),30(a,1)),rewrite([23(3),30(4,R),23(3),30(3,R),221(2)]),flip(a)].
% 3.99/4.27 246 join(A,complement(join(B,complement(A)))) = A. [para(37(a,1),228(a,1,2)),rewrite([23(4),37(12)])].
% 3.99/4.27 269 join(complement(one),composition(converse(complement(A)),A)) = complement(one). [para(169(a,1),58(a,1,2,2))].
% 3.99/4.27 289 composition(join(A,join(B,one)),C) = join(C,composition(join(A,B),C)). [para(141(a,1),33(a,1,2)),rewrite([30(4,R),33(3),23(1)]),flip(a)].
% 3.99/4.27 318 join(complement(one),converse(complement(one))) = complement(one). [para(18(a,1),269(a,1,2))].
% 3.99/4.27 322 converse(complement(one)) = complement(one). [para(318(a,1),26(a,2,1)),rewrite([19(7),23(6),318(6)]),flip(a)].
% 3.99/4.27 331 converse(top) = top. [para(322(a,1),165(a,2,2)),rewrite([23(4),21(4),21(6)])].
% 3.99/4.27 451 join(complement(A),complement(join(B,A))) = complement(A). [para(246(a,1),67(a,2)),rewrite([169(2),169(4),169(8),67(13)])].
% 3.99/4.27 771 join(complement(one),complement(c1)) = complement(c1). [para(46(a,1),451(a,1,2,1)),rewrite([23(5)])].
% 3.99/4.27 2365 join(one,join(c1,converse(A))) = join(one,converse(A)). [para(46(a,1),112(a,1,1)),flip(a)].
% 3.99/4.27 3737 join(A,join(one,converse(c1))) = join(A,one). [para(2365(a,1),26(a,2,1)),rewrite([139(2),48(5),30(5,R),23(4),48(9),139(7)])].
% 3.99/4.27 3745 join(one,converse(c1)) = one. [para(221(a,1),3737(a,2)),rewrite([228(6)])].
% 3.99/4.27 3746 join(A,composition(converse(c1),A)) = A. [para(3745(a,1),33(a,2,1)),rewrite([157(2),157(6)])].
% 3.99/4.27 3748 join(complement(one),complement(converse(c1))) = complement(converse(c1)). [para(3745(a,1),451(a,1,2,1)),rewrite([23(6)])].
% 3.99/4.27 3752 join(A,join(B,composition(converse(c1),A))) = join(A,B). [para(3746(a,1),30(a,2,2)),rewrite([23(4),23(6)])].
% 3.99/4.27 3757 join(A,composition(A,c1)) = A. [para(3746(a,1),120(a,1,1)),rewrite([19(2),19(3),19(4),23(3)]),flip(a)].
% 3.99/4.27 4241 composition(converse(c1),c1) = converse(c1). [para(3748(a,1),158(a,1,1,1)),rewrite([169(4),3748(8),169(6),19(9),18(9),771(9),169(7),3757(7),3748(8),169(6),19(9),18(9),771(9),169(7)]),flip(a)].
% 3.99/4.27 4274 converse(c1) = c1. [para(4241(a,1),28(a,2,1)),rewrite([19(5),4241(4),19(5)])].
% 3.99/4.27 4342 join(A,join(B,composition(c1,A))) = join(A,B). [back_rewrite(3752),rewrite([4274(2)])].
% 3.99/4.27 14276 join(A,composition(complement(one),A)) = composition(top,A). [para(58(a,1),289(a,2,2,1)),rewrite([23(7),30(8,R),23(7),58(7),21(4)]),flip(a)].
% 3.99/4.27 14336 join(A,composition(A,complement(one))) = composition(A,top). [para(14276(a,1),120(a,1,1)),rewrite([49(4),331(2),322(5),19(7),23(6)]),flip(a)].
% 3.99/4.27 14346 join(complement(one),composition(c1,top)) = join(c1,complement(one)). [para(14336(a,1),4342(a,1,2)),rewrite([23(10)])].
% 3.99/4.27 14354 $F # answer(goals). [back_rewrite(186),rewrite([14346(6)]),xx(a)].
% 3.99/4.27
% 3.99/4.27 % SZS output end Refutation
% 3.99/4.27 ============================== end of proof ==========================
% 3.99/4.27
% 3.99/4.27 ============================== STATISTICS ============================
% 3.99/4.27
% 3.99/4.27 Given=607. Generated=87664. Kept=14326. proofs=1.
% 3.99/4.27 Usable=399. Sos=8204. Demods=8311. Limbo=8, Disabled=5733. Hints=0.
% 3.99/4.27 Megabytes=24.76.
% 3.99/4.27 User_CPU=3.21, System_CPU=0.07, Wall_clock=3.
% 3.99/4.27
% 3.99/4.27 ============================== end of statistics =====================
% 3.99/4.27
% 3.99/4.27 ============================== end of search =========================
% 3.99/4.27
% 3.99/4.27 THEOREM PROVED
% 3.99/4.27 % SZS status Theorem
% 3.99/4.27
% 3.99/4.27 Exiting with 1 proof.
% 3.99/4.27
% 3.99/4.27 Process 26149 exit (max_proofs) Fri Jul 8 11:01:44 2022
% 3.99/4.27 Prover9 interrupted
%------------------------------------------------------------------------------