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

% Computer : n011.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:42 EDT 2024

% Result   : Unsatisfiable 0.21s 0.52s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : LCL171-3 : TPTP v8.2.0. Released v2.3.0.
% 0.03/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n011.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 27 23:04:39 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.52  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.hQQbgvTfRu/cvc5---1.0.5_29391.smt2
% 0.21/0.52  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.hQQbgvTfRu/cvc5---1.0.5_29391.smt2
% 0.21/0.53  (assume a0 (forall ((A $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A A) A))))
% 0.21/0.53  (assume a1 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies A (tptp.or B A)))))
% 0.21/0.53  (assume a2 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))))
% 0.21/0.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))))))
% 0.21/0.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))))))
% 0.21/0.53  (assume a5 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 0.21/0.53  (assume a6 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 0.21/0.53  (assume a7 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.theorem (tptp.implies Y X))) (not (tptp.theorem Y)))))
% 0.21/0.53  (assume a8 (not (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))
% 0.21/0.53  (step t1 (cl (not (= (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))))) (not (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule equiv_pos2)
% 0.21/0.53  (step t2 (cl (= (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule refl)
% 0.21/0.53  (step t3 (cl (= (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule refl)
% 0.21/0.53  (step t4 (cl (= (= (= (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) true) (= (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule equiv_simplify)
% 0.21/0.53  (step t5 (cl (not (= (= (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) true)) (= (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) :rule equiv1 :premises (t4))
% 0.21/0.53  (step t6 (cl (= (= (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (= (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))))) :rule all_simplify)
% 0.21/0.53  (step t7 (cl (= (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) :rule refl)
% 0.21/0.53  (step t8 (cl (= (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) :rule all_simplify)
% 0.21/0.53  (step t9 (cl (= (= (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (= (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule cong :premises (t7 t8))
% 0.21/0.53  (step t10 (cl (= (= (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) true)) :rule all_simplify)
% 0.21/0.53  (step t11 (cl (= (= (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) true)) :rule trans :premises (t9 t10))
% 0.21/0.53  (step t12 (cl (= (= (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) true)) :rule trans :premises (t6 t11))
% 0.21/0.53  (step t13 (cl (= (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) :rule resolution :premises (t5 t12))
% 0.21/0.53  (step t14 (cl (= (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule refl)
% 0.21/0.53  (step t15 (cl (= (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))))) :rule cong :premises (t2 t3 t13 t14))
% 0.21/0.53  (step t16 (cl (not (= (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))))) (not (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule equiv_pos2)
% 0.21/0.53  (step t17 (cl (= (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule refl)
% 0.21/0.53  (step t18 (cl (= (= (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) false) (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))))) :rule equiv_simplify)
% 0.21/0.53  (step t19 (cl (= (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) false) (not (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))))) :rule equiv2 :premises (t18))
% 0.21/0.53  (step t20 (cl (not (not (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))))) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule not_not)
% 0.21/0.53  (step t21 (cl (= (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) false) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule resolution :premises (t19 t20))
% 0.21/0.53  (step t22 (cl (=> (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) false) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule implies_neg1)
% 0.21/0.53  (anchor :step t23)
% 0.21/0.53  (assume t23.a0 (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))
% 0.21/0.53  (assume t23.a1 (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))
% 0.21/0.53  (assume t23.a2 (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))
% 0.21/0.53  (assume t23.a3 (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))
% 0.21/0.53  (step t23.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 0.21/0.53  (step t23.t2 (cl (= (= false true) false)) :rule all_simplify)
% 0.21/0.53  (step t23.t3 (cl (= (= (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) false) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule equiv_simplify)
% 0.21/0.53  (step t23.t4 (cl (= (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) false) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule equiv2 :premises (t23.t3))
% 0.21/0.53  (step t23.t5 (cl (not (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) :rule not_not)
% 0.21/0.53  (step t23.t6 (cl (= (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) false) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) :rule resolution :premises (t23.t4 t23.t5))
% 0.21/0.53  (step t23.t7 (cl (= (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) false)) :rule resolution :premises (t23.t6 t23.a3))
% 0.21/0.53  (step t23.t8 (cl (= false (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) :rule symm :premises (t23.t7))
% 0.21/0.53  (step t23.t9 (cl (= (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.implies tptp.p (tptp.not tptp.q)))) :rule symm :premises (t23.a1))
% 0.21/0.53  (step t23.t10 (cl (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule symm :premises (t23.t9))
% 0.21/0.53  (step t23.t11 (cl (= (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)) (tptp.implies tptp.q (tptp.not tptp.p)))) :rule symm :premises (t23.a2))
% 0.21/0.53  (step t23.t12 (cl (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) :rule symm :premises (t23.t11))
% 0.21/0.53  (step t23.t13 (cl (= (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))) (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule cong :premises (t23.t10 t23.t12))
% 0.21/0.53  (step t23.t14 (cl (= (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule cong :premises (t23.t13))
% 0.21/0.53  (step t23.t15 (cl (= (= (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) true) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule equiv_simplify)
% 0.21/0.53  (step t23.t16 (cl (= (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) true) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule equiv2 :premises (t23.t15))
% 0.21/0.53  (step t23.t17 (cl (= (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) true)) :rule resolution :premises (t23.t16 t23.a0))
% 0.21/0.53  (step t23.t18 (cl (= false true)) :rule trans :premises (t23.t8 t23.t14 t23.t17))
% 0.21/0.53  (step t23.t19 (cl false) :rule resolution :premises (t23.t1 t23.t2 t23.t18))
% 0.21/0.53  (step t23 (cl (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) false) :rule subproof :discharge (t23.a0 t23.a1 t23.a2 t23.a3))
% 0.21/0.53  (step t24 (cl (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule and_pos)
% 0.21/0.53  (step t25 (cl (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule and_pos)
% 0.21/0.53  (step t26 (cl (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) :rule and_pos)
% 0.21/0.53  (step t27 (cl (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) :rule and_pos)
% 0.21/0.53  (step t28 (cl false (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))))) :rule resolution :premises (t23 t24 t25 t26 t27))
% 0.21/0.53  (step t29 (cl (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) false) :rule reordering :premises (t28))
% 0.21/0.53  (step t30 (cl (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) false) :rule contraction :premises (t29))
% 0.21/0.53  (step t31 (cl (=> (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) false) false) :rule resolution :premises (t22 t30))
% 0.21/0.53  (step t32 (cl (=> (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) false) (not false)) :rule implies_neg2)
% 0.21/0.53  (step t33 (cl (=> (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) false) (=> (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) false)) :rule resolution :premises (t31 t32))
% 0.21/0.53  (step t34 (cl (=> (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) false)) :rule contraction :premises (t33))
% 0.21/0.53  (step t35 (cl (= (=> (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) false) (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))))) :rule implies_simplify)
% 0.21/0.53  (step t36 (cl (not (=> (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) false)) (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))))) :rule equiv1 :premises (t35))
% 0.21/0.53  (step t37 (cl (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))))) :rule resolution :premises (t34 t36))
% 0.21/0.53  (step t38 (cl (= (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) false)) :rule resolution :premises (t21 t37))
% 0.21/0.53  (step t39 (cl (= (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) false))) :rule cong :premises (t17 t38))
% 0.21/0.53  (step t40 (cl (= (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) false) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))))) :rule all_simplify)
% 0.21/0.53  (step t41 (cl (= (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))))) :rule trans :premises (t39 t40))
% 0.21/0.53  (step t42 (cl (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule implies_neg1)
% 0.21/0.53  (anchor :step t43)
% 0.21/0.53  (assume t43.a0 (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))
% 0.21/0.53  (assume t43.a1 (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))
% 0.21/0.53  (assume t43.a2 (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))
% 0.21/0.53  (assume t43.a3 (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))
% 0.21/0.53  (step t43.t1 (cl (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule and_neg)
% 0.21/0.53  (step t43.t2 (cl (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule resolution :premises (t43.t1 t43.a3 t43.a0 t43.a1 t43.a2))
% 0.21/0.53  (step t43 (cl (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule subproof :discharge (t43.a0 t43.a1 t43.a2 t43.a3))
% 0.21/0.53  (step t44 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule and_pos)
% 0.21/0.53  (step t45 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) :rule and_pos)
% 0.21/0.53  (step t46 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) :rule and_pos)
% 0.21/0.53  (step t47 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule and_pos)
% 0.21/0.53  (step t48 (cl (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule resolution :premises (t43 t44 t45 t46 t47))
% 0.21/0.53  (step t49 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule reordering :premises (t48))
% 0.21/0.53  (step t50 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule contraction :premises (t49))
% 0.21/0.53  (step t51 (cl (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule resolution :premises (t42 t50))
% 0.21/0.53  (step t52 (cl (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (not (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))))) :rule implies_neg2)
% 0.21/0.53  (step t53 (cl (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))))) :rule resolution :premises (t51 t52))
% 0.21/0.53  (step t54 (cl (=> (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (and (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))))) :rule contraction :premises (t53))
% 0.21/0.53  (step t55 (cl (not (and (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule resolution :premises (t16 t41 t54))
% 0.21/0.53  (step t56 (cl (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule not_and :premises (t55))
% 0.21/0.53  (step t57 (cl (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (not (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))))) :rule or_neg)
% 0.21/0.53  (step t58 (cl (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (not (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule or_neg)
% 0.21/0.53  (step t59 (cl (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (not (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))))) :rule or_neg)
% 0.21/0.53  (step t60 (cl (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (not (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule or_neg)
% 0.21/0.53  (step t61 (cl (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule resolution :premises (t56 t57 t58 t59 t60))
% 0.21/0.53  (step t62 (cl (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule contraction :premises (t61))
% 0.21/0.53  (step t63 (cl (or (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))))) :rule resolution :premises (t1 t15 t62))
% 0.21/0.53  (step t64 (cl (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule or :premises (t63))
% 0.21/0.53  (step t65 (cl (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule reordering :premises (t64))
% 0.21/0.53  (step t66 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A))))) :rule implies_neg1)
% 0.21/0.53  (anchor :step t67)
% 0.21/0.53  (assume t67.a0 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))))
% 0.21/0.53  (step t67.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule forall_inst :args ((:= A (tptp.not tptp.p)) (:= B (tptp.not tptp.q))))
% 0.21/0.53  (step t67.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule or :premises (t67.t1))
% 0.21/0.53  (step t67.t3 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule resolution :premises (t67.t2 t67.a0))
% 0.21/0.53  (step t67 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule subproof :discharge (t67.a0))
% 0.21/0.53  (step t68 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule resolution :premises (t66 t67))
% 0.21/0.53  (step t69 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule implies_neg2)
% 0.21/0.53  (step t70 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule resolution :premises (t68 t69))
% 0.21/0.53  (step t71 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A)))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule contraction :premises (t70))
% 0.21/0.53  (step t72 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.implies (tptp.or A B) (tptp.or B A))))) (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule implies :premises (t71))
% 0.21/0.53  (step t73 (cl (tptp.axiom (tptp.implies (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule resolution :premises (t72 a2))
% 0.21/0.53  (step t74 (cl (not (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) :rule or_pos)
% 0.21/0.53  (step t75 (cl (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))) (not (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))))) :rule reordering :premises (t74))
% 0.21/0.53  (step t76 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 0.21/0.53  (anchor :step t77)
% 0.21/0.53  (assume t77.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 0.21/0.53  (step t77.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))))) :rule forall_inst :args ((:= X (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))
% 0.21/0.53  (step t77.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule or :premises (t77.t1))
% 0.21/0.53  (step t77.t3 (cl (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule resolution :premises (t77.t2 t77.a0))
% 0.21/0.53  (step t77 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule subproof :discharge (t77.a0))
% 0.21/0.53  (step t78 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule resolution :premises (t76 t77))
% 0.21/0.53  (step t79 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (not (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))))) :rule implies_neg2)
% 0.21/0.53  (step t80 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))))) :rule resolution :premises (t78 t79))
% 0.21/0.53  (step t81 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))))) :rule contraction :premises (t80))
% 0.21/0.53  (step t82 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule implies :premises (t81))
% 0.21/0.53  (step t83 (cl (or (tptp.theorem (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))) (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p))))))) :rule resolution :premises (t82 a6))
% 0.21/0.53  (step t84 (cl (not (tptp.axiom (tptp.implies (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.implies tptp.q (tptp.not tptp.p)))))) :rule resolution :premises (t75 a8 t83))
% 0.21/0.53  (step t85 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) :rule implies_neg1)
% 0.21/0.53  (anchor :step t86)
% 0.21/0.53  (assume t86.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 0.21/0.53  (step t86.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule forall_inst :args ((:= X tptp.q) (:= Y (tptp.not tptp.p))))
% 0.21/0.53  (step t86.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) :rule or :premises (t86.t1))
% 0.21/0.53  (step t86.t3 (cl (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) :rule resolution :premises (t86.t2 t86.a0))
% 0.21/0.53  (step t86 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) :rule subproof :discharge (t86.a0))
% 0.21/0.53  (step t87 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) :rule resolution :premises (t85 t86))
% 0.21/0.53  (step t88 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (not (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule implies_neg2)
% 0.21/0.53  (step t89 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule resolution :premises (t87 t88))
% 0.21/0.53  (step t90 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule contraction :premises (t89))
% 0.21/0.53  (step t91 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) :rule implies :premises (t90))
% 0.21/0.53  (step t92 (cl (= (tptp.implies tptp.q (tptp.not tptp.p)) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))) :rule resolution :premises (t91 a5))
% 0.21/0.53  (step t93 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) :rule implies_neg1)
% 0.21/0.53  (anchor :step t94)
% 0.21/0.53  (assume t94.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))))
% 0.21/0.53  (step t94.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule forall_inst :args ((:= X tptp.p) (:= Y (tptp.not tptp.q))))
% 0.21/0.53  (step t94.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule or :premises (t94.t1))
% 0.21/0.53  (step t94.t3 (cl (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule resolution :premises (t94.t2 t94.a0))
% 0.21/0.53  (step t94 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule subproof :discharge (t94.a0))
% 0.21/0.53  (step t95 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule resolution :premises (t93 t94))
% 0.21/0.53  (step t96 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (not (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule implies_neg2)
% 0.21/0.53  (step t97 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule resolution :premises (t95 t96))
% 0.21/0.53  (step t98 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))))) :rule contraction :premises (t97))
% 0.21/0.53  (step t99 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.implies X Y) (tptp.or (tptp.not X) Y)))) (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule implies :premises (t98))
% 0.21/0.53  (step t100 (cl (= (tptp.implies tptp.p (tptp.not tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) :rule resolution :premises (t99 a5))
% 0.21/0.53  (step t101 (cl) :rule resolution :premises (t65 t73 t84 t92 t100))
% 0.21/0.53  
% 0.21/0.53  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.hQQbgvTfRu/cvc5---1.0.5_29391.smt2
% 0.21/0.54  % cvc5---1.0.5 exiting
% 0.21/0.54  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------