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

% Computer : n032.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:24:48 EDT 2024

% Result   : Unsatisfiable 44.31s 44.51s
% Output   : Proof 44.31s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem    : LCL187-3 : TPTP v8.2.0. Released v2.3.0.
% 0.06/0.11  % Command    : do_cvc5 %s %d
% 0.11/0.30  % Computer : n032.cluster.edu
% 0.11/0.30  % Model    : x86_64 x86_64
% 0.11/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30  % Memory   : 8042.1875MB
% 0.11/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30  % CPULimit   : 300
% 0.11/0.30  % WCLimit    : 300
% 0.11/0.30  % DateTime   : Mon May 27 22:03:23 EDT 2024
% 0.11/0.30  % CPUTime    : 
% 0.15/0.40  %----Proving TF0_NAR, FOF, or CNF
% 0.15/0.40  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.43/10.60  --- Run --no-e-matching --full-saturate-quant at 5...
% 15.44/15.65  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.49/20.70  --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.59/25.75  --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 30.62/30.86  --- Run --trigger-sel=max --full-saturate-quant at 5...
% 35.70/35.89  --- Run --multi-trigger-when-single --multi-trigger-priority --full-saturate-quant at 5...
% 40.85/41.05  --- Run --multi-trigger-cache --full-saturate-quant at 5...
% 44.31/44.51  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.OjDM3GqhrZ/cvc5---1.0.5_1621.smt2
% 44.31/44.51  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.OjDM3GqhrZ/cvc5---1.0.5_1621.smt2
% 44.31/44.53  (assume a0 (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A))))
% 44.31/44.53  (assume a1 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))))
% 44.31/44.53  (assume a2 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))))
% 44.31/44.53  (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))))))
% 44.31/44.53  (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))))))
% 44.31/44.53  (assume a5 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 44.31/44.53  (assume a6 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 44.31/44.53  (assume a7 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))))
% 44.31/44.53  (assume a8 (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))))
% 44.31/44.53  (step t1 (cl (not (= (or (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (or (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (not (or (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))))) (or (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule equiv_pos2)
% 44.31/44.53  (step t2 (cl (= (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule refl)
% 44.31/44.53  (step t3 (cl (= (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule refl)
% 44.31/44.53  (step t4 (cl (= (= (= (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) true) (= (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule equiv_simplify)
% 44.31/44.53  (step t5 (cl (not (= (= (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) true)) (= (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule equiv1 :premises (t4))
% 44.31/44.53  (step t6 (cl (= (= (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))))) :rule all_simplify)
% 44.31/44.53  (step t7 (cl (= (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule refl)
% 44.31/44.53  (step t8 (cl (= (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule all_simplify)
% 44.31/44.53  (step t9 (cl (= (= (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (= (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule cong :premises (t7 t8))
% 44.31/44.53  (step t10 (cl (= (= (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) true)) :rule all_simplify)
% 44.31/44.53  (step t11 (cl (= (= (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) true)) :rule trans :premises (t9 t10))
% 44.31/44.53  (step t12 (cl (= (= (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) true)) :rule trans :premises (t6 t11))
% 44.31/44.53  (step t13 (cl (= (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule resolution :premises (t5 t12))
% 44.31/44.53  (step t14 (cl (= (or (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (or (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule cong :premises (t2 t3 t13))
% 44.31/44.53  (step t15 (cl (not (= (=> (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) (not (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))))) (not (=> (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) (not (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule equiv_pos2)
% 44.31/44.53  (step t16 (cl (= (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule refl)
% 44.31/44.53  (step t17 (cl (= (= (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) false) (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule equiv_simplify)
% 44.31/44.53  (step t18 (cl (= (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) false) (not (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule equiv2 :premises (t17))
% 44.31/44.53  (step t19 (cl (not (not (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))))) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule not_not)
% 44.31/44.53  (step t20 (cl (= (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) false) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule resolution :premises (t18 t19))
% 44.31/44.53  (step t21 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) false) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t22)
% 44.31/44.53  (assume t22.a0 (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))
% 44.31/44.53  (assume t22.a1 (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))
% 44.31/44.53  (assume t22.a2 (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))
% 44.31/44.53  (step t22.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 44.31/44.53  (step t22.t2 (cl (= (= true false) false)) :rule all_simplify)
% 44.31/44.53  (step t22.t3 (cl (= (= (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) true) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule equiv_simplify)
% 44.31/44.53  (step t22.t4 (cl (= (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) true) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule equiv2 :premises (t22.t3))
% 44.31/44.53  (step t22.t5 (cl (= (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) true)) :rule resolution :premises (t22.t4 t22.a2))
% 44.31/44.53  (step t22.t6 (cl (= true (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule symm :premises (t22.t5))
% 44.31/44.53  (step t22.t7 (cl (= (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) :rule symm :premises (t22.a1))
% 44.31/44.53  (step t22.t8 (cl (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) :rule symm :premises (t22.t7))
% 44.31/44.53  (step t22.t9 (cl (= (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule cong :premises (t22.t8))
% 44.31/44.53  (step t22.t10 (cl (= (= (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) false) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule equiv_simplify)
% 44.31/44.53  (step t22.t11 (cl (= (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) false) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule equiv2 :premises (t22.t10))
% 44.31/44.53  (step t22.t12 (cl (not (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) :rule not_not)
% 44.31/44.53  (step t22.t13 (cl (= (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) false) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) :rule resolution :premises (t22.t11 t22.t12))
% 44.31/44.53  (step t22.t14 (cl (= (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) false)) :rule resolution :premises (t22.t13 t22.a0))
% 44.31/44.53  (step t22.t15 (cl (= true false)) :rule trans :premises (t22.t6 t22.t9 t22.t14))
% 44.31/44.53  (step t22.t16 (cl false) :rule resolution :premises (t22.t1 t22.t2 t22.t15))
% 44.31/44.53  (step t22 (cl (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) false) :rule subproof :discharge (t22.a0 t22.a1 t22.a2))
% 44.31/44.53  (step t23 (cl (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule and_pos)
% 44.31/44.53  (step t24 (cl (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) :rule and_pos)
% 44.31/44.53  (step t25 (cl (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) :rule and_pos)
% 44.31/44.53  (step t26 (cl false (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule resolution :premises (t22 t23 t24 t25))
% 44.31/44.53  (step t27 (cl (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) false) :rule reordering :premises (t26))
% 44.31/44.53  (step t28 (cl (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) false) :rule contraction :premises (t27))
% 44.31/44.53  (step t29 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) false) false) :rule resolution :premises (t21 t28))
% 44.31/44.53  (step t30 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) false) (not false)) :rule implies_neg2)
% 44.31/44.53  (step t31 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) false) (=> (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) false)) :rule resolution :premises (t29 t30))
% 44.31/44.53  (step t32 (cl (=> (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) false)) :rule contraction :premises (t31))
% 44.31/44.53  (step t33 (cl (= (=> (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) false) (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule implies_simplify)
% 44.31/44.53  (step t34 (cl (not (=> (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) false)) (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule equiv1 :premises (t33))
% 44.31/44.53  (step t35 (cl (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule resolution :premises (t32 t34))
% 44.31/44.53  (step t36 (cl (= (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) false)) :rule resolution :premises (t20 t35))
% 44.31/44.53  (step t37 (cl (= (=> (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) (=> (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) false))) :rule cong :premises (t16 t36))
% 44.31/44.53  (step t38 (cl (= (=> (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) false) (not (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))))) :rule all_simplify)
% 44.31/44.53  (step t39 (cl (= (=> (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) (not (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))))) :rule trans :premises (t37 t38))
% 44.31/44.53  (step t40 (cl (=> (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t41)
% 44.31/44.53  (assume t41.a0 (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))
% 44.31/44.53  (assume t41.a1 (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))
% 44.31/44.53  (assume t41.a2 (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))
% 44.31/44.53  (step t41.t1 (cl (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule and_neg)
% 44.31/44.53  (step t41.t2 (cl (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule resolution :premises (t41.t1 t41.a2 t41.a0 t41.a1))
% 44.31/44.53  (step t41 (cl (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule subproof :discharge (t41.a0 t41.a1 t41.a2))
% 44.31/44.53  (step t42 (cl (not (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) :rule and_pos)
% 44.31/44.53  (step t43 (cl (not (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) :rule and_pos)
% 44.31/44.53  (step t44 (cl (not (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule and_pos)
% 44.31/44.53  (step t45 (cl (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (not (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (not (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule resolution :premises (t41 t42 t43 t44))
% 44.31/44.53  (step t46 (cl (not (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (not (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (not (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule reordering :premises (t45))
% 44.31/44.53  (step t47 (cl (not (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule contraction :premises (t46))
% 44.31/44.53  (step t48 (cl (=> (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule resolution :premises (t40 t47))
% 44.31/44.53  (step t49 (cl (=> (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) (not (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule implies_neg2)
% 44.31/44.53  (step t50 (cl (=> (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) (=> (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule resolution :premises (t48 t49))
% 44.31/44.53  (step t51 (cl (=> (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) (and (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule contraction :premises (t50))
% 44.31/44.53  (step t52 (cl (not (and (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule resolution :premises (t15 t39 t51))
% 44.31/44.53  (step t53 (cl (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule not_and :premises (t52))
% 44.31/44.53  (step t54 (cl (or (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (not (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule or_neg)
% 44.31/44.53  (step t55 (cl (or (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (not (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule or_neg)
% 44.31/44.53  (step t56 (cl (or (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (not (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule or_neg)
% 44.31/44.53  (step t57 (cl (or (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (or (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (or (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule resolution :premises (t53 t54 t55 t56))
% 44.31/44.53  (step t58 (cl (or (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule contraction :premises (t57))
% 44.31/44.53  (step t59 (cl (or (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule resolution :premises (t1 t14 t58))
% 44.31/44.53  (step t60 (cl (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) :rule or :premises (t59))
% 44.31/44.53  (step t61 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule or_pos)
% 44.31/44.53  (step t62 (cl (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule reordering :premises (t61))
% 44.31/44.53  (step t63 (cl (not (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) :rule or_pos)
% 44.31/44.53  (step t64 (cl (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule reordering :premises (t63))
% 44.31/44.53  (step t65 (cl (not (= (or (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (or (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))))) (not (or (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) (or (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule equiv_pos2)
% 44.31/44.53  (step t66 (cl (= (= (= (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) true) (= (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))))) :rule equiv_simplify)
% 44.31/44.53  (step t67 (cl (not (= (= (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) true)) (= (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) :rule equiv1 :premises (t66))
% 44.31/44.53  (step t68 (cl (= (= (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))) (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))))))) :rule all_simplify)
% 44.31/44.53  (step t69 (cl (= (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) :rule refl)
% 44.31/44.53  (step t70 (cl (= (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) :rule all_simplify)
% 44.31/44.53  (step t71 (cl (= (= (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))) (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))))) (= (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))))) :rule cong :premises (t69 t70))
% 44.31/44.53  (step t72 (cl (= (= (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))) (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) true)) :rule all_simplify)
% 44.31/44.53  (step t73 (cl (= (= (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))) (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))))) true)) :rule trans :premises (t71 t72))
% 44.31/44.53  (step t74 (cl (= (= (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) true)) :rule trans :premises (t68 t73))
% 44.31/44.53  (step t75 (cl (= (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) :rule resolution :premises (t67 t74))
% 44.31/44.53  (step t76 (cl (= (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))))) :rule refl)
% 44.31/44.53  (step t77 (cl (= (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule refl)
% 44.31/44.53  (step t78 (cl (= (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule refl)
% 44.31/44.53  (step t79 (cl (= (or (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (or (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))))) :rule cong :premises (t75 t76 t77 t78))
% 44.31/44.53  (step t80 (cl (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) :rule and_neg)
% 44.31/44.53  (step t81 (cl (=> (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t82)
% 44.31/44.53  (assume t82.a0 (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))))
% 44.31/44.53  (assume t82.a1 (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))))
% 44.31/44.53  (assume t82.a2 (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))
% 44.31/44.53  (step t82.t1 (cl (=> (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t82.t2)
% 44.31/44.53  (assume t82.t2.a0 (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))))
% 44.31/44.53  (assume t82.t2.a1 (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))))
% 44.31/44.53  (assume t82.t2.a2 (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))
% 44.31/44.53  (step t82.t2.t1 (cl (= (= (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) false) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule equiv_simplify)
% 44.31/44.53  (step t82.t2.t2 (cl (not (= (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) false)) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule equiv1 :premises (t82.t2.t1))
% 44.31/44.53  (step t82.t2.t3 (cl (= (tptp.not tptp.p) (tptp.not tptp.p))) :rule refl)
% 44.31/44.53  (step t82.t2.t4 (cl (= (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q) (tptp.implies (tptp.not tptp.p) tptp.q))) :rule symm :premises (t82.t2.a2))
% 44.31/44.53  (step t82.t2.t5 (cl (= (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) :rule cong :premises (t82.t2.t3 t82.t2.t4))
% 44.31/44.53  (step t82.t2.t6 (cl (= (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) :rule symm :premises (t82.t2.a1))
% 44.31/44.53  (step t82.t2.t7 (cl (= (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)) (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) :rule trans :premises (t82.t2.t5 t82.t2.t6))
% 44.31/44.53  (step t82.t2.t8 (cl (= (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) :rule cong :premises (t82.t2.t7))
% 44.31/44.53  (step t82.t2.t9 (cl (= (= (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))) false) (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))))) :rule equiv_simplify)
% 44.31/44.53  (step t82.t2.t10 (cl (= (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))) false) (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))))) :rule equiv2 :premises (t82.t2.t9))
% 44.31/44.53  (step t82.t2.t11 (cl (not (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))))) (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) :rule not_not)
% 44.31/44.53  (step t82.t2.t12 (cl (= (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))) false) (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t82.t2.t10 t82.t2.t11))
% 44.31/44.53  (step t82.t2.t13 (cl (= (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))) false)) :rule resolution :premises (t82.t2.t12 t82.t2.a0))
% 44.31/44.53  (step t82.t2.t14 (cl (= (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) false)) :rule trans :premises (t82.t2.t8 t82.t2.t13))
% 44.31/44.53  (step t82.t2.t15 (cl (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule resolution :premises (t82.t2.t2 t82.t2.t14))
% 44.31/44.53  (step t82.t2 (cl (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule subproof :discharge (t82.t2.a0 t82.t2.a1 t82.t2.a2))
% 44.31/44.53  (step t82.t3 (cl (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) :rule and_pos)
% 44.31/44.53  (step t82.t4 (cl (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) :rule and_pos)
% 44.31/44.53  (step t82.t5 (cl (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) :rule and_pos)
% 44.31/44.53  (step t82.t6 (cl (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule resolution :premises (t82.t2 t82.t3 t82.t4 t82.t5))
% 44.31/44.53  (step t82.t7 (cl (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule reordering :premises (t82.t6))
% 44.31/44.53  (step t82.t8 (cl (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule contraction :premises (t82.t7))
% 44.31/44.53  (step t82.t9 (cl (=> (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule resolution :premises (t82.t1 t82.t8))
% 44.31/44.53  (step t82.t10 (cl (=> (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule implies_neg2)
% 44.31/44.53  (step t82.t11 (cl (=> (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (=> (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule resolution :premises (t82.t9 t82.t10))
% 44.31/44.53  (step t82.t12 (cl (=> (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule contraction :premises (t82.t11))
% 44.31/44.53  (step t82.t13 (cl (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule implies :premises (t82.t12))
% 44.31/44.53  (step t82.t14 (cl (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) :rule and_neg)
% 44.31/44.53  (step t82.t15 (cl (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) :rule resolution :premises (t82.t14 t82.a0 t82.a1 t82.a2))
% 44.31/44.53  (step t82.t16 (cl (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule resolution :premises (t82.t13 t82.t15))
% 44.31/44.53  (step t82 (cl (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule subproof :discharge (t82.a0 t82.a1 t82.a2))
% 44.31/44.53  (step t83 (cl (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) :rule and_pos)
% 44.31/44.53  (step t84 (cl (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) :rule and_pos)
% 44.31/44.53  (step t85 (cl (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) :rule and_pos)
% 44.31/44.53  (step t86 (cl (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule resolution :premises (t82 t83 t84 t85))
% 44.31/44.53  (step t87 (cl (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule reordering :premises (t86))
% 44.31/44.53  (step t88 (cl (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule contraction :premises (t87))
% 44.31/44.53  (step t89 (cl (=> (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule resolution :premises (t81 t88))
% 44.31/44.53  (step t90 (cl (=> (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule implies_neg2)
% 44.31/44.53  (step t91 (cl (=> (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (=> (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule resolution :premises (t89 t90))
% 44.31/44.53  (step t92 (cl (=> (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule contraction :premises (t91))
% 44.31/44.53  (step t93 (cl (not (and (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule implies :premises (t92))
% 44.31/44.53  (step t94 (cl (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule resolution :premises (t80 t93))
% 44.31/44.53  (step t95 (cl (or (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))))) :rule or_neg)
% 44.31/44.53  (step t96 (cl (or (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))))) :rule or_neg)
% 44.31/44.53  (step t97 (cl (or (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule or_neg)
% 44.31/44.53  (step t98 (cl (or (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule or_neg)
% 44.31/44.53  (step t99 (cl (or (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (or (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (or (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (or (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule resolution :premises (t94 t95 t96 t97 t98))
% 44.31/44.53  (step t100 (cl (or (not (not (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule contraction :premises (t99))
% 44.31/44.53  (step t101 (cl (or (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule resolution :premises (t65 t79 t100))
% 44.31/44.53  (step t102 (cl (tptp.theorem (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule or :premises (t101))
% 44.31/44.53  (step t103 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t104)
% 44.31/44.53  (assume t104.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 44.31/44.53  (step t104.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))))) :rule forall_inst :args ((:= X tptp.p) (:= Y (tptp.implies (tptp.not tptp.p) tptp.q))))
% 44.31/44.53  (step t104.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) :rule or :premises (t104.t1))
% 44.31/44.53  (step t104.t3 (cl (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t104.t2 t104.a0))
% 44.31/44.53  (step t104 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) :rule subproof :discharge (t104.a0))
% 44.31/44.53  (step t105 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t103 t104))
% 44.31/44.53  (step t106 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (not (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))))) :rule implies_neg2)
% 44.31/44.53  (step t107 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))))) :rule resolution :premises (t105 t106))
% 44.31/44.53  (step t108 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q))))) :rule contraction :premises (t107))
% 44.31/44.53  (step t109 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) :rule implies :premises (t108))
% 44.31/44.53  (step t110 (cl (= (tptp.implies tptp.p (tptp.implies (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.implies (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t109 a5))
% 44.31/44.53  (step t111 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t112)
% 44.31/44.53  (assume t112.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 44.31/44.53  (step t112.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) :rule forall_inst :args ((:= X (tptp.not tptp.p)) (:= Y tptp.q)))
% 44.31/44.53  (step t112.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) :rule or :premises (t112.t1))
% 44.31/44.53  (step t112.t3 (cl (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) :rule resolution :premises (t112.t2 t112.a0))
% 44.31/44.53  (step t112 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) :rule subproof :discharge (t112.a0))
% 44.31/44.53  (step t113 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) :rule resolution :premises (t111 t112))
% 44.31/44.53  (step t114 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) :rule implies_neg2)
% 44.31/44.53  (step t115 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) :rule resolution :premises (t113 t114))
% 44.31/44.53  (step t116 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) :rule contraction :premises (t115))
% 44.31/44.53  (step t117 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) :rule implies :premises (t116))
% 44.31/44.53  (step t118 (cl (= (tptp.implies (tptp.not tptp.p) tptp.q) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) :rule resolution :premises (t117 a5))
% 44.31/44.53  (step t119 (cl (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule resolution :premises (t102 a8 t110 t118))
% 44.31/44.53  (step t120 (cl (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule or_pos)
% 44.31/44.53  (step t121 (cl (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))))) :rule reordering :premises (t120))
% 44.31/44.53  (step t122 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C)))))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t123)
% 44.31/44.53  (assume t123.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C))))))
% 44.31/44.53  (step t123.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C)))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule forall_inst :args ((:= A (tptp.not (tptp.not tptp.p))) (:= B (tptp.not tptp.p)) (:= C tptp.q)))
% 44.31/44.53  (step t123.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C)))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule or :premises (t123.t1))
% 44.31/44.53  (step t123.t3 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule resolution :premises (t123.t2 t123.a0))
% 44.31/44.53  (step t123 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C)))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule subproof :discharge (t123.a0))
% 44.31/44.53  (step t124 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule resolution :premises (t122 t123))
% 44.31/44.53  (step t125 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule implies_neg2)
% 44.31/44.53  (step t126 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule resolution :premises (t124 t125))
% 44.31/44.53  (step t127 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))) :rule contraction :premises (t126))
% 44.31/44.53  (step t128 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A (tptp.or B C)) (tptp.or B (tptp.or A C)))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule implies :premises (t127))
% 44.31/44.53  (step t129 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule resolution :premises (t128 a3))
% 44.31/44.53  (step t130 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t131)
% 44.31/44.53  (assume t131.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 44.31/44.53  (step t131.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.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))))
% 44.31/44.53  (step t131.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))))) :rule or :premises (t131.t1))
% 44.31/44.53  (step t131.t3 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))))) :rule resolution :premises (t131.t2 t131.a0))
% 44.31/44.53  (step t131 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))))) :rule subproof :discharge (t131.a0))
% 44.31/44.53  (step t132 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))))) :rule resolution :premises (t130 t131))
% 44.31/44.53  (step t133 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))))) :rule implies_neg2)
% 44.31/44.53  (step t134 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))))) (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))))) :rule resolution :premises (t132 t133))
% 44.31/44.53  (step t135 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))))))) :rule contraction :premises (t134))
% 44.31/44.53  (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.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))))) :rule implies :premises (t135))
% 44.31/44.53  (step t137 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))))) :rule resolution :premises (t136 a6))
% 44.31/44.53  (step t138 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) :rule resolution :premises (t121 t129 t137))
% 44.31/44.53  (step t139 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t140)
% 44.31/44.53  (assume t140.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))))
% 44.31/44.53  (step t140.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (:= Y (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))
% 44.31/44.53  (step t140.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule or :premises (t140.t1))
% 44.31/44.53  (step t140.t3 (cl (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t140.t2 t140.a0))
% 44.31/44.53  (step t140 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule subproof :discharge (t140.a0))
% 44.31/44.53  (step t141 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t139 t140))
% 44.31/44.53  (step t142 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule implies_neg2)
% 44.31/44.53  (step t143 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule resolution :premises (t141 t142))
% 44.31/44.53  (step t144 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule contraction :premises (t143))
% 44.31/44.53  (step t145 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule implies :premises (t144))
% 44.31/44.53  (step t146 (cl (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.or (tptp.not (tptp.not tptp.p)) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t145 a7))
% 44.31/44.53  (step t147 (cl (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) :rule resolution :premises (t64 t119 t138 t146))
% 44.31/44.53  (step t148 (cl (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) :rule or_pos)
% 44.31/44.53  (step t149 (cl (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule reordering :premises (t148))
% 44.31/44.53  (step t150 (cl (not (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) :rule or_pos)
% 44.31/44.53  (step t151 (cl (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule reordering :premises (t150))
% 44.31/44.53  (step t152 (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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A))))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t153)
% 44.31/44.53  (assume t153.a0 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))))
% 44.31/44.53  (step t153.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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) :rule forall_inst :args ((:= A tptp.q) (:= B (tptp.not tptp.p))))
% 44.31/44.53  (step t153.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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule or :premises (t153.t1))
% 44.31/44.53  (step t153.t3 (cl (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t153.t2 t153.a0))
% 44.31/44.53  (step t153 (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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule subproof :discharge (t153.a0))
% 44.31/44.53  (step t154 (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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t152 t153))
% 44.31/44.53  (step t155 (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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) :rule implies_neg2)
% 44.31/44.53  (step t156 (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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) 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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) :rule resolution :premises (t154 t155))
% 44.31/44.53  (step t157 (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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) :rule contraction :premises (t156))
% 44.31/44.53  (step t158 (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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule implies :premises (t157))
% 44.31/44.53  (step t159 (cl (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t158 a2))
% 44.31/44.53  (step t160 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t161)
% 44.31/44.53  (assume t161.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 44.31/44.53  (step t161.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))
% 44.31/44.53  (step t161.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule or :premises (t161.t1))
% 44.31/44.53  (step t161.t3 (cl (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t161.t2 t161.a0))
% 44.31/44.53  (step t161 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule subproof :discharge (t161.a0))
% 44.31/44.53  (step t162 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t160 t161))
% 44.31/44.53  (step t163 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule implies_neg2)
% 44.31/44.53  (step t164 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule resolution :premises (t162 t163))
% 44.31/44.53  (step t165 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule contraction :premises (t164))
% 44.31/44.53  (step t166 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule implies :premises (t165))
% 44.31/44.53  (step t167 (cl (or (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.axiom (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t166 a6))
% 44.31/44.53  (step t168 (cl (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) :rule resolution :premises (t151 t159 t167))
% 44.31/44.53  (step t169 (cl (not (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule or_pos)
% 44.31/44.53  (step t170 (cl (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))))) :rule reordering :premises (t169))
% 44.31/44.53  (step t171 (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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) 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)
% 44.31/44.53  (anchor :step t172)
% 44.31/44.53  (assume t172.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))))))
% 44.31/44.53  (step t172.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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule forall_inst :args ((:= A (tptp.or tptp.q (tptp.not tptp.p))) (:= B (tptp.or (tptp.not tptp.p) tptp.q)) (:= C (tptp.not (tptp.not tptp.p)))))
% 44.31/44.53  (step t172.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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule or :premises (t172.t1))
% 44.31/44.53  (step t172.t3 (cl (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t172.t2 t172.a0))
% 44.31/44.53  (step t172 (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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule subproof :discharge (t172.a0))
% 44.31/44.53  (step t173 (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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t171 t172))
% 44.31/44.53  (step t174 (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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule implies_neg2)
% 44.31/44.53  (step t175 (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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) 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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule resolution :premises (t173 t174))
% 44.31/44.53  (step t176 (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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule contraction :premises (t175))
% 44.31/44.53  (step t177 (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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule implies :premises (t176))
% 44.31/44.53  (step t178 (cl (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t177 a4))
% 44.31/44.53  (step t179 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t180)
% 44.31/44.53  (assume t180.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 44.31/44.53  (step t180.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.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))))
% 44.31/44.53  (step t180.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))))) :rule or :premises (t180.t1))
% 44.31/44.53  (step t180.t3 (cl (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))))) :rule resolution :premises (t180.t2 t180.a0))
% 44.31/44.53  (step t180 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))))) :rule subproof :discharge (t180.a0))
% 44.31/44.53  (step t181 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))))) :rule resolution :premises (t179 t180))
% 44.31/44.53  (step t182 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))))) (not (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))))) :rule implies_neg2)
% 44.31/44.53  (step t183 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))))) (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))))) :rule resolution :premises (t181 t182))
% 44.31/44.53  (step t184 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))))) :rule contraction :premises (t183))
% 44.31/44.53  (step t185 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))))) :rule implies :premises (t184))
% 44.31/44.53  (step t186 (cl (or (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.axiom (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))))) :rule resolution :premises (t185 a6))
% 44.31/44.53  (step t187 (cl (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t170 t178 t186))
% 44.31/44.53  (step t188 (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.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y))))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t189)
% 44.31/44.53  (assume t189.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))))
% 44.31/44.53  (step t189.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.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (:= Y (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))
% 44.31/44.53  (step t189.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.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule or :premises (t189.t1))
% 44.31/44.53  (step t189.t3 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t189.t2 t189.a0))
% 44.31/44.53  (step t189 (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.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule subproof :discharge (t189.a0))
% 44.31/44.53  (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.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t188 t189))
% 44.31/44.53  (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.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule implies_neg2)
% 44.31/44.53  (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.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule resolution :premises (t190 t191))
% 44.31/44.53  (step t193 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))))) :rule contraction :premises (t192))
% 44.31/44.53  (step t194 (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.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule implies :premises (t193))
% 44.31/44.53  (step t195 (cl (or (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))) (not (tptp.theorem (tptp.implies (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) (not (tptp.theorem (tptp.implies (tptp.or tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q)))))) :rule resolution :premises (t194 a7))
% 44.31/44.53  (step t196 (cl (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) :rule resolution :premises (t149 t168 t187 t195))
% 44.31/44.53  (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.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or 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)
% 44.31/44.53  (anchor :step t198)
% 44.31/44.53  (assume t198.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))))
% 44.31/44.53  (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.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (:= Y (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))
% 44.31/44.53  (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.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule or :premises (t198.t1))
% 44.31/44.53  (step t198.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule resolution :premises (t198.t2 t198.a0))
% 44.31/44.53  (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.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule subproof :discharge (t198.a0))
% 44.31/44.53  (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.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule resolution :premises (t197 t198))
% 44.31/44.53  (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.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule implies_neg2)
% 44.31/44.53  (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.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or 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.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule resolution :premises (t199 t200))
% 44.31/44.53  (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.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule contraction :premises (t201))
% 44.31/44.53  (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.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule implies :premises (t202))
% 44.31/44.53  (step t204 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))) (not (tptp.theorem (tptp.implies (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule resolution :premises (t203 a7))
% 44.31/44.53  (step t205 (cl (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule resolution :premises (t62 t147 t196 t204))
% 44.31/44.53  (step t206 (cl (not (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule or_pos)
% 44.31/44.53  (step t207 (cl (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule reordering :premises (t206))
% 44.31/44.53  (step t208 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A))))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t209)
% 44.31/44.53  (assume t209.a0 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))))
% 44.31/44.53  (step t209.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule forall_inst :args ((:= A (tptp.not tptp.p)) (:= B tptp.q)))
% 44.31/44.53  (step t209.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) :rule or :premises (t209.t1))
% 44.31/44.53  (step t209.t3 (cl (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) :rule resolution :premises (t209.t2 t209.a0))
% 44.31/44.53  (step t209 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) :rule subproof :discharge (t209.a0))
% 44.31/44.53  (step t210 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) :rule resolution :premises (t208 t209))
% 44.31/44.53  (step t211 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule implies_neg2)
% 44.31/44.53  (step t212 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule resolution :premises (t210 t211))
% 44.31/44.53  (step t213 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule contraction :premises (t212))
% 44.31/44.53  (step t214 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) :rule implies :premises (t213))
% 44.31/44.53  (step t215 (cl (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) :rule resolution :premises (t214 a1))
% 44.31/44.53  (step t216 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t217)
% 44.31/44.53  (assume t217.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 44.31/44.53  (step t217.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))
% 44.31/44.53  (step t217.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule or :premises (t217.t1))
% 44.31/44.53  (step t217.t3 (cl (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule resolution :premises (t217.t2 t217.a0))
% 44.31/44.53  (step t217 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule subproof :discharge (t217.a0))
% 44.31/44.53  (step t218 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule resolution :premises (t216 t217))
% 44.31/44.53  (step t219 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) (not (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule implies_neg2)
% 44.31/44.53  (step t220 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule resolution :premises (t218 t219))
% 44.31/44.53  (step t221 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))))))) :rule contraction :premises (t220))
% 44.31/44.53  (step t222 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule implies :premises (t221))
% 44.31/44.53  (step t223 (cl (or (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))))) :rule resolution :premises (t222 a6))
% 44.31/44.53  (step t224 (cl (tptp.theorem (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))))) :rule resolution :premises (t207 t215 t223))
% 44.31/44.53  (step t225 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) :rule implies_neg1)
% 44.31/44.53  (anchor :step t226)
% 44.31/44.53  (assume t226.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 44.31/44.53  (step t226.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule forall_inst :args ((:= X (tptp.not tptp.p)) (:= Y (tptp.or tptp.q (tptp.not tptp.p)))))
% 44.31/44.53  (step t226.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) :rule or :premises (t226.t1))
% 44.31/44.53  (step t226.t3 (cl (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) :rule resolution :premises (t226.t2 t226.a0))
% 44.31/44.53  (step t226 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) :rule subproof :discharge (t226.a0))
% 44.31/44.53  (step t227 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) :rule resolution :premises (t225 t226))
% 44.31/44.53  (step t228 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (not (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule implies_neg2)
% 44.31/44.53  (step t229 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule resolution :premises (t227 t228))
% 44.31/44.53  (step t230 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p)))))) :rule contraction :premises (t229))
% 44.31/44.53  (step t231 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) :rule implies :premises (t230))
% 44.31/44.53  (step t232 (cl (= (tptp.implies (tptp.not tptp.p) (tptp.or tptp.q (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or tptp.q (tptp.not tptp.p))))) :rule resolution :premises (t231 a5))
% 44.31/44.53  (step t233 (cl) :rule resolution :premises (t60 t205 t224 t232))
% 44.31/44.53  
% 44.31/44.54  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.OjDM3GqhrZ/cvc5---1.0.5_1621.smt2
% 44.31/44.54  % cvc5---1.0.5 exiting
% 44.31/44.55  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------