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

% Computer : n029.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:45 EDT 2024

% Result   : Unsatisfiable 10.65s 10.85s
% Output   : Proof 10.65s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : LCL178-1 : TPTP v8.2.0. Released v1.1.0.
% 0.07/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n029.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 27 21:21:39 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.44/10.63  --- Run --no-e-matching --full-saturate-quant at 5...
% 10.65/10.85  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.YoYvTECJPl/cvc5---1.0.5_9392.smt2
% 10.65/10.85  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.YoYvTECJPl/cvc5---1.0.5_9392.smt2
% 10.65/10.85  (assume a0 (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))))
% 10.65/10.85  (assume a1 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A)))))
% 10.65/10.85  (assume a2 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))))
% 10.65/10.85  (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))))))
% 10.65/10.85  (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))))))
% 10.65/10.85  (assume a5 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 10.65/10.85  (assume a6 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))))
% 10.65/10.85  (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))))))
% 10.65/10.85  (assume a8 (not (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p))))))
% 10.65/10.85  (step t1 (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.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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) (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)
% 10.65/10.85  (anchor :step t2)
% 10.65/10.85  (assume t2.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))))))
% 10.65/10.85  (step t2.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.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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.not tptp.p)) (:= Z (tptp.not tptp.p)) (:= Y (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))
% 10.65/10.85  (step t2.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.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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))
% 10.65/10.85  (step t2.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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))
% 10.65/10.85  (step 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.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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))
% 10.65/10.85  (step t3 (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.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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))
% 10.65/10.85  (step t4 (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.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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)
% 10.65/10.85  (step t5 (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.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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) (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.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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))
% 10.65/10.85  (step t6 (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.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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))
% 10.65/10.85  (step t7 (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.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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))
% 10.65/10.85  (step t8 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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)
% 10.65/10.85  (step t9 (cl (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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))
% 10.65/10.85  (step t10 (cl (not (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p)))))) (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))))) :rule or_pos)
% 10.65/10.85  (step t11 (cl (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))))))) :rule reordering :premises (t10))
% 10.65/10.85  (step t12 (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.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (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)
% 10.65/10.85  (anchor :step t13)
% 10.65/10.85  (assume t13.a0 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))))
% 10.65/10.85  (step t13.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.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p))))))) :rule forall_inst :args ((:= A (tptp.not (tptp.not tptp.p))) (:= B (tptp.not tptp.p))))
% 10.65/10.85  (step t13.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.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) :rule or :premises (t13.t1))
% 10.65/10.85  (step t13.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) :rule resolution :premises (t13.t2 t13.a0))
% 10.65/10.85  (step t13 (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.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) :rule subproof :discharge (t13.a0))
% 10.65/10.85  (step t14 (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.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) :rule resolution :premises (t12 t13))
% 10.65/10.85  (step t15 (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.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p))))))) :rule implies_neg2)
% 10.65/10.85  (step t16 (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.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (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.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p))))))) :rule resolution :premises (t14 t15))
% 10.65/10.85  (step t17 (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.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p))))))) :rule contraction :premises (t16))
% 10.65/10.85  (step t18 (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.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) :rule implies :premises (t17))
% 10.65/10.85  (step t19 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) :rule resolution :premises (t18 a2))
% 10.65/10.85  (step t20 (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.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (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)
% 10.65/10.85  (anchor :step t21)
% 10.65/10.85  (assume t21.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))))
% 10.65/10.85  (step t21.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.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))) (:= Y (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p)))))
% 10.65/10.85  (step t21.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.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p)))))) :rule or :premises (t21.t1))
% 10.65/10.85  (step t21.t3 (cl (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p)))))) :rule resolution :premises (t21.t2 t21.a0))
% 10.65/10.85  (step t21 (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.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p)))))) :rule subproof :discharge (t21.a0))
% 10.65/10.85  (step t22 (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.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p)))))) (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p)))))) :rule resolution :premises (t20 t21))
% 10.65/10.85  (step t23 (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.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p)))))) (not (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))))))) :rule implies_neg2)
% 10.65/10.85  (step t24 (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.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (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.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))))))) :rule resolution :premises (t22 t23))
% 10.65/10.85  (step t25 (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.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))))))) :rule contraction :premises (t24))
% 10.65/10.85  (step t26 (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.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p)))))) :rule implies :premises (t25))
% 10.65/10.85  (step t27 (cl (or (tptp.theorem (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (tptp.or (tptp.not tptp.p) (tptp.not (tptp.not tptp.p)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p)))))) :rule resolution :premises (t26 a6))
% 10.65/10.85  (step t28 (cl (not (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))))) :rule resolution :premises (t11 a8 t19 t27))
% 10.65/10.85  (step t29 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A)))) (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A))))) :rule implies_neg1)
% 10.65/10.85  (anchor :step t30)
% 10.65/10.85  (assume t30.a0 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A)))))
% 10.65/10.85  (step t30.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A))))) (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) :rule forall_inst :args ((:= A (tptp.not tptp.p)) (:= B (tptp.not tptp.p))))
% 10.65/10.85  (step t30.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A))))) (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))))) :rule or :premises (t30.t1))
% 10.65/10.85  (step t30.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))))) :rule resolution :premises (t30.t2 t30.a0))
% 10.65/10.85  (step t30 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A))))) (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))))) :rule subproof :discharge (t30.a0))
% 10.65/10.85  (step t31 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A)))) (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))))) (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))))) :rule resolution :premises (t29 t30))
% 10.65/10.85  (step t32 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A)))) (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) :rule implies_neg2)
% 10.65/10.85  (step t33 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A)))) (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A)))) (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) :rule resolution :premises (t31 t32))
% 10.65/10.85  (step t34 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A)))) (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p)))))) :rule contraction :premises (t33))
% 10.65/10.85  (step t35 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A))))) (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))))) :rule implies :premises (t34))
% 10.65/10.85  (step t36 (cl (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))))) :rule resolution :premises (t35 a1))
% 10.65/10.85  (step t37 (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)
% 10.65/10.85  (step t38 (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 (t37))
% 10.65/10.85  (step t39 (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)
% 10.65/10.85  (anchor :step t40)
% 10.65/10.85  (assume t40.a0 (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))))
% 10.65/10.85  (step t40.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))))
% 10.65/10.85  (step t40.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 (t40.t1))
% 10.65/10.85  (step t40.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 (t40.t2 t40.a0))
% 10.65/10.85  (step t40 (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 (t40.a0))
% 10.65/10.85  (step t41 (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 (t39 t40))
% 10.65/10.85  (step t42 (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)
% 10.65/10.85  (step t43 (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 (t41 t42))
% 10.65/10.85  (step t44 (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 (t43))
% 10.65/10.85  (step t45 (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 (t44))
% 10.65/10.85  (step t46 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) :rule resolution :premises (t45 a0))
% 10.65/10.85  (step t47 (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)
% 10.65/10.85  (anchor :step t48)
% 10.65/10.85  (assume t48.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 10.65/10.85  (step t48.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)))))
% 10.65/10.85  (step t48.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 (t48.t1))
% 10.65/10.85  (step t48.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 (t48.t2 t48.a0))
% 10.65/10.85  (step t48 (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 (t48.a0))
% 10.65/10.85  (step t49 (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 (t47 t48))
% 10.65/10.85  (step t50 (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)
% 10.65/10.85  (step t51 (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 (t49 t50))
% 10.65/10.85  (step t52 (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 (t51))
% 10.65/10.85  (step t53 (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 (t52))
% 10.65/10.85  (step t54 (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 (t53 a5))
% 10.65/10.85  (step t55 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.not tptp.p) (tptp.not tptp.p))) (tptp.not tptp.p)))) :rule resolution :premises (t38 t46 t54))
% 10.65/10.85  (step t56 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.not tptp.p))) (not (tptp.axiom (tptp.or (tptp.not (tptp.not tptp.p)) (tptp.or (tptp.not tptp.p) (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 t36 t55))
% 10.65/10.85  (step t57 (cl) :rule resolution :premises (t7 t56 a7))
% 10.65/10.85  
% 10.65/10.85  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.YoYvTECJPl/cvc5---1.0.5_9392.smt2
% 10.65/10.85  % cvc5---1.0.5 exiting
% 10.65/10.86  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------