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

% Computer : n016.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:49 EDT 2024

% Result   : Unsatisfiable 80.44s 81.75s
% Output   : Proof 80.50s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : LCL192-1 : TPTP v8.2.0. Released v1.1.0.
% 0.10/0.13  % Command    : do_cvc5 %s %d
% 0.12/0.32  % Computer : n016.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit   : 300
% 0.12/0.32  % WCLimit    : 300
% 0.12/0.32  % DateTime   : Mon May 27 22:33:54 EDT 2024
% 0.12/0.32  % CPUTime    : 
% 0.16/0.45  %----Proving TF0_NAR, FOF, or CNF
% 0.16/0.45  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.31/10.64  --- Run --no-e-matching --full-saturate-quant at 5...
% 15.37/15.76  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.46/20.90  --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.55/26.05  --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 30.60/31.16  --- Run --trigger-sel=max --full-saturate-quant at 5...
% 35.57/36.23  --- Run --multi-trigger-when-single --multi-trigger-priority --full-saturate-quant at 5...
% 40.70/41.43  --- Run --multi-trigger-cache --full-saturate-quant at 5...
% 45.87/46.69  --- Run --prenex-quant=none --full-saturate-quant at 5...
% 50.97/51.84  --- Run --enum-inst-interleave --decision=internal --full-saturate-quant at 5...
% 56.02/56.95  --- Run --relevant-triggers --full-saturate-quant at 5...
% 61.06/62.08  --- Run --finite-model-find --e-matching --sort-inference --uf-ss-fair at 5...
% 66.16/67.26  --- Run --pre-skolem-quant=on --full-saturate-quant at 10...
% 76.24/77.50  --- Run --cbqi-vo-exp --full-saturate-quant at 10...
% 80.44/81.75  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.51mnzqhq3Z/cvc5---1.0.5_29747.smt2
% 80.44/81.75  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.51mnzqhq3Z/cvc5---1.0.5_29747.smt2
% 80.50/81.76  (assume a0 (forall ((A $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A A)) A))))
% 80.50/81.76  (assume a1 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not A) (tptp.or B A)))))
% 80.50/81.76  (assume a2 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))))
% 80.50/81.76  (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))))))
% 80.50/81.76  (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))))))
% 80.50/81.76  (assume a5 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 80.50/81.76  (assume a6 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))))
% 80.50/81.76  (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))))))
% 80.50/81.76  (assume a8 (not (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))
% 80.50/81.76  (step t1 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q 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)
% 80.50/81.76  (anchor :step t2)
% 80.50/81.76  (assume t2.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))))
% 80.50/81.76  (step t2.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (:= Y (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))
% 80.50/81.76  (step t2.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) :rule or :premises (t2.t1))
% 80.50/81.76  (step t2.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) :rule resolution :premises (t2.t2 t2.a0))
% 80.50/81.76  (step t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) :rule subproof :discharge (t2.a0))
% 80.50/81.76  (step t3 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) :rule resolution :premises (t1 t2))
% 80.50/81.76  (step t4 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))))))) :rule implies_neg2)
% 80.50/81.76  (step t5 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q 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.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))))))) :rule resolution :premises (t3 t4))
% 80.50/81.76  (step t6 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))))))) :rule contraction :premises (t5))
% 80.50/81.76  (step t7 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom (tptp.or (tptp.not Y) X))) (not (tptp.theorem Y))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) :rule implies :premises (t6))
% 80.50/81.76  (step t8 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))))) :rule or_pos)
% 80.50/81.76  (step t9 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))))))) :rule reordering :premises (t8))
% 80.50/81.76  (step t10 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) :rule or_pos)
% 80.50/81.76  (step t11 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))))) :rule reordering :premises (t10))
% 80.50/81.76  (step t12 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) :rule or_pos)
% 80.50/81.76  (step t13 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))))) :rule reordering :premises (t12))
% 80.50/81.76  (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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (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)
% 80.50/81.76  (anchor :step t15)
% 80.50/81.76  (assume t15.a0 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))))
% 80.50/81.76  (step t15.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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q)))))) :rule forall_inst :args ((:= A (tptp.or tptp.p tptp.q)) (:= B tptp.r)))
% 80.50/81.76  (step t15.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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) :rule or :premises (t15.t1))
% 80.50/81.76  (step t15.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) :rule resolution :premises (t15.t2 t15.a0))
% 80.50/81.76  (step t15 (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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) :rule subproof :discharge (t15.a0))
% 80.50/81.76  (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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) :rule resolution :premises (t14 t15))
% 80.50/81.76  (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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q)))))) :rule implies_neg2)
% 80.50/81.76  (step t18 (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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q)))))) :rule resolution :premises (t16 t17))
% 80.50/81.76  (step t19 (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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q)))))) :rule contraction :premises (t18))
% 80.50/81.76  (step t20 (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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) :rule implies :premises (t19))
% 80.50/81.76  (step t21 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) :rule resolution :premises (t20 a2))
% 80.50/81.76  (step t22 (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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q 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)
% 80.50/81.76  (anchor :step t23)
% 80.50/81.76  (assume t23.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))))))
% 80.50/81.76  (step t23.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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (:= Z (tptp.or tptp.p (tptp.or tptp.q tptp.r))) (:= Y (tptp.or tptp.r (tptp.or tptp.p tptp.q)))))
% 80.50/81.76  (step t23.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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule or :premises (t23.t1))
% 80.50/81.76  (step t23.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule resolution :premises (t23.t2 t23.a0))
% 80.50/81.76  (step t23 (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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule subproof :discharge (t23.a0))
% 80.50/81.76  (step t24 (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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule resolution :premises (t22 t23))
% 80.50/81.76  (step t25 (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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))))) :rule implies_neg2)
% 80.50/81.76  (step t26 (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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q 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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))))) :rule resolution :premises (t24 t25))
% 80.50/81.76  (step t27 (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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))))) :rule contraction :premises (t26))
% 80.50/81.76  (step t28 (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.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule implies :premises (t27))
% 80.50/81.76  (step t29 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.or tptp.p tptp.q) tptp.r)) (tptp.or tptp.r (tptp.or tptp.p tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule resolution :premises (t28 a7))
% 80.50/81.76  (step t30 (cl (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) :rule resolution :premises (t13 a8 t21 t29))
% 80.50/81.76  (step t31 (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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (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)
% 80.50/81.76  (anchor :step t32)
% 80.50/81.76  (assume t32.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))))))
% 80.50/81.76  (step t32.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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q)))))) :rule forall_inst :args ((:= A tptp.r) (:= B tptp.p) (:= C tptp.q)))
% 80.50/81.76  (step t32.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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) :rule or :premises (t32.t1))
% 80.50/81.76  (step t32.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) :rule resolution :premises (t32.t2 t32.a0))
% 80.50/81.76  (step t32 (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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) :rule subproof :discharge (t32.a0))
% 80.50/81.76  (step t33 (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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) :rule resolution :premises (t31 t32))
% 80.50/81.76  (step t34 (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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q)))))) :rule implies_neg2)
% 80.50/81.76  (step t35 (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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (=> (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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q)))))) :rule resolution :premises (t33 t34))
% 80.50/81.76  (step t36 (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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q)))))) :rule contraction :premises (t35))
% 80.50/81.76  (step t37 (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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) :rule implies :premises (t36))
% 80.50/81.76  (step t38 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) :rule resolution :premises (t37 a3))
% 80.50/81.76  (step t39 (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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q 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)
% 80.50/81.76  (anchor :step t40)
% 80.50/81.76  (assume t40.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))))))
% 80.50/81.76  (step t40.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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))))) :rule forall_inst :args ((:= X (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (:= Z (tptp.or tptp.p (tptp.or tptp.q tptp.r))) (:= Y (tptp.or tptp.p (tptp.or tptp.r tptp.q)))))
% 80.50/81.76  (step t40.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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule or :premises (t40.t1))
% 80.50/81.76  (step t40.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule resolution :premises (t40.t2 t40.a0))
% 80.50/81.76  (step t40 (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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule subproof :discharge (t40.a0))
% 80.50/81.76  (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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule resolution :premises (t39 t40))
% 80.50/81.76  (step t42 (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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))))) :rule implies_neg2)
% 80.50/81.76  (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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q 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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))))) :rule resolution :premises (t41 t42))
% 80.50/81.76  (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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))))) :rule contraction :premises (t43))
% 80.50/81.76  (step t45 (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.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule implies :premises (t44))
% 80.50/81.76  (step t46 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r (tptp.or tptp.p tptp.q))) (tptp.or tptp.p (tptp.or tptp.r tptp.q))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule resolution :premises (t45 a7))
% 80.50/81.76  (step t47 (cl (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) :rule resolution :premises (t11 t30 t38 t46))
% 80.50/81.76  (step t48 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))))) :rule or_pos)
% 80.50/81.76  (step t49 (cl (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))) (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))))))) :rule reordering :premises (t48))
% 80.50/81.76  (step t50 (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.r tptp.q)) (tptp.or tptp.q tptp.r)))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A))))) :rule implies_neg1)
% 80.50/81.76  (anchor :step t51)
% 80.50/81.76  (assume t51.a0 (forall ((A $$unsorted) (B $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or A B)) (tptp.or B A)))))
% 80.50/81.76  (step t51.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.r tptp.q)) (tptp.or tptp.q tptp.r))))) :rule forall_inst :args ((:= A tptp.r) (:= B tptp.q)))
% 80.50/81.76  (step t51.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.r tptp.q)) (tptp.or tptp.q tptp.r)))) :rule or :premises (t51.t1))
% 80.50/81.76  (step t51.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))) :rule resolution :premises (t51.t2 t51.a0))
% 80.50/81.76  (step t51 (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.r tptp.q)) (tptp.or tptp.q tptp.r)))) :rule subproof :discharge (t51.a0))
% 80.50/81.76  (step t52 (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.r tptp.q)) (tptp.or tptp.q tptp.r)))) (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))) :rule resolution :premises (t50 t51))
% 80.50/81.76  (step t53 (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.r tptp.q)) (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))))) :rule implies_neg2)
% 80.50/81.76  (step t54 (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.r tptp.q)) (tptp.or tptp.q tptp.r)))) (=> (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.r tptp.q)) (tptp.or tptp.q tptp.r))))) :rule resolution :premises (t52 t53))
% 80.50/81.76  (step t55 (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.r tptp.q)) (tptp.or tptp.q tptp.r))))) :rule contraction :premises (t54))
% 80.50/81.76  (step t56 (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.r tptp.q)) (tptp.or tptp.q tptp.r)))) :rule implies :premises (t55))
% 80.50/81.76  (step t57 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))) :rule resolution :premises (t56 a2))
% 80.50/81.76  (step t58 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) :rule implies_neg1)
% 80.50/81.76  (anchor :step t59)
% 80.50/81.76  (assume t59.a0 (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))))
% 80.50/81.76  (step t59.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.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))))))) :rule forall_inst :args ((:= X (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))
% 80.50/81.76  (step t59.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) :rule or :premises (t59.t1))
% 80.50/81.76  (step t59.t3 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) :rule resolution :premises (t59.t2 t59.a0))
% 80.50/81.76  (step t59 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) :rule subproof :discharge (t59.a0))
% 80.50/81.76  (step t60 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) :rule resolution :premises (t58 t59))
% 80.50/81.76  (step t61 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))))))) :rule implies_neg2)
% 80.50/81.76  (step t62 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))))))) :rule resolution :premises (t60 t61))
% 80.50/81.76  (step t63 (cl (=> (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X)))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))))))) :rule contraction :premises (t62))
% 80.50/81.76  (step t64 (cl (not (forall ((X $$unsorted)) (or (tptp.theorem X) (not (tptp.axiom X))))) (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) :rule implies :premises (t63))
% 80.50/81.76  (step t65 (cl (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))))) :rule resolution :premises (t64 a5))
% 80.50/81.76  (step t66 (cl (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r)))) :rule resolution :premises (t49 t57 t65))
% 80.50/81.76  (step t67 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q 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)
% 80.50/81.76  (anchor :step t68)
% 80.50/81.76  (assume t68.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))))))
% 80.50/81.76  (step t68.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule forall_inst :args ((:= A (tptp.or tptp.r tptp.q)) (:= B (tptp.or tptp.q tptp.r)) (:= C tptp.p)))
% 80.50/81.76  (step t68.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) :rule or :premises (t68.t1))
% 80.50/81.76  (step t68.t3 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) :rule resolution :premises (t68.t2 t68.a0))
% 80.50/81.76  (step t68 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) :rule subproof :discharge (t68.a0))
% 80.50/81.76  (step t69 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) :rule resolution :premises (t67 t68))
% 80.50/81.76  (step t70 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule implies_neg2)
% 80.50/81.76  (step t71 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q 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.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule resolution :premises (t69 t70))
% 80.50/81.76  (step t72 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r))))))) :rule contraction :premises (t71))
% 80.50/81.76  (step t73 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not A) B)) (tptp.or (tptp.not (tptp.or C A)) (tptp.or C B)))))) (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) :rule implies :premises (t72))
% 80.50/81.76  (step t74 (cl (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) :rule resolution :premises (t73 a4))
% 80.50/81.76  (step t75 (cl (not (or (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))) (not (tptp.axiom (tptp.or (tptp.not (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))) (tptp.or (tptp.not (tptp.or tptp.p (tptp.or tptp.r tptp.q))) (tptp.or tptp.p (tptp.or tptp.q tptp.r)))))) (not (tptp.theorem (tptp.or (tptp.not (tptp.or tptp.r tptp.q)) (tptp.or tptp.q tptp.r))))))) :rule resolution :premises (t9 t47 t66 t74))
% 80.50/81.76  (step t76 (cl) :rule resolution :premises (t7 t75 a6))
% 80.50/81.76  
% 80.50/81.76  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.51mnzqhq3Z/cvc5---1.0.5_29747.smt2
% 80.50/81.76  % cvc5---1.0.5 exiting
% 80.50/81.77  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------