TSTP Solution File: LCL549+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL549+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:31 EDT 2022
% Result : Theorem 59.04s 59.34s
% Output : Refutation 59.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL549+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 3 17:39:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.78/1.05 ============================== Prover9 ===============================
% 0.78/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.78/1.05 Process 17179 was started by sandbox on n025.cluster.edu,
% 0.78/1.05 Sun Jul 3 17:39:41 2022
% 0.78/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17026_n025.cluster.edu".
% 0.78/1.05 ============================== end of head ===========================
% 0.78/1.05
% 0.78/1.05 ============================== INPUT =================================
% 0.78/1.05
% 0.78/1.05 % Reading from file /tmp/Prover9_17026_n025.cluster.edu
% 0.78/1.05
% 0.78/1.05 set(prolog_style_variables).
% 0.78/1.05 set(auto2).
% 0.78/1.05 % set(auto2) -> set(auto).
% 0.78/1.05 % set(auto) -> set(auto_inference).
% 0.78/1.05 % set(auto) -> set(auto_setup).
% 0.78/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.78/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.78/1.05 % set(auto) -> set(auto_limits).
% 0.78/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.78/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.78/1.05 % set(auto) -> set(auto_denials).
% 0.78/1.05 % set(auto) -> set(auto_process).
% 0.78/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.78/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.78/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.78/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.78/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.78/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.78/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.78/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.78/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.78/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.78/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.78/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.78/1.05 % set(auto2) -> assign(stats, some).
% 0.78/1.05 % set(auto2) -> clear(echo_input).
% 0.78/1.05 % set(auto2) -> set(quiet).
% 0.78/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.78/1.05 % set(auto2) -> clear(print_given).
% 0.78/1.05 assign(lrs_ticks,-1).
% 0.78/1.05 assign(sos_limit,10000).
% 0.78/1.05 assign(order,kbo).
% 0.78/1.05 set(lex_order_vars).
% 0.78/1.05 clear(print_given).
% 0.78/1.05
% 0.78/1.05 % formulas(sos). % not echoed (89 formulas)
% 0.78/1.05
% 0.78/1.05 ============================== end of input ==========================
% 0.78/1.05
% 0.78/1.05 % From the command line: assign(max_seconds, 300).
% 0.78/1.05
% 0.78/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.78/1.05
% 0.78/1.05 % Formulas that are not ordinary clauses:
% 0.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 16 kn1 <-> (all P is_a_theorem(implies(P,and(P,P)))) # label(kn1) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.05 17 kn2 <-> (all P all Q is_a_theorem(implies(and(P,Q),P))) # label(kn2) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.05 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.78/1.05 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.78/1.05 20 cn2 <-> (all P all Q is_a_theorem(implies(P,implies(not(P),Q)))) # label(cn2) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.05 21 cn3 <-> (all P is_a_theorem(implies(implies(not(P),P),P))) # label(cn3) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.05 22 r1 <-> (all P is_a_theorem(implies(or(P,P),P))) # label(r1) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.05 23 r2 <-> (all P all Q is_a_theorem(implies(Q,or(P,Q)))) # label(r2) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 32 necessitation <-> (all X (is_a_theorem(X) -> is_a_theorem(necessarily(X)))) # label(necessitation) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 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.78/1.05 37 axiom_M <-> (all X is_a_theorem(implies(necessarily(X),X))) # label(axiom_M) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.05 38 axiom_4 <-> (all X is_a_theorem(implies(necessarily(X),necessarily(necessarily(X))))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.05 39 axiom_B <-> (all X is_a_theorem(implies(X,necessarily(possibly(X))))) # label(axiom_B) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.05 40 axiom_5 <-> (all X is_a_theorem(implies(possibly(X),necessarily(possibly(X))))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.05 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.78/1.07 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.78/1.07 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.78/1.07 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.78/1.07 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.78/1.07 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.78/1.07 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.78/1.07 48 axiom_m4 <-> (all X is_a_theorem(strict_implies(X,and(X,X)))) # label(axiom_m4) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.07 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.78/1.07 50 axiom_m6 <-> (all X is_a_theorem(strict_implies(X,possibly(X)))) # label(axiom_m6) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.07 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.78/1.07 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.78/1.07 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.78/1.07 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.78/1.07 55 op_possibly -> (all X possibly(X) = not(necessarily(not(X)))) # label(op_possibly) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.07 56 op_necessarily -> (all X necessarily(X) = not(possibly(not(X)))) # label(op_necessarily) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.07 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.78/1.07 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.78/1.07
% 0.78/1.07 ============================== end of process non-clausal formulas ===
% 0.78/1.07
% 0.78/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.78/1.07
% 0.78/1.07 ============================== PREDICATE ELIMINATION =================
% 0.78/1.07
% 0.78/1.07 ============================== end predicate elimination =============
% 0.78/1.07
% 0.78/1.07 Auto_denials: (non-Horn, no changes).
% 0.78/1.07
% 0.78/1.07 Term ordering decisions:
% 0.78/1.07 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.78/1.07
% 0.78/1.07 ============================== end of process initial clauses ========
% 0.78/1.07
% 0.78/1.07 ============================== CLAUSES FOR SEARCH ====================
% 59.04/59.34
% 59.04/59.34 ============================== end of clauses for search =============
% 59.04/59.34
% 59.04/59.34 ============================== SEARCH ================================
% 59.04/59.34
% 59.04/59.34 % Starting search at 0.03 seconds.
% 59.04/59.34
% 59.04/59.34 Low Water (keep): wt=22.000, iters=3405
% 59.04/59.34
% 59.04/59.34 Low Water (keep): wt=20.000, iters=3364
% 59.04/59.34
% 59.04/59.34 Low Water (keep): wt=19.000, iters=3480
% 59.04/59.34
% 59.04/59.34 Low Water (keep): wt=18.000, iters=3375
% 59.04/59.34
% 59.04/59.34 Low Water (keep): wt=17.000, iters=3345
% 59.04/59.34
% 59.04/59.34 Low Water (keep): wt=16.000, iters=3343
% 59.04/59.34
% 59.04/59.34 Low Water (keep): wt=15.000, iters=3346
% 59.04/59.34
% 59.04/59.34 Low Water (keep): wt=14.000, iters=3333
% 59.04/59.34
% 59.04/59.34 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 68 (0.00 of 1.37 sec).
% 59.04/59.34
% 59.04/59.34 Low Water (keep): wt=13.000, iters=3336
% 59.04/59.34
% 59.04/59.34 Low Water (displace): id=5257, wt=29.000
% 59.04/59.34
% 59.04/59.34 Low Water (displace): id=5248, wt=28.000
% 59.04/59.34
% 59.04/59.34 Low Water (displace): id=5531, wt=27.000
% 59.04/59.34
% 59.04/59.34 Low Water (displace): id=10931, wt=9.000
% 59.04/59.34
% 59.04/59.34 Low Water (keep): wt=11.000, iters=3385
% 59.04/59.34
% 59.04/59.34 Low Water (keep): wt=10.000, iters=3335
% 59.04/59.34
% 59.04/59.34 ============================== PROOF =================================
% 59.04/59.34 % SZS status Theorem
% 59.04/59.34 % SZS output start Refutation
% 59.04/59.34
% 59.04/59.34 % Proof 1 at 54.32 (+ 3.97) seconds.
% 59.04/59.34 % Length of proof is 148.
% 59.04/59.34 % Level of proof is 22.
% 59.04/59.34 % Maximum clause weight is 15.000.
% 59.04/59.34 % Given clauses 17053.
% 59.04/59.34
% 59.04/59.34 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].
% 59.04/59.34 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].
% 59.04/59.34 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].
% 59.04/59.34 4 implies_1 <-> (all X all Y is_a_theorem(implies(X,implies(Y,X)))) # label(implies_1) # label(axiom) # label(non_clause). [assumption].
% 59.04/59.34 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].
% 59.04/59.34 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].
% 59.04/59.34 7 and_1 <-> (all X all Y is_a_theorem(implies(and(X,Y),X))) # label(and_1) # label(axiom) # label(non_clause). [assumption].
% 59.04/59.34 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].
% 59.04/59.34 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].
% 59.04/59.34 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].
% 59.04/59.34 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].
% 59.04/59.34 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].
% 59.04/59.34 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].
% 59.04/59.34 32 necessitation <-> (all X (is_a_theorem(X) -> is_a_theorem(necessarily(X)))) # label(necessitation) # label(axiom) # label(non_clause). [assumption].
% 59.04/59.34 37 axiom_M <-> (all X is_a_theorem(implies(necessarily(X),X))) # label(axiom_M) # label(axiom) # label(non_clause). [assumption].
% 59.04/59.34 38 axiom_4 <-> (all X is_a_theorem(implies(necessarily(X),necessarily(necessarily(X))))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 59.04/59.34 39 axiom_B <-> (all X is_a_theorem(implies(X,necessarily(possibly(X))))) # label(axiom_B) # label(axiom) # label(non_clause). [assumption].
% 59.04/59.34 54 axiom_m10 <-> (all X is_a_theorem(strict_implies(possibly(X),necessarily(possibly(X))))) # label(axiom_m10) # label(axiom) # label(non_clause). [assumption].
% 59.04/59.34 55 op_possibly -> (all X possibly(X) = not(necessarily(not(X)))) # label(op_possibly) # label(axiom) # label(non_clause). [assumption].
% 59.04/59.34 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].
% 59.04/59.34 59 -modus_ponens | -is_a_theorem(A) | -is_a_theorem(implies(A,B)) | is_a_theorem(B) # label(modus_ponens) # label(axiom). [clausify(1)].
% 59.04/59.34 63 -substitution_of_equivalents | -is_a_theorem(equiv(A,B)) | B = A # label(substitution_of_equivalents) # label(axiom). [clausify(2)].
% 59.04/59.34 66 -modus_tollens | is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))) # label(modus_tollens) # label(axiom). [clausify(3)].
% 59.04/59.34 68 -implies_1 | is_a_theorem(implies(A,implies(B,A))) # label(implies_1) # label(axiom). [clausify(4)].
% 59.04/59.34 70 -implies_2 | is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))) # label(implies_2) # label(axiom). [clausify(5)].
% 59.04/59.34 72 -implies_3 | is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) # label(implies_3) # label(axiom). [clausify(6)].
% 59.04/59.34 74 -and_1 | is_a_theorem(implies(and(A,B),A)) # label(and_1) # label(axiom). [clausify(7)].
% 59.04/59.34 78 -and_3 | is_a_theorem(implies(A,implies(B,and(A,B)))) # label(and_3) # label(axiom). [clausify(9)].
% 59.04/59.34 84 -or_3 | is_a_theorem(implies(implies(A,B),implies(implies(C,B),implies(or(A,C),B)))) # label(or_3) # label(axiom). [clausify(12)].
% 59.04/59.34 90 -equivalence_3 | is_a_theorem(implies(implies(A,B),implies(implies(B,A),equiv(A,B)))) # label(equivalence_3) # label(axiom). [clausify(15)].
% 59.04/59.34 114 -op_or | or(A,B) = not(and(not(A),not(B))) # label(op_or) # label(axiom). [clausify(27)].
% 59.04/59.34 115 -op_or | not(and(not(A),not(B))) = or(A,B). [copy(114),flip(b)].
% 59.04/59.34 118 -op_implies_and | not(and(A,not(B))) = implies(A,B) # label(op_implies_and) # label(axiom). [clausify(29)].
% 59.04/59.34 120 -op_equiv | and(implies(A,B),implies(B,A)) = equiv(A,B) # label(op_equiv) # label(axiom). [clausify(31)].
% 59.04/59.34 121 op_or # label(hilbert_op_or) # label(axiom). [assumption].
% 59.04/59.34 122 op_implies_and # label(hilbert_op_implies_and) # label(axiom). [assumption].
% 59.04/59.34 123 op_equiv # label(hilbert_op_equiv) # label(axiom). [assumption].
% 59.04/59.34 124 modus_ponens # label(hilbert_modus_ponens) # label(axiom). [assumption].
% 59.04/59.34 125 modus_tollens # label(hilbert_modus_tollens) # label(axiom). [assumption].
% 59.04/59.34 126 implies_1 # label(hilbert_implies_1) # label(axiom). [assumption].
% 59.04/59.34 127 implies_2 # label(hilbert_implies_2) # label(axiom). [assumption].
% 59.04/59.34 128 implies_3 # label(hilbert_implies_3) # label(axiom). [assumption].
% 59.04/59.34 129 and_1 # label(hilbert_and_1) # label(axiom). [assumption].
% 59.04/59.34 131 and_3 # label(hilbert_and_3) # label(axiom). [assumption].
% 59.04/59.34 134 or_3 # label(hilbert_or_3) # label(axiom). [assumption].
% 59.04/59.34 137 equivalence_3 # label(hilbert_equivalence_3) # label(axiom). [assumption].
% 59.04/59.34 138 substitution_of_equivalents # label(substitution_of_equivalents) # label(axiom). [assumption].
% 59.04/59.34 139 -necessitation | -is_a_theorem(A) | is_a_theorem(necessarily(A)) # label(necessitation) # label(axiom). [clausify(32)].
% 59.04/59.34 155 -axiom_M | is_a_theorem(implies(necessarily(A),A)) # label(axiom_M) # label(axiom). [clausify(37)].
% 59.04/59.34 157 -axiom_4 | is_a_theorem(implies(necessarily(A),necessarily(necessarily(A)))) # label(axiom_4) # label(axiom). [clausify(38)].
% 59.04/59.34 159 -axiom_B | is_a_theorem(implies(A,necessarily(possibly(A)))) # label(axiom_B) # label(axiom). [clausify(39)].
% 59.04/59.34 190 axiom_m10 | -is_a_theorem(strict_implies(possibly(c94),necessarily(possibly(c94)))) # label(axiom_m10) # label(axiom). [clausify(54)].
% 59.04/59.34 191 -op_possibly | possibly(A) = not(necessarily(not(A))) # label(op_possibly) # label(axiom). [clausify(55)].
% 59.04/59.34 192 -op_possibly | not(necessarily(not(A))) = possibly(A). [copy(191),flip(b)].
% 59.04/59.34 195 -op_strict_implies | strict_implies(A,B) = necessarily(implies(A,B)) # label(op_strict_implies) # label(axiom). [clausify(57)].
% 59.04/59.34 196 -op_strict_implies | necessarily(implies(A,B)) = strict_implies(A,B). [copy(195),flip(b)].
% 59.04/59.34 199 op_possibly # label(km4b_op_possibly) # label(axiom). [assumption].
% 59.04/59.34 200 necessitation # label(km4b_necessitation) # label(axiom). [assumption].
% 59.04/59.34 202 axiom_M # label(km4b_axiom_M) # label(axiom). [assumption].
% 59.04/59.34 203 axiom_4 # label(km4b_axiom_4) # label(axiom). [assumption].
% 59.04/59.34 204 axiom_B # label(km4b_axiom_B) # label(axiom). [assumption].
% 59.04/59.34 206 op_strict_implies # label(s1_0_op_strict_implies) # label(axiom). [assumption].
% 59.04/59.34 208 -axiom_m10 # label(s1_0_m10_axiom_m10) # label(negated_conjecture). [assumption].
% 59.04/59.34 209 not(and(not(A),not(B))) = or(A,B). [back_unit_del(115),unit_del(a,121)].
% 59.04/59.34 210 not(and(A,not(B))) = implies(A,B). [back_unit_del(118),unit_del(a,122)].
% 59.04/59.34 211 and(implies(A,B),implies(B,A)) = equiv(A,B). [back_unit_del(120),unit_del(a,123)].
% 59.04/59.34 212 -is_a_theorem(A) | -is_a_theorem(implies(A,B)) | is_a_theorem(B). [back_unit_del(59),unit_del(a,124)].
% 59.04/59.34 213 is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))). [back_unit_del(66),unit_del(a,125)].
% 59.04/59.34 214 is_a_theorem(implies(A,implies(B,A))). [back_unit_del(68),unit_del(a,126)].
% 59.04/59.34 215 is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))). [back_unit_del(70),unit_del(a,127)].
% 59.04/59.34 216 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))). [back_unit_del(72),unit_del(a,128)].
% 59.04/59.34 217 is_a_theorem(implies(and(A,B),A)). [back_unit_del(74),unit_del(a,129)].
% 59.04/59.34 219 is_a_theorem(implies(A,implies(B,and(A,B)))). [back_unit_del(78),unit_del(a,131)].
% 59.04/59.34 222 is_a_theorem(implies(implies(A,B),implies(implies(C,B),implies(or(A,C),B)))). [back_unit_del(84),unit_del(a,134)].
% 59.04/59.34 225 is_a_theorem(implies(implies(A,B),implies(implies(B,A),equiv(A,B)))). [back_unit_del(90),unit_del(a,137)].
% 59.04/59.34 226 -is_a_theorem(equiv(A,B)) | B = A. [back_unit_del(63),unit_del(a,138)].
% 59.04/59.34 228 not(necessarily(not(A))) = possibly(A). [back_unit_del(192),unit_del(a,199)].
% 59.04/59.34 229 -is_a_theorem(A) | is_a_theorem(necessarily(A)). [back_unit_del(139),unit_del(a,200)].
% 59.04/59.34 231 is_a_theorem(implies(necessarily(A),A)). [back_unit_del(155),unit_del(a,202)].
% 59.04/59.34 232 is_a_theorem(implies(necessarily(A),necessarily(necessarily(A)))). [back_unit_del(157),unit_del(a,203)].
% 59.04/59.34 233 is_a_theorem(implies(A,necessarily(possibly(A)))). [back_unit_del(159),unit_del(a,204)].
% 59.04/59.34 234 necessarily(implies(A,B)) = strict_implies(A,B). [back_unit_del(196),unit_del(a,206)].
% 59.04/59.34 236 -is_a_theorem(strict_implies(possibly(c94),necessarily(possibly(c94)))). [back_unit_del(190),unit_del(a,208)].
% 59.04/59.34 237 implies(not(A),B) = or(A,B). [back_rewrite(209),rewrite([210(4)])].
% 59.04/59.34 244 is_a_theorem(implies(or(A,not(B)),implies(B,A))). [back_rewrite(213),rewrite([237(3)])].
% 59.04/59.34 257 -is_a_theorem(A) | is_a_theorem(implies(B,A)). [resolve(214,a,212,b)].
% 59.04/59.34 260 -is_a_theorem(implies(A,implies(A,B))) | is_a_theorem(implies(A,B)). [resolve(215,a,212,b)].
% 59.04/59.34 263 -is_a_theorem(implies(A,B)) | is_a_theorem(implies(implies(B,C),implies(A,C))). [resolve(216,a,212,b)].
% 59.04/59.34 281 -is_a_theorem(implies(A,B)) | is_a_theorem(implies(implies(C,B),implies(or(A,C),B))). [resolve(222,a,212,b)].
% 59.04/59.34 290 -is_a_theorem(implies(A,B)) | is_a_theorem(implies(implies(B,A),equiv(A,B))). [resolve(225,a,212,b)].
% 59.04/59.34 308 not(and(A,possibly(B))) = implies(A,necessarily(not(B))). [para(228(a,1),210(a,1,1,2))].
% 59.04/59.34 309 possibly(and(A,not(B))) = not(strict_implies(A,B)). [para(210(a,1),228(a,1,1,1)),rewrite([234(2)]),flip(a)].
% 59.04/59.34 339 is_a_theorem(strict_implies(A,necessarily(possibly(A)))). [resolve(233,a,229,a),rewrite([234(4)])].
% 59.04/59.34 349 or(and(A,not(B)),C) = implies(implies(A,B),C). [para(210(a,1),237(a,1,1)),flip(a)].
% 59.04/59.34 369 necessarily(or(A,B)) = strict_implies(not(A),B). [para(237(a,1),234(a,1,1))].
% 59.04/59.34 379 -is_a_theorem(or(A,not(B))) | is_a_theorem(implies(B,A)). [resolve(244,a,212,b)].
% 59.04/59.34 875 is_a_theorem(implies(A,and(A,A))). [resolve(260,a,219,a)].
% 59.04/59.34 877 is_a_theorem(implies(A,A)). [resolve(260,a,214,a)].
% 59.04/59.34 884 is_a_theorem(implies(A,implies(B,B))). [resolve(877,a,257,a)].
% 59.04/59.34 891 is_a_theorem(strict_implies(A,A)). [resolve(877,a,229,a),rewrite([234(2)])].
% 59.04/59.34 900 is_a_theorem(implies(A,strict_implies(B,B))). [resolve(891,a,257,a)].
% 59.04/59.34 1102 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))). [resolve(263,a,214,a)].
% 59.04/59.34 1662 is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))). [resolve(884,a,263,a)].
% 59.04/59.34 1817 is_a_theorem(implies(implies(strict_implies(A,A),B),implies(C,B))). [resolve(900,a,263,a)].
% 59.04/59.34 2549 is_a_theorem(implies(implies(A,B),implies(or(and(B,C),A),B))). [resolve(281,a,217,a)].
% 59.04/59.34 4056 is_a_theorem(implies(implies(strict_implies(A,A),B),equiv(B,strict_implies(A,A)))). [resolve(290,a,900,a)].
% 59.04/59.34 4057 is_a_theorem(implies(implies(implies(A,A),B),equiv(B,implies(A,A)))). [resolve(290,a,884,a)].
% 59.04/59.34 4058 is_a_theorem(implies(implies(and(A,A),A),equiv(A,and(A,A)))). [resolve(290,a,875,a)].
% 59.04/59.34 4068 is_a_theorem(implies(implies(necessarily(necessarily(A)),necessarily(A)),equiv(necessarily(A),necessarily(necessarily(A))))). [resolve(290,a,232,a)].
% 59.04/59.34 4623 not(strict_implies(A,necessarily(not(B)))) = possibly(and(A,possibly(B))). [para(308(a,1),228(a,1,1,1)),rewrite([234(4)])].
% 59.04/59.34 16163 -is_a_theorem(implies(implies(A,B),C)) | is_a_theorem(implies(B,C)). [resolve(1102,a,212,b)].
% 59.04/59.34 16287 is_a_theorem(implies(implies(implies(A,A),B),B)). [resolve(1662,a,260,a)].
% 59.04/59.34 16892 is_a_theorem(implies(implies(strict_implies(A,A),B),B)). [resolve(1817,a,260,a)].
% 59.04/59.34 18255 -is_a_theorem(implies(implies(A,A),B)) | is_a_theorem(B). [resolve(16287,a,212,b)].
% 59.04/59.34 18266 -is_a_theorem(implies(strict_implies(A,A),B)) | is_a_theorem(B). [resolve(16892,a,212,b)].
% 59.04/59.34 18299 is_a_theorem(implies(or(and(A,B),A),A)). [resolve(18255,a,2549,a)].
% 59.04/59.34 18413 is_a_theorem(equiv(A,and(A,A))). [resolve(4058,a,212,b),unit_del(a,217)].
% 59.04/59.34 18430 and(A,A) = A. [resolve(18413,a,226,a)].
% 59.04/59.34 18433 or(A,A) = not(not(A)). [para(18430(a,1),210(a,1,1)),rewrite([237(4)]),flip(a)].
% 59.04/59.34 18434 equiv(A,A) = implies(A,A). [para(18430(a,1),211(a,1)),flip(a)].
% 59.04/59.34 18437 not(strict_implies(not(A),A)) = possibly(not(A)). [para(18430(a,1),309(a,1,1)),flip(a)].
% 59.04/59.34 18438 implies(or(A,A),B) = or(not(A),B). [para(18430(a,1),349(a,1,1)),rewrite([237(4)]),flip(a)].
% 59.04/59.34 18440 is_a_theorem(or(not(A),A)). [para(18430(a,1),18299(a,1,1,1)),rewrite([18438(2)])].
% 59.04/59.34 18474 is_a_theorem(implies(A,not(not(A)))). [resolve(18440,a,379,a)].
% 59.04/59.34 19136 strict_implies(not(A),A) = necessarily(not(not(A))). [para(18433(a,1),369(a,1,1)),flip(a)].
% 59.04/59.34 19290 is_a_theorem(equiv(necessarily(A),necessarily(necessarily(A)))). [resolve(4068,a,212,b),unit_del(a,231)].
% 59.04/59.34 19409 necessarily(necessarily(A)) = necessarily(A). [resolve(19290,a,226,a)].
% 59.04/59.34 33612 is_a_theorem(implies(A,equiv(A,implies(B,B)))). [resolve(16163,a,4057,a)].
% 59.04/59.34 33613 is_a_theorem(implies(A,equiv(A,strict_implies(B,B)))). [resolve(16163,a,4056,a)].
% 59.04/59.34 33663 is_a_theorem(equiv(strict_implies(A,A),implies(B,B))). [resolve(33612,a,18266,a)].
% 59.04/59.34 33681 is_a_theorem(equiv(implies(A,A),strict_implies(B,B))). [resolve(33613,a,18255,a)].
% 59.04/59.34 33684 -is_a_theorem(A) | is_a_theorem(equiv(A,strict_implies(B,B))). [resolve(33613,a,212,b)].
% 59.04/59.34 33745 strict_implies(A,A) = implies(B,B). [resolve(33663,a,226,a),flip(a)].
% 59.04/59.34 33747 strict_implies(A,A) = c_0. [new_symbol(33745)].
% 59.04/59.34 33749 implies(A,A) = c_0. [back_rewrite(33745),rewrite([33747(1)]),flip(a)].
% 59.04/59.34 33753 -is_a_theorem(A) | is_a_theorem(equiv(A,c_0)). [back_rewrite(33684),rewrite([33747(2)])].
% 59.04/59.34 33756 is_a_theorem(c_0). [back_rewrite(33681),rewrite([33749(1),33747(2),18434(3),33749(3)])].
% 59.04/59.34 36988 is_a_theorem(equiv(implies(A,not(not(A))),c_0)). [resolve(33753,a,18474,a)].
% 59.04/59.34 36995 is_a_theorem(equiv(or(not(A),A),c_0)). [resolve(33753,a,18440,a)].
% 59.04/59.34 39610 or(not(A),A) = c_0. [resolve(36995,a,226,a),flip(a)].
% 59.04/59.34 40357 implies(A,not(not(A))) = c_0. [resolve(36988,a,226,a),flip(a)].
% 59.04/59.34 40358 equiv(A,not(not(A))) = c_0. [para(40357(a,1),211(a,1,1)),rewrite([237(4),39610(3),18430(3)]),flip(a)].
% 59.04/59.34 40364 not(not(A)) = A. [para(40358(a,1),226(a,1)),unit_del(a,33756)].
% 59.04/59.34 40384 strict_implies(not(A),A) = necessarily(A). [back_rewrite(19136),rewrite([40364(4)])].
% 59.04/59.34 40401 not(necessarily(A)) = possibly(not(A)). [back_rewrite(18437),rewrite([40384(2)])].
% 59.04/59.34 42241 possibly(possibly(A)) = possibly(A). [para(40384(a,1),4623(a,1,1)),rewrite([19409(3),40401(3),40364(2),40401(4),40364(3),18430(4)]),flip(a)].
% 59.04/59.34 42284 is_a_theorem(strict_implies(possibly(A),necessarily(possibly(A)))). [para(42241(a,1),339(a,1,2,1))].
% 59.04/59.34 42285 $F. [resolve(42284,a,236,a)].
% 59.04/59.34
% 59.04/59.34 % SZS output end Refutation
% 59.04/59.34 ============================== end of proof ==========================
% 59.04/59.34
% 59.04/59.34 ============================== STATISTICS ============================
% 59.04/59.34
% 59.04/59.34 Given=17053. Generated=8185373. Kept=42220. proofs=1.
% 59.04/59.34 Usable=7878. Sos=4856. Demods=94. Limbo=1, Disabled=29631. Hints=0.
% 59.04/59.34 Megabytes=35.95.
% 59.04/59.34 User_CPU=54.32, System_CPU=3.97, Wall_clock=59.
% 59.04/59.34
% 59.04/59.34 ============================== end of statistics =====================
% 59.04/59.34
% 59.04/59.34 ============================== end of search =========================
% 59.04/59.34
% 59.04/59.34 THEOREM PROVED
% 59.04/59.34 % SZS status Theorem
% 59.04/59.34
% 59.04/59.34 Exiting with 1 proof.
% 59.04/59.34
% 59.04/59.34 Process 17179 exit (max_proofs) Sun Jul 3 17:40:40 2022
% 59.04/59.34 Prover9 interrupted
%------------------------------------------------------------------------------