TSTP Solution File: REL044+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : REL044+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n009.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:28 EDT 2022
% Result : Theorem 3.31s 3.63s
% Output : Refutation 3.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL044+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 8 10:21:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.00 ============================== Prover9 ===============================
% 0.44/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.00 Process 28963 was started by sandbox on n009.cluster.edu,
% 0.44/1.00 Fri Jul 8 10:21:07 2022
% 0.44/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28806_n009.cluster.edu".
% 0.44/1.00 ============================== end of head ===========================
% 0.44/1.00
% 0.44/1.00 ============================== INPUT =================================
% 0.44/1.00
% 0.44/1.00 % Reading from file /tmp/Prover9_28806_n009.cluster.edu
% 0.44/1.00
% 0.44/1.00 set(prolog_style_variables).
% 0.44/1.00 set(auto2).
% 0.44/1.00 % set(auto2) -> set(auto).
% 0.44/1.00 % set(auto) -> set(auto_inference).
% 0.44/1.00 % set(auto) -> set(auto_setup).
% 0.44/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.00 % set(auto) -> set(auto_limits).
% 0.44/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.00 % set(auto) -> set(auto_denials).
% 0.44/1.00 % set(auto) -> set(auto_process).
% 0.44/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.00 % set(auto2) -> assign(stats, some).
% 0.44/1.00 % set(auto2) -> clear(echo_input).
% 0.44/1.00 % set(auto2) -> set(quiet).
% 0.44/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.00 % set(auto2) -> clear(print_given).
% 0.44/1.00 assign(lrs_ticks,-1).
% 0.44/1.00 assign(sos_limit,10000).
% 0.44/1.00 assign(order,kbo).
% 0.44/1.00 set(lex_order_vars).
% 0.44/1.00 clear(print_given).
% 0.44/1.00
% 0.44/1.00 % formulas(sos). % not echoed (17 formulas)
% 0.44/1.00
% 0.44/1.00 ============================== end of input ==========================
% 0.44/1.00
% 0.44/1.00 % From the command line: assign(max_seconds, 300).
% 0.44/1.00
% 0.44/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.00
% 0.44/1.00 % Formulas that are not ordinary clauses:
% 0.44/1.00 1 (all X0 all X1 join(X0,X1) = join(X1,X0)) # label(maddux1_join_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.44/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.44/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.44/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.44/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.44/1.00 6 (all X0 composition(X0,one) = X0) # label(composition_identity) # label(axiom) # label(non_clause). [assumption].
% 0.44/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.44/1.00 8 (all X0 converse(converse(X0)) = X0) # label(converse_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.44/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.44/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.44/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.44/1.00 12 (all X0 top = join(X0,complement(X0))) # label(def_top) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.00 13 (all X0 zero = meet(X0,complement(X0))) # label(def_zero) # label(axiom) # label(non_clause). [assumption].
% 3.31/3.63 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.31/3.63 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.31/3.63 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.31/3.63 17 -(all X0 all X1 all X2 (join(composition(complement(X0),X1),complement(X2)) = complement(X2) -> join(composition(X2,converse(X1)),X0) = X0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 3.31/3.63
% 3.31/3.63 ============================== end of process non-clausal formulas ===
% 3.31/3.63
% 3.31/3.63 ============================== PROCESS INITIAL CLAUSES ===============
% 3.31/3.63
% 3.31/3.63 ============================== PREDICATE ELIMINATION =================
% 3.31/3.63
% 3.31/3.63 ============================== end predicate elimination =============
% 3.31/3.63
% 3.31/3.63 Auto_denials:
% 3.31/3.63 % copying label goals to answer in negative clause
% 3.31/3.63
% 3.31/3.63 Term ordering decisions:
% 3.31/3.63 Function symbol KB weights: one=1. top=1. zero=1. c1=1. c2=1. c3=1. composition=1. join=1. meet=1. converse=1. complement=1.
% 3.31/3.63
% 3.31/3.63 ============================== end of process initial clauses ========
% 3.31/3.63
% 3.31/3.63 ============================== CLAUSES FOR SEARCH ====================
% 3.31/3.63
% 3.31/3.63 ============================== end of clauses for search =============
% 3.31/3.63
% 3.31/3.63 ============================== SEARCH ================================
% 3.31/3.63
% 3.31/3.63 % Starting search at 0.01 seconds.
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=125.000, iters=3518
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=105.000, iters=3508
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=80.000, iters=3471
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=78.000, iters=3430
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=76.000, iters=3407
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=75.000, iters=3353
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=74.000, iters=3336
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=73.000, iters=3348
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=70.000, iters=3385
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=67.000, iters=3342
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=66.000, iters=3366
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=64.000, iters=3394
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=61.000, iters=3345
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=60.000, iters=3496
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=58.000, iters=3370
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=57.000, iters=3410
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=56.000, iters=3356
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=55.000, iters=3466
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=54.000, iters=3408
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=53.000, iters=3365
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=52.000, iters=3383
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=51.000, iters=3345
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=48.000, iters=3365
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=47.000, iters=3371
% 3.31/3.63
% 3.31/3.63 Low Water (keep): wt=44.000, iters=3356
% 3.31/3.63
% 3.31/3.63 ============================== PROOF =================================
% 3.31/3.63 % SZS status Theorem
% 3.31/3.63 % SZS output start Refutation
% 3.31/3.63
% 3.31/3.63 % Proof 1 at 2.59 (+ 0.05) seconds: goals.
% 3.31/3.63 % Length of proof is 106.
% 3.31/3.63 % Level of proof is 32.
% 3.31/3.63 % Maximum clause weight is 49.000.
% 3.31/3.63 % Given clauses 498.
% 3.31/3.63
% 3.31/3.63 1 (all X0 all X1 join(X0,X1) = join(X1,X0)) # label(maddux1_join_commutativity) # label(axiom) # label(non_clause). [assumption].
% 3.31/3.63 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.31/3.63 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.31/3.63 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.31/3.63 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.31/3.63 6 (all X0 composition(X0,one) = X0) # label(composition_identity) # label(axiom) # label(non_clause). [assumption].
% 3.31/3.63 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.31/3.63 8 (all X0 converse(converse(X0)) = X0) # label(converse_idempotence) # label(axiom) # label(non_clause). [assumption].
% 3.31/3.63 9 (all X0 all X1 converse(join(X0,X1)) = join(converse(X0),converse(X1))) # label(converse_additivity) # label(axiom) # label(non_clause). [assumption].
% 3.31/3.63 10 (all X0 all X1 converse(composition(X0,X1)) = composition(converse(X1),converse(X0))) # label(converse_multiplicativity) # label(axiom) # label(non_clause). [assumption].
% 3.31/3.63 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.31/3.63 12 (all X0 top = join(X0,complement(X0))) # label(def_top) # label(axiom) # label(non_clause). [assumption].
% 3.31/3.63 13 (all X0 zero = meet(X0,complement(X0))) # label(def_zero) # label(axiom) # label(non_clause). [assumption].
% 3.31/3.63 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.31/3.63 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.31/3.63 17 -(all X0 all X1 all X2 (join(composition(complement(X0),X1),complement(X2)) = complement(X2) -> join(composition(X2,converse(X1)),X0) = X0)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 3.31/3.63 18 composition(A,one) = A # label(composition_identity) # label(axiom). [clausify(6)].
% 3.31/3.63 19 converse(converse(A)) = A # label(converse_idempotence) # label(axiom). [clausify(8)].
% 3.31/3.63 20 join(A,complement(A)) = top # label(def_top) # label(axiom). [clausify(12)].
% 3.31/3.63 21 meet(A,complement(A)) = zero # label(def_zero) # label(axiom). [clausify(13)].
% 3.31/3.63 22 join(A,B) = join(B,A) # label(maddux1_join_commutativity) # label(axiom). [clausify(1)].
% 3.31/3.63 23 meet(A,B) = complement(join(complement(A),complement(B))) # label(maddux4_definiton_of_meet) # label(axiom). [clausify(4)].
% 3.31/3.63 24 converse(join(A,B)) = join(converse(A),converse(B)) # label(converse_additivity) # label(axiom). [clausify(9)].
% 3.31/3.63 25 join(converse(A),converse(B)) = converse(join(A,B)). [copy(24),flip(a)].
% 3.31/3.63 26 converse(composition(A,B)) = composition(converse(B),converse(A)) # label(converse_multiplicativity) # label(axiom). [clausify(10)].
% 3.31/3.63 27 composition(converse(A),converse(B)) = converse(composition(B,A)). [copy(26),flip(a)].
% 3.31/3.63 28 complement(c3) = join(composition(complement(c1),c2),complement(c3)) # label(goals) # label(negated_conjecture). [clausify(17)].
% 3.31/3.63 29 join(complement(c3),composition(complement(c1),c2)) = complement(c3). [copy(28),rewrite([22(9)]),flip(a)].
% 3.31/3.63 30 join(join(A,B),C) = join(A,join(B,C)) # label(maddux2_join_associativity) # label(axiom). [clausify(2)].
% 3.31/3.63 31 join(A,join(B,C)) = join(C,join(A,B)). [copy(30),rewrite([22(2)]),flip(a)].
% 3.31/3.63 32 composition(composition(A,B),C) = composition(A,composition(B,C)) # label(composition_associativity) # label(axiom). [clausify(5)].
% 3.31/3.63 33 composition(join(A,B),C) = join(composition(A,C),composition(B,C)) # label(composition_distributivity) # label(axiom). [clausify(7)].
% 3.31/3.63 34 join(composition(A,B),composition(C,B)) = composition(join(A,C),B). [copy(33),flip(a)].
% 3.31/3.63 35 complement(A) = join(composition(converse(B),complement(composition(B,A))),complement(A)) # label(converse_cancellativity) # label(axiom). [clausify(11)].
% 3.31/3.63 36 join(complement(A),composition(converse(B),complement(composition(B,A)))) = complement(A). [copy(35),rewrite([22(7)]),flip(a)].
% 3.31/3.63 37 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.31/3.63 38 join(complement(join(A,complement(B))),complement(join(complement(A),complement(B)))) = B. [copy(37),rewrite([22(6),22(8)]),rewrite([22(6)])].
% 3.31/3.63 39 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.31/3.63 40 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(39),rewrite([23(3),23(8),22(10),23(13),22(15),23(19),23(24),22(26)]),flip(a)].
% 3.31/3.63 43 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.31/3.63 44 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(43),rewrite([23(3),23(9),23(15),22(17),23(21),23(27)]),flip(a)].
% 3.31/3.63 45 join(composition(c3,converse(c2)),c1) != c1 # label(goals) # label(negated_conjecture) # answer(goals). [clausify(17)].
% 3.31/3.63 46 join(c1,composition(c3,converse(c2))) != c1 # answer(goals). [copy(45),rewrite([22(6)])].
% 3.31/3.63 47 complement(top) = zero. [back_rewrite(21),rewrite([23(2),20(4)])].
% 3.31/3.63 49 converse(composition(A,converse(B))) = composition(B,converse(A)). [para(19(a,1),27(a,1,1)),flip(a)].
% 3.31/3.63 50 converse(composition(converse(A),B)) = composition(converse(B),A). [para(19(a,1),27(a,1,2)),flip(a)].
% 3.31/3.63 51 join(A,join(B,complement(A))) = join(B,top). [para(20(a,1),31(a,2,2)),rewrite([22(2)])].
% 3.31/3.63 52 composition(A,composition(one,B)) = composition(A,B). [para(18(a,1),32(a,1,1)),flip(a)].
% 3.31/3.63 57 join(composition(A,composition(B,C)),composition(D,C)) = composition(join(D,composition(A,B)),C). [para(32(a,1),34(a,1,1)),rewrite([22(6)])].
% 3.31/3.63 59 join(complement(one),composition(converse(A),complement(A))) = complement(one). [para(18(a,1),36(a,1,2,2,1))].
% 3.31/3.63 64 join(zero,complement(join(complement(A),complement(A)))) = A. [para(20(a,1),38(a,1,1,1)),rewrite([47(2)])].
% 3.31/3.63 65 join(zero,complement(join(A,complement(complement(A))))) = complement(A). [para(20(a,1),38(a,1,2,1)),rewrite([47(6),22(6)])].
% 3.31/3.63 87 join(complement(join(complement(A),complement(composition(B,converse(C))))),composition(complement(join(complement(B),complement(composition(A,C)))),complement(join(complement(converse(C)),complement(composition(converse(B),A)))))) = composition(complement(join(complement(B),complement(composition(A,C)))),complement(join(complement(converse(C)),complement(composition(converse(B),A))))). [para(19(a,1),44(a,1,2,1,1,2,1,2)),rewrite([19(23)])].
% 3.31/3.63 94 join(zero,composition(converse(A),complement(composition(A,top)))) = zero. [para(47(a,1),36(a,1,1)),rewrite([47(9)])].
% 3.31/3.63 129 composition(converse(one),A) = A. [para(18(a,1),50(a,1,1)),rewrite([19(2)]),flip(a)].
% 3.31/3.63 138 join(top,complement(join(A,complement(B)))) = join(top,complement(A)). [para(38(a,1),51(a,1,2)),rewrite([22(4),51(4),22(3),22(8)]),flip(a)].
% 3.31/3.63 139 join(top,complement(complement(A))) = top. [para(40(a,1),51(a,1,2)),rewrite([20(22),22(8),138(8)]),flip(a)].
% 3.31/3.63 140 converse(one) = one. [para(129(a,1),18(a,1)),flip(a)].
% 3.31/3.63 142 composition(join(A,one),B) = join(B,composition(A,B)). [para(129(a,1),34(a,1,1)),rewrite([140(4),22(4)]),flip(a)].
% 3.31/3.63 144 join(complement(A),complement(composition(one,A))) = complement(A). [para(129(a,1),36(a,1,2))].
% 3.31/3.63 158 composition(one,A) = A. [para(129(a,1),52(a,2)),rewrite([140(2),52(4)])].
% 3.31/3.63 164 join(complement(A),complement(A)) = complement(A). [back_rewrite(144),rewrite([158(3)])].
% 3.31/3.63 165 join(zero,complement(complement(A))) = A. [back_rewrite(64),rewrite([164(4)])].
% 3.31/3.63 166 converse(join(A,one)) = join(one,converse(A)). [para(140(a,1),25(a,1,1)),rewrite([22(5)]),flip(a)].
% 3.31/3.63 167 join(zero,complement(A)) = complement(A). [para(139(a,1),38(a,1,1,1)),rewrite([47(2),47(3),165(5)])].
% 3.31/3.63 169 join(top,complement(A)) = join(top,top). [para(139(a,1),51(a,1,2)),rewrite([22(3)])].
% 3.31/3.63 170 complement(complement(A)) = A. [back_rewrite(165),rewrite([167(4)])].
% 3.31/3.63 180 complement(join(A,A)) = complement(A). [back_rewrite(65),rewrite([170(3),167(4)])].
% 3.31/3.63 182 join(A,top) = top. [back_rewrite(139),rewrite([170(3),22(2)])].
% 3.31/3.63 188 join(top,complement(A)) = top. [back_rewrite(169),rewrite([182(6)])].
% 3.31/3.63 198 join(complement(join(A,B)),complement(join(B,complement(A)))) = complement(B). [para(170(a,1),38(a,1,1,1,2)),rewrite([170(5),22(4)])].
% 3.31/3.63 206 complement(zero) = top. [para(47(a,1),170(a,1,1))].
% 3.31/3.63 221 join(A,A) = A. [para(180(a,1),38(a,1,1,1,2)),rewrite([180(6),38(8)]),flip(a)].
% 3.31/3.63 228 join(A,join(A,B)) = join(A,B). [para(221(a,1),31(a,1)),rewrite([22(3),31(4,R),22(3),31(3,R),221(2)]),flip(a)].
% 3.31/3.63 246 join(A,complement(join(B,complement(A)))) = A. [para(38(a,1),228(a,1,2)),rewrite([22(4),38(12)])].
% 3.31/3.63 248 join(A,join(B,complement(join(C,complement(A))))) = join(A,B). [para(246(a,1),31(a,2,2)),rewrite([22(4),22(6)])].
% 3.31/3.63 269 join(complement(one),composition(converse(complement(A)),A)) = complement(one). [para(170(a,1),59(a,1,2,2))].
% 3.31/3.63 282 join(zero,composition(join(one,converse(A)),complement(composition(join(A,one),top)))) = zero. [para(166(a,1),94(a,1,2,1))].
% 3.31/3.63 318 join(complement(one),converse(complement(one))) = complement(one). [para(18(a,1),269(a,1,2))].
% 3.31/3.63 322 converse(complement(one)) = complement(one). [para(318(a,1),25(a,2,1)),rewrite([19(7),22(6),318(6)]),flip(a)].
% 3.31/3.63 331 converse(top) = top. [para(322(a,1),166(a,2,2)),rewrite([22(4),20(4),20(6)])].
% 3.31/3.63 342 join(top,converse(A)) = top. [para(331(a,1),25(a,1,1)),rewrite([22(5),182(5),331(5)])].
% 3.31/3.63 349 join(top,composition(A,converse(B))) = top. [para(49(a,1),342(a,1,2))].
% 3.31/3.63 351 join(top,composition(A,B)) = top. [para(19(a,1),349(a,1,2,2))].
% 3.31/3.63 352 composition(join(A,one),top) = top. [para(331(a,1),349(a,1,2,2)),rewrite([142(4,R)])].
% 3.31/3.63 353 composition(join(one,converse(A)),zero) = zero. [back_rewrite(282),rewrite([352(8),47(6),142(7,R),22(5),228(5)])].
% 3.31/3.63 380 composition(top,zero) = zero. [para(322(a,1),353(a,1,1,2)),rewrite([20(4)])].
% 3.31/3.63 385 join(zero,composition(A,composition(converse(zero),zero))) = composition(A,composition(converse(zero),zero)). [para(380(a,1),44(a,1,1,1,2,1)),rewrite([206(3),22(3),188(3),47(2),47(3),167(7),170(6),206(6),331(7),188(9),47(6),32(6),47(9),167(13),170(12),206(12),331(13),188(15),47(12),32(12)])].
% 3.31/3.63 389 join(zero,composition(A,composition(B,zero))) = zero. [para(380(a,1),57(a,1,2)),rewrite([22(5),351(8),380(8)])].
% 3.31/3.63 392 composition(A,composition(converse(zero),zero)) = zero. [back_rewrite(385),rewrite([389(7)]),flip(a)].
% 3.31/3.63 471 composition(A,composition(converse(zero),composition(zero,B))) = composition(zero,B). [para(392(a,1),32(a,1,1)),rewrite([32(7)]),flip(a)].
% 3.31/3.63 472 composition(A,zero) = zero. [para(392(a,1),32(a,1)),rewrite([392(6)]),flip(a)].
% 3.31/3.63 473 composition(converse(zero),A) = converse(zero). [para(392(a,1),50(a,1,1)),rewrite([472(6)]),flip(a)].
% 3.31/3.63 478 composition(zero,A) = composition(B,converse(zero)). [back_rewrite(471),rewrite([473(5)]),flip(a)].
% 3.31/3.63 480 composition(zero,A) = c_0. [new_symbol(478)].
% 3.31/3.63 496 c_0 = zero. [para(480(a,1),18(a,1))].
% 3.31/3.63 500 composition(zero,A) = zero. [back_rewrite(480),rewrite([496(3)])].
% 3.31/3.63 10391 join(A,complement(join(A,B))) = join(A,complement(B)). [para(198(a,1),248(a,1,2)),flip(a)].
% 3.31/3.63 10550 join(complement(c3),complement(composition(complement(c1),c2))) = top. [para(29(a,1),10391(a,1,2,1)),rewrite([170(5),22(4),20(4)]),flip(a)].
% 3.31/3.63 10892 complement(join(c1,complement(composition(c3,converse(c2))))) = zero. [para(10550(a,1),87(a,1,2,1,1)),rewrite([170(3),47(10),500(21),22(10),167(10),10550(16),47(10),500(21)])].
% 3.31/3.63 10909 complement(join(c1,composition(c3,converse(c2)))) = complement(c1). [para(10892(a,1),198(a,1,2)),rewrite([22(6),22(9),167(9)])].
% 3.31/3.63 10910 join(c1,composition(c3,converse(c2))) = join(zero,c1). [para(10892(a,1),10391(a,1,2)),rewrite([22(3),170(10)]),flip(a)].
% 3.31/3.63 10911 complement(join(zero,c1)) = complement(c1). [back_rewrite(10909),rewrite([10910(6)])].
% 3.31/3.63 10912 join(zero,c1) != c1 # answer(goals). [back_rewrite(46),rewrite([10910(6)])].
% 3.31/3.63 10914 join(zero,c1) = c1. [para(10911(a,1),38(a,1,1,1,2)),rewrite([10911(9),38(10)]),flip(a)].
% 3.31/3.63 10915 $F # answer(goals). [resolve(10914,a,10912,a)].
% 3.31/3.63
% 3.31/3.63 % SZS output end Refutation
% 3.31/3.63 ============================== end of proof ==========================
% 3.31/3.63
% 3.31/3.63 ============================== STATISTICS ============================
% 3.31/3.63
% 3.31/3.63 Given=498. Generated=72752. Kept=10886. proofs=1.
% 3.31/3.63 Usable=411. Sos=8665. Demods=8932. Limbo=1, Disabled=1826. Hints=0.
% 3.31/3.63 Megabytes=22.58.
% 3.31/3.63 User_CPU=2.59, System_CPU=0.05, Wall_clock=3.
% 3.31/3.63
% 3.31/3.63 ============================== end of statistics =====================
% 3.31/3.63
% 3.31/3.63 ============================== end of search =========================
% 3.31/3.63
% 3.31/3.63 THEOREM PROVED
% 3.31/3.63 % SZS status Theorem
% 3.31/3.63
% 3.31/3.63 Exiting with 1 proof.
% 3.31/3.63
% 3.31/3.63 Process 28963 exit (max_proofs) Fri Jul 8 10:21:10 2022
% 3.31/3.63 Prover9 interrupted
%------------------------------------------------------------------------------