TSTP Solution File: LCL510+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL510+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:17 EDT 2022
% Result : Theorem 3.35s 3.66s
% Output : Refutation 3.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL510+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 4 00:00:06 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.46/1.00 ============================== Prover9 ===============================
% 0.46/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.00 Process 2529 was started by sandbox on n026.cluster.edu,
% 0.46/1.00 Mon Jul 4 00:00:07 2022
% 0.46/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2145_n026.cluster.edu".
% 0.46/1.00 ============================== end of head ===========================
% 0.46/1.00
% 0.46/1.00 ============================== INPUT =================================
% 0.46/1.00
% 0.46/1.00 % Reading from file /tmp/Prover9_2145_n026.cluster.edu
% 0.46/1.00
% 0.46/1.00 set(prolog_style_variables).
% 0.46/1.00 set(auto2).
% 0.46/1.00 % set(auto2) -> set(auto).
% 0.46/1.00 % set(auto) -> set(auto_inference).
% 0.46/1.00 % set(auto) -> set(auto_setup).
% 0.46/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.00 % set(auto) -> set(auto_limits).
% 0.46/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.00 % set(auto) -> set(auto_denials).
% 0.46/1.00 % set(auto) -> set(auto_process).
% 0.46/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.00 % set(auto2) -> assign(stats, some).
% 0.46/1.00 % set(auto2) -> clear(echo_input).
% 0.46/1.00 % set(auto2) -> set(quiet).
% 0.46/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.00 % set(auto2) -> clear(print_given).
% 0.46/1.00 assign(lrs_ticks,-1).
% 0.46/1.00 assign(sos_limit,10000).
% 0.46/1.00 assign(order,kbo).
% 0.46/1.00 set(lex_order_vars).
% 0.46/1.00 clear(print_given).
% 0.46/1.00
% 0.46/1.00 % formulas(sos). % not echoed (43 formulas)
% 0.46/1.00
% 0.46/1.00 ============================== end of input ==========================
% 0.46/1.00
% 0.46/1.00 % From the command line: assign(max_seconds, 300).
% 0.46/1.00
% 0.46/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.00
% 0.46/1.00 % Formulas that are not ordinary clauses:
% 0.46/1.00 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.46/1.00 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.46/1.00 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.46/1.00 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.46/1.00 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.46/1.00 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.46/1.00 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.46/1.00 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.46/1.00 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.46/1.00 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.46/1.00 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.46/1.00 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.46/1.00 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.46/1.00 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].
% 1.18/1.46 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].
% 1.18/1.46 16 kn1 <-> (all P is_a_theorem(implies(P,and(P,P)))) # label(kn1) # label(axiom) # label(non_clause). [assumption].
% 1.18/1.46 17 kn2 <-> (all P all Q is_a_theorem(implies(and(P,Q),P))) # label(kn2) # label(axiom) # label(non_clause). [assumption].
% 1.18/1.46 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].
% 1.18/1.46 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].
% 1.18/1.46 20 cn2 <-> (all P all Q is_a_theorem(implies(P,implies(not(P),Q)))) # label(cn2) # label(axiom) # label(non_clause). [assumption].
% 1.18/1.46 21 cn3 <-> (all P is_a_theorem(implies(implies(not(P),P),P))) # label(cn3) # label(axiom) # label(non_clause). [assumption].
% 1.18/1.46 22 r1 <-> (all P is_a_theorem(implies(or(P,P),P))) # label(r1) # label(axiom) # label(non_clause). [assumption].
% 1.18/1.46 23 r2 <-> (all P all Q is_a_theorem(implies(Q,or(P,Q)))) # label(r2) # label(axiom) # label(non_clause). [assumption].
% 1.18/1.46 24 r3 <-> (all P all Q is_a_theorem(implies(or(P,Q),or(Q,P)))) # label(r3) # label(axiom) # label(non_clause). [assumption].
% 1.18/1.46 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].
% 1.18/1.46 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].
% 1.18/1.46 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].
% 1.18/1.46 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].
% 1.18/1.46 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].
% 1.18/1.46 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].
% 1.18/1.46 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].
% 1.18/1.46
% 1.18/1.46 ============================== end of process non-clausal formulas ===
% 1.18/1.46
% 1.18/1.46 ============================== PROCESS INITIAL CLAUSES ===============
% 1.18/1.46
% 1.18/1.46 ============================== PREDICATE ELIMINATION =================
% 1.18/1.46
% 1.18/1.46 ============================== end predicate elimination =============
% 1.18/1.46
% 1.18/1.46 Auto_denials: (non-Horn, no changes).
% 1.18/1.46
% 1.18/1.46 Term ordering decisions:
% 1.18/1.46
% 1.18/1.46 % Assigning unary symbol not kb_weight 0 and highest precedence (93).
% 1.18/1.46 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. implies=1. or=1. and=1. equiv=1. not=0.
% 1.18/1.46
% 1.18/1.46 ============================== end of process initial clauses ========
% 1.18/1.46
% 1.18/1.46 ============================== CLAUSES FOR SEARCH ====================
% 1.18/1.46
% 1.18/1.46 ============================== end of clauses for search =============
% 1.18/1.46
% 1.18/1.46 ============================== SEARCH ================================
% 1.18/1.46
% 1.18/1.46 % Starting search at 0.02 seconds.
% 1.18/1.46
% 1.18/1.46 Low Water (keep): wt=37.000, iters=3453
% 1.18/1.46
% 1.18/1.46 Low Water (keep): wt=35.000, iters=3453
% 1.18/1.46
% 1.18/1.46 Low Water (keep): wt=34.000, iters=3447
% 1.18/1.46
% 1.18/1.46 Low Water (keep): wt=27.000, iters=3351
% 1.18/1.46
% 1.18/1.46 Low Water (keep): wt=25.000, iters=3432
% 1.18/1.46
% 1.18/1.46 Low Water (keep): wt=23.000, iters=3348
% 1.18/1.46
% 1.18/1.46 Low Water (keep): wt=22.000, iters=3389
% 1.18/1.46
% 1.18/1.46 Low Water (keep): wt=21.000, iters=3378
% 1.18/1.46
% 1.18/1.46 Low Water (keep): wt=20.000, iters=3576
% 1.18/1.46
% 1.18/1.46 Low Water (keep): wt=19.000, iters=3396
% 1.18/1.46
% 1.18/1.46 Low Water (keep): wt=18.000, iters=3367
% 3.35/3.65
% 3.35/3.65 Low Water (keep): wt=17.000, iters=3354
% 3.35/3.65
% 3.35/3.65 Low Water (keep): wt=16.000, iters=3334
% 3.35/3.65
% 3.35/3.65 Low Water (keep): wt=15.000, iters=3359
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=2325, wt=45.000
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=2324, wt=43.000
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=1926, wt=41.000
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=2358, wt=39.000
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=1956, wt=38.000
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=2363, wt=35.000
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=1961, wt=34.000
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=2356, wt=33.000
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=2348, wt=32.000
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=3539, wt=31.000
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=3612, wt=30.000
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=10679, wt=14.000
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=10790, wt=13.000
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=11163, wt=12.000
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=11289, wt=11.000
% 3.35/3.65
% 3.35/3.65 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 144 (0.00 of 0.93 sec).
% 3.35/3.65
% 3.35/3.65 Low Water (keep): wt=14.000, iters=3333
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=13822, wt=10.000
% 3.35/3.65
% 3.35/3.65 Low Water (keep): wt=13.000, iters=3370
% 3.35/3.65
% 3.35/3.65 Low Water (displace): id=18878, wt=9.000
% 3.35/3.66
% 3.35/3.66 Low Water (displace): id=20146, wt=8.000
% 3.35/3.66
% 3.35/3.66 ============================== PROOF =================================
% 3.35/3.66 % SZS status Theorem
% 3.35/3.66 % SZS output start Refutation
% 3.35/3.66
% 3.35/3.66 % Proof 1 at 2.50 (+ 0.17) seconds.
% 3.35/3.66 % Length of proof is 57.
% 3.35/3.66 % Level of proof is 24.
% 3.35/3.66 % Maximum clause weight is 14.000.
% 3.35/3.66 % Given clauses 1092.
% 3.35/3.66
% 3.35/3.66 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].
% 3.35/3.66 11 or_2 <-> (all X all Y is_a_theorem(implies(Y,or(X,Y)))) # label(or_2) # label(axiom) # label(non_clause). [assumption].
% 3.35/3.66 16 kn1 <-> (all P is_a_theorem(implies(P,and(P,P)))) # label(kn1) # label(axiom) # label(non_clause). [assumption].
% 3.35/3.66 17 kn2 <-> (all P all Q is_a_theorem(implies(and(P,Q),P))) # label(kn2) # label(axiom) # label(non_clause). [assumption].
% 3.35/3.66 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].
% 3.35/3.66 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].
% 3.35/3.66 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].
% 3.35/3.66 32 op_or # label(rosser_op_or) # label(axiom). [assumption].
% 3.35/3.66 33 op_implies_and # label(rosser_op_implies_and) # label(axiom). [assumption].
% 3.35/3.66 35 modus_ponens # label(rosser_modus_ponens) # label(axiom). [assumption].
% 3.35/3.66 36 kn1 # label(rosser_kn1) # label(axiom). [assumption].
% 3.35/3.66 37 kn2 # label(rosser_kn2) # label(axiom). [assumption].
% 3.35/3.66 38 kn3 # label(rosser_kn3) # label(axiom). [assumption].
% 3.35/3.66 40 -or_2 # label(hilbert_or_2) # label(negated_conjecture). [assumption].
% 3.35/3.66 49 or_2 | -is_a_theorem(implies(c23,or(c22,c23))) # label(or_2) # label(axiom). [clausify(11)].
% 3.35/3.66 50 -is_a_theorem(implies(c23,or(c22,c23))). [copy(49),unit_del(a,40)].
% 3.35/3.66 51 -kn1 | is_a_theorem(implies(A,and(A,A))) # label(kn1) # label(axiom). [clausify(16)].
% 3.35/3.66 52 is_a_theorem(implies(A,and(A,A))). [copy(51),unit_del(a,36)].
% 3.35/3.66 54 -kn2 | is_a_theorem(implies(and(A,B),A)) # label(kn2) # label(axiom). [clausify(17)].
% 3.35/3.66 55 is_a_theorem(implies(and(A,B),A)). [copy(54),unit_del(a,37)].
% 3.35/3.66 67 -modus_ponens | -is_a_theorem(A) | -is_a_theorem(implies(A,B)) | is_a_theorem(B) # label(modus_ponens) # label(axiom). [clausify(1)].
% 3.35/3.66 68 -is_a_theorem(A) | -is_a_theorem(implies(A,B)) | is_a_theorem(B). [copy(67),unit_del(a,35)].
% 3.35/3.66 78 -op_implies_and | not(and(A,not(B))) = implies(A,B) # label(op_implies_and) # label(axiom). [clausify(29)].
% 3.35/3.66 79 not(and(A,not(B))) = implies(A,B). [copy(78),unit_del(a,33)].
% 3.35/3.66 84 -op_or | or(A,B) = not(and(not(A),not(B))) # label(op_or) # label(axiom). [clausify(27)].
% 3.35/3.66 85 or(A,B) = implies(not(A),B). [copy(84),rewrite([79(6)]),unit_del(a,32)].
% 3.35/3.66 108 -kn3 | is_a_theorem(implies(implies(A,B),implies(not(and(B,C)),not(and(C,A))))) # label(kn3) # label(axiom). [clausify(18)].
% 3.35/3.66 109 is_a_theorem(implies(implies(A,B),implies(not(and(B,C)),not(and(C,A))))). [copy(108),unit_del(a,38)].
% 3.35/3.66 119 -is_a_theorem(implies(c23,implies(not(c22),c23))). [back_rewrite(50),rewrite([85(4)])].
% 3.35/3.66 128 -is_a_theorem(implies(A,B)) | is_a_theorem(implies(not(and(B,C)),not(and(C,A)))). [resolve(109,a,68,b)].
% 3.35/3.66 212 is_a_theorem(implies(not(and(and(A,A),B)),not(and(B,A)))). [resolve(128,a,52,a)].
% 3.35/3.66 264 -is_a_theorem(not(and(and(A,A),B))) | is_a_theorem(not(and(B,A))). [resolve(212,a,68,b)].
% 3.35/3.66 363 -is_a_theorem(implies(and(A,A),B)) | is_a_theorem(not(and(not(B),A))). [para(79(a,1),264(a,1))].
% 3.35/3.66 544 is_a_theorem(not(and(not(A),A))). [resolve(363,a,55,a)].
% 3.35/3.66 567 -is_a_theorem(implies(not(and(not(A),A)),implies(c23,implies(not(c22),c23)))). [ur(68,a,544,a,c,119,a)].
% 3.35/3.66 569 is_a_theorem(implies(not(not(A)),A)). [para(79(a,1),544(a,1))].
% 3.35/3.66 676 is_a_theorem(implies(not(and(A,B)),implies(B,not(A)))). [resolve(569,a,128,a),rewrite([79(6)])].
% 3.35/3.66 678 -is_a_theorem(not(not(A))) | is_a_theorem(A). [resolve(569,a,68,b)].
% 3.35/3.66 952 -is_a_theorem(not(and(A,B))) | is_a_theorem(implies(B,not(A))). [resolve(676,a,68,b)].
% 3.35/3.66 1504 -is_a_theorem(implies(A,B)) | is_a_theorem(implies(not(B),not(A))). [para(79(a,1),952(a,1))].
% 3.35/3.66 4424 is_a_theorem(implies(not(A),not(and(A,B)))). [resolve(1504,a,55,a)].
% 3.35/3.66 4425 is_a_theorem(implies(not(and(A,A)),not(A))). [resolve(1504,a,52,a)].
% 3.35/3.66 4502 is_a_theorem(implies(not(A),implies(A,B))). [para(79(a,1),4424(a,1,2))].
% 3.35/3.66 4509 is_a_theorem(implies(not(and(implies(A,B),C)),implies(C,A))). [resolve(4502,a,128,a),rewrite([79(6)])].
% 3.35/3.66 4922 -is_a_theorem(not(and(A,A))) | is_a_theorem(not(A)). [resolve(4425,a,68,b)].
% 3.35/3.66 5274 -is_a_theorem(implies(not(A),A)) | is_a_theorem(not(not(A))). [para(79(a,1),4922(a,1))].
% 3.35/3.66 11085 -is_a_theorem(not(and(implies(A,B),C))) | is_a_theorem(implies(C,A)). [resolve(4509,a,68,b)].
% 3.35/3.66 11110 is_a_theorem(implies(implies(implies(A,B),C),implies(not(C),A))). [para(79(a,1),4509(a,1,1))].
% 3.35/3.66 13234 -is_a_theorem(implies(implies(A,B),C)) | is_a_theorem(implies(not(C),A)). [para(79(a,1),11085(a,1))].
% 3.35/3.66 13966 is_a_theorem(implies(not(implies(not(A),B)),implies(B,C))). [resolve(13234,a,11110,a)].
% 3.35/3.66 14401 is_a_theorem(not(not(implies(not(A),not(A))))). [resolve(13966,a,5274,a)].
% 3.35/3.66 14435 is_a_theorem(implies(not(A),not(A))). [resolve(14401,a,678,a)].
% 3.35/3.66 14466 is_a_theorem(implies(not(and(not(A),B)),implies(B,A))). [resolve(14435,a,128,a),rewrite([79(6)])].
% 3.35/3.66 15983 is_a_theorem(implies(implies(not(A),B),implies(not(B),A))). [para(79(a,1),14466(a,1,1))].
% 3.35/3.66 22886 is_a_theorem(implies(not(implies(not(A),B)),not(B))). [resolve(15983,a,13234,a)].
% 3.35/3.66 22918 is_a_theorem(implies(not(and(not(A),B)),implies(B,implies(not(C),A)))). [resolve(22886,a,128,a),rewrite([79(8)])].
% 3.35/3.66 22919 $F. [resolve(22918,a,567,a)].
% 3.35/3.66
% 3.35/3.66 % SZS output end Refutation
% 3.35/3.66 ============================== end of proof ==========================
% 3.35/3.66
% 3.35/3.66 ============================== STATISTICS ============================
% 3.35/3.66
% 3.35/3.66 Given=1092. Generated=297490. Kept=22868. proofs=1.
% 3.35/3.66 Usable=1072. Sos=9999. Demods=5. Limbo=14, Disabled=11854. Hints=0.
% 3.35/3.66 Megabytes=16.27.
% 3.35/3.66 User_CPU=2.50, System_CPU=0.17, Wall_clock=2.
% 3.35/3.66
% 3.35/3.66 ============================== end of statistics =====================
% 3.35/3.66
% 3.35/3.66 ============================== end of search =========================
% 3.35/3.66
% 3.35/3.66 THEOREM PROVED
% 3.35/3.66 % SZS status Theorem
% 3.35/3.66
% 3.35/3.66 Exiting with 1 proof.
% 3.35/3.66
% 3.35/3.66 Process 2529 exit (max_proofs) Mon Jul 4 00:00:09 2022
% 3.35/3.66 Prover9 interrupted
%------------------------------------------------------------------------------