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

% Computer : n008.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:06 EDT 2024

% Result   : Unsatisfiable 43.18s 43.37s
% Output   : Proof 43.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem    : LCL296-3 : TPTP v8.2.0. Released v2.3.0.
% 0.08/0.15  % Command    : do_cvc5 %s %d
% 0.15/0.36  % Computer : n008.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon May 27 18:26:24 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.21/0.51  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.52  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.45/10.67  --- Run --no-e-matching --full-saturate-quant at 5...
% 15.53/15.73  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.55/20.79  --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.59/25.81  --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 30.63/30.90  --- Run --trigger-sel=max --full-saturate-quant at 5...
% 35.68/35.94  --- Run --multi-trigger-when-single --multi-trigger-priority --full-saturate-quant at 5...
% 40.83/41.08  --- Run --multi-trigger-cache --full-saturate-quant at 5...
% 43.18/43.37  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.UwQku5AF8d/cvc5---1.0.5_2793.smt2
% 43.18/43.37  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.UwQku5AF8d/cvc5---1.0.5_2793.smt2
% 43.18/43.40  (assume a0 (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A))))
% 43.18/43.40  (assume a1 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))))
% 43.18/43.40  (assume a2 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))))
% 43.18/43.40  (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))))))
% 43.18/43.40  (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))))))
% 43.18/43.40  (assume a5 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 43.18/43.40  (assume a6 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 43.18/43.40  (assume a7 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))))
% 43.18/43.40  (assume a8 (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.and P Q) (tptp.not (tptp.or (tptp.not P) (tptp.not Q))))))
% 43.18/43.40  (assume a9 (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.equivalent P Q) (tptp.and (tptp.implies P Q) (tptp.implies Q P)))))
% 43.18/43.40  (assume a10 (not (tptp.theorem (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))
% 43.18/43.40  (step t1 (cl (not (= (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule equiv_pos2)
% 43.18/43.40  (step t2 (cl (= (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule refl)
% 43.18/43.40  (step t3 (cl (= (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule refl)
% 43.18/43.40  (step t4 (cl (= (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule refl)
% 43.18/43.40  (step t5 (cl (= (= (= (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) true) (= (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule equiv_simplify)
% 43.18/43.40  (step t6 (cl (not (= (= (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) true)) (= (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule equiv1 :premises (t5))
% 43.18/43.40  (step t7 (cl (= (= (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule all_simplify)
% 43.18/43.40  (step t8 (cl (= (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule refl)
% 43.18/43.40  (step t9 (cl (= (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule all_simplify)
% 43.18/43.40  (step t10 (cl (= (= (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule cong :premises (t8 t9))
% 43.18/43.40  (step t11 (cl (= (= (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) true)) :rule all_simplify)
% 43.18/43.40  (step t12 (cl (= (= (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) true)) :rule trans :premises (t10 t11))
% 43.18/43.40  (step t13 (cl (= (= (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) true)) :rule trans :premises (t7 t12))
% 43.18/43.40  (step t14 (cl (= (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t6 t13))
% 43.18/43.40  (step t15 (cl (= (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule cong :premises (t2 t3 t4 t14))
% 43.18/43.40  (step t16 (cl (not (= (=> (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (=> (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule equiv_pos2)
% 43.18/43.40  (step t17 (cl (= (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule refl)
% 43.18/43.40  (step t18 (cl (= (= (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) false) (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule equiv_simplify)
% 43.18/43.40  (step t19 (cl (= (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) false) (not (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule equiv2 :premises (t18))
% 43.18/43.40  (step t20 (cl (not (not (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule not_not)
% 43.18/43.40  (step t21 (cl (= (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) false) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t19 t20))
% 43.18/43.40  (step t22 (cl (=> (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) false) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule implies_neg1)
% 43.18/43.40  (anchor :step t23)
% 43.18/43.40  (assume t23.a0 (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))
% 43.18/43.40  (assume t23.a1 (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))
% 43.18/43.40  (assume t23.a2 (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))
% 43.18/43.40  (assume t23.a3 (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))
% 43.18/43.40  (step t23.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 43.18/43.40  (step t23.t2 (cl (= (= true false) false)) :rule all_simplify)
% 43.18/43.40  (step t23.t3 (cl (= (= (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) true) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule equiv_simplify)
% 43.18/43.40  (step t23.t4 (cl (= (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) true) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule equiv2 :premises (t23.t3))
% 43.18/43.40  (step t23.t5 (cl (= (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) true)) :rule resolution :premises (t23.t4 t23.a3))
% 43.18/43.40  (step t23.t6 (cl (= true (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule symm :premises (t23.t5))
% 43.18/43.40  (step t23.t7 (cl (= (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule symm :premises (t23.a1))
% 43.18/43.40  (step t23.t8 (cl (= (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule symm :premises (t23.a2))
% 43.18/43.40  (step t23.t9 (cl (= (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule cong :premises (t23.t7 t23.t8))
% 43.18/43.40  (step t23.t10 (cl (= (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule cong :premises (t23.t9))
% 43.18/43.40  (step t23.t11 (cl (= (= (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) false) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule equiv_simplify)
% 43.18/43.40  (step t23.t12 (cl (= (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) false) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule equiv2 :premises (t23.t11))
% 43.18/43.40  (step t23.t13 (cl (not (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule not_not)
% 43.18/43.40  (step t23.t14 (cl (= (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) false) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule resolution :premises (t23.t12 t23.t13))
% 43.18/43.40  (step t23.t15 (cl (= (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) false)) :rule resolution :premises (t23.t14 t23.a0))
% 43.18/43.40  (step t23.t16 (cl (= true false)) :rule trans :premises (t23.t6 t23.t10 t23.t15))
% 43.18/43.40  (step t23.t17 (cl false) :rule resolution :premises (t23.t1 t23.t2 t23.t16))
% 43.18/43.40  (step t23 (cl (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) false) :rule subproof :discharge (t23.a0 t23.a1 t23.a2 t23.a3))
% 43.18/43.40  (step t24 (cl (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule and_pos)
% 43.18/43.40  (step t25 (cl (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule and_pos)
% 43.18/43.40  (step t26 (cl (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule and_pos)
% 43.18/43.40  (step t27 (cl (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule and_pos)
% 43.18/43.40  (step t28 (cl false (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule resolution :premises (t23 t24 t25 t26 t27))
% 43.18/43.40  (step t29 (cl (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) false) :rule reordering :premises (t28))
% 43.18/43.40  (step t30 (cl (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) false) :rule contraction :premises (t29))
% 43.18/43.40  (step t31 (cl (=> (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) false) false) :rule resolution :premises (t22 t30))
% 43.18/43.40  (step t32 (cl (=> (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) false) (not false)) :rule implies_neg2)
% 43.18/43.40  (step t33 (cl (=> (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) false) (=> (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) false)) :rule resolution :premises (t31 t32))
% 43.18/43.40  (step t34 (cl (=> (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) false)) :rule contraction :premises (t33))
% 43.18/43.40  (step t35 (cl (= (=> (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) false) (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule implies_simplify)
% 43.18/43.40  (step t36 (cl (not (=> (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) false)) (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule equiv1 :premises (t35))
% 43.18/43.40  (step t37 (cl (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule resolution :premises (t34 t36))
% 43.18/43.40  (step t38 (cl (= (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) false)) :rule resolution :premises (t21 t37))
% 43.18/43.40  (step t39 (cl (= (=> (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (=> (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) false))) :rule cong :premises (t17 t38))
% 43.18/43.40  (step t40 (cl (= (=> (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) false) (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule all_simplify)
% 43.18/43.40  (step t41 (cl (= (=> (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule trans :premises (t39 t40))
% 43.18/43.40  (step t42 (cl (=> (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule implies_neg1)
% 43.18/43.40  (anchor :step t43)
% 43.18/43.40  (assume t43.a0 (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))
% 43.18/43.40  (assume t43.a1 (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))
% 43.18/43.40  (assume t43.a2 (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))
% 43.18/43.40  (assume t43.a3 (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))
% 43.18/43.40  (step t43.t1 (cl (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule and_neg)
% 43.18/43.40  (step t43.t2 (cl (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t43.t1 t43.a3 t43.a1 t43.a0 t43.a2))
% 43.18/43.40  (step t43 (cl (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule subproof :discharge (t43.a0 t43.a1 t43.a2 t43.a3))
% 43.18/43.40  (step t44 (cl (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule and_pos)
% 43.18/43.40  (step t45 (cl (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule and_pos)
% 43.18/43.40  (step t46 (cl (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule and_pos)
% 43.18/43.40  (step t47 (cl (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule and_pos)
% 43.18/43.40  (step t48 (cl (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t43 t44 t45 t46 t47))
% 43.18/43.40  (step t49 (cl (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule reordering :premises (t48))
% 43.18/43.40  (step t50 (cl (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule contraction :premises (t49))
% 43.18/43.40  (step t51 (cl (=> (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t42 t50))
% 43.18/43.40  (step t52 (cl (=> (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule implies_neg2)
% 43.18/43.40  (step t53 (cl (=> (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (=> (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule resolution :premises (t51 t52))
% 43.18/43.40  (step t54 (cl (=> (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule contraction :premises (t53))
% 43.18/43.40  (step t55 (cl (not (and (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t16 t41 t54))
% 43.18/43.40  (step t56 (cl (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule not_and :premises (t55))
% 43.18/43.40  (step t57 (cl (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule or_neg)
% 43.18/43.40  (step t58 (cl (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule or_neg)
% 43.18/43.40  (step t59 (cl (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule or_neg)
% 43.18/43.40  (step t60 (cl (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule or_neg)
% 43.18/43.40  (step t61 (cl (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t56 t57 t58 t59 t60))
% 43.18/43.40  (step t62 (cl (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule contraction :premises (t61))
% 43.18/43.40  (step t63 (cl (or (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t1 t15 t62))
% 43.18/43.40  (step t64 (cl (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule or :premises (t63))
% 43.18/43.40  (step t65 (cl (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule or_pos)
% 43.18/43.40  (step t66 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))))) :rule reordering :premises (t65))
% 43.18/43.40  (step t67 (cl (not (or (tptp.theorem (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule or_pos)
% 43.18/43.40  (step t68 (cl (tptp.theorem (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (or (tptp.theorem (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule reordering :premises (t67))
% 43.18/43.40  (step t69 (cl (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule and_neg)
% 43.18/43.40  (step t70 (cl (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule implies_neg1)
% 43.18/43.40  (anchor :step t71)
% 43.18/43.40  (assume t71.a0 (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))
% 43.18/43.40  (assume t71.a1 (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))
% 43.18/43.40  (assume t71.a2 (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))
% 43.18/43.40  (assume t71.a3 (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))
% 43.18/43.40  (assume t71.a4 (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))
% 43.18/43.40  (step t71.t1 (cl (=> (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule implies_neg1)
% 43.18/43.40  (anchor :step t71.t2)
% 43.18/43.40  (assume t71.t2.a0 (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))
% 43.18/43.40  (assume t71.t2.a1 (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))
% 43.18/43.40  (assume t71.t2.a2 (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))
% 43.18/43.40  (assume t71.t2.a3 (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))
% 43.18/43.40  (assume t71.t2.a4 (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))
% 43.18/43.40  (step t71.t2.t1 (cl (= (= (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) true) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule equiv_simplify)
% 43.18/43.40  (step t71.t2.t2 (cl (not (= (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) true)) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule equiv1 :premises (t71.t2.t1))
% 43.18/43.40  (step t71.t2.t3 (cl (= (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule refl)
% 43.18/43.40  (step t71.t2.t4 (cl (= (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) :rule symm :premises (t71.t2.a2))
% 43.18/43.40  (step t71.t2.t5 (cl (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule cong :premises (t71.t2.t3 t71.t2.t4))
% 43.18/43.40  (step t71.t2.t6 (cl (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule symm :premises (t71.t2.t5))
% 43.18/43.40  (step t71.t2.t7 (cl (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule symm :premises (t71.t2.a4))
% 43.18/43.40  (step t71.t2.t8 (cl (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule symm :premises (t71.t2.t7))
% 43.18/43.40  (step t71.t2.t9 (cl (= (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule symm :premises (t71.t2.a3))
% 43.18/43.40  (step t71.t2.t10 (cl (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule symm :premises (t71.t2.t9))
% 43.18/43.40  (step t71.t2.t11 (cl (= (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule cong :premises (t71.t2.a2 t71.t2.t4))
% 43.18/43.40  (step t71.t2.t12 (cl (= (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule cong :premises (t71.t2.t11))
% 43.18/43.40  (step t71.t2.t13 (cl (= (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule symm :premises (t71.t2.t12))
% 43.18/43.40  (step t71.t2.t14 (cl (= (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule cong :premises (t71.t2.t12 t71.t2.t13))
% 43.18/43.40  (step t71.t2.t15 (cl (= (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule refl)
% 43.18/43.40  (step t71.t2.t16 (cl (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule cong :premises (t71.t2.t15 t71.t2.t12))
% 43.18/43.40  (step t71.t2.t17 (cl (= (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule trans :premises (t71.t2.t14 t71.t2.t16))
% 43.18/43.40  (step t71.t2.t18 (cl (= (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule cong :premises (t71.t2.t17))
% 43.18/43.40  (step t71.t2.t19 (cl (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule trans :premises (t71.t2.t8 t71.t2.t10 t71.t2.t18))
% 43.18/43.40  (step t71.t2.t20 (cl (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule cong :premises (t71.t2.t6 t71.t2.t19))
% 43.18/43.40  (step t71.t2.t21 (cl (= (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule refl)
% 43.18/43.40  (step t71.t2.t22 (cl (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule cong :premises (t71.t2.t5 t71.t2.t21))
% 43.18/43.40  (step t71.t2.t23 (cl (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule symm :premises (t71.t2.a1))
% 43.18/43.40  (step t71.t2.t24 (cl (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule trans :premises (t71.t2.t20 t71.t2.t22 t71.t2.t23))
% 43.18/43.40  (step t71.t2.t25 (cl (= (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule cong :premises (t71.t2.t24))
% 43.18/43.40  (step t71.t2.t26 (cl (= (= (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) true) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule equiv_simplify)
% 43.18/43.40  (step t71.t2.t27 (cl (= (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) true) (not (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule equiv2 :premises (t71.t2.t26))
% 43.18/43.40  (step t71.t2.t28 (cl (= (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) true)) :rule resolution :premises (t71.t2.t27 t71.t2.a0))
% 43.18/43.40  (step t71.t2.t29 (cl (= (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) true)) :rule trans :premises (t71.t2.t25 t71.t2.t28))
% 43.18/43.40  (step t71.t2.t30 (cl (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t71.t2.t2 t71.t2.t29))
% 43.18/43.40  (step t71.t2 (cl (not (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule subproof :discharge (t71.t2.a0 t71.t2.a1 t71.t2.a2 t71.t2.a3 t71.t2.a4))
% 43.18/43.40  (step t71.t3 (cl (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule and_pos)
% 43.18/43.40  (step t71.t4 (cl (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule and_pos)
% 43.18/43.40  (step t71.t5 (cl (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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 and_pos)
% 43.18/43.40  (step t71.t6 (cl (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule and_pos)
% 43.18/43.40  (step t71.t7 (cl (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule and_pos)
% 43.18/43.40  (step t71.t8 (cl (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule resolution :premises (t71.t2 t71.t3 t71.t4 t71.t5 t71.t6 t71.t7))
% 43.18/43.40  (step t71.t9 (cl (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule reordering :premises (t71.t8))
% 43.18/43.40  (step t71.t10 (cl (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule contraction :premises (t71.t9))
% 43.18/43.40  (step t71.t11 (cl (=> (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t71.t1 t71.t10))
% 43.18/43.40  (step t71.t12 (cl (=> (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule implies_neg2)
% 43.18/43.40  (step t71.t13 (cl (=> (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (=> (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule resolution :premises (t71.t11 t71.t12))
% 43.18/43.40  (step t71.t14 (cl (=> (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule contraction :premises (t71.t13))
% 43.18/43.40  (step t71.t15 (cl (not (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule implies :premises (t71.t14))
% 43.18/43.40  (step t71.t16 (cl (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule and_neg)
% 43.18/43.40  (step t71.t17 (cl (and (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t71.t16 t71.a4 t71.a3 t71.a0 t71.a2 t71.a1))
% 43.18/43.40  (step t71.t18 (cl (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t71.t15 t71.t17))
% 43.18/43.40  (step t71 (cl (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule subproof :discharge (t71.a0 t71.a1 t71.a2 t71.a3 t71.a4))
% 43.18/43.40  (step t72 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not 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 and_pos)
% 43.18/43.40  (step t73 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule and_pos)
% 43.18/43.40  (step t74 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule and_pos)
% 43.18/43.40  (step t75 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule and_pos)
% 43.18/43.40  (step t76 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule and_pos)
% 43.18/43.40  (step t77 (cl (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))))) :rule resolution :premises (t71 t72 t73 t74 t75 t76))
% 43.18/43.40  (step t78 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule reordering :premises (t77))
% 43.18/43.40  (step t79 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule contraction :premises (t78))
% 43.18/43.40  (step t80 (cl (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t70 t79))
% 43.18/43.40  (step t81 (cl (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule implies_neg2)
% 43.18/43.40  (step t82 (cl (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule resolution :premises (t80 t81))
% 43.18/43.40  (step t83 (cl (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule contraction :premises (t82))
% 43.18/43.40  (step t84 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule implies :premises (t83))
% 43.18/43.40  (step t85 (cl (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t69 t84))
% 43.18/43.40  (step t86 (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)
% 43.18/43.40  (anchor :step t87)
% 43.18/43.40  (assume t87.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 43.18/43.40  (step t87.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))))
% 43.18/43.40  (step t87.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 (t87.t1))
% 43.18/43.40  (step t87.t3 (cl (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule resolution :premises (t87.t2 t87.a0))
% 43.18/43.40  (step t87 (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 (t87.a0))
% 43.18/43.40  (step t88 (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 (t86 t87))
% 43.18/43.40  (step t89 (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)
% 43.18/43.40  (step t90 (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 (t88 t89))
% 43.18/43.40  (step t91 (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 (t90))
% 43.18/43.40  (step t92 (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 (t91))
% 43.18/43.40  (step t93 (cl (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule resolution :premises (t92 a5))
% 43.18/43.40  (step t94 (cl (=> (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.equivalent P Q) (tptp.and (tptp.implies P Q) (tptp.implies Q P)))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.equivalent P Q) (tptp.and (tptp.implies P Q) (tptp.implies Q P))))) :rule implies_neg1)
% 43.18/43.40  (anchor :step t95)
% 43.18/43.40  (assume t95.a0 (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.equivalent P Q) (tptp.and (tptp.implies P Q) (tptp.implies Q P)))))
% 43.18/43.40  (step t95.t1 (cl (or (not (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.equivalent P Q) (tptp.and (tptp.implies P Q) (tptp.implies Q P))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule forall_inst :args ((:= P (tptp.implies tptp.p (tptp.not tptp.q))) (:= Q (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))
% 43.18/43.40  (step t95.t2 (cl (not (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.equivalent P Q) (tptp.and (tptp.implies P Q) (tptp.implies Q P))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule or :premises (t95.t1))
% 43.18/43.40  (step t95.t3 (cl (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule resolution :premises (t95.t2 t95.a0))
% 43.18/43.40  (step t95 (cl (not (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.equivalent P Q) (tptp.and (tptp.implies P Q) (tptp.implies Q P))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule subproof :discharge (t95.a0))
% 43.18/43.40  (step t96 (cl (=> (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.equivalent P Q) (tptp.and (tptp.implies P Q) (tptp.implies Q P)))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule resolution :premises (t94 t95))
% 43.18/43.40  (step t97 (cl (=> (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.equivalent P Q) (tptp.and (tptp.implies P Q) (tptp.implies Q P)))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule implies_neg2)
% 43.18/43.40  (step t98 (cl (=> (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.equivalent P Q) (tptp.and (tptp.implies P Q) (tptp.implies Q P)))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (=> (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.equivalent P Q) (tptp.and (tptp.implies P Q) (tptp.implies Q P)))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t96 t97))
% 43.18/43.40  (step t99 (cl (=> (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.equivalent P Q) (tptp.and (tptp.implies P Q) (tptp.implies Q P)))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule contraction :premises (t98))
% 43.18/43.40  (step t100 (cl (not (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.equivalent P Q) (tptp.and (tptp.implies P Q) (tptp.implies Q P))))) (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule implies :premises (t99))
% 43.18/43.40  (step t101 (cl (= (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule resolution :premises (t100 a9))
% 43.18/43.40  (step t102 (cl (=> (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.and P Q) (tptp.not (tptp.or (tptp.not P) (tptp.not Q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.and P Q) (tptp.not (tptp.or (tptp.not P) (tptp.not Q)))))) :rule implies_neg1)
% 43.18/43.40  (anchor :step t103)
% 43.18/43.40  (assume t103.a0 (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.and P Q) (tptp.not (tptp.or (tptp.not P) (tptp.not Q))))))
% 43.18/43.40  (step t103.t1 (cl (or (not (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.and P Q) (tptp.not (tptp.or (tptp.not P) (tptp.not Q)))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule forall_inst :args ((:= P (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (:= Q (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))
% 43.18/43.40  (step t103.t2 (cl (not (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.and P Q) (tptp.not (tptp.or (tptp.not P) (tptp.not Q)))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule or :premises (t103.t1))
% 43.18/43.40  (step t103.t3 (cl (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule resolution :premises (t103.t2 t103.a0))
% 43.18/43.40  (step t103 (cl (not (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.and P Q) (tptp.not (tptp.or (tptp.not P) (tptp.not Q)))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule subproof :discharge (t103.a0))
% 43.18/43.40  (step t104 (cl (=> (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.and P Q) (tptp.not (tptp.or (tptp.not P) (tptp.not Q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule resolution :premises (t102 t103))
% 43.18/43.40  (step t105 (cl (=> (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.and P Q) (tptp.not (tptp.or (tptp.not P) (tptp.not Q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule implies_neg2)
% 43.18/43.40  (step t106 (cl (=> (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.and P Q) (tptp.not (tptp.or (tptp.not P) (tptp.not Q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (=> (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.and P Q) (tptp.not (tptp.or (tptp.not P) (tptp.not Q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t104 t105))
% 43.18/43.40  (step t107 (cl (=> (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.and P Q) (tptp.not (tptp.or (tptp.not P) (tptp.not Q))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule contraction :premises (t106))
% 43.18/43.40  (step t108 (cl (not (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.and P Q) (tptp.not (tptp.or (tptp.not P) (tptp.not Q)))))) (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule implies :premises (t107))
% 43.18/43.40  (step t109 (cl (= (tptp.and (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule resolution :premises (t108 a8))
% 43.18/43.40  (step t110 (cl (not (= (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))))) (not (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule equiv_pos2)
% 43.18/43.40  (step t111 (cl (= (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))) :rule refl)
% 43.18/43.40  (step t112 (cl (= (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule all_simplify)
% 43.18/43.40  (step t113 (cl (= (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))))) :rule cong :premises (t111 t112))
% 43.18/43.40  (step t114 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) :rule implies_neg1)
% 43.18/43.40  (anchor :step t115)
% 43.18/43.40  (assume t115.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 43.18/43.40  (step t115.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (:= Y (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))
% 43.18/43.40  (step t115.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule or :premises (t115.t1))
% 43.18/43.40  (step t115.t3 (cl (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t115.t2 t115.a0))
% 43.18/43.40  (step t115 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule subproof :discharge (t115.a0))
% 43.18/43.40  (step t116 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t114 t115))
% 43.18/43.40  (step t117 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule implies_neg2)
% 43.18/43.40  (step t118 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule resolution :premises (t116 t117))
% 43.18/43.40  (step t119 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule contraction :premises (t118))
% 43.18/43.40  (step t120 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule resolution :premises (t110 t113 t119))
% 43.18/43.40  (step t121 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule implies :premises (t120))
% 43.18/43.40  (step t122 (cl (= (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t121 a5))
% 43.18/43.40  (step t123 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule or_pos)
% 43.18/43.40  (step t124 (cl (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule reordering :premises (t123))
% 43.18/43.40  (step t125 (cl (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))))) :rule or_pos)
% 43.18/43.40  (step t126 (cl (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))))))) :rule reordering :premises (t125))
% 43.18/43.40  (step t127 (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.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A))))) :rule implies_neg1)
% 43.18/43.40  (anchor :step t128)
% 43.18/43.40  (assume t128.a0 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))))
% 43.18/43.40  (step t128.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.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))))) :rule forall_inst :args ((:= A (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (:= B (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))
% 43.18/43.40  (step t128.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.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule or :premises (t128.t1))
% 43.18/43.40  (step t128.t3 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule resolution :premises (t128.t2 t128.a0))
% 43.18/43.40  (step t128 (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.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule subproof :discharge (t128.a0))
% 43.18/43.40  (step t129 (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.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule resolution :premises (t127 t128))
% 43.18/43.40  (step t130 (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.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))))) :rule implies_neg2)
% 43.18/43.40  (step t131 (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.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (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.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))))) :rule resolution :premises (t129 t130))
% 43.18/43.40  (step t132 (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.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))))) :rule contraction :premises (t131))
% 43.18/43.40  (step t133 (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.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule implies :premises (t132))
% 43.18/43.40  (step t134 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule resolution :premises (t133 a2))
% 43.18/43.40  (step t135 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 43.18/43.40  (anchor :step t136)
% 43.18/43.40  (assume t136.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 43.18/43.40  (step t136.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.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))))
% 43.18/43.41  (step t136.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))))) :rule or :premises (t136.t1))
% 43.18/43.41  (step t136.t3 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))))) :rule resolution :premises (t136.t2 t136.a0))
% 43.18/43.41  (step t136 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))))) :rule subproof :discharge (t136.a0))
% 43.18/43.41  (step t137 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))))) :rule resolution :premises (t135 t136))
% 43.18/43.41  (step t138 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))))))) :rule implies_neg2)
% 43.18/43.41  (step t139 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies 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.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))))))) :rule resolution :premises (t137 t138))
% 43.18/43.41  (step t140 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))))))) :rule contraction :premises (t139))
% 43.18/43.41  (step t141 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))))) :rule implies :premises (t140))
% 43.18/43.41  (step t142 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))))) :rule resolution :premises (t141 a6))
% 43.18/43.41  (step t143 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule resolution :premises (t126 t134 t142))
% 43.18/43.41  (step t144 (cl (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule and_neg)
% 43.18/43.41  (step t145 (cl (=> (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule implies_neg1)
% 43.18/43.41  (anchor :step t146)
% 43.18/43.41  (assume t146.a0 (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))
% 43.18/43.41  (assume t146.a1 (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))
% 43.18/43.41  (step t146.t1 (cl (=> (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule implies_neg1)
% 43.18/43.41  (anchor :step t146.t2)
% 43.18/43.41  (assume t146.t2.a0 (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))
% 43.18/43.41  (assume t146.t2.a1 (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))
% 43.18/43.41  (step t146.t2.t1 (cl (= (= (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) true) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule equiv_simplify)
% 43.18/43.41  (step t146.t2.t2 (cl (not (= (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) true)) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule equiv1 :premises (t146.t2.t1))
% 43.18/43.41  (step t146.t2.t3 (cl (= (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule symm :premises (t146.t2.a1))
% 43.18/43.41  (step t146.t2.t4 (cl (= (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule cong :premises (t146.t2.t3))
% 43.18/43.41  (step t146.t2.t5 (cl (= (= (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) true) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule equiv_simplify)
% 43.18/43.41  (step t146.t2.t6 (cl (= (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) true) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule equiv2 :premises (t146.t2.t5))
% 43.18/43.41  (step t146.t2.t7 (cl (= (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) true)) :rule resolution :premises (t146.t2.t6 t146.t2.a0))
% 43.18/43.41  (step t146.t2.t8 (cl (= (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) true)) :rule trans :premises (t146.t2.t4 t146.t2.t7))
% 43.18/43.41  (step t146.t2.t9 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t146.t2.t2 t146.t2.t8))
% 43.18/43.41  (step t146.t2 (cl (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule subproof :discharge (t146.t2.a0 t146.t2.a1))
% 43.18/43.41  (step t146.t3 (cl (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule and_pos)
% 43.18/43.41  (step t146.t4 (cl (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule and_pos)
% 43.18/43.41  (step t146.t5 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t146.t2 t146.t3 t146.t4))
% 43.18/43.41  (step t146.t6 (cl (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule reordering :premises (t146.t5))
% 43.18/43.41  (step t146.t7 (cl (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule contraction :premises (t146.t6))
% 43.18/43.41  (step t146.t8 (cl (=> (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t146.t1 t146.t7))
% 43.18/43.41  (step t146.t9 (cl (=> (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule implies_neg2)
% 43.18/43.41  (step t146.t10 (cl (=> (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (=> (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule resolution :premises (t146.t8 t146.t9))
% 43.18/43.41  (step t146.t11 (cl (=> (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule contraction :premises (t146.t10))
% 43.18/43.41  (step t146.t12 (cl (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule implies :premises (t146.t11))
% 43.18/43.41  (step t146.t13 (cl (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule and_neg)
% 43.18/43.41  (step t146.t14 (cl (and (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule resolution :premises (t146.t13 t146.a1 t146.a0))
% 43.18/43.41  (step t146.t15 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t146.t12 t146.t14))
% 43.18/43.41  (step t146 (cl (not (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule subproof :discharge (t146.a0 t146.a1))
% 43.18/43.41  (step t147 (cl (not (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule and_pos)
% 43.18/43.41  (step t148 (cl (not (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule and_pos)
% 43.18/43.41  (step t149 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t146 t147 t148))
% 43.18/43.41  (step t150 (cl (not (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule reordering :premises (t149))
% 43.18/43.41  (step t151 (cl (not (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule contraction :premises (t150))
% 43.18/43.41  (step t152 (cl (=> (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t145 t151))
% 43.18/43.41  (step t153 (cl (=> (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule implies_neg2)
% 43.18/43.41  (step t154 (cl (=> (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (=> (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule resolution :premises (t152 t153))
% 43.18/43.41  (step t155 (cl (=> (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule contraction :premises (t154))
% 43.18/43.41  (step t156 (cl (not (and (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule implies :premises (t155))
% 43.18/43.41  (step t157 (cl (not (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t144 t156))
% 43.18/43.41  (step t158 (cl (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule reordering :premises (t157))
% 43.18/43.41  (step t159 (cl (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule or_pos)
% 43.18/43.41  (step t160 (cl (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule reordering :premises (t159))
% 43.18/43.41  (step t161 (cl (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A)))) :rule implies_neg1)
% 43.18/43.41  (anchor :step t162)
% 43.18/43.41  (assume t162.a0 (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A))))
% 43.18/43.41  (step t162.t1 (cl (or (not (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule forall_inst :args ((:= A (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))
% 43.18/43.41  (step t162.t2 (cl (not (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule or :premises (t162.t1))
% 43.18/43.41  (step t162.t3 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t162.t2 t162.a0))
% 43.18/43.41  (step t162 (cl (not (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule subproof :discharge (t162.a0))
% 43.18/43.41  (step t163 (cl (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t161 t162))
% 43.18/43.41  (step t164 (cl (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule implies_neg2)
% 43.18/43.41  (step t165 (cl (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule resolution :premises (t163 t164))
% 43.18/43.41  (step t166 (cl (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule contraction :premises (t165))
% 43.18/43.41  (step t167 (cl (not (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule implies :premises (t166))
% 43.18/43.41  (step t168 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t167 a0))
% 43.18/43.41  (step t169 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 43.18/43.41  (anchor :step t170)
% 43.18/43.41  (assume t170.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 43.18/43.41  (step t170.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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))
% 43.18/43.41  (step t170.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule or :premises (t170.t1))
% 43.18/43.41  (step t170.t3 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t170.t2 t170.a0))
% 43.18/43.41  (step t170 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule subproof :discharge (t170.a0))
% 43.18/43.41  (step t171 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t169 t170))
% 43.18/43.41  (step t172 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule implies_neg2)
% 43.18/43.41  (step t173 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies 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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule resolution :premises (t171 t172))
% 43.18/43.41  (step t174 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule contraction :premises (t173))
% 43.18/43.41  (step t175 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule implies :premises (t174))
% 43.18/43.41  (step t176 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t175 a6))
% 43.18/43.41  (step t177 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t160 t168 t176))
% 43.18/43.41  (step t178 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) :rule implies_neg1)
% 43.18/43.41  (anchor :step t179)
% 43.18/43.41  (assume t179.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 43.18/43.41  (step t179.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (:= Y (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))
% 43.18/43.41  (step t179.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule or :premises (t179.t1))
% 43.18/43.41  (step t179.t3 (cl (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t179.t2 t179.a0))
% 43.18/43.41  (step t179 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule subproof :discharge (t179.a0))
% 43.18/43.41  (step t180 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t178 t179))
% 43.18/43.41  (step t181 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule implies_neg2)
% 43.18/43.41  (step t182 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule resolution :premises (t180 t181))
% 43.18/43.41  (step t183 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule contraction :premises (t182))
% 43.18/43.41  (step t184 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule implies :premises (t183))
% 43.18/43.41  (step t185 (cl (= (tptp.implies (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t184 a5))
% 43.18/43.41  (step t186 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t158 t177 t185))
% 43.18/43.41  (step t187 (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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (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)
% 43.18/43.41  (anchor :step t188)
% 43.18/43.41  (assume t188.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))))
% 43.18/43.41  (step t188.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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (:= Y (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))
% 43.18/43.41  (step t188.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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule or :premises (t188.t1))
% 43.18/43.41  (step t188.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t188.t2 t188.a0))
% 43.18/43.41  (step t188 (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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule subproof :discharge (t188.a0))
% 43.18/43.41  (step t189 (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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t187 t188))
% 43.18/43.41  (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.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule implies_neg2)
% 43.18/43.41  (step t191 (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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule resolution :premises (t189 t190))
% 43.18/43.41  (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.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule contraction :premises (t191))
% 43.18/43.41  (step t193 (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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule implies :premises (t192))
% 43.18/43.41  (step t194 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t193 a7))
% 43.18/43.41  (step t195 (cl (tptp.theorem (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.or (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.not (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t124 t143 t186 t194))
% 43.18/43.41  (step t196 (cl (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t85 t93 t101 t109 t122 t195))
% 43.18/43.41  (step t197 (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.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (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)
% 43.18/43.41  (anchor :step t198)
% 43.18/43.41  (assume t198.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))))
% 43.18/43.41  (step t198.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.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule forall_inst :args ((:= X (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (:= Y (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))
% 43.18/43.41  (step t198.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.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule or :premises (t198.t1))
% 43.18/43.41  (step t198.t3 (cl (or (tptp.theorem (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t198.t2 t198.a0))
% 43.18/43.41  (step t198 (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.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule subproof :discharge (t198.a0))
% 43.18/43.41  (step t199 (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.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (or (tptp.theorem (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t197 t198))
% 43.18/43.41  (step t200 (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.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (or (tptp.theorem (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule implies_neg2)
% 43.18/43.41  (step t201 (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.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (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.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule resolution :premises (t199 t200))
% 43.18/43.41  (step t202 (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.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule contraction :premises (t201))
% 43.18/43.41  (step t203 (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.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule implies :premises (t202))
% 43.18/43.41  (step t204 (cl (or (tptp.theorem (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.equivalent (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t203 a7))
% 43.18/43.41  (step t205 (cl (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule resolution :premises (t68 a10 t196 t204))
% 43.18/43.41  (step t206 (cl (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule or_pos)
% 43.18/43.41  (step t207 (cl (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))))) :rule reordering :premises (t206))
% 43.18/43.41  (step t208 (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.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A))))) :rule implies_neg1)
% 43.18/43.41  (anchor :step t209)
% 43.18/43.41  (assume t209.a0 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))))
% 43.18/43.41  (step t209.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.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule forall_inst :args ((:= A (tptp.not tptp.p)) (:= B (tptp.not tptp.q))))
% 43.18/43.41  (step t209.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.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule or :premises (t209.t1))
% 43.18/43.41  (step t209.t3 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule resolution :premises (t209.t2 t209.a0))
% 43.18/43.41  (step t209 (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.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule subproof :discharge (t209.a0))
% 43.18/43.41  (step t210 (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.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule resolution :premises (t208 t209))
% 43.18/43.41  (step t211 (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.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule implies_neg2)
% 43.18/43.41  (step t212 (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.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (=> (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.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule resolution :premises (t210 t211))
% 43.18/43.41  (step t213 (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.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule contraction :premises (t212))
% 43.18/43.41  (step t214 (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.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule implies :premises (t213))
% 43.18/43.41  (step t215 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule resolution :premises (t214 a2))
% 43.18/43.41  (step t216 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 43.18/43.41  (anchor :step t217)
% 43.18/43.41  (assume t217.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 43.18/43.41  (step t217.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.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))
% 43.18/43.41  (step t217.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.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule or :premises (t217.t1))
% 43.18/43.41  (step t217.t3 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule resolution :premises (t217.t2 t217.a0))
% 43.18/43.41  (step t217 (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.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule subproof :discharge (t217.a0))
% 43.18/43.41  (step t218 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule resolution :premises (t216 t217))
% 43.18/43.41  (step t219 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))))) :rule implies_neg2)
% 43.18/43.41  (step t220 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))))) :rule resolution :premises (t218 t219))
% 43.18/43.41  (step t221 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))))) :rule contraction :premises (t220))
% 43.18/43.41  (step t222 (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.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule implies :premises (t221))
% 43.18/43.41  (step t223 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule resolution :premises (t222 a6))
% 43.18/43.41  (step t224 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule resolution :premises (t207 t215 t223))
% 43.18/43.41  (step t225 (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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) :rule implies_neg1)
% 43.18/43.41  (anchor :step t226)
% 43.18/43.41  (assume t226.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))))
% 43.18/43.41  (step t226.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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (:= Y (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))
% 43.18/43.41  (step t226.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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule or :premises (t226.t1))
% 43.18/43.41  (step t226.t3 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule resolution :premises (t226.t2 t226.a0))
% 43.18/43.41  (step t226 (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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule subproof :discharge (t226.a0))
% 43.18/43.41  (step t227 (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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule resolution :premises (t225 t226))
% 43.18/43.41  (step t228 (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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))))) :rule implies_neg2)
% 43.18/43.41  (step t229 (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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))))) :rule resolution :premises (t227 t228))
% 43.18/43.41  (step t230 (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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))))) :rule contraction :premises (t229))
% 43.18/43.41  (step t231 (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.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule implies :premises (t230))
% 43.18/43.41  (step t232 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule resolution :premises (t231 a7))
% 43.18/43.41  (step t233 (cl (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t66 t205 t224 t232))
% 43.18/43.41  (step t234 (cl (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule or_pos)
% 43.18/43.41  (step t235 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule reordering :premises (t234))
% 43.18/43.41  (step t236 (cl (not (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule or_pos)
% 43.18/43.41  (step t237 (cl (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule reordering :premises (t236))
% 43.18/43.41  (step t238 (cl (=> (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))))) (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (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)))))) :rule implies_neg1)
% 43.18/43.41  (anchor :step t239)
% 43.18/43.41  (assume t239.a0 (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))))))
% 43.18/43.41  (step t239.t1 (cl (or (not (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)))))) (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule forall_inst :args ((:= A (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (:= B (tptp.implies tptp.p (tptp.not tptp.q))) (:= C (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))
% 43.18/43.41  (step t239.t2 (cl (not (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)))))) (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule or :premises (t239.t1))
% 43.18/43.41  (step t239.t3 (cl (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t239.t2 t239.a0))
% 43.18/43.41  (step t239 (cl (not (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)))))) (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule subproof :discharge (t239.a0))
% 43.18/43.41  (step t240 (cl (=> (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))))) (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t238 t239))
% 43.18/43.41  (step t241 (cl (=> (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))))) (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule implies_neg2)
% 43.18/43.41  (step t242 (cl (=> (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))))) (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (=> (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))))) (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule resolution :premises (t240 t241))
% 43.18/43.41  (step t243 (cl (=> (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))))) (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule contraction :premises (t242))
% 43.18/43.41  (step t244 (cl (not (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)))))) (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule implies :premises (t243))
% 43.18/43.41  (step t245 (cl (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t244 a4))
% 43.18/43.41  (step t246 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 43.18/43.41  (anchor :step t247)
% 43.18/43.41  (assume t247.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 43.18/43.41  (step t247.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))
% 43.18/43.41  (step t247.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule or :premises (t247.t1))
% 43.18/43.41  (step t247.t3 (cl (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t247.t2 t247.a0))
% 43.18/43.41  (step t247 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule subproof :discharge (t247.a0))
% 43.18/43.41  (step t248 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t246 t247))
% 43.18/43.41  (step t249 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (not (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule implies_neg2)
% 43.18/43.41  (step t250 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))) (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule resolution :premises (t248 t249))
% 43.18/43.41  (step t251 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))))))) :rule contraction :premises (t250))
% 43.18/43.41  (step t252 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule implies :premises (t251))
% 43.18/43.41  (step t253 (cl (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))))) :rule resolution :premises (t252 a6))
% 43.18/43.41  (step t254 (cl (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t237 t245 t253))
% 43.18/43.41  (step t255 (cl (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule and_neg)
% 43.18/43.41  (step t256 (cl (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule implies_neg1)
% 43.18/43.41  (anchor :step t257)
% 43.18/43.41  (assume t257.a0 (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))
% 43.18/43.41  (assume t257.a1 (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))
% 43.18/43.41  (step t257.t1 (cl (=> (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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 implies_neg1)
% 43.18/43.41  (anchor :step t257.t2)
% 43.18/43.41  (assume t257.t2.a0 (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))
% 43.18/43.41  (assume t257.t2.a1 (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))
% 43.18/43.41  (step t257.t2.t1 (cl (= (= (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))) true) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule equiv_simplify)
% 43.18/43.41  (step t257.t2.t2 (cl (not (= (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))) true)) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule equiv1 :premises (t257.t2.t1))
% 43.18/43.41  (step t257.t2.t3 (cl (= (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) :rule refl)
% 43.18/43.41  (step t257.t2.t4 (cl (= (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) :rule symm :premises (t257.t2.a1))
% 43.18/43.41  (step t257.t2.t5 (cl (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule symm :premises (t257.t2.t4))
% 43.18/43.41  (step t257.t2.t6 (cl (= (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule cong :premises (t257.t2.t3 t257.t2.t5))
% 43.18/43.41  (step t257.t2.t7 (cl (= (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule cong :premises (t257.t2.t6))
% 43.18/43.41  (step t257.t2.t8 (cl (= (= (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) true) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule equiv_simplify)
% 43.18/43.41  (step t257.t2.t9 (cl (= (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) true) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule equiv2 :premises (t257.t2.t8))
% 43.18/43.41  (step t257.t2.t10 (cl (= (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) true)) :rule resolution :premises (t257.t2.t9 t257.t2.a0))
% 43.18/43.41  (step t257.t2.t11 (cl (= (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))) true)) :rule trans :premises (t257.t2.t7 t257.t2.t10))
% 43.18/43.41  (step t257.t2.t12 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule resolution :premises (t257.t2.t2 t257.t2.t11))
% 43.18/43.41  (step t257.t2 (cl (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule subproof :discharge (t257.t2.a0 t257.t2.a1))
% 43.18/43.41  (step t257.t3 (cl (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule and_pos)
% 43.18/43.41  (step t257.t4 (cl (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule and_pos)
% 43.18/43.41  (step t257.t5 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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))))) (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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 (t257.t2 t257.t3 t257.t4))
% 43.18/43.41  (step t257.t6 (cl (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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))))) (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule reordering :premises (t257.t5))
% 43.18/43.41  (step t257.t7 (cl (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule contraction :premises (t257.t6))
% 43.18/43.41  (step t257.t8 (cl (=> (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule resolution :premises (t257.t1 t257.t7))
% 43.18/43.41  (step t257.t9 (cl (=> (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule implies_neg2)
% 43.18/43.41  (step t257.t10 (cl (=> (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) (=> (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule resolution :premises (t257.t8 t257.t9))
% 43.18/43.41  (step t257.t11 (cl (=> (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule contraction :premises (t257.t10))
% 43.18/43.41  (step t257.t12 (cl (not (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule implies :premises (t257.t11))
% 43.18/43.41  (step t257.t13 (cl (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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 and_neg)
% 43.18/43.41  (step t257.t14 (cl (and (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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 (t257.t13 t257.a1 t257.a0))
% 43.18/43.41  (step t257.t15 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule resolution :premises (t257.t12 t257.t14))
% 43.18/43.41  (step t257 (cl (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule subproof :discharge (t257.a0 t257.a1))
% 43.18/43.41  (step t258 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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)
% 43.18/43.41  (step t259 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule and_pos)
% 43.18/43.41  (step t260 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule resolution :premises (t257 t258 t259))
% 43.18/43.41  (step t261 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule reordering :premises (t260))
% 43.18/43.41  (step t262 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule contraction :premises (t261))
% 43.18/43.41  (step t263 (cl (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule resolution :premises (t256 t262))
% 43.18/43.41  (step t264 (cl (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule implies_neg2)
% 43.18/43.41  (step t265 (cl (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule resolution :premises (t263 t264))
% 43.18/43.41  (step t266 (cl (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule contraction :premises (t265))
% 43.18/43.41  (step t267 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule implies :premises (t266))
% 43.18/43.41  (step t268 (cl (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule resolution :premises (t255 t267))
% 43.18/43.41  (step t269 (cl (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule or_pos)
% 43.18/43.41  (step t270 (cl (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) :rule reordering :premises (t269))
% 43.18/43.41  (step t271 (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.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A))))) :rule implies_neg1)
% 43.18/43.41  (anchor :step t272)
% 43.18/43.41  (assume t272.a0 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))))
% 43.18/43.41  (step t272.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.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule forall_inst :args ((:= A (tptp.not tptp.q)) (:= B (tptp.not tptp.p))))
% 43.18/43.41  (step t272.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.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule or :premises (t272.t1))
% 43.18/43.41  (step t272.t3 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule resolution :premises (t272.t2 t272.a0))
% 43.18/43.41  (step t272 (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.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule subproof :discharge (t272.a0))
% 43.18/43.41  (step t273 (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.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule resolution :premises (t271 t272))
% 43.18/43.41  (step t274 (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.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule implies_neg2)
% 43.18/43.41  (step t275 (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.not tptp.p)) (tptp.or (tptp.not tptp.p) (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.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule resolution :premises (t273 t274))
% 43.18/43.41  (step t276 (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.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule contraction :premises (t275))
% 43.18/43.41  (step t277 (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.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule implies :premises (t276))
% 43.18/43.41  (step t278 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule resolution :premises (t277 a2))
% 43.18/43.41  (step t279 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 43.18/43.41  (anchor :step t280)
% 43.18/43.41  (assume t280.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 43.18/43.41  (step t280.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.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))
% 43.18/43.41  (step t280.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.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule or :premises (t280.t1))
% 43.18/43.41  (step t280.t3 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule resolution :premises (t280.t2 t280.a0))
% 43.18/43.41  (step t280 (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.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule subproof :discharge (t280.a0))
% 43.18/43.41  (step t281 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule resolution :premises (t279 t280))
% 43.18/43.41  (step t282 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) :rule implies_neg2)
% 43.18/43.41  (step t283 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (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.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) :rule resolution :premises (t281 t282))
% 43.18/43.41  (step t284 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))))) :rule contraction :premises (t283))
% 43.18/43.41  (step t285 (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.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule implies :premises (t284))
% 43.18/43.41  (step t286 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))))) :rule resolution :premises (t285 a6))
% 43.18/43.41  (step t287 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule resolution :premises (t270 t278 t286))
% 43.18/43.41  (step t288 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule resolution :premises (t268 t93 t287))
% 43.18/43.41  (step t289 (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.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (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)
% 43.18/43.41  (anchor :step t290)
% 43.18/43.41  (assume t290.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))))
% 43.18/43.41  (step t290.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.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (:= Y (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))))
% 43.18/43.41  (step t290.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.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule or :premises (t290.t1))
% 43.18/43.41  (step t290.t3 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t290.t2 t290.a0))
% 43.18/43.41  (step t290 (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.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule subproof :discharge (t290.a0))
% 43.18/43.41  (step t291 (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.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t289 t290))
% 43.18/43.41  (step t292 (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.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule implies_neg2)
% 43.18/43.41  (step t293 (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.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (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.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule resolution :premises (t291 t292))
% 43.18/43.41  (step t294 (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.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q)))))))) :rule contraction :premises (t293))
% 43.18/43.41  (step t295 (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.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule implies :premises (t294))
% 43.18/43.41  (step t296 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.p (tptp.not tptp.q))))))) :rule resolution :premises (t295 a7))
% 43.18/43.41  (step t297 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule resolution :premises (t235 t254 t288 t296))
% 43.18/43.41  (step t298 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) :rule implies_neg1)
% 43.18/43.41  (anchor :step t299)
% 43.18/43.41  (assume t299.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 43.18/43.41  (step t299.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (:= Y (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))
% 43.18/43.41  (step t299.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule or :premises (t299.t1))
% 43.18/43.41  (step t299.t3 (cl (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule resolution :premises (t299.t2 t299.a0))
% 43.18/43.41  (step t299 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule subproof :discharge (t299.a0))
% 43.18/43.41  (step t300 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule resolution :premises (t298 t299))
% 43.18/43.41  (step t301 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule implies_neg2)
% 43.18/43.41  (step t302 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule resolution :premises (t300 t301))
% 43.18/43.41  (step t303 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule contraction :premises (t302))
% 43.18/43.41  (step t304 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule implies :premises (t303))
% 43.18/43.41  (step t305 (cl (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule resolution :premises (t304 a5))
% 43.18/43.41  (step t306 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) :rule implies_neg1)
% 43.18/43.41  (anchor :step t307)
% 43.18/43.41  (assume t307.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 43.18/43.41  (step t307.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (:= Y (tptp.implies tptp.p (tptp.not tptp.q)))))
% 43.18/43.41  (step t307.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule or :premises (t307.t1))
% 43.18/43.41  (step t307.t3 (cl (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule resolution :premises (t307.t2 t307.a0))
% 43.18/43.41  (step t307 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule subproof :discharge (t307.a0))
% 43.18/43.41  (step t308 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule resolution :premises (t306 t307))
% 43.18/43.41  (step t309 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (not (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule implies_neg2)
% 43.18/43.41  (step t310 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule resolution :premises (t308 t309))
% 43.18/43.41  (step t311 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q)))))) :rule contraction :premises (t310))
% 43.18/43.41  (step t312 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule implies :premises (t311))
% 43.18/43.41  (step t313 (cl (= (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.implies tptp.p (tptp.not tptp.q))))) :rule resolution :premises (t312 a5))
% 43.18/43.41  (step t314 (cl) :rule resolution :premises (t64 t233 t297 t305 t313))
% 43.18/43.41  
% 43.18/43.41  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.UwQku5AF8d/cvc5---1.0.5_2793.smt2
% 43.18/43.42  % cvc5---1.0.5 exiting
% 43.27/43.42  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------