TSTP Solution File: LCL558+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL558+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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 : Sun Jul 17 13:47:33 EDT 2022
% Result : Timeout 291.73s 292.06s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL558+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n024.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 : Sun Jul 3 08:55:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.01 ============================== Prover9 ===============================
% 0.43/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.01 Process 13371 was started by sandbox on n024.cluster.edu,
% 0.43/1.01 Sun Jul 3 08:55:00 2022
% 0.43/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13218_n024.cluster.edu".
% 0.43/1.01 ============================== end of head ===========================
% 0.43/1.01
% 0.43/1.01 ============================== INPUT =================================
% 0.43/1.01
% 0.43/1.01 % Reading from file /tmp/Prover9_13218_n024.cluster.edu
% 0.43/1.01
% 0.43/1.01 set(prolog_style_variables).
% 0.43/1.01 set(auto2).
% 0.43/1.01 % set(auto2) -> set(auto).
% 0.43/1.01 % set(auto) -> set(auto_inference).
% 0.43/1.01 % set(auto) -> set(auto_setup).
% 0.43/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.01 % set(auto) -> set(auto_limits).
% 0.43/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.01 % set(auto) -> set(auto_denials).
% 0.43/1.01 % set(auto) -> set(auto_process).
% 0.43/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.01 % set(auto2) -> assign(stats, some).
% 0.43/1.01 % set(auto2) -> clear(echo_input).
% 0.43/1.01 % set(auto2) -> set(quiet).
% 0.43/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.01 % set(auto2) -> clear(print_given).
% 0.43/1.01 assign(lrs_ticks,-1).
% 0.43/1.01 assign(sos_limit,10000).
% 0.43/1.01 assign(order,kbo).
% 0.43/1.01 set(lex_order_vars).
% 0.43/1.01 clear(print_given).
% 0.43/1.01
% 0.43/1.01 % formulas(sos). % not echoed (77 formulas)
% 0.43/1.01
% 0.43/1.01 ============================== end of input ==========================
% 0.43/1.01
% 0.43/1.01 % From the command line: assign(max_seconds, 300).
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.01
% 0.43/1.01 % Formulas that are not ordinary clauses:
% 0.43/1.01 1 modus_ponens <-> (all X all Y (is_a_theorem(X) & is_a_theorem(implies(X,Y)) -> is_a_theorem(Y))) # label(modus_ponens) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 2 substitution_of_equivalents <-> (all X all Y (is_a_theorem(equiv(X,Y)) -> X = Y)) # label(substitution_of_equivalents) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 3 modus_tollens <-> (all X all Y is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y)))) # label(modus_tollens) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 4 implies_1 <-> (all X all Y is_a_theorem(implies(X,implies(Y,X)))) # label(implies_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 5 implies_2 <-> (all X all Y is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))) # label(implies_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 6 implies_3 <-> (all X all Y all Z is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))) # label(implies_3) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 7 and_1 <-> (all X all Y is_a_theorem(implies(and(X,Y),X))) # label(and_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 8 and_2 <-> (all X all Y is_a_theorem(implies(and(X,Y),Y))) # label(and_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 9 and_3 <-> (all X all Y is_a_theorem(implies(X,implies(Y,and(X,Y))))) # label(and_3) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 10 or_1 <-> (all X all Y is_a_theorem(implies(X,or(X,Y)))) # label(or_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 11 or_2 <-> (all X all Y is_a_theorem(implies(Y,or(X,Y)))) # label(or_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 12 or_3 <-> (all X all Y all Z is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))) # label(or_3) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 13 equivalence_1 <-> (all X all Y is_a_theorem(implies(equiv(X,Y),implies(X,Y)))) # label(equivalence_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 14 equivalence_2 <-> (all X all Y is_a_theorem(implies(equiv(X,Y),implies(Y,X)))) # label(equivalence_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 15 equivalence_3 <-> (all X all Y is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y))))) # label(equivalence_3) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 16 kn1 <-> (all P is_a_theorem(implies(P,and(P,P)))) # label(kn1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 17 kn2 <-> (all P all Q is_a_theorem(implies(and(P,Q),P))) # label(kn2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 18 kn3 <-> (all P all Q all R is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P)))))) # label(kn3) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 19 cn1 <-> (all P all Q all R is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))) # label(cn1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 20 cn2 <-> (all P all Q is_a_theorem(implies(P,implies(not(P),Q)))) # label(cn2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 21 cn3 <-> (all P is_a_theorem(implies(implies(not(P),P),P))) # label(cn3) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 22 r1 <-> (all P is_a_theorem(implies(or(P,P),P))) # label(r1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 23 r2 <-> (all P all Q is_a_theorem(implies(Q,or(P,Q)))) # label(r2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 24 r3 <-> (all P all Q is_a_theorem(implies(or(P,Q),or(Q,P)))) # label(r3) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 25 r4 <-> (all P all Q all R is_a_theorem(implies(or(P,or(Q,R)),or(Q,or(P,R))))) # label(r4) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 26 r5 <-> (all P all Q all R is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))) # label(r5) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 27 op_or -> (all X all Y or(X,Y) = not(and(not(X),not(Y)))) # label(op_or) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 28 op_and -> (all X all Y and(X,Y) = not(or(not(X),not(Y)))) # label(op_and) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 29 op_implies_and -> (all X all Y implies(X,Y) = not(and(X,not(Y)))) # label(op_implies_and) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 30 op_implies_or -> (all X all Y implies(X,Y) = or(not(X),Y)) # label(op_implies_or) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 31 op_equiv -> (all X all Y equiv(X,Y) = and(implies(X,Y),implies(Y,X))) # label(op_equiv) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 32 necessitation <-> (all X (is_a_theorem(X) -> is_a_theorem(necessarily(X)))) # label(necessitation) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 33 modus_ponens_strict_implies <-> (all X all Y (is_a_theorem(X) & is_a_theorem(strict_implies(X,Y)) -> is_a_theorem(Y))) # label(modus_ponens_strict_implies) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 34 adjunction <-> (all X all Y (is_a_theorem(X) & is_a_theorem(Y) -> is_a_theorem(and(X,Y)))) # label(adjunction) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 35 substitution_strict_equiv <-> (all X all Y (is_a_theorem(strict_equiv(X,Y)) -> X = Y)) # label(substitution_strict_equiv) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 36 axiom_K <-> (all X all Y is_a_theorem(implies(necessarily(implies(X,Y)),implies(necessarily(X),necessarily(Y))))) # label(axiom_K) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 37 axiom_M <-> (all X is_a_theorem(implies(necessarily(X),X))) # label(axiom_M) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 38 axiom_4 <-> (all X is_a_theorem(implies(necessarily(X),necessarily(necessarily(X))))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 39 axiom_B <-> (all X is_a_theorem(implies(X,necessarily(possibly(X))))) # label(axiom_B) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 40 axiom_5 <-> (all X is_a_theorem(implies(possibly(X),necessarily(possibly(X))))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 41 axiom_s1 <-> (all X all Y all Z is_a_theorem(implies(and(necessarily(implies(X,Y)),necessarily(implies(Y,Z))),necessarily(implies(X,Z))))) # label(axiom_s1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 42 axiom_s2 <-> (all P all Q is_a_theorem(strict_implies(possibly(and(P,Q)),and(possibly(P),possibly(Q))))) # label(axiom_s2) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 43 axiom_s3 <-> (all X all Y is_a_theorem(strict_implies(strict_implies(X,Y),strict_implies(not(possibly(Y)),not(possibly(X)))))) # label(axiom_s3) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 44 axiom_s4 <-> (all X is_a_theorem(strict_implies(necessarily(X),necessarily(necessarily(X))))) # label(axiom_s4) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 45 axiom_m1 <-> (all X all Y is_a_theorem(strict_implies(and(X,Y),and(Y,X)))) # label(axiom_m1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 46 axiom_m2 <-> (all X all Y is_a_theorem(strict_implies(and(X,Y),X))) # label(axiom_m2) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 47 axiom_m3 <-> (all X all Y all Z is_a_theorem(strict_implies(and(and(X,Y),Z),and(X,and(Y,Z))))) # label(axiom_m3) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 48 axiom_m4 <-> (all X is_a_theorem(strict_implies(X,and(X,X)))) # label(axiom_m4) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 49 axiom_m5 <-> (all X all Y all Z is_a_theorem(strict_implies(and(strict_implies(X,Y),strict_implies(Y,Z)),strict_implies(X,Z)))) # label(axiom_m5) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 50 axiom_m6 <-> (all X is_a_theorem(strict_implies(X,possibly(X)))) # label(axiom_m6) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 51 axiom_m7 <-> (all P all Q is_a_theorem(strict_implies(possibly(and(P,Q)),P))) # label(axiom_m7) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 52 axiom_m8 <-> (all P all Q is_a_theorem(strict_implies(strict_implies(P,Q),strict_implies(possibly(P),possibly(Q))))) # label(axiom_m8) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 53 axiom_m9 <-> (all X is_a_theorem(strict_implies(possibly(possibly(X)),possibly(X)))) # label(axiom_m9) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 54 axiom_m10 <-> (all X is_a_theorem(strict_implies(possibly(X),necessarily(possibly(X))))) # label(axiom_m10) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 55 op_possibly -> (all X possibly(X) = not(necessarily(not(X)))) # label(op_possibly) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 56 op_necessarily -> (all X necessarily(X) = not(possibly(not(X)))) # label(op_necessarily) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 57 op_strict_implies -> (all X all Y strict_implies(X,Y) = necessarily(implies(X,Y))) # label(op_strict_implies) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 58 op_strict_equiv -> (all X all Y strict_equiv(X,Y) = and(strict_implies(X,Y),strict_implies(Y,X))) # label(op_strict_equiv) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04
% 0.75/1.04 ============================== end of process non-clausal formulas ===
% 0.75/1.04
% 0.75/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.04
% 0.75/1.04 ============================== PREDICATE ELIMINATION =================
% 0.75/1.04
% 0.75/1.04 ============================== end predicate elimination =============
% 0.75/1.04
% 0.75/1.04 Auto_denials: (non-Horn, no changes).
% 0.75/1.04
% 0.75/1.04 Term ordering decisions:
% 0.75/1.04 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. c13=1. c14=1. c15=1. c16=1. c17=1. c18=1. c19=1. c20=1. c21=1. c22=1. c23=1. c24=1. c25=1. c26=1. c27=1. c28=1. c29=1. c30=1. c31=1. c32=1. c33=1. c34=1. c35=1. c36=1. c37=1. c38=1. c39=1. c40=1. c41=1. c42=1. c43=1. c44=1. c45=1. c46=1. c47=1. c48=1. c49=1. c50=1. c51=1. c52=1. c53=1. c54=1. c55=1. c56=1. c57=1. c58=1. c59=1. c60=1. c61=1. c62=1. c63=1. c64=1. c65=1. c66=1. c67=1. c68=1. c69=1. c70=1. c71=1. c72=1. c73=1. c74=1. c75=1. c76=1. c77=1. c78=1. c79=1. c80=1. c81=1. c82=1. c83=1. c84=1. c85=1. c86=1. c87=1. c88=1. c89=1. c90=1. c91=1. c92=1. c93=1. c94=1. implies=1. and=1. strict_implies=1. or=1. equiv=1. strict_equiv=1. necessarily=1. possibly=1. not=1.
% 0.75/1.04
% 0.75/1.04 ============================== end of process initial clauses ========
% 0.75/1.04
% 0.75/1.04 ============================== CLAUSES FOR SEARCH ====================
% 291.73/292.06
% 291.73/292.06 ============================== end of clauses for search =============
% 291.73/292.06
% 291.73/292.06 ============================== SEARCH ================================
% 291.73/292.06
% 291.73/292.06 % Starting search at 0.05 seconds.
% 291.73/292.06
% 291.73/292.06 Low Water (keep): wt=23.000, iters=3355
% 291.73/292.06
% 291.73/292.06 Low Water (keep): wt=22.000, iters=3425
% 291.73/292.06
% 291.73/292.06 Low Water (keep): wt=21.000, iters=3381
% 291.73/292.06
% 291.73/292.06 Low Water (keep): wt=20.000, iters=3433
% 291.73/292.06
% 291.73/292.06 Low Water (keep): wt=19.000, iters=3351
% 291.73/292.06
% 291.73/292.06 Low Water (keep): wt=18.000, iters=3355
% 291.73/292.06
% 291.73/292.06 Low Water (keep): wt=17.000, iters=3370
% 291.73/292.06
% 291.73/292.06 Low Water (keep): wt=16.000, iters=3342
% 291.73/292.06
% 291.73/292.06 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 408 (0.00 of 2.03 sec).
% 291.73/292.06 % back CAC tautology: 10351 equiv(possibly(necessarily(not(A))),not(B)) = equiv(not(B),possibly(necessarily(not(A)))). [back_rewrite(4407),rewrite([10190(9),4406(9)]),flip(a)].
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=15330, wt=41.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=15322, wt=40.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=15329, wt=38.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=15327, wt=37.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=15363, wt=36.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=15326, wt=34.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=15386, wt=33.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=15171, wt=32.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=14510, wt=31.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=15032, wt=30.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=15389, wt=29.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=15435, wt=28.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=21024, wt=16.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=21087, wt=15.000
% 291.73/292.06 % back CAC tautology: 24459 or(or(A,B),not(C)) = or(not(C),or(A,B)). [para(24396(a,2),20506(a,1)),rewrite([20506(6)]),flip(a)].
% 291.73/292.06 % back CAC tautology: 24449 or(and(A,possibly(B)),not(C)) = or(not(C),and(A,possibly(B))). [para(24396(a,2),2201(a,2)),rewrite([2201(5)])].
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=25704, wt=14.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=26073, wt=13.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=26097, wt=12.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=26222, wt=11.000
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=26234, wt=10.000
% 291.73/292.06
% 291.73/292.06 Low Water (keep): wt=15.000, iters=3333
% 291.73/292.06
% 291.73/292.06 Low Water (displace): id=41942, wt=9.000
% 291.73/292.06
% 291.73/292.06 Low Water (keep): wt=14.000, iters=3338
% 291.73/292.06
% 291.73/292.06 Low Water (keep): wt=13.000, iters=3336
% 291.73/292.06
% 291.73/292.06 Low Water (keep): wt=12.000, iters=3519
% 291.73/292.06
% 291.73/292.06 ============================== PROOF =================================
% 291.73/292.06 % SZS status Theorem
% 291.73/292.06 % SZS output start Refutation
% 291.73/292.06
% 291.73/292.06 % Proof 1 at 282.45 (+ 8.57) seconds.
% 291.73/292.06 % Length of proof is 259.
% 291.73/292.06 % Level of proof is 57.
% 291.73/292.06 % Maximum clause weight is 20.000.
% 291.73/292.06 % Given clauses 33683.
% 291.73/292.06
% 291.73/292.06 2 substitution_of_equivalents <-> (all X all Y (is_a_theorem(equiv(X,Y)) -> X = Y)) # label(substitution_of_equivalents) # label(axiom) # label(non_clause). [assumption].
% 291.73/292.06 10 or_1 <-> (all X all Y is_a_theorem(implies(X,or(X,Y)))) # label(or_1) # label(axiom) # label(non_clause). [assumption].
% 291.73/292.06 27 op_or -> (all X all Y or(X,Y) = not(and(not(X),not(Y)))) # label(op_or) # label(axiom) # label(non_clause). [assumption].
% 291.73/292.06 29 op_implies_and -> (all X all Y implies(X,Y) = not(and(X,not(Y)))) # label(op_implies_and) # label(axiom) # label(non_clause). [assumption].
% 291.73/292.06 31 op_equiv -> (all X all Y equiv(X,Y) = and(implies(X,Y),implies(Y,X))) # label(op_equiv) # label(axiom) # label(non_clause). [assumption].
% 291.73/292.06 33 modus_ponens_strict_implies <-> (all X all Y (is_a_theorem(X) & is_a_theorem(strict_implies(X,Y)) -> is_a_theorem(Y))) # label(modus_ponens_strict_implies) # label(axiom) # label(non_clause). [assumption].
% 291.73/292.06 34 adjunction <-> (all X all Y (is_a_theorem(X) & is_a_theorem(Y) -> is_a_theorem(and(X,Y)))) # label(adjunction) # label(axiom) # label(non_clause). [assumption].
% 291.73/292.06 35 substitution_strict_equiv <-> (all X all Y (is_a_theorem(strict_equiv(X,Y)) -> X = Y)) # label(substitution_strict_equiv) # label(axiom) # label(non_clause). [assumption].
% 291.73/292.06 45 axiom_m1 <-> (all X all Y is_a_theorem(strict_implies(and(X,Y),and(Y,X)))) # label(axiom_m1) # label(axiom) # label(non_clause). [assumption].
% 291.73/292.06 46 axiom_m2 <-> (all X all Y is_a_theorem(strict_implies(and(X,Y),X))) # label(axiom_m2) # label(axiom) # label(non_clause). [assumption].
% 291.73/292.06 47 axiom_m3 <-> (all X all Y all Z is_a_theorem(strict_implies(and(and(X,Y),Z),and(X,and(Y,Z))))) # label(axiom_m3) # label(axiom) # label(non_clause). [assumption].
% 291.73/292.06 48 axiom_m4 <-> (all X is_a_theorem(strict_implies(X,and(X,X)))) # label(axiom_m4) # label(axiom) # label(non_clause). [assumption].
% 291.73/292.06 49 axiom_m5 <-> (all X all Y all Z is_a_theorem(strict_implies(and(strict_implies(X,Y),strict_implies(Y,Z)),strict_implies(X,Z)))) # label(axiom_m5) # label(axiom) # label(non_clause). [assumption].
% 291.73/292.06 57 op_strict_implies -> (all X all Y strict_implies(X,Y) = necessarily(implies(X,Y))) # label(op_strict_implies) # label(axiom) # label(non_clause). [assumption].
% 291.73/292.06 58 op_strict_equiv -> (all X all Y strict_equiv(X,Y) = and(strict_implies(X,Y),strict_implies(Y,X))) # label(op_strict_equiv) # label(axiom) # label(non_clause). [assumption].
% 291.73/292.06 63 -substitution_of_equivalents | -is_a_theorem(equiv(A,B)) | B = A # label(substitution_of_equivalents) # label(axiom). [clausify(2)].
% 291.73/292.06 81 or_1 | -is_a_theorem(implies(c20,or(c20,c21))) # label(or_1) # label(axiom). [clausify(10)].
% 291.73/292.06 114 -op_or | or(A,B) = not(and(not(A),not(B))) # label(op_or) # label(axiom). [clausify(27)].
% 291.73/292.06 115 -op_or | not(and(not(A),not(B))) = or(A,B). [copy(114),flip(b)].
% 291.73/292.06 118 -op_implies_and | not(and(A,not(B))) = implies(A,B) # label(op_implies_and) # label(axiom). [clausify(29)].
% 291.73/292.06 120 -op_equiv | and(implies(A,B),implies(B,A)) = equiv(A,B) # label(op_equiv) # label(axiom). [clausify(31)].
% 291.73/292.06 124 -modus_ponens_strict_implies | -is_a_theorem(A) | -is_a_theorem(strict_implies(A,B)) | is_a_theorem(B) # label(modus_ponens_strict_implies) # label(axiom). [clausify(33)].
% 291.73/292.06 128 -adjunction | -is_a_theorem(A) | -is_a_theorem(B) | is_a_theorem(and(A,B)) # label(adjunction) # label(axiom). [clausify(34)].
% 291.73/292.06 132 -substitution_strict_equiv | -is_a_theorem(strict_equiv(A,B)) | B = A # label(substitution_strict_equiv) # label(axiom). [clausify(35)].
% 291.73/292.06 153 -axiom_m1 | is_a_theorem(strict_implies(and(A,B),and(B,A))) # label(axiom_m1) # label(axiom). [clausify(45)].
% 291.73/292.06 155 -axiom_m2 | is_a_theorem(strict_implies(and(A,B),A)) # label(axiom_m2) # label(axiom). [clausify(46)].
% 291.73/292.06 157 -axiom_m3 | is_a_theorem(strict_implies(and(and(A,B),C),and(A,and(B,C)))) # label(axiom_m3) # label(axiom). [clausify(47)].
% 291.73/292.06 159 -axiom_m4 | is_a_theorem(strict_implies(A,and(A,A))) # label(axiom_m4) # label(axiom). [clausify(48)].
% 291.73/292.06 161 -axiom_m5 | is_a_theorem(strict_implies(and(strict_implies(A,B),strict_implies(B,C)),strict_implies(A,C))) # label(axiom_m5) # label(axiom). [clausify(49)].
% 291.73/292.06 177 -op_strict_implies | strict_implies(A,B) = necessarily(implies(A,B)) # label(op_strict_implies) # label(axiom). [clausify(57)].
% 291.73/292.06 178 -op_strict_implies | necessarily(implies(A,B)) = strict_implies(A,B). [copy(177),flip(b)].
% 291.73/292.06 179 -op_strict_equiv | strict_equiv(A,B) = and(strict_implies(A,B),strict_implies(B,A)) # label(op_strict_equiv) # label(axiom). [clausify(58)].
% 291.73/292.06 180 -op_strict_equiv | and(strict_implies(A,B),strict_implies(B,A)) = strict_equiv(A,B). [copy(179),flip(b)].
% 291.73/292.06 182 op_or # label(s1_0_op_or) # label(axiom). [assumption].
% 291.73/292.06 184 op_strict_implies # label(s1_0_op_strict_implies) # label(axiom). [assumption].
% 291.73/292.06 185 op_equiv # label(s1_0_op_equiv) # label(axiom). [assumption].
% 291.73/292.06 186 op_strict_equiv # label(s1_0_op_strict_equiv) # label(axiom). [assumption].
% 291.73/292.06 187 modus_ponens_strict_implies # label(s1_0_modus_ponens_strict_implies) # label(axiom). [assumption].
% 291.73/292.06 188 substitution_strict_equiv # label(s1_0_substitution_strict_equiv) # label(axiom). [assumption].
% 291.73/292.06 189 adjunction # label(s1_0_adjunction) # label(axiom). [assumption].
% 291.73/292.06 190 axiom_m1 # label(s1_0_axiom_m1) # label(axiom). [assumption].
% 291.73/292.06 191 axiom_m2 # label(s1_0_axiom_m2) # label(axiom). [assumption].
% 291.73/292.06 192 axiom_m3 # label(s1_0_axiom_m3) # label(axiom). [assumption].
% 291.73/292.06 193 axiom_m4 # label(s1_0_axiom_m4) # label(axiom). [assumption].
% 291.73/292.06 194 axiom_m5 # label(s1_0_axiom_m5) # label(axiom). [assumption].
% 291.73/292.06 195 op_implies_and # label(hilbert_op_implies_and) # label(axiom). [assumption].
% 291.73/292.06 196 substitution_of_equivalents # label(substitution_of_equivalents) # label(axiom). [assumption].
% 291.73/292.06 197 -or_1 # label(hilbert_or_1) # label(negated_conjecture). [assumption].
% 291.73/292.06 200 not(and(not(A),not(B))) = or(A,B). [back_unit_del(115),unit_del(a,182)].
% 291.73/292.06 201 necessarily(implies(A,B)) = strict_implies(A,B). [back_unit_del(178),unit_del(a,184)].
% 291.73/292.06 202 and(implies(A,B),implies(B,A)) = equiv(A,B). [back_unit_del(120),unit_del(a,185)].
% 291.73/292.06 203 and(strict_implies(A,B),strict_implies(B,A)) = strict_equiv(A,B). [back_unit_del(180),unit_del(a,186)].
% 291.73/292.06 204 -is_a_theorem(A) | -is_a_theorem(strict_implies(A,B)) | is_a_theorem(B). [back_unit_del(124),unit_del(a,187)].
% 291.73/292.06 205 -is_a_theorem(strict_equiv(A,B)) | B = A. [back_unit_del(132),unit_del(a,188)].
% 291.73/292.06 206 -is_a_theorem(A) | -is_a_theorem(B) | is_a_theorem(and(A,B)). [back_unit_del(128),unit_del(a,189)].
% 291.73/292.06 207 is_a_theorem(strict_implies(and(A,B),and(B,A))). [back_unit_del(153),unit_del(a,190)].
% 291.73/292.06 208 is_a_theorem(strict_implies(and(A,B),A)). [back_unit_del(155),unit_del(a,191)].
% 291.73/292.06 209 is_a_theorem(strict_implies(and(and(A,B),C),and(A,and(B,C)))). [back_unit_del(157),unit_del(a,192)].
% 291.73/292.06 210 is_a_theorem(strict_implies(A,and(A,A))). [back_unit_del(159),unit_del(a,193)].
% 291.73/292.06 211 is_a_theorem(strict_implies(and(strict_implies(A,B),strict_implies(B,C)),strict_implies(A,C))). [back_unit_del(161),unit_del(a,194)].
% 291.73/292.06 212 not(and(A,not(B))) = implies(A,B). [back_unit_del(118),unit_del(a,195)].
% 291.73/292.06 213 -is_a_theorem(equiv(A,B)) | B = A. [back_unit_del(63),unit_del(a,196)].
% 291.73/292.06 214 -is_a_theorem(implies(c20,or(c20,c21))). [back_unit_del(81),unit_del(a,197)].
% 291.73/292.06 219 implies(not(A),B) = or(A,B). [back_rewrite(200),rewrite([212(4)])].
% 291.73/292.06 240 -is_a_theorem(A) | is_a_theorem(and(A,strict_implies(and(B,C),and(C,B)))). [resolve(207,a,206,b)].
% 291.73/292.06 247 -is_a_theorem(A) | is_a_theorem(and(A,strict_implies(and(B,C),B))). [resolve(208,a,206,b)].
% 291.73/292.06 248 -is_a_theorem(A) | is_a_theorem(and(strict_implies(and(B,C),B),A)). [resolve(208,a,206,a)].
% 291.73/292.06 263 -is_a_theorem(A) | is_a_theorem(and(A,strict_implies(B,and(B,B)))). [resolve(210,a,206,b)].
% 291.73/292.06 271 -is_a_theorem(and(strict_implies(A,B),strict_implies(B,C))) | is_a_theorem(strict_implies(A,C)). [resolve(211,a,204,b)].
% 291.73/292.06 277 not(and(A,implies(B,C))) = implies(A,and(B,not(C))). [para(212(a,1),212(a,1,1,2))].
% 291.73/292.06 280 necessarily(or(A,B)) = strict_implies(not(A),B). [para(219(a,1),201(a,1,1))].
% 291.73/292.06 281 and(or(A,B),implies(B,not(A))) = equiv(not(A),B). [para(219(a,1),202(a,1,1))].
% 291.73/292.06 282 and(implies(A,not(B)),or(B,A)) = equiv(A,not(B)). [para(219(a,1),202(a,1,2))].
% 291.73/292.06 283 or(and(A,not(B)),C) = implies(implies(A,B),C). [para(212(a,1),219(a,1,1)),flip(a)].
% 291.73/292.06 465 is_a_theorem(and(strict_implies(and(and(A,B),C),and(A,and(B,C))),strict_implies(and(D,E),and(E,D)))). [resolve(240,a,209,a)].
% 291.73/292.06 467 is_a_theorem(and(strict_implies(and(A,B),and(B,A)),strict_implies(and(C,D),and(D,C)))). [resolve(240,a,207,a)].
% 291.73/292.06 605 is_a_theorem(and(strict_implies(A,and(A,A)),strict_implies(and(B,C),B))). [resolve(247,a,210,a)].
% 291.73/292.06 607 is_a_theorem(and(strict_implies(and(A,B),A),strict_implies(and(C,D),C))). [resolve(247,a,208,a)].
% 291.73/292.06 2316 implies(A,and(not(B),not(C))) = not(and(A,or(B,C))). [para(219(a,1),277(a,1,1,2)),flip(a)].
% 291.73/292.06 2429 and(or(A,not(B)),or(B,not(A))) = equiv(not(A),not(B)). [para(219(a,1),281(a,1,2))].
% 291.73/292.06 9036 is_a_theorem(strict_implies(A,A)). [resolve(605,a,271,a)].
% 291.73/292.06 9042 is_a_theorem(strict_equiv(A,and(A,A))). [para(203(a,1),605(a,1))].
% 291.73/292.06 9087 is_a_theorem(and(strict_implies(A,A),strict_implies(B,and(B,B)))). [resolve(9036,a,263,a)].
% 291.73/292.06 9088 is_a_theorem(and(strict_implies(and(A,B),A),strict_implies(C,C))). [resolve(9036,a,248,a)].
% 291.73/292.06 9089 is_a_theorem(and(strict_implies(A,A),strict_implies(and(B,C),B))). [resolve(9036,a,247,a)].
% 291.73/292.06 9098 -is_a_theorem(A) | is_a_theorem(and(A,strict_implies(B,B))). [resolve(9036,a,206,b)].
% 291.73/292.06 9101 is_a_theorem(strict_implies(and(and(A,B),C),and(and(B,C),A))). [resolve(465,a,271,a)].
% 291.73/292.06 9218 and(A,A) = A. [resolve(9042,a,205,a)].
% 291.73/292.06 9223 is_a_theorem(and(strict_implies(A,A),strict_implies(B,B))). [back_rewrite(9087),rewrite([9218(2)])].
% 291.73/292.06 9658 strict_equiv(A,A) = strict_implies(A,A). [para(9218(a,1),203(a,1)),flip(a)].
% 291.73/292.06 9659 is_a_theorem(strict_implies(and(A,B),and(A,and(A,B)))). [para(9218(a,1),209(a,1,1,1))].
% 291.73/292.06 9662 or(A,A) = not(not(A)). [para(9218(a,1),212(a,1,1)),rewrite([219(4)]),flip(a)].
% 291.73/292.06 9675 implies(or(A,A),B) = or(not(A),B). [para(9218(a,1),283(a,1,1)),rewrite([219(4)]),flip(a)].
% 291.73/292.06 9780 is_a_theorem(strict_equiv(and(A,B),and(B,A))). [para(203(a,1),467(a,1))].
% 291.73/292.06 9921 strict_implies(or(A,A),B) = strict_implies(not(not(A)),B). [para(9662(a,2),280(a,2,1)),rewrite([280(3)]),flip(a)].
% 291.73/292.06 9938 not(or(A,A)) = not(not(not(A))). [para(9662(a,2),9662(a,2,1)),rewrite([9662(3)]),flip(a)].
% 291.73/292.06 10190 and(A,B) = and(B,A). [resolve(9780,a,205,a)].
% 291.73/292.06 10306 is_a_theorem(strict_implies(and(A,and(B,C)),and(B,and(C,A)))). [back_rewrite(9101),rewrite([10190(2),10190(4)])].
% 291.73/292.06 10455 equiv(not(A),B) = equiv(B,not(A)). [back_rewrite(282),rewrite([10190(4),281(4)])].
% 291.73/292.06 10496 and(or(A,B),implies(B,not(A))) = equiv(B,not(A)). [back_rewrite(281),rewrite([10455(6)])].
% 291.73/292.06 10497 equiv(A,B) = equiv(B,A). [para(10190(a,1),202(a,1)),rewrite([202(3)])].
% 291.73/292.06 10498 strict_equiv(A,B) = strict_equiv(B,A). [para(10190(a,1),203(a,1)),rewrite([203(3)])].
% 291.73/292.06 10499 is_a_theorem(strict_implies(and(A,B),B)). [para(10190(a,1),208(a,1,1))].
% 291.73/292.06 10504 -is_a_theorem(and(strict_implies(A,B),strict_implies(C,A))) | is_a_theorem(strict_implies(C,B)). [para(10190(a,1),271(a,1))].
% 291.73/292.06 10575 -is_a_theorem(A) | is_a_theorem(and(A,strict_implies(and(B,C),C))). [resolve(10499,a,206,b)].
% 291.73/292.06 10595 -is_a_theorem(equiv(A,B)) | A = B. [para(10497(a,1),213(a,1))].
% 291.73/292.06 10599 -is_a_theorem(strict_equiv(A,B)) | A = B. [para(10498(a,1),205(a,1))].
% 291.73/292.06 10768 implies(A,or(B,B)) = implies(A,not(not(B))). [para(9938(a,1),212(a,1,1,2)),rewrite([212(5)]),flip(a)].
% 291.73/292.06 10769 or(or(A,A),B) = or(not(not(A)),B). [para(9938(a,1),219(a,1,1)),rewrite([219(4)]),flip(a)].
% 291.73/292.06 10785 not(not(not(or(A,A)))) = not(not(not(not(not(A))))). [para(9938(a,1),9938(a,2,1,1)),rewrite([9662(3)])].
% 291.73/292.06 10962 is_a_theorem(and(strict_implies(A,A),strict_implies(and(B,C),C))). [para(10190(a,1),9089(a,1,2,1))].
% 291.73/292.06 11008 is_a_theorem(strict_implies(and(A,and(B,C)),B)). [resolve(607,a,271,a),rewrite([10190(2)])].
% 291.73/292.06 11034 is_a_theorem(strict_implies(and(A,and(B,C)),C)). [para(10190(a,1),11008(a,1,1,2))].
% 291.73/292.06 11050 -is_a_theorem(A) | is_a_theorem(and(A,strict_implies(and(B,and(C,D)),D))). [resolve(11034,a,206,b)].
% 291.73/292.06 11155 is_a_theorem(and(strict_implies(and(A,B),and(A,and(A,B))),strict_implies(and(C,D),D))). [resolve(10575,a,9659,a)].
% 291.73/292.06 12106 and(strict_implies(A,not(not(B))),strict_implies(or(B,B),A)) = strict_equiv(A,not(not(B))). [para(9921(a,2),203(a,1,2))].
% 291.73/292.06 12107 -is_a_theorem(or(A,A)) | -is_a_theorem(strict_implies(not(not(A)),B)) | is_a_theorem(B). [para(9921(a,1),204(b,1))].
% 291.73/292.06 12852 strict_implies(A,or(B,B)) = strict_implies(A,not(not(B))). [para(10768(a,1),201(a,1,1)),rewrite([201(4)]),flip(a)].
% 291.73/292.06 12853 or(A,or(B,B)) = or(A,not(not(B))). [para(10768(a,1),219(a,1)),rewrite([219(4)]),flip(a)].
% 291.73/292.06 13452 strict_equiv(A,or(B,B)) = strict_equiv(A,not(not(B))). [para(12852(a,1),203(a,1,1)),rewrite([12106(6)]),flip(a)].
% 291.73/292.06 13454 -is_a_theorem(A) | -is_a_theorem(strict_implies(A,or(B,B))) | is_a_theorem(not(not(B))). [para(12852(a,2),204(b,1))].
% 291.73/292.06 13661 or(A,not(or(B,B))) = or(A,not(not(not(B)))). [para(9662(a,2),12853(a,2,2,1)),rewrite([9662(3)]),flip(a)].
% 291.73/292.06 13667 or(or(A,A),not(not(B))) = or(not(not(A)),or(B,B)). [para(12853(a,1),10769(a,1))].
% 291.73/292.06 13668 or(or(A,A),or(B,B)) = or(not(not(A)),not(not(B))). [para(12853(a,1),10769(a,2))].
% 291.73/292.06 13758 -is_a_theorem(strict_equiv(A,not(not(B)))) | or(B,B) = A. [para(13452(a,1),205(a,1))].
% 291.73/292.06 13759 -is_a_theorem(strict_equiv(A,or(B,B))) | not(not(B)) = A. [para(13452(a,2),205(a,1))].
% 291.73/292.06 13764 strict_equiv(A,not(or(B,B))) = strict_equiv(A,not(not(not(B)))). [para(9662(a,2),13452(a,2,2,1)),rewrite([9662(3)]),flip(a)].
% 291.73/292.06 15885 -is_a_theorem(and(strict_implies(or(A,A),B),strict_implies(C,not(not(A))))) | is_a_theorem(strict_implies(C,B)). [para(9921(a,2),10504(a,1,1))].
% 291.73/292.06 17908 not(and(not(A),or(B,C))) = or(A,and(not(B),not(C))). [para(2316(a,1),219(a,1))].
% 291.73/292.06 17914 not(and(A,or(B,C))) = not(and(A,or(C,B))). [para(10190(a,1),2316(a,1,2)),rewrite([2316(4)])].
% 291.73/292.06 19747 or(or(A,A),not(or(B,B))) = or(not(not(A)),not(not(not(B)))). [para(13661(a,1),10769(a,2))].
% 291.73/292.06 19790 -is_a_theorem(strict_equiv(A,not(not(not(B))))) | not(or(B,B)) = A. [para(13764(a,1),205(a,1))].
% 291.73/292.06 19867 not(and(or(A,B),or(B,A))) = not(or(A,B)). [para(9218(a,1),17914(a,1,1)),flip(a)].
% 291.73/292.06 20499 not(or(A,B)) = not(or(B,A)). [para(10190(a,1),19867(a,1,1)),rewrite([19867(4)])].
% 291.73/292.06 20505 implies(A,or(B,C)) = implies(A,or(C,B)). [para(20499(a,1),212(a,1,1,2)),rewrite([212(4)])].
% 291.73/292.06 20528 strict_implies(A,or(B,C)) = strict_implies(A,or(C,B)). [para(20505(a,1),201(a,1,1)),rewrite([201(3)])].
% 291.73/292.06 20780 and(strict_implies(A,or(B,C)),strict_implies(or(C,B),A)) = strict_equiv(A,or(C,B)). [para(20528(a,1),203(a,1,1))].
% 291.73/292.06 24385 or(A,and(not(B),not(C))) = implies(or(B,C),A). [para(10190(a,1),17908(a,1,1)),rewrite([212(4)]),flip(a)].
% 291.73/292.06 24396 or(not(A),B) = or(B,not(A)). [para(9218(a,1),24385(a,1,2)),rewrite([9675(4)]),flip(a)].
% 291.73/292.06 24399 implies(or(A,B),C) = implies(or(B,A),C). [para(10190(a,1),24385(a,1,2)),rewrite([24385(4)])].
% 291.73/292.06 24440 implies(or(A,A),B) = or(B,not(A)). [back_rewrite(9675),rewrite([24396(4)])].
% 291.73/292.06 24446 strict_implies(not(not(A)),B) = strict_implies(not(B),not(A)). [para(24396(a,1),280(a,1,1)),rewrite([280(3)]),flip(a)].
% 291.73/292.06 24540 -is_a_theorem(or(A,A)) | -is_a_theorem(strict_implies(not(B),not(A))) | is_a_theorem(B). [back_rewrite(12107),rewrite([24446(5)])].
% 291.73/292.06 24542 strict_implies(or(A,A),B) = strict_implies(not(B),not(A)). [back_rewrite(9921),rewrite([24446(5)])].
% 291.73/292.06 24597 strict_implies(or(A,B),C) = strict_implies(or(B,A),C). [para(24399(a,1),201(a,1,1)),rewrite([201(3)])].
% 291.73/292.06 24599 strict_equiv(A,or(B,C)) = strict_equiv(A,or(C,B)). [back_rewrite(20780),rewrite([24597(4),203(5)])].
% 291.73/292.06 24701 is_a_theorem(strict_implies(or(A,A),A)). [para(24542(a,2),9036(a,1))].
% 291.73/292.06 24705 strict_implies(or(A,A),not(B)) = strict_implies(or(B,B),not(A)). [para(9662(a,2),24542(a,2,1))].
% 291.73/292.06 24706 is_a_theorem(and(strict_implies(or(A,A),A),strict_implies(B,B))). [para(24542(a,2),9223(a,1,1))].
% 291.73/292.06 24714 is_a_theorem(and(strict_implies(and(A,B),A),strict_implies(or(C,C),C))). [para(24542(a,2),9088(a,1,2))].
% 291.73/292.06 25091 -is_a_theorem(A) | is_a_theorem(and(A,strict_implies(or(B,B),B))). [resolve(24701,a,206,b)].
% 291.73/292.06 25149 is_a_theorem(and(strict_implies(or(A,A),A),strict_implies(or(B,B),B))). [para(24542(a,2),24706(a,1,2))].
% 291.73/292.06 25265 -is_a_theorem(strict_equiv(A,or(B,C))) | or(C,B) = A. [para(24599(a,1),205(a,1))].
% 291.73/292.06 25291 or(A,B) = or(B,A). [para(9658(a,1),25265(a,1)),unit_del(a,9036)].
% 291.73/292.06 25312 strict_implies(not(A),B) = strict_implies(not(B),A). [para(25291(a,1),280(a,1,1)),rewrite([280(2)])].
% 291.73/292.06 25313 and(or(A,B),implies(A,not(B))) = equiv(A,not(B)). [para(25291(a,1),10496(a,1,1))].
% 291.73/292.06 25316 or(or(A,A),or(B,B)) = or(not(not(B)),not(not(A))). [para(13668(a,2),25291(a,2)),flip(a)].
% 291.73/292.06 25336 and(strict_implies(A,not(B)),strict_implies(not(A),B)) = strict_equiv(A,not(B)). [para(25312(a,1),203(a,1,1)),rewrite([10190(5),10498(7)])].
% 291.73/292.06 25431 is_a_theorem(strict_implies(not(A),not(and(A,B)))). [resolve(24714,a,10504,a),rewrite([9662(3),25312(4)])].
% 291.73/292.06 25463 -is_a_theorem(not(A)) | is_a_theorem(not(and(A,B))). [resolve(25431,a,204,b)].
% 291.73/292.06 25469 is_a_theorem(strict_implies(not(A),implies(A,B))). [para(212(a,1),25431(a,1,2))].
% 291.73/292.06 25473 is_a_theorem(strict_implies(or(A,A),implies(B,A))). [para(9662(a,2),25431(a,1,1)),rewrite([10190(3),212(4)])].
% 291.73/292.06 25515 is_a_theorem(and(strict_implies(not(A),implies(A,B)),strict_implies(and(C,and(D,E)),E))). [resolve(25469,a,11050,a)].
% 291.73/292.06 25556 is_a_theorem(strict_implies(or(A,A),or(A,B))). [para(9662(a,2),25469(a,1,1)),rewrite([219(3)])].
% 291.73/292.06 25558 is_a_theorem(strict_implies(not(not(not(A))),or(B,not(A)))). [para(9938(a,1),25469(a,1,1)),rewrite([24440(5)])].
% 291.73/292.06 25724 -is_a_theorem(not(not(not(or(A,A))))) | is_a_theorem(implies(B,not(not(not(A))))). [para(10785(a,2),25463(a,1)),rewrite([10190(10),212(11)])].
% 291.73/292.06 25759 is_a_theorem(and(strict_implies(or(A,A),implies(B,A)),strict_implies(C,C))). [resolve(25473,a,9098,a)].
% 291.73/292.06 25844 is_a_theorem(and(strict_implies(or(A,A),or(A,B)),strict_implies(C,C))). [resolve(25556,a,9098,a)].
% 291.73/292.06 26309 is_a_theorem(strict_implies(not(not(implies(A,B))),or(C,implies(A,B)))). [para(212(a,1),25558(a,1,1,1,1)),rewrite([212(6)])].
% 291.73/292.06 27173 is_a_theorem(strict_implies(not(A),not(or(A,A)))). [resolve(25149,a,10504,a),rewrite([9662(3),25312(4)])].
% 291.73/292.06 27213 is_a_theorem(strict_implies(not(A),not(not(not(A))))). [para(9662(a,1),27173(a,1,2,1))].
% 291.73/292.06 27360 is_a_theorem(and(strict_implies(not(A),not(not(not(A)))),strict_implies(B,B))). [resolve(27213,a,9098,a)].
% 291.73/292.06 29542 -is_a_theorem(not(not(implies(A,B)))) | is_a_theorem(or(C,implies(A,B))). [resolve(26309,a,204,b)].
% 291.73/292.06 30965 is_a_theorem(strict_equiv(and(A,B),and(A,and(A,B)))). [para(203(a,1),11155(a,1))].
% 291.73/292.06 30966 and(A,and(A,B)) = and(A,B). [resolve(30965,a,10599,a),flip(a)].
% 291.73/292.06 33995 is_a_theorem(strict_equiv(not(A),not(not(not(A))))). [para(25336(a,1),27360(a,1))].
% 291.73/292.06 34268 not(or(A,A)) = not(A). [resolve(33995,a,19790,a)].
% 291.73/292.06 34269 not(not(not(A))) = not(A). [resolve(33995,a,13758,a),rewrite([9662(3)])].
% 291.73/292.06 34462 -is_a_theorem(not(A)) | is_a_theorem(implies(B,not(A))). [back_rewrite(25724),rewrite([34268(2),34269(3),34269(5)])].
% 291.73/292.06 34559 or(or(A,A),not(B)) = or(not(B),not(not(A))). [back_rewrite(19747),rewrite([34268(3),34269(8),25291(7)])].
% 291.73/292.06 34899 implies(A,or(B,B)) = implies(A,B). [para(34268(a,1),212(a,1,1,2)),rewrite([212(3)]),flip(a)].
% 291.73/292.06 34900 not(not(implies(A,B))) = implies(A,B). [para(212(a,1),34268(a,2)),rewrite([9662(5),212(3)])].
% 291.73/292.06 34901 or(A,or(B,B)) = or(B,A). [para(34268(a,1),219(a,1,1)),rewrite([219(2),25291(3)]),flip(a)].
% 291.73/292.06 34943 or(not(not(A)),not(not(B))) = or(B,not(not(A))). [para(34268(a,1),13667(a,2,1,1)),rewrite([9662(3),34268(2),34901(9)])].
% 291.73/292.06 35074 implies(A,not(not(B))) = implies(A,B). [back_rewrite(10768),rewrite([34899(2)]),flip(a)].
% 291.73/292.06 35105 -is_a_theorem(implies(A,B)) | is_a_theorem(or(C,implies(A,B))). [back_rewrite(29542),rewrite([34900(3)])].
% 291.73/292.06 35144 or(A,not(not(B))) = or(B,A). [back_rewrite(25316),rewrite([34901(3),34901(2),25291(6),34943(6)]),flip(a)].
% 291.73/292.06 35269 or(or(A,A),not(B)) = or(A,not(B)). [back_rewrite(34559),rewrite([35144(7)])].
% 291.73/292.06 35525 -is_a_theorem(implies(A,B)) | is_a_theorem(implies(C,implies(A,B))). [para(212(a,1),34462(a,1)),rewrite([212(5)])].
% 291.73/292.06 35592 strict_implies(A,or(B,B)) = strict_implies(A,B). [para(34899(a,1),201(a,1,1)),rewrite([201(2)]),flip(a)].
% 291.73/292.06 35653 -is_a_theorem(A) | -is_a_theorem(strict_implies(A,B)) | is_a_theorem(not(not(B))). [back_rewrite(13454),rewrite([35592(3)])].
% 291.73/292.06 35654 strict_implies(A,not(not(B))) = strict_implies(A,B). [back_rewrite(12852),rewrite([35592(2)]),flip(a)].
% 291.73/292.06 35745 -is_a_theorem(and(strict_implies(or(A,A),B),strict_implies(C,A))) | is_a_theorem(strict_implies(C,B)). [back_rewrite(15885),rewrite([35654(5)])].
% 291.73/292.06 35831 not(not(or(A,B))) = or(A,B). [para(219(a,1),34900(a,1,1,1)),rewrite([219(5)])].
% 291.73/292.06 36143 strict_implies(not(A),not(or(B,C))) = strict_implies(or(B,C),A). [para(35831(a,1),25312(a,1,1)),flip(a)].
% 291.73/292.06 36597 -is_a_theorem(A) | is_a_theorem(not(not(A))). [resolve(35653,b,9036,a)].
% 291.73/292.06 37154 is_a_theorem(not(not(and(strict_implies(A,A),strict_implies(and(B,C),C))))). [resolve(36597,a,10962,a)].
% 291.73/292.06 37248 is_a_theorem(not(not(strict_implies(A,A)))). [resolve(36597,a,9036,a)].
% 291.73/292.06 37843 is_a_theorem(implies(A,strict_implies(B,B))). [resolve(37248,a,34462,a),rewrite([35074(4)])].
% 291.73/292.06 37992 is_a_theorem(or(A,implies(B,strict_implies(C,C)))). [resolve(37843,a,35105,a)].
% 291.73/292.06 38030 -is_a_theorem(A) | is_a_theorem(and(A,implies(B,strict_implies(C,C)))). [resolve(37843,a,206,b)].
% 291.73/292.06 39122 is_a_theorem(or(A,or(B,strict_implies(C,C)))). [para(219(a,1),37992(a,1,2))].
% 291.73/292.06 39625 -is_a_theorem(strict_implies(or(A,strict_implies(B,B)),C)) | is_a_theorem(C). [resolve(39122,a,24540,a),rewrite([36143(5)])].
% 291.73/292.06 50147 equiv(or(A,A),not(not(B))) = equiv(not(A),not(B)). [para(35269(a,1),25313(a,1,1)),rewrite([35074(6),24440(4),2429(5)]),flip(a)].
% 291.73/292.06 58368 is_a_theorem(strict_implies(and(A,and(B,not(C))),implies(C,D))). [resolve(25515,a,10504,a)].
% 291.73/292.06 58523 is_a_theorem(implies(A,and(strict_implies(B,B),strict_implies(and(C,D),D)))). [resolve(37154,a,34462,a),rewrite([35074(7)])].
% 291.73/292.06 61393 is_a_theorem(implies(A,and(strict_implies(B,B),strict_implies(C,C)))). [para(9218(a,1),58523(a,1,2,2,1))].
% 291.73/292.06 61394 is_a_theorem(implies(A,implies(B,and(strict_implies(C,C),strict_implies(D,D))))). [resolve(61393,a,35525,a)].
% 291.73/292.06 67783 is_a_theorem(strict_implies(A,or(A,B))). [resolve(35745,a,25844,a)].
% 291.73/292.06 67786 is_a_theorem(strict_implies(A,implies(B,A))). [resolve(35745,a,25759,a)].
% 291.73/292.06 67805 is_a_theorem(and(strict_implies(A,or(A,B)),strict_implies(or(C,C),C))). [resolve(67783,a,25091,a)].
% 291.73/292.06 67845 -is_a_theorem(A) | is_a_theorem(and(A,strict_implies(B,implies(C,B)))). [resolve(67786,a,206,b)].
% 291.73/292.06 68833 is_a_theorem(strict_equiv(A,or(A,A))). [para(203(a,1),67805(a,1))].
% 291.73/292.06 68856 not(not(A)) = A. [resolve(68833,a,13759,a)].
% 291.73/292.06 68857 or(A,A) = A. [resolve(68833,a,10599,a),flip(a)].
% 291.73/292.06 68954 equiv(not(A),not(B)) = equiv(A,B). [back_rewrite(50147),rewrite([68857(1),68856(2)]),flip(a)].
% 291.73/292.06 69336 strict_implies(A,not(B)) = strict_implies(B,not(A)). [back_rewrite(24705),rewrite([68857(1),68857(3)])].
% 291.73/292.06 69344 or(A,not(B)) = implies(B,A). [back_rewrite(24440),rewrite([68857(1)]),flip(a)].
% 291.73/292.06 69849 not(and(A,B)) = implies(A,not(B)). [para(68856(a,1),212(a,1,1,2))].
% 291.73/292.06 69850 not(implies(A,B)) = and(A,not(B)). [para(212(a,1),68856(a,1,1))].
% 291.73/292.06 70435 -is_a_theorem(strict_implies(strict_implies(A,A),B)) | is_a_theorem(B). [para(68857(a,1),39625(a,1,1))].
% 291.73/292.06 74304 -is_a_theorem(equiv(A,B)) | not(A) = not(B). [para(68954(a,1),10595(a,1))].
% 291.73/292.06 74386 implies(A,not(B)) = implies(B,not(A)). [para(10190(a,1),69849(a,1,1)),rewrite([69849(2)])].
% 291.73/292.06 74388 implies(A,implies(A,not(B))) = implies(A,not(B)). [para(30966(a,1),69849(a,1,1)),rewrite([69849(2),69849(4)]),flip(a)].
% 291.73/292.06 74392 or(A,implies(B,not(C))) = implies(and(B,C),A). [para(69849(a,1),69344(a,1,2))].
% 291.73/292.06 74402 implies(and(A,not(B)),C) = or(C,implies(A,B)). [para(69850(a,1),219(a,1,1)),rewrite([25291(5)])].
% 291.73/292.06 74403 and(not(A),not(B)) = not(or(A,B)). [para(219(a,1),69850(a,1,1)),flip(a)].
% 291.73/292.06 76134 is_a_theorem(strict_implies(and(A,not(or(B,C))),implies(C,D))). [para(74403(a,1),58368(a,1,1,2))].
% 291.73/292.06 76888 implies(A,implies(A,B)) = implies(A,B). [para(68856(a,1),74388(a,1,2,2)),rewrite([68856(4)])].
% 291.73/292.06 76895 strict_implies(A,implies(A,B)) = strict_implies(A,B). [para(76888(a,1),201(a,1,1)),rewrite([201(2)]),flip(a)].
% 291.73/292.06 77725 is_a_theorem(strict_implies(not(or(A,or(B,C))),implies(C,D))). [para(74403(a,1),76134(a,1,1))].
% 291.73/292.06 78013 is_a_theorem(strict_implies(and(A,not(B)),or(C,or(A,D)))). [para(25312(a,1),77725(a,1)),rewrite([69850(2),25291(3)])].
% 291.73/292.06 78066 is_a_theorem(strict_implies(and(A,B),or(C,or(A,D)))). [para(68856(a,1),78013(a,1,1,2))].
% 291.73/292.06 78077 is_a_theorem(strict_implies(and(A,B),or(C,implies(D,A)))). [para(69344(a,1),78066(a,1,2,2))].
% 291.73/292.06 78098 is_a_theorem(strict_implies(and(A,not(B)),implies(and(B,C),D))). [para(74386(a,1),78077(a,1,2,2)),rewrite([10190(2),74392(5)])].
% 291.73/292.06 78128 is_a_theorem(strict_implies(and(A,not(A)),B)). [para(76895(a,1),78098(a,1))].
% 291.73/292.06 78160 is_a_theorem(strict_implies(A,implies(B,B))). [para(69336(a,1),78128(a,1)),rewrite([69849(3),68856(2)])].
% 291.73/292.06 78370 is_a_theorem(and(strict_implies(A,implies(B,B)),strict_implies(C,implies(D,C)))). [resolve(78160,a,67845,a)].
% 291.73/292.06 82585 is_a_theorem(strict_equiv(implies(A,A),implies(B,implies(A,A)))). [para(203(a,1),78370(a,1)),rewrite([10498(4)])].
% 291.73/292.06 82676 implies(A,implies(B,B)) = implies(B,B). [resolve(82585,a,10599,a),flip(a)].
% 291.73/292.06 82683 strict_implies(A,implies(B,B)) = strict_implies(B,B). [para(82676(a,1),201(a,1,1)),rewrite([201(2)]),flip(a)].
% 291.73/292.06 82684 or(A,implies(B,B)) = implies(B,B). [para(82676(a,1),219(a,1)),flip(a)].
% 291.77/292.06 82737 strict_implies(and(A,not(A)),B) = strict_implies(A,A). [para(82683(a,1),25312(a,1)),rewrite([69850(3)]),flip(a)].
% 291.77/292.06 82890 strict_implies(A,A) = strict_implies(B,B). [para(82737(a,1),82683(a,1))].
% 291.77/292.06 82891 strict_implies(A,A) = c_0. [new_symbol(82890)].
% 291.77/292.06 83876 -is_a_theorem(strict_implies(c_0,A)) | is_a_theorem(A). [back_rewrite(70435),rewrite([82891(1)])].
% 291.77/292.06 84192 is_a_theorem(implies(A,implies(B,c_0))). [back_rewrite(61394),rewrite([82891(1),82891(2),9218(3)])].
% 291.77/292.06 84744 -is_a_theorem(A) | is_a_theorem(and(A,implies(B,c_0))). [back_rewrite(38030),rewrite([82891(2)])].
% 291.77/292.06 88246 is_a_theorem(and(implies(A,implies(B,c_0)),implies(C,c_0))). [resolve(84744,a,84192,a)].
% 291.77/292.06 91497 is_a_theorem(equiv(c_0,implies(A,c_0))). [para(202(a,1),88246(a,1))].
% 291.77/292.06 91514 and(A,not(c_0)) = not(c_0). [resolve(91497,a,74304,a),rewrite([69850(5)]),flip(a)].
% 291.77/292.06 91526 implies(A,c_0) = c_0. [resolve(91497,a,10595,a),flip(a)].
% 291.77/292.06 91662 or(c_0,implies(A,B)) = c_0. [para(91526(a,1),74402(a,1)),flip(a)].
% 291.77/292.06 91925 implies(A,A) = c_0. [para(82676(a,1),91662(a,1,2)),rewrite([82684(3)])].
% 291.77/292.06 91960 and(A,not(A)) = not(c_0). [para(91925(a,1),69850(a,1,1)),flip(a)].
% 291.77/292.06 92241 is_a_theorem(strict_implies(c_0,implies(and(A,B),A))). [para(91960(a,1),10306(a,1,2,2)),rewrite([10190(2),91514(6),69336(6),69849(5),69849(4),219(5),74392(4)])].
% 291.77/292.06 92574 is_a_theorem(implies(and(A,B),A)). [resolve(92241,a,83876,a)].
% 291.77/292.06 92668 is_a_theorem(implies(A,or(A,B))). [para(74403(a,1),92574(a,1,1)),rewrite([74386(4),68856(3)])].
% 291.77/292.06 92669 $F. [resolve(92668,a,214,a)].
% 291.77/292.06
% 291.77/292.06 % SZS output end Refutation
% 291.77/292.06 ============================== end of proof ==========================
% 291.77/292.06
% 291.77/292.06 ============================== STATISTICS ============================
% 291.77/292.06
% 291.77/292.06 Given=33683. Generated=16668181. Kept=92604. proofs=1.
% 291.77/292.06 Usable=15223. Sos=6299. Demods=197. Limbo=69, Disabled=71147. Hints=0.
% 291.77/292.06 Megabytes=113.38.
% 291.77/292.06 User_CPU=282.46, System_CPU=8.57, Wall_clock=291.
% 291.77/292.06
% 291.77/292.06 ============================== end of statistics =====================
% 291.77/292.06
% 291.77/292.06 ============================== end of search =========================
% 291.77/292.06
% 291.77/292.06 THEOREM PROVED
% 291.77/292.06 % SZS status Theorem
% 291.77/292.06
% 291.77/292.06 Exiting with 1 proof.
% 291.77/292.06
% 291.77/292.06 Process 13371 exit (max_proofs) Sun Jul 3 08:59:51 2022
% 291.77/292.06 Prover9 interrupted
%------------------------------------------------------------------------------