%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : HWV006-2 : TPTP v8.2.0. Bugfixed v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

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

% Result   : Unsatisfiable 0.51s 0.68s
% Output   : Proof 0.58s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : HWV006-2 : TPTP v8.2.0. Bugfixed v2.7.0.
% 0.08/0.14  % Command    : do_cvc5 %s %d
% 0.13/0.35  % Computer : n009.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon May 27 02:43:09 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.51  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.51/0.68  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.hj7QPfYquG/cvc5---1.0.5_16421.smt2
% 0.51/0.68  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.hj7QPfYquG/cvc5---1.0.5_16421.smt2
% 0.58/0.74  (assume a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))))
% 0.58/0.74  (assume a1 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))))
% 0.58/0.74  (assume a2 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P2)) (tptp.zero P1))))
% 0.58/0.74  (assume a3 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))))
% 0.58/0.74  (assume a4 (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P)))))
% 0.58/0.74  (assume a5 (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.zero (tptp.out1 K)))))
% 0.58/0.74  (assume a6 (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.zero (tptp.in2 K))) (tptp.zero (tptp.out1 K)))))
% 0.58/0.74  (assume a7 (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))))
% 0.58/0.74  (assume a8 (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.zero (tptp.out1 K))) (tptp.zero (tptp.in1 K)) (tptp.zero (tptp.in2 K)))))
% 0.58/0.74  (assume a9 (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.one (tptp.in1 K)))))
% 0.58/0.74  (assume a10 (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.one (tptp.in2 K)))))
% 0.58/0.74  (assume a11 (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.abnormal K)))))
% 0.58/0.74  (assume a12 (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))))
% 0.58/0.74  (assume a13 (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.one (tptp.out1 K)))))
% 0.58/0.74  (assume a14 (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))))
% 0.58/0.74  (assume a15 (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.zero (tptp.in1 K))) (not (tptp.zero (tptp.in2 K))) (tptp.zero (tptp.out1 K)))))
% 0.58/0.74  (assume a16 (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.one (tptp.in1 K)) (tptp.one (tptp.in2 K)))))
% 0.58/0.74  (assume a17 (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.zero (tptp.out1 K))) (tptp.zero (tptp.in1 K)))))
% 0.58/0.74  (assume a18 (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.zero (tptp.out1 K))) (tptp.zero (tptp.in2 K)))))
% 0.58/0.74  (assume a19 (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.abnormal K)))))
% 0.58/0.74  (assume a20 (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K))))
% 0.58/0.74  (assume a21 (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.one (tptp.out1 K)))))
% 0.58/0.74  (assume a22 (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.zero (tptp.out1 K)))))
% 0.58/0.74  (assume a23 (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.zero (tptp.out1 K))) (tptp.one (tptp.in1 K)))))
% 0.58/0.74  (assume a24 (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.zero (tptp.in1 K)))))
% 0.58/0.74  (assume a25 (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.abnormal K)))))
% 0.58/0.74  (assume a26 (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K))))
% 0.58/0.74  (assume a27 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X)))))
% 0.58/0.74  (assume a28 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X)))))
% 0.58/0.74  (assume a29 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X)))))
% 0.58/0.74  (assume a30 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_or (tptp.or1 X)))))
% 0.58/0.74  (assume a31 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.or1 X))))))
% 0.58/0.74  (assume a32 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.or1 X))))))
% 0.58/0.74  (assume a33 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X))))))
% 0.58/0.74  (assume a34 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.and2 X))))))
% 0.58/0.74  (assume a35 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X))))))
% 0.58/0.74  (assume a36 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.and2 X))))))
% 0.58/0.74  (assume a37 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.or1 X)) (tptp.in1 (tptp.and1 X))))))
% 0.58/0.74  (assume a38 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X))))))
% 0.58/0.74  (assume a39 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X))))))
% 0.58/0.74  (assume a40 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h1 X)))))
% 0.58/0.74  (assume a41 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h2 X)))))
% 0.58/0.74  (assume a42 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.logic_or (tptp.or1 X)))))
% 0.58/0.74  (assume a43 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs (tptp.h1 X)) (tptp.in2 (tptp.h2 X))))))
% 0.58/0.75  (assume a44 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc (tptp.h1 X)) (tptp.in2 (tptp.or1 X))))))
% 0.58/0.75  (assume a45 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc (tptp.h2 X)) (tptp.in1 (tptp.or1 X))))))
% 0.58/0.75  (assume a46 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.h2 X))))))
% 0.58/0.75  (assume a47 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in2 X) (tptp.in1 (tptp.h1 X))))))
% 0.58/0.75  (assume a48 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.inc X) (tptp.in2 (tptp.h1 X))))))
% 0.58/0.75  (assume a49 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs X) (tptp.outs (tptp.h2 X))))))
% 0.58/0.75  (assume a50 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.or1 X))))))
% 0.58/0.75  (assume a51 (tptp.fulladder tptp.f))
% 0.58/0.75  (assume a52 (tptp.one (tptp.in1 tptp.f)))
% 0.58/0.75  (assume a53 (tptp.zero (tptp.in2 tptp.f)))
% 0.58/0.75  (assume a54 (tptp.one (tptp.inc tptp.f)))
% 0.58/0.75  (assume a55 (tptp.one (tptp.outs tptp.f)))
% 0.58/0.75  (assume a56 (tptp.zero (tptp.outc tptp.f)))
% 0.58/0.75  (assume a57 (or (not (tptp.abnormal (tptp.or1 tptp.f))) (not (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f))))))
% 0.58/0.75  (assume a58 (not (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f)))))
% 0.58/0.75  (assume a59 (or (not (tptp.abnormal (tptp.or1 tptp.f))) (not (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f))))))
% 0.58/0.75  (assume a60 (not (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f)))))
% 0.58/0.75  (assume a61 (not (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f)))))
% 0.58/0.75  (assume a62 (not (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f)))))
% 0.58/0.75  (assume a63 (not (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f)))))
% 0.58/0.75  (step t1 (cl (=> (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P)))) (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t2)
% 0.58/0.75  (assume t2.a0 (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P)))))
% 0.58/0.75  (step t2.t1 (cl (or (not (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P))))) (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))))) :rule forall_inst :args ((:= P (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))
% 0.58/0.75  (step t2.t2 (cl (not (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P))))) (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule or :premises (t2.t1))
% 0.58/0.75  (step t2.t3 (cl (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule resolution :premises (t2.t2 t2.a0))
% 0.58/0.75  (step t2 (cl (not (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P))))) (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule subproof :discharge (t2.a0))
% 0.58/0.75  (step t3 (cl (=> (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P)))) (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule resolution :premises (t1 t2))
% 0.58/0.75  (step t4 (cl (=> (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P)))) (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) (not (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))))) :rule implies_neg2)
% 0.58/0.75  (step t5 (cl (=> (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P)))) (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) (=> (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P)))) (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))))) :rule resolution :premises (t3 t4))
% 0.58/0.75  (step t6 (cl (=> (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P)))) (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))))) :rule contraction :premises (t5))
% 0.58/0.75  (step t7 (cl (not (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P))))) (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule implies :premises (t6))
% 0.58/0.75  (step t8 (cl (not (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule or_pos)
% 0.58/0.75  (step t9 (cl (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))))) :rule reordering :premises (t8))
% 0.58/0.75  (step t10 (cl (not (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t11 (cl (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule reordering :premises (t10))
% 0.58/0.75  (step t12 (cl (not (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t13 (cl (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f))) (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (not (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f)))))) :rule reordering :premises (t12))
% 0.58/0.75  (step t14 (cl (not (tptp.abnormal (tptp.or1 tptp.f))) (not (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f))))) :rule or :premises (a57))
% 0.58/0.75  (step t15 (cl (not (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f)))) (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f))) :rule or_pos)
% 0.58/0.75  (step t16 (cl (tptp.abnormal (tptp.or1 tptp.f)) (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (not (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f))))) :rule reordering :premises (t15))
% 0.58/0.75  (step t17 (cl (not (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f)))) (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f))) :rule or_pos)
% 0.58/0.75  (step t18 (cl (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f)) (not (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f))))) :rule reordering :premises (t17))
% 0.58/0.75  (step t19 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.logic_or (tptp.or1 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f)))) (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.logic_or (tptp.or1 X))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t20)
% 0.58/0.75  (assume t20.a0 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.logic_or (tptp.or1 X)))))
% 0.58/0.75  (step t20.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.logic_or (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f))))) :rule forall_inst :args ((:= X tptp.f)))
% 0.58/0.75  (step t20.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.logic_or (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f)))) :rule or :premises (t20.t1))
% 0.58/0.75  (step t20.t3 (cl (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f)))) :rule resolution :premises (t20.t2 t20.a0))
% 0.58/0.75  (step t20 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.logic_or (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f)))) :rule subproof :discharge (t20.a0))
% 0.58/0.75  (step t21 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.logic_or (tptp.or1 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f)))) (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f)))) :rule resolution :premises (t19 t20))
% 0.58/0.75  (step t22 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.logic_or (tptp.or1 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f)))) (not (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f))))) :rule implies_neg2)
% 0.58/0.75  (step t23 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.logic_or (tptp.or1 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f)))) (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.logic_or (tptp.or1 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f))))) :rule resolution :premises (t21 t22))
% 0.58/0.75  (step t24 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.logic_or (tptp.or1 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f))))) :rule contraction :premises (t23))
% 0.58/0.75  (step t25 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.logic_or (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f)))) :rule implies :premises (t24))
% 0.58/0.75  (step t26 (cl (or (not (tptp.fulladder tptp.f)) (tptp.logic_or (tptp.or1 tptp.f)))) :rule resolution :premises (t25 a42))
% 0.58/0.75  (step t27 (cl (tptp.logic_or (tptp.or1 tptp.f))) :rule resolution :premises (t18 a51 t26))
% 0.58/0.75  (step t28 (cl (not (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f))))) (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t29 (cl (not (tptp.or_ok (tptp.or1 tptp.f))) (tptp.one (tptp.out1 (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (not (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f)))))) :rule reordering :premises (t28))
% 0.58/0.75  (step t30 (cl (not (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f)))) (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f))) :rule or_pos)
% 0.58/0.75  (step t31 (cl (tptp.one (tptp.outc tptp.f)) (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (not (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f))))) :rule reordering :premises (t30))
% 0.58/0.75  (step t32 (cl (not (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f))))) (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t33 (cl (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f))) (not (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f)))))) :rule reordering :premises (t32))
% 0.58/0.75  (step t34 (cl (=> (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P)))) (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f))))) (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t35)
% 0.58/0.75  (assume t35.a0 (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P)))))
% 0.58/0.75  (step t35.t1 (cl (or (not (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P))))) (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f)))))) :rule forall_inst :args ((:= P (tptp.outc tptp.f))))
% 0.58/0.75  (step t35.t2 (cl (not (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P))))) (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f))))) :rule or :premises (t35.t1))
% 0.58/0.75  (step t35.t3 (cl (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f))))) :rule resolution :premises (t35.t2 t35.a0))
% 0.58/0.75  (step t35 (cl (not (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P))))) (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f))))) :rule subproof :discharge (t35.a0))
% 0.58/0.75  (step t36 (cl (=> (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P)))) (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f))))) (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f))))) :rule resolution :premises (t34 t35))
% 0.58/0.75  (step t37 (cl (=> (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P)))) (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f))))) (not (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t38 (cl (=> (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P)))) (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f))))) (=> (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P)))) (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f)))))) :rule resolution :premises (t36 t37))
% 0.58/0.75  (step t39 (cl (=> (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P)))) (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f)))))) :rule contraction :premises (t38))
% 0.58/0.75  (step t40 (cl (not (forall ((P $$unsorted)) (or (not (tptp.zero P)) (not (tptp.one P))))) (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f))))) :rule implies :premises (t39))
% 0.58/0.75  (step t41 (cl (or (not (tptp.zero (tptp.outc tptp.f))) (not (tptp.one (tptp.outc tptp.f))))) :rule resolution :premises (t40 a4))
% 0.58/0.75  (step t42 (cl (not (tptp.one (tptp.outc tptp.f)))) :rule resolution :premises (t33 a56 t41))
% 0.58/0.75  (step t43 (cl (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f))))) (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t44 (cl (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f))) (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))))) :rule reordering :premises (t43))
% 0.58/0.75  (step t45 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.or1 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t46)
% 0.58/0.75  (assume t46.a0 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.or1 X))))))
% 0.58/0.75  (step t46.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.or1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))))) :rule forall_inst :args ((:= X tptp.f)))
% 0.58/0.75  (step t46.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.or1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f))))) :rule or :premises (t46.t1))
% 0.58/0.75  (step t46.t3 (cl (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f))))) :rule resolution :premises (t46.t2 t46.a0))
% 0.58/0.75  (step t46 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.or1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f))))) :rule subproof :discharge (t46.a0))
% 0.58/0.75  (step t47 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f))))) :rule resolution :premises (t45 t46))
% 0.58/0.75  (step t48 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f))))) (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t49 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))))) :rule resolution :premises (t47 t48))
% 0.58/0.75  (step t50 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))))) :rule contraction :premises (t49))
% 0.58/0.75  (step t51 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.or1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f))))) :rule implies :premises (t50))
% 0.58/0.75  (step t52 (cl (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f))))) :rule resolution :premises (t51 a50))
% 0.58/0.75  (step t53 (cl (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) :rule resolution :premises (t44 a51 t52))
% 0.58/0.75  (step t54 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f)))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t55)
% 0.58/0.75  (assume t55.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))))
% 0.58/0.75  (step t55.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f))))) :rule forall_inst :args ((:= P1 (tptp.outc tptp.f)) (:= P2 (tptp.out1 (tptp.or1 tptp.f)))))
% 0.58/0.75  (step t55.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f)))) :rule or :premises (t55.t1))
% 0.58/0.75  (step t55.t3 (cl (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f)))) :rule resolution :premises (t55.t2 t55.a0))
% 0.58/0.75  (step t55 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f)))) :rule subproof :discharge (t55.a0))
% 0.58/0.75  (step t56 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f)))) (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f)))) :rule resolution :premises (t54 t55))
% 0.58/0.75  (step t57 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f)))) (not (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f))))) :rule implies_neg2)
% 0.58/0.75  (step t58 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f)))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f))))) :rule resolution :premises (t56 t57))
% 0.58/0.75  (step t59 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f))))) :rule contraction :premises (t58))
% 0.58/0.75  (step t60 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f)))) :rule implies :premises (t59))
% 0.58/0.75  (step t61 (cl (or (not (tptp.connection (tptp.outc tptp.f) (tptp.out1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.or1 tptp.f)))) (tptp.one (tptp.outc tptp.f)))) :rule resolution :premises (t60 a3))
% 0.58/0.75  (step t62 (cl (not (tptp.one (tptp.out1 (tptp.or1 tptp.f))))) :rule resolution :premises (t31 t42 t53 t61))
% 0.58/0.75  (step t63 (cl (not (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f))))) (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t64 (cl (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f))) (not (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f)))))) :rule reordering :premises (t63))
% 0.58/0.75  (step t65 (cl (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f))))) (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t66 (cl (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f))) (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))))) :rule reordering :premises (t65))
% 0.58/0.75  (step t67 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc (tptp.h2 X)) (tptp.in1 (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc (tptp.h2 X)) (tptp.in1 (tptp.or1 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t68)
% 0.58/0.75  (assume t68.a0 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc (tptp.h2 X)) (tptp.in1 (tptp.or1 X))))))
% 0.58/0.75  (step t68.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc (tptp.h2 X)) (tptp.in1 (tptp.or1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))))) :rule forall_inst :args ((:= X tptp.f)))
% 0.58/0.75  (step t68.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc (tptp.h2 X)) (tptp.in1 (tptp.or1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f))))) :rule or :premises (t68.t1))
% 0.58/0.75  (step t68.t3 (cl (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f))))) :rule resolution :premises (t68.t2 t68.a0))
% 0.58/0.75  (step t68 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc (tptp.h2 X)) (tptp.in1 (tptp.or1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f))))) :rule subproof :discharge (t68.a0))
% 0.58/0.75  (step t69 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc (tptp.h2 X)) (tptp.in1 (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f))))) :rule resolution :premises (t67 t68))
% 0.58/0.75  (step t70 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc (tptp.h2 X)) (tptp.in1 (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f))))) (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t71 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc (tptp.h2 X)) (tptp.in1 (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc (tptp.h2 X)) (tptp.in1 (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))))) :rule resolution :premises (t69 t70))
% 0.58/0.75  (step t72 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc (tptp.h2 X)) (tptp.in1 (tptp.or1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))))) :rule contraction :premises (t71))
% 0.58/0.75  (step t73 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outc (tptp.h2 X)) (tptp.in1 (tptp.or1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f))))) :rule implies :premises (t72))
% 0.58/0.75  (step t74 (cl (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f))))) :rule resolution :premises (t73 a45))
% 0.58/0.75  (step t75 (cl (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) :rule resolution :premises (t66 a51 t74))
% 0.58/0.75  (step t76 (cl (not (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f))))) (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t77 (cl (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f)))))) :rule reordering :premises (t76))
% 0.58/0.75  (step t78 (cl (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t79 (cl (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule reordering :premises (t78))
% 0.58/0.75  (step t80 (cl (not (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f)))) (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f))) :rule or_pos)
% 0.58/0.75  (step t81 (cl (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f)) (not (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f))))) :rule reordering :premises (t80))
% 0.58/0.75  (step t82 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h2 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f)))) (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h2 X))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t83)
% 0.58/0.75  (assume t83.a0 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h2 X)))))
% 0.58/0.75  (step t83.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f))))) :rule forall_inst :args ((:= X tptp.f)))
% 0.58/0.75  (step t83.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f)))) :rule or :premises (t83.t1))
% 0.58/0.75  (step t83.t3 (cl (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f)))) :rule resolution :premises (t83.t2 t83.a0))
% 0.58/0.75  (step t83 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f)))) :rule subproof :discharge (t83.a0))
% 0.58/0.75  (step t84 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h2 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f)))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f)))) :rule resolution :premises (t82 t83))
% 0.58/0.75  (step t85 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h2 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f)))) (not (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f))))) :rule implies_neg2)
% 0.58/0.75  (step t86 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h2 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f)))) (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h2 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f))))) :rule resolution :premises (t84 t85))
% 0.58/0.75  (step t87 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h2 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f))))) :rule contraction :premises (t86))
% 0.58/0.75  (step t88 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f)))) :rule implies :premises (t87))
% 0.58/0.75  (step t89 (cl (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h2 tptp.f)))) :rule resolution :premises (t88 a41))
% 0.58/0.75  (step t90 (cl (tptp.halfadder (tptp.h2 tptp.f))) :rule resolution :premises (t81 a51 t89))
% 0.58/0.75  (step t91 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.and2 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t92)
% 0.58/0.75  (assume t92.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.and2 X))))))
% 0.58/0.75  (step t92.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 0.58/0.75  (step t92.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule or :premises (t92.t1))
% 0.58/0.75  (step t92.t3 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t92.t2 t92.a0))
% 0.58/0.75  (step t92 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t92.a0))
% 0.58/0.75  (step t93 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t91 t92))
% 0.58/0.75  (step t94 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t95 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule resolution :premises (t93 t94))
% 0.58/0.75  (step t96 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule contraction :premises (t95))
% 0.58/0.75  (step t97 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outc X) (tptp.out1 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule implies :premises (t96))
% 0.58/0.75  (step t98 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t97 a36))
% 0.58/0.75  (step t99 (cl (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) :rule resolution :premises (t79 t90 t98))
% 0.58/0.75  (step t100 (cl (not (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t101 (cl (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule reordering :premises (t100))
% 0.58/0.75  (step t102 (cl (not (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t103 (cl (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f))) (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (not (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f)))))) :rule reordering :premises (t102))
% 0.58/0.75  (step t104 (cl (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t105 (cl (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f))) (not (tptp.halfadder (tptp.h2 tptp.f))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))))) :rule reordering :premises (t104))
% 0.58/0.75  (step t106 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t107)
% 0.58/0.75  (assume t107.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X)))))
% 0.58/0.75  (step t107.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 0.58/0.75  (step t107.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f))))) :rule or :premises (t107.t1))
% 0.58/0.75  (step t107.t3 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f))))) :rule resolution :premises (t107.t2 t107.a0))
% 0.58/0.75  (step t107 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f))))) :rule subproof :discharge (t107.a0))
% 0.58/0.75  (step t108 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f))))) :rule resolution :premises (t106 t107))
% 0.58/0.75  (step t109 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f))))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t110 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t108 t109))
% 0.58/0.75  (step t111 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))))) :rule contraction :premises (t110))
% 0.58/0.75  (step t112 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f))))) :rule implies :premises (t111))
% 0.58/0.75  (step t113 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f))))) :rule resolution :premises (t112 a28))
% 0.58/0.75  (step t114 (cl (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) :rule resolution :premises (t105 t90 t113))
% 0.58/0.75  (step t115 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f))))) (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t116)
% 0.58/0.75  (assume t116.a0 (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))))
% 0.58/0.75  (step t116.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= K (tptp.and2 (tptp.h2 tptp.f)))))
% 0.58/0.75  (step t116.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f))))) :rule or :premises (t116.t1))
% 0.58/0.75  (step t116.t3 (cl (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f))))) :rule resolution :premises (t116.t2 t116.a0))
% 0.58/0.75  (step t116 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f))))) :rule subproof :discharge (t116.a0))
% 0.58/0.75  (step t117 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f))))) (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f))))) :rule resolution :premises (t115 t116))
% 0.58/0.75  (step t118 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f))))) (not (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t119 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f))))) (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t117 t118))
% 0.58/0.75  (step t120 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f)))))) :rule contraction :premises (t119))
% 0.58/0.75  (step t121 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f))))) :rule implies :premises (t120))
% 0.58/0.75  (step t122 (cl (or (not (tptp.logic_and (tptp.and2 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h2 tptp.f))))) :rule resolution :premises (t121 a12))
% 0.58/0.75  (step t123 (cl (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) :rule resolution :premises (t103 a58 t114 t122))
% 0.58/0.75  (step t124 (cl (not (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t125 (cl (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))) (not (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule reordering :premises (t124))
% 0.58/0.75  (step t126 (cl (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t127 (cl (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule reordering :premises (t126))
% 0.58/0.75  (step t128 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t129)
% 0.58/0.75  (assume t129.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X))))))
% 0.58/0.75  (step t129.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 0.58/0.75  (step t129.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule or :premises (t129.t1))
% 0.58/0.75  (step t129.t3 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t129.t2 t129.a0))
% 0.58/0.75  (step t129 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t129.a0))
% 0.58/0.75  (step t130 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t128 t129))
% 0.58/0.75  (step t131 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t132 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule resolution :premises (t130 t131))
% 0.58/0.75  (step t133 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule contraction :premises (t132))
% 0.58/0.75  (step t134 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule implies :premises (t133))
% 0.58/0.75  (step t135 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t134 a33))
% 0.58/0.75  (step t136 (cl (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) :rule resolution :premises (t127 t90 t135))
% 0.58/0.75  (step t137 (cl (not (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f))))) (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t138 (cl (not (tptp.one (tptp.in1 tptp.f))) (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.h2 tptp.f))) (not (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f)))))) :rule reordering :premises (t137))
% 0.58/0.75  (step t139 (cl (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f))))) (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t140 (cl (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f))) (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))))) :rule reordering :premises (t139))
% 0.58/0.75  (step t141 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.h2 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t142)
% 0.58/0.75  (assume t142.a0 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.h2 X))))))
% 0.58/0.75  (step t142.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.h2 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= X tptp.f)))
% 0.58/0.75  (step t142.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.h2 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f))))) :rule or :premises (t142.t1))
% 0.58/0.75  (step t142.t3 (cl (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f))))) :rule resolution :premises (t142.t2 t142.a0))
% 0.58/0.75  (step t142 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.h2 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f))))) :rule subproof :discharge (t142.a0))
% 0.58/0.75  (step t143 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f))))) :rule resolution :premises (t141 t142))
% 0.58/0.75  (step t144 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f))))) (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t145 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t143 t144))
% 0.58/0.75  (step t146 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))))) :rule contraction :premises (t145))
% 0.58/0.75  (step t147 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.h2 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f))))) :rule implies :premises (t146))
% 0.58/0.75  (step t148 (cl (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f))))) :rule resolution :premises (t147 a46))
% 0.58/0.75  (step t149 (cl (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) :rule resolution :premises (t140 a51 t148))
% 0.58/0.75  (step t150 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t151)
% 0.58/0.75  (assume t151.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))))
% 0.58/0.75  (step t151.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= P1 (tptp.in1 tptp.f)) (:= P2 (tptp.in1 (tptp.h2 tptp.f)))))
% 0.58/0.75  (step t151.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f))))) :rule or :premises (t151.t1))
% 0.58/0.75  (step t151.t3 (cl (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f))))) :rule resolution :premises (t151.t2 t151.a0))
% 0.58/0.75  (step t151 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f))))) :rule subproof :discharge (t151.a0))
% 0.58/0.75  (step t152 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f))))) (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f))))) :rule resolution :premises (t150 t151))
% 0.58/0.75  (step t153 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f))))) (not (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t154 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t152 t153))
% 0.58/0.75  (step t155 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f)))))) :rule contraction :premises (t154))
% 0.58/0.75  (step t156 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f))))) :rule implies :premises (t155))
% 0.58/0.75  (step t157 (cl (or (not (tptp.connection (tptp.in1 tptp.f) (tptp.in1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 tptp.f))) (tptp.one (tptp.in1 (tptp.h2 tptp.f))))) :rule resolution :premises (t156 a1))
% 0.58/0.75  (step t158 (cl (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) :rule resolution :premises (t138 a52 t149 t157))
% 0.58/0.75  (step t159 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t160)
% 0.58/0.75  (assume t160.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))))
% 0.58/0.75  (step t160.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= P1 (tptp.in1 (tptp.h2 tptp.f))) (:= P2 (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))))
% 0.58/0.75  (step t160.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule or :premises (t160.t1))
% 0.58/0.75  (step t160.t3 (cl (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t160.t2 t160.a0))
% 0.58/0.75  (step t160 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t160.a0))
% 0.58/0.75  (step t161 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t159 t160))
% 0.58/0.75  (step t162 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) (not (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t163 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule resolution :premises (t161 t162))
% 0.58/0.75  (step t164 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule contraction :premises (t163))
% 0.58/0.75  (step t165 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule implies :premises (t164))
% 0.58/0.75  (step t166 (cl (or (not (tptp.connection (tptp.in1 (tptp.h2 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t165 a1))
% 0.58/0.75  (step t167 (cl (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) :rule resolution :premises (t125 t136 t158 t166))
% 0.58/0.75  (step t168 (cl (not (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t169 (cl (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))) (not (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))))) :rule reordering :premises (t168))
% 0.58/0.75  (step t170 (cl (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t171 (cl (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))))) :rule reordering :premises (t170))
% 0.58/0.75  (step t172 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.and2 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t173)
% 0.58/0.75  (assume t173.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.and2 X))))))
% 0.58/0.75  (step t173.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 0.58/0.75  (step t173.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule or :premises (t173.t1))
% 0.58/0.75  (step t173.t3 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t173.t2 t173.a0))
% 0.58/0.75  (step t173 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t173.a0))
% 0.58/0.75  (step t174 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t172 t173))
% 0.58/0.75  (step t175 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t176 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))))) :rule resolution :premises (t174 t175))
% 0.58/0.75  (step t177 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))))) :rule contraction :premises (t176))
% 0.58/0.75  (step t178 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule implies :premises (t177))
% 0.58/0.75  (step t179 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t178 a34))
% 0.58/0.75  (step t180 (cl (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) :rule resolution :premises (t171 t90 t179))
% 0.58/0.75  (step t181 (cl (not (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f))))) (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t182 (cl (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (not (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f)))))) :rule reordering :premises (t181))
% 0.58/0.75  (step t183 (cl (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f))))) (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t184 (cl (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f))) (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))))) :rule reordering :premises (t183))
% 0.58/0.75  (step t185 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs (tptp.h1 X)) (tptp.in2 (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs (tptp.h1 X)) (tptp.in2 (tptp.h2 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t186)
% 0.58/0.75  (assume t186.a0 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs (tptp.h1 X)) (tptp.in2 (tptp.h2 X))))))
% 0.58/0.75  (step t186.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs (tptp.h1 X)) (tptp.in2 (tptp.h2 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= X tptp.f)))
% 0.58/0.75  (step t186.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs (tptp.h1 X)) (tptp.in2 (tptp.h2 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f))))) :rule or :premises (t186.t1))
% 0.58/0.75  (step t186.t3 (cl (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f))))) :rule resolution :premises (t186.t2 t186.a0))
% 0.58/0.75  (step t186 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs (tptp.h1 X)) (tptp.in2 (tptp.h2 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f))))) :rule subproof :discharge (t186.a0))
% 0.58/0.75  (step t187 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs (tptp.h1 X)) (tptp.in2 (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f))))) :rule resolution :premises (t185 t186))
% 0.58/0.75  (step t188 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs (tptp.h1 X)) (tptp.in2 (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f))))) (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t189 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs (tptp.h1 X)) (tptp.in2 (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs (tptp.h1 X)) (tptp.in2 (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t187 t188))
% 0.58/0.75  (step t190 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs (tptp.h1 X)) (tptp.in2 (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))))) :rule contraction :premises (t189))
% 0.58/0.75  (step t191 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs (tptp.h1 X)) (tptp.in2 (tptp.h2 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f))))) :rule implies :premises (t190))
% 0.58/0.75  (step t192 (cl (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f))))) :rule resolution :premises (t191 a43))
% 0.58/0.75  (step t193 (cl (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) :rule resolution :premises (t184 a51 t192))
% 0.58/0.75  (step t194 (cl (not (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f))))) (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t195 (cl (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f)))))) :rule reordering :premises (t194))
% 0.58/0.75  (step t196 (cl (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t197 (cl (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t196))
% 0.58/0.75  (step t198 (cl (not (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f)))) (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f))) :rule or_pos)
% 0.58/0.75  (step t199 (cl (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f)) (not (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f))))) :rule reordering :premises (t198))
% 0.58/0.75  (step t200 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h1 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f)))) (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h1 X))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t201)
% 0.58/0.75  (assume t201.a0 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h1 X)))))
% 0.58/0.75  (step t201.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f))))) :rule forall_inst :args ((:= X tptp.f)))
% 0.58/0.75  (step t201.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f)))) :rule or :premises (t201.t1))
% 0.58/0.75  (step t201.t3 (cl (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f)))) :rule resolution :premises (t201.t2 t201.a0))
% 0.58/0.75  (step t201 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f)))) :rule subproof :discharge (t201.a0))
% 0.58/0.75  (step t202 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h1 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f)))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f)))) :rule resolution :premises (t200 t201))
% 0.58/0.75  (step t203 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h1 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f)))) (not (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f))))) :rule implies_neg2)
% 0.58/0.75  (step t204 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h1 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f)))) (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h1 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f))))) :rule resolution :premises (t202 t203))
% 0.58/0.75  (step t205 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h1 X)))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f))))) :rule contraction :premises (t204))
% 0.58/0.75  (step t206 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.halfadder (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f)))) :rule implies :premises (t205))
% 0.58/0.75  (step t207 (cl (or (not (tptp.fulladder tptp.f)) (tptp.halfadder (tptp.h1 tptp.f)))) :rule resolution :premises (t206 a40))
% 0.58/0.75  (step t208 (cl (tptp.halfadder (tptp.h1 tptp.f))) :rule resolution :premises (t199 a51 t207))
% 0.58/0.75  (step t209 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t210)
% 0.58/0.75  (assume t210.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X))))))
% 0.58/0.75  (step t210.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 0.58/0.75  (step t210.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule or :premises (t210.t1))
% 0.58/0.75  (step t210.t3 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t210.t2 t210.a0))
% 0.58/0.75  (step t210 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t210.a0))
% 0.58/0.75  (step t211 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t209 t210))
% 0.58/0.75  (step t212 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t213 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t211 t212))
% 0.58/0.75  (step t214 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t213))
% 0.58/0.75  (step t215 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule implies :premises (t214))
% 0.58/0.75  (step t216 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t215 a35))
% 0.58/0.75  (step t217 (cl (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) :rule resolution :premises (t197 t208 t216))
% 0.58/0.75  (step t218 (cl (not (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t219 (cl (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t218))
% 0.58/0.75  (step t220 (cl (not (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t221 (cl (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f))) (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (not (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f)))))) :rule reordering :premises (t220))
% 0.58/0.75  (step t222 (cl (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t223 (cl (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f))) (not (tptp.halfadder (tptp.h1 tptp.f))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))))) :rule reordering :premises (t222))
% 0.58/0.75  (step t224 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t225)
% 0.58/0.75  (assume t225.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X)))))
% 0.58/0.75  (step t225.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 0.58/0.75  (step t225.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f))))) :rule or :premises (t225.t1))
% 0.58/0.75  (step t225.t3 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f))))) :rule resolution :premises (t225.t2 t225.a0))
% 0.58/0.75  (step t225 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f))))) :rule subproof :discharge (t225.a0))
% 0.58/0.75  (step t226 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f))))) :rule resolution :premises (t224 t225))
% 0.58/0.75  (step t227 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f))))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t228 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t226 t227))
% 0.58/0.75  (step t229 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))))) :rule contraction :premises (t228))
% 0.58/0.75  (step t230 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f))))) :rule implies :premises (t229))
% 0.58/0.75  (step t231 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f))))) :rule resolution :premises (t230 a27))
% 0.58/0.75  (step t232 (cl (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) :rule resolution :premises (t223 t208 t231))
% 0.58/0.75  (step t233 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f))))) (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t234)
% 0.58/0.75  (assume t234.a0 (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))))
% 0.58/0.75  (step t234.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f)))))) :rule forall_inst :args ((:= K (tptp.and1 (tptp.h1 tptp.f)))))
% 0.58/0.75  (step t234.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f))))) :rule or :premises (t234.t1))
% 0.58/0.75  (step t234.t3 (cl (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f))))) :rule resolution :premises (t234.t2 t234.a0))
% 0.58/0.75  (step t234 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f))))) :rule subproof :discharge (t234.a0))
% 0.58/0.75  (step t235 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f))))) (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f))))) :rule resolution :premises (t233 t234))
% 0.58/0.75  (step t236 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f))))) (not (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t237 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f))))) (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t235 t236))
% 0.58/0.75  (step t238 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f)))))) :rule contraction :premises (t237))
% 0.58/0.75  (step t239 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f))))) :rule implies :premises (t238))
% 0.58/0.75  (step t240 (cl (or (not (tptp.logic_and (tptp.and1 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h1 tptp.f))))) :rule resolution :premises (t239 a12))
% 0.58/0.75  (step t241 (cl (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) :rule resolution :premises (t221 a63 t232 t240))
% 0.58/0.75  (step t242 (cl (not (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t243 (cl (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))) (not (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t242))
% 0.58/0.75  (step t244 (cl (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t245 (cl (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t244))
% 0.58/0.75  (step t246 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.or1 X)) (tptp.in1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.or1 X)) (tptp.in1 (tptp.and1 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t247)
% 0.58/0.75  (assume t247.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.or1 X)) (tptp.in1 (tptp.and1 X))))))
% 0.58/0.75  (step t247.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.or1 X)) (tptp.in1 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 0.58/0.75  (step t247.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.or1 X)) (tptp.in1 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule or :premises (t247.t1))
% 0.58/0.75  (step t247.t3 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t247.t2 t247.a0))
% 0.58/0.75  (step t247 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.or1 X)) (tptp.in1 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t247.a0))
% 0.58/0.75  (step t248 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.or1 X)) (tptp.in1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t246 t247))
% 0.58/0.75  (step t249 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.or1 X)) (tptp.in1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t250 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.or1 X)) (tptp.in1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.or1 X)) (tptp.in1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t248 t249))
% 0.58/0.75  (step t251 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.or1 X)) (tptp.in1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t250))
% 0.58/0.75  (step t252 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.or1 X)) (tptp.in1 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule implies :premises (t251))
% 0.58/0.75  (step t253 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t252 a37))
% 0.58/0.75  (step t254 (cl (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) :rule resolution :premises (t245 t208 t253))
% 0.58/0.75  (step t255 (cl (not (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f)))))) (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t256 (cl (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t255))
% 0.58/0.75  (step t257 (cl (not (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t258 (cl (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f))) (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (not (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f)))))) :rule reordering :premises (t257))
% 0.58/0.75  (step t259 (cl (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t260 (cl (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f))) (not (tptp.halfadder (tptp.h1 tptp.f))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))))) :rule reordering :premises (t259))
% 0.58/0.75  (step t261 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_or (tptp.or1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_or (tptp.or1 X))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t262)
% 0.58/0.75  (assume t262.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_or (tptp.or1 X)))))
% 0.58/0.75  (step t262.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_or (tptp.or1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 0.58/0.75  (step t262.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_or (tptp.or1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f))))) :rule or :premises (t262.t1))
% 0.58/0.75  (step t262.t3 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f))))) :rule resolution :premises (t262.t2 t262.a0))
% 0.58/0.75  (step t262 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_or (tptp.or1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f))))) :rule subproof :discharge (t262.a0))
% 0.58/0.75  (step t263 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_or (tptp.or1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f))))) :rule resolution :premises (t261 t262))
% 0.58/0.75  (step t264 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_or (tptp.or1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f))))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t265 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_or (tptp.or1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_or (tptp.or1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t263 t264))
% 0.58/0.75  (step t266 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_or (tptp.or1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))))) :rule contraction :premises (t265))
% 0.58/0.75  (step t267 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_or (tptp.or1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f))))) :rule implies :premises (t266))
% 0.58/0.75  (step t268 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f))))) :rule resolution :premises (t267 a30))
% 0.58/0.75  (step t269 (cl (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) :rule resolution :premises (t260 t208 t268))
% 0.58/0.75  (step t270 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K))) (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f))))) (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t271)
% 0.58/0.75  (assume t271.a0 (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K))))
% 0.58/0.75  (step t271.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f)))))) :rule forall_inst :args ((:= K (tptp.or1 (tptp.h1 tptp.f)))))
% 0.58/0.75  (step t271.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f))))) :rule or :premises (t271.t1))
% 0.58/0.75  (step t271.t3 (cl (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f))))) :rule resolution :premises (t271.t2 t271.a0))
% 0.58/0.75  (step t271 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f))))) :rule subproof :discharge (t271.a0))
% 0.58/0.75  (step t272 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K))) (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f))))) (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f))))) :rule resolution :premises (t270 t271))
% 0.58/0.75  (step t273 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K))) (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f))))) (not (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t274 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K))) (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f))))) (=> (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K))) (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t272 t273))
% 0.58/0.75  (step t275 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K))) (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f)))))) :rule contraction :premises (t274))
% 0.58/0.75  (step t276 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f))))) :rule implies :premises (t275))
% 0.58/0.75  (step t277 (cl (or (not (tptp.logic_or (tptp.or1 (tptp.h1 tptp.f)))) (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.or1 (tptp.h1 tptp.f))))) :rule resolution :premises (t276 a20))
% 0.58/0.75  (step t278 (cl (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) :rule resolution :premises (t258 a60 t269 t277))
% 0.58/0.75  (step t279 (cl (not (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t280 (cl (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))) (not (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t279))
% 0.58/0.75  (step t281 (cl (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t282 (cl (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t281))
% 0.58/0.75  (step t283 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.or1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.or1 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t284)
% 0.58/0.75  (assume t284.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.or1 X))))))
% 0.58/0.75  (step t284.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.or1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 0.58/0.75  (step t284.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.or1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule or :premises (t284.t1))
% 0.58/0.75  (step t284.t3 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t284.t2 t284.a0))
% 0.58/0.75  (step t284 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.or1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t284.a0))
% 0.58/0.75  (step t285 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.or1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t283 t284))
% 0.58/0.75  (step t286 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.or1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t287 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.or1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.or1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t285 t286))
% 0.58/0.75  (step t288 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.or1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t287))
% 0.58/0.75  (step t289 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in2 X) (tptp.in2 (tptp.or1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule implies :premises (t288))
% 0.58/0.75  (step t290 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t289 a32))
% 0.58/0.75  (step t291 (cl (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) :rule resolution :premises (t282 t208 t290))
% 0.58/0.75  (step t292 (cl (not (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f))))) (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t293 (cl (not (tptp.one (tptp.inc tptp.f))) (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h1 tptp.f))) (not (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f)))))) :rule reordering :premises (t292))
% 0.58/0.75  (step t294 (cl (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f))))) (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t295 (cl (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f))) (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))))) :rule reordering :premises (t294))
% 0.58/0.75  (step t296 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.inc X) (tptp.in2 (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.inc X) (tptp.in2 (tptp.h1 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t297)
% 0.58/0.75  (assume t297.a0 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.inc X) (tptp.in2 (tptp.h1 X))))))
% 0.58/0.75  (step t297.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.inc X) (tptp.in2 (tptp.h1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))))) :rule forall_inst :args ((:= X tptp.f)))
% 0.58/0.75  (step t297.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.inc X) (tptp.in2 (tptp.h1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f))))) :rule or :premises (t297.t1))
% 0.58/0.75  (step t297.t3 (cl (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f))))) :rule resolution :premises (t297.t2 t297.a0))
% 0.58/0.75  (step t297 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.inc X) (tptp.in2 (tptp.h1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f))))) :rule subproof :discharge (t297.a0))
% 0.58/0.75  (step t298 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.inc X) (tptp.in2 (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f))))) :rule resolution :premises (t296 t297))
% 0.58/0.75  (step t299 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.inc X) (tptp.in2 (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f))))) (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t300 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.inc X) (tptp.in2 (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.inc X) (tptp.in2 (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t298 t299))
% 0.58/0.75  (step t301 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.inc X) (tptp.in2 (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))))) :rule contraction :premises (t300))
% 0.58/0.75  (step t302 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.inc X) (tptp.in2 (tptp.h1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f))))) :rule implies :premises (t301))
% 0.58/0.75  (step t303 (cl (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f))))) :rule resolution :premises (t302 a48))
% 0.58/0.75  (step t304 (cl (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) :rule resolution :premises (t295 a51 t303))
% 0.58/0.75  (step t305 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t306)
% 0.58/0.75  (assume t306.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))))
% 0.58/0.75  (step t306.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f)))))) :rule forall_inst :args ((:= P1 (tptp.inc tptp.f)) (:= P2 (tptp.in2 (tptp.h1 tptp.f)))))
% 0.58/0.75  (step t306.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f))))) :rule or :premises (t306.t1))
% 0.58/0.75  (step t306.t3 (cl (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f))))) :rule resolution :premises (t306.t2 t306.a0))
% 0.58/0.75  (step t306 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f))))) :rule subproof :discharge (t306.a0))
% 0.58/0.75  (step t307 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f))))) (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f))))) :rule resolution :premises (t305 t306))
% 0.58/0.75  (step t308 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f))))) (not (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t309 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t307 t308))
% 0.58/0.75  (step t310 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f)))))) :rule contraction :premises (t309))
% 0.58/0.75  (step t311 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f))))) :rule implies :premises (t310))
% 0.58/0.75  (step t312 (cl (or (not (tptp.connection (tptp.inc tptp.f) (tptp.in2 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.inc tptp.f))) (tptp.one (tptp.in2 (tptp.h1 tptp.f))))) :rule resolution :premises (t311 a1))
% 0.58/0.75  (step t313 (cl (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) :rule resolution :premises (t293 a54 t304 t312))
% 0.58/0.75  (step t314 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t315)
% 0.58/0.75  (assume t315.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))))
% 0.58/0.75  (step t315.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= P1 (tptp.in2 (tptp.h1 tptp.f))) (:= P2 (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))))
% 0.58/0.75  (step t315.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule or :premises (t315.t1))
% 0.58/0.75  (step t315.t3 (cl (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t315.t2 t315.a0))
% 0.58/0.75  (step t315 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t315.a0))
% 0.58/0.75  (step t316 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t314 t315))
% 0.58/0.75  (step t317 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t318 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t316 t317))
% 0.58/0.75  (step t319 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t318))
% 0.58/0.75  (step t320 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule implies :premises (t319))
% 0.58/0.75  (step t321 (cl (or (not (tptp.connection (tptp.in2 (tptp.h1 tptp.f)) (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t320 a1))
% 0.58/0.75  (step t322 (cl (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) :rule resolution :premises (t280 t291 t313 t321))
% 0.58/0.75  (step t323 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f)))))) (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t324)
% 0.58/0.75  (assume t324.a0 (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))))
% 0.58/0.75  (step t324.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= K (tptp.or1 (tptp.h1 tptp.f)))))
% 0.58/0.75  (step t324.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f)))))) :rule or :premises (t324.t1))
% 0.58/0.75  (step t324.t3 (cl (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t324.t2 t324.a0))
% 0.58/0.75  (step t324 (cl (not (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t324.a0))
% 0.58/0.75  (step t325 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f)))))) (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t323 t324))
% 0.58/0.75  (step t326 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t327 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f)))))) (=> (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t325 t326))
% 0.58/0.75  (step t328 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t327))
% 0.58/0.75  (step t329 (cl (not (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f)))))) :rule implies :premises (t328))
% 0.58/0.75  (step t330 (cl (or (not (tptp.or_ok (tptp.or1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t329 a14))
% 0.58/0.75  (step t331 (cl (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) :rule resolution :premises (t256 t278 t322 t330))
% 0.58/0.75  (step t332 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t333)
% 0.58/0.75  (assume t333.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))))
% 0.58/0.75  (step t333.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= P1 (tptp.out1 (tptp.or1 (tptp.h1 tptp.f)))) (:= P2 (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))))
% 0.58/0.75  (step t333.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule or :premises (t333.t1))
% 0.58/0.75  (step t333.t3 (cl (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t333.t2 t333.a0))
% 0.58/0.75  (step t333 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t333.a0))
% 0.58/0.75  (step t334 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t332 t333))
% 0.58/0.75  (step t335 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t336 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t334 t335))
% 0.58/0.75  (step t337 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t336))
% 0.58/0.75  (step t338 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule implies :premises (t337))
% 0.58/0.75  (step t339 (cl (or (not (tptp.connection (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.or1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t338 a1))
% 0.58/0.75  (step t340 (cl (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) :rule resolution :premises (t243 t254 t331 t339))
% 0.58/0.75  (step t341 (cl (not (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t342 (cl (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))) (not (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t341))
% 0.58/0.75  (step t343 (cl (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t344 (cl (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t343))
% 0.58/0.75  (step t345 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t346)
% 0.58/0.75  (assume t346.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X))))))
% 0.58/0.75  (step t346.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 0.58/0.75  (step t346.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule or :premises (t346.t1))
% 0.58/0.75  (step t346.t3 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t346.t2 t346.a0))
% 0.58/0.75  (step t346 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t346.a0))
% 0.58/0.75  (step t347 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t345 t346))
% 0.58/0.75  (step t348 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t349 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t347 t348))
% 0.58/0.75  (step t350 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t349))
% 0.58/0.75  (step t351 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule implies :premises (t350))
% 0.58/0.75  (step t352 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t351 a39))
% 0.58/0.75  (step t353 (cl (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) :rule resolution :premises (t344 t208 t352))
% 0.58/0.75  (step t354 (cl (not (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f)))))) (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t355 (cl (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t354))
% 0.58/0.75  (step t356 (cl (not (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t357 (cl (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f))) (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (not (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f)))))) :rule reordering :premises (t356))
% 0.58/0.75  (step t358 (cl (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t359 (cl (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f))) (not (tptp.halfadder (tptp.h1 tptp.f))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))))) :rule reordering :premises (t358))
% 0.58/0.75  (step t360 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t361)
% 0.58/0.75  (assume t361.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X)))))
% 0.58/0.75  (step t361.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 0.58/0.75  (step t361.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f))))) :rule or :premises (t361.t1))
% 0.58/0.75  (step t361.t3 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f))))) :rule resolution :premises (t361.t2 t361.a0))
% 0.58/0.75  (step t361 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f))))) :rule subproof :discharge (t361.a0))
% 0.58/0.75  (step t362 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f))))) :rule resolution :premises (t360 t361))
% 0.58/0.75  (step t363 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f))))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t364 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t362 t363))
% 0.58/0.75  (step t365 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))))) :rule contraction :premises (t364))
% 0.58/0.75  (step t366 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f))))) :rule implies :premises (t365))
% 0.58/0.75  (step t367 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f))))) :rule resolution :premises (t366 a29))
% 0.58/0.75  (step t368 (cl (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) :rule resolution :premises (t359 t208 t367))
% 0.58/0.75  (step t369 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K))) (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f))))) (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t370)
% 0.58/0.75  (assume t370.a0 (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K))))
% 0.58/0.75  (step t370.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f)))))) :rule forall_inst :args ((:= K (tptp.not1 (tptp.h1 tptp.f)))))
% 0.58/0.75  (step t370.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f))))) :rule or :premises (t370.t1))
% 0.58/0.75  (step t370.t3 (cl (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f))))) :rule resolution :premises (t370.t2 t370.a0))
% 0.58/0.75  (step t370 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f))))) :rule subproof :discharge (t370.a0))
% 0.58/0.75  (step t371 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K))) (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f))))) (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f))))) :rule resolution :premises (t369 t370))
% 0.58/0.75  (step t372 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K))) (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f))))) (not (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t373 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K))) (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f))))) (=> (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K))) (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t371 t372))
% 0.58/0.75  (step t374 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K))) (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f)))))) :rule contraction :premises (t373))
% 0.58/0.75  (step t375 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f))))) :rule implies :premises (t374))
% 0.58/0.75  (step t376 (cl (or (not (tptp.logic_not (tptp.not1 (tptp.h1 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h1 tptp.f))))) :rule resolution :premises (t375 a26))
% 0.58/0.75  (step t377 (cl (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) :rule resolution :premises (t357 a61 t368 t376))
% 0.58/0.75  (step t378 (cl (not (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t379 (cl (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))) (not (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t378))
% 0.58/0.75  (step t380 (cl (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t381 (cl (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t380))
% 0.58/0.75  (step t382 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t383)
% 0.58/0.75  (assume t383.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X))))))
% 0.58/0.75  (step t383.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 0.58/0.75  (step t383.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule or :premises (t383.t1))
% 0.58/0.75  (step t383.t3 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t383.t2 t383.a0))
% 0.58/0.75  (step t383 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t383.a0))
% 0.58/0.75  (step t384 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t382 t383))
% 0.58/0.75  (step t385 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t386 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t384 t385))
% 0.58/0.75  (step t387 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t386))
% 0.58/0.75  (step t388 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule implies :premises (t387))
% 0.58/0.75  (step t389 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t388 a38))
% 0.58/0.75  (step t390 (cl (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) :rule resolution :premises (t381 t208 t389))
% 0.58/0.75  (step t391 (cl (not (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f)))))) (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t392 (cl (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule reordering :premises (t391))
% 0.58/0.75  (step t393 (cl (not (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t394 (cl (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f))) (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (not (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f)))))) :rule reordering :premises (t393))
% 0.58/0.75  (step t395 (cl (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t396 (cl (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f))) (not (tptp.halfadder (tptp.h1 tptp.f))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))))) :rule reordering :premises (t395))
% 0.58/0.75  (step t397 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t398)
% 0.58/0.75  (assume t398.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X)))))
% 0.58/0.75  (step t398.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 0.58/0.75  (step t398.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f))))) :rule or :premises (t398.t1))
% 0.58/0.75  (step t398.t3 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f))))) :rule resolution :premises (t398.t2 t398.a0))
% 0.58/0.75  (step t398 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f))))) :rule subproof :discharge (t398.a0))
% 0.58/0.75  (step t399 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f))))) :rule resolution :premises (t397 t398))
% 0.58/0.75  (step t400 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f))))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t401 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t399 t400))
% 0.58/0.75  (step t402 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X)))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))))) :rule contraction :premises (t401))
% 0.58/0.75  (step t403 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f))))) :rule implies :premises (t402))
% 0.58/0.75  (step t404 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f))))) :rule resolution :premises (t403 a28))
% 0.58/0.75  (step t405 (cl (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) :rule resolution :premises (t396 t208 t404))
% 0.58/0.75  (step t406 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f))))) (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t407)
% 0.58/0.75  (assume t407.a0 (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))))
% 0.58/0.75  (step t407.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f)))))) :rule forall_inst :args ((:= K (tptp.and2 (tptp.h1 tptp.f)))))
% 0.58/0.75  (step t407.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f))))) :rule or :premises (t407.t1))
% 0.58/0.75  (step t407.t3 (cl (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f))))) :rule resolution :premises (t407.t2 t407.a0))
% 0.58/0.75  (step t407 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f))))) :rule subproof :discharge (t407.a0))
% 0.58/0.75  (step t408 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f))))) (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f))))) :rule resolution :premises (t406 t407))
% 0.58/0.75  (step t409 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f))))) (not (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t410 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f))))) (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t408 t409))
% 0.58/0.75  (step t411 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f)))))) :rule contraction :premises (t410))
% 0.58/0.75  (step t412 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f))))) :rule implies :premises (t411))
% 0.58/0.75  (step t413 (cl (or (not (tptp.logic_and (tptp.and2 (tptp.h1 tptp.f)))) (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f))) (tptp.abnormal (tptp.and2 (tptp.h1 tptp.f))))) :rule resolution :premises (t412 a12))
% 0.58/0.75  (step t414 (cl (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) :rule resolution :premises (t394 a62 t405 t413))
% 0.58/0.75  (step t415 (cl (not (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t416 (cl (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))) (not (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule reordering :premises (t415))
% 0.58/0.75  (step t417 (cl (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t418 (cl (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule reordering :premises (t417))
% 0.58/0.75  (step t419 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t420)
% 0.58/0.75  (assume t420.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X))))))
% 0.58/0.75  (step t420.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 0.58/0.75  (step t420.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule or :premises (t420.t1))
% 0.58/0.75  (step t420.t3 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t420.t2 t420.a0))
% 0.58/0.75  (step t420 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t420.a0))
% 0.58/0.75  (step t421 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t419 t420))
% 0.58/0.75  (step t422 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) (not (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t423 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule resolution :premises (t421 t422))
% 0.58/0.75  (step t424 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule contraction :premises (t423))
% 0.58/0.75  (step t425 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.in1 X) (tptp.in1 (tptp.and2 X)))))) (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule implies :premises (t424))
% 0.58/0.75  (step t426 (cl (or (not (tptp.halfadder (tptp.h1 tptp.f))) (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t425 a33))
% 0.58/0.75  (step t427 (cl (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) :rule resolution :premises (t418 t208 t426))
% 0.58/0.75  (step t428 (cl (not (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f))))) (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t429 (cl (not (tptp.zero (tptp.in2 tptp.f))) (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f))) (not (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))))) :rule reordering :premises (t428))
% 0.58/0.75  (step t430 (cl (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f))))) (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t431 (cl (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f))) (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))))) :rule reordering :premises (t430))
% 0.58/0.75  (step t432 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in2 X) (tptp.in1 (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in2 X) (tptp.in1 (tptp.h1 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t433)
% 0.58/0.75  (assume t433.a0 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in2 X) (tptp.in1 (tptp.h1 X))))))
% 0.58/0.75  (step t433.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in2 X) (tptp.in1 (tptp.h1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))))) :rule forall_inst :args ((:= X tptp.f)))
% 0.58/0.75  (step t433.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in2 X) (tptp.in1 (tptp.h1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f))))) :rule or :premises (t433.t1))
% 0.58/0.75  (step t433.t3 (cl (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f))))) :rule resolution :premises (t433.t2 t433.a0))
% 0.58/0.75  (step t433 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in2 X) (tptp.in1 (tptp.h1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f))))) :rule subproof :discharge (t433.a0))
% 0.58/0.75  (step t434 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in2 X) (tptp.in1 (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f))))) :rule resolution :premises (t432 t433))
% 0.58/0.75  (step t435 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in2 X) (tptp.in1 (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f))))) (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t436 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in2 X) (tptp.in1 (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in2 X) (tptp.in1 (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t434 t435))
% 0.58/0.75  (step t437 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in2 X) (tptp.in1 (tptp.h1 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))))) :rule contraction :premises (t436))
% 0.58/0.75  (step t438 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.in2 X) (tptp.in1 (tptp.h1 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f))))) :rule implies :premises (t437))
% 0.58/0.75  (step t439 (cl (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f))))) :rule resolution :premises (t438 a47))
% 0.58/0.75  (step t440 (cl (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) :rule resolution :premises (t431 a51 t439))
% 0.58/0.75  (step t441 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t442)
% 0.58/0.75  (assume t442.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))))
% 0.58/0.75  (step t442.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2)))) (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))))) :rule forall_inst :args ((:= P1 (tptp.in2 tptp.f)) (:= P2 (tptp.in1 (tptp.h1 tptp.f)))))
% 0.58/0.75  (step t442.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2)))) (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f))))) :rule or :premises (t442.t1))
% 0.58/0.75  (step t442.t3 (cl (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f))))) :rule resolution :premises (t442.t2 t442.a0))
% 0.58/0.75  (step t442 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2)))) (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f))))) :rule subproof :discharge (t442.a0))
% 0.58/0.75  (step t443 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f))))) (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f))))) :rule resolution :premises (t441 t442))
% 0.58/0.75  (step t444 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f))))) (not (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t445 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t443 t444))
% 0.58/0.75  (step t446 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))))) :rule contraction :premises (t445))
% 0.58/0.75  (step t447 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2)))) (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f))))) :rule implies :premises (t446))
% 0.58/0.75  (step t448 (cl (or (not (tptp.connection (tptp.in2 tptp.f) (tptp.in1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in2 tptp.f))) (tptp.zero (tptp.in1 (tptp.h1 tptp.f))))) :rule resolution :premises (t447 a0))
% 0.58/0.75  (step t449 (cl (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) :rule resolution :premises (t429 a53 t440 t448))
% 0.58/0.75  (step t450 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t451)
% 0.58/0.75  (assume t451.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))))
% 0.58/0.75  (step t451.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2)))) (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= P1 (tptp.in1 (tptp.h1 tptp.f))) (:= P2 (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))))
% 0.58/0.75  (step t451.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2)))) (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule or :premises (t451.t1))
% 0.58/0.75  (step t451.t3 (cl (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t451.t2 t451.a0))
% 0.58/0.75  (step t451 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2)))) (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t451.a0))
% 0.58/0.75  (step t452 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t450 t451))
% 0.58/0.75  (step t453 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) (not (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t454 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule resolution :premises (t452 t453))
% 0.58/0.75  (step t455 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule contraction :premises (t454))
% 0.58/0.75  (step t456 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2)))) (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule implies :premises (t455))
% 0.58/0.75  (step t457 (cl (or (not (tptp.connection (tptp.in1 (tptp.h1 tptp.f)) (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.in1 (tptp.h1 tptp.f)))) (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t456 a0))
% 0.58/0.75  (step t458 (cl (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) :rule resolution :premises (t416 t427 t449 t457))
% 0.58/0.75  (step t459 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.zero (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f)))))) (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.zero (tptp.out1 K))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t460)
% 0.58/0.75  (assume t460.a0 (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.zero (tptp.out1 K)))))
% 0.58/0.75  (step t460.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.zero (tptp.out1 K))))) (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= K (tptp.and2 (tptp.h1 tptp.f)))))
% 0.58/0.75  (step t460.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.zero (tptp.out1 K))))) (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule or :premises (t460.t1))
% 0.58/0.75  (step t460.t3 (cl (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t460.t2 t460.a0))
% 0.58/0.75  (step t460 (cl (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.zero (tptp.out1 K))))) (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t460.a0))
% 0.58/0.75  (step t461 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.zero (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f)))))) (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t459 t460))
% 0.58/0.75  (step t462 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.zero (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f)))))) (not (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t463 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.zero (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f)))))) (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.zero (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule resolution :premises (t461 t462))
% 0.58/0.75  (step t464 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.zero (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule contraction :premises (t463))
% 0.58/0.75  (step t465 (cl (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.zero (tptp.out1 K))))) (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule implies :premises (t464))
% 0.58/0.75  (step t466 (cl (or (not (tptp.and_ok (tptp.and2 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t465 a5))
% 0.58/0.75  (step t467 (cl (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) :rule resolution :premises (t392 t414 t458 t466))
% 0.58/0.75  (step t468 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t469)
% 0.58/0.75  (assume t469.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))))
% 0.58/0.75  (step t469.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2)))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= P1 (tptp.out1 (tptp.and2 (tptp.h1 tptp.f)))) (:= P2 (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))))
% 0.58/0.75  (step t469.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2)))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule or :premises (t469.t1))
% 0.58/0.75  (step t469.t3 (cl (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t469.t2 t469.a0))
% 0.58/0.75  (step t469 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2)))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t469.a0))
% 0.58/0.75  (step t470 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t468 t469))
% 0.58/0.75  (step t471 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t472 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t470 t471))
% 0.58/0.75  (step t473 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t472))
% 0.58/0.75  (step t474 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.zero P1)) (tptp.zero P2)))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule implies :premises (t473))
% 0.58/0.75  (step t475 (cl (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.zero (tptp.out1 (tptp.and2 (tptp.h1 tptp.f))))) (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t474 a0))
% 0.58/0.75  (step t476 (cl (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) :rule resolution :premises (t379 t390 t467 t475))
% 0.58/0.75  (step t477 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f)))))) (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.one (tptp.out1 K))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t478)
% 0.58/0.75  (assume t478.a0 (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.one (tptp.out1 K)))))
% 0.58/0.75  (step t478.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= K (tptp.not1 (tptp.h1 tptp.f)))))
% 0.58/0.75  (step t478.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule or :premises (t478.t1))
% 0.58/0.75  (step t478.t3 (cl (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t478.t2 t478.a0))
% 0.58/0.75  (step t478 (cl (not (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t478.a0))
% 0.58/0.75  (step t479 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f)))))) (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t477 t478))
% 0.58/0.75  (step t480 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t481 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f)))))) (=> (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t479 t480))
% 0.58/0.75  (step t482 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t481))
% 0.58/0.75  (step t483 (cl (not (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.zero (tptp.in1 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule implies :premises (t482))
% 0.58/0.75  (step t484 (cl (or (not (tptp.not_ok (tptp.not1 (tptp.h1 tptp.f)))) (not (tptp.zero (tptp.in1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t483 a21))
% 0.58/0.75  (step t485 (cl (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) :rule resolution :premises (t355 t377 t476 t484))
% 0.58/0.75  (step t486 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t487)
% 0.58/0.75  (assume t487.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))))
% 0.58/0.75  (step t487.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= P1 (tptp.out1 (tptp.not1 (tptp.h1 tptp.f)))) (:= P2 (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))))
% 0.58/0.75  (step t487.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule or :premises (t487.t1))
% 0.58/0.75  (step t487.t3 (cl (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t487.t2 t487.a0))
% 0.58/0.75  (step t487 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t487.a0))
% 0.58/0.75  (step t488 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t486 t487))
% 0.58/0.75  (step t489 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t490 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t488 t489))
% 0.58/0.75  (step t491 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t490))
% 0.58/0.75  (step t492 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule implies :premises (t491))
% 0.58/0.75  (step t493 (cl (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t492 a1))
% 0.58/0.75  (step t494 (cl (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) :rule resolution :premises (t342 t353 t485 t493))
% 0.58/0.75  (step t495 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t496)
% 0.58/0.75  (assume t496.a0 (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))))
% 0.58/0.75  (step t496.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= K (tptp.and1 (tptp.h1 tptp.f)))))
% 0.58/0.75  (step t496.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule or :premises (t496.t1))
% 0.58/0.75  (step t496.t3 (cl (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t496.t2 t496.a0))
% 0.58/0.75  (step t496 (cl (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t496.a0))
% 0.58/0.75  (step t497 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t495 t496))
% 0.58/0.75  (step t498 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t499 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t497 t498))
% 0.58/0.75  (step t500 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t499))
% 0.58/0.75  (step t501 (cl (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule implies :premises (t500))
% 0.58/0.75  (step t502 (cl (or (not (tptp.and_ok (tptp.and1 (tptp.h1 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t501 a7))
% 0.58/0.75  (step t503 (cl (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) :rule resolution :premises (t219 t241 t340 t494 t502))
% 0.58/0.75  (step t504 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t505)
% 0.58/0.75  (assume t505.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))))
% 0.58/0.75  (step t505.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f)))))) :rule forall_inst :args ((:= P1 (tptp.outs (tptp.h1 tptp.f))) (:= P2 (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))))
% 0.58/0.75  (step t505.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f))))) :rule or :premises (t505.t1))
% 0.58/0.75  (step t505.t3 (cl (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f))))) :rule resolution :premises (t505.t2 t505.a0))
% 0.58/0.75  (step t505 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f))))) :rule subproof :discharge (t505.a0))
% 0.58/0.75  (step t506 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f))))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f))))) :rule resolution :premises (t504 t505))
% 0.58/0.75  (step t507 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f))))) (not (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t508 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f)))))) :rule resolution :premises (t506 t507))
% 0.58/0.75  (step t509 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f)))))) :rule contraction :premises (t508))
% 0.58/0.75  (step t510 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f))))) :rule implies :premises (t509))
% 0.58/0.75  (step t511 (cl (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.one (tptp.outs (tptp.h1 tptp.f))))) :rule resolution :premises (t510 a3))
% 0.58/0.75  (step t512 (cl (tptp.one (tptp.outs (tptp.h1 tptp.f)))) :rule resolution :premises (t195 t217 t503 t511))
% 0.58/0.75  (step t513 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t514)
% 0.58/0.75  (assume t514.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))))
% 0.58/0.75  (step t514.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= P1 (tptp.outs (tptp.h1 tptp.f))) (:= P2 (tptp.in2 (tptp.h2 tptp.f)))))
% 0.58/0.75  (step t514.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f))))) :rule or :premises (t514.t1))
% 0.58/0.75  (step t514.t3 (cl (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f))))) :rule resolution :premises (t514.t2 t514.a0))
% 0.58/0.75  (step t514 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f))))) :rule subproof :discharge (t514.a0))
% 0.58/0.75  (step t515 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f))))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f))))) :rule resolution :premises (t513 t514))
% 0.58/0.75  (step t516 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f))))) (not (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t517 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t515 t516))
% 0.58/0.75  (step t518 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f)))))) :rule contraction :premises (t517))
% 0.58/0.75  (step t519 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f))))) :rule implies :premises (t518))
% 0.58/0.75  (step t520 (cl (or (not (tptp.connection (tptp.outs (tptp.h1 tptp.f)) (tptp.in2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs (tptp.h1 tptp.f)))) (tptp.one (tptp.in2 (tptp.h2 tptp.f))))) :rule resolution :premises (t519 a1))
% 0.58/0.75  (step t521 (cl (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) :rule resolution :premises (t182 t193 t512 t520))
% 0.58/0.75  (step t522 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t523)
% 0.58/0.75  (assume t523.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))))
% 0.58/0.75  (step t523.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= P1 (tptp.in2 (tptp.h2 tptp.f))) (:= P2 (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))))
% 0.58/0.75  (step t523.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule or :premises (t523.t1))
% 0.58/0.75  (step t523.t3 (cl (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t523.t2 t523.a0))
% 0.58/0.75  (step t523 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t523.a0))
% 0.58/0.75  (step t524 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t522 t523))
% 0.58/0.75  (step t525 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) (not (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t526 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))))) :rule resolution :premises (t524 t525))
% 0.58/0.75  (step t527 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))))) :rule contraction :premises (t526))
% 0.58/0.75  (step t528 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule implies :premises (t527))
% 0.58/0.75  (step t529 (cl (or (not (tptp.connection (tptp.in2 (tptp.h2 tptp.f)) (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t528 a1))
% 0.58/0.75  (step t530 (cl (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) :rule resolution :premises (t169 t180 t521 t529))
% 0.58/0.75  (step t531 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t532)
% 0.58/0.75  (assume t532.a0 (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))))
% 0.58/0.75  (step t532.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= K (tptp.and2 (tptp.h2 tptp.f)))))
% 0.58/0.75  (step t532.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule or :premises (t532.t1))
% 0.58/0.75  (step t532.t3 (cl (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t532.t2 t532.a0))
% 0.58/0.75  (step t532 (cl (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t532.a0))
% 0.58/0.75  (step t533 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t531 t532))
% 0.58/0.75  (step t534 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) (not (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t535 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule resolution :premises (t533 t534))
% 0.58/0.75  (step t536 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule contraction :premises (t535))
% 0.58/0.75  (step t537 (cl (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.in1 K))) (not (tptp.one (tptp.in2 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule implies :premises (t536))
% 0.58/0.75  (step t538 (cl (or (not (tptp.and_ok (tptp.and2 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t537 a7))
% 0.58/0.75  (step t539 (cl (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) :rule resolution :premises (t101 t123 t167 t530 t538))
% 0.58/0.75  (step t540 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t541)
% 0.58/0.75  (assume t541.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))))
% 0.58/0.75  (step t541.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= P1 (tptp.outc (tptp.h2 tptp.f))) (:= P2 (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))))
% 0.58/0.75  (step t541.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f))))) :rule or :premises (t541.t1))
% 0.58/0.75  (step t541.t3 (cl (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f))))) :rule resolution :premises (t541.t2 t541.a0))
% 0.58/0.75  (step t541 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f))))) :rule subproof :discharge (t541.a0))
% 0.58/0.75  (step t542 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f))))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f))))) :rule resolution :premises (t540 t541))
% 0.58/0.75  (step t543 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f))))) (not (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t544 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f)))))) :rule resolution :premises (t542 t543))
% 0.58/0.75  (step t545 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f)))))) :rule contraction :premises (t544))
% 0.58/0.75  (step t546 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f))))) :rule implies :premises (t545))
% 0.58/0.75  (step t547 (cl (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.outc (tptp.h2 tptp.f))))) :rule resolution :premises (t546 a3))
% 0.58/0.75  (step t548 (cl (tptp.one (tptp.outc (tptp.h2 tptp.f)))) :rule resolution :premises (t77 t99 t539 t547))
% 0.58/0.75  (step t549 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t550)
% 0.58/0.75  (assume t550.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))))
% 0.58/0.75  (step t550.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f)))))) :rule forall_inst :args ((:= P1 (tptp.outc (tptp.h2 tptp.f))) (:= P2 (tptp.in1 (tptp.or1 tptp.f)))))
% 0.58/0.75  (step t550.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f))))) :rule or :premises (t550.t1))
% 0.58/0.75  (step t550.t3 (cl (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f))))) :rule resolution :premises (t550.t2 t550.a0))
% 0.58/0.75  (step t550 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f))))) :rule subproof :discharge (t550.a0))
% 0.58/0.75  (step t551 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f))))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f))))) :rule resolution :premises (t549 t550))
% 0.58/0.75  (step t552 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f))))) (not (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t553 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f)))))) :rule resolution :premises (t551 t552))
% 0.58/0.75  (step t554 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f)))))) :rule contraction :premises (t553))
% 0.58/0.75  (step t555 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f))))) :rule implies :premises (t554))
% 0.58/0.75  (step t556 (cl (or (not (tptp.connection (tptp.outc (tptp.h2 tptp.f)) (tptp.in1 (tptp.or1 tptp.f)))) (not (tptp.one (tptp.outc (tptp.h2 tptp.f)))) (tptp.one (tptp.in1 (tptp.or1 tptp.f))))) :rule resolution :premises (t555 a1))
% 0.58/0.75  (step t557 (cl (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) :rule resolution :premises (t64 t75 t548 t556))
% 0.58/0.75  (step t558 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f))))) (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.one (tptp.out1 K))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t559)
% 0.58/0.75  (assume t559.a0 (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.one (tptp.out1 K)))))
% 0.58/0.75  (step t559.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f)))))) :rule forall_inst :args ((:= K (tptp.or1 tptp.f))))
% 0.58/0.75  (step t559.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f))))) :rule or :premises (t559.t1))
% 0.58/0.75  (step t559.t3 (cl (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f))))) :rule resolution :premises (t559.t2 t559.a0))
% 0.58/0.75  (step t559 (cl (not (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f))))) :rule subproof :discharge (t559.a0))
% 0.58/0.75  (step t560 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f))))) (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f))))) :rule resolution :premises (t558 t559))
% 0.58/0.75  (step t561 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f))))) (not (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t562 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f))))) (=> (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f)))))) :rule resolution :premises (t560 t561))
% 0.58/0.75  (step t563 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.one (tptp.out1 K)))) (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f)))))) :rule contraction :premises (t562))
% 0.58/0.75  (step t564 (cl (not (forall ((K $$unsorted)) (or (not (tptp.or_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.one (tptp.out1 K))))) (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f))))) :rule implies :premises (t563))
% 0.58/0.75  (step t565 (cl (or (not (tptp.or_ok (tptp.or1 tptp.f))) (not (tptp.one (tptp.in1 (tptp.or1 tptp.f)))) (tptp.one (tptp.out1 (tptp.or1 tptp.f))))) :rule resolution :premises (t564 a13))
% 0.58/0.75  (step t566 (cl (not (tptp.or_ok (tptp.or1 tptp.f)))) :rule resolution :premises (t29 t62 t557 t565))
% 0.58/0.75  (step t567 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K))) (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f)))) (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t568)
% 0.58/0.75  (assume t568.a0 (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K))))
% 0.58/0.75  (step t568.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f))))) :rule forall_inst :args ((:= K (tptp.or1 tptp.f))))
% 0.58/0.75  (step t568.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f)))) :rule or :premises (t568.t1))
% 0.58/0.75  (step t568.t3 (cl (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f)))) :rule resolution :premises (t568.t2 t568.a0))
% 0.58/0.75  (step t568 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f)))) :rule subproof :discharge (t568.a0))
% 0.58/0.75  (step t569 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K))) (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f)))) (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f)))) :rule resolution :premises (t567 t568))
% 0.58/0.75  (step t570 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K))) (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f)))) (not (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f))))) :rule implies_neg2)
% 0.58/0.75  (step t571 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K))) (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f)))) (=> (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K))) (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f))))) :rule resolution :premises (t569 t570))
% 0.58/0.75  (step t572 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K))) (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f))))) :rule contraction :premises (t571))
% 0.58/0.75  (step t573 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_or K)) (tptp.or_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f)))) :rule implies :premises (t572))
% 0.58/0.75  (step t574 (cl (or (not (tptp.logic_or (tptp.or1 tptp.f))) (tptp.or_ok (tptp.or1 tptp.f)) (tptp.abnormal (tptp.or1 tptp.f)))) :rule resolution :premises (t573 a20))
% 0.58/0.75  (step t575 (cl (tptp.abnormal (tptp.or1 tptp.f))) :rule resolution :premises (t16 t27 t566 t574))
% 0.58/0.75  (step t576 (cl (not (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f))))) :rule resolution :premises (t14 t575))
% 0.58/0.75  (step t577 (cl (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t578 (cl (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f))) (not (tptp.halfadder (tptp.h2 tptp.f))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))))) :rule reordering :premises (t577))
% 0.58/0.75  (step t579 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t580)
% 0.58/0.75  (assume t580.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X)))))
% 0.58/0.75  (step t580.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 0.58/0.75  (step t580.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f))))) :rule or :premises (t580.t1))
% 0.58/0.75  (step t580.t3 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f))))) :rule resolution :premises (t580.t2 t580.a0))
% 0.58/0.75  (step t580 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f))))) :rule subproof :discharge (t580.a0))
% 0.58/0.75  (step t581 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f))))) :rule resolution :premises (t579 t580))
% 0.58/0.75  (step t582 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f))))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t583 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t581 t582))
% 0.58/0.75  (step t584 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))))) :rule contraction :premises (t583))
% 0.58/0.75  (step t585 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_not (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f))))) :rule implies :premises (t584))
% 0.58/0.75  (step t586 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f))))) :rule resolution :premises (t585 a29))
% 0.58/0.75  (step t587 (cl (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) :rule resolution :premises (t578 t90 t586))
% 0.58/0.75  (step t588 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K))) (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f))))) (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t589)
% 0.58/0.75  (assume t589.a0 (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K))))
% 0.58/0.75  (step t589.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= K (tptp.not1 (tptp.h2 tptp.f)))))
% 0.58/0.75  (step t589.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f))))) :rule or :premises (t589.t1))
% 0.58/0.75  (step t589.t3 (cl (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f))))) :rule resolution :premises (t589.t2 t589.a0))
% 0.58/0.75  (step t589 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f))))) :rule subproof :discharge (t589.a0))
% 0.58/0.75  (step t590 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K))) (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f))))) (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f))))) :rule resolution :premises (t588 t589))
% 0.58/0.75  (step t591 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K))) (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f))))) (not (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t592 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K))) (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f))))) (=> (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K))) (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t590 t591))
% 0.58/0.75  (step t593 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K))) (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f)))))) :rule contraction :premises (t592))
% 0.58/0.75  (step t594 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_not K)) (tptp.not_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f))))) :rule implies :premises (t593))
% 0.58/0.75  (step t595 (cl (or (not (tptp.logic_not (tptp.not1 (tptp.h2 tptp.f)))) (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.not1 (tptp.h2 tptp.f))))) :rule resolution :premises (t594 a26))
% 0.58/0.75  (step t596 (cl (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) :rule resolution :premises (t13 t576 t587 t595))
% 0.58/0.75  (step t597 (cl (not (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t598 (cl (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))) (not (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule reordering :premises (t597))
% 0.58/0.75  (step t599 (cl (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t600 (cl (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule reordering :premises (t599))
% 0.58/0.75  (step t601 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t602)
% 0.58/0.75  (assume t602.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X))))))
% 0.58/0.75  (step t602.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 0.58/0.75  (step t602.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule or :premises (t602.t1))
% 0.58/0.75  (step t602.t3 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t602.t2 t602.a0))
% 0.58/0.75  (step t602 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t602.a0))
% 0.58/0.75  (step t603 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t601 t602))
% 0.58/0.75  (step t604 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t605 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule resolution :premises (t603 t604))
% 0.58/0.75  (step t606 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule contraction :premises (t605))
% 0.58/0.75  (step t607 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.and2 X)) (tptp.in1 (tptp.not1 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule implies :premises (t606))
% 0.58/0.75  (step t608 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t607 a38))
% 0.58/0.75  (step t609 (cl (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) :rule resolution :premises (t600 t90 t608))
% 0.58/0.75  (step t610 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t611)
% 0.58/0.75  (assume t611.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))))
% 0.58/0.75  (step t611.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= P1 (tptp.out1 (tptp.and2 (tptp.h2 tptp.f)))) (:= P2 (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))))
% 0.58/0.75  (step t611.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule or :premises (t611.t1))
% 0.58/0.75  (step t611.t3 (cl (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t611.t2 t611.a0))
% 0.58/0.75  (step t611 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t611.a0))
% 0.58/0.75  (step t612 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t610 t611))
% 0.58/0.75  (step t613 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) (not (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t614 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule resolution :premises (t612 t613))
% 0.58/0.75  (step t615 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule contraction :premises (t614))
% 0.58/0.75  (step t616 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule implies :premises (t615))
% 0.58/0.75  (step t617 (cl (or (not (tptp.connection (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t616 a1))
% 0.58/0.75  (step t618 (cl (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) :rule resolution :premises (t598 t609 t539 t617))
% 0.58/0.75  (step t619 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.zero (tptp.out1 K)))) (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.zero (tptp.out1 K))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t620)
% 0.58/0.75  (assume t620.a0 (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.zero (tptp.out1 K)))))
% 0.58/0.75  (step t620.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.zero (tptp.out1 K))))) (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= K (tptp.not1 (tptp.h2 tptp.f)))))
% 0.58/0.75  (step t620.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.zero (tptp.out1 K))))) (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule or :premises (t620.t1))
% 0.58/0.75  (step t620.t3 (cl (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t620.t2 t620.a0))
% 0.58/0.75  (step t620 (cl (not (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.zero (tptp.out1 K))))) (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t620.a0))
% 0.58/0.75  (step t621 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.zero (tptp.out1 K)))) (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t619 t620))
% 0.58/0.75  (step t622 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.zero (tptp.out1 K)))) (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) (not (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t623 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.zero (tptp.out1 K)))) (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) (=> (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.zero (tptp.out1 K)))) (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule resolution :premises (t621 t622))
% 0.58/0.75  (step t624 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.zero (tptp.out1 K)))) (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule contraction :premises (t623))
% 0.58/0.75  (step t625 (cl (not (forall ((K $$unsorted)) (or (not (tptp.not_ok K)) (not (tptp.one (tptp.in1 K))) (tptp.zero (tptp.out1 K))))) (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule implies :premises (t624))
% 0.58/0.75  (step t626 (cl (or (not (tptp.not_ok (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in1 (tptp.not1 (tptp.h2 tptp.f))))) (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t625 a22))
% 0.58/0.75  (step t627 (cl (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) :rule resolution :premises (t11 t596 t618 t626))
% 0.58/0.75  (step t628 (cl (not (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t629 (cl (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule reordering :premises (t628))
% 0.58/0.75  (step t630 (cl (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t631 (cl (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))))) :rule reordering :premises (t630))
% 0.58/0.75  (step t632 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t633)
% 0.58/0.75  (assume t633.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X))))))
% 0.58/0.75  (step t633.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 0.58/0.75  (step t633.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule or :premises (t633.t1))
% 0.58/0.75  (step t633.t3 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t633.t2 t633.a0))
% 0.58/0.75  (step t633 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t633.a0))
% 0.58/0.75  (step t634 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t632 t633))
% 0.58/0.75  (step t635 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t636 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))))) :rule resolution :premises (t634 t635))
% 0.58/0.75  (step t637 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))))) :rule contraction :premises (t636))
% 0.58/0.75  (step t638 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.out1 (tptp.not1 X)) (tptp.in2 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule implies :premises (t637))
% 0.58/0.75  (step t639 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t638 a39))
% 0.58/0.75  (step t640 (cl (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) :rule resolution :premises (t631 t90 t639))
% 0.58/0.75  (step t641 (cl (not (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t642 (cl (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))))) :rule reordering :premises (t641))
% 0.58/0.75  (step t643 (cl (not (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t644 (cl (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f))) (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (not (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f)))))) :rule reordering :premises (t643))
% 0.58/0.75  (step t645 (cl (not (tptp.abnormal (tptp.or1 tptp.f))) (not (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f))))) :rule or :premises (a59))
% 0.58/0.75  (step t646 (cl (not (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f))))) :rule resolution :premises (t645 t575))
% 0.58/0.75  (step t647 (cl (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t648 (cl (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f))) (not (tptp.halfadder (tptp.h2 tptp.f))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))))) :rule reordering :premises (t647))
% 0.58/0.75  (step t649 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t650)
% 0.58/0.75  (assume t650.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X)))))
% 0.58/0.75  (step t650.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 0.58/0.75  (step t650.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f))))) :rule or :premises (t650.t1))
% 0.58/0.75  (step t650.t3 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f))))) :rule resolution :premises (t650.t2 t650.a0))
% 0.58/0.75  (step t650 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f))))) :rule subproof :discharge (t650.a0))
% 0.58/0.75  (step t651 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f))))) :rule resolution :premises (t649 t650))
% 0.58/0.75  (step t652 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f))))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t653 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t651 t652))
% 0.58/0.75  (step t654 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X)))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))))) :rule contraction :premises (t653))
% 0.58/0.75  (step t655 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.logic_and (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f))))) :rule implies :premises (t654))
% 0.58/0.75  (step t656 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f))))) :rule resolution :premises (t655 a27))
% 0.58/0.75  (step t657 (cl (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) :rule resolution :premises (t648 t90 t656))
% 0.58/0.75  (step t658 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f))))) (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t659)
% 0.58/0.75  (assume t659.a0 (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))))
% 0.58/0.75  (step t659.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= K (tptp.and1 (tptp.h2 tptp.f)))))
% 0.58/0.75  (step t659.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f))))) :rule or :premises (t659.t1))
% 0.58/0.75  (step t659.t3 (cl (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f))))) :rule resolution :premises (t659.t2 t659.a0))
% 0.58/0.75  (step t659 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f))))) :rule subproof :discharge (t659.a0))
% 0.58/0.75  (step t660 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f))))) (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f))))) :rule resolution :premises (t658 t659))
% 0.58/0.75  (step t661 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f))))) (not (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t662 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f))))) (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t660 t661))
% 0.58/0.75  (step t663 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K))) (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f)))))) :rule contraction :premises (t662))
% 0.58/0.75  (step t664 (cl (not (forall ((K $$unsorted)) (or (not (tptp.logic_and K)) (tptp.and_ok K) (tptp.abnormal K)))) (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f))))) :rule implies :premises (t663))
% 0.58/0.75  (step t665 (cl (or (not (tptp.logic_and (tptp.and1 (tptp.h2 tptp.f)))) (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f))) (tptp.abnormal (tptp.and1 (tptp.h2 tptp.f))))) :rule resolution :premises (t664 a12))
% 0.58/0.75  (step t666 (cl (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) :rule resolution :premises (t644 t646 t657 t665))
% 0.58/0.75  (step t667 (cl (not (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t668 (cl (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))) (not (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))))) :rule reordering :premises (t667))
% 0.58/0.75  (step t669 (cl (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) :rule or_pos)
% 0.58/0.75  (step t670 (cl (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))))) :rule reordering :premises (t669))
% 0.58/0.75  (step t671 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t672)
% 0.58/0.75  (assume t672.a0 (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X))))))
% 0.58/0.75  (step t672.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 0.58/0.75  (step t672.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule or :premises (t672.t1))
% 0.58/0.75  (step t672.t3 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t672.t2 t672.a0))
% 0.58/0.75  (step t672 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t672.a0))
% 0.58/0.75  (step t673 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t671 t672))
% 0.58/0.75  (step t674 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) (not (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t675 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))))) :rule resolution :premises (t673 t674))
% 0.58/0.75  (step t676 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))))) :rule contraction :premises (t675))
% 0.58/0.75  (step t677 (cl (not (forall ((X $$unsorted)) (or (not (tptp.halfadder X)) (tptp.connection (tptp.outs X) (tptp.out1 (tptp.and1 X)))))) (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule implies :premises (t676))
% 0.58/0.75  (step t678 (cl (or (not (tptp.halfadder (tptp.h2 tptp.f))) (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t677 a35))
% 0.58/0.75  (step t679 (cl (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) :rule resolution :premises (t670 t90 t678))
% 0.58/0.75  (step t680 (cl (not (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f))))) (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t681 (cl (not (tptp.one (tptp.outs tptp.f))) (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.outs (tptp.h2 tptp.f))) (not (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f)))))) :rule reordering :premises (t680))
% 0.58/0.75  (step t682 (cl (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f))))) (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) :rule or_pos)
% 0.58/0.75  (step t683 (cl (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f))) (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))))) :rule reordering :premises (t682))
% 0.58/0.75  (step t684 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs X) (tptp.outs (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs X) (tptp.outs (tptp.h2 X)))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t685)
% 0.58/0.75  (assume t685.a0 (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs X) (tptp.outs (tptp.h2 X))))))
% 0.58/0.75  (step t685.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs X) (tptp.outs (tptp.h2 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= X tptp.f)))
% 0.58/0.75  (step t685.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs X) (tptp.outs (tptp.h2 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f))))) :rule or :premises (t685.t1))
% 0.58/0.75  (step t685.t3 (cl (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f))))) :rule resolution :premises (t685.t2 t685.a0))
% 0.58/0.75  (step t685 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs X) (tptp.outs (tptp.h2 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f))))) :rule subproof :discharge (t685.a0))
% 0.58/0.75  (step t686 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs X) (tptp.outs (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f))))) :rule resolution :premises (t684 t685))
% 0.58/0.75  (step t687 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs X) (tptp.outs (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f))))) (not (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t688 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs X) (tptp.outs (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs X) (tptp.outs (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))))) :rule resolution :premises (t686 t687))
% 0.58/0.75  (step t689 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs X) (tptp.outs (tptp.h2 X))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))))) :rule contraction :premises (t688))
% 0.58/0.75  (step t690 (cl (not (forall ((X $$unsorted)) (or (not (tptp.fulladder X)) (tptp.connection (tptp.outs X) (tptp.outs (tptp.h2 X)))))) (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f))))) :rule implies :premises (t689))
% 0.58/0.75  (step t691 (cl (or (not (tptp.fulladder tptp.f)) (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f))))) :rule resolution :premises (t690 a49))
% 0.58/0.75  (step t692 (cl (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) :rule resolution :premises (t683 a51 t691))
% 0.58/0.75  (step t693 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t694)
% 0.58/0.75  (assume t694.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))))
% 0.58/0.75  (step t694.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= P1 (tptp.outs tptp.f)) (:= P2 (tptp.outs (tptp.h2 tptp.f)))))
% 0.58/0.75  (step t694.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f))))) :rule or :premises (t694.t1))
% 0.58/0.75  (step t694.t3 (cl (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f))))) :rule resolution :premises (t694.t2 t694.a0))
% 0.58/0.75  (step t694 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f))))) :rule subproof :discharge (t694.a0))
% 0.58/0.75  (step t695 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f))))) (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f))))) :rule resolution :premises (t693 t694))
% 0.58/0.75  (step t696 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f))))) (not (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 0.58/0.75  (step t697 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f)))))) :rule resolution :premises (t695 t696))
% 0.58/0.75  (step t698 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f)))))) :rule contraction :premises (t697))
% 0.58/0.75  (step t699 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f))))) :rule implies :premises (t698))
% 0.58/0.75  (step t700 (cl (or (not (tptp.connection (tptp.outs tptp.f) (tptp.outs (tptp.h2 tptp.f)))) (not (tptp.one (tptp.outs tptp.f))) (tptp.one (tptp.outs (tptp.h2 tptp.f))))) :rule resolution :premises (t699 a1))
% 0.58/0.75  (step t701 (cl (tptp.one (tptp.outs (tptp.h2 tptp.f)))) :rule resolution :premises (t681 a55 t692 t700))
% 0.58/0.75  (step t702 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t703)
% 0.58/0.75  (assume t703.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))))
% 0.58/0.75  (step t703.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= P1 (tptp.outs (tptp.h2 tptp.f))) (:= P2 (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))))
% 0.58/0.75  (step t703.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule or :premises (t703.t1))
% 0.58/0.75  (step t703.t3 (cl (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t703.t2 t703.a0))
% 0.58/0.75  (step t703 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t703.a0))
% 0.58/0.75  (step t704 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t702 t703))
% 0.58/0.75  (step t705 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) (not (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t706 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))))) :rule resolution :premises (t704 t705))
% 0.58/0.75  (step t707 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2))) (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))))) :rule contraction :premises (t706))
% 0.58/0.75  (step t708 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P1)) (tptp.one P2)))) (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule implies :premises (t707))
% 0.58/0.75  (step t709 (cl (or (not (tptp.connection (tptp.outs (tptp.h2 tptp.f)) (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.outs (tptp.h2 tptp.f)))) (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t708 a1))
% 0.58/0.75  (step t710 (cl (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) :rule resolution :premises (t668 t679 t701 t709))
% 0.58/0.75  (step t711 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.one (tptp.in2 K)))) (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.one (tptp.in2 K))))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t712)
% 0.58/0.75  (assume t712.a0 (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.one (tptp.in2 K)))))
% 0.58/0.75  (step t712.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.one (tptp.in2 K))))) (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= K (tptp.and1 (tptp.h2 tptp.f)))))
% 0.58/0.75  (step t712.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.one (tptp.in2 K))))) (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule or :premises (t712.t1))
% 0.58/0.75  (step t712.t3 (cl (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t712.t2 t712.a0))
% 0.58/0.75  (step t712 (cl (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.one (tptp.in2 K))))) (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t712.a0))
% 0.58/0.75  (step t713 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.one (tptp.in2 K)))) (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t711 t712))
% 0.58/0.75  (step t714 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.one (tptp.in2 K)))) (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) (not (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t715 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.one (tptp.in2 K)))) (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.one (tptp.in2 K)))) (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))))) :rule resolution :premises (t713 t714))
% 0.58/0.75  (step t716 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.one (tptp.in2 K)))) (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))))) :rule contraction :premises (t715))
% 0.58/0.75  (step t717 (cl (not (forall ((K $$unsorted)) (or (not (tptp.and_ok K)) (not (tptp.one (tptp.out1 K))) (tptp.one (tptp.in2 K))))) (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule implies :premises (t716))
% 0.58/0.75  (step t718 (cl (or (not (tptp.and_ok (tptp.and1 (tptp.h2 tptp.f)))) (not (tptp.one (tptp.out1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t717 a10))
% 0.58/0.75  (step t719 (cl (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) :rule resolution :premises (t642 t666 t710 t718))
% 0.58/0.75  (step t720 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) :rule implies_neg1)
% 0.58/0.75  (anchor :step t721)
% 0.58/0.75  (assume t721.a0 (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))))
% 0.58/0.75  (step t721.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= P1 (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))) (:= P2 (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))))
% 0.58/0.75  (step t721.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule or :premises (t721.t1))
% 0.58/0.75  (step t721.t3 (cl (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t721.t2 t721.a0))
% 0.58/0.75  (step t721 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t721.a0))
% 0.58/0.75  (step t722 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t720 t721))
% 0.58/0.75  (step t723 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) (not (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 0.58/0.75  (step t724 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule resolution :premises (t722 t723))
% 0.58/0.75  (step t725 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule contraction :premises (t724))
% 0.58/0.75  (step t726 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.one P2)) (tptp.one P1)))) (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule implies :premises (t725))
% 0.58/0.75  (step t727 (cl (or (not (tptp.connection (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.in2 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t726 a3))
% 0.58/0.75  (step t728 (cl (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) :rule resolution :premises (t629 t640 t719 t727))
% 0.58/0.75  (step t729 (cl (not (or (not (tptp.zero (tptp.out1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.one (tptp.out1 (tptp.not1 (tptp.h2 tptp.f)))))))) :rule resolution :premises (t9 t627 t728))
% 0.58/0.75  (step t730 (cl) :rule resolution :premises (t7 t729 a4))
% 0.58/0.75  
% 0.58/0.75  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.hj7QPfYquG/cvc5---1.0.5_16421.smt2
% 0.58/0.75  % cvc5---1.0.5 exiting
% 0.58/0.75  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------