%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : LCL321-3 : TPTP v8.2.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n022.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  : 300s
% DateTime : Wed May 29 17:25:09 EDT 2024

% Result   : Unsatisfiable 0.42s 0.60s
% Output   : Proof 0.43s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : LCL321-3 : TPTP v8.2.0. Released v2.3.0.
% 0.12/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n022.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.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 27 20:52:09 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.51  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.42/0.60  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.xtkbwlARfg/cvc5---1.0.5_6148.smt2
% 0.42/0.60  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.xtkbwlARfg/cvc5---1.0.5_6148.smt2
% 0.43/0.62  (assume a0 (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A))))
% 0.43/0.62  (assume a1 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))))
% 0.43/0.62  (assume a2 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))))
% 0.43/0.62  (assume a3 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C))))))
% 0.43/0.62  (assume a4 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.implies A B) (tptp.implies (tptp.or C A) (tptp.or C B))))))
% 0.43/0.62  (assume a5 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 0.43/0.62  (assume a6 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 0.43/0.62  (assume a7 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))))
% 0.43/0.62  (assume a8 (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))))
% 0.43/0.62  (step t1 (cl (not (= (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (not (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))))) (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) :rule equiv_pos2)
% 0.43/0.62  (step t2 (cl (= (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))))) :rule refl)
% 0.43/0.62  (step t3 (cl (= (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule refl)
% 0.43/0.62  (step t4 (cl (= (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule refl)
% 0.43/0.62  (step t5 (cl (= (= (= (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) true) (= (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) :rule equiv_simplify)
% 0.43/0.62  (step t6 (cl (not (= (= (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) true)) (= (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) :rule equiv1 :premises (t5))
% 0.43/0.62  (step t7 (cl (= (= (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))))) :rule all_simplify)
% 0.43/0.62  (step t8 (cl (= (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) :rule refl)
% 0.43/0.62  (step t9 (cl (= (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) :rule all_simplify)
% 0.43/0.62  (step t10 (cl (= (= (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (= (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) :rule cong :premises (t8 t9))
% 0.43/0.62  (step t11 (cl (= (= (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) true)) :rule all_simplify)
% 0.43/0.62  (step t12 (cl (= (= (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) true)) :rule trans :premises (t10 t11))
% 0.43/0.62  (step t13 (cl (= (= (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) true)) :rule trans :premises (t7 t12))
% 0.43/0.62  (step t14 (cl (= (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) :rule resolution :premises (t6 t13))
% 0.43/0.62  (step t15 (cl (= (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) :rule cong :premises (t2 t3 t4 t14))
% 0.43/0.62  (step t16 (cl (not (= (=> (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))))) (not (=> (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))))) :rule equiv_pos2)
% 0.43/0.62  (step t17 (cl (= (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))))) :rule refl)
% 0.43/0.62  (step t18 (cl (= (= (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) false) (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule equiv_simplify)
% 0.43/0.62  (step t19 (cl (= (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) false) (not (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule equiv2 :premises (t18))
% 0.43/0.62  (step t20 (cl (not (not (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))))) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule not_not)
% 0.43/0.62  (step t21 (cl (= (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) false) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule resolution :premises (t19 t20))
% 0.43/0.62  (step t22 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) false) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t23)
% 0.43/0.62  (assume t23.a0 (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))
% 0.43/0.62  (assume t23.a1 (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))
% 0.43/0.62  (assume t23.a2 (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))))
% 0.43/0.62  (assume t23.a3 (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))
% 0.43/0.62  (step t23.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 0.43/0.62  (step t23.t2 (cl (= (= true false) false)) :rule all_simplify)
% 0.43/0.62  (step t23.t3 (cl (= (= (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) true) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule equiv_simplify)
% 0.43/0.62  (step t23.t4 (cl (= (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) true) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule equiv2 :premises (t23.t3))
% 0.43/0.62  (step t23.t5 (cl (= (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) true)) :rule resolution :premises (t23.t4 t23.a3))
% 0.43/0.62  (step t23.t6 (cl (= true (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule symm :premises (t23.t5))
% 0.43/0.62  (step t23.t7 (cl (= (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) :rule symm :premises (t23.a2))
% 0.43/0.62  (step t23.t8 (cl (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule symm :premises (t23.t7))
% 0.43/0.62  (step t23.t9 (cl (= (tptp.not tptp.q) (tptp.not tptp.q))) :rule refl)
% 0.43/0.62  (step t23.t10 (cl (= (tptp.or (tptp.not tptp.p) tptp.q) (tptp.implies tptp.p tptp.q))) :rule symm :premises (t23.a1))
% 0.43/0.62  (step t23.t11 (cl (= (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) :rule cong :premises (t23.t9 t23.t10))
% 0.43/0.62  (step t23.t12 (cl (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) :rule trans :premises (t23.t8 t23.t11))
% 0.43/0.62  (step t23.t13 (cl (= (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) :rule cong :premises (t23.t12))
% 0.43/0.62  (step t23.t14 (cl (= (= (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))) false) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) :rule equiv_simplify)
% 0.43/0.62  (step t23.t15 (cl (= (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))) false) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) :rule equiv2 :premises (t23.t14))
% 0.43/0.62  (step t23.t16 (cl (not (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) :rule not_not)
% 0.43/0.62  (step t23.t17 (cl (= (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))) false) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) :rule resolution :premises (t23.t15 t23.t16))
% 0.43/0.62  (step t23.t18 (cl (= (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))) false)) :rule resolution :premises (t23.t17 t23.a0))
% 0.43/0.62  (step t23.t19 (cl (= true false)) :rule trans :premises (t23.t6 t23.t13 t23.t18))
% 0.43/0.62  (step t23.t20 (cl false) :rule resolution :premises (t23.t1 t23.t2 t23.t19))
% 0.43/0.62  (step t23 (cl (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) false) :rule subproof :discharge (t23.a0 t23.a1 t23.a2 t23.a3))
% 0.43/0.62  (step t24 (cl (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) :rule and_pos)
% 0.43/0.62  (step t25 (cl (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) :rule and_pos)
% 0.43/0.62  (step t26 (cl (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule and_pos)
% 0.43/0.62  (step t27 (cl (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) :rule and_pos)
% 0.43/0.62  (step t28 (cl false (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t23 t24 t25 t26 t27))
% 0.43/0.62  (step t29 (cl (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) false) :rule reordering :premises (t28))
% 0.43/0.62  (step t30 (cl (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) false) :rule contraction :premises (t29))
% 0.43/0.62  (step t31 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) false) false) :rule resolution :premises (t22 t30))
% 0.43/0.62  (step t32 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) false) (not false)) :rule implies_neg2)
% 0.43/0.62  (step t33 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) false) (=> (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) false)) :rule resolution :premises (t31 t32))
% 0.43/0.62  (step t34 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) false)) :rule contraction :premises (t33))
% 0.43/0.62  (step t35 (cl (= (=> (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) false) (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule implies_simplify)
% 0.43/0.62  (step t36 (cl (not (=> (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) false)) (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule equiv1 :premises (t35))
% 0.43/0.62  (step t37 (cl (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t34 t36))
% 0.43/0.62  (step t38 (cl (= (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) false)) :rule resolution :premises (t21 t37))
% 0.43/0.62  (step t39 (cl (= (=> (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (=> (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) false))) :rule cong :premises (t17 t38))
% 0.43/0.62  (step t40 (cl (= (=> (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) false) (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))))) :rule all_simplify)
% 0.43/0.62  (step t41 (cl (= (=> (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))))) :rule trans :premises (t39 t40))
% 0.43/0.62  (step t42 (cl (=> (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t43)
% 0.43/0.62  (assume t43.a0 (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))
% 0.43/0.62  (assume t43.a1 (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))))
% 0.43/0.62  (assume t43.a2 (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))
% 0.43/0.62  (assume t43.a3 (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))
% 0.43/0.62  (step t43.t1 (cl (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule and_neg)
% 0.43/0.62  (step t43.t2 (cl (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule resolution :premises (t43.t1 t43.a3 t43.a0 t43.a1 t43.a2))
% 0.43/0.62  (step t43 (cl (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule subproof :discharge (t43.a0 t43.a1 t43.a2 t43.a3))
% 0.43/0.62  (step t44 (cl (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) :rule and_pos)
% 0.43/0.62  (step t45 (cl (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule and_pos)
% 0.43/0.62  (step t46 (cl (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) :rule and_pos)
% 0.43/0.62  (step t47 (cl (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) :rule and_pos)
% 0.43/0.62  (step t48 (cl (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))))) :rule resolution :premises (t43 t44 t45 t46 t47))
% 0.43/0.62  (step t49 (cl (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule reordering :premises (t48))
% 0.43/0.62  (step t50 (cl (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule contraction :premises (t49))
% 0.43/0.62  (step t51 (cl (=> (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule resolution :premises (t42 t50))
% 0.43/0.62  (step t52 (cl (=> (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (not (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule implies_neg2)
% 0.43/0.62  (step t53 (cl (=> (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) (=> (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t51 t52))
% 0.43/0.62  (step t54 (cl (=> (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) (and (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule contraction :premises (t53))
% 0.43/0.62  (step t55 (cl (not (and (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))))) :rule resolution :premises (t16 t41 t54))
% 0.43/0.62  (step t56 (cl (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) :rule not_and :premises (t55))
% 0.43/0.62  (step t57 (cl (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (not (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))))) :rule or_neg)
% 0.43/0.62  (step t58 (cl (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (not (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule or_neg)
% 0.43/0.62  (step t59 (cl (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (not (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule or_neg)
% 0.43/0.62  (step t60 (cl (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (not (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))))) :rule or_neg)
% 0.43/0.62  (step t61 (cl (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))))) :rule resolution :premises (t56 t57 t58 t59 t60))
% 0.43/0.62  (step t62 (cl (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))))) :rule contraction :premises (t61))
% 0.43/0.62  (step t63 (cl (or (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) :rule resolution :premises (t1 t15 t62))
% 0.43/0.62  (step t64 (cl (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) :rule or :premises (t63))
% 0.43/0.62  (step t65 (cl (not (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) :rule or_pos)
% 0.43/0.62  (step t66 (cl (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))) (not (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))))) :rule reordering :premises (t65))
% 0.43/0.62  (step t67 (cl (not (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) :rule or_pos)
% 0.43/0.62  (step t68 (cl (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule reordering :premises (t67))
% 0.43/0.62  (step t69 (cl (not (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule or_pos)
% 0.43/0.62  (step t70 (cl (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule reordering :premises (t69))
% 0.43/0.62  (step t71 (cl (not (= (or (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) (not (or (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule equiv_pos2)
% 0.43/0.62  (step t72 (cl (= (= (= (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) true) (= (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule equiv_simplify)
% 0.43/0.62  (step t73 (cl (not (= (= (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) true)) (= (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule equiv1 :premises (t72))
% 0.43/0.62  (step t74 (cl (= (= (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule all_simplify)
% 0.43/0.62  (step t75 (cl (= (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule refl)
% 0.43/0.62  (step t76 (cl (= (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule all_simplify)
% 0.43/0.62  (step t77 (cl (= (= (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule cong :premises (t75 t76))
% 0.43/0.62  (step t78 (cl (= (= (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) true)) :rule all_simplify)
% 0.43/0.62  (step t79 (cl (= (= (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))))) true)) :rule trans :premises (t77 t78))
% 0.43/0.62  (step t80 (cl (= (= (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) true)) :rule trans :premises (t74 t79))
% 0.43/0.62  (step t81 (cl (= (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule resolution :premises (t73 t80))
% 0.43/0.62  (step t82 (cl (= (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule refl)
% 0.43/0.62  (step t83 (cl (= (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule refl)
% 0.43/0.62  (step t84 (cl (= (or (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) :rule cong :premises (t81 t82 t83))
% 0.43/0.62  (step t85 (cl (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule and_neg)
% 0.43/0.62  (step t86 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t87)
% 0.43/0.62  (assume t87.a0 (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))))
% 0.43/0.62  (assume t87.a1 (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))
% 0.43/0.62  (step t87.t1 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t87.t2)
% 0.43/0.62  (assume t87.t2.a0 (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))))
% 0.43/0.62  (assume t87.t2.a1 (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))
% 0.43/0.62  (step t87.t2.t1 (cl (= (= (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) false) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule equiv_simplify)
% 0.43/0.62  (step t87.t2.t2 (cl (not (= (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) false)) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule equiv1 :premises (t87.t2.t1))
% 0.43/0.62  (step t87.t2.t3 (cl (= (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p tptp.q))) :rule refl)
% 0.43/0.62  (step t87.t2.t4 (cl (= (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) :rule symm :premises (t87.t2.a1))
% 0.43/0.62  (step t87.t2.t5 (cl (= (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule cong :premises (t87.t2.t3 t87.t2.t4))
% 0.43/0.62  (step t87.t2.t6 (cl (= (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule cong :premises (t87.t2.t5))
% 0.43/0.62  (step t87.t2.t7 (cl (= (= (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))) false) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule equiv_simplify)
% 0.43/0.62  (step t87.t2.t8 (cl (= (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))) false) (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule equiv2 :premises (t87.t2.t7))
% 0.43/0.62  (step t87.t2.t9 (cl (not (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule not_not)
% 0.43/0.62  (step t87.t2.t10 (cl (= (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))) false) (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule resolution :premises (t87.t2.t8 t87.t2.t9))
% 0.43/0.62  (step t87.t2.t11 (cl (= (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))) false)) :rule resolution :premises (t87.t2.t10 t87.t2.a0))
% 0.43/0.62  (step t87.t2.t12 (cl (= (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) false)) :rule trans :premises (t87.t2.t6 t87.t2.t11))
% 0.43/0.62  (step t87.t2.t13 (cl (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t87.t2.t2 t87.t2.t12))
% 0.43/0.62  (step t87.t2 (cl (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule subproof :discharge (t87.t2.a0 t87.t2.a1))
% 0.43/0.62  (step t87.t3 (cl (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule and_pos)
% 0.43/0.62  (step t87.t4 (cl (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule and_pos)
% 0.43/0.62  (step t87.t5 (cl (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t87.t2 t87.t3 t87.t4))
% 0.43/0.62  (step t87.t6 (cl (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule reordering :premises (t87.t5))
% 0.43/0.62  (step t87.t7 (cl (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule contraction :premises (t87.t6))
% 0.43/0.62  (step t87.t8 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t87.t1 t87.t7))
% 0.43/0.62  (step t87.t9 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule implies_neg2)
% 0.43/0.62  (step t87.t10 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (=> (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule resolution :premises (t87.t8 t87.t9))
% 0.43/0.62  (step t87.t11 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule contraction :premises (t87.t10))
% 0.43/0.62  (step t87.t12 (cl (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule implies :premises (t87.t11))
% 0.43/0.62  (step t87.t13 (cl (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule and_neg)
% 0.43/0.62  (step t87.t14 (cl (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule resolution :premises (t87.t13 t87.a0 t87.a1))
% 0.43/0.62  (step t87.t15 (cl (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t87.t12 t87.t14))
% 0.43/0.62  (step t87 (cl (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule subproof :discharge (t87.a0 t87.a1))
% 0.43/0.62  (step t88 (cl (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule and_pos)
% 0.43/0.62  (step t89 (cl (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule and_pos)
% 0.43/0.62  (step t90 (cl (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t87 t88 t89))
% 0.43/0.62  (step t91 (cl (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule reordering :premises (t90))
% 0.43/0.62  (step t92 (cl (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule contraction :premises (t91))
% 0.43/0.62  (step t93 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t86 t92))
% 0.43/0.62  (step t94 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule implies_neg2)
% 0.43/0.62  (step t95 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (=> (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule resolution :premises (t93 t94))
% 0.43/0.62  (step t96 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule contraction :premises (t95))
% 0.43/0.62  (step t97 (cl (not (and (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule implies :premises (t96))
% 0.43/0.62  (step t98 (cl (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t85 t97))
% 0.43/0.62  (step t99 (cl (or (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule or_neg)
% 0.43/0.62  (step t100 (cl (or (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule or_neg)
% 0.43/0.62  (step t101 (cl (or (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule or_neg)
% 0.43/0.62  (step t102 (cl (or (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (or (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (or (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule resolution :premises (t98 t99 t100 t101))
% 0.43/0.62  (step t103 (cl (or (not (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule contraction :premises (t102))
% 0.43/0.62  (step t104 (cl (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule resolution :premises (t71 t84 t103))
% 0.43/0.62  (step t105 (cl (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule or :premises (t104))
% 0.43/0.62  (step t106 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t107)
% 0.43/0.62  (assume t107.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 0.43/0.62  (step t107.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule forall_inst :args ((:= X tptp.p) (:= Y (tptp.not tptp.q))))
% 0.43/0.62  (step t107.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule or :premises (t107.t1))
% 0.43/0.62  (step t107.t3 (cl (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule resolution :premises (t107.t2 t107.a0))
% 0.43/0.62  (step t107 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule subproof :discharge (t107.a0))
% 0.43/0.62  (step t108 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule resolution :premises (t106 t107))
% 0.43/0.62  (step t109 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule implies_neg2)
% 0.43/0.62  (step t110 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule resolution :premises (t108 t109))
% 0.43/0.62  (step t111 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule contraction :premises (t110))
% 0.43/0.62  (step t112 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule implies :premises (t111))
% 0.43/0.62  (step t113 (cl (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule resolution :premises (t112 a5))
% 0.43/0.62  (step t114 (cl (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t105 a8 t113))
% 0.43/0.62  (step t115 (cl (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule or_pos)
% 0.43/0.62  (step t116 (cl (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))))) :rule reordering :premises (t115))
% 0.43/0.62  (step t117 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C)))))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t118)
% 0.43/0.62  (assume t118.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C))))))
% 0.43/0.62  (step t118.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C)))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule forall_inst :args ((:= A (tptp.not tptp.p)) (:= B (tptp.implies tptp.p tptp.q)) (:= C (tptp.not tptp.q))))
% 0.43/0.62  (step t118.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C)))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule or :premises (t118.t1))
% 0.43/0.62  (step t118.t3 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t118.t2 t118.a0))
% 0.43/0.62  (step t118 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C)))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule subproof :discharge (t118.a0))
% 0.43/0.62  (step t119 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t117 t118))
% 0.43/0.62  (step t120 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule implies_neg2)
% 0.43/0.62  (step t121 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule resolution :premises (t119 t120))
% 0.43/0.62  (step t122 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule contraction :premises (t121))
% 0.43/0.62  (step t123 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C)))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule implies :premises (t122))
% 0.43/0.62  (step t124 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t123 a3))
% 0.43/0.62  (step t125 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t126)
% 0.43/0.62  (assume t126.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 0.43/0.62  (step t126.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))
% 0.43/0.62  (step t126.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) :rule or :premises (t126.t1))
% 0.43/0.62  (step t126.t3 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) :rule resolution :premises (t126.t2 t126.a0))
% 0.43/0.62  (step t126 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) :rule subproof :discharge (t126.a0))
% 0.43/0.62  (step t127 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) :rule resolution :premises (t125 t126))
% 0.43/0.62  (step t128 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))))) :rule implies_neg2)
% 0.43/0.62  (step t129 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))))) :rule resolution :premises (t127 t128))
% 0.43/0.62  (step t130 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))))) :rule contraction :premises (t129))
% 0.43/0.62  (step t131 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) :rule implies :premises (t130))
% 0.43/0.62  (step t132 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) :rule resolution :premises (t131 a6))
% 0.43/0.62  (step t133 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t116 t124 t132))
% 0.43/0.62  (step t134 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t135)
% 0.43/0.62  (assume t135.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))))
% 0.43/0.62  (step t135.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (:= Y (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))
% 0.43/0.62  (step t135.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule or :premises (t135.t1))
% 0.43/0.62  (step t135.t3 (cl (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule resolution :premises (t135.t2 t135.a0))
% 0.43/0.62  (step t135 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule subproof :discharge (t135.a0))
% 0.43/0.62  (step t136 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule resolution :premises (t134 t135))
% 0.43/0.62  (step t137 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) (not (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule implies_neg2)
% 0.43/0.62  (step t138 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule resolution :premises (t136 t137))
% 0.43/0.62  (step t139 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule contraction :premises (t138))
% 0.43/0.62  (step t140 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule implies :premises (t139))
% 0.43/0.62  (step t141 (cl (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule resolution :premises (t140 a7))
% 0.43/0.62  (step t142 (cl (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule resolution :premises (t70 t114 t133 t141))
% 0.43/0.62  (step t143 (cl (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule or_pos)
% 0.43/0.62  (step t144 (cl (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))))) :rule reordering :premises (t143))
% 0.43/0.62  (step t145 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A))))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t146)
% 0.43/0.62  (assume t146.a0 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))))
% 0.43/0.62  (step t146.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule forall_inst :args ((:= A (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (:= B (tptp.not tptp.p))))
% 0.43/0.62  (step t146.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule or :premises (t146.t1))
% 0.43/0.62  (step t146.t3 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule resolution :premises (t146.t2 t146.a0))
% 0.43/0.62  (step t146 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule subproof :discharge (t146.a0))
% 0.43/0.62  (step t147 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule resolution :premises (t145 t146))
% 0.43/0.62  (step t148 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule implies_neg2)
% 0.43/0.62  (step t149 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule resolution :premises (t147 t148))
% 0.43/0.62  (step t150 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule contraction :premises (t149))
% 0.43/0.62  (step t151 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule implies :premises (t150))
% 0.43/0.62  (step t152 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule resolution :premises (t151 a1))
% 0.43/0.62  (step t153 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t154)
% 0.43/0.62  (assume t154.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 0.43/0.62  (step t154.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))
% 0.43/0.62  (step t154.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule or :premises (t154.t1))
% 0.43/0.62  (step t154.t3 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule resolution :premises (t154.t2 t154.a0))
% 0.43/0.62  (step t154 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule subproof :discharge (t154.a0))
% 0.43/0.62  (step t155 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule resolution :premises (t153 t154))
% 0.43/0.62  (step t156 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))))) :rule implies_neg2)
% 0.43/0.62  (step t157 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))))) :rule resolution :premises (t155 t156))
% 0.43/0.62  (step t158 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))))) :rule contraction :premises (t157))
% 0.43/0.62  (step t159 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule implies :premises (t158))
% 0.43/0.62  (step t160 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule resolution :premises (t159 a6))
% 0.43/0.62  (step t161 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule resolution :premises (t144 t152 t160))
% 0.43/0.62  (step t162 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t163)
% 0.43/0.62  (assume t163.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))))
% 0.43/0.62  (step t163.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (:= Y (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))
% 0.43/0.62  (step t163.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule or :premises (t163.t1))
% 0.43/0.62  (step t163.t3 (cl (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule resolution :premises (t163.t2 t163.a0))
% 0.43/0.62  (step t163 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule subproof :discharge (t163.a0))
% 0.43/0.62  (step t164 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule resolution :premises (t162 t163))
% 0.43/0.62  (step t165 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule implies_neg2)
% 0.43/0.62  (step t166 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule resolution :premises (t164 t165))
% 0.43/0.62  (step t167 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule contraction :premises (t166))
% 0.43/0.62  (step t168 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule implies :premises (t167))
% 0.43/0.62  (step t169 (cl (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule resolution :premises (t168 a7))
% 0.43/0.62  (step t170 (cl (not (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) :rule resolution :premises (t68 t142 t161 t169))
% 0.43/0.62  (step t171 (cl (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule or_pos)
% 0.43/0.62  (step t172 (cl (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule reordering :premises (t171))
% 0.43/0.62  (step t173 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A))))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t174)
% 0.43/0.62  (assume t174.a0 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))))
% 0.43/0.62  (step t174.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule forall_inst :args ((:= A (tptp.not tptp.q)) (:= B (tptp.implies tptp.p tptp.q))))
% 0.43/0.62  (step t174.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) :rule or :premises (t174.t1))
% 0.43/0.62  (step t174.t3 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) :rule resolution :premises (t174.t2 t174.a0))
% 0.43/0.62  (step t174 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) :rule subproof :discharge (t174.a0))
% 0.43/0.62  (step t175 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) :rule resolution :premises (t173 t174))
% 0.43/0.62  (step t176 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule implies_neg2)
% 0.43/0.62  (step t177 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule resolution :premises (t175 t176))
% 0.43/0.62  (step t178 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))) :rule contraction :premises (t177))
% 0.43/0.62  (step t179 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) :rule implies :premises (t178))
% 0.43/0.62  (step t180 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) :rule resolution :premises (t179 a2))
% 0.43/0.62  (step t181 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t182)
% 0.43/0.62  (assume t182.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 0.43/0.62  (step t182.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))
% 0.43/0.62  (step t182.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule or :premises (t182.t1))
% 0.43/0.62  (step t182.t3 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule resolution :premises (t182.t2 t182.a0))
% 0.43/0.62  (step t182 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule subproof :discharge (t182.a0))
% 0.43/0.62  (step t183 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule resolution :premises (t181 t182))
% 0.43/0.62  (step t184 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule implies_neg2)
% 0.43/0.62  (step t185 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule resolution :premises (t183 t184))
% 0.43/0.62  (step t186 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))))))) :rule contraction :premises (t185))
% 0.43/0.62  (step t187 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule implies :premises (t186))
% 0.43/0.62  (step t188 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))))) :rule resolution :premises (t187 a6))
% 0.43/0.62  (step t189 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) :rule resolution :premises (t172 t180 t188))
% 0.43/0.62  (step t190 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t191)
% 0.43/0.62  (assume t191.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))))
% 0.43/0.62  (step t191.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (:= Y (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))
% 0.43/0.62  (step t191.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) :rule or :premises (t191.t1))
% 0.43/0.62  (step t191.t3 (cl (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) :rule resolution :premises (t191.t2 t191.a0))
% 0.43/0.62  (step t191 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) :rule subproof :discharge (t191.a0))
% 0.43/0.62  (step t192 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) :rule resolution :premises (t190 t191))
% 0.43/0.62  (step t193 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (not (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))))) :rule implies_neg2)
% 0.43/0.62  (step t194 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))))) :rule resolution :premises (t192 t193))
% 0.43/0.62  (step t195 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))))) :rule contraction :premises (t194))
% 0.43/0.62  (step t196 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) :rule implies :premises (t195))
% 0.43/0.62  (step t197 (cl (or (tptp.theorem (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)) (tptp.or (tptp.implies tptp.p tptp.q) (tptp.not tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q)))))) :rule resolution :premises (t196 a7))
% 0.43/0.62  (step t198 (cl (not (tptp.theorem (tptp.or (tptp.not tptp.q) (tptp.implies tptp.p tptp.q))))) :rule resolution :premises (t66 t170 t189 t197))
% 0.43/0.62  (step t199 (cl (not (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule or_pos)
% 0.43/0.62  (step t200 (cl (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule reordering :premises (t199))
% 0.43/0.62  (step t201 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A))))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t202)
% 0.43/0.62  (assume t202.a0 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))))
% 0.43/0.62  (step t202.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A))))) (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule forall_inst :args ((:= A tptp.q) (:= B (tptp.not tptp.p))))
% 0.43/0.62  (step t202.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A))))) (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) :rule or :premises (t202.t1))
% 0.43/0.62  (step t202.t3 (cl (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t202.t2 t202.a0))
% 0.43/0.62  (step t202 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A))))) (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) :rule subproof :discharge (t202.a0))
% 0.43/0.62  (step t203 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t201 t202))
% 0.43/0.62  (step t204 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule implies_neg2)
% 0.43/0.62  (step t205 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule resolution :premises (t203 t204))
% 0.43/0.62  (step t206 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))) :rule contraction :premises (t205))
% 0.43/0.62  (step t207 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A))))) (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) :rule implies :premises (t206))
% 0.43/0.62  (step t208 (cl (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t207 a1))
% 0.43/0.62  (step t209 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t210)
% 0.43/0.62  (assume t210.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 0.43/0.62  (step t210.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule forall_inst :args ((:= X (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))
% 0.43/0.62  (step t210.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule or :premises (t210.t1))
% 0.43/0.62  (step t210.t3 (cl (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t210.t2 t210.a0))
% 0.43/0.62  (step t210 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule subproof :discharge (t210.a0))
% 0.43/0.62  (step t211 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t209 t210))
% 0.43/0.62  (step t212 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule implies_neg2)
% 0.43/0.62  (step t213 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule resolution :premises (t211 t212))
% 0.43/0.62  (step t214 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule contraction :premises (t213))
% 0.43/0.62  (step t215 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule implies :premises (t214))
% 0.43/0.62  (step t216 (cl (or (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t215 a6))
% 0.43/0.62  (step t217 (cl (tptp.theorem (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t200 t208 t216))
% 0.43/0.62  (step t218 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t219)
% 0.43/0.62  (assume t219.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 0.43/0.62  (step t219.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))))) :rule forall_inst :args ((:= X tptp.q) (:= Y (tptp.or (tptp.not tptp.p) tptp.q))))
% 0.43/0.62  (step t219.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule or :premises (t219.t1))
% 0.43/0.62  (step t219.t3 (cl (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t219.t2 t219.a0))
% 0.43/0.62  (step t219 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule subproof :discharge (t219.a0))
% 0.43/0.62  (step t220 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t218 t219))
% 0.43/0.62  (step t221 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))))) :rule implies_neg2)
% 0.43/0.62  (step t222 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))))) :rule resolution :premises (t220 t221))
% 0.43/0.62  (step t223 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))))) :rule contraction :premises (t222))
% 0.43/0.62  (step t224 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule implies :premises (t223))
% 0.43/0.62  (step t225 (cl (= (tptp.implies tptp.q (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t224 a5))
% 0.43/0.62  (step t226 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) :rule implies_neg1)
% 0.43/0.62  (anchor :step t227)
% 0.43/0.62  (assume t227.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 0.43/0.62  (step t227.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule forall_inst :args ((:= X tptp.p) (:= Y tptp.q)))
% 0.43/0.62  (step t227.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) :rule or :premises (t227.t1))
% 0.43/0.62  (step t227.t3 (cl (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) :rule resolution :premises (t227.t2 t227.a0))
% 0.43/0.62  (step t227 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) :rule subproof :discharge (t227.a0))
% 0.43/0.62  (step t228 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) :rule resolution :premises (t226 t227))
% 0.43/0.62  (step t229 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule implies_neg2)
% 0.43/0.62  (step t230 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t228 t229))
% 0.43/0.62  (step t231 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule contraction :premises (t230))
% 0.43/0.62  (step t232 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) :rule implies :premises (t231))
% 0.43/0.62  (step t233 (cl (= (tptp.implies tptp.p tptp.q) (tptp.or (tptp.not tptp.p) tptp.q))) :rule resolution :premises (t232 a5))
% 0.43/0.62  (step t234 (cl) :rule resolution :premises (t64 t198 t217 t225 t233))
% 0.43/0.62  
% 0.43/0.62  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.xtkbwlARfg/cvc5---1.0.5_6148.smt2
% 0.43/0.62  % cvc5---1.0.5 exiting
% 0.43/0.63  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------