0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n013.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 180 0.12/0.33 % DateTime : Thu Aug 29 16:25:16 EDT 2019 0.12/0.34 % CPUTime : 0.76/1.03 ============================== Prover9 =============================== 0.76/1.03 Prover9 (32) version 2009-11A, November 2009. 0.76/1.03 Process 17125 was started by sandbox2 on n013.cluster.edu, 0.76/1.03 Thu Aug 29 16:25:17 2019 0.76/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_16972_n013.cluster.edu". 0.76/1.03 ============================== end of head =========================== 0.76/1.03 0.76/1.03 ============================== INPUT ================================= 0.76/1.03 0.76/1.03 % Reading from file /tmp/Prover9_16972_n013.cluster.edu 0.76/1.03 0.76/1.03 set(prolog_style_variables). 0.76/1.03 set(auto2). 0.76/1.03 % set(auto2) -> set(auto). 0.76/1.03 % set(auto) -> set(auto_inference). 0.76/1.03 % set(auto) -> set(auto_setup). 0.76/1.03 % set(auto_setup) -> set(predicate_elim). 0.76/1.03 % set(auto_setup) -> assign(eq_defs, unfold). 0.76/1.03 % set(auto) -> set(auto_limits). 0.76/1.03 % set(auto_limits) -> assign(max_weight, "100.000"). 0.76/1.03 % set(auto_limits) -> assign(sos_limit, 20000). 0.76/1.03 % set(auto) -> set(auto_denials). 0.76/1.03 % set(auto) -> set(auto_process). 0.76/1.03 % set(auto2) -> assign(new_constants, 1). 0.76/1.03 % set(auto2) -> assign(fold_denial_max, 3). 0.76/1.03 % set(auto2) -> assign(max_weight, "200.000"). 0.76/1.03 % set(auto2) -> assign(max_hours, 1). 0.76/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.76/1.03 % set(auto2) -> assign(max_seconds, 0). 0.76/1.03 % set(auto2) -> assign(max_minutes, 5). 0.76/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.76/1.03 % set(auto2) -> set(sort_initial_sos). 0.76/1.03 % set(auto2) -> assign(sos_limit, -1). 0.76/1.03 % set(auto2) -> assign(lrs_ticks, 3000). 0.76/1.03 % set(auto2) -> assign(max_megs, 400). 0.76/1.03 % set(auto2) -> assign(stats, some). 0.76/1.03 % set(auto2) -> clear(echo_input). 0.76/1.03 % set(auto2) -> set(quiet). 0.76/1.03 % set(auto2) -> clear(print_initial_clauses). 0.76/1.03 % set(auto2) -> clear(print_given). 0.76/1.03 assign(lrs_ticks,-1). 0.76/1.03 assign(sos_limit,10000). 0.76/1.03 assign(order,kbo). 0.76/1.03 set(lex_order_vars). 0.76/1.03 clear(print_given). 0.76/1.03 0.76/1.03 % formulas(sos). % not echoed (77 formulas) 0.76/1.03 0.76/1.03 ============================== end of input ========================== 0.76/1.03 0.76/1.03 % From the command line: assign(max_seconds, 180). 0.76/1.03 0.76/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.76/1.03 0.76/1.03 % Formulas that are not ordinary clauses: 0.76/1.03 1 (all X all Y is_a_theorem(implies(X,implies(Y,and(X,Y))))) <-> and_3 # label(and_3) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 2 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.76/1.03 3 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.76/1.03 4 (all P all Q all R is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P)))))) <-> kn3 # label(kn3) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 5 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.76/1.03 6 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.76/1.03 7 (all X all Y is_a_theorem(implies(equiv(X,Y),implies(X,Y)))) <-> equivalence_1 # label(equivalence_1) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 8 (all X all Y is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y))))) <-> equivalence_3 # label(equivalence_3) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 9 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.76/1.03 10 (all P is_a_theorem(implies(P,and(P,P)))) <-> kn1 # label(kn1) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 11 (all X all Y is_a_theorem(implies(and(X,Y),X))) <-> and_1 # label(and_1) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 12 and_2 <-> (all X all Y is_a_theorem(implies(and(X,Y),Y))) # label(and_2) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 13 (all P is_a_theorem(implies(implies(not(P),P),P))) <-> cn3 # label(cn3) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 14 or_2 <-> (all X all Y is_a_theorem(implies(Y,or(X,Y)))) # label(or_2) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 15 r3 <-> (all P all Q is_a_theorem(implies(or(P,Q),or(Q,P)))) # label(r3) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 16 (all P all Q is_a_theorem(implies(P,implies(not(P),Q)))) <-> cn2 # label(cn2) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 17 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.76/1.03 18 (all P all Q is_a_theorem(implies(Q,or(P,Q)))) <-> r2 # label(r2) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 19 (all X all Y all Z is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))) <-> or_3 # label(or_3) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 20 (all X all Y is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y)))) <-> modus_tollens # label(modus_tollens) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 21 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.76/1.03 22 implies_1 <-> (all X all Y is_a_theorem(implies(X,implies(Y,X)))) # label(implies_1) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 23 or_1 <-> (all X all Y is_a_theorem(implies(X,or(X,Y)))) # label(or_1) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 24 (all P all Q all R is_a_theorem(implies(or(P,or(Q,R)),or(Q,or(P,R))))) <-> r4 # label(r4) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 25 r1 <-> (all P is_a_theorem(implies(or(P,P),P))) # label(r1) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 26 kn2 <-> (all P all Q is_a_theorem(implies(and(P,Q),P))) # label(kn2) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 27 op_and -> (all X all Y not(or(not(X),not(Y))) = and(X,Y)) # label(op_and) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 28 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.76/1.03 29 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.76/1.03 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.76/1.03 31 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.76/1.03 32 (all X all Y all Z is_a_theorem(strict_implies(and(strict_implies(X,Y),strict_implies(Y,Z)),strict_implies(X,Z)))) <-> axiom_m5 # label(axiom_m5) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 33 (all P all Q is_a_theorem(strict_implies(possibly(and(P,Q)),P))) <-> axiom_m7 # label(axiom_m7) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 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.76/1.03 35 axiom_B <-> (all X is_a_theorem(implies(X,necessarily(possibly(X))))) # label(axiom_B) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 36 (all X is_a_theorem(strict_implies(X,possibly(X)))) <-> axiom_m6 # label(axiom_m6) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 37 (all X is_a_theorem(strict_implies(necessarily(X),necessarily(necessarily(X))))) <-> axiom_s4 # label(axiom_s4) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 38 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.76/1.03 39 (all X all Y (is_a_theorem(strict_equiv(X,Y)) -> X = Y)) <-> substitution_strict_equiv # label(substitution_strict_equiv) # label(axiom) # label(non_clause). [assumption]. 0.76/1.03 40 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.76/1.03 41 necessitation <-> (all X (is_a_theorem(X) -> is_a_theorem(necessarily(X)))) # label(necessitation) # label(axiom) # label(non_clause). [assumption]. 0.76/1.06 42 (all X all Y is_a_theorem(implies(necessarily(implies(X,Y)),implies(necessarily(X),necessarily(Y))))) <-> axiom_K # label(axiom_K) # label(axiom) # label(non_clause). [assumption]. 0.76/1.06 43 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.76/1.06 44 (all X is_a_theorem(implies(necessarily(X),necessarily(necessarily(X))))) <-> axiom_4 # label(axiom_4) # label(axiom) # label(non_clause). [assumption]. 0.76/1.06 45 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.76/1.06 46 (all X is_a_theorem(strict_implies(possibly(X),necessarily(possibly(X))))) <-> axiom_m10 # label(axiom_m10) # label(axiom) # label(non_clause). [assumption]. 0.76/1.06 47 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.76/1.06 48 (all X is_a_theorem(strict_implies(possibly(possibly(X)),possibly(X)))) <-> axiom_m9 # label(axiom_m9) # label(axiom) # label(non_clause). [assumption]. 0.76/1.06 49 (all X is_a_theorem(strict_implies(X,and(X,X)))) <-> axiom_m4 # label(axiom_m4) # label(axiom) # label(non_clause). [assumption]. 0.76/1.06 50 (all X is_a_theorem(implies(possibly(X),necessarily(possibly(X))))) <-> axiom_5 # label(axiom_5) # label(axiom) # label(non_clause). [assumption]. 0.76/1.06 51 axiom_M <-> (all X is_a_theorem(implies(necessarily(X),X))) # label(axiom_M) # label(axiom) # label(non_clause). [assumption]. 0.76/1.06 52 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.76/1.06 53 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.76/1.06 54 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.76/1.06 55 op_necessarily -> (all X necessarily(X) = not(possibly(not(X)))) # label(op_necessarily) # label(axiom) # label(non_clause). [assumption]. 0.76/1.06 56 op_strict_equiv -> (all X all Y and(strict_implies(X,Y),strict_implies(Y,X)) = strict_equiv(X,Y)) # label(op_strict_equiv) # label(axiom) # label(non_clause). [assumption]. 0.76/1.06 57 op_strict_implies -> (all X all Y necessarily(implies(X,Y)) = strict_implies(X,Y)) # label(op_strict_implies) # label(axiom) # label(non_clause). [assumption]. 0.76/1.06 58 op_possibly -> (all X not(necessarily(not(X))) = possibly(X)) # label(op_possibly) # label(axiom) # label(non_clause). [assumption]. 0.76/1.06 0.76/1.06 ============================== end of process non-clausal formulas === 0.76/1.06 0.76/1.06 ============================== PROCESS INITIAL CLAUSES =============== 0.76/1.06 0.76/1.06 ============================== PREDICATE ELIMINATION ================= 0.76/1.06 0.76/1.06 ============================== end predicate elimination ============= 0.76/1.06 0.76/1.06 Auto_denials: (non-Horn, no changes). 0.76/1.06 0.76/1.06 Term ordering decisions: 0.76/1.06 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.76/1.06 0.76/1.06 ============================== end of process initial clauses ======== 0.76/1.06 0.76/1.06 ============================== CLAUSES FOR SEARCH ==================== 163.36/163.67 163.36/163.67 ============================== end of clauses for search ============= 163.36/163.67 163.36/163.67 ============================== SEARCH ================================ 163.36/163.67 163.36/163.67 % Starting search at 0.04 seconds. 163.36/163.67 163.36/163.67 Low Water (keep): wt=55.000, iters=3355 163.36/163.67 163.36/163.67 Low Water (keep): wt=34.000, iters=3402 163.36/163.67 163.36/163.67 Low Water (keep): wt=33.000, iters=3389 163.36/163.67 163.36/163.67 Low Water (keep): wt=25.000, iters=3338 163.36/163.67 163.36/163.67 Low Water (keep): wt=23.000, iters=3425 163.36/163.67 163.36/163.67 Low Water (keep): wt=22.000, iters=3383 163.36/163.67 163.36/163.67 Low Water (keep): wt=21.000, iters=3402 163.36/163.67 163.36/163.67 Low Water (keep): wt=19.000, iters=3366 163.36/163.67 163.36/163.67 Low Water (keep): wt=18.000, iters=3398 163.36/163.67 163.36/163.67 Low Water (keep): wt=17.000, iters=3345 163.36/163.67 163.36/163.67 Low Water (keep): wt=16.000, iters=3333 163.36/163.67 163.36/163.67 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 416 (0.00 of 2.24 sec). 163.36/163.67 % back CAC tautology: 17597 equiv(not(A),B) = equiv(B,not(A)). [back_rewrite(280),rewrite([17041(4),279(4)])]. 163.36/163.67 % back CAC tautology: 17506 equiv(possibly(necessarily(not(A))),B) = equiv(B,possibly(necessarily(not(A)))). [back_rewrite(2708),rewrite([17041(8),2594(8)])]. 163.36/163.67 % back CAC tautology: 17504 equiv(implies(A,necessarily(not(B))),C) = equiv(C,implies(A,necessarily(not(B)))). [back_rewrite(2710),rewrite([17041(8),2597(8)])]. 163.36/163.67 % back CAC tautology: 17503 equiv(implies(A,and(B,not(C))),D) = equiv(D,implies(A,and(B,not(C)))). [back_rewrite(2711),rewrite([17041(8),2599(8)])]. 163.36/163.67 % back CAC tautology: 17176 equiv(necessarily(not(A)),possibly(A)) = equiv(possibly(A),necessarily(not(A))). [back_rewrite(13390),rewrite([17041(7),13389(7)]),flip(a)]. 163.36/163.67 163.36/163.67 Low Water (displace): id=21011, wt=48.000 163.36/163.67 163.36/163.67 Low Water (displace): id=21017, wt=41.000 163.36/163.67 163.36/163.67 Low Water (displace): id=21015, wt=40.000 163.36/163.67 163.36/163.67 Low Water (displace): id=17845, wt=37.000 163.36/163.67 163.36/163.67 Low Water (displace): id=21022, wt=36.000 163.36/163.67 163.36/163.67 Low Water (displace): id=21039, wt=33.000 163.36/163.67 163.36/163.67 Low Water (displace): id=26841, wt=17.000 163.36/163.67 163.36/163.67 Low Water (displace): id=26962, wt=16.000 163.36/163.67 163.36/163.67 Low Water (displace): id=27460, wt=15.000 163.36/163.67 163.36/163.67 Low Water (displace): id=27845, wt=14.000 163.36/163.67 163.36/163.67 Low Water (displace): id=31262, wt=10.000 163.36/163.67 163.36/163.67 Low Water (keep): wt=15.000, iters=3341 163.36/163.67 163.36/163.67 Low Water (displace): id=45601, wt=8.000 163.36/163.67 163.36/163.67 Low Water (keep): wt=14.000, iters=3333 163.36/163.67 163.36/163.67 Low Water (keep): wt=13.000, iters=3333 163.36/163.67 163.36/163.67 Low Water (keep): wt=12.000, iters=3824 163.36/163.67 163.36/163.67 ============================== PROOF ================================= 163.36/163.67 % SZS status Theorem 163.36/163.67 % SZS output start Refutation 163.36/163.67 163.36/163.67 % Proof 1 at 157.95 (+ 4.69) seconds. 163.36/163.67 % Length of proof is 245. 163.36/163.67 % Level of proof is 51. 163.36/163.67 % Maximum clause weight is 17.000. 163.36/163.67 % Given clauses 24982. 163.36/163.67 163.36/163.67 3 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]. 163.36/163.67 8 (all X all Y is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y))))) <-> equivalence_3 # label(equivalence_3) # label(axiom) # label(non_clause). [assumption]. 163.36/163.67 28 op_or -> (all X all Y or(X,Y) = not(and(not(X),not(Y)))) # label(op_or) # label(axiom) # label(non_clause). [assumption]. 163.36/163.67 29 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]. 163.36/163.67 31 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]. 163.36/163.67 32 (all X all Y all Z is_a_theorem(strict_implies(and(strict_implies(X,Y),strict_implies(Y,Z)),strict_implies(X,Z)))) <-> axiom_m5 # label(axiom_m5) # label(axiom) # label(non_clause). [assumption]. 163.36/163.67 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]. 163.36/163.67 38 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]. 163.36/163.67 39 (all X all Y (is_a_theorem(strict_equiv(X,Y)) -> X = Y)) <-> substitution_strict_equiv # label(substitution_strict_equiv) # label(axiom) # label(non_clause). [assumption]. 163.36/163.67 47 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]. 163.36/163.67 49 (all X is_a_theorem(strict_implies(X,and(X,X)))) <-> axiom_m4 # label(axiom_m4) # label(axiom) # label(non_clause). [assumption]. 163.36/163.67 52 axiom_m2 <-> (all X all Y is_a_theorem(strict_implies(and(X,Y),X))) # label(axiom_m2) # label(axiom) # label(non_clause). [assumption]. 163.36/163.67 54 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]. 163.36/163.67 56 op_strict_equiv -> (all X all Y and(strict_implies(X,Y),strict_implies(Y,X)) = strict_equiv(X,Y)) # label(op_strict_equiv) # label(axiom) # label(non_clause). [assumption]. 163.36/163.67 57 op_strict_implies -> (all X all Y necessarily(implies(X,Y)) = strict_implies(X,Y)) # label(op_strict_implies) # label(axiom) # label(non_clause). [assumption]. 163.36/163.67 63 -substitution_of_equivalents | -is_a_theorem(equiv(A,B)) | B = A # label(substitution_of_equivalents) # label(axiom). [clausify(3)]. 163.36/163.67 74 -is_a_theorem(implies(implies(c19,c20),implies(implies(c20,c19),equiv(c19,c20)))) | equivalence_3 # label(equivalence_3) # label(axiom). [clausify(8)]. 163.36/163.67 115 -op_or | not(and(not(A),not(B))) = or(A,B) # label(op_or) # label(axiom). [clausify(28)]. 163.36/163.67 116 -op_equiv | equiv(A,B) = and(implies(A,B),implies(B,A)) # label(op_equiv) # label(axiom). [clausify(29)]. 163.36/163.67 117 -op_equiv | and(implies(A,B),implies(B,A)) = equiv(A,B). [copy(116),flip(b)]. 163.36/163.67 119 -op_implies_and | not(and(A,not(B))) = implies(A,B) # label(op_implies_and) # label(axiom). [clausify(31)]. 163.36/163.67 121 is_a_theorem(strict_implies(and(strict_implies(A,B),strict_implies(B,C)),strict_implies(A,C))) | -axiom_m5 # label(axiom_m5) # label(axiom). [clausify(32)]. 163.36/163.67 124 -adjunction | -is_a_theorem(A) | -is_a_theorem(B) | is_a_theorem(and(A,B)) # label(adjunction) # label(axiom). [clausify(34)]. 163.36/163.67 134 -axiom_m1 | is_a_theorem(strict_implies(and(A,B),and(B,A))) # label(axiom_m1) # label(axiom). [clausify(38)]. 163.36/163.67 138 -is_a_theorem(strict_equiv(A,B)) | B = A | -substitution_strict_equiv # label(substitution_strict_equiv) # label(axiom). [clausify(39)]. 163.36/163.67 154 -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(47)]. 163.36/163.67 161 is_a_theorem(strict_implies(A,and(A,A))) | -axiom_m4 # label(axiom_m4) # label(axiom). [clausify(49)]. 163.36/163.67 166 -axiom_m2 | is_a_theorem(strict_implies(and(A,B),A)) # label(axiom_m2) # label(axiom). [clausify(52)]. 163.36/163.67 170 -axiom_m3 | is_a_theorem(strict_implies(and(and(A,B),C),and(A,and(B,C)))) # label(axiom_m3) # label(axiom). [clausify(54)]. 163.36/163.67 174 -op_strict_equiv | strict_equiv(A,B) = and(strict_implies(A,B),strict_implies(B,A)) # label(op_strict_equiv) # label(axiom). [clausify(56)]. 163.36/163.67 175 -op_strict_equiv | and(strict_implies(A,B),strict_implies(B,A)) = strict_equiv(A,B). [copy(174),flip(b)]. 163.36/163.67 176 -op_strict_implies | necessarily(implies(A,B)) = strict_implies(A,B) # label(op_strict_implies) # label(axiom). [clausify(57)]. 163.36/163.67 179 axiom_m5 # label(s1_0_axiom_m5) # label(axiom). [assumption]. 163.36/163.67 180 op_strict_implies # label(s1_0_op_strict_implies) # label(axiom). [assumption]. 163.36/163.67 181 axiom_m3 # label(s1_0_axiom_m3) # label(axiom). [assumption]. 163.36/163.67 183 op_strict_equiv # label(s1_0_op_strict_equiv) # label(axiom). [assumption]. 163.36/163.67 184 axiom_m2 # label(s1_0_axiom_m2) # label(axiom). [assumption]. 163.36/163.67 185 axiom_m4 # label(s1_0_axiom_m4) # label(axiom). [assumption]. 163.36/163.67 186 axiom_m1 # label(s1_0_axiom_m1) # label(axiom). [assumption]. 163.36/163.67 188 op_equiv # label(s1_0_op_equiv) # label(axiom). [assumption]. 163.36/163.67 189 adjunction # label(s1_0_adjunction) # label(axiom). [assumption]. 163.36/163.67 190 modus_ponens_strict_implies # label(s1_0_modus_ponens_strict_implies) # label(axiom). [assumption]. 163.36/163.67 191 op_or # label(s1_0_op_or) # label(axiom). [assumption]. 163.36/163.67 192 substitution_strict_equiv # label(s1_0_substitution_strict_equiv) # label(axiom). [assumption]. 163.36/163.67 193 op_implies_and # label(hilbert_op_implies_and) # label(axiom). [assumption]. 163.36/163.67 194 substitution_of_equivalents # label(substitution_of_equivalents) # label(axiom). [assumption]. 163.36/163.67 195 -equivalence_3 # label(hilbert_equivalence_3) # label(negated_conjecture). [assumption]. 163.36/163.67 197 is_a_theorem(strict_implies(and(strict_implies(A,B),strict_implies(B,C)),strict_implies(A,C))). [back_unit_del(121),unit_del(b,179)]. 163.36/163.67 198 necessarily(implies(A,B)) = strict_implies(A,B). [back_unit_del(176),unit_del(a,180)]. 163.36/163.67 199 is_a_theorem(strict_implies(and(and(A,B),C),and(A,and(B,C)))). [back_unit_del(170),unit_del(a,181)]. 163.36/163.67 201 and(strict_implies(A,B),strict_implies(B,A)) = strict_equiv(A,B). [back_unit_del(175),unit_del(a,183)]. 163.36/163.67 202 is_a_theorem(strict_implies(and(A,B),A)). [back_unit_del(166),unit_del(a,184)]. 163.36/163.67 203 is_a_theorem(strict_implies(A,and(A,A))). [back_unit_del(161),unit_del(b,185)]. 163.36/163.67 204 is_a_theorem(strict_implies(and(A,B),and(B,A))). [back_unit_del(134),unit_del(a,186)]. 163.36/163.67 205 and(implies(A,B),implies(B,A)) = equiv(A,B). [back_unit_del(117),unit_del(a,188)]. 163.36/163.67 206 -is_a_theorem(A) | -is_a_theorem(B) | is_a_theorem(and(A,B)). [back_unit_del(124),unit_del(a,189)]. 163.36/163.67 207 -is_a_theorem(A) | -is_a_theorem(strict_implies(A,B)) | is_a_theorem(B). [back_unit_del(154),unit_del(a,190)]. 163.36/163.67 208 not(and(not(A),not(B))) = or(A,B). [back_unit_del(115),unit_del(a,191)]. 163.36/163.67 209 -is_a_theorem(strict_equiv(A,B)) | B = A. [back_unit_del(138),unit_del(c,192)]. 163.36/163.67 210 not(and(A,not(B))) = implies(A,B). [back_unit_del(119),unit_del(a,193)]. 163.36/163.67 211 -is_a_theorem(equiv(A,B)) | B = A. [back_unit_del(63),unit_del(a,194)]. 163.36/163.67 212 -is_a_theorem(implies(implies(c19,c20),implies(implies(c20,c19),equiv(c19,c20)))). [back_unit_del(74),unit_del(b,195)]. 163.36/163.67 217 implies(not(A),B) = or(A,B). [back_rewrite(208),rewrite([210(4)])]. 163.36/163.67 253 -is_a_theorem(A) | is_a_theorem(and(strict_implies(and(B,C),and(C,B)),A)). [resolve(206,a,204,a)]. 163.36/163.67 254 -is_a_theorem(A) | is_a_theorem(and(strict_implies(B,and(B,B)),A)). [resolve(206,a,203,a)]. 163.36/163.67 263 -is_a_theorem(A) | is_a_theorem(and(A,strict_implies(and(B,C),B))). [resolve(206,b,202,a)]. 163.36/163.67 272 -is_a_theorem(and(strict_implies(A,B),strict_implies(B,C))) | is_a_theorem(strict_implies(A,C)). [resolve(207,b,197,a)]. 163.36/163.67 275 not(and(A,implies(B,C))) = implies(A,and(B,not(C))). [para(210(a,1),210(a,1,1,2))]. 163.36/163.67 277 necessarily(or(A,B)) = strict_implies(not(A),B). [para(217(a,1),198(a,1,1))]. 163.36/163.67 279 and(or(A,B),implies(B,not(A))) = equiv(not(A),B). [para(217(a,1),205(a,1,1))]. 163.36/163.67 280 and(implies(A,not(B)),or(B,A)) = equiv(A,not(B)). [para(217(a,1),205(a,1,2))]. 163.36/163.67 281 or(and(A,not(B)),C) = implies(implies(A,B),C). [para(210(a,1),217(a,1,1)),flip(a)]. 163.36/163.67 1024 is_a_theorem(and(strict_implies(and(A,B),and(B,A)),strict_implies(and(C,D),and(D,C)))). [resolve(253,a,204,a)]. 163.36/163.67 1136 is_a_theorem(and(strict_implies(A,and(A,A)),strict_implies(and(B,C),B))). [resolve(254,a,202,a)]. 163.36/163.67 2586 implies(implies(A,B),and(B,not(A))) = not(equiv(A,B)). [para(205(a,1),275(a,1,1)),flip(a)]. 163.36/163.67 2588 implies(A,and(not(B),not(C))) = not(and(A,or(B,C))). [para(217(a,1),275(a,1,1,2)),flip(a)]. 163.36/163.67 2593 and(or(A,not(B)),or(B,not(A))) = equiv(not(A),not(B)). [para(217(a,1),279(a,1,2))]. 163.36/163.67 9787 is_a_theorem(strict_implies(A,A)). [resolve(1136,a,272,a)]. 163.36/163.67 9793 is_a_theorem(strict_equiv(A,and(A,A))). [para(201(a,1),1136(a,1))]. 163.36/163.67 9869 is_a_theorem(and(strict_implies(A,A),strict_implies(and(B,C),B))). [resolve(9787,a,263,a)]. 163.36/163.67 9876 is_a_theorem(and(strict_implies(A,and(A,A)),strict_implies(B,B))). [resolve(9787,a,254,a)]. 163.36/163.67 9878 -is_a_theorem(A) | is_a_theorem(and(A,strict_implies(B,B))). [resolve(9787,a,206,b)]. 163.36/163.67 10049 and(A,A) = A. [resolve(9793,a,209,a)]. 163.36/163.67 10055 is_a_theorem(and(strict_implies(A,A),strict_implies(B,B))). [back_rewrite(9876),rewrite([10049(1)])]. 163.36/163.67 10567 is_a_theorem(strict_implies(and(A,B),and(A,and(A,B)))). [para(10049(a,1),199(a,1,1,1))]. 163.36/163.67 10570 strict_equiv(A,A) = strict_implies(A,A). [para(10049(a,1),201(a,1)),flip(a)]. 163.36/163.67 10572 not(not(A)) = or(A,A). [para(10049(a,1),210(a,1,1)),rewrite([217(4)])]. 163.36/163.67 10585 implies(or(A,A),B) = or(not(A),B). [para(10049(a,1),281(a,1,1)),rewrite([217(4)]),flip(a)]. 163.36/163.67 10985 strict_implies(not(not(A)),B) = strict_implies(or(A,A),B). [para(10572(a,1),277(a,2,1)),rewrite([277(3)])]. 163.36/163.67 10996 equiv(not(not(A)),B) = equiv(or(A,A),B). [para(10572(a,1),279(a,2,1)),rewrite([279(6)])]. 163.36/163.67 10999 equiv(A,not(not(B))) = equiv(A,or(B,B)). [para(10572(a,1),280(a,2,2)),rewrite([280(6)])]. 163.36/163.67 11003 not(not(not(A))) = not(or(A,A)). [para(10572(a,1),10572(a,1,1)),rewrite([10572(5,R)]),flip(a)]. 163.36/163.67 11214 is_a_theorem(and(and(strict_implies(A,A),strict_implies(B,B)),strict_implies(C,C))). [resolve(10055,a,9878,a)]. 163.36/163.67 11267 -is_a_theorem(A) | is_a_theorem(and(A,and(strict_implies(B,B),strict_implies(C,C)))). [resolve(10055,a,206,b)]. 163.36/163.67 12186 implies(A,not(not(B))) = implies(A,or(B,B)). [para(11003(a,1),210(a,1,1,2)),rewrite([210(4)]),flip(a)]. 163.36/163.67 12187 or(not(not(A)),B) = or(or(A,A),B). [para(11003(a,1),217(a,1,1)),rewrite([217(3)]),flip(a)]. 163.36/163.67 12217 not(not(not(not(not(A))))) = not(not(not(or(A,A)))). [para(11003(a,1),11003(a,1,1,1)),rewrite([10572(9,R)]),flip(a)]. 163.36/163.67 15904 -is_a_theorem(or(A,A)) | -is_a_theorem(strict_implies(not(not(A)),B)) | is_a_theorem(B). [para(10985(a,2),207(b,1))]. 163.36/163.67 16281 equiv(not(not(A)),or(B,B)) = equiv(or(A,A),not(not(B))). [para(10999(a,1),10996(a,1))]. 163.36/163.67 16302 strict_implies(A,not(not(B))) = strict_implies(A,or(B,B)). [para(12186(a,1),198(a,1,1)),rewrite([198(3)]),flip(a)]. 163.36/163.67 16303 or(A,not(not(B))) = or(A,or(B,B)). [para(12186(a,1),217(a,1)),rewrite([217(3)]),flip(a)]. 163.36/163.67 16396 -is_a_theorem(A) | -is_a_theorem(strict_implies(A,or(B,B))) | is_a_theorem(not(not(B))). [para(16302(a,1),207(b,1))]. 163.36/163.67 16466 or(not(not(A)),or(B,B)) = or(or(A,A),not(not(B))). [para(16303(a,1),12187(a,1))]. 163.36/163.67 16467 or(not(not(A)),not(not(B))) = or(or(A,A),or(B,B)). [para(16303(a,1),12187(a,2))]. 163.36/163.67 17014 is_a_theorem(strict_equiv(and(A,B),and(B,A))). [para(201(a,1),1024(a,1))]. 163.36/163.67 17041 and(A,B) = and(B,A). [resolve(17014,a,209,a)]. 163.36/163.67 17597 equiv(not(A),B) = equiv(B,not(A)). [back_rewrite(280),rewrite([17041(4),279(4)])]. 163.36/163.67 17607 is_a_theorem(strict_implies(and(A,and(B,C)),and(B,and(C,A)))). [back_rewrite(199),rewrite([17041(2)])]. 163.36/163.67 17743 and(or(A,B),implies(B,not(A))) = equiv(B,not(A)). [back_rewrite(279),rewrite([17597(6)])]. 163.36/163.67 17745 strict_equiv(A,B) = strict_equiv(B,A). [para(17041(a,1),201(a,1)),rewrite([201(3)])]. 163.36/163.67 17746 is_a_theorem(strict_implies(and(A,B),B)). [para(17041(a,1),202(a,1,1))]. 163.36/163.67 17747 equiv(A,B) = equiv(B,A). [para(17041(a,1),205(a,1)),rewrite([205(3)])]. 163.36/163.67 17751 -is_a_theorem(and(strict_implies(A,B),strict_implies(C,A))) | is_a_theorem(strict_implies(C,B)). [para(17041(a,1),272(a,1))]. 163.36/163.67 17762 is_a_theorem(strict_implies(and(A,B),and(B,and(A,B)))). [para(17041(a,1),10567(a,1,1)),rewrite([17041(2)])]. 163.36/163.67 17984 -is_a_theorem(A) | is_a_theorem(and(A,strict_implies(and(B,C),C))). [resolve(17746,a,206,b)]. 163.36/163.67 18010 -is_a_theorem(strict_equiv(A,B)) | A = B. [para(17745(a,1),209(a,1))]. 163.36/163.67 18018 -is_a_theorem(equiv(A,B)) | A = B. [para(17747(a,1),211(a,1))]. 163.36/163.67 18670 is_a_theorem(and(strict_implies(and(A,B),and(B,and(A,B))),strict_implies(and(C,D),D))). [resolve(17984,a,17762,a)]. 163.36/163.67 21162 -is_a_theorem(A) | is_a_theorem(and(A,and(and(strict_implies(B,B),strict_implies(C,C)),strict_implies(D,D)))). [resolve(11214,a,206,b)]. 163.36/163.67 21249 is_a_theorem(and(and(strict_implies(A,A),strict_implies(B,B)),and(strict_implies(C,C),strict_implies(D,D)))). [resolve(11267,a,10055,a)]. 163.36/163.67 22802 is_a_theorem(strict_implies(and(A,and(B,C)),and(C,and(A,B)))). [para(17041(a,1),17607(a,1,1,2)),rewrite([17041(3)])]. 163.36/163.67 24238 not(and(not(A),or(B,C))) = or(A,and(not(B),not(C))). [para(2588(a,1),217(a,1))]. 163.36/163.67 24250 not(and(A,or(B,C))) = not(and(A,or(C,B))). [para(17041(a,1),2588(a,1,2)),rewrite([2588(4)])]. 163.36/163.67 25899 not(and(or(A,B),or(B,A))) = not(or(A,B)). [para(10049(a,1),24250(a,1,1)),flip(a)]. 163.36/163.67 26478 not(or(A,B)) = not(or(B,A)). [para(17041(a,1),25899(a,1,1)),rewrite([25899(4)])]. 163.36/163.67 26483 implies(A,or(B,C)) = implies(A,or(C,B)). [para(26478(a,1),210(a,1,1,2)),rewrite([210(4)])]. 163.36/163.67 26512 strict_implies(A,or(B,C)) = strict_implies(A,or(C,B)). [para(26483(a,1),198(a,1,1)),rewrite([198(3)])]. 163.36/163.67 26758 and(strict_implies(A,or(B,C)),strict_implies(or(C,B),A)) = strict_equiv(A,or(C,B)). [para(26512(a,1),201(a,1,1))]. 163.36/163.67 30126 or(A,and(not(B),not(C))) = implies(or(B,C),A). [para(17041(a,1),24238(a,1,1)),rewrite([210(4)]),flip(a)]. 163.36/163.67 30137 or(not(A),B) = or(B,not(A)). [para(10049(a,1),30126(a,1,2)),rewrite([10585(4)]),flip(a)]. 163.36/163.67 30141 implies(or(A,B),C) = implies(or(B,A),C). [para(17041(a,1),30126(a,1,2)),rewrite([30126(4)])]. 163.36/163.67 30187 implies(or(A,A),B) = or(B,not(A)). [back_rewrite(10585),rewrite([30137(4)])]. 163.36/163.67 30193 strict_implies(not(not(A)),B) = strict_implies(not(B),not(A)). [para(30137(a,1),277(a,1,1)),rewrite([277(3)]),flip(a)]. 163.36/163.67 30196 or(not(A),not(not(B))) = or(or(B,B),not(A)). [para(30137(a,1),16303(a,2))]. 163.36/163.67 30227 or(not(not(A)),not(not(B))) = or(or(B,B),or(A,A)). [para(30137(a,1),16467(a,1))]. 163.36/163.67 30282 -is_a_theorem(or(A,A)) | -is_a_theorem(strict_implies(not(B),not(A))) | is_a_theorem(B). [back_rewrite(15904),rewrite([30193(5)])]. 163.36/163.67 30287 strict_implies(not(A),not(B)) = strict_implies(or(B,B),A). [back_rewrite(10985),rewrite([30193(3)])]. 163.36/163.67 30341 strict_implies(or(A,B),C) = strict_implies(or(B,A),C). [para(30141(a,1),198(a,1,1)),rewrite([198(3)])]. 163.36/163.67 30343 strict_equiv(A,or(B,C)) = strict_equiv(A,or(C,B)). [back_rewrite(26758),rewrite([30341(4),201(5)])]. 163.36/163.67 30444 is_a_theorem(strict_implies(or(A,A),A)). [para(30287(a,1),9787(a,1))]. 163.36/163.67 30448 strict_implies(or(A,A),not(B)) = strict_implies(or(B,B),not(A)). [para(10572(a,1),30287(a,1,1))]. 163.36/163.67 30449 is_a_theorem(and(strict_implies(or(A,A),A),strict_implies(B,B))). [para(30287(a,1),10055(a,1,1))]. 163.36/163.67 30456 is_a_theorem(and(strict_implies(or(A,A),A),strict_implies(and(B,C),B))). [para(30287(a,1),9869(a,1,1))]. 163.36/163.67 30859 is_a_theorem(and(strict_implies(or(A,A),A),strict_implies(or(B,B),B))). [para(30287(a,1),30449(a,1,2))]. 163.36/163.67 30964 -is_a_theorem(strict_equiv(A,or(B,C))) | or(C,B) = A. [para(30343(a,1),209(a,1))]. 163.36/163.67 30966 strict_equiv(A,not(not(B))) = strict_equiv(A,or(B,B)). [para(10572(a,2),30343(a,1,2))]. 163.36/163.67 30993 or(A,B) = or(B,A). [para(10570(a,1),30964(a,1)),unit_del(a,9787)]. 163.36/163.67 30994 -is_a_theorem(strict_equiv(A,not(not(B)))) | or(B,B) = A. [para(10572(a,2),30964(a,1,2))]. 163.36/163.67 31014 or(A,and(B,not(C))) = implies(implies(B,C),A). [back_rewrite(281),rewrite([30993(3)])]. 163.36/163.67 31018 strict_implies(not(A),B) = strict_implies(not(B),A). [para(30993(a,1),277(a,1,1)),rewrite([277(2)])]. 163.36/163.67 31019 and(or(A,B),implies(A,not(B))) = equiv(A,not(B)). [para(30993(a,1),17743(a,1,1))]. 163.36/163.67 31040 and(strict_implies(A,not(B)),strict_implies(not(A),B)) = strict_equiv(A,not(B)). [para(31018(a,1),201(a,1,1)),rewrite([17041(5),17745(7)])]. 163.36/163.67 31042 -is_a_theorem(and(strict_implies(not(A),B),strict_implies(A,C))) | is_a_theorem(strict_implies(not(B),C)). [para(31018(a,1),272(a,1,1))]. 163.36/163.67 31100 strict_equiv(A,not(not(not(B)))) = strict_equiv(A,not(or(B,B))). [para(10572(a,1),30966(a,1,2,1)),rewrite([10572(6,R)]),flip(a)]. 163.36/163.67 31138 is_a_theorem(strict_implies(not(A),not(and(A,B)))). [resolve(30456,a,272,a),rewrite([10572(3,R),31018(4)])]. 163.36/163.67 31218 -is_a_theorem(not(A)) | is_a_theorem(not(and(A,B))). [resolve(31138,a,207,b)]. 163.36/163.67 31225 is_a_theorem(strict_implies(not(A),implies(A,B))). [para(210(a,1),31138(a,1,2))]. 163.36/163.67 31305 -is_a_theorem(A) | is_a_theorem(and(A,strict_implies(not(B),implies(B,C)))). [resolve(31225,a,206,b)]. 163.36/163.67 31488 -is_a_theorem(not(not(not(not(not(A)))))) | is_a_theorem(implies(B,not(or(A,A)))). [para(12217(a,2),31218(a,1)),rewrite([17041(10),210(11)])]. 163.36/163.67 32367 is_a_theorem(and(strict_implies(or(A,A),A),strict_implies(not(B),implies(B,C)))). [resolve(31305,a,30444,a)]. 163.36/163.67 32375 is_a_theorem(and(strict_implies(and(A,B),B),strict_implies(not(C),implies(C,D)))). [resolve(31305,a,17746,a)]. 163.36/163.67 32875 is_a_theorem(strict_implies(not(A),not(or(A,A)))). [resolve(30859,a,17751,a),rewrite([10572(3,R),31018(4)])]. 163.36/163.67 32916 is_a_theorem(strict_implies(not(A),not(not(not(A))))). [para(10572(a,2),32875(a,1,2,1))]. 163.36/163.67 33062 is_a_theorem(and(strict_implies(not(A),not(not(not(A)))),strict_implies(B,B))). [resolve(32916,a,9878,a)]. 163.36/163.67 36299 -is_a_theorem(strict_equiv(A,not(not(not(B))))) | not(or(B,B)) = A. [para(31100(a,2),209(a,1))]. 163.36/163.67 36420 is_a_theorem(strict_implies(not(not(not(A))),implies(A,B))). [resolve(32367,a,272,a),rewrite([10572(3,R)])]. 163.36/163.67 36431 -is_a_theorem(not(not(not(A)))) | is_a_theorem(implies(A,B)). [resolve(36420,a,207,b)]. 163.36/163.67 36462 -is_a_theorem(not(not(not(or(A,A))))) | is_a_theorem(or(B,not(A))). [para(11003(a,1),36431(a,1,1,1)),rewrite([217(8),30993(7)])]. 163.36/163.67 36766 is_a_theorem(and(strict_implies(not(A),implies(A,B)),strict_implies(and(C,D),D))). [para(17041(a,1),32375(a,1))]. 163.36/163.67 40248 is_a_theorem(strict_equiv(not(A),not(not(not(A))))). [para(31040(a,1),33062(a,1))]. 163.36/163.67 40621 not(or(A,A)) = not(A). [resolve(40248,a,36299,a)]. 163.36/163.67 40627 not(not(not(A))) = not(A). [resolve(40248,a,30994,a),rewrite([10572(3,R)])]. 163.36/163.67 40725 -is_a_theorem(not(A)) | is_a_theorem(or(B,not(A))). [back_rewrite(36462),rewrite([40621(2),40627(3)])]. 163.36/163.67 40824 -is_a_theorem(not(A)) | is_a_theorem(implies(B,not(A))). [back_rewrite(31488),rewrite([40627(3),40627(3),40621(4)])]. 163.36/163.67 41242 implies(A,or(B,B)) = implies(A,B). [para(40621(a,1),210(a,1,1,2)),rewrite([210(3)]),flip(a)]. 163.36/163.67 41244 or(A,or(B,B)) = or(B,A). [para(40621(a,1),217(a,1,1)),rewrite([217(2),30993(3)]),flip(a)]. 163.36/163.67 41281 or(not(not(A)),not(not(B))) = or(B,not(not(A))). [para(40621(a,1),16466(a,1,1,1)),rewrite([41244(4),10572(6,R),40621(5)]),flip(a)]. 163.36/163.67 41418 implies(A,not(not(B))) = implies(A,B). [back_rewrite(12186),rewrite([41242(5)])]. 163.36/163.67 41489 or(A,not(not(B))) = or(B,A). [back_rewrite(30227),rewrite([41281(5),41244(6),41244(5),30993(4)])]. 163.36/163.67 41627 or(or(A,A),not(B)) = or(A,not(B)). [back_rewrite(30196),rewrite([41489(4)]),flip(a)]. 163.36/163.67 41781 -is_a_theorem(implies(A,B)) | is_a_theorem(implies(C,implies(A,B))). [para(210(a,1),40824(a,1)),rewrite([210(5)])]. 163.36/163.67 41857 strict_implies(A,or(B,B)) = strict_implies(A,B). [para(41242(a,1),198(a,1,1)),rewrite([198(2)]),flip(a)]. 163.36/163.67 41926 -is_a_theorem(A) | -is_a_theorem(strict_implies(A,B)) | is_a_theorem(not(not(B))). [back_rewrite(16396),rewrite([41857(3)])]. 163.36/163.67 41927 strict_implies(A,not(not(B))) = strict_implies(A,B). [back_rewrite(16302),rewrite([41857(5)])]. 163.36/163.67 42794 -is_a_theorem(A) | is_a_theorem(not(not(A))). [resolve(41926,b,9787,a)]. 163.36/163.67 43545 is_a_theorem(not(not(strict_implies(A,A)))). [resolve(42794,a,9787,a)]. 163.36/163.67 43622 is_a_theorem(not(not(strict_implies(and(A,B),A)))). [resolve(42794,a,202,a)]. 163.36/163.67 44192 is_a_theorem(implies(A,strict_implies(B,B))). [resolve(43545,a,40824,a),rewrite([41418(4)])]. 163.36/163.67 44198 is_a_theorem(or(A,strict_implies(B,B))). [resolve(43545,a,40725,a),rewrite([41489(4),30993(2)])]. 163.36/163.67 44347 is_a_theorem(implies(A,implies(B,strict_implies(C,C)))). [resolve(44192,a,41781,a)]. 163.36/163.67 44387 -is_a_theorem(A) | is_a_theorem(and(A,implies(B,strict_implies(C,C)))). [resolve(44192,a,206,b)]. 163.36/163.67 44406 -is_a_theorem(strict_implies(not(A),not(strict_implies(B,B)))) | is_a_theorem(A). [resolve(44198,a,30282,a)]. 163.36/163.67 45267 is_a_theorem(implies(A,strict_implies(and(B,C),B))). [resolve(43622,a,40824,a),rewrite([41418(5)])]. 163.36/163.67 46003 is_a_theorem(and(implies(A,strict_implies(and(B,C),B)),strict_implies(D,D))). [resolve(45267,a,9878,a)]. 163.36/163.67 46552 is_a_theorem(strict_equiv(and(A,B),and(B,and(A,B)))). [para(201(a,1),18670(a,1))]. 163.36/163.67 51686 is_a_theorem(and(implies(A,strict_implies(B,B)),implies(C,strict_implies(D,D)))). [resolve(44387,a,44192,a)]. 163.36/163.67 53278 and(A,and(B,A)) = and(B,A). [resolve(46552,a,18010,a),flip(a)]. 163.36/163.67 55974 equiv(or(A,A),not(not(B))) = equiv(not(A),not(B)). [para(41627(a,1),31019(a,1,1)),rewrite([41418(6),30187(4),2593(5)]),flip(a)]. 163.36/163.67 55984 equiv(not(not(A)),or(B,B)) = equiv(not(A),not(B)). [back_rewrite(16281),rewrite([55974(8)])]. 163.36/163.67 59588 is_a_theorem(strict_implies(not(A),implies(and(B,A),C))). [resolve(31042,a,36766,a),rewrite([31018(4)])]. 163.36/163.67 62173 is_a_theorem(and(strict_implies(A,A),implies(B,strict_implies(and(C,D),C)))). [para(17041(a,1),46003(a,1))]. 163.36/163.67 62911 is_a_theorem(equiv(strict_implies(A,A),strict_implies(B,B))). [para(205(a,1),51686(a,1))]. 163.36/163.67 62913 strict_implies(A,A) = strict_implies(B,B). [resolve(62911,a,18018,a)]. 163.36/163.67 62921 strict_implies(A,A) = c_0. [new_symbol(62913)]. 163.36/163.67 62972 is_a_theorem(and(c_0,implies(A,strict_implies(and(B,C),B)))). [back_rewrite(62173),rewrite([62921(1)])]. 163.36/163.67 64452 -is_a_theorem(strict_implies(not(A),not(c_0))) | is_a_theorem(A). [back_rewrite(44406),rewrite([62921(2)])]. 163.36/163.67 64467 -is_a_theorem(A) | is_a_theorem(and(A,implies(B,c_0))). [back_rewrite(44387),rewrite([62921(2)])]. 163.36/163.67 64501 is_a_theorem(implies(A,implies(B,c_0))). [back_rewrite(44347),rewrite([62921(1)])]. 163.36/163.67 64782 is_a_theorem(c_0). [back_rewrite(21249),rewrite([62921(1),62921(2),10049(3),62921(2),62921(3),10049(4),10049(3)])]. 163.36/163.67 64785 -is_a_theorem(A) | is_a_theorem(and(A,c_0)). [back_rewrite(21162),rewrite([62921(2),62921(3),10049(4),62921(3),10049(4)])]. 163.36/163.67 65024 strict_equiv(A,not(not(A))) = c_0. [para(62921(a,1),31040(a,1,2)),rewrite([41927(3),62921(1),10049(3)]),flip(a)]. 163.36/163.67 65240 is_a_theorem(and(c_0,strict_implies(not(A),implies(and(A,B),C)))). [resolve(64785,a,59588,a),rewrite([17041(2),17041(6)])]. 163.36/163.67 65893 not(not(A)) = A. [para(65024(a,1),209(a,1)),unit_del(a,64782)]. 163.36/163.67 65898 or(A,A) = A. [para(65024(a,1),30994(a,1)),unit_del(a,64782)]. 163.36/163.67 65962 equiv(not(A),not(B)) = equiv(A,B). [back_rewrite(55984),rewrite([65893(2),65898(1)]),flip(a)]. 163.36/163.67 66132 strict_implies(A,not(B)) = strict_implies(B,not(A)). [back_rewrite(30448),rewrite([65898(1),65898(3)])]. 163.36/163.67 66134 or(A,not(B)) = implies(B,A). [back_rewrite(30187),rewrite([65898(1)]),flip(a)]. 163.36/163.67 66199 -is_a_theorem(strict_implies(c_0,A)) | is_a_theorem(A). [back_rewrite(64452),rewrite([66132(4),65893(3)])]. 163.36/163.67 66376 not(and(A,B)) = implies(A,not(B)). [para(65893(a,1),210(a,1,1,2))]. 163.36/163.67 66377 not(implies(A,B)) = and(A,not(B)). [para(210(a,1),65893(a,1,1))]. 163.36/163.67 68694 is_a_theorem(and(implies(A,implies(B,c_0)),implies(C,c_0))). [resolve(64467,a,64501,a)]. 163.36/163.67 70188 -is_a_theorem(equiv(A,B)) | not(A) = not(B). [para(65962(a,1),18018(a,1))]. 163.36/163.67 70233 implies(A,not(B)) = implies(B,not(A)). [para(17041(a,1),66376(a,1,1)),rewrite([66376(2)])]. 163.36/163.67 70234 implies(A,implies(B,not(A))) = implies(B,not(A)). [para(53278(a,1),66376(a,1,1)),rewrite([66376(2),66376(4)]),flip(a)]. 163.36/163.67 71923 is_a_theorem(equiv(c_0,implies(A,c_0))). [para(205(a,1),68694(a,1))]. 163.36/163.67 71951 implies(A,c_0) = c_0. [resolve(71923,a,18018,a),flip(a)]. 163.36/163.67 71958 and(c_0,implies(c_0,A)) = equiv(A,c_0). [para(71951(a,1),205(a,1,1))]. 163.36/163.67 72493 is_a_theorem(equiv(c_0,strict_implies(and(A,B),A))). [para(71958(a,1),62972(a,1)),rewrite([17747(4)])]. 163.36/163.67 72858 strict_implies(and(A,B),A) = c_0. [resolve(72493,a,18018,a),flip(a)]. 163.36/163.67 72866 strict_implies(and(A,B),B) = c_0. [para(17041(a,1),72858(a,1,1))]. 163.36/163.67 72875 -is_a_theorem(and(c_0,strict_implies(A,B))) | is_a_theorem(strict_implies(and(A,C),B)). [para(72866(a,1),272(a,1,1)),rewrite([17041(5)])]. 163.36/163.67 75828 implies(A,implies(A,B)) = implies(A,B). [para(217(a,1),70234(a,1,2)),rewrite([66134(2),70233(5),65893(4)])]. 163.36/163.67 75841 strict_implies(A,implies(A,B)) = strict_implies(A,B). [para(75828(a,1),198(a,1,1)),rewrite([198(2)]),flip(a)]. 163.36/163.67 75848 -is_a_theorem(strict_implies(c_0,A)) | is_a_theorem(implies(c_0,A)). [para(75841(a,1),66199(a,1))]. 163.36/163.67 75853 -is_a_theorem(strict_implies(A,not(c_0))) | is_a_theorem(implies(A,not(c_0))). [para(66132(a,1),75848(a,1)),rewrite([70233(7)])]. 163.36/163.67 83270 is_a_theorem(strict_implies(and(A,not(B)),implies(and(B,C),D))). [resolve(72875,a,65240,a),rewrite([17041(2)])]. 163.36/163.67 83363 is_a_theorem(strict_implies(and(A,not(A)),B)). [para(75841(a,1),83270(a,1))]. 163.36/163.67 83367 is_a_theorem(implies(c_0,implies(A,A))). [resolve(83363,a,75853,a),rewrite([70233(5),66376(4),65893(3)])]. 163.36/163.67 83613 is_a_theorem(equiv(c_0,implies(A,A))). [resolve(83367,a,64785,a),rewrite([17041(5),71958(5),17747(3)])]. 163.36/163.67 83847 and(A,not(A)) = not(c_0). [resolve(83613,a,70188,a),rewrite([66377(4)]),flip(a)]. 163.36/163.67 83884 and(implies(A,B),and(A,not(B))) = not(c_0). [para(66377(a,1),83847(a,1,2))]. 163.36/163.67 85207 is_a_theorem(strict_implies(c_0,implies(A,implies(implies(A,B),B)))). [para(83884(a,1),22802(a,1,2)),rewrite([66132(7),66376(6),66376(5),66377(4),217(5),31014(4)])]. 163.36/163.67 85211 is_a_theorem(implies(A,implies(implies(A,B),B))). [resolve(85207,a,66199,a)]. 163.36/163.67 85265 is_a_theorem(implies(implies(A,B),implies(implies(B,A),equiv(A,B)))). [para(2586(a,1),85211(a,1,2,1)),rewrite([217(6),31014(5)])]. 163.36/163.67 85266 $F. [resolve(85265,a,212,a)]. 163.36/163.67 163.36/163.67 % SZS output end Refutation 163.36/163.67 ============================== end of proof ========================== 163.36/163.67 163.36/163.67 ============================== STATISTICS ============================ 163.36/163.67 163.36/163.67 Given=24982. Generated=8441772. Kept=85203. proofs=1. 163.36/163.67 Usable=12521. Sos=5734. Demods=567. Limbo=33, Disabled=67049. Hints=0. 163.36/163.67 Megabytes=88.57. 163.36/163.67 User_CPU=157.95, System_CPU=4.69, Wall_clock=162. 163.36/163.67 163.36/163.67 ============================== end of statistics ===================== 163.36/163.67 163.36/163.67 ============================== end of search ========================= 163.36/163.67 163.36/163.67 THEOREM PROVED 163.36/163.67 % SZS status Theorem 163.36/163.67 163.36/163.67 Exiting with 1 proof. 163.36/163.67 163.36/163.67 Process 17125 exit (max_proofs) Thu Aug 29 16:27:59 2019 163.36/163.67 Prover9 interrupted 163.36/163.67 EOF