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

% Computer : n007.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:50 EDT 2024

% Result   : Unsatisfiable 4.26s 4.47s
% Output   : Proof 4.26s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : LCL194-1 : TPTP v8.2.0. Released v1.1.0.
% 0.11/0.14  % Command    : do_cvc5 %s %d
% 0.15/0.35  % Computer : n007.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Mon May 27 21:24:09 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.21/0.51  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.52  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 4.26/4.47  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.AyJ8d6YHTv/cvc5---1.0.5_4131.smt2
% 4.26/4.47  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.AyJ8d6YHTv/cvc5---1.0.5_4131.smt2
% 4.26/4.47  (assume a0 (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))))
% 4.26/4.47  (assume a1 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A)))))
% 4.26/4.47  (assume a2 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))))
% 4.26/4.47  (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))))))
% 4.26/4.47  (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))))))
% 4.26/4.47  (assume a5 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 4.26/4.47  (assume a6 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))))
% 4.26/4.47  (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))))))
% 4.26/4.47  (assume a8 (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r))))))
% 4.26/4.47  (step t1 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) :rule or_pos)
% 4.26/4.47  (step t2 (cl (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))))) :rule reordering :premises (t1))
% 4.26/4.47  (step t3 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))) :rule or_pos)
% 4.26/4.47  (step t4 (cl (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))))) :rule reordering :premises (t3))
% 4.26/4.47  (step t5 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))) :rule or_pos)
% 4.26/4.47  (step t6 (cl (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))))) :rule reordering :premises (t5))
% 4.26/4.47  (step t7 (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.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))) (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)
% 4.26/4.47  (anchor :step t8)
% 4.26/4.47  (assume t8.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))))))
% 4.26/4.47  (step t8.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.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))) :rule forall_inst :args ((:= A tptp.q) (:= B tptp.r) (:= C tptp.p)))
% 4.26/4.47  (step t8.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.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))) :rule or :premises (t8.t1))
% 4.26/4.47  (step t8.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))) :rule resolution :premises (t8.t2 t8.a0))
% 4.26/4.47  (step t8 (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.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))) :rule subproof :discharge (t8.a0))
% 4.26/4.47  (step t9 (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.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))) :rule resolution :premises (t7 t8))
% 4.26/4.47  (step t10 (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.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))) :rule implies_neg2)
% 4.26/4.47  (step t11 (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.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))) (=> (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.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))) :rule resolution :premises (t9 t10))
% 4.26/4.47  (step t12 (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.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))) :rule contraction :premises (t11))
% 4.26/4.47  (step t13 (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.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))) :rule implies :premises (t12))
% 4.26/4.47  (step t14 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))) :rule resolution :premises (t13 a4))
% 4.26/4.47  (step t15 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 4.26/4.47  (anchor :step t16)
% 4.26/4.47  (assume t16.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 4.26/4.47  (step t16.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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))
% 4.26/4.47  (step t16.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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) :rule or :premises (t16.t1))
% 4.26/4.47  (step t16.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) :rule resolution :premises (t16.t2 t16.a0))
% 4.26/4.47  (step t16 (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) :rule subproof :discharge (t16.a0))
% 4.26/4.47  (step t17 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) :rule resolution :premises (t15 t16))
% 4.26/4.47  (step t18 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))))) :rule implies_neg2)
% 4.26/4.47  (step t19 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))))) :rule resolution :premises (t17 t18))
% 4.26/4.47  (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))))) :rule contraction :premises (t19))
% 4.26/4.47  (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) :rule implies :premises (t20))
% 4.26/4.47  (step t22 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) :rule resolution :premises (t21 a5))
% 4.26/4.47  (step t23 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))) :rule resolution :premises (t6 t14 t22))
% 4.26/4.47  (step t24 (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (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)
% 4.26/4.47  (anchor :step t25)
% 4.26/4.47  (assume t25.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))))))
% 4.26/4.47  (step t25.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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule forall_inst :args ((:= A (tptp.not (tptp.or (tptp.not tptp.q) tptp.r))) (:= B (tptp.not (tptp.or tptp.p tptp.q))) (:= C (tptp.or tptp.p tptp.r))))
% 4.26/4.47  (step t25.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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) :rule or :premises (t25.t1))
% 4.26/4.47  (step t25.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) :rule resolution :premises (t25.t2 t25.a0))
% 4.26/4.47  (step t25 (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) :rule subproof :discharge (t25.a0))
% 4.26/4.47  (step t26 (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) :rule resolution :premises (t24 t25))
% 4.26/4.47  (step t27 (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule implies_neg2)
% 4.26/4.47  (step t28 (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (=> (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule resolution :premises (t26 t27))
% 4.26/4.47  (step t29 (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule contraction :premises (t28))
% 4.26/4.47  (step t30 (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) :rule implies :premises (t29))
% 4.26/4.47  (step t31 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) :rule resolution :premises (t30 a3))
% 4.26/4.47  (step t32 (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.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) (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)
% 4.26/4.47  (anchor :step t33)
% 4.26/4.47  (assume t33.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))))
% 4.26/4.47  (step t33.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.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (:= Y (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))
% 4.26/4.47  (step t33.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.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) :rule or :premises (t33.t1))
% 4.26/4.47  (step t33.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) :rule resolution :premises (t33.t2 t33.a0))
% 4.26/4.47  (step t33 (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.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) :rule subproof :discharge (t33.a0))
% 4.26/4.47  (step t34 (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.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) :rule resolution :premises (t32 t33))
% 4.26/4.47  (step t35 (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.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))))) :rule implies_neg2)
% 4.26/4.47  (step t36 (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.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) (=> (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.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))))) :rule resolution :premises (t34 t35))
% 4.26/4.47  (step t37 (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.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))))))) :rule contraction :premises (t36))
% 4.26/4.47  (step t38 (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.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) :rule implies :premises (t37))
% 4.26/4.47  (step t39 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or tptp.p tptp.r))))))) :rule resolution :premises (t38 a6))
% 4.26/4.47  (step t40 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))) :rule resolution :premises (t4 t23 t31 t39))
% 4.26/4.47  (step t41 (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) (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)
% 4.26/4.47  (anchor :step t42)
% 4.26/4.47  (assume t42.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))))))
% 4.26/4.47  (step t42.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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))))) :rule forall_inst :args ((:= X (tptp.or tptp.q tptp.p)) (:= Z (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))) (:= Y (tptp.or tptp.p tptp.q))))
% 4.26/4.47  (step t42.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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule or :premises (t42.t1))
% 4.26/4.47  (step t42.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule resolution :premises (t42.t2 t42.a0))
% 4.26/4.47  (step t42 (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule subproof :discharge (t42.a0))
% 4.26/4.47  (step t43 (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule resolution :premises (t41 t42))
% 4.26/4.47  (step t44 (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))))) :rule implies_neg2)
% 4.26/4.47  (step t45 (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) (=> (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))))) :rule resolution :premises (t43 t44))
% 4.26/4.47  (step t46 (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))))) :rule contraction :premises (t45))
% 4.26/4.47  (step t47 (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule implies :premises (t46))
% 4.26/4.47  (step t48 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p tptp.q)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule resolution :premises (t47 a7))
% 4.26/4.47  (step t49 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) :rule or_pos)
% 4.26/4.47  (step t50 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))))) :rule reordering :premises (t49))
% 4.26/4.47  (step t51 (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (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)
% 4.26/4.47  (anchor :step t52)
% 4.26/4.47  (assume t52.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))))))
% 4.26/4.47  (step t52.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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r))))))) :rule forall_inst :args ((:= A (tptp.not (tptp.or tptp.q tptp.p))) (:= B (tptp.not (tptp.or (tptp.not tptp.q) tptp.r))) (:= C (tptp.or tptp.p tptp.r))))
% 4.26/4.47  (step t52.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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) :rule or :premises (t52.t1))
% 4.26/4.47  (step t52.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) :rule resolution :premises (t52.t2 t52.a0))
% 4.26/4.47  (step t52 (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) :rule subproof :discharge (t52.a0))
% 4.26/4.47  (step t53 (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) :rule resolution :premises (t51 t52))
% 4.26/4.47  (step t54 (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r))))))) :rule implies_neg2)
% 4.26/4.47  (step t55 (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (=> (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r))))))) :rule resolution :premises (t53 t54))
% 4.26/4.47  (step t56 (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r))))))) :rule contraction :premises (t55))
% 4.26/4.47  (step t57 (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.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) :rule implies :premises (t56))
% 4.26/4.47  (step t58 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) :rule resolution :premises (t57 a3))
% 4.26/4.47  (step t59 (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) (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)
% 4.26/4.47  (anchor :step t60)
% 4.26/4.47  (assume t60.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))))
% 4.26/4.47  (step t60.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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (:= Y (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))
% 4.26/4.47  (step t60.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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule or :premises (t60.t1))
% 4.26/4.47  (step t60.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule resolution :premises (t60.t2 t60.a0))
% 4.26/4.47  (step t60 (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule subproof :discharge (t60.a0))
% 4.26/4.47  (step t61 (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule resolution :premises (t59 t60))
% 4.26/4.47  (step t62 (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))))) :rule implies_neg2)
% 4.26/4.47  (step t63 (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) (=> (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))))) :rule resolution :premises (t61 t62))
% 4.26/4.47  (step t64 (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))))) :rule contraction :premises (t63))
% 4.26/4.47  (step t65 (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.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule implies :premises (t64))
% 4.26/4.47  (step t66 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r))))))) :rule resolution :premises (t65 a6))
% 4.26/4.47  (step t67 (cl (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or (tptp.not (tptp.or (tptp.not tptp.q) tptp.r)) (tptp.or tptp.p tptp.r)))))) :rule resolution :premises (t50 a8 t58 t66))
% 4.26/4.47  (step t68 (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.q tptp.p)) (tptp.or tptp.p tptp.q)))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A))))) :rule implies_neg1)
% 4.26/4.47  (anchor :step t69)
% 4.26/4.47  (assume t69.a0 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))))
% 4.26/4.47  (step t69.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.q tptp.p)) (tptp.or tptp.p tptp.q))))) :rule forall_inst :args ((:= A tptp.q) (:= B tptp.p)))
% 4.26/4.47  (step t69.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.q tptp.p)) (tptp.or tptp.p tptp.q)))) :rule or :premises (t69.t1))
% 4.26/4.47  (step t69.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) :rule resolution :premises (t69.t2 t69.a0))
% 4.26/4.47  (step t69 (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.q tptp.p)) (tptp.or tptp.p tptp.q)))) :rule subproof :discharge (t69.a0))
% 4.26/4.47  (step t70 (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.q tptp.p)) (tptp.or tptp.p tptp.q)))) (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) :rule resolution :premises (t68 t69))
% 4.26/4.47  (step t71 (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.q tptp.p)) (tptp.or tptp.p tptp.q)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q))))) :rule implies_neg2)
% 4.26/4.47  (step t72 (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.q tptp.p)) (tptp.or tptp.p tptp.q)))) (=> (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.q tptp.p)) (tptp.or tptp.p tptp.q))))) :rule resolution :premises (t70 t71))
% 4.26/4.47  (step t73 (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.q tptp.p)) (tptp.or tptp.p tptp.q))))) :rule contraction :premises (t72))
% 4.26/4.47  (step t74 (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.q tptp.p)) (tptp.or tptp.p tptp.q)))) :rule implies :premises (t73))
% 4.26/4.47  (step t75 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.q tptp.p)) (tptp.or tptp.p tptp.q)))) :rule resolution :premises (t74 a2))
% 4.26/4.47  (step t76 (cl) :rule resolution :premises (t2 t40 t48 t67 t75))
% 4.26/4.47  
% 4.26/4.48  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.AyJ8d6YHTv/cvc5---1.0.5_4131.smt2
% 4.26/4.48  % cvc5---1.0.5 exiting
% 4.26/4.48  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------