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

% Computer : n023.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May 29 17:09:50 EDT 2024

% Result   : Unsatisfiable 0.42s 0.60s
% Output   : Proof 0.44s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : HWV005-1 : TPTP v8.2.0. Released v2.1.0.
% 0.07/0.15  % Command    : do_cvc5 %s %d
% 0.15/0.36  % Computer : n023.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon May 27 02:54:24 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.22/0.52  %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.52  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.42/0.60  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.Aw7YHUP7up/cvc5---1.0.5_22320.smt2
% 0.42/0.60  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.Aw7YHUP7up/cvc5---1.0.5_22320.smt2
% 0.44/0.63  (assume a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 0.44/0.63  (assume a1 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P2 V)) (tptp.value P1 V))))
% 0.44/0.63  (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))))
% 0.44/0.63  (assume a3 (not (tptp.equal_value tptp.n0 tptp.n1)))
% 0.44/0.63  (assume a4 (not (tptp.equal_value tptp.n1 tptp.n0)))
% 0.44/0.63  (assume a5 (forall ((K $$unsorted)) (or (not (tptp.mode K tptp.ok)) (not (tptp.mode K tptp.abnormal)))))
% 0.44/0.63  (assume a6 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))))
% 0.44/0.63  (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))))
% 0.44/0.63  (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))))
% 0.44/0.63  (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))))
% 0.44/0.63  (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))))
% 0.44/0.63  (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))))
% 0.44/0.63  (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))))
% 0.44/0.63  (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))))
% 0.44/0.63  (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))))
% 0.44/0.63  (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))))
% 0.44/0.63  (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))))
% 0.44/0.63  (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))))
% 0.44/0.63  (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))))
% 0.44/0.63  (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))))
% 0.44/0.63  (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))))
% 0.44/0.63  (assume a21 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))))
% 0.44/0.63  (assume a22 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and2 X) tptp.and))))
% 0.44/0.63  (assume a23 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))))
% 0.44/0.63  (assume a24 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))))
% 0.44/0.63  (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))))))
% 0.44/0.63  (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))))))
% 0.44/0.63  (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))))))
% 0.44/0.63  (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))))))
% 0.44/0.63  (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))))))
% 0.44/0.63  (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))))))
% 0.44/0.63  (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))))))
% 0.44/0.63  (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))))))
% 0.44/0.63  (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))))))
% 0.44/0.63  (assume a34 (tptp.type tptp.h tptp.halfadder))
% 0.44/0.63  (assume a35 (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1))
% 0.44/0.63  (assume a36 (tptp.value (tptp.in tptp.n2 tptp.h) tptp.n0))
% 0.44/0.63  (assume a37 (tptp.value (tptp.out tptp.s tptp.h) tptp.n0))
% 0.44/0.63  (assume a38 (tptp.value (tptp.out tptp.c tptp.h) tptp.n0))
% 0.44/0.63  (assume a39 (not (tptp.mode (tptp.and1 tptp.h) tptp.abnormal)))
% 0.44/0.63  (assume a40 (not (tptp.mode (tptp.not1 tptp.h) tptp.abnormal)))
% 0.44/0.63  (assume a41 (not (tptp.mode (tptp.or1 tptp.h) tptp.abnormal)))
% 0.44/0.63  (step t1 (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.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) 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)
% 0.44/0.63  (anchor :step t2)
% 0.44/0.63  (assume t2.a0 (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (or (not (tptp.value P V1)) (not (tptp.value P V2)) (tptp.equal_value V1 V2))))
% 0.44/0.63  (step t2.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.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule forall_inst :args ((:= P (tptp.out tptp.n1 (tptp.and1 tptp.h))) (:= V1 tptp.n0) (:= V2 tptp.n1)))
% 0.44/0.63  (step t2.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.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule or :premises (t2.t1))
% 0.44/0.63  (step t2.t3 (cl (or (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule resolution :premises (t2.t2 t2.a0))
% 0.44/0.63  (step 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.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule subproof :discharge (t2.a0))
% 0.44/0.63  (step t3 (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.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) (or (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule resolution :premises (t1 t2))
% 0.44/0.63  (step t4 (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.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) (not (or (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule implies_neg2)
% 0.44/0.63  (step t5 (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.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) 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.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule resolution :premises (t3 t4))
% 0.44/0.63  (step t6 (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.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule contraction :premises (t5))
% 0.44/0.63  (step t7 (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.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) :rule implies :premises (t6))
% 0.44/0.63  (step t8 (cl (not (or (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1))) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)) :rule or_pos)
% 0.44/0.63  (step t9 (cl (tptp.equal_value tptp.n0 tptp.n1) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (or (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule reordering :premises (t8))
% 0.44/0.63  (step t10 (cl (not (or (not (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0))) (not (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) :rule or_pos)
% 0.44/0.63  (step t11 (cl (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (not (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0) (not (or (not (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)))) :rule reordering :premises (t10))
% 0.44/0.63  (step t12 (cl (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h))))) (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) :rule or_pos)
% 0.44/0.63  (step t13 (cl (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h))) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))))) :rule reordering :premises (t12))
% 0.44/0.63  (step t14 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h))))) (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)
% 0.44/0.63  (anchor :step t15)
% 0.44/0.63  (assume t15.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))))))
% 0.44/0.63  (step t15.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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))))) :rule forall_inst :args ((:= X tptp.h)))
% 0.44/0.63  (step t15.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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h))))) :rule or :premises (t15.t1))
% 0.44/0.63  (step t15.t3 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h))))) :rule resolution :premises (t15.t2 t15.a0))
% 0.44/0.63  (step t15 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h))))) :rule subproof :discharge (t15.a0))
% 0.44/0.63  (step t16 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h))))) :rule resolution :premises (t14 t15))
% 0.44/0.63  (step t17 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h))))) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))))) :rule implies_neg2)
% 0.44/0.63  (step t18 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h))))) (=> (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))))) :rule resolution :premises (t16 t17))
% 0.44/0.63  (step t19 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))))) :rule contraction :premises (t18))
% 0.44/0.63  (step t20 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h))))) :rule implies :premises (t19))
% 0.44/0.63  (step t21 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h))))) :rule resolution :premises (t20 a29))
% 0.44/0.63  (step t22 (cl (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) :rule resolution :premises (t13 a34 t21))
% 0.44/0.63  (step t23 (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.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) 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)
% 0.44/0.63  (anchor :step t24)
% 0.44/0.63  (assume t24.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 0.44/0.63  (step t24.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.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.s tptp.h)) (:= P2 (tptp.out tptp.n1 (tptp.and1 tptp.h))) (:= V tptp.n0)))
% 0.44/0.63  (step t24.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.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0))) :rule or :premises (t24.t1))
% 0.44/0.63  (step t24.t3 (cl (or (not (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0))) :rule resolution :premises (t24.t2 t24.a0))
% 0.44/0.63  (step t24 (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.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0))) :rule subproof :discharge (t24.a0))
% 0.44/0.63  (step t25 (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.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0))) (or (not (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0))) :rule resolution :premises (t23 t24))
% 0.44/0.63  (step t26 (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.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0))) (not (or (not (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)))) :rule implies_neg2)
% 0.44/0.63  (step t27 (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.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) 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.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)))) :rule resolution :premises (t25 t26))
% 0.44/0.63  (step t28 (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.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)))) :rule contraction :premises (t27))
% 0.44/0.63  (step t29 (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.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0))) :rule implies :premises (t28))
% 0.44/0.63  (step t30 (cl (or (not (tptp.connection (tptp.out tptp.s tptp.h) (tptp.out tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.s tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0))) :rule resolution :premises (t29 a0))
% 0.44/0.63  (step t31 (cl (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) :rule resolution :premises (t11 a37 t22 t30))
% 0.44/0.63  (step t32 (cl (not (or (not (tptp.mode (tptp.and1 tptp.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) (not (tptp.mode (tptp.and1 tptp.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) :rule or_pos)
% 0.44/0.63  (step t33 (cl (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.mode (tptp.and1 tptp.h) tptp.ok)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1) (not (or (not (tptp.mode (tptp.and1 tptp.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)))) :rule reordering :premises (t32))
% 0.44/0.63  (step t34 (cl (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and))) (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and)) :rule or_pos)
% 0.44/0.63  (step t35 (cl (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and)))) :rule reordering :premises (t34))
% 0.44/0.63  (step t36 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and)))) :rule implies_neg1)
% 0.44/0.63  (anchor :step t37)
% 0.44/0.63  (assume t37.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))))
% 0.44/0.63  (step t37.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.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and)))) :rule forall_inst :args ((:= X tptp.h)))
% 0.44/0.63  (step t37.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.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and))) :rule or :premises (t37.t1))
% 0.44/0.63  (step t37.t3 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and))) :rule resolution :premises (t37.t2 t37.a0))
% 0.44/0.63  (step t37 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and)))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and))) :rule subproof :discharge (t37.a0))
% 0.44/0.63  (step t38 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and))) :rule resolution :premises (t36 t37))
% 0.44/0.63  (step t39 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and))) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and)))) :rule implies_neg2)
% 0.44/0.63  (step t40 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and)))) :rule resolution :premises (t38 t39))
% 0.44/0.63  (step t41 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and)))) :rule contraction :premises (t40))
% 0.44/0.63  (step t42 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.and1 X) tptp.and)))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and))) :rule implies :premises (t41))
% 0.44/0.63  (step t43 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.and1 tptp.h) tptp.and))) :rule resolution :premises (t42 a21))
% 0.44/0.63  (step t44 (cl (tptp.type (tptp.and1 tptp.h) tptp.and)) :rule resolution :premises (t35 a34 t43))
% 0.44/0.63  (step t45 (cl (not (or (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) tptp.abnormal))) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) tptp.abnormal)) :rule or_pos)
% 0.44/0.63  (step t46 (cl (tptp.mode (tptp.and1 tptp.h) tptp.abnormal) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (not (or (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) tptp.abnormal)))) :rule reordering :premises (t45))
% 0.44/0.63  (step t47 (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.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) 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)
% 0.44/0.63  (anchor :step t48)
% 0.44/0.63  (assume t48.a0 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))))
% 0.44/0.63  (step t48.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.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) tptp.abnormal)))) :rule forall_inst :args ((:= K (tptp.and1 tptp.h)) (:= Any tptp.and)))
% 0.44/0.63  (step t48.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.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) tptp.abnormal))) :rule or :premises (t48.t1))
% 0.44/0.63  (step t48.t3 (cl (or (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) tptp.abnormal))) :rule resolution :premises (t48.t2 t48.a0))
% 0.44/0.63  (step t48 (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.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) tptp.abnormal))) :rule subproof :discharge (t48.a0))
% 0.44/0.63  (step t49 (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.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) tptp.abnormal))) (or (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) tptp.abnormal))) :rule resolution :premises (t47 t48))
% 0.44/0.63  (step t50 (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.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) tptp.abnormal))) (not (or (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) tptp.abnormal)))) :rule implies_neg2)
% 0.44/0.63  (step t51 (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.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) 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.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) tptp.abnormal)))) :rule resolution :premises (t49 t50))
% 0.44/0.63  (step t52 (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.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) tptp.abnormal)))) :rule contraction :premises (t51))
% 0.44/0.63  (step t53 (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.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) tptp.abnormal))) :rule implies :premises (t52))
% 0.44/0.63  (step t54 (cl (or (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (tptp.mode (tptp.and1 tptp.h) tptp.ok) (tptp.mode (tptp.and1 tptp.h) tptp.abnormal))) :rule resolution :premises (t53 a6))
% 0.44/0.63  (step t55 (cl (tptp.mode (tptp.and1 tptp.h) tptp.ok)) :rule resolution :premises (t46 a39 t44 t54))
% 0.44/0.63  (step t56 (cl (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) :rule or_pos)
% 0.44/0.63  (step t57 (cl (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)))) :rule reordering :premises (t56))
% 0.44/0.63  (step t58 (cl (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h))))) (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) :rule or_pos)
% 0.44/0.63  (step t59 (cl (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h))) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))))) :rule reordering :premises (t58))
% 0.44/0.63  (step t60 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h))))) (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)
% 0.44/0.63  (anchor :step t61)
% 0.44/0.63  (assume t61.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))))))
% 0.44/0.63  (step t61.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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))))) :rule forall_inst :args ((:= X tptp.h)))
% 0.44/0.63  (step t61.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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h))))) :rule or :premises (t61.t1))
% 0.44/0.63  (step t61.t3 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h))))) :rule resolution :premises (t61.t2 t61.a0))
% 0.44/0.63  (step t61 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h))))) :rule subproof :discharge (t61.a0))
% 0.44/0.63  (step t62 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h))))) :rule resolution :premises (t60 t61))
% 0.44/0.63  (step t63 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h))))) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))))) :rule implies_neg2)
% 0.44/0.63  (step t64 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h))))) (=> (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))))) :rule resolution :premises (t62 t63))
% 0.44/0.63  (step t65 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))))) :rule contraction :premises (t64))
% 0.44/0.63  (step t66 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h))))) :rule implies :premises (t65))
% 0.44/0.63  (step t67 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h))))) :rule resolution :premises (t66 a31))
% 0.44/0.63  (step t68 (cl (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) :rule resolution :premises (t59 a34 t67))
% 0.44/0.63  (step t69 (cl (not (or (not (tptp.mode (tptp.or1 tptp.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) (not (tptp.mode (tptp.or1 tptp.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) :rule or_pos)
% 0.44/0.63  (step t70 (cl (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.mode (tptp.or1 tptp.h) tptp.ok)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1) (not (or (not (tptp.mode (tptp.or1 tptp.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)))) :rule reordering :premises (t69))
% 0.44/0.63  (step t71 (cl (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or))) (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or)) :rule or_pos)
% 0.44/0.63  (step t72 (cl (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or)))) :rule reordering :premises (t71))
% 0.44/0.63  (step t73 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or)))) :rule implies_neg1)
% 0.44/0.63  (anchor :step t74)
% 0.44/0.63  (assume t74.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))))
% 0.44/0.63  (step t74.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.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or)))) :rule forall_inst :args ((:= X tptp.h)))
% 0.44/0.63  (step t74.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.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or))) :rule or :premises (t74.t1))
% 0.44/0.63  (step t74.t3 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or))) :rule resolution :premises (t74.t2 t74.a0))
% 0.44/0.63  (step t74 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or)))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or))) :rule subproof :discharge (t74.a0))
% 0.44/0.63  (step t75 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or))) :rule resolution :premises (t73 t74))
% 0.44/0.63  (step t76 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or))) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or)))) :rule implies_neg2)
% 0.44/0.63  (step t77 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or)))) :rule resolution :premises (t75 t76))
% 0.44/0.63  (step t78 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or)))) :rule contraction :premises (t77))
% 0.44/0.63  (step t79 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.or1 X) tptp.or)))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or))) :rule implies :premises (t78))
% 0.44/0.63  (step t80 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.or1 tptp.h) tptp.or))) :rule resolution :premises (t79 a24))
% 0.44/0.63  (step t81 (cl (tptp.type (tptp.or1 tptp.h) tptp.or)) :rule resolution :premises (t72 a34 t80))
% 0.44/0.63  (step t82 (cl (not (or (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) tptp.abnormal))) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) tptp.abnormal)) :rule or_pos)
% 0.44/0.63  (step t83 (cl (tptp.mode (tptp.or1 tptp.h) tptp.abnormal) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (not (or (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) tptp.abnormal)))) :rule reordering :premises (t82))
% 0.44/0.63  (step t84 (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.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) 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)
% 0.44/0.63  (anchor :step t85)
% 0.44/0.63  (assume t85.a0 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))))
% 0.44/0.63  (step t85.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.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) tptp.abnormal)))) :rule forall_inst :args ((:= K (tptp.or1 tptp.h)) (:= Any tptp.or)))
% 0.44/0.63  (step t85.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.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) tptp.abnormal))) :rule or :premises (t85.t1))
% 0.44/0.63  (step t85.t3 (cl (or (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) tptp.abnormal))) :rule resolution :premises (t85.t2 t85.a0))
% 0.44/0.63  (step t85 (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.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) tptp.abnormal))) :rule subproof :discharge (t85.a0))
% 0.44/0.63  (step t86 (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.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) tptp.abnormal))) (or (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) tptp.abnormal))) :rule resolution :premises (t84 t85))
% 0.44/0.63  (step t87 (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.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) tptp.abnormal))) (not (or (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) tptp.abnormal)))) :rule implies_neg2)
% 0.44/0.63  (step t88 (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.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) 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.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) tptp.abnormal)))) :rule resolution :premises (t86 t87))
% 0.44/0.63  (step t89 (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.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) tptp.abnormal)))) :rule contraction :premises (t88))
% 0.44/0.63  (step t90 (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.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) tptp.abnormal))) :rule implies :premises (t89))
% 0.44/0.63  (step t91 (cl (or (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (tptp.mode (tptp.or1 tptp.h) tptp.ok) (tptp.mode (tptp.or1 tptp.h) tptp.abnormal))) :rule resolution :premises (t90 a6))
% 0.44/0.63  (step t92 (cl (tptp.mode (tptp.or1 tptp.h) tptp.ok)) :rule resolution :premises (t83 a41 t81 t91))
% 0.44/0.63  (step t93 (cl (not (or (not (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) (not (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) :rule or_pos)
% 0.44/0.63  (step t94 (cl (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (not (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1) (not (or (not (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)))) :rule reordering :premises (t93))
% 0.44/0.63  (step t95 (cl (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h))))) (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) :rule or_pos)
% 0.44/0.63  (step t96 (cl (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h))) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))))) :rule reordering :premises (t95))
% 0.44/0.63  (step t97 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h))))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.or1 X)))))) :rule implies_neg1)
% 0.44/0.63  (anchor :step t98)
% 0.44/0.63  (assume t98.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.or1 X))))))
% 0.44/0.63  (step t98.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.or1 X)))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))))) :rule forall_inst :args ((:= X tptp.h)))
% 0.44/0.63  (step t98.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.or1 X)))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h))))) :rule or :premises (t98.t1))
% 0.44/0.63  (step t98.t3 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h))))) :rule resolution :premises (t98.t2 t98.a0))
% 0.44/0.63  (step t98 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.or1 X)))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h))))) :rule subproof :discharge (t98.a0))
% 0.44/0.63  (step t99 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h))))) :rule resolution :premises (t97 t98))
% 0.44/0.63  (step t100 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h))))) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))))) :rule implies_neg2)
% 0.44/0.63  (step t101 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h))))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))))) :rule resolution :premises (t99 t100))
% 0.44/0.63  (step t102 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.or1 X))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))))) :rule contraction :premises (t101))
% 0.44/0.63  (step t103 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 X) (tptp.in tptp.n1 (tptp.or1 X)))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h))))) :rule implies :premises (t102))
% 0.44/0.63  (step t104 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h))))) :rule resolution :premises (t103 a25))
% 0.44/0.63  (step t105 (cl (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) :rule resolution :premises (t96 a34 t104))
% 0.44/0.63  (step t106 (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.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) 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)
% 0.44/0.63  (anchor :step t107)
% 0.44/0.63  (assume t107.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 0.44/0.63  (step t107.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.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)))) :rule forall_inst :args ((:= P1 (tptp.in tptp.n1 tptp.h)) (:= P2 (tptp.in tptp.n1 (tptp.or1 tptp.h))) (:= V tptp.n1)))
% 0.44/0.63  (step t107.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.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) :rule or :premises (t107.t1))
% 0.44/0.63  (step t107.t3 (cl (or (not (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) :rule resolution :premises (t107.t2 t107.a0))
% 0.44/0.63  (step t107 (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.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) :rule subproof :discharge (t107.a0))
% 0.44/0.63  (step t108 (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.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) (or (not (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) :rule resolution :premises (t106 t107))
% 0.44/0.63  (step t109 (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.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) (not (or (not (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)))) :rule implies_neg2)
% 0.44/0.63  (step t110 (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.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) 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.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)))) :rule resolution :premises (t108 t109))
% 0.44/0.63  (step t111 (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.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)))) :rule contraction :premises (t110))
% 0.44/0.63  (step t112 (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.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) :rule implies :premises (t111))
% 0.44/0.63  (step t113 (cl (or (not (tptp.connection (tptp.in tptp.n1 tptp.h) (tptp.in tptp.n1 (tptp.or1 tptp.h)))) (not (tptp.value (tptp.in tptp.n1 tptp.h) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) :rule resolution :premises (t112 a0))
% 0.44/0.63  (step t114 (cl (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) :rule resolution :premises (t94 a35 t105 t113))
% 0.44/0.63  (step t115 (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.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) 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)
% 0.44/0.63  (anchor :step t116)
% 0.44/0.63  (assume t116.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))))
% 0.44/0.63  (step t116.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.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)))) :rule forall_inst :args ((:= K (tptp.or1 tptp.h)) (:= Any tptp.n1)))
% 0.44/0.63  (step t116.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.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) :rule or :premises (t116.t1))
% 0.44/0.63  (step t116.t3 (cl (or (not (tptp.mode (tptp.or1 tptp.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) :rule resolution :premises (t116.t2 t116.a0))
% 0.44/0.63  (step t116 (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.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) :rule subproof :discharge (t116.a0))
% 0.44/0.63  (step t117 (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.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) (or (not (tptp.mode (tptp.or1 tptp.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) :rule resolution :premises (t115 t116))
% 0.44/0.63  (step t118 (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.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) (not (or (not (tptp.mode (tptp.or1 tptp.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)))) :rule implies_neg2)
% 0.44/0.63  (step t119 (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.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) 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.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)))) :rule resolution :premises (t117 t118))
% 0.44/0.63  (step t120 (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.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)))) :rule contraction :premises (t119))
% 0.44/0.63  (step t121 (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.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) :rule implies :premises (t120))
% 0.44/0.63  (step t122 (cl (or (not (tptp.mode (tptp.or1 tptp.h) tptp.ok)) (not (tptp.type (tptp.or1 tptp.h) tptp.or)) (not (tptp.value (tptp.in tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1))) :rule resolution :premises (t121 a12))
% 0.44/0.63  (step t123 (cl (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) :rule resolution :premises (t70 t81 t92 t114 t122))
% 0.44/0.63  (step t124 (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.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) 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)
% 0.44/0.63  (anchor :step t125)
% 0.44/0.63  (assume t125.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 0.44/0.63  (step t125.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.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.n1 (tptp.or1 tptp.h))) (:= P2 (tptp.in tptp.n1 (tptp.and1 tptp.h))) (:= V tptp.n1)))
% 0.44/0.63  (step t125.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.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) :rule or :premises (t125.t1))
% 0.44/0.63  (step t125.t3 (cl (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) :rule resolution :premises (t125.t2 t125.a0))
% 0.44/0.63  (step t125 (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.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) :rule subproof :discharge (t125.a0))
% 0.44/0.63  (step t126 (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.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) :rule resolution :premises (t124 t125))
% 0.44/0.63  (step t127 (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.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)))) :rule implies_neg2)
% 0.44/0.63  (step t128 (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.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) 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.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)))) :rule resolution :premises (t126 t127))
% 0.44/0.63  (step t129 (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.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)))) :rule contraction :premises (t128))
% 0.44/0.63  (step t130 (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.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) :rule implies :premises (t129))
% 0.44/0.63  (step t131 (cl (or (not (tptp.connection (tptp.out tptp.n1 (tptp.or1 tptp.h)) (tptp.in tptp.n1 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.or1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) :rule resolution :premises (t130 a0))
% 0.44/0.63  (step t132 (cl (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) :rule resolution :premises (t57 t68 t123 t131))
% 0.44/0.63  (step t133 (cl (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1))) (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) :rule or_pos)
% 0.44/0.63  (step t134 (cl (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)))) :rule reordering :premises (t133))
% 0.44/0.63  (step t135 (cl (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h))))) (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) :rule or_pos)
% 0.44/0.63  (step t136 (cl (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h))) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))))) :rule reordering :premises (t135))
% 0.44/0.63  (step t137 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h))))) (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)
% 0.44/0.63  (anchor :step t138)
% 0.44/0.63  (assume t138.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))))))
% 0.44/0.63  (step t138.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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))))) :rule forall_inst :args ((:= X tptp.h)))
% 0.44/0.63  (step t138.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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h))))) :rule or :premises (t138.t1))
% 0.44/0.63  (step t138.t3 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h))))) :rule resolution :premises (t138.t2 t138.a0))
% 0.44/0.63  (step t138 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h))))) :rule subproof :discharge (t138.a0))
% 0.44/0.63  (step t139 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h))))) :rule resolution :premises (t137 t138))
% 0.44/0.63  (step t140 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h))))) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))))) :rule implies_neg2)
% 0.44/0.63  (step t141 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h))))) (=> (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))))) :rule resolution :premises (t139 t140))
% 0.44/0.63  (step t142 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))))) :rule contraction :premises (t141))
% 0.44/0.63  (step t143 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h))))) :rule implies :premises (t142))
% 0.44/0.63  (step t144 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h))))) :rule resolution :premises (t143 a33))
% 0.44/0.63  (step t145 (cl (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) :rule resolution :premises (t136 a34 t144))
% 0.44/0.63  (step t146 (cl (not (or (not (tptp.mode (tptp.not1 tptp.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1))) (not (tptp.mode (tptp.not1 tptp.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) :rule or_pos)
% 0.44/0.63  (step t147 (cl (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.mode (tptp.not1 tptp.h) tptp.ok)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1) (not (or (not (tptp.mode (tptp.not1 tptp.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)))) :rule reordering :premises (t146))
% 0.44/0.63  (step t148 (cl (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not))) (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not)) :rule or_pos)
% 0.44/0.63  (step t149 (cl (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not)))) :rule reordering :premises (t148))
% 0.44/0.63  (step t150 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not))) (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not)))) :rule implies_neg1)
% 0.44/0.63  (anchor :step t151)
% 0.44/0.63  (assume t151.a0 (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))))
% 0.44/0.63  (step t151.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.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not)))) :rule forall_inst :args ((:= X tptp.h)))
% 0.44/0.63  (step t151.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.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not))) :rule or :premises (t151.t1))
% 0.44/0.63  (step t151.t3 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not))) :rule resolution :premises (t151.t2 t151.a0))
% 0.44/0.63  (step t151 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not)))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not))) :rule subproof :discharge (t151.a0))
% 0.44/0.63  (step t152 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not))) :rule resolution :premises (t150 t151))
% 0.44/0.63  (step t153 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not))) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not)))) :rule implies_neg2)
% 0.44/0.63  (step t154 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not))) (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not)))) :rule resolution :premises (t152 t153))
% 0.44/0.63  (step t155 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not)))) :rule contraction :premises (t154))
% 0.44/0.63  (step t156 (cl (not (forall ((X $$unsorted)) (or (not (tptp.type X tptp.halfadder)) (tptp.type (tptp.not1 X) tptp.not)))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not))) :rule implies :premises (t155))
% 0.44/0.63  (step t157 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.type (tptp.not1 tptp.h) tptp.not))) :rule resolution :premises (t156 a23))
% 0.44/0.63  (step t158 (cl (tptp.type (tptp.not1 tptp.h) tptp.not)) :rule resolution :premises (t149 a34 t157))
% 0.44/0.63  (step t159 (cl (not (or (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) tptp.abnormal))) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) tptp.abnormal)) :rule or_pos)
% 0.44/0.63  (step t160 (cl (tptp.mode (tptp.not1 tptp.h) tptp.abnormal) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (not (or (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) tptp.abnormal)))) :rule reordering :premises (t159))
% 0.44/0.63  (step t161 (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.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) 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)
% 0.44/0.63  (anchor :step t162)
% 0.44/0.63  (assume t162.a0 (forall ((K $$unsorted) (Any $$unsorted)) (or (not (tptp.type K Any)) (tptp.mode K tptp.ok) (tptp.mode K tptp.abnormal))))
% 0.44/0.63  (step t162.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.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) tptp.abnormal)))) :rule forall_inst :args ((:= K (tptp.not1 tptp.h)) (:= Any tptp.not)))
% 0.44/0.63  (step t162.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.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) tptp.abnormal))) :rule or :premises (t162.t1))
% 0.44/0.63  (step t162.t3 (cl (or (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) tptp.abnormal))) :rule resolution :premises (t162.t2 t162.a0))
% 0.44/0.63  (step t162 (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.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) tptp.abnormal))) :rule subproof :discharge (t162.a0))
% 0.44/0.63  (step t163 (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.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) tptp.abnormal))) (or (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) tptp.abnormal))) :rule resolution :premises (t161 t162))
% 0.44/0.63  (step t164 (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.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) tptp.abnormal))) (not (or (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) tptp.abnormal)))) :rule implies_neg2)
% 0.44/0.63  (step t165 (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.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) 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.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) tptp.abnormal)))) :rule resolution :premises (t163 t164))
% 0.44/0.63  (step t166 (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.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) tptp.abnormal)))) :rule contraction :premises (t165))
% 0.44/0.63  (step t167 (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.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) tptp.abnormal))) :rule implies :premises (t166))
% 0.44/0.63  (step t168 (cl (or (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (tptp.mode (tptp.not1 tptp.h) tptp.ok) (tptp.mode (tptp.not1 tptp.h) tptp.abnormal))) :rule resolution :premises (t167 a6))
% 0.44/0.63  (step t169 (cl (tptp.mode (tptp.not1 tptp.h) tptp.ok)) :rule resolution :premises (t160 a40 t158 t168))
% 0.44/0.63  (step t170 (cl (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0))) (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) :rule or_pos)
% 0.44/0.63  (step t171 (cl (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)))) :rule reordering :premises (t170))
% 0.44/0.63  (step t172 (cl (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h))))) (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) :rule or_pos)
% 0.44/0.63  (step t173 (cl (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h))) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))))) :rule reordering :premises (t172))
% 0.44/0.63  (step t174 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h))))) (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)
% 0.44/0.63  (anchor :step t175)
% 0.44/0.63  (assume t175.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))))))
% 0.44/0.63  (step t175.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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))))) :rule forall_inst :args ((:= X tptp.h)))
% 0.44/0.63  (step t175.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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h))))) :rule or :premises (t175.t1))
% 0.44/0.63  (step t175.t3 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h))))) :rule resolution :premises (t175.t2 t175.a0))
% 0.44/0.63  (step t175 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h))))) :rule subproof :discharge (t175.a0))
% 0.44/0.63  (step t176 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h))))) :rule resolution :premises (t174 t175))
% 0.44/0.63  (step t177 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h))))) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))))) :rule implies_neg2)
% 0.44/0.63  (step t178 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h))))) (=> (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))))) :rule resolution :premises (t176 t177))
% 0.44/0.63  (step t179 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))))) :rule contraction :premises (t178))
% 0.44/0.63  (step t180 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h))))) :rule implies :premises (t179))
% 0.44/0.63  (step t181 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h))))) :rule resolution :premises (t180 a32))
% 0.44/0.63  (step t182 (cl (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) :rule resolution :premises (t173 a34 t181))
% 0.44/0.63  (step t183 (cl (not (or (not (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0))) (not (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) :rule or_pos)
% 0.44/0.63  (step t184 (cl (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (not (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0) (not (or (not (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)))) :rule reordering :premises (t183))
% 0.44/0.63  (step t185 (cl (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h))))) (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) :rule or_pos)
% 0.44/0.63  (step t186 (cl (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h))) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))))) :rule reordering :premises (t185))
% 0.44/0.63  (step t187 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h))))) (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)
% 0.44/0.63  (anchor :step t188)
% 0.44/0.63  (assume t188.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))))))
% 0.44/0.63  (step t188.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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))))) :rule forall_inst :args ((:= X tptp.h)))
% 0.44/0.63  (step t188.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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h))))) :rule or :premises (t188.t1))
% 0.44/0.63  (step t188.t3 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h))))) :rule resolution :premises (t188.t2 t188.a0))
% 0.44/0.63  (step t188 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h))))) :rule subproof :discharge (t188.a0))
% 0.44/0.63  (step t189 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h))))) (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h))))) :rule resolution :premises (t187 t188))
% 0.44/0.63  (step t190 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h))))) (not (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))))) :rule implies_neg2)
% 0.44/0.63  (step t191 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h))))) (=> (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))))) :rule resolution :premises (t189 t190))
% 0.44/0.63  (step t192 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))))) :rule contraction :premises (t191))
% 0.44/0.63  (step t193 (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.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h))))) :rule implies :premises (t192))
% 0.44/0.63  (step t194 (cl (or (not (tptp.type tptp.h tptp.halfadder)) (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h))))) :rule resolution :premises (t193 a30))
% 0.44/0.63  (step t195 (cl (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) :rule resolution :premises (t186 a34 t194))
% 0.44/0.63  (step t196 (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.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) 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)
% 0.44/0.63  (anchor :step t197)
% 0.44/0.63  (assume t197.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 0.44/0.63  (step t197.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.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.c tptp.h)) (:= P2 (tptp.out tptp.n1 (tptp.and2 tptp.h))) (:= V tptp.n0)))
% 0.44/0.63  (step t197.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.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0))) :rule or :premises (t197.t1))
% 0.44/0.63  (step t197.t3 (cl (or (not (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0))) :rule resolution :premises (t197.t2 t197.a0))
% 0.44/0.63  (step t197 (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.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0))) :rule subproof :discharge (t197.a0))
% 0.44/0.63  (step t198 (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.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0))) (or (not (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0))) :rule resolution :premises (t196 t197))
% 0.44/0.63  (step t199 (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.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0))) (not (or (not (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)))) :rule implies_neg2)
% 0.44/0.63  (step t200 (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.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) 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.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)))) :rule resolution :premises (t198 t199))
% 0.44/0.63  (step t201 (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.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)))) :rule contraction :premises (t200))
% 0.44/0.63  (step t202 (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.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0))) :rule implies :premises (t201))
% 0.44/0.63  (step t203 (cl (or (not (tptp.connection (tptp.out tptp.c tptp.h) (tptp.out tptp.n1 (tptp.and2 tptp.h)))) (not (tptp.value (tptp.out tptp.c tptp.h) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0))) :rule resolution :premises (t202 a0))
% 0.44/0.63  (step t204 (cl (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) :rule resolution :premises (t184 a38 t195 t203))
% 0.44/0.63  (step t205 (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.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) 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)
% 0.44/0.63  (anchor :step t206)
% 0.44/0.63  (assume t206.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 0.44/0.63  (step t206.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.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.n1 (tptp.and2 tptp.h))) (:= P2 (tptp.in tptp.n1 (tptp.not1 tptp.h))) (:= V tptp.n0)))
% 0.44/0.63  (step t206.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.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0))) :rule or :premises (t206.t1))
% 0.44/0.63  (step t206.t3 (cl (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0))) :rule resolution :premises (t206.t2 t206.a0))
% 0.44/0.63  (step t206 (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.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0))) :rule subproof :discharge (t206.a0))
% 0.44/0.63  (step t207 (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.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0))) :rule resolution :premises (t205 t206))
% 0.44/0.63  (step t208 (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.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0))) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)))) :rule implies_neg2)
% 0.44/0.63  (step t209 (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.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) 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.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)))) :rule resolution :premises (t207 t208))
% 0.44/0.63  (step t210 (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.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)))) :rule contraction :premises (t209))
% 0.44/0.63  (step t211 (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.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0))) :rule implies :premises (t210))
% 0.44/0.63  (step t212 (cl (or (not (tptp.connection (tptp.out tptp.n1 (tptp.and2 tptp.h)) (tptp.in tptp.n1 (tptp.not1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.and2 tptp.h)) tptp.n0)) (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0))) :rule resolution :premises (t211 a0))
% 0.44/0.63  (step t213 (cl (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) :rule resolution :premises (t171 t182 t204 t212))
% 0.44/0.63  (step t214 (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.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) 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)
% 0.44/0.63  (anchor :step t215)
% 0.44/0.63  (assume t215.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))))
% 0.44/0.63  (step t215.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.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)))) :rule forall_inst :args ((:= K (tptp.not1 tptp.h))))
% 0.44/0.63  (step t215.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.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1))) :rule or :premises (t215.t1))
% 0.44/0.63  (step t215.t3 (cl (or (not (tptp.mode (tptp.not1 tptp.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1))) :rule resolution :premises (t215.t2 t215.a0))
% 0.44/0.63  (step t215 (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.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1))) :rule subproof :discharge (t215.a0))
% 0.44/0.63  (step t216 (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.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1))) (or (not (tptp.mode (tptp.not1 tptp.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1))) :rule resolution :premises (t214 t215))
% 0.44/0.63  (step t217 (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.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1))) (not (or (not (tptp.mode (tptp.not1 tptp.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)))) :rule implies_neg2)
% 0.44/0.63  (step t218 (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.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) 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.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)))) :rule resolution :premises (t216 t217))
% 0.44/0.63  (step t219 (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.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)))) :rule contraction :premises (t218))
% 0.44/0.63  (step t220 (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.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1))) :rule implies :premises (t219))
% 0.44/0.63  (step t221 (cl (or (not (tptp.mode (tptp.not1 tptp.h) tptp.ok)) (not (tptp.type (tptp.not1 tptp.h) tptp.not)) (not (tptp.value (tptp.in tptp.n1 (tptp.not1 tptp.h)) tptp.n0)) (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1))) :rule resolution :premises (t220 a17))
% 0.44/0.63  (step t222 (cl (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) :rule resolution :premises (t147 t158 t169 t213 t221))
% 0.44/0.63  (step t223 (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.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) 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)
% 0.44/0.63  (anchor :step t224)
% 0.44/0.63  (assume t224.a0 (forall ((P1 $$unsorted) (P2 $$unsorted) (V $$unsorted)) (or (not (tptp.connection P1 P2)) (not (tptp.value P1 V)) (tptp.value P2 V))))
% 0.44/0.63  (step t224.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.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)))) :rule forall_inst :args ((:= P1 (tptp.out tptp.n1 (tptp.not1 tptp.h))) (:= P2 (tptp.in tptp.n2 (tptp.and1 tptp.h))) (:= V tptp.n1)))
% 0.44/0.63  (step t224.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.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1))) :rule or :premises (t224.t1))
% 0.44/0.63  (step t224.t3 (cl (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1))) :rule resolution :premises (t224.t2 t224.a0))
% 0.44/0.63  (step t224 (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.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1))) :rule subproof :discharge (t224.a0))
% 0.44/0.63  (step t225 (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.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1))) (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1))) :rule resolution :premises (t223 t224))
% 0.44/0.63  (step t226 (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.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1))) (not (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)))) :rule implies_neg2)
% 0.44/0.63  (step t227 (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.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) 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.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)))) :rule resolution :premises (t225 t226))
% 0.44/0.63  (step t228 (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.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)))) :rule contraction :premises (t227))
% 0.44/0.63  (step t229 (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.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1))) :rule implies :premises (t228))
% 0.44/0.63  (step t230 (cl (or (not (tptp.connection (tptp.out tptp.n1 (tptp.not1 tptp.h)) (tptp.in tptp.n2 (tptp.and1 tptp.h)))) (not (tptp.value (tptp.out tptp.n1 (tptp.not1 tptp.h)) tptp.n1)) (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1))) :rule resolution :premises (t229 a0))
% 0.44/0.63  (step t231 (cl (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) :rule resolution :premises (t134 t145 t222 t230))
% 0.44/0.63  (step t232 (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.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) 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)
% 0.44/0.63  (anchor :step t233)
% 0.44/0.63  (assume t233.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))))
% 0.44/0.63  (step t233.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.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)))) :rule forall_inst :args ((:= K (tptp.and1 tptp.h))))
% 0.44/0.63  (step t233.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.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) :rule or :premises (t233.t1))
% 0.44/0.63  (step t233.t3 (cl (or (not (tptp.mode (tptp.and1 tptp.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) :rule resolution :premises (t233.t2 t233.a0))
% 0.44/0.63  (step t233 (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.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) :rule subproof :discharge (t233.a0))
% 0.44/0.63  (step t234 (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.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) (or (not (tptp.mode (tptp.and1 tptp.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) :rule resolution :premises (t232 t233))
% 0.44/0.63  (step t235 (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.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) (not (or (not (tptp.mode (tptp.and1 tptp.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)))) :rule implies_neg2)
% 0.44/0.63  (step t236 (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.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) 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.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)))) :rule resolution :premises (t234 t235))
% 0.44/0.63  (step t237 (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.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)))) :rule contraction :premises (t236))
% 0.44/0.63  (step t238 (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.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) :rule implies :premises (t237))
% 0.44/0.63  (step t239 (cl (or (not (tptp.mode (tptp.and1 tptp.h) tptp.ok)) (not (tptp.type (tptp.and1 tptp.h) tptp.and)) (not (tptp.value (tptp.in tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (not (tptp.value (tptp.in tptp.n2 (tptp.and1 tptp.h)) tptp.n1)) (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1))) :rule resolution :premises (t238 a8))
% 0.44/0.63  (step t240 (cl (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) :rule resolution :premises (t33 t44 t55 t132 t231 t239))
% 0.44/0.63  (step t241 (cl (not (or (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n0)) (not (tptp.value (tptp.out tptp.n1 (tptp.and1 tptp.h)) tptp.n1)) (tptp.equal_value tptp.n0 tptp.n1)))) :rule resolution :premises (t9 a3 t31 t240))
% 0.44/0.63  (step t242 (cl) :rule resolution :premises (t7 t241 a2))
% 0.44/0.63  
% 0.44/0.63  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.Aw7YHUP7up/cvc5---1.0.5_22320.smt2
% 0.44/0.63  % cvc5---1.0.5 exiting
% 0.49/0.64  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------