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

% Computer : n025.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 3.78s 3.99s
% Output   : Proof 3.89s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem    : HWV006-1 : TPTP v8.2.0. Released v2.1.0.
% 0.13/0.15  % Command    : do_cvc5 %s %d
% 0.16/0.37  % Computer : n025.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 300
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Mon May 27 03:11:24 EDT 2024
% 0.16/0.37  % CPUTime    : 
% 0.23/0.51  %----Proving TF0_NAR, FOF, or CNF
% 0.23/0.52  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 3.78/3.99  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.4gWheEOKKC/cvc5---1.0.5_28447.smt2
% 3.78/3.99  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.4gWheEOKKC/cvc5---1.0.5_28447.smt2
% 3.89/4.10  (assume a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 3.89/4.10  (assume a1 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))))
% 3.89/4.10  (assume a2 (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))))
% 3.89/4.10  (assume a3 (not (tptp.equal_value tptp.n0 tptp.n1)))
% 3.89/4.10  (assume a4 (not (tptp.equal_value tptp.n1 tptp.n0)))
% 3.89/4.10  (assume a5 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.mode K tptp.abnormal)))))
% 3.89/4.10  (assume a6 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))))
% 3.89/4.10  (assume a7 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in Any K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n0))))
% 3.89/4.10  (assume a8 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))))
% 3.89/4.10  (assume a9 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0) (tptp.value (tptp.in tptp.n2 K) tptp.n0))))
% 3.89/4.10  (assume a10 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n1 K) tptp.n1))))
% 3.89/4.10  (assume a11 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n2 K) tptp.n1))))
% 3.89/4.10  (assume a12 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.in Any K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))))
% 3.89/4.10  (assume a13 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n0))))
% 3.89/4.10  (assume a14 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n1 K) tptp.n1) (tptp.value (tptp.in tptp.n2 K) tptp.n1))))
% 3.89/4.10  (assume a15 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))))
% 3.89/4.10  (assume a16 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n2 K) tptp.n0))))
% 3.89/4.10  (assume a17 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))))
% 3.89/4.10  (assume a18 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n0))))
% 3.89/4.10  (assume a19 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n1))))
% 3.89/4.10  (assume a20 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))))
% 3.89/4.10  (assume a21 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))))
% 3.89/4.10  (assume a22 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))))
% 3.89/4.10  (assume a23 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))))
% 3.89/4.10  (assume a24 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))))
% 3.89/4.10  (assume a25 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.or1 X))))))
% 3.89/4.10  (assume a26 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.or1 X))))))
% 3.89/4.10  (assume a27 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X))))))
% 3.89/4.10  (assume a28 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.and2 X))))))
% 3.89/4.10  (assume a29 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X))))))
% 3.89/4.10  (assume a30 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.and2 X))))))
% 3.89/4.10  (assume a31 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 X)) (tptp.in tptp.n1 (tptp.and1 X))))))
% 3.89/4.10  (assume a32 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X))))))
% 3.89/4.10  (assume a33 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X))))))
% 3.89/4.10  (assume a34 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h1 X) tptp.halfadder))))
% 3.89/4.10  (assume a35 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h2 X) tptp.halfadder))))
% 3.89/4.10  (assume a36 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.or1 X) tptp.or))))
% 3.89/4.10  (assume a37 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 X)) (tptp.in tptp.n2 (tptp.h2 X))))))
% 3.89/4.10  (assume a38 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h1 X)) (tptp.in tptp.n2 (tptp.or1 X))))))
% 3.89/4.10  (assume a39 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 X)) (tptp.in tptp.n1 (tptp.or1 X))))))
% 3.89/4.10  (assume a40 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.h2 X))))))
% 3.89/4.10  (assume a41 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n1 (tptp.h1 X))))))
% 3.89/4.10  (assume a42 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.c X) (tptp.in tptp.n2 (tptp.h1 X))))))
% 3.89/4.10  (assume a43 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.s (tptp.h2 X))))))
% 3.89/4.10  (assume a44 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.or1 X))))))
% 3.89/4.10  (assume a45 (tptp.type tptp.f tptp.fulladder))
% 3.89/4.10  (assume a46 (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1))
% 3.89/4.10  (assume a47 (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0))
% 3.89/4.11  (assume a48 (tptp.value (tptp.in tptp.c tptp.f) tptp.n1))
% 3.89/4.11  (assume a49 (tptp.value (tptp.out tptp.s tptp.f) tptp.n1))
% 3.89/4.11  (assume a50 (tptp.value (tptp.out tptp.c tptp.f) tptp.n0))
% 3.89/4.11  (assume a51 (or (not (tptp.mode (tptp.or1 tptp.f) tptp.abnormal)) (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal))))
% 3.89/4.11  (assume a52 (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal)))
% 3.89/4.11  (assume a53 (or (not (tptp.mode (tptp.or1 tptp.f) tptp.abnormal)) (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal))))
% 3.89/4.11  (assume a54 (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal)))
% 3.89/4.11  (assume a55 (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal)))
% 3.89/4.11  (assume a56 (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal)))
% 3.89/4.11  (assume a57 (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal)))
% 3.89/4.11  (step t1 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t2)
% 3.89/4.11  (assume t2.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))))
% 3.89/4.11  (step t2.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))) (:= P2 (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f)))) (:= V tptp.n0)))
% 3.89/4.11  (step t2.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule or :premises (t2.t1))
% 3.89/4.11  (step t2.t3 (cl (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule resolution :premises (t2.t2 t2.a0))
% 3.89/4.11  (step t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule subproof :discharge (t2.a0))
% 3.89/4.11  (step t3 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule resolution :premises (t1 t2))
% 3.89/4.11  (step t4 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule implies_neg2)
% 3.89/4.11  (step t5 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule resolution :premises (t3 t4))
% 3.89/4.11  (step t6 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule contraction :premises (t5))
% 3.89/4.11  (step t7 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule implies :premises (t6))
% 3.89/4.11  (step t8 (cl (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) :rule or_pos)
% 3.89/4.11  (step t9 (cl (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule reordering :premises (t8))
% 3.89/4.11  (step t10 (cl (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f)))))) (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) :rule or_pos)
% 3.89/4.11  (step t11 (cl (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f)))) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule reordering :premises (t10))
% 3.89/4.11  (step t12 (cl (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder))) (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) :rule or_pos)
% 3.89/4.11  (step t13 (cl (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder)))) :rule reordering :premises (t12))
% 3.89/4.11  (step t14 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h2 X) tptp.halfadder))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h2 X) tptp.halfadder)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t15)
% 3.89/4.11  (assume t15.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h2 X) tptp.halfadder))))
% 3.89/4.11  (step t15.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h2 X) tptp.halfadder)))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder)))) :rule forall_inst :args ((:= X tptp.f)))
% 3.89/4.11  (step t15.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h2 X) tptp.halfadder)))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder))) :rule or :premises (t15.t1))
% 3.89/4.11  (step t15.t3 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder))) :rule resolution :premises (t15.t2 t15.a0))
% 3.89/4.11  (step t15 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h2 X) tptp.halfadder)))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder))) :rule subproof :discharge (t15.a0))
% 3.89/4.11  (step t16 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h2 X) tptp.halfadder))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder))) :rule resolution :premises (t14 t15))
% 3.89/4.11  (step t17 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h2 X) tptp.halfadder))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder)))) :rule implies_neg2)
% 3.89/4.11  (step t18 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h2 X) tptp.halfadder))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h2 X) tptp.halfadder))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder)))) :rule resolution :premises (t16 t17))
% 3.89/4.11  (step t19 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h2 X) tptp.halfadder))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder)))) :rule contraction :premises (t18))
% 3.89/4.11  (step t20 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h2 X) tptp.halfadder)))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder))) :rule implies :premises (t19))
% 3.89/4.11  (step t21 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h2 tptp.f) tptp.halfadder))) :rule resolution :premises (t20 a35))
% 3.89/4.11  (step t22 (cl (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) :rule resolution :premises (t13 a45 t21))
% 3.89/4.11  (step t23 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t24)
% 3.89/4.11  (assume t24.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X))))))
% 3.89/4.11  (step t24.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 3.89/4.11  (step t24.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule or :premises (t24.t1))
% 3.89/4.11  (step t24.t3 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t24.t2 t24.a0))
% 3.89/4.11  (step t24 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t24.a0))
% 3.89/4.11  (step t25 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t23 t24))
% 3.89/4.11  (step t26 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f)))))) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 3.89/4.11  (step t27 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule resolution :premises (t25 t26))
% 3.89/4.11  (step t28 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))))) :rule contraction :premises (t27))
% 3.89/4.11  (step t29 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule implies :premises (t28))
% 3.89/4.11  (step t30 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t29 a32))
% 3.89/4.11  (step t31 (cl (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) :rule resolution :premises (t11 t22 t30))
% 3.89/4.11  (step t32 (cl (not (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0))) (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) :rule or_pos)
% 3.89/4.11  (step t33 (cl (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (not (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)))) :rule reordering :premises (t32))
% 3.89/4.11  (step t34 (cl (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not))) (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) :rule or_pos)
% 3.89/4.11  (step t35 (cl (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)))) :rule reordering :premises (t34))
% 3.89/4.11  (step t36 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t37)
% 3.89/4.11  (assume t37.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))))
% 3.89/4.11  (step t37.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not)))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 3.89/4.11  (step t37.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not)))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not))) :rule or :premises (t37.t1))
% 3.89/4.11  (step t37.t3 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not))) :rule resolution :premises (t37.t2 t37.a0))
% 3.89/4.11  (step t37 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not)))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not))) :rule subproof :discharge (t37.a0))
% 3.89/4.11  (step t38 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not))) :rule resolution :premises (t36 t37))
% 3.89/4.11  (step t39 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not))) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)))) :rule implies_neg2)
% 3.89/4.11  (step t40 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)))) :rule resolution :premises (t38 t39))
% 3.89/4.11  (step t41 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)))) :rule contraction :premises (t40))
% 3.89/4.11  (step t42 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not)))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not))) :rule implies :premises (t41))
% 3.89/4.11  (step t43 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not))) :rule resolution :premises (t42 a23))
% 3.89/4.11  (step t44 (cl (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) :rule resolution :premises (t35 t22 t43))
% 3.89/4.11  (step t45 (cl (not (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal))) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal)) :rule or_pos)
% 3.89/4.11  (step t46 (cl (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (not (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal)))) :rule reordering :premises (t45))
% 3.89/4.11  (step t47 (cl (not (tptp.mode (tptp.or1 tptp.f) tptp.abnormal)) (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule or :premises (a51))
% 3.89/4.11  (step t48 (cl (not (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal))) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal)) :rule or_pos)
% 3.89/4.11  (step t49 (cl (tptp.mode (tptp.or1 tptp.f) tptp.abnormal) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (not (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal)))) :rule reordering :premises (t48))
% 3.89/4.11  (step t50 (cl (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or))) (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or)) :rule or_pos)
% 3.89/4.11  (step t51 (cl (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or)))) :rule reordering :premises (t50))
% 3.89/4.11  (step t52 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.or1 X) tptp.or)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t53)
% 3.89/4.11  (assume t53.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.or1 X) tptp.or))))
% 3.89/4.11  (step t53.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.or1 X) tptp.or)))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or)))) :rule forall_inst :args ((:= X tptp.f)))
% 3.89/4.11  (step t53.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.or1 X) tptp.or)))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or))) :rule or :premises (t53.t1))
% 3.89/4.11  (step t53.t3 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or))) :rule resolution :premises (t53.t2 t53.a0))
% 3.89/4.11  (step t53 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.or1 X) tptp.or)))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or))) :rule subproof :discharge (t53.a0))
% 3.89/4.11  (step t54 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or))) :rule resolution :premises (t52 t53))
% 3.89/4.11  (step t55 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or)))) :rule implies_neg2)
% 3.89/4.11  (step t56 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or)))) :rule resolution :premises (t54 t55))
% 3.89/4.11  (step t57 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or)))) :rule contraction :premises (t56))
% 3.89/4.11  (step t58 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.or1 X) tptp.or)))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or))) :rule implies :premises (t57))
% 3.89/4.11  (step t59 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.or1 tptp.f) tptp.or))) :rule resolution :premises (t58 a36))
% 3.89/4.11  (step t60 (cl (tptp.type (tptp.or1 tptp.f) tptp.or)) :rule resolution :premises (t51 a45 t59))
% 3.89/4.11  (step t61 (cl (not (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) :rule or_pos)
% 3.89/4.11  (step t62 (cl (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (not (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)))) :rule reordering :premises (t61))
% 3.89/4.11  (step t63 (cl (not (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0))) (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) :rule or_pos)
% 3.89/4.11  (step t64 (cl (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0) (not (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)))) :rule reordering :premises (t63))
% 3.89/4.11  (step t65 (cl (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f))))) (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) :rule or_pos)
% 3.89/4.11  (step t66 (cl (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))))) :rule reordering :premises (t65))
% 3.89/4.11  (step t67 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 X)) (tptp.in tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 X)) (tptp.in tptp.n1 (tptp.or1 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t68)
% 3.89/4.11  (assume t68.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 X)) (tptp.in tptp.n1 (tptp.or1 X))))))
% 3.89/4.11  (step t68.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 X)) (tptp.in tptp.n1 (tptp.or1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))))) :rule forall_inst :args ((:= X tptp.f)))
% 3.89/4.11  (step t68.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 X)) (tptp.in tptp.n1 (tptp.or1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f))))) :rule or :premises (t68.t1))
% 3.89/4.11  (step t68.t3 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f))))) :rule resolution :premises (t68.t2 t68.a0))
% 3.89/4.11  (step t68 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 X)) (tptp.in tptp.n1 (tptp.or1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f))))) :rule subproof :discharge (t68.a0))
% 3.89/4.11  (step t69 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 X)) (tptp.in tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f))))) :rule resolution :premises (t67 t68))
% 3.89/4.11  (step t70 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 X)) (tptp.in tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f))))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))))) :rule implies_neg2)
% 3.89/4.11  (step t71 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 X)) (tptp.in tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 X)) (tptp.in tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))))) :rule resolution :premises (t69 t70))
% 3.89/4.11  (step t72 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 X)) (tptp.in tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))))) :rule contraction :premises (t71))
% 3.89/4.11  (step t73 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 X)) (tptp.in tptp.n1 (tptp.or1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f))))) :rule implies :premises (t72))
% 3.89/4.11  (step t74 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f))))) :rule resolution :premises (t73 a39))
% 3.89/4.11  (step t75 (cl (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) :rule resolution :premises (t66 a45 t74))
% 3.89/4.11  (step t76 (cl (not (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) :rule or_pos)
% 3.89/4.11  (step t77 (cl (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (not (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule reordering :premises (t76))
% 3.89/4.11  (step t78 (cl (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) :rule or_pos)
% 3.89/4.11  (step t79 (cl (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule reordering :premises (t78))
% 3.89/4.11  (step t80 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.and2 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t81)
% 3.89/4.11  (assume t81.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.and2 X))))))
% 3.89/4.11  (step t81.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 3.89/4.11  (step t81.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule or :premises (t81.t1))
% 3.89/4.11  (step t81.t3 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t81.t2 t81.a0))
% 3.89/4.11  (step t81 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t81.a0))
% 3.89/4.11  (step t82 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t80 t81))
% 3.89/4.11  (step t83 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 3.89/4.11  (step t84 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule resolution :premises (t82 t83))
% 3.89/4.11  (step t85 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule contraction :premises (t84))
% 3.89/4.11  (step t86 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule implies :premises (t85))
% 3.89/4.11  (step t87 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t86 a30))
% 3.89/4.11  (step t88 (cl (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) :rule resolution :premises (t79 t22 t87))
% 3.89/4.11  (step t89 (cl (not (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) :rule or_pos)
% 3.89/4.11  (step t90 (cl (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule reordering :premises (t89))
% 3.89/4.11  (step t91 (cl (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and))) (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) :rule or_pos)
% 3.89/4.11  (step t92 (cl (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)))) :rule reordering :premises (t91))
% 3.89/4.11  (step t93 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t94)
% 3.89/4.11  (assume t94.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))))
% 3.89/4.11  (step t94.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and)))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 3.89/4.11  (step t94.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and)))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and))) :rule or :premises (t94.t1))
% 3.89/4.11  (step t94.t3 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and))) :rule resolution :premises (t94.t2 t94.a0))
% 3.89/4.11  (step t94 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and)))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and))) :rule subproof :discharge (t94.a0))
% 3.89/4.11  (step t95 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and))) :rule resolution :premises (t93 t94))
% 3.89/4.11  (step t96 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and))) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)))) :rule implies_neg2)
% 3.89/4.11  (step t97 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)))) :rule resolution :premises (t95 t96))
% 3.89/4.11  (step t98 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)))) :rule contraction :premises (t97))
% 3.89/4.11  (step t99 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and)))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and))) :rule implies :premises (t98))
% 3.89/4.11  (step t100 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and))) :rule resolution :premises (t99 a22))
% 3.89/4.11  (step t101 (cl (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) :rule resolution :premises (t92 t22 t100))
% 3.89/4.11  (step t102 (cl (not (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal))) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal)) :rule or_pos)
% 3.89/4.11  (step t103 (cl (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (not (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal)))) :rule reordering :premises (t102))
% 3.89/4.11  (step t104 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal))) (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t105)
% 3.89/4.11  (assume t105.a0 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))))
% 3.89/4.11  (step t105.t1 (cl (or (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal)))) :rule forall_inst :args ((:= K (tptp.and2 (tptp.h2 tptp.f))) (:= Any tptp.and)))
% 3.89/4.11  (step t105.t2 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal))) :rule or :premises (t105.t1))
% 3.89/4.11  (step t105.t3 (cl (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal))) :rule resolution :premises (t105.t2 t105.a0))
% 3.89/4.11  (step t105 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal))) :rule subproof :discharge (t105.a0))
% 3.89/4.11  (step t106 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal))) (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal))) :rule resolution :premises (t104 t105))
% 3.89/4.11  (step t107 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal))) (not (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal)))) :rule implies_neg2)
% 3.89/4.11  (step t108 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal))) (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal)))) :rule resolution :premises (t106 t107))
% 3.89/4.11  (step t109 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal)))) :rule contraction :premises (t108))
% 3.89/4.11  (step t110 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal))) :rule implies :premises (t109))
% 3.89/4.11  (step t111 (cl (or (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.abnormal))) :rule resolution :premises (t110 a6))
% 3.89/4.11  (step t112 (cl (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) :rule resolution :premises (t103 a52 t101 t111))
% 3.89/4.11  (step t113 (cl (not (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t114 (cl (tptp.equal_value tptp.n0 tptp.n1) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (not (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule reordering :premises (t113))
% 3.89/4.11  (step t115 (cl (not (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1))) (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t116 (cl (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (not (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)))) :rule reordering :premises (t115))
% 3.89/4.11  (step t117 (cl (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) :rule or_pos)
% 3.89/4.11  (step t118 (cl (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule reordering :premises (t117))
% 3.89/4.11  (step t119 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t120)
% 3.89/4.11  (assume t120.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X))))))
% 3.89/4.11  (step t120.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 3.89/4.11  (step t120.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule or :premises (t120.t1))
% 3.89/4.11  (step t120.t3 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t120.t2 t120.a0))
% 3.89/4.11  (step t120 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t120.a0))
% 3.89/4.11  (step t121 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t119 t120))
% 3.89/4.11  (step t122 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 3.89/4.11  (step t123 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule resolution :premises (t121 t122))
% 3.89/4.11  (step t124 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))))) :rule contraction :premises (t123))
% 3.89/4.11  (step t125 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule implies :premises (t124))
% 3.89/4.11  (step t126 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t125 a27))
% 3.89/4.11  (step t127 (cl (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) :rule resolution :premises (t118 t22 t126))
% 3.89/4.11  (step t128 (cl (not (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1))) (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t129 (cl (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1) (not (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)))) :rule reordering :premises (t128))
% 3.89/4.11  (step t130 (cl (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f))))) (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) :rule or_pos)
% 3.89/4.11  (step t131 (cl (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))))) :rule reordering :premises (t130))
% 3.89/4.11  (step t132 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.h2 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t133)
% 3.89/4.11  (assume t133.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.h2 X))))))
% 3.89/4.11  (step t133.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.h2 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= X tptp.f)))
% 3.89/4.11  (step t133.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.h2 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f))))) :rule or :premises (t133.t1))
% 3.89/4.11  (step t133.t3 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f))))) :rule resolution :premises (t133.t2 t133.a0))
% 3.89/4.11  (step t133 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.h2 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f))))) :rule subproof :discharge (t133.a0))
% 3.89/4.11  (step t134 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f))))) :rule resolution :premises (t132 t133))
% 3.89/4.11  (step t135 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f))))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 3.89/4.11  (step t136 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t134 t135))
% 3.89/4.11  (step t137 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))))) :rule contraction :premises (t136))
% 3.89/4.11  (step t138 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.h2 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f))))) :rule implies :premises (t137))
% 3.89/4.11  (step t139 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f))))) :rule resolution :premises (t138 a40))
% 3.89/4.11  (step t140 (cl (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) :rule resolution :premises (t131 a45 t139))
% 3.89/4.11  (step t141 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t142)
% 3.89/4.11  (assume t142.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 3.89/4.11  (step t142.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)))) :rule forall_inst :args ((:= P1 (tptp.in tptp.n1 tptp.f)) (:= P2 (tptp.in tptp.n1 (tptp.h2 tptp.f))) (:= V tptp.n1)))
% 3.89/4.11  (step t142.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1))) :rule or :premises (t142.t1))
% 3.89/4.11  (step t142.t3 (cl (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1))) :rule resolution :premises (t142.t2 t142.a0))
% 3.89/4.11  (step t142 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1))) :rule subproof :discharge (t142.a0))
% 3.89/4.11  (step t143 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1))) (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1))) :rule resolution :premises (t141 t142))
% 3.89/4.11  (step t144 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1))) (not (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t145 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)))) :rule resolution :premises (t143 t144))
% 3.89/4.11  (step t146 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)))) :rule contraction :premises (t145))
% 3.89/4.11  (step t147 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1))) :rule implies :premises (t146))
% 3.89/4.11  (step t148 (cl (or (not (tptp.connection (tptp.in tptp.n1 tptp.f) (tptp.in tptp.n1 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1))) :rule resolution :premises (t147 a0))
% 3.89/4.11  (step t149 (cl (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) :rule resolution :premises (t129 a46 t140 t148))
% 3.89/4.11  (step t150 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t151)
% 3.89/4.11  (assume t151.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 3.89/4.11  (step t151.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)))) :rule forall_inst :args ((:= P1 (tptp.in tptp.n1 (tptp.h2 tptp.f))) (:= P2 (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))) (:= V tptp.n1)))
% 3.89/4.11  (step t151.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1))) :rule or :premises (t151.t1))
% 3.89/4.11  (step t151.t3 (cl (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1))) :rule resolution :premises (t151.t2 t151.a0))
% 3.89/4.11  (step t151 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1))) :rule subproof :discharge (t151.a0))
% 3.89/4.11  (step t152 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1))) :rule resolution :premises (t150 t151))
% 3.89/4.11  (step t153 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1))) (not (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t154 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)))) :rule resolution :premises (t152 t153))
% 3.89/4.11  (step t155 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)))) :rule contraction :premises (t154))
% 3.89/4.11  (step t156 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1))) :rule implies :premises (t155))
% 3.89/4.11  (step t157 (cl (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1))) :rule resolution :premises (t156 a0))
% 3.89/4.11  (step t158 (cl (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) :rule resolution :premises (t116 t127 t149 t157))
% 3.89/4.11  (step t159 (cl (=> (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))) (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t160)
% 3.89/4.11  (assume t160.a0 (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))))
% 3.89/4.11  (step t160.t1 (cl (or (not (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2)))) (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule forall_inst :args ((:= P (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))) (:= V1 tptp.n0) (:= V2 tptp.n1)))
% 3.89/4.11  (step t160.t2 (cl (not (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2)))) (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule or :premises (t160.t1))
% 3.89/4.11  (step t160.t3 (cl (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule resolution :premises (t160.t2 t160.a0))
% 3.89/4.11  (step t160 (cl (not (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2)))) (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule subproof :discharge (t160.a0))
% 3.89/4.11  (step t161 (cl (=> (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))) (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule resolution :premises (t159 t160))
% 3.89/4.11  (step t162 (cl (=> (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))) (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) (not (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t163 (cl (=> (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))) (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) (=> (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))) (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule resolution :premises (t161 t162))
% 3.89/4.11  (step t164 (cl (=> (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))) (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule contraction :premises (t163))
% 3.89/4.11  (step t165 (cl (not (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2)))) (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule implies :premises (t164))
% 3.89/4.11  (step t166 (cl (or (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule resolution :premises (t165 a2))
% 3.89/4.11  (step t167 (cl (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule resolution :premises (t114 a3 t158 t166))
% 3.89/4.11  (step t168 (cl (not (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0))) (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) :rule or_pos)
% 3.89/4.11  (step t169 (cl (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (not (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)))) :rule reordering :premises (t168))
% 3.89/4.11  (step t170 (cl (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f)))))) (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) :rule or_pos)
% 3.89/4.11  (step t171 (cl (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f)))) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))))) :rule reordering :premises (t170))
% 3.89/4.11  (step t172 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.and2 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t173)
% 3.89/4.11  (assume t173.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.and2 X))))))
% 3.89/4.11  (step t173.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 3.89/4.11  (step t173.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule or :premises (t173.t1))
% 3.89/4.11  (step t173.t3 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t173.t2 t173.a0))
% 3.89/4.11  (step t173 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t173.a0))
% 3.89/4.11  (step t174 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t172 t173))
% 3.89/4.11  (step t175 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f)))))) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 3.89/4.11  (step t176 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))))) :rule resolution :premises (t174 t175))
% 3.89/4.11  (step t177 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.and2 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))))) :rule contraction :premises (t176))
% 3.89/4.11  (step t178 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule implies :premises (t177))
% 3.89/4.11  (step t179 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t178 a28))
% 3.89/4.11  (step t180 (cl (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) :rule resolution :premises (t171 t22 t179))
% 3.89/4.11  (step t181 (cl (not (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t182 (cl (tptp.equal_value tptp.n0 tptp.n1) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (not (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule reordering :premises (t181))
% 3.89/4.11  (step t183 (cl (not (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1))) (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t184 (cl (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (not (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)))) :rule reordering :premises (t183))
% 3.89/4.11  (step t185 (cl (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f))))) (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) :rule or_pos)
% 3.89/4.11  (step t186 (cl (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))))) :rule reordering :premises (t185))
% 3.89/4.11  (step t187 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 X)) (tptp.in tptp.n2 (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 X)) (tptp.in tptp.n2 (tptp.h2 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t188)
% 3.89/4.11  (assume t188.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 X)) (tptp.in tptp.n2 (tptp.h2 X))))))
% 3.89/4.11  (step t188.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 X)) (tptp.in tptp.n2 (tptp.h2 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= X tptp.f)))
% 3.89/4.11  (step t188.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 X)) (tptp.in tptp.n2 (tptp.h2 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f))))) :rule or :premises (t188.t1))
% 3.89/4.11  (step t188.t3 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f))))) :rule resolution :premises (t188.t2 t188.a0))
% 3.89/4.11  (step t188 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 X)) (tptp.in tptp.n2 (tptp.h2 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f))))) :rule subproof :discharge (t188.a0))
% 3.89/4.11  (step t189 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 X)) (tptp.in tptp.n2 (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f))))) :rule resolution :premises (t187 t188))
% 3.89/4.11  (step t190 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 X)) (tptp.in tptp.n2 (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f))))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 3.89/4.11  (step t191 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 X)) (tptp.in tptp.n2 (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 X)) (tptp.in tptp.n2 (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))))) :rule resolution :premises (t189 t190))
% 3.89/4.11  (step t192 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 X)) (tptp.in tptp.n2 (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))))) :rule contraction :premises (t191))
% 3.89/4.11  (step t193 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 X)) (tptp.in tptp.n2 (tptp.h2 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f))))) :rule implies :premises (t192))
% 3.89/4.11  (step t194 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f))))) :rule resolution :premises (t193 a37))
% 3.89/4.11  (step t195 (cl (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) :rule resolution :premises (t186 a45 t194))
% 3.89/4.11  (step t196 (cl (not (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1))) (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t197 (cl (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1) (not (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)))) :rule reordering :premises (t196))
% 3.89/4.11  (step t198 (cl (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) :rule or_pos)
% 3.89/4.11  (step t199 (cl (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t198))
% 3.89/4.11  (step t200 (cl (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder))) (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) :rule or_pos)
% 3.89/4.11  (step t201 (cl (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder)))) :rule reordering :premises (t200))
% 3.89/4.11  (step t202 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h1 X) tptp.halfadder))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h1 X) tptp.halfadder)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t203)
% 3.89/4.11  (assume t203.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h1 X) tptp.halfadder))))
% 3.89/4.11  (step t203.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h1 X) tptp.halfadder)))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder)))) :rule forall_inst :args ((:= X tptp.f)))
% 3.89/4.11  (step t203.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h1 X) tptp.halfadder)))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder))) :rule or :premises (t203.t1))
% 3.89/4.11  (step t203.t3 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder))) :rule resolution :premises (t203.t2 t203.a0))
% 3.89/4.11  (step t203 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h1 X) tptp.halfadder)))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder))) :rule subproof :discharge (t203.a0))
% 3.89/4.11  (step t204 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h1 X) tptp.halfadder))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder))) :rule resolution :premises (t202 t203))
% 3.89/4.11  (step t205 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h1 X) tptp.halfadder))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder)))) :rule implies_neg2)
% 3.89/4.11  (step t206 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h1 X) tptp.halfadder))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h1 X) tptp.halfadder))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder)))) :rule resolution :premises (t204 t205))
% 3.89/4.11  (step t207 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h1 X) tptp.halfadder))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder)))) :rule contraction :premises (t206))
% 3.89/4.11  (step t208 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.type (tptp.h1 X) tptp.halfadder)))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder))) :rule implies :premises (t207))
% 3.89/4.11  (step t209 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.type (tptp.h1 tptp.f) tptp.halfadder))) :rule resolution :premises (t208 a34))
% 3.89/4.11  (step t210 (cl (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) :rule resolution :premises (t201 a45 t209))
% 3.89/4.11  (step t211 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t212)
% 3.89/4.11  (assume t212.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X))))))
% 3.89/4.11  (step t212.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 3.89/4.11  (step t212.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule or :premises (t212.t1))
% 3.89/4.11  (step t212.t3 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t212.t2 t212.a0))
% 3.89/4.11  (step t212 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t212.a0))
% 3.89/4.11  (step t213 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t211 t212))
% 3.89/4.11  (step t214 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 3.89/4.11  (step t215 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t213 t214))
% 3.89/4.11  (step t216 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t215))
% 3.89/4.11  (step t217 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule implies :premises (t216))
% 3.89/4.11  (step t218 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t217 a29))
% 3.89/4.11  (step t219 (cl (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) :rule resolution :premises (t199 t210 t218))
% 3.89/4.11  (step t220 (cl (not (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t221 (cl (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1) (not (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)))) :rule reordering :premises (t220))
% 3.89/4.11  (step t222 (cl (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and))) (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) :rule or_pos)
% 3.89/4.11  (step t223 (cl (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)))) :rule reordering :premises (t222))
% 3.89/4.11  (step t224 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t225)
% 3.89/4.11  (assume t225.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))))
% 3.89/4.11  (step t225.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 3.89/4.11  (step t225.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and))) :rule or :premises (t225.t1))
% 3.89/4.11  (step t225.t3 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and))) :rule resolution :premises (t225.t2 t225.a0))
% 3.89/4.11  (step t225 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and))) :rule subproof :discharge (t225.a0))
% 3.89/4.11  (step t226 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and))) :rule resolution :premises (t224 t225))
% 3.89/4.11  (step t227 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)))) :rule implies_neg2)
% 3.89/4.11  (step t228 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)))) :rule resolution :premises (t226 t227))
% 3.89/4.11  (step t229 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)))) :rule contraction :premises (t228))
% 3.89/4.11  (step t230 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and))) :rule implies :premises (t229))
% 3.89/4.11  (step t231 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and))) :rule resolution :premises (t230 a21))
% 3.89/4.11  (step t232 (cl (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) :rule resolution :premises (t223 t210 t231))
% 3.89/4.11  (step t233 (cl (not (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal))) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal)) :rule or_pos)
% 3.89/4.11  (step t234 (cl (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (not (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule reordering :premises (t233))
% 3.89/4.11  (step t235 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal))) (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t236)
% 3.89/4.11  (assume t236.a0 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))))
% 3.89/4.11  (step t236.t1 (cl (or (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule forall_inst :args ((:= K (tptp.and1 (tptp.h1 tptp.f))) (:= Any tptp.and)))
% 3.89/4.11  (step t236.t2 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule or :premises (t236.t1))
% 3.89/4.11  (step t236.t3 (cl (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule resolution :premises (t236.t2 t236.a0))
% 3.89/4.11  (step t236 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule subproof :discharge (t236.a0))
% 3.89/4.11  (step t237 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal))) (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule resolution :premises (t235 t236))
% 3.89/4.11  (step t238 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal))) (not (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule implies_neg2)
% 3.89/4.11  (step t239 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal))) (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule resolution :premises (t237 t238))
% 3.89/4.11  (step t240 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule contraction :premises (t239))
% 3.89/4.11  (step t241 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule implies :premises (t240))
% 3.89/4.11  (step t242 (cl (or (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule resolution :premises (t241 a6))
% 3.89/4.11  (step t243 (cl (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) :rule resolution :premises (t234 a57 t232 t242))
% 3.89/4.11  (step t244 (cl (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t245 (cl (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)))) :rule reordering :premises (t244))
% 3.89/4.11  (step t246 (cl (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) :rule or_pos)
% 3.89/4.11  (step t247 (cl (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t246))
% 3.89/4.11  (step t248 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 X)) (tptp.in tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 X)) (tptp.in tptp.n1 (tptp.and1 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t249)
% 3.89/4.11  (assume t249.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 X)) (tptp.in tptp.n1 (tptp.and1 X))))))
% 3.89/4.11  (step t249.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 X)) (tptp.in tptp.n1 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 3.89/4.11  (step t249.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 X)) (tptp.in tptp.n1 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule or :premises (t249.t1))
% 3.89/4.11  (step t249.t3 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t249.t2 t249.a0))
% 3.89/4.11  (step t249 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 X)) (tptp.in tptp.n1 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t249.a0))
% 3.89/4.11  (step t250 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 X)) (tptp.in tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t248 t249))
% 3.89/4.11  (step t251 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 X)) (tptp.in tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 3.89/4.11  (step t252 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 X)) (tptp.in tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 X)) (tptp.in tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t250 t251))
% 3.89/4.11  (step t253 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 X)) (tptp.in tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t252))
% 3.89/4.11  (step t254 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 X)) (tptp.in tptp.n1 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule implies :premises (t253))
% 3.89/4.11  (step t255 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t254 a31))
% 3.89/4.11  (step t256 (cl (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) :rule resolution :premises (t247 t210 t255))
% 3.89/4.11  (step t257 (cl (not (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t258 (cl (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1) (not (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)))) :rule reordering :premises (t257))
% 3.89/4.11  (step t259 (cl (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or))) (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) :rule or_pos)
% 3.89/4.11  (step t260 (cl (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)))) :rule reordering :premises (t259))
% 3.89/4.11  (step t261 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t262)
% 3.89/4.11  (assume t262.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))))
% 3.89/4.11  (step t262.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 3.89/4.11  (step t262.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or))) :rule or :premises (t262.t1))
% 3.89/4.11  (step t262.t3 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or))) :rule resolution :premises (t262.t2 t262.a0))
% 3.89/4.11  (step t262 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or))) :rule subproof :discharge (t262.a0))
% 3.89/4.11  (step t263 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or))) :rule resolution :premises (t261 t262))
% 3.89/4.11  (step t264 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)))) :rule implies_neg2)
% 3.89/4.11  (step t265 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)))) :rule resolution :premises (t263 t264))
% 3.89/4.11  (step t266 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)))) :rule contraction :premises (t265))
% 3.89/4.11  (step t267 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or))) :rule implies :premises (t266))
% 3.89/4.11  (step t268 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or))) :rule resolution :premises (t267 a24))
% 3.89/4.11  (step t269 (cl (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) :rule resolution :premises (t260 t210 t268))
% 3.89/4.11  (step t270 (cl (not (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal))) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal)) :rule or_pos)
% 3.89/4.11  (step t271 (cl (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (not (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule reordering :premises (t270))
% 3.89/4.11  (step t272 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal))) (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t273)
% 3.89/4.11  (assume t273.a0 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))))
% 3.89/4.11  (step t273.t1 (cl (or (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule forall_inst :args ((:= K (tptp.or1 (tptp.h1 tptp.f))) (:= Any tptp.or)))
% 3.89/4.11  (step t273.t2 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule or :premises (t273.t1))
% 3.89/4.11  (step t273.t3 (cl (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule resolution :premises (t273.t2 t273.a0))
% 3.89/4.11  (step t273 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule subproof :discharge (t273.a0))
% 3.89/4.11  (step t274 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal))) (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule resolution :premises (t272 t273))
% 3.89/4.11  (step t275 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal))) (not (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule implies_neg2)
% 3.89/4.11  (step t276 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal))) (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule resolution :premises (t274 t275))
% 3.89/4.11  (step t277 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule contraction :premises (t276))
% 3.89/4.11  (step t278 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule implies :premises (t277))
% 3.89/4.11  (step t279 (cl (or (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule resolution :premises (t278 a6))
% 3.89/4.11  (step t280 (cl (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) :rule resolution :premises (t271 a54 t269 t279))
% 3.89/4.11  (step t281 (cl (not (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t282 (cl (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1) (not (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)))) :rule reordering :premises (t281))
% 3.89/4.11  (step t283 (cl (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f)))))) (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) :rule or_pos)
% 3.89/4.11  (step t284 (cl (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f)))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t283))
% 3.89/4.11  (step t285 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.or1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.or1 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t286)
% 3.89/4.11  (assume t286.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.or1 X))))))
% 3.89/4.11  (step t286.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.or1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 3.89/4.11  (step t286.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.or1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule or :premises (t286.t1))
% 3.89/4.11  (step t286.t3 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t286.t2 t286.a0))
% 3.89/4.11  (step t286 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.or1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t286.a0))
% 3.89/4.11  (step t287 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.or1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t285 t286))
% 3.89/4.11  (step t288 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.or1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 3.89/4.11  (step t289 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.or1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.or1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t287 t288))
% 3.89/4.11  (step t290 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.or1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t289))
% 3.89/4.11  (step t291 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n2 (tptp.or1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule implies :premises (t290))
% 3.89/4.11  (step t292 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t291 a26))
% 3.89/4.11  (step t293 (cl (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) :rule resolution :premises (t284 t210 t292))
% 3.89/4.11  (step t294 (cl (not (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1))) (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t295 (cl (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1) (not (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)))) :rule reordering :premises (t294))
% 3.89/4.11  (step t296 (cl (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f))))) (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) :rule or_pos)
% 3.89/4.11  (step t297 (cl (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))))) :rule reordering :premises (t296))
% 3.89/4.11  (step t298 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.c X) (tptp.in tptp.n2 (tptp.h1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.c X) (tptp.in tptp.n2 (tptp.h1 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t299)
% 3.89/4.11  (assume t299.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.c X) (tptp.in tptp.n2 (tptp.h1 X))))))
% 3.89/4.11  (step t299.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.c X) (tptp.in tptp.n2 (tptp.h1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))))) :rule forall_inst :args ((:= X tptp.f)))
% 3.89/4.11  (step t299.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.c X) (tptp.in tptp.n2 (tptp.h1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f))))) :rule or :premises (t299.t1))
% 3.89/4.11  (step t299.t3 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f))))) :rule resolution :premises (t299.t2 t299.a0))
% 3.89/4.11  (step t299 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.c X) (tptp.in tptp.n2 (tptp.h1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f))))) :rule subproof :discharge (t299.a0))
% 3.89/4.11  (step t300 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.c X) (tptp.in tptp.n2 (tptp.h1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f))))) :rule resolution :premises (t298 t299))
% 3.89/4.11  (step t301 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.c X) (tptp.in tptp.n2 (tptp.h1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f))))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))))) :rule implies_neg2)
% 3.89/4.11  (step t302 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.c X) (tptp.in tptp.n2 (tptp.h1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.c X) (tptp.in tptp.n2 (tptp.h1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t300 t301))
% 3.89/4.11  (step t303 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.c X) (tptp.in tptp.n2 (tptp.h1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))))) :rule contraction :premises (t302))
% 3.89/4.11  (step t304 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.c X) (tptp.in tptp.n2 (tptp.h1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f))))) :rule implies :premises (t303))
% 3.89/4.11  (step t305 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f))))) :rule resolution :premises (t304 a42))
% 3.89/4.11  (step t306 (cl (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) :rule resolution :premises (t297 a45 t305))
% 3.89/4.11  (step t307 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t308)
% 3.89/4.11  (assume t308.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 3.89/4.11  (step t308.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)))) :rule forall_inst :args ((:= P1 (tptp.in tptp.c tptp.f)) (:= P2 (tptp.in tptp.n2 (tptp.h1 tptp.f))) (:= V tptp.n1)))
% 3.89/4.11  (step t308.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1))) :rule or :premises (t308.t1))
% 3.89/4.11  (step t308.t3 (cl (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1))) :rule resolution :premises (t308.t2 t308.a0))
% 3.89/4.11  (step t308 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1))) :rule subproof :discharge (t308.a0))
% 3.89/4.11  (step t309 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1))) (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1))) :rule resolution :premises (t307 t308))
% 3.89/4.11  (step t310 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1))) (not (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t311 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)))) :rule resolution :premises (t309 t310))
% 3.89/4.11  (step t312 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)))) :rule contraction :premises (t311))
% 3.89/4.11  (step t313 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1))) :rule implies :premises (t312))
% 3.89/4.11  (step t314 (cl (or (not (tptp.connection (tptp.in tptp.c tptp.f) (tptp.in tptp.n2 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.c tptp.f) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1))) :rule resolution :premises (t313 a0))
% 3.89/4.11  (step t315 (cl (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) :rule resolution :premises (t295 a48 t306 t314))
% 3.89/4.11  (step t316 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t317)
% 3.89/4.11  (assume t317.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 3.89/4.11  (step t317.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)))) :rule forall_inst :args ((:= P1 (tptp.in tptp.n2 (tptp.h1 tptp.f))) (:= P2 (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f)))) (:= V tptp.n1)))
% 3.89/4.11  (step t317.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) :rule or :premises (t317.t1))
% 3.89/4.11  (step t317.t3 (cl (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t317.t2 t317.a0))
% 3.89/4.11  (step t317 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) :rule subproof :discharge (t317.a0))
% 3.89/4.11  (step t318 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t316 t317))
% 3.89/4.11  (step t319 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) (not (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t320 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)))) :rule resolution :premises (t318 t319))
% 3.89/4.11  (step t321 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)))) :rule contraction :premises (t320))
% 3.89/4.11  (step t322 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) :rule implies :premises (t321))
% 3.89/4.11  (step t323 (cl (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t322 a0))
% 3.89/4.11  (step t324 (cl (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) :rule resolution :premises (t282 t293 t315 t323))
% 3.89/4.11  (step t325 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.in Any K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.in Any K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t326)
% 3.89/4.11  (assume t326.a0 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.in Any K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))))
% 3.89/4.11  (step t326.t1 (cl (or (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.in Any K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1)))) (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)))) :rule forall_inst :args ((:= K (tptp.or1 (tptp.h1 tptp.f))) (:= Any tptp.n2)))
% 3.89/4.11  (step t326.t2 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.in Any K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1)))) (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) :rule or :premises (t326.t1))
% 3.89/4.11  (step t326.t3 (cl (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t326.t2 t326.a0))
% 3.89/4.11  (step t326 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.in Any K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1)))) (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) :rule subproof :discharge (t326.a0))
% 3.89/4.11  (step t327 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.in Any K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t325 t326))
% 3.89/4.11  (step t328 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.in Any K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) (not (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t329 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.in Any K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.in Any K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)))) :rule resolution :premises (t327 t328))
% 3.89/4.11  (step t330 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.in Any K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)))) :rule contraction :premises (t329))
% 3.89/4.11  (step t331 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.in Any K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1)))) (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) :rule implies :premises (t330))
% 3.89/4.11  (step t332 (cl (or (not (tptp.mode (tptp.or1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.or1 (tptp.h1 tptp.f)) tptp.or)) (not (tptp.value (tptp.in tptp.n2 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t331 a12))
% 3.89/4.11  (step t333 (cl (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) :rule resolution :premises (t258 t269 t280 t324 t332))
% 3.89/4.11  (step t334 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t335)
% 3.89/4.11  (assume t335.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 3.89/4.11  (step t335.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f)))) (:= P2 (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))) (:= V tptp.n1)))
% 3.89/4.11  (step t335.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule or :premises (t335.t1))
% 3.89/4.11  (step t335.t3 (cl (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t335.t2 t335.a0))
% 3.89/4.11  (step t335 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule subproof :discharge (t335.a0))
% 3.89/4.11  (step t336 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t334 t335))
% 3.89/4.11  (step t337 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t338 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)))) :rule resolution :premises (t336 t337))
% 3.89/4.11  (step t339 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)))) :rule contraction :premises (t338))
% 3.89/4.11  (step t340 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule implies :premises (t339))
% 3.89/4.11  (step t341 (cl (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t340 a0))
% 3.89/4.11  (step t342 (cl (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) :rule resolution :premises (t245 t256 t333 t341))
% 3.89/4.11  (step t343 (cl (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t344 (cl (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)))) :rule reordering :premises (t343))
% 3.89/4.11  (step t345 (cl (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f)))))) (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) :rule or_pos)
% 3.89/4.11  (step t346 (cl (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f)))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t345))
% 3.89/4.11  (step t347 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t348)
% 3.89/4.11  (assume t348.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X))))))
% 3.89/4.11  (step t348.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 3.89/4.11  (step t348.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule or :premises (t348.t1))
% 3.89/4.11  (step t348.t3 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t348.t2 t348.a0))
% 3.89/4.11  (step t348 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t348.a0))
% 3.89/4.11  (step t349 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t347 t348))
% 3.89/4.11  (step t350 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 3.89/4.11  (step t351 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t349 t350))
% 3.89/4.11  (step t352 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t351))
% 3.89/4.11  (step t353 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule implies :premises (t352))
% 3.89/4.11  (step t354 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t353 a33))
% 3.89/4.11  (step t355 (cl (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) :rule resolution :premises (t346 t210 t354))
% 3.89/4.11  (step t356 (cl (not (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1))) (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t357 (cl (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1) (not (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)))) :rule reordering :premises (t356))
% 3.89/4.11  (step t358 (cl (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not))) (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) :rule or_pos)
% 3.89/4.11  (step t359 (cl (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)))) :rule reordering :premises (t358))
% 3.89/4.11  (step t360 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t361)
% 3.89/4.11  (assume t361.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))))
% 3.89/4.11  (step t361.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 3.89/4.11  (step t361.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not))) :rule or :premises (t361.t1))
% 3.89/4.11  (step t361.t3 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not))) :rule resolution :premises (t361.t2 t361.a0))
% 3.89/4.11  (step t361 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not))) :rule subproof :discharge (t361.a0))
% 3.89/4.11  (step t362 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not))) :rule resolution :premises (t360 t361))
% 3.89/4.11  (step t363 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)))) :rule implies_neg2)
% 3.89/4.11  (step t364 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)))) :rule resolution :premises (t362 t363))
% 3.89/4.11  (step t365 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)))) :rule contraction :premises (t364))
% 3.89/4.11  (step t366 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not))) :rule implies :premises (t365))
% 3.89/4.11  (step t367 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not))) :rule resolution :premises (t366 a23))
% 3.89/4.11  (step t368 (cl (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) :rule resolution :premises (t359 t210 t367))
% 3.89/4.11  (step t369 (cl (not (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal))) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal)) :rule or_pos)
% 3.89/4.11  (step t370 (cl (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (not (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule reordering :premises (t369))
% 3.89/4.11  (step t371 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal))) (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t372)
% 3.89/4.11  (assume t372.a0 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))))
% 3.89/4.11  (step t372.t1 (cl (or (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule forall_inst :args ((:= K (tptp.not1 (tptp.h1 tptp.f))) (:= Any tptp.not)))
% 3.89/4.11  (step t372.t2 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule or :premises (t372.t1))
% 3.89/4.11  (step t372.t3 (cl (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule resolution :premises (t372.t2 t372.a0))
% 3.89/4.11  (step t372 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule subproof :discharge (t372.a0))
% 3.89/4.11  (step t373 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal))) (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule resolution :premises (t371 t372))
% 3.89/4.11  (step t374 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal))) (not (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule implies_neg2)
% 3.89/4.11  (step t375 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal))) (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule resolution :premises (t373 t374))
% 3.89/4.11  (step t376 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule contraction :premises (t375))
% 3.89/4.11  (step t377 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule implies :premises (t376))
% 3.89/4.11  (step t378 (cl (or (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.abnormal))) :rule resolution :premises (t377 a6))
% 3.89/4.11  (step t379 (cl (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) :rule resolution :premises (t370 a55 t368 t378))
% 3.89/4.11  (step t380 (cl (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0))) (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) :rule or_pos)
% 3.89/4.11  (step t381 (cl (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)))) :rule reordering :premises (t380))
% 3.89/4.11  (step t382 (cl (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f)))))) (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) :rule or_pos)
% 3.89/4.11  (step t383 (cl (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f)))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule reordering :premises (t382))
% 3.89/4.11  (step t384 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t385)
% 3.89/4.11  (assume t385.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X))))))
% 3.89/4.11  (step t385.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 3.89/4.11  (step t385.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule or :premises (t385.t1))
% 3.89/4.11  (step t385.t3 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t385.t2 t385.a0))
% 3.89/4.11  (step t385 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t385.a0))
% 3.89/4.11  (step t386 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t384 t385))
% 3.89/4.11  (step t387 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f)))))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 3.89/4.11  (step t388 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule resolution :premises (t386 t387))
% 3.89/4.11  (step t389 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))))) :rule contraction :premises (t388))
% 3.89/4.11  (step t390 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 X)) (tptp.in tptp.n1 (tptp.not1 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule implies :premises (t389))
% 3.89/4.11  (step t391 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t390 a32))
% 3.89/4.11  (step t392 (cl (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) :rule resolution :premises (t383 t210 t391))
% 3.89/4.11  (step t393 (cl (not (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) :rule or_pos)
% 3.89/4.11  (step t394 (cl (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0) (not (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)))) :rule reordering :premises (t393))
% 3.89/4.11  (step t395 (cl (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and))) (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) :rule or_pos)
% 3.89/4.11  (step t396 (cl (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)))) :rule reordering :premises (t395))
% 3.89/4.11  (step t397 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t398)
% 3.89/4.11  (assume t398.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))))
% 3.89/4.11  (step t398.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 3.89/4.11  (step t398.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and))) :rule or :premises (t398.t1))
% 3.89/4.11  (step t398.t3 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and))) :rule resolution :premises (t398.t2 t398.a0))
% 3.89/4.11  (step t398 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and))) :rule subproof :discharge (t398.a0))
% 3.89/4.11  (step t399 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and))) :rule resolution :premises (t397 t398))
% 3.89/4.11  (step t400 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)))) :rule implies_neg2)
% 3.89/4.11  (step t401 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)))) :rule resolution :premises (t399 t400))
% 3.89/4.11  (step t402 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)))) :rule contraction :premises (t401))
% 3.89/4.11  (step t403 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and)))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and))) :rule implies :premises (t402))
% 3.89/4.11  (step t404 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and))) :rule resolution :premises (t403 a22))
% 3.89/4.11  (step t405 (cl (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) :rule resolution :premises (t396 t210 t404))
% 3.89/4.11  (step t406 (cl (not (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal))) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal)) :rule or_pos)
% 3.89/4.11  (step t407 (cl (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (not (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule reordering :premises (t406))
% 3.89/4.11  (step t408 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal))) (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t409)
% 3.89/4.11  (assume t409.a0 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))))
% 3.89/4.11  (step t409.t1 (cl (or (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule forall_inst :args ((:= K (tptp.and2 (tptp.h1 tptp.f))) (:= Any tptp.and)))
% 3.89/4.11  (step t409.t2 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal))) :rule or :premises (t409.t1))
% 3.89/4.11  (step t409.t3 (cl (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal))) :rule resolution :premises (t409.t2 t409.a0))
% 3.89/4.11  (step t409 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal))) :rule subproof :discharge (t409.a0))
% 3.89/4.11  (step t410 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal))) (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal))) :rule resolution :premises (t408 t409))
% 3.89/4.11  (step t411 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal))) (not (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule implies_neg2)
% 3.89/4.11  (step t412 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal))) (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule resolution :premises (t410 t411))
% 3.89/4.11  (step t413 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal)))) :rule contraction :premises (t412))
% 3.89/4.11  (step t414 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal))) :rule implies :premises (t413))
% 3.89/4.11  (step t415 (cl (or (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok) (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.abnormal))) :rule resolution :premises (t414 a6))
% 3.89/4.11  (step t416 (cl (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) :rule resolution :premises (t407 a56 t405 t415))
% 3.89/4.11  (step t417 (cl (not (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) :rule or_pos)
% 3.89/4.11  (step t418 (cl (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0) (not (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)))) :rule reordering :premises (t417))
% 3.89/4.11  (step t419 (cl (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f)))))) (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) :rule or_pos)
% 3.89/4.11  (step t420 (cl (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f)))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule reordering :premises (t419))
% 3.89/4.11  (step t421 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t422)
% 3.89/4.11  (assume t422.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X))))))
% 3.89/4.11  (step t422.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h1 tptp.f))))
% 3.89/4.11  (step t422.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule or :premises (t422.t1))
% 3.89/4.11  (step t422.t3 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t422.t2 t422.a0))
% 3.89/4.11  (step t422 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule subproof :discharge (t422.a0))
% 3.89/4.11  (step t423 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t421 t422))
% 3.89/4.11  (step t424 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f)))))) (not (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule implies_neg2)
% 3.89/4.11  (step t425 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule resolution :premises (t423 t424))
% 3.89/4.11  (step t426 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))))) :rule contraction :premises (t425))
% 3.89/4.11  (step t427 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.and2 X)))))) (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule implies :premises (t426))
% 3.89/4.11  (step t428 (cl (or (not (tptp.type (tptp.h1 tptp.f) tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f)))))) :rule resolution :premises (t427 a27))
% 3.89/4.11  (step t429 (cl (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) :rule resolution :premises (t420 t210 t428))
% 3.89/4.11  (step t430 (cl (not (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0))) (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) :rule or_pos)
% 3.89/4.11  (step t431 (cl (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0) (not (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)))) :rule reordering :premises (t430))
% 3.89/4.11  (step t432 (cl (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f))))) (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) :rule or_pos)
% 3.89/4.11  (step t433 (cl (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))))) :rule reordering :premises (t432))
% 3.89/4.11  (step t434 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n1 (tptp.h1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n1 (tptp.h1 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t435)
% 3.89/4.11  (assume t435.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n1 (tptp.h1 X))))))
% 3.89/4.11  (step t435.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n1 (tptp.h1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))))) :rule forall_inst :args ((:= X tptp.f)))
% 3.89/4.11  (step t435.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n1 (tptp.h1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f))))) :rule or :premises (t435.t1))
% 3.89/4.11  (step t435.t3 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f))))) :rule resolution :premises (t435.t2 t435.a0))
% 3.89/4.11  (step t435 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n1 (tptp.h1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f))))) :rule subproof :discharge (t435.a0))
% 3.89/4.11  (step t436 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n1 (tptp.h1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f))))) :rule resolution :premises (t434 t435))
% 3.89/4.11  (step t437 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n1 (tptp.h1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f))))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))))) :rule implies_neg2)
% 3.89/4.11  (step t438 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n1 (tptp.h1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n1 (tptp.h1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))))) :rule resolution :premises (t436 t437))
% 3.89/4.11  (step t439 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n1 (tptp.h1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))))) :rule contraction :premises (t438))
% 3.89/4.11  (step t440 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 X) (tptp.in tptp.n1 (tptp.h1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f))))) :rule implies :premises (t439))
% 3.89/4.11  (step t441 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f))))) :rule resolution :premises (t440 a41))
% 3.89/4.11  (step t442 (cl (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) :rule resolution :premises (t433 a45 t441))
% 3.89/4.11  (step t443 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t444)
% 3.89/4.11  (assume t444.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 3.89/4.11  (step t444.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)))) :rule forall_inst :args ((:= P1 (tptp.in tptp.n2 tptp.f)) (:= P2 (tptp.in tptp.n1 (tptp.h1 tptp.f))) (:= V tptp.n0)))
% 3.89/4.11  (step t444.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0))) :rule or :premises (t444.t1))
% 3.89/4.11  (step t444.t3 (cl (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0))) :rule resolution :premises (t444.t2 t444.a0))
% 3.89/4.11  (step t444 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0))) :rule subproof :discharge (t444.a0))
% 3.89/4.11  (step t445 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0))) (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0))) :rule resolution :premises (t443 t444))
% 3.89/4.11  (step t446 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0))) (not (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)))) :rule implies_neg2)
% 3.89/4.11  (step t447 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)))) :rule resolution :premises (t445 t446))
% 3.89/4.11  (step t448 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)))) :rule contraction :premises (t447))
% 3.89/4.11  (step t449 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0))) :rule implies :premises (t448))
% 3.89/4.11  (step t450 (cl (or (not (tptp.connection (tptp.in tptp.n2 tptp.f) (tptp.in tptp.n1 (tptp.h1 tptp.f)))) (not (tptp.value (tptp.in tptp.n2 tptp.f) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0))) :rule resolution :premises (t449 a0))
% 3.89/4.11  (step t451 (cl (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) :rule resolution :premises (t431 a47 t442 t450))
% 3.89/4.11  (step t452 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t453)
% 3.89/4.11  (assume t453.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 3.89/4.11  (step t453.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)))) :rule forall_inst :args ((:= P1 (tptp.in tptp.n1 (tptp.h1 tptp.f))) (:= P2 (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f)))) (:= V tptp.n0)))
% 3.89/4.11  (step t453.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) :rule or :premises (t453.t1))
% 3.89/4.11  (step t453.t3 (cl (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) :rule resolution :premises (t453.t2 t453.a0))
% 3.89/4.11  (step t453 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) :rule subproof :discharge (t453.a0))
% 3.89/4.11  (step t454 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) :rule resolution :premises (t452 t453))
% 3.89/4.11  (step t455 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) (not (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)))) :rule implies_neg2)
% 3.89/4.11  (step t456 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)))) :rule resolution :premises (t454 t455))
% 3.89/4.11  (step t457 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)))) :rule contraction :premises (t456))
% 3.89/4.11  (step t458 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) :rule implies :premises (t457))
% 3.89/4.11  (step t459 (cl (or (not (tptp.connection (tptp.in tptp.n1 (tptp.h1 tptp.f)) (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.h1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) :rule resolution :premises (t458 a0))
% 3.89/4.11  (step t460 (cl (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) :rule resolution :premises (t418 t429 t451 t459))
% 3.89/4.11  (step t461 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in Any K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in Any K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n0)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t462)
% 3.89/4.11  (assume t462.a0 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in Any K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n0))))
% 3.89/4.11  (step t462.t1 (cl (or (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in Any K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n0)))) (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)))) :rule forall_inst :args ((:= K (tptp.and2 (tptp.h1 tptp.f))) (:= Any tptp.n1)))
% 3.89/4.11  (step t462.t2 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in Any K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n0)))) (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) :rule or :premises (t462.t1))
% 3.89/4.11  (step t462.t3 (cl (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) :rule resolution :premises (t462.t2 t462.a0))
% 3.89/4.11  (step t462 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in Any K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n0)))) (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) :rule subproof :discharge (t462.a0))
% 3.89/4.11  (step t463 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in Any K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) :rule resolution :premises (t461 t462))
% 3.89/4.11  (step t464 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in Any K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) (not (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)))) :rule implies_neg2)
% 3.89/4.11  (step t465 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in Any K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in Any K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)))) :rule resolution :premises (t463 t464))
% 3.89/4.11  (step t466 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in Any K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)))) :rule contraction :premises (t465))
% 3.89/4.11  (step t467 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in Any K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n0)))) (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) :rule implies :premises (t466))
% 3.89/4.11  (step t468 (cl (or (not (tptp.mode (tptp.and2 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0))) :rule resolution :premises (t467 a7))
% 3.89/4.11  (step t469 (cl (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) :rule resolution :premises (t394 t405 t416 t460 t468))
% 3.89/4.11  (step t470 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t471)
% 3.89/4.11  (assume t471.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 3.89/4.11  (step t471.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f)))) (:= P2 (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f)))) (:= V tptp.n0)))
% 3.89/4.11  (step t471.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0))) :rule or :premises (t471.t1))
% 3.89/4.11  (step t471.t3 (cl (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0))) :rule resolution :premises (t471.t2 t471.a0))
% 3.89/4.11  (step t471 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0))) :rule subproof :discharge (t471.a0))
% 3.89/4.11  (step t472 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0))) :rule resolution :premises (t470 t471))
% 3.89/4.11  (step t473 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0))) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)))) :rule implies_neg2)
% 3.89/4.11  (step t474 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)))) :rule resolution :premises (t472 t473))
% 3.89/4.11  (step t475 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)))) :rule contraction :premises (t474))
% 3.89/4.11  (step t476 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0))) :rule implies :premises (t475))
% 3.89/4.11  (step t477 (cl (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0))) :rule resolution :premises (t476 a0))
% 3.89/4.11  (step t478 (cl (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) :rule resolution :premises (t381 t392 t469 t477))
% 3.89/4.11  (step t479 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1))) (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n1)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t480)
% 3.89/4.11  (assume t480.a0 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))))
% 3.89/4.11  (step t480.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n1)))) (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)))) :rule forall_inst :args ((:= K (tptp.not1 (tptp.h1 tptp.f)))))
% 3.89/4.11  (step t480.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n1)))) (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1))) :rule or :premises (t480.t1))
% 3.89/4.11  (step t480.t3 (cl (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t480.t2 t480.a0))
% 3.89/4.11  (step t480 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n1)))) (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1))) :rule subproof :discharge (t480.a0))
% 3.89/4.11  (step t481 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1))) (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t479 t480))
% 3.89/4.11  (step t482 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1))) (not (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t483 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1))) (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)))) :rule resolution :premises (t481 t482))
% 3.89/4.11  (step t484 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)))) :rule contraction :premises (t483))
% 3.89/4.11  (step t485 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n0)) (tptp.value (tptp.out tptp.n1 K) tptp.n1)))) (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1))) :rule implies :premises (t484))
% 3.89/4.11  (step t486 (cl (or (not (tptp.mode (tptp.not1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h1 tptp.f)) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t485 a17))
% 3.89/4.11  (step t487 (cl (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) :rule resolution :premises (t357 t368 t379 t478 t486))
% 3.89/4.11  (step t488 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t489)
% 3.89/4.11  (assume t489.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 3.89/4.11  (step t489.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f)))) (:= P2 (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f)))) (:= V tptp.n1)))
% 3.89/4.11  (step t489.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule or :premises (t489.t1))
% 3.89/4.11  (step t489.t3 (cl (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t489.t2 t489.a0))
% 3.89/4.11  (step t489 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule subproof :discharge (t489.a0))
% 3.89/4.11  (step t490 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t488 t489))
% 3.89/4.11  (step t491 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t492 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)))) :rule resolution :premises (t490 t491))
% 3.89/4.11  (step t493 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)))) :rule contraction :premises (t492))
% 3.89/4.11  (step t494 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule implies :premises (t493))
% 3.89/4.11  (step t495 (cl (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t494 a0))
% 3.89/4.11  (step t496 (cl (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) :rule resolution :premises (t344 t355 t487 t495))
% 3.89/4.11  (step t497 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t498)
% 3.89/4.11  (assume t498.a0 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))))
% 3.89/4.11  (step t498.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1)))) (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)))) :rule forall_inst :args ((:= K (tptp.and1 (tptp.h1 tptp.f)))))
% 3.89/4.11  (step t498.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1)))) (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule or :premises (t498.t1))
% 3.89/4.11  (step t498.t3 (cl (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t498.t2 t498.a0))
% 3.89/4.11  (step t498 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1)))) (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule subproof :discharge (t498.a0))
% 3.89/4.11  (step t499 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t497 t498))
% 3.89/4.11  (step t500 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) (not (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t501 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)))) :rule resolution :premises (t499 t500))
% 3.89/4.11  (step t502 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1))) (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)))) :rule contraction :premises (t501))
% 3.89/4.11  (step t503 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.in tptp.n1 K) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 K) tptp.n1)) (tptp.value (tptp.out tptp.n1 K) tptp.n1)))) (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule implies :premises (t502))
% 3.89/4.11  (step t504 (cl (or (not (tptp.mode (tptp.and1 (tptp.h1 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h1 tptp.f)) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1))) :rule resolution :premises (t503 a8))
% 3.89/4.11  (step t505 (cl (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) :rule resolution :premises (t221 t232 t243 t342 t496 t504))
% 3.89/4.11  (step t506 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t507)
% 3.89/4.11  (assume t507.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))))
% 3.89/4.11  (step t507.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.s (tptp.h1 tptp.f))) (:= P2 (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f)))) (:= V tptp.n1)))
% 3.89/4.11  (step t507.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1))) :rule or :premises (t507.t1))
% 3.89/4.11  (step t507.t3 (cl (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1))) :rule resolution :premises (t507.t2 t507.a0))
% 3.89/4.11  (step t507 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1))) :rule subproof :discharge (t507.a0))
% 3.89/4.11  (step t508 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1))) :rule resolution :premises (t506 t507))
% 3.89/4.11  (step t509 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1))) (not (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t510 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)))) :rule resolution :premises (t508 t509))
% 3.89/4.11  (step t511 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)))) :rule contraction :premises (t510))
% 3.89/4.11  (step t512 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1))) :rule implies :premises (t511))
% 3.89/4.11  (step t513 (cl (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h1 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1))) :rule resolution :premises (t512 a1))
% 3.89/4.11  (step t514 (cl (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) :rule resolution :premises (t197 t219 t505 t513))
% 3.89/4.11  (step t515 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t516)
% 3.89/4.11  (assume t516.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 3.89/4.11  (step t516.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.s (tptp.h1 tptp.f))) (:= P2 (tptp.in tptp.n2 (tptp.h2 tptp.f))) (:= V tptp.n1)))
% 3.89/4.11  (step t516.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1))) :rule or :premises (t516.t1))
% 3.89/4.11  (step t516.t3 (cl (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1))) :rule resolution :premises (t516.t2 t516.a0))
% 3.89/4.11  (step t516 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1))) :rule subproof :discharge (t516.a0))
% 3.89/4.11  (step t517 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1))) :rule resolution :premises (t515 t516))
% 3.89/4.11  (step t518 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1))) (not (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t519 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)))) :rule resolution :premises (t517 t518))
% 3.89/4.11  (step t520 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)))) :rule contraction :premises (t519))
% 3.89/4.11  (step t521 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1))) :rule implies :premises (t520))
% 3.89/4.11  (step t522 (cl (or (not (tptp.connection (tptp.out tptp.s (tptp.h1 tptp.f)) (tptp.in tptp.n2 (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s (tptp.h1 tptp.f)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1))) :rule resolution :premises (t521 a0))
% 3.89/4.11  (step t523 (cl (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) :rule resolution :premises (t184 t195 t514 t522))
% 3.89/4.11  (step t524 (cl (=> (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))) (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t525)
% 3.89/4.11  (assume t525.a0 (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))))
% 3.89/4.11  (step t525.t1 (cl (or (not (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2)))) (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule forall_inst :args ((:= P (tptp.in tptp.n2 (tptp.h2 tptp.f))) (:= V1 tptp.n0) (:= V2 tptp.n1)))
% 3.89/4.11  (step t525.t2 (cl (not (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2)))) (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule or :premises (t525.t1))
% 3.89/4.11  (step t525.t3 (cl (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule resolution :premises (t525.t2 t525.a0))
% 3.89/4.11  (step t525 (cl (not (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2)))) (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule subproof :discharge (t525.a0))
% 3.89/4.11  (step t526 (cl (=> (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))) (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule resolution :premises (t524 t525))
% 3.89/4.11  (step t527 (cl (=> (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))) (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) (not (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t528 (cl (=> (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))) (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) (=> (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))) (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule resolution :premises (t526 t527))
% 3.89/4.11  (step t529 (cl (=> (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))) (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule contraction :premises (t528))
% 3.89/4.11  (step t530 (cl (not (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2)))) (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule implies :premises (t529))
% 3.89/4.11  (step t531 (cl (or (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)) (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule resolution :premises (t530 a2))
% 3.89/4.11  (step t532 (cl (not (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0))) :rule resolution :premises (t182 a3 t523 t531))
% 3.89/4.11  (step t533 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t534)
% 3.89/4.11  (assume t534.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))))
% 3.89/4.11  (step t534.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)))) :rule forall_inst :args ((:= P1 (tptp.in tptp.n2 (tptp.h2 tptp.f))) (:= P2 (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f)))) (:= V tptp.n0)))
% 3.89/4.11  (step t534.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0))) :rule or :premises (t534.t1))
% 3.89/4.11  (step t534.t3 (cl (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0))) :rule resolution :premises (t534.t2 t534.a0))
% 3.89/4.11  (step t534 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0))) :rule subproof :discharge (t534.a0))
% 3.89/4.11  (step t535 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0))) :rule resolution :premises (t533 t534))
% 3.89/4.11  (step t536 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0))) (not (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)))) :rule implies_neg2)
% 3.89/4.11  (step t537 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)))) :rule resolution :premises (t535 t536))
% 3.89/4.11  (step t538 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0)))) :rule contraction :premises (t537))
% 3.89/4.11  (step t539 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0))) :rule implies :premises (t538))
% 3.89/4.11  (step t540 (cl (or (not (tptp.connection (tptp.in tptp.n2 (tptp.h2 tptp.f)) (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n2 (tptp.h2 tptp.f)) tptp.n0))) :rule resolution :premises (t539 a1))
% 3.89/4.11  (step t541 (cl (not (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule resolution :premises (t169 t180 t532 t540))
% 3.89/4.11  (step t542 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0) (tptp.value (tptp.in tptp.n2 K) tptp.n0))) (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0) (tptp.value (tptp.in tptp.n2 K) tptp.n0)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t543)
% 3.89/4.11  (assume t543.a0 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0) (tptp.value (tptp.in tptp.n2 K) tptp.n0))))
% 3.89/4.11  (step t543.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0) (tptp.value (tptp.in tptp.n2 K) tptp.n0)))) (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule forall_inst :args ((:= K (tptp.and2 (tptp.h2 tptp.f)))))
% 3.89/4.11  (step t543.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0) (tptp.value (tptp.in tptp.n2 K) tptp.n0)))) (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule or :premises (t543.t1))
% 3.89/4.11  (step t543.t3 (cl (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule resolution :premises (t543.t2 t543.a0))
% 3.89/4.11  (step t543 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0) (tptp.value (tptp.in tptp.n2 K) tptp.n0)))) (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule subproof :discharge (t543.a0))
% 3.89/4.11  (step t544 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0) (tptp.value (tptp.in tptp.n2 K) tptp.n0))) (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule resolution :premises (t542 t543))
% 3.89/4.11  (step t545 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0) (tptp.value (tptp.in tptp.n2 K) tptp.n0))) (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) (not (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule implies_neg2)
% 3.89/4.11  (step t546 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0) (tptp.value (tptp.in tptp.n2 K) tptp.n0))) (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0) (tptp.value (tptp.in tptp.n2 K) tptp.n0))) (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule resolution :premises (t544 t545))
% 3.89/4.11  (step t547 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0) (tptp.value (tptp.in tptp.n2 K) tptp.n0))) (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule contraction :premises (t546))
% 3.89/4.11  (step t548 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0) (tptp.value (tptp.in tptp.n2 K) tptp.n0)))) (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule implies :premises (t547))
% 3.89/4.11  (step t549 (cl (or (not (tptp.mode (tptp.and2 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and2 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0) (tptp.value (tptp.in tptp.n2 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule resolution :premises (t548 a9))
% 3.89/4.11  (step t550 (cl (not (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule resolution :premises (t90 t101 t112 t167 t541 t549))
% 3.89/4.11  (step t551 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t552)
% 3.89/4.11  (assume t552.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 3.89/4.11  (step t552.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.c (tptp.h2 tptp.f))) (:= P2 (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f)))) (:= V tptp.n0)))
% 3.89/4.11  (step t552.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule or :premises (t552.t1))
% 3.89/4.11  (step t552.t3 (cl (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule resolution :premises (t552.t2 t552.a0))
% 3.89/4.11  (step t552 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule subproof :discharge (t552.a0))
% 3.89/4.11  (step t553 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule resolution :premises (t551 t552))
% 3.89/4.11  (step t554 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) (not (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule implies_neg2)
% 3.89/4.11  (step t555 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule resolution :premises (t553 t554))
% 3.89/4.11  (step t556 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule contraction :premises (t555))
% 3.89/4.11  (step t557 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule implies :premises (t556))
% 3.89/4.11  (step t558 (cl (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0))) :rule resolution :premises (t557 a0))
% 3.89/4.11  (step t559 (cl (not (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0))) :rule resolution :premises (t77 t88 t550 t558))
% 3.89/4.11  (step t560 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t561)
% 3.89/4.11  (assume t561.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))))
% 3.89/4.11  (step t561.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.c (tptp.h2 tptp.f))) (:= P2 (tptp.in tptp.n1 (tptp.or1 tptp.f))) (:= V tptp.n0)))
% 3.89/4.11  (step t561.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0))) :rule or :premises (t561.t1))
% 3.89/4.11  (step t561.t3 (cl (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0))) :rule resolution :premises (t561.t2 t561.a0))
% 3.89/4.11  (step t561 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0))) :rule subproof :discharge (t561.a0))
% 3.89/4.11  (step t562 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0))) :rule resolution :premises (t560 t561))
% 3.89/4.11  (step t563 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0))) (not (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)))) :rule implies_neg2)
% 3.89/4.11  (step t564 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)))) :rule resolution :premises (t562 t563))
% 3.89/4.11  (step t565 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0)))) :rule contraction :premises (t564))
% 3.89/4.11  (step t566 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0))) :rule implies :premises (t565))
% 3.89/4.11  (step t567 (cl (or (not (tptp.connection (tptp.out tptp.c (tptp.h2 tptp.f)) (tptp.in tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.out tptp.c (tptp.h2 tptp.f)) tptp.n0))) :rule resolution :premises (t566 a1))
% 3.89/4.11  (step t568 (cl (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) :rule resolution :premises (t64 t75 t559 t567))
% 3.89/4.11  (step t569 (cl (not (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) :rule or_pos)
% 3.89/4.11  (step t570 (cl (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0) (not (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)))) :rule reordering :premises (t569))
% 3.89/4.11  (step t571 (cl (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f))))) (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) :rule or_pos)
% 3.89/4.11  (step t572 (cl (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))))) :rule reordering :premises (t571))
% 3.89/4.11  (step t573 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.or1 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t574)
% 3.89/4.11  (assume t574.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.or1 X))))))
% 3.89/4.11  (step t574.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.or1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))))) :rule forall_inst :args ((:= X tptp.f)))
% 3.89/4.11  (step t574.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.or1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f))))) :rule or :premises (t574.t1))
% 3.89/4.11  (step t574.t3 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f))))) :rule resolution :premises (t574.t2 t574.a0))
% 3.89/4.11  (step t574 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.or1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f))))) :rule subproof :discharge (t574.a0))
% 3.89/4.11  (step t575 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f))))) :rule resolution :premises (t573 t574))
% 3.89/4.11  (step t576 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f))))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))))) :rule implies_neg2)
% 3.89/4.11  (step t577 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))))) :rule resolution :premises (t575 t576))
% 3.89/4.11  (step t578 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))))) :rule contraction :premises (t577))
% 3.89/4.11  (step t579 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.c X) (tptp.out tptp.n1 (tptp.or1 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f))))) :rule implies :premises (t578))
% 3.89/4.11  (step t580 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f))))) :rule resolution :premises (t579 a44))
% 3.89/4.11  (step t581 (cl (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) :rule resolution :premises (t572 a45 t580))
% 3.89/4.11  (step t582 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t583)
% 3.89/4.11  (assume t583.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 3.89/4.11  (step t583.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.c tptp.f)) (:= P2 (tptp.out tptp.n1 (tptp.or1 tptp.f))) (:= V tptp.n0)))
% 3.89/4.11  (step t583.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) :rule or :premises (t583.t1))
% 3.89/4.11  (step t583.t3 (cl (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) :rule resolution :premises (t583.t2 t583.a0))
% 3.89/4.11  (step t583 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) :rule subproof :discharge (t583.a0))
% 3.89/4.11  (step t584 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) :rule resolution :premises (t582 t583))
% 3.89/4.11  (step t585 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) (not (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)))) :rule implies_neg2)
% 3.89/4.11  (step t586 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)))) :rule resolution :premises (t584 t585))
% 3.89/4.11  (step t587 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)))) :rule contraction :premises (t586))
% 3.89/4.11  (step t588 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) :rule implies :premises (t587))
% 3.89/4.11  (step t589 (cl (or (not (tptp.connection (tptp.out tptp.c tptp.f) (tptp.out tptp.n1 (tptp.or1 tptp.f)))) (not (tptp.value (tptp.out tptp.c tptp.f) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) :rule resolution :premises (t588 a0))
% 3.89/4.11  (step t590 (cl (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) :rule resolution :premises (t570 a50 t581 t589))
% 3.89/4.11  (step t591 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t592)
% 3.89/4.11  (assume t592.a0 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))))
% 3.89/4.11  (step t592.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0)))) (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)))) :rule forall_inst :args ((:= K (tptp.or1 tptp.f))))
% 3.89/4.11  (step t592.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0)))) (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) :rule or :premises (t592.t1))
% 3.89/4.11  (step t592.t3 (cl (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) :rule resolution :premises (t592.t2 t592.a0))
% 3.89/4.11  (step t592 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0)))) (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) :rule subproof :discharge (t592.a0))
% 3.89/4.11  (step t593 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) :rule resolution :premises (t591 t592))
% 3.89/4.11  (step t594 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) (not (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)))) :rule implies_neg2)
% 3.89/4.11  (step t595 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)))) :rule resolution :premises (t593 t594))
% 3.89/4.11  (step t596 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0)))) :rule contraction :premises (t595))
% 3.89/4.11  (step t597 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.or)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n0)) (tptp.value (tptp.in tptp.n1 K) tptp.n0)))) (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) :rule implies :premises (t596))
% 3.89/4.11  (step t598 (cl (or (not (tptp.mode (tptp.or1 tptp.f) tptp.ok)) (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.f)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.f)) tptp.n0))) :rule resolution :premises (t597 a15))
% 3.89/4.11  (step t599 (cl (not (tptp.mode (tptp.or1 tptp.f) tptp.ok))) :rule resolution :premises (t62 t60 t568 t590 t598))
% 3.89/4.11  (step t600 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal))) (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t601)
% 3.89/4.11  (assume t601.a0 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))))
% 3.89/4.11  (step t601.t1 (cl (or (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal)))) :rule forall_inst :args ((:= K (tptp.or1 tptp.f)) (:= Any tptp.or)))
% 3.89/4.11  (step t601.t2 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal))) :rule or :premises (t601.t1))
% 3.89/4.11  (step t601.t3 (cl (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal))) :rule resolution :premises (t601.t2 t601.a0))
% 3.89/4.11  (step t601 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal))) :rule subproof :discharge (t601.a0))
% 3.89/4.11  (step t602 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal))) (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal))) :rule resolution :premises (t600 t601))
% 3.89/4.11  (step t603 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal))) (not (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal)))) :rule implies_neg2)
% 3.89/4.11  (step t604 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal))) (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal)))) :rule resolution :premises (t602 t603))
% 3.89/4.11  (step t605 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal)))) :rule contraction :premises (t604))
% 3.89/4.11  (step t606 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal))) :rule implies :premises (t605))
% 3.89/4.11  (step t607 (cl (or (not (tptp.type (tptp.or1 tptp.f) tptp.or)) (tptp.mode (tptp.or1 tptp.f) tptp.ok) (tptp.mode (tptp.or1 tptp.f) tptp.abnormal))) :rule resolution :premises (t606 a6))
% 3.89/4.11  (step t608 (cl (tptp.mode (tptp.or1 tptp.f) tptp.abnormal)) :rule resolution :premises (t49 t60 t599 t607))
% 3.89/4.11  (step t609 (cl (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule resolution :premises (t47 t608))
% 3.89/4.11  (step t610 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal))) (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t611)
% 3.89/4.11  (assume t611.a0 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))))
% 3.89/4.11  (step t611.t1 (cl (or (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal)))) :rule forall_inst :args ((:= K (tptp.not1 (tptp.h2 tptp.f))) (:= Any tptp.not)))
% 3.89/4.11  (step t611.t2 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule or :premises (t611.t1))
% 3.89/4.11  (step t611.t3 (cl (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule resolution :premises (t611.t2 t611.a0))
% 3.89/4.11  (step t611 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule subproof :discharge (t611.a0))
% 3.89/4.11  (step t612 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal))) (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule resolution :premises (t610 t611))
% 3.89/4.11  (step t613 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal))) (not (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal)))) :rule implies_neg2)
% 3.89/4.11  (step t614 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal))) (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal)))) :rule resolution :premises (t612 t613))
% 3.89/4.11  (step t615 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal)))) :rule contraction :premises (t614))
% 3.89/4.11  (step t616 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule implies :premises (t615))
% 3.89/4.11  (step t617 (cl (or (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule resolution :premises (t616 a6))
% 3.89/4.11  (step t618 (cl (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) :rule resolution :premises (t46 t609 t44 t617))
% 3.89/4.11  (step t619 (cl (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1))) (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t620 (cl (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)))) :rule reordering :premises (t619))
% 3.89/4.11  (step t621 (cl (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f)))))) (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) :rule or_pos)
% 3.89/4.11  (step t622 (cl (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f)))) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))))) :rule reordering :premises (t621))
% 3.89/4.11  (step t623 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t624)
% 3.89/4.11  (assume t624.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X))))))
% 3.89/4.11  (step t624.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 3.89/4.11  (step t624.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule or :premises (t624.t1))
% 3.89/4.11  (step t624.t3 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t624.t2 t624.a0))
% 3.89/4.11  (step t624 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t624.a0))
% 3.89/4.11  (step t625 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t623 t624))
% 3.89/4.11  (step t626 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f)))))) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 3.89/4.11  (step t627 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))))) :rule resolution :premises (t625 t626))
% 3.89/4.11  (step t628 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))))) :rule contraction :premises (t627))
% 3.89/4.11  (step t629 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 X)) (tptp.in tptp.n2 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule implies :premises (t628))
% 3.89/4.11  (step t630 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t629 a33))
% 3.89/4.11  (step t631 (cl (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) :rule resolution :premises (t622 t22 t630))
% 3.89/4.11  (step t632 (cl (not (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t633 (cl (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (not (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)))) :rule reordering :premises (t632))
% 3.89/4.11  (step t634 (cl (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and))) (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) :rule or_pos)
% 3.89/4.11  (step t635 (cl (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)))) :rule reordering :premises (t634))
% 3.89/4.11  (step t636 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t637)
% 3.89/4.11  (assume t637.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))))
% 3.89/4.11  (step t637.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and)))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 3.89/4.11  (step t637.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and)))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and))) :rule or :premises (t637.t1))
% 3.89/4.11  (step t637.t3 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and))) :rule resolution :premises (t637.t2 t637.a0))
% 3.89/4.11  (step t637 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and)))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and))) :rule subproof :discharge (t637.a0))
% 3.89/4.11  (step t638 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and))) :rule resolution :premises (t636 t637))
% 3.89/4.11  (step t639 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and))) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)))) :rule implies_neg2)
% 3.89/4.11  (step t640 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)))) :rule resolution :premises (t638 t639))
% 3.89/4.11  (step t641 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)))) :rule contraction :premises (t640))
% 3.89/4.11  (step t642 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and)))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and))) :rule implies :premises (t641))
% 3.89/4.11  (step t643 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and))) :rule resolution :premises (t642 a21))
% 3.89/4.11  (step t644 (cl (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) :rule resolution :premises (t635 t22 t643))
% 3.89/4.11  (step t645 (cl (not (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal))) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal)) :rule or_pos)
% 3.89/4.11  (step t646 (cl (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (not (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal)))) :rule reordering :premises (t645))
% 3.89/4.11  (step t647 (cl (not (tptp.mode (tptp.or1 tptp.f) tptp.abnormal)) (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule or :premises (a53))
% 3.89/4.11  (step t648 (cl (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule resolution :premises (t647 t608))
% 3.89/4.11  (step t649 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal))) (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t650)
% 3.89/4.11  (assume t650.a0 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))))
% 3.89/4.11  (step t650.t1 (cl (or (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal)))) :rule forall_inst :args ((:= K (tptp.and1 (tptp.h2 tptp.f))) (:= Any tptp.and)))
% 3.89/4.11  (step t650.t2 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule or :premises (t650.t1))
% 3.89/4.11  (step t650.t3 (cl (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule resolution :premises (t650.t2 t650.a0))
% 3.89/4.11  (step t650 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule subproof :discharge (t650.a0))
% 3.89/4.11  (step t651 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal))) (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule resolution :premises (t649 t650))
% 3.89/4.11  (step t652 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal))) (not (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal)))) :rule implies_neg2)
% 3.89/4.11  (step t653 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal))) (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal)))) :rule resolution :premises (t651 t652))
% 3.89/4.11  (step t654 (cl (=> (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))) (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal)))) :rule contraction :premises (t653))
% 3.89/4.11  (step t655 (cl (not (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal)))) (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule implies :premises (t654))
% 3.89/4.11  (step t656 (cl (or (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok) (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.abnormal))) :rule resolution :premises (t655 a6))
% 3.89/4.11  (step t657 (cl (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) :rule resolution :premises (t646 t648 t644 t656))
% 3.89/4.11  (step t658 (cl (not (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t659 (cl (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (not (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)))) :rule reordering :premises (t658))
% 3.89/4.11  (step t660 (cl (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f)))))) (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) :rule or_pos)
% 3.89/4.11  (step t661 (cl (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f)))) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))))) :rule reordering :premises (t660))
% 3.89/4.11  (step t662 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f)))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t663)
% 3.89/4.11  (assume t663.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X))))))
% 3.89/4.11  (step t663.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))))) :rule forall_inst :args ((:= X (tptp.h2 tptp.f))))
% 3.89/4.11  (step t663.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule or :premises (t663.t1))
% 3.89/4.11  (step t663.t3 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t663.t2 t663.a0))
% 3.89/4.11  (step t663 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule subproof :discharge (t663.a0))
% 3.89/4.11  (step t664 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t662 t663))
% 3.89/4.11  (step t665 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f)))))) (not (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))))) :rule implies_neg2)
% 3.89/4.11  (step t666 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f)))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))))) :rule resolution :premises (t664 t665))
% 3.89/4.11  (step t667 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))))) :rule contraction :premises (t666))
% 3.89/4.11  (step t668 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.n1 (tptp.and1 X)))))) (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule implies :premises (t667))
% 3.89/4.11  (step t669 (cl (or (not (tptp.type (tptp.h2 tptp.f) tptp.halfadder)) (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f)))))) :rule resolution :premises (t668 a29))
% 3.89/4.11  (step t670 (cl (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) :rule resolution :premises (t661 t22 t669))
% 3.89/4.11  (step t671 (cl (not (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1))) (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) :rule or_pos)
% 3.89/4.11  (step t672 (cl (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1) (not (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)))) :rule reordering :premises (t671))
% 3.89/4.11  (step t673 (cl (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f))))) (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) :rule or_pos)
% 3.89/4.11  (step t674 (cl (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))))) :rule reordering :premises (t673))
% 3.89/4.11  (step t675 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.s (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.s (tptp.h2 X)))))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t676)
% 3.89/4.11  (assume t676.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.s (tptp.h2 X))))))
% 3.89/4.11  (step t676.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.s (tptp.h2 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))))) :rule forall_inst :args ((:= X tptp.f)))
% 3.89/4.11  (step t676.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.s (tptp.h2 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f))))) :rule or :premises (t676.t1))
% 3.89/4.11  (step t676.t3 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f))))) :rule resolution :premises (t676.t2 t676.a0))
% 3.89/4.11  (step t676 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.s (tptp.h2 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f))))) :rule subproof :discharge (t676.a0))
% 3.89/4.11  (step t677 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.s (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f))))) :rule resolution :premises (t675 t676))
% 3.89/4.11  (step t678 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.s (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f))))) (not (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))))) :rule implies_neg2)
% 3.89/4.11  (step t679 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.s (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.s (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))))) :rule resolution :premises (t677 t678))
% 3.89/4.11  (step t680 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.s (tptp.h2 X))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))))) :rule contraction :premises (t679))
% 3.89/4.11  (step t681 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.fulladder)) (tptp.connection (tptp.out tptp.s X) (tptp.out tptp.s (tptp.h2 X)))))) (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f))))) :rule implies :premises (t680))
% 3.89/4.11  (step t682 (cl (or (not (tptp.type tptp.f tptp.fulladder)) (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f))))) :rule resolution :premises (t681 a43))
% 3.89/4.11  (step t683 (cl (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) :rule resolution :premises (t674 a45 t682))
% 3.89/4.11  (step t684 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t685)
% 3.89/4.11  (assume t685.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 3.89/4.11  (step t685.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.s tptp.f)) (:= P2 (tptp.out tptp.s (tptp.h2 tptp.f))) (:= V tptp.n1)))
% 3.89/4.11  (step t685.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1))) :rule or :premises (t685.t1))
% 3.89/4.11  (step t685.t3 (cl (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1))) :rule resolution :premises (t685.t2 t685.a0))
% 3.89/4.11  (step t685 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1))) :rule subproof :discharge (t685.a0))
% 3.89/4.11  (step t686 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1))) (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1))) :rule resolution :premises (t684 t685))
% 3.89/4.11  (step t687 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1))) (not (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t688 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)))) :rule resolution :premises (t686 t687))
% 3.89/4.11  (step t689 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)))) :rule contraction :premises (t688))
% 3.89/4.11  (step t690 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1))) :rule implies :premises (t689))
% 3.89/4.11  (step t691 (cl (or (not (tptp.connection (tptp.out tptp.s tptp.f) (tptp.out tptp.s (tptp.h2 tptp.f)))) (not (tptp.value (tptp.out tptp.s tptp.f) tptp.n1)) (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1))) :rule resolution :premises (t690 a0))
% 3.89/4.11  (step t692 (cl (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) :rule resolution :premises (t672 a49 t683 t691))
% 3.89/4.11  (step t693 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t694)
% 3.89/4.11  (assume t694.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 3.89/4.11  (step t694.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.s (tptp.h2 tptp.f))) (:= P2 (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f)))) (:= V tptp.n1)))
% 3.89/4.11  (step t694.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) :rule or :premises (t694.t1))
% 3.89/4.11  (step t694.t3 (cl (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) :rule resolution :premises (t694.t2 t694.a0))
% 3.89/4.11  (step t694 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) :rule subproof :discharge (t694.a0))
% 3.89/4.11  (step t695 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) :rule resolution :premises (t693 t694))
% 3.89/4.11  (step t696 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) (not (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t697 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)))) :rule resolution :premises (t695 t696))
% 3.89/4.11  (step t698 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)))) :rule contraction :premises (t697))
% 3.89/4.11  (step t699 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V)))) (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) :rule implies :premises (t698))
% 3.89/4.11  (step t700 (cl (or (not (tptp.connection (tptp.out tptp.s (tptp.h2 tptp.f)) (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.out tptp.s (tptp.h2 tptp.f)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) :rule resolution :premises (t699 a0))
% 3.89/4.11  (step t701 (cl (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) :rule resolution :premises (t659 t670 t692 t700))
% 3.89/4.11  (step t702 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n2 K) tptp.n1))) (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n2 K) tptp.n1)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t703)
% 3.89/4.11  (assume t703.a0 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n2 K) tptp.n1))))
% 3.89/4.11  (step t703.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n2 K) tptp.n1)))) (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)))) :rule forall_inst :args ((:= K (tptp.and1 (tptp.h2 tptp.f)))))
% 3.89/4.11  (step t703.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n2 K) tptp.n1)))) (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) :rule or :premises (t703.t1))
% 3.89/4.11  (step t703.t3 (cl (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) :rule resolution :premises (t703.t2 t703.a0))
% 3.89/4.11  (step t703 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n2 K) tptp.n1)))) (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) :rule subproof :discharge (t703.a0))
% 3.89/4.11  (step t704 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n2 K) tptp.n1))) (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) :rule resolution :premises (t702 t703))
% 3.89/4.11  (step t705 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n2 K) tptp.n1))) (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) (not (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t706 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n2 K) tptp.n1))) (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n2 K) tptp.n1))) (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)))) :rule resolution :premises (t704 t705))
% 3.89/4.11  (step t707 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n2 K) tptp.n1))) (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)))) :rule contraction :premises (t706))
% 3.89/4.11  (step t708 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.and)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n2 K) tptp.n1)))) (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) :rule implies :premises (t707))
% 3.89/4.11  (step t709 (cl (or (not (tptp.mode (tptp.and1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.and1 (tptp.h2 tptp.f)) tptp.and)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1))) :rule resolution :premises (t708 a11))
% 3.89/4.11  (step t710 (cl (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) :rule resolution :premises (t633 t644 t657 t701 t709))
% 3.89/4.11  (step t711 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1))) (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t712)
% 3.89/4.11  (assume t712.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))))
% 3.89/4.11  (step t712.t1 (cl (or (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f)))) (:= P2 (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f)))) (:= V tptp.n1)))
% 3.89/4.11  (step t712.t2 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1))) :rule or :premises (t712.t1))
% 3.89/4.11  (step t712.t3 (cl (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1))) :rule resolution :premises (t712.t2 t712.a0))
% 3.89/4.11  (step t712 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1))) :rule subproof :discharge (t712.a0))
% 3.89/4.11  (step t713 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1))) :rule resolution :premises (t711 t712))
% 3.89/4.11  (step t714 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1))) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)))) :rule implies_neg2)
% 3.89/4.11  (step t715 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1))) (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)))) :rule resolution :premises (t713 t714))
% 3.89/4.11  (step t716 (cl (=> (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)))) :rule contraction :premises (t715))
% 3.89/4.11  (step t717 (cl (not (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V)))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1))) :rule implies :premises (t716))
% 3.89/4.11  (step t718 (cl (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1))) :rule resolution :premises (t717 a1))
% 3.89/4.11  (step t719 (cl (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) :rule resolution :premises (t620 t631 t710 t718))
% 3.89/4.11  (step t720 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0))) (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n1 K) tptp.n0)))) :rule implies_neg1)
% 3.89/4.11  (anchor :step t721)
% 3.89/4.11  (assume t721.a0 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))))
% 3.89/4.11  (step t721.t1 (cl (or (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n1 K) tptp.n0)))) (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)))) :rule forall_inst :args ((:= K (tptp.not1 (tptp.h2 tptp.f)))))
% 3.89/4.11  (step t721.t2 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n1 K) tptp.n0)))) (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0))) :rule or :premises (t721.t1))
% 3.89/4.11  (step t721.t3 (cl (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0))) :rule resolution :premises (t721.t2 t721.a0))
% 3.89/4.11  (step t721 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n1 K) tptp.n0)))) (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0))) :rule subproof :discharge (t721.a0))
% 3.89/4.11  (step t722 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0))) (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0))) :rule resolution :premises (t720 t721))
% 3.89/4.11  (step t723 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0))) (not (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)))) :rule implies_neg2)
% 3.89/4.11  (step t724 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0))) (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)))) :rule resolution :premises (t722 t723))
% 3.89/4.11  (step t725 (cl (=> (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n1 K) tptp.n0))) (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)))) :rule contraction :premises (t724))
% 3.89/4.11  (step t726 (cl (not (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.type K tptp.not)) (not (tptp.value (tptp.out tptp.n1 K) tptp.n1)) (tptp.value (tptp.in tptp.n1 K) tptp.n0)))) (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0))) :rule implies :premises (t725))
% 3.89/4.11  (step t727 (cl (or (not (tptp.mode (tptp.not1 (tptp.h2 tptp.f)) tptp.ok)) (not (tptp.type (tptp.not1 (tptp.h2 tptp.f)) tptp.not)) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0))) :rule resolution :premises (t726 a20))
% 3.89/4.11  (step t728 (cl (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) :rule resolution :premises (t33 t44 t618 t719 t727))
% 3.89/4.11  (step t729 (cl (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))))) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 (tptp.h2 tptp.f))) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 (tptp.h2 tptp.f))) tptp.n0)))) :rule resolution :premises (t9 t31 t728 t550))
% 3.89/4.11  (step t730 (cl) :rule resolution :premises (t7 t729 a1))
% 3.89/4.11  
% 3.89/4.11  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.4gWheEOKKC/cvc5---1.0.5_28447.smt2
% 3.89/4.12  % cvc5---1.0.5 exiting
% 3.89/4.12  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------