%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : LCL217-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n020.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:54 EDT 2024

% Result   : Unsatisfiable 265.15s 266.14s
% Output   : Proof 265.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : LCL217-1 : TPTP v8.2.0. Released v1.1.0.
% 0.10/0.14  % Command    : do_cvc5 %s %d
% 0.12/0.34  % Computer : n020.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon May 27 20:42:39 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.20/0.48  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.48  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.36/10.61  --- Run --no-e-matching --full-saturate-quant at 5...
% 15.42/15.66  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.52/20.71  --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.49/25.77  --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 30.59/30.84  --- Run --trigger-sel=max --full-saturate-quant at 5...
% 35.58/35.86  --- Run --multi-trigger-when-single --multi-trigger-priority --full-saturate-quant at 5...
% 40.74/40.97  --- Run --multi-trigger-cache --full-saturate-quant at 5...
% 45.86/46.17  --- Run --prenex-quant=none --full-saturate-quant at 5...
% 50.96/51.24  --- Run --enum-inst-interleave --decision=internal --full-saturate-quant at 5...
% 55.94/56.29  --- Run --relevant-triggers --full-saturate-quant at 5...
% 61.06/61.34  --- Run --finite-model-find --e-matching --sort-inference --uf-ss-fair at 5...
% 66.06/66.39  --- Run --pre-skolem-quant=on --full-saturate-quant at 10...
% 76.24/76.52  --- Run --cbqi-vo-exp --full-saturate-quant at 10...
% 86.30/86.65  --- Run --no-cbqi --full-saturate-quant at 10...
% 96.40/96.79  --- Run --macros-quant --macros-quant-mode=all --full-saturate-quant...
% 265.15/266.14  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.8OXWYjGbtP/cvc5---1.0.5_12811.smt2
% 265.15/266.14  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.8OXWYjGbtP/cvc5---1.0.5_12811.smt2
% 265.15/266.15  (assume a0 (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))))
% 265.15/266.15  (assume a1 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A)))))
% 265.15/266.15  (assume a2 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))))
% 265.15/266.15  (assume a3 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A (tptp.or B C))) (tptp.or B (tptp.or A C))))))
% 265.15/266.15  (assume a4 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))))
% 265.15/266.15  (assume a5 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 265.15/266.15  (assume a6 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))))
% 265.15/266.15  (assume a7 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))))
% 265.15/266.15  (assume a8 (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p))))))
% 265.15/266.15  (step t1 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y))))) :rule implies_neg1)
% 265.15/266.15  (anchor :step t2)
% 265.15/266.15  (assume t2.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))))
% 265.15/266.15  (step t2.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (:= Y (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))
% 265.15/266.15  (step t2.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule or :premises (t2.t1))
% 265.15/266.15  (step t2.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule resolution :premises (t2.t2 t2.a0))
% 265.15/266.15  (step t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule subproof :discharge (t2.a0))
% 265.15/266.15  (step t3 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule resolution :premises (t1 t2))
% 265.15/266.15  (step t4 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule implies_neg2)
% 265.15/266.15  (step t5 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule resolution :premises (t3 t4))
% 265.15/266.15  (step t6 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule contraction :premises (t5))
% 265.15/266.15  (step t7 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule implies :premises (t6))
% 265.15/266.15  (step t8 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))) :rule or_pos)
% 265.15/266.15  (step t9 (cl (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule reordering :premises (t8))
% 265.15/266.15  (step t10 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))) :rule or_pos)
% 265.15/266.15  (step t11 (cl (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule reordering :premises (t10))
% 265.15/266.15  (step t12 (cl (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A)))) :rule implies_neg1)
% 265.15/266.15  (anchor :step t13)
% 265.15/266.15  (assume t13.a0 (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))))
% 265.15/266.15  (step t13.t1 (cl (or (not (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))) :rule forall_inst :args ((:= A (tptp.not tptp.p))))
% 265.15/266.15  (step t13.t2 (cl (not (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) :rule or :premises (t13.t1))
% 265.15/266.15  (step t13.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) :rule resolution :premises (t13.t2 t13.a0))
% 265.15/266.15  (step t13 (cl (not (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) :rule subproof :discharge (t13.a0))
% 265.15/266.15  (step t14 (cl (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) :rule resolution :premises (t12 t13))
% 265.15/266.15  (step t15 (cl (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))) :rule implies_neg2)
% 265.15/266.15  (step t16 (cl (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))) :rule resolution :premises (t14 t15))
% 265.15/266.15  (step t17 (cl (=> (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))) :rule contraction :premises (t16))
% 265.15/266.15  (step t18 (cl (not (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) :rule implies :premises (t17))
% 265.15/266.15  (step t19 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) :rule resolution :premises (t18 a0))
% 265.15/266.15  (step t20 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 265.15/266.15  (anchor :step t21)
% 265.15/266.15  (assume t21.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 265.15/266.15  (step t21.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))
% 265.15/266.15  (step t21.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule or :premises (t21.t1))
% 265.15/266.15  (step t21.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule resolution :premises (t21.t2 t21.a0))
% 265.15/266.15  (step t21 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule subproof :discharge (t21.a0))
% 265.15/266.15  (step t22 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule resolution :premises (t20 t21))
% 265.15/266.15  (step t23 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule implies_neg2)
% 265.15/266.15  (step t24 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule resolution :premises (t22 t23))
% 265.15/266.15  (step t25 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule contraction :premises (t24))
% 265.15/266.15  (step t26 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule implies :premises (t25))
% 265.15/266.15  (step t27 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))))) :rule resolution :premises (t26 a5))
% 265.15/266.15  (step t28 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) :rule resolution :premises (t11 t19 t27))
% 265.15/266.15  (step t29 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) :rule or_pos)
% 265.15/266.15  (step t30 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))))) :rule reordering :premises (t29))
% 265.15/266.15  (step t31 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) :rule or_pos)
% 265.15/266.15  (step t32 (cl (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))))) :rule reordering :premises (t31))
% 265.15/266.15  (step t33 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A))))) :rule implies_neg1)
% 265.15/266.15  (anchor :step t34)
% 265.15/266.15  (assume t34.a0 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))))
% 265.15/266.15  (step t34.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule forall_inst :args ((:= A (tptp.not tptp.p)) (:= B (tptp.not tptp.q))))
% 265.15/266.15  (step t34.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule or :premises (t34.t1))
% 265.15/266.15  (step t34.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule resolution :premises (t34.t2 t34.a0))
% 265.15/266.15  (step t34 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule subproof :discharge (t34.a0))
% 265.15/266.15  (step t35 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule resolution :premises (t33 t34))
% 265.15/266.15  (step t36 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule implies_neg2)
% 265.15/266.15  (step t37 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule resolution :premises (t35 t36))
% 265.15/266.15  (step t38 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))) :rule contraction :premises (t37))
% 265.15/266.15  (step t39 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule implies :premises (t38))
% 265.15/266.15  (step t40 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) :rule resolution :premises (t39 a2))
% 265.15/266.15  (step t41 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) :rule or_pos)
% 265.15/266.15  (step t42 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))))) :rule reordering :premises (t41))
% 265.15/266.15  (step t43 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A (tptp.or B C))) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A (tptp.or B C))) (tptp.or B (tptp.or A C)))))) :rule implies_neg1)
% 265.15/266.15  (anchor :step t44)
% 265.15/266.15  (assume t44.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A (tptp.or B C))) (tptp.or B (tptp.or A C))))))
% 265.15/266.15  (step t44.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A (tptp.or B C))) (tptp.or B (tptp.or A C)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p))))))) :rule forall_inst :args ((:= A (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q)))) (:= B (tptp.not (tptp.or (tptp.not tptp.p) tptp.q))) (:= C (tptp.not tptp.p))))
% 265.15/266.15  (step t44.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A (tptp.or B C))) (tptp.or B (tptp.or A C)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) :rule or :premises (t44.t1))
% 265.15/266.15  (step t44.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) :rule resolution :premises (t44.t2 t44.a0))
% 265.15/266.15  (step t44 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A (tptp.or B C))) (tptp.or B (tptp.or A C)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) :rule subproof :discharge (t44.a0))
% 265.15/266.15  (step t45 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A (tptp.or B C))) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) :rule resolution :premises (t43 t44))
% 265.15/266.15  (step t46 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A (tptp.or B C))) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p))))))) :rule implies_neg2)
% 265.15/266.15  (step t47 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A (tptp.or B C))) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A (tptp.or B C))) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p))))))) :rule resolution :premises (t45 t46))
% 265.15/266.15  (step t48 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A (tptp.or B C))) (tptp.or B (tptp.or A C))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p))))))) :rule contraction :premises (t47))
% 265.15/266.15  (step t49 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A (tptp.or B C))) (tptp.or B (tptp.or A C)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) :rule implies :premises (t48))
% 265.15/266.15  (step t50 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) :rule resolution :premises (t49 a3))
% 265.15/266.15  (step t51 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y))))) :rule implies_neg1)
% 265.15/266.15  (anchor :step t52)
% 265.15/266.15  (assume t52.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))))
% 265.15/266.15  (step t52.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (:= Y (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))
% 265.15/266.15  (step t52.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule or :premises (t52.t1))
% 265.15/266.15  (step t52.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule resolution :premises (t52.t2 t52.a0))
% 265.15/266.15  (step t52 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule subproof :discharge (t52.a0))
% 265.15/266.15  (step t53 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule resolution :premises (t51 t52))
% 265.15/266.15  (step t54 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))))) :rule implies_neg2)
% 265.15/266.15  (step t55 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))))) :rule resolution :premises (t53 t54))
% 265.15/266.15  (step t56 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))))) :rule contraction :premises (t55))
% 265.15/266.15  (step t57 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule implies :premises (t56))
% 265.15/266.15  (step t58 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule resolution :premises (t57 a6))
% 265.15/266.15  (step t59 (cl (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) :rule resolution :premises (t42 a8 t50 t58))
% 265.15/266.15  (step t60 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z)))))) :rule implies_neg1)
% 265.15/266.15  (anchor :step t61)
% 265.15/266.15  (assume t61.a0 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))))
% 265.15/266.15  (step t61.t1 (cl (or (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z)))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (:= Z (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))) (:= Y (tptp.or (tptp.not tptp.q) (tptp.not tptp.p)))))
% 265.15/266.15  (step t61.t2 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z)))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule or :premises (t61.t1))
% 265.15/266.15  (step t61.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule resolution :premises (t61.t2 t61.a0))
% 265.15/266.15  (step t61 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z)))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule subproof :discharge (t61.a0))
% 265.15/266.15  (step t62 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule resolution :premises (t60 t61))
% 265.15/266.15  (step t63 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))))) :rule implies_neg2)
% 265.15/266.15  (step t64 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))))) :rule resolution :premises (t62 t63))
% 265.15/266.15  (step t65 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))))) :rule contraction :premises (t64))
% 265.15/266.15  (step t66 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z)))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule implies :premises (t65))
% 265.15/266.15  (step t67 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.q))) (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule resolution :premises (t66 a7))
% 265.15/266.15  (step t68 (cl (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) :rule resolution :premises (t32 t40 t59 t67))
% 265.15/266.15  (step t69 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B)))))) :rule implies_neg1)
% 265.15/266.15  (anchor :step t70)
% 265.15/266.15  (assume t70.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))))
% 265.15/266.15  (step t70.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))))))) :rule forall_inst :args ((:= A tptp.q) (:= B (tptp.not tptp.p)) (:= C (tptp.not tptp.p))))
% 265.15/266.15  (step t70.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) :rule or :premises (t70.t1))
% 265.15/266.15  (step t70.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) :rule resolution :premises (t70.t2 t70.a0))
% 265.15/266.15  (step t70 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) :rule subproof :discharge (t70.a0))
% 265.15/266.15  (step t71 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) :rule resolution :premises (t69 t70))
% 265.15/266.15  (step t72 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))))))) :rule implies_neg2)
% 265.15/266.15  (step t73 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))))))) :rule resolution :premises (t71 t72))
% 265.15/266.15  (step t74 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))))))) :rule contraction :premises (t73))
% 265.15/266.15  (step t75 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) :rule implies :premises (t74))
% 265.15/266.15  (step t76 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) :rule resolution :premises (t75 a4))
% 265.15/266.15  (step t77 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z)))))) :rule implies_neg1)
% 265.15/266.15  (anchor :step t78)
% 265.15/266.15  (assume t78.a0 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))))
% 265.15/266.15  (step t78.t1 (cl (or (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z)))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (:= Z (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))) (:= Y (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))))))
% 265.15/266.15  (step t78.t2 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z)))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule or :premises (t78.t1))
% 265.15/266.15  (step t78.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule resolution :premises (t78.t2 t78.a0))
% 265.15/266.15  (step t78 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z)))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule subproof :discharge (t78.a0))
% 265.15/266.15  (step t79 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule resolution :premises (t77 t78))
% 265.15/266.15  (step t80 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))))) :rule implies_neg2)
% 265.15/266.15  (step t81 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))))) :rule resolution :premises (t79 t80))
% 265.15/266.15  (step t82 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))))) :rule contraction :premises (t81))
% 265.15/266.15  (step t83 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (or (tptp.theorem (tptp.or (tptp.not X) Z)) (not (tptp.axiom (tptp.or (tptp.not X) Y))) (not (tptp.theorem (tptp.or (tptp.not Y) Z)))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule implies :premises (t82))
% 265.15/266.15  (step t84 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule resolution :premises (t83 a7))
% 265.15/266.15  (step t85 (cl (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) :rule resolution :premises (t30 t68 t76 t84))
% 265.15/266.15  (step t86 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B)))))) :rule implies_neg1)
% 265.15/266.15  (anchor :step t87)
% 265.15/266.15  (assume t87.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))))
% 265.15/266.15  (step t87.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule forall_inst :args ((:= A (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (:= B (tptp.not tptp.p)) (:= C (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)))))
% 265.15/266.15  (step t87.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) :rule or :premises (t87.t1))
% 265.15/266.15  (step t87.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) :rule resolution :premises (t87.t2 t87.a0))
% 265.15/266.15  (step t87 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) :rule subproof :discharge (t87.a0))
% 265.15/266.15  (step t88 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) :rule resolution :premises (t86 t87))
% 265.15/266.15  (step t89 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule implies_neg2)
% 265.15/266.15  (step t90 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule resolution :premises (t88 t89))
% 265.15/266.15  (step t91 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p))))))) :rule contraction :premises (t90))
% 265.15/266.15  (step t92 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) :rule implies :premises (t91))
% 265.15/266.15  (step t93 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) :rule resolution :premises (t92 a4))
% 265.15/266.15  (step t94 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))) (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) tptp.q)) (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p))))))) :rule resolution :premises (t9 t28 t85 t93))
% 265.15/266.15  (step t95 (cl) :rule resolution :premises (t7 t94 a6))
% 265.15/266.15  
% 265.19/266.17  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.8OXWYjGbtP/cvc5---1.0.5_12811.smt2
% 265.19/266.18  % cvc5---1.0.5 exiting
% 265.19/266.18  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------