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

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

% Result   : Unsatisfiable 0.37s 0.56s
% Output   : Proof 0.37s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : PUZ030-1 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.14  % Command    : do_cvc5 %s %d
% 0.15/0.36  % Computer : n016.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   : Sat May 25 19:37:39 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.37/0.56  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.dvVrkTvogw/cvc5---1.0.5_26274.smt2
% 0.37/0.56  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.dvVrkTvogw/cvc5---1.0.5_26274.smt2
% 0.37/0.60  (assume a0 (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X))))
% 0.37/0.60  (assume a1 (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))))
% 0.37/0.60  (assume a2 (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))))
% 0.37/0.60  (assume a3 (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (tptp.salt X) (tptp.mustard X))))
% 0.37/0.60  (assume a4 (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))))
% 0.37/0.60  (assume a5 (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.neither X)))))
% 0.37/0.60  (assume a6 (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))))
% 0.37/0.60  (assume a7 (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.salt X)) (not (tptp.mustard X)))))
% 0.37/0.60  (assume a8 (forall ((X $$unsorted)) (or (not (tptp.both X)) (not (tptp.neither X)))))
% 0.37/0.60  (assume a9 (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X)))))
% 0.37/0.60  (assume a10 (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))))
% 0.37/0.60  (assume a11 (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))))
% 0.37/0.60  (assume a12 (or (not (tptp.salt tptp.barry)) (tptp.oneof tptp.cole) (tptp.oneof tptp.lang)))
% 0.37/0.60  (assume a13 (or (not (tptp.oneof tptp.cole)) (tptp.salt tptp.barry)))
% 0.37/0.60  (assume a14 (or (not (tptp.oneof tptp.lang)) (tptp.salt tptp.barry)))
% 0.37/0.60  (assume a15 (or (not (tptp.mustard tptp.barry)) (tptp.neither tptp.dix) (tptp.both tptp.mill)))
% 0.37/0.60  (assume a16 (or (not (tptp.neither tptp.dix)) (tptp.mustard tptp.barry)))
% 0.37/0.60  (assume a17 (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.barry)))
% 0.37/0.60  (assume a18 (or (not (tptp.salt tptp.cole)) (tptp.oneof tptp.barry) (tptp.neither tptp.mill)))
% 0.37/0.60  (assume a19 (or (not (tptp.oneof tptp.barry)) (tptp.salt tptp.cole)))
% 0.37/0.60  (assume a20 (or (not (tptp.neither tptp.mill)) (tptp.salt tptp.cole)))
% 0.37/0.60  (assume a21 (or (not (tptp.mustard tptp.cole)) (tptp.both tptp.dix) (tptp.both tptp.lang)))
% 0.37/0.60  (assume a22 (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.cole)))
% 0.37/0.60  (assume a23 (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.cole)))
% 0.37/0.60  (assume a24 (or (not (tptp.salt tptp.dix)) (tptp.neither tptp.barry) (tptp.both tptp.cole)))
% 0.37/0.60  (assume a25 (or (not (tptp.neither tptp.barry)) (tptp.salt tptp.dix)))
% 0.37/0.60  (assume a26 (or (not (tptp.both tptp.cole)) (tptp.salt tptp.dix)))
% 0.37/0.60  (assume a27 (or (not (tptp.mustard tptp.dix)) (tptp.neither tptp.lang) (tptp.neither tptp.mill)))
% 0.37/0.60  (assume a28 (or (not (tptp.neither tptp.lang)) (tptp.mustard tptp.dix)))
% 0.37/0.60  (assume a29 (or (not (tptp.neither tptp.mill)) (tptp.mustard tptp.dix)))
% 0.37/0.60  (assume a30 (or (not (tptp.salt tptp.lang)) (tptp.oneof tptp.barry) (tptp.oneof tptp.dix)))
% 0.37/0.60  (assume a31 (or (not (tptp.oneof tptp.barry)) (tptp.salt tptp.lang)))
% 0.37/0.60  (assume a32 (or (not (tptp.oneof tptp.dix)) (tptp.salt tptp.lang)))
% 0.37/0.60  (assume a33 (or (not (tptp.mustard tptp.lang)) (tptp.neither tptp.cole) (tptp.neither tptp.mill)))
% 0.37/0.60  (assume a34 (or (not (tptp.neither tptp.cole)) (tptp.mustard tptp.lang)))
% 0.37/0.60  (assume a35 (or (not (tptp.neither tptp.mill)) (tptp.mustard tptp.lang)))
% 0.37/0.60  (assume a36 (or (not (tptp.salt tptp.mill)) (tptp.both tptp.barry) (tptp.both tptp.lang)))
% 0.37/0.60  (assume a37 (or (not (tptp.both tptp.barry)) (tptp.salt tptp.mill)))
% 0.37/0.60  (assume a38 (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.mill)))
% 0.37/0.60  (assume a39 (or (not (tptp.mustard tptp.mill)) (tptp.oneof tptp.cole) (tptp.oneof tptp.dix)))
% 0.37/0.60  (assume a40 (or (not (tptp.oneof tptp.cole)) (tptp.mustard tptp.mill)))
% 0.37/0.60  (assume a41 (or (not (tptp.oneof tptp.dix)) (tptp.mustard tptp.mill)))
% 0.37/0.60  (assume a42 (or (not (tptp.neither tptp.cole)) (not (tptp.neither tptp.dix)) (not (tptp.both tptp.barry)) (not (tptp.oneof tptp.lang)) (not (tptp.salt tptp.mill)) (not (tptp.mustard tptp.lang)) (not (tptp.oneof tptp.mill))))
% 0.37/0.60  (step t1 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole))) (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t2)
% 0.37/0.60  (assume t2.a0 (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))))
% 0.37/0.60  (step t2.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole)))) :rule forall_inst :args ((:= X tptp.cole)))
% 0.37/0.60  (step t2.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole))) :rule or :premises (t2.t1))
% 0.37/0.60  (step t2.t3 (cl (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole))) :rule resolution :premises (t2.t2 t2.a0))
% 0.37/0.60  (step t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole))) :rule subproof :discharge (t2.a0))
% 0.37/0.60  (step t3 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole))) (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole))) :rule resolution :premises (t1 t2))
% 0.37/0.60  (step t4 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole))) (not (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole)))) :rule implies_neg2)
% 0.37/0.60  (step t5 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole))) (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole)))) :rule resolution :premises (t3 t4))
% 0.37/0.60  (step t6 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole)))) :rule contraction :premises (t5))
% 0.37/0.60  (step t7 (cl (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole))) :rule implies :premises (t6))
% 0.37/0.60  (step t8 (cl (not (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole))) (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole)) :rule or_pos)
% 0.37/0.60  (step t9 (cl (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole) (not (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole)))) :rule reordering :premises (t8))
% 0.37/0.60  (step t10 (cl (not (tptp.neither tptp.mill)) (tptp.salt tptp.cole)) :rule or :premises (a20))
% 0.37/0.60  (step t11 (cl (tptp.salt tptp.cole) (not (tptp.neither tptp.mill))) :rule reordering :premises (t10))
% 0.37/0.60  (step t12 (cl (not (tptp.neither tptp.cole)) (not (tptp.neither tptp.dix)) (not (tptp.both tptp.barry)) (not (tptp.oneof tptp.lang)) (not (tptp.salt tptp.mill)) (not (tptp.mustard tptp.lang)) (not (tptp.oneof tptp.mill))) :rule or :premises (a42))
% 0.37/0.60  (step t13 (cl (not (tptp.oneof tptp.lang)) (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.lang)) (not (tptp.neither tptp.cole)) (not (tptp.salt tptp.mill)) (not (tptp.both tptp.barry)) (not (tptp.oneof tptp.mill))) :rule reordering :premises (t12))
% 0.37/0.60  (step t14 (cl (not (tptp.salt tptp.mill)) (tptp.both tptp.barry) (tptp.both tptp.lang)) :rule or :premises (a36))
% 0.37/0.60  (step t15 (cl (tptp.both tptp.lang) (not (tptp.salt tptp.mill)) (tptp.both tptp.barry)) :rule reordering :premises (t14))
% 0.37/0.60  (step t16 (cl (not (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill))) (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill)) :rule or_pos)
% 0.37/0.60  (step t17 (cl (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill) (not (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill)))) :rule reordering :premises (t16))
% 0.37/0.60  (step t18 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill))) (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t19)
% 0.37/0.60  (assume t19.a0 (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))))
% 0.37/0.60  (step t19.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill)))) :rule forall_inst :args ((:= X tptp.mill)))
% 0.37/0.60  (step t19.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill))) :rule or :premises (t19.t1))
% 0.37/0.60  (step t19.t3 (cl (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill))) :rule resolution :premises (t19.t2 t19.a0))
% 0.37/0.60  (step t19 (cl (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill))) :rule subproof :discharge (t19.a0))
% 0.37/0.60  (step t20 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill))) (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill))) :rule resolution :premises (t18 t19))
% 0.37/0.60  (step t21 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill))) (not (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill)))) :rule implies_neg2)
% 0.37/0.60  (step t22 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill))) (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill)))) :rule resolution :premises (t20 t21))
% 0.37/0.60  (step t23 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill)))) :rule contraction :premises (t22))
% 0.37/0.60  (step t24 (cl (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill))) :rule implies :premises (t23))
% 0.37/0.60  (step t25 (cl (or (tptp.both tptp.mill) (tptp.neither tptp.mill) (tptp.oneof tptp.mill))) :rule resolution :premises (t24 a6))
% 0.37/0.60  (step t26 (cl (not (tptp.oneof tptp.lang)) (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.lang)) (not (tptp.neither tptp.cole)) (not (tptp.salt tptp.mill)) (tptp.both tptp.lang) (not (tptp.salt tptp.mill)) (tptp.both tptp.mill) (tptp.neither tptp.mill)) :rule resolution :premises (t13 t15 t17 t25))
% 0.37/0.60  (step t27 (cl (not (tptp.oneof tptp.lang)) (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.lang)) (not (tptp.neither tptp.cole)) (not (tptp.salt tptp.mill)) (tptp.both tptp.lang) (tptp.both tptp.mill) (tptp.neither tptp.mill)) :rule contraction :premises (t26))
% 0.37/0.60  (step t28 (cl (not (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill))) (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill)) :rule or_pos)
% 0.37/0.60  (step t29 (cl (tptp.neither tptp.mill) (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (not (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill)))) :rule reordering :premises (t28))
% 0.37/0.60  (step t30 (cl (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill))) (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t31)
% 0.37/0.60  (assume t31.a0 (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))))
% 0.37/0.60  (step t31.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X)))) (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill)))) :rule forall_inst :args ((:= X tptp.mill)))
% 0.37/0.60  (step t31.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X)))) (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill))) :rule or :premises (t31.t1))
% 0.37/0.60  (step t31.t3 (cl (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill))) :rule resolution :premises (t31.t2 t31.a0))
% 0.37/0.60  (step t31 (cl (not (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X)))) (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill))) :rule subproof :discharge (t31.a0))
% 0.37/0.60  (step t32 (cl (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill))) (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill))) :rule resolution :premises (t30 t31))
% 0.37/0.60  (step t33 (cl (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill))) (not (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill)))) :rule implies_neg2)
% 0.37/0.60  (step t34 (cl (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill))) (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill)))) :rule resolution :premises (t32 t33))
% 0.37/0.60  (step t35 (cl (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill)))) :rule contraction :premises (t34))
% 0.37/0.60  (step t36 (cl (not (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X)))) (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill))) :rule implies :premises (t35))
% 0.37/0.60  (step t37 (cl (or (tptp.salt tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill))) :rule resolution :premises (t36 a11))
% 0.37/0.60  (step t38 (cl (not (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill))) (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill)) :rule or_pos)
% 0.37/0.60  (step t39 (cl (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill) (not (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill)))) :rule reordering :premises (t38))
% 0.37/0.60  (step t40 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill))) (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t41)
% 0.37/0.60  (assume t41.a0 (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))))
% 0.37/0.60  (step t41.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill)))) :rule forall_inst :args ((:= X tptp.mill)))
% 0.37/0.60  (step t41.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill))) :rule or :premises (t41.t1))
% 0.37/0.60  (step t41.t3 (cl (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill))) :rule resolution :premises (t41.t2 t41.a0))
% 0.37/0.60  (step t41 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill))) :rule subproof :discharge (t41.a0))
% 0.37/0.60  (step t42 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill))) (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill))) :rule resolution :premises (t40 t41))
% 0.37/0.60  (step t43 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill))) (not (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill)))) :rule implies_neg2)
% 0.37/0.60  (step t44 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill))) (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill)))) :rule resolution :premises (t42 t43))
% 0.37/0.60  (step t45 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill)))) :rule contraction :premises (t44))
% 0.37/0.60  (step t46 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill))) :rule implies :premises (t45))
% 0.37/0.60  (step t47 (cl (or (not (tptp.both tptp.mill)) (tptp.mustard tptp.mill))) :rule resolution :premises (t46 a1))
% 0.37/0.60  (step t48 (cl (not (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix))) (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix)) :rule or_pos)
% 0.37/0.60  (step t49 (cl (tptp.neither tptp.dix) (tptp.both tptp.dix) (tptp.oneof tptp.dix) (not (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix)))) :rule reordering :premises (t48))
% 0.37/0.60  (step t50 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix))) (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t51)
% 0.37/0.60  (assume t51.a0 (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))))
% 0.37/0.60  (step t51.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix)))) :rule forall_inst :args ((:= X tptp.dix)))
% 0.37/0.60  (step t51.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix))) :rule or :premises (t51.t1))
% 0.37/0.60  (step t51.t3 (cl (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix))) :rule resolution :premises (t51.t2 t51.a0))
% 0.37/0.60  (step t51 (cl (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix))) :rule subproof :discharge (t51.a0))
% 0.37/0.60  (step t52 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix))) (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix))) :rule resolution :premises (t50 t51))
% 0.37/0.60  (step t53 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix))) (not (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix)))) :rule implies_neg2)
% 0.37/0.60  (step t54 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix))) (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix)))) :rule resolution :premises (t52 t53))
% 0.37/0.60  (step t55 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix)))) :rule contraction :premises (t54))
% 0.37/0.60  (step t56 (cl (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix))) :rule implies :premises (t55))
% 0.37/0.60  (step t57 (cl (or (tptp.both tptp.dix) (tptp.neither tptp.dix) (tptp.oneof tptp.dix))) :rule resolution :premises (t56 a6))
% 0.37/0.60  (step t58 (cl (not (tptp.oneof tptp.lang)) (not (tptp.mustard tptp.lang)) (not (tptp.neither tptp.cole)) (tptp.both tptp.lang) (tptp.neither tptp.mill) (tptp.neither tptp.mill) (tptp.mustard tptp.mill) (tptp.mustard tptp.mill) (tptp.both tptp.dix) (tptp.oneof tptp.dix)) :rule resolution :premises (t27 t29 t37 t39 t47 t49 t57))
% 0.37/0.60  (step t59 (cl (not (tptp.oneof tptp.lang)) (not (tptp.mustard tptp.lang)) (not (tptp.neither tptp.cole)) (tptp.both tptp.lang) (tptp.neither tptp.mill) (tptp.mustard tptp.mill) (tptp.both tptp.dix) (tptp.oneof tptp.dix)) :rule contraction :premises (t58))
% 0.37/0.60  (step t60 (cl (not (tptp.mustard tptp.mill)) (tptp.oneof tptp.cole) (tptp.oneof tptp.dix)) :rule or :premises (a39))
% 0.37/0.60  (step t61 (cl (tptp.oneof tptp.cole) (tptp.oneof tptp.dix) (not (tptp.mustard tptp.mill))) :rule reordering :premises (t60))
% 0.37/0.60  (step t62 (cl (not (tptp.oneof tptp.lang)) (not (tptp.mustard tptp.lang)) (not (tptp.neither tptp.cole)) (tptp.both tptp.lang) (tptp.neither tptp.mill) (tptp.both tptp.dix) (tptp.oneof tptp.dix) (tptp.oneof tptp.cole) (tptp.oneof tptp.dix)) :rule resolution :premises (t59 t61))
% 0.37/0.60  (step t63 (cl (not (tptp.oneof tptp.lang)) (not (tptp.mustard tptp.lang)) (not (tptp.neither tptp.cole)) (tptp.both tptp.lang) (tptp.neither tptp.mill) (tptp.both tptp.dix) (tptp.oneof tptp.dix) (tptp.oneof tptp.cole)) :rule contraction :premises (t62))
% 0.37/0.60  (step t64 (cl (not (tptp.oneof tptp.dix)) (tptp.salt tptp.lang)) :rule or :premises (a32))
% 0.37/0.60  (step t65 (cl (tptp.salt tptp.lang) (not (tptp.oneof tptp.dix))) :rule reordering :premises (t64))
% 0.37/0.60  (step t66 (cl (not (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang))) (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang)) :rule or_pos)
% 0.37/0.60  (step t67 (cl (tptp.oneof tptp.lang) (tptp.both tptp.lang) (tptp.neither tptp.lang) (not (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang)))) :rule reordering :premises (t66))
% 0.37/0.60  (step t68 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang))) (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t69)
% 0.37/0.60  (assume t69.a0 (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))))
% 0.37/0.60  (step t69.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang)))) :rule forall_inst :args ((:= X tptp.lang)))
% 0.37/0.60  (step t69.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang))) :rule or :premises (t69.t1))
% 0.37/0.60  (step t69.t3 (cl (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang))) :rule resolution :premises (t69.t2 t69.a0))
% 0.37/0.60  (step t69 (cl (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang))) :rule subproof :discharge (t69.a0))
% 0.37/0.60  (step t70 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang))) (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang))) :rule resolution :premises (t68 t69))
% 0.37/0.60  (step t71 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang))) (not (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang)))) :rule implies_neg2)
% 0.37/0.60  (step t72 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang))) (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang)))) :rule resolution :premises (t70 t71))
% 0.37/0.60  (step t73 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang)))) :rule contraction :premises (t72))
% 0.37/0.60  (step t74 (cl (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang))) :rule implies :premises (t73))
% 0.37/0.60  (step t75 (cl (or (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.oneof tptp.lang))) :rule resolution :premises (t74 a6))
% 0.37/0.60  (step t76 (cl (not (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang))) (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang)) :rule or_pos)
% 0.37/0.60  (step t77 (cl (tptp.both tptp.lang) (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (not (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang)))) :rule reordering :premises (t76))
% 0.37/0.60  (step t78 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang))) (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t79)
% 0.37/0.60  (assume t79.a0 (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))))
% 0.37/0.60  (step t79.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang)))) :rule forall_inst :args ((:= X tptp.lang)))
% 0.37/0.60  (step t79.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang))) :rule or :premises (t79.t1))
% 0.37/0.60  (step t79.t3 (cl (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang))) :rule resolution :premises (t79.t2 t79.a0))
% 0.37/0.60  (step t79 (cl (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang))) :rule subproof :discharge (t79.a0))
% 0.37/0.60  (step t80 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang))) (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang))) :rule resolution :premises (t78 t79))
% 0.37/0.60  (step t81 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang))) (not (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang)))) :rule implies_neg2)
% 0.37/0.60  (step t82 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang))) (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang)))) :rule resolution :premises (t80 t81))
% 0.37/0.60  (step t83 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang)))) :rule contraction :premises (t82))
% 0.37/0.60  (step t84 (cl (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang))) :rule implies :premises (t83))
% 0.37/0.60  (step t85 (cl (or (not (tptp.salt tptp.lang)) (not (tptp.mustard tptp.lang)) (tptp.both tptp.lang))) :rule resolution :premises (t84 a2))
% 0.37/0.60  (step t86 (cl (not (tptp.mustard tptp.lang)) (not (tptp.neither tptp.cole)) (tptp.both tptp.lang) (tptp.neither tptp.mill) (tptp.both tptp.dix) (tptp.oneof tptp.cole) (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.both tptp.lang) (not (tptp.mustard tptp.lang))) :rule resolution :premises (t63 t65 t67 t75 t77 t85))
% 0.37/0.60  (step t87 (cl (not (tptp.mustard tptp.lang)) (not (tptp.neither tptp.cole)) (tptp.both tptp.lang) (tptp.neither tptp.mill) (tptp.both tptp.dix) (tptp.oneof tptp.cole) (tptp.neither tptp.lang)) :rule contraction :premises (t86))
% 0.37/0.60  (step t88 (cl (not (tptp.both tptp.lang)) (tptp.mustard tptp.cole)) :rule or :premises (a23))
% 0.37/0.60  (step t89 (cl (tptp.mustard tptp.cole) (not (tptp.both tptp.lang))) :rule reordering :premises (t88))
% 0.37/0.60  (step t90 (cl (not (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix))) (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix)) :rule or_pos)
% 0.37/0.60  (step t91 (cl (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix) (not (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix)))) :rule reordering :premises (t90))
% 0.37/0.60  (step t92 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix))) (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t93)
% 0.37/0.60  (assume t93.a0 (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))))
% 0.37/0.60  (step t93.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix)))) :rule forall_inst :args ((:= X tptp.dix)))
% 0.37/0.60  (step t93.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix))) :rule or :premises (t93.t1))
% 0.37/0.60  (step t93.t3 (cl (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix))) :rule resolution :premises (t93.t2 t93.a0))
% 0.37/0.60  (step t93 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix))) :rule subproof :discharge (t93.a0))
% 0.37/0.60  (step t94 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix))) (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix))) :rule resolution :premises (t92 t93))
% 0.37/0.60  (step t95 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix))) (not (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix)))) :rule implies_neg2)
% 0.37/0.60  (step t96 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix))) (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix)))) :rule resolution :premises (t94 t95))
% 0.37/0.60  (step t97 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix)))) :rule contraction :premises (t96))
% 0.37/0.60  (step t98 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix))) :rule implies :premises (t97))
% 0.37/0.60  (step t99 (cl (or (not (tptp.both tptp.dix)) (tptp.mustard tptp.dix))) :rule resolution :premises (t98 a1))
% 0.37/0.60  (step t100 (cl (not (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole)))) (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole))) :rule or_pos)
% 0.37/0.60  (step t101 (cl (not (tptp.mustard tptp.cole)) (not (tptp.neither tptp.cole)) (not (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole))))) :rule reordering :premises (t100))
% 0.37/0.60  (step t102 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole)))) (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X))))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t103)
% 0.37/0.60  (assume t103.a0 (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))))
% 0.37/0.60  (step t103.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X))))) (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole))))) :rule forall_inst :args ((:= X tptp.cole)))
% 0.37/0.60  (step t103.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X))))) (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole)))) :rule or :premises (t103.t1))
% 0.37/0.60  (step t103.t3 (cl (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole)))) :rule resolution :premises (t103.t2 t103.a0))
% 0.37/0.60  (step t103 (cl (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X))))) (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole)))) :rule subproof :discharge (t103.a0))
% 0.37/0.60  (step t104 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole)))) (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole)))) :rule resolution :premises (t102 t103))
% 0.37/0.60  (step t105 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole)))) (not (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole))))) :rule implies_neg2)
% 0.37/0.60  (step t106 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole)))) (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole))))) :rule resolution :premises (t104 t105))
% 0.37/0.60  (step t107 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole))))) :rule contraction :premises (t106))
% 0.37/0.60  (step t108 (cl (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X))))) (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole)))) :rule implies :premises (t107))
% 0.37/0.60  (step t109 (cl (or (not (tptp.neither tptp.cole)) (not (tptp.mustard tptp.cole)))) :rule resolution :premises (t108 a10))
% 0.37/0.60  (step t110 (cl (not (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole)))) (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole))) :rule or_pos)
% 0.37/0.60  (step t111 (cl (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole)) (not (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole))))) :rule reordering :premises (t110))
% 0.37/0.60  (step t112 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.neither X)))) (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole)))) (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.neither X))))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t113)
% 0.37/0.60  (assume t113.a0 (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.neither X)))))
% 0.37/0.60  (step t113.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.neither X))))) (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole))))) :rule forall_inst :args ((:= X tptp.cole)))
% 0.37/0.60  (step t113.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.neither X))))) (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole)))) :rule or :premises (t113.t1))
% 0.37/0.60  (step t113.t3 (cl (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole)))) :rule resolution :premises (t113.t2 t113.a0))
% 0.37/0.60  (step t113 (cl (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.neither X))))) (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole)))) :rule subproof :discharge (t113.a0))
% 0.37/0.60  (step t114 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.neither X)))) (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole)))) (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole)))) :rule resolution :premises (t112 t113))
% 0.37/0.60  (step t115 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.neither X)))) (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole)))) (not (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole))))) :rule implies_neg2)
% 0.37/0.60  (step t116 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.neither X)))) (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole)))) (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.neither X)))) (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole))))) :rule resolution :premises (t114 t115))
% 0.37/0.60  (step t117 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.neither X)))) (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole))))) :rule contraction :premises (t116))
% 0.37/0.60  (step t118 (cl (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.neither X))))) (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole)))) :rule implies :premises (t117))
% 0.37/0.60  (step t119 (cl (or (not (tptp.oneof tptp.cole)) (not (tptp.neither tptp.cole)))) :rule resolution :premises (t118 a5))
% 0.37/0.60  (step t120 (cl (not (tptp.mustard tptp.dix)) (tptp.neither tptp.lang) (tptp.neither tptp.mill)) :rule or :premises (a27))
% 0.37/0.60  (step t121 (cl (tptp.neither tptp.mill) (not (tptp.mustard tptp.dix)) (tptp.neither tptp.lang)) :rule reordering :premises (t120))
% 0.37/0.60  (step t122 (cl (not (tptp.mustard tptp.lang)) (not (tptp.neither tptp.cole)) (tptp.neither tptp.mill) (tptp.neither tptp.lang) (not (tptp.neither tptp.cole)) (not (tptp.neither tptp.cole)) (tptp.neither tptp.mill) (tptp.neither tptp.lang)) :rule resolution :premises (t87 t89 t91 t99 t101 t109 t111 t119 t121))
% 0.37/0.60  (step t123 (cl (not (tptp.mustard tptp.lang)) (not (tptp.neither tptp.cole)) (tptp.neither tptp.mill) (tptp.neither tptp.lang)) :rule contraction :premises (t122))
% 0.37/0.60  (step t124 (cl (not (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang)))) (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang))) :rule or_pos)
% 0.37/0.60  (step t125 (cl (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang)) (not (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang))))) :rule reordering :premises (t124))
% 0.37/0.60  (step t126 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang)))) (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X))))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t127)
% 0.37/0.60  (assume t127.a0 (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))))
% 0.37/0.60  (step t127.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X))))) (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang))))) :rule forall_inst :args ((:= X tptp.lang)))
% 0.37/0.60  (step t127.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X))))) (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang)))) :rule or :premises (t127.t1))
% 0.37/0.60  (step t127.t3 (cl (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang)))) :rule resolution :premises (t127.t2 t127.a0))
% 0.37/0.60  (step t127 (cl (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X))))) (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang)))) :rule subproof :discharge (t127.a0))
% 0.37/0.60  (step t128 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang)))) (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang)))) :rule resolution :premises (t126 t127))
% 0.37/0.60  (step t129 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang)))) (not (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang))))) :rule implies_neg2)
% 0.37/0.60  (step t130 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang)))) (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang))))) :rule resolution :premises (t128 t129))
% 0.37/0.60  (step t131 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang))))) :rule contraction :premises (t130))
% 0.37/0.60  (step t132 (cl (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X))))) (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang)))) :rule implies :premises (t131))
% 0.37/0.60  (step t133 (cl (or (not (tptp.neither tptp.lang)) (not (tptp.mustard tptp.lang)))) :rule resolution :premises (t132 a10))
% 0.37/0.60  (step t134 (cl (not (tptp.mustard tptp.lang)) (tptp.neither tptp.cole) (tptp.neither tptp.mill)) :rule or :premises (a33))
% 0.37/0.60  (step t135 (cl (tptp.neither tptp.mill) (not (tptp.mustard tptp.lang)) (tptp.neither tptp.cole)) :rule reordering :premises (t134))
% 0.37/0.60  (step t136 (cl (not (tptp.mustard tptp.lang)) (tptp.neither tptp.mill) (not (tptp.mustard tptp.lang)) (tptp.neither tptp.mill) (not (tptp.mustard tptp.lang))) :rule resolution :premises (t123 t125 t133 t135))
% 0.37/0.60  (step t137 (cl (not (tptp.mustard tptp.lang)) (tptp.neither tptp.mill)) :rule contraction :premises (t136))
% 0.37/0.60  (step t138 (cl (tptp.neither tptp.mill) (not (tptp.mustard tptp.lang))) :rule reordering :premises (t137))
% 0.37/0.60  (step t139 (cl (not (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang))) (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang)) :rule or_pos)
% 0.37/0.60  (step t140 (cl (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang) (not (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang)))) :rule reordering :premises (t139))
% 0.37/0.60  (step t141 (cl (not (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry)))) (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry))) :rule or_pos)
% 0.37/0.60  (step t142 (cl (not (tptp.salt tptp.barry)) (not (tptp.neither tptp.barry)) (not (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry))))) :rule reordering :premises (t141))
% 0.37/0.60  (step t143 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X)))) (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry)))) (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X))))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t144)
% 0.37/0.60  (assume t144.a0 (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X)))))
% 0.37/0.60  (step t144.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X))))) (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry))))) :rule forall_inst :args ((:= X tptp.barry)))
% 0.37/0.60  (step t144.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X))))) (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry)))) :rule or :premises (t144.t1))
% 0.37/0.60  (step t144.t3 (cl (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry)))) :rule resolution :premises (t144.t2 t144.a0))
% 0.37/0.60  (step t144 (cl (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X))))) (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry)))) :rule subproof :discharge (t144.a0))
% 0.37/0.60  (step t145 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X)))) (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry)))) (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry)))) :rule resolution :premises (t143 t144))
% 0.37/0.60  (step t146 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X)))) (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry)))) (not (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry))))) :rule implies_neg2)
% 0.37/0.60  (step t147 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X)))) (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry)))) (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X)))) (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry))))) :rule resolution :premises (t145 t146))
% 0.37/0.60  (step t148 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X)))) (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry))))) :rule contraction :premises (t147))
% 0.37/0.60  (step t149 (cl (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X))))) (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry)))) :rule implies :premises (t148))
% 0.37/0.60  (step t150 (cl (or (not (tptp.neither tptp.barry)) (not (tptp.salt tptp.barry)))) :rule resolution :premises (t149 a9))
% 0.37/0.60  (step t151 (cl (not (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry))) (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry)) :rule or_pos)
% 0.37/0.60  (step t152 (cl (tptp.oneof tptp.barry) (tptp.neither tptp.barry) (tptp.both tptp.barry) (not (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry)))) :rule reordering :premises (t151))
% 0.37/0.60  (step t153 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry))) (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t154)
% 0.37/0.60  (assume t154.a0 (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))))
% 0.37/0.60  (step t154.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry)))) :rule forall_inst :args ((:= X tptp.barry)))
% 0.37/0.60  (step t154.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry))) :rule or :premises (t154.t1))
% 0.37/0.60  (step t154.t3 (cl (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry))) :rule resolution :premises (t154.t2 t154.a0))
% 0.37/0.60  (step t154 (cl (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry))) :rule subproof :discharge (t154.a0))
% 0.37/0.60  (step t155 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry))) (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry))) :rule resolution :premises (t153 t154))
% 0.37/0.60  (step t156 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry))) (not (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry)))) :rule implies_neg2)
% 0.37/0.60  (step t157 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry))) (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry)))) :rule resolution :premises (t155 t156))
% 0.37/0.60  (step t158 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry)))) :rule contraction :premises (t157))
% 0.37/0.60  (step t159 (cl (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry))) :rule implies :premises (t158))
% 0.37/0.60  (step t160 (cl (or (tptp.both tptp.barry) (tptp.neither tptp.barry) (tptp.oneof tptp.barry))) :rule resolution :premises (t159 a6))
% 0.37/0.60  (step t161 (cl (not (tptp.oneof tptp.lang)) (tptp.salt tptp.barry)) :rule or :premises (a14))
% 0.37/0.60  (step t162 (cl (tptp.salt tptp.barry) (not (tptp.oneof tptp.lang))) :rule reordering :premises (t161))
% 0.37/0.60  (step t163 (cl (not (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry))) (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry)) :rule or_pos)
% 0.37/0.60  (step t164 (cl (tptp.mustard tptp.barry) (not (tptp.both tptp.barry)) (not (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry)))) :rule reordering :premises (t163))
% 0.37/0.60  (step t165 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry))) (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t166)
% 0.37/0.60  (assume t166.a0 (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))))
% 0.37/0.60  (step t166.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry)))) :rule forall_inst :args ((:= X tptp.barry)))
% 0.37/0.60  (step t166.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry))) :rule or :premises (t166.t1))
% 0.37/0.60  (step t166.t3 (cl (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry))) :rule resolution :premises (t166.t2 t166.a0))
% 0.37/0.60  (step t166 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry))) :rule subproof :discharge (t166.a0))
% 0.37/0.60  (step t167 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry))) (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry))) :rule resolution :premises (t165 t166))
% 0.37/0.60  (step t168 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry))) (not (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry)))) :rule implies_neg2)
% 0.37/0.60  (step t169 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry))) (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry)))) :rule resolution :premises (t167 t168))
% 0.37/0.60  (step t170 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry)))) :rule contraction :premises (t169))
% 0.37/0.60  (step t171 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry))) :rule implies :premises (t170))
% 0.37/0.60  (step t172 (cl (or (not (tptp.both tptp.barry)) (tptp.mustard tptp.barry))) :rule resolution :premises (t171 a1))
% 0.37/0.60  (step t173 (cl (not (tptp.oneof tptp.barry)) (tptp.salt tptp.lang)) :rule or :premises (a31))
% 0.37/0.60  (step t174 (cl (not (tptp.mustard tptp.barry)) (tptp.neither tptp.dix) (tptp.both tptp.mill)) :rule or :premises (a15))
% 0.37/0.60  (step t175 (cl (not (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix)))) (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix))) :rule or_pos)
% 0.37/0.60  (step t176 (cl (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix)) (not (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix))))) :rule reordering :premises (t175))
% 0.37/0.60  (step t177 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix)))) (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X))))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t178)
% 0.37/0.60  (assume t178.a0 (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))))
% 0.37/0.60  (step t178.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X))))) (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix))))) :rule forall_inst :args ((:= X tptp.dix)))
% 0.37/0.60  (step t178.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X))))) (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix)))) :rule or :premises (t178.t1))
% 0.37/0.60  (step t178.t3 (cl (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix)))) :rule resolution :premises (t178.t2 t178.a0))
% 0.37/0.60  (step t178 (cl (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X))))) (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix)))) :rule subproof :discharge (t178.a0))
% 0.37/0.60  (step t179 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix)))) (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix)))) :rule resolution :premises (t177 t178))
% 0.37/0.60  (step t180 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix)))) (not (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix))))) :rule implies_neg2)
% 0.37/0.60  (step t181 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix)))) (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix))))) :rule resolution :premises (t179 t180))
% 0.37/0.60  (step t182 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X)))) (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix))))) :rule contraction :premises (t181))
% 0.37/0.60  (step t183 (cl (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.mustard X))))) (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix)))) :rule implies :premises (t182))
% 0.37/0.60  (step t184 (cl (or (not (tptp.neither tptp.dix)) (not (tptp.mustard tptp.dix)))) :rule resolution :premises (t183 a10))
% 0.37/0.60  (step t185 (cl (tptp.both tptp.lang) (tptp.both tptp.mill) (tptp.both tptp.lang) (not (tptp.mustard tptp.lang)) (not (tptp.mustard tptp.lang)) (not (tptp.mustard tptp.dix))) :rule resolution :premises (t142 t150 t152 t160 t162 t164 t172 t173 t67 t75 t174 t77 t85 t125 t133 t176 t184))
% 0.37/0.60  (step t186 (cl (tptp.both tptp.lang) (tptp.both tptp.mill) (not (tptp.mustard tptp.lang)) (not (tptp.mustard tptp.dix))) :rule contraction :premises (t185))
% 0.37/0.60  (step t187 (cl (not (tptp.neither tptp.mill)) (tptp.mustard tptp.lang)) :rule or :premises (a35))
% 0.37/0.60  (step t188 (cl (not (tptp.neither tptp.mill)) (tptp.mustard tptp.dix)) :rule or :premises (a29))
% 0.37/0.60  (step t189 (cl (tptp.both tptp.lang) (tptp.both tptp.mill) (not (tptp.neither tptp.mill)) (not (tptp.neither tptp.mill))) :rule resolution :premises (t186 t187 t188))
% 0.37/0.60  (step t190 (cl (tptp.both tptp.lang) (tptp.both tptp.mill) (not (tptp.neither tptp.mill))) :rule contraction :premises (t189))
% 0.37/0.60  (step t191 (cl (not (tptp.salt tptp.cole)) (tptp.oneof tptp.barry) (tptp.neither tptp.mill)) :rule or :premises (a18))
% 0.37/0.60  (step t192 (cl (not (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry)))) (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry))) :rule or_pos)
% 0.37/0.60  (step t193 (cl (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry)) (not (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry))))) :rule reordering :premises (t192))
% 0.37/0.60  (step t194 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry)))) (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X))))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t195)
% 0.37/0.60  (assume t195.a0 (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))))
% 0.37/0.60  (step t195.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X))))) (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry))))) :rule forall_inst :args ((:= X tptp.barry)))
% 0.37/0.60  (step t195.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X))))) (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry)))) :rule or :premises (t195.t1))
% 0.37/0.60  (step t195.t3 (cl (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry)))) :rule resolution :premises (t195.t2 t195.a0))
% 0.37/0.60  (step t195 (cl (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X))))) (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry)))) :rule subproof :discharge (t195.a0))
% 0.37/0.60  (step t196 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry)))) (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry)))) :rule resolution :premises (t194 t195))
% 0.37/0.60  (step t197 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry)))) (not (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry))))) :rule implies_neg2)
% 0.37/0.60  (step t198 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry)))) (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry))))) :rule resolution :premises (t196 t197))
% 0.37/0.60  (step t199 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry))))) :rule contraction :premises (t198))
% 0.37/0.60  (step t200 (cl (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X))))) (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry)))) :rule implies :premises (t199))
% 0.37/0.60  (step t201 (cl (or (not (tptp.oneof tptp.barry)) (not (tptp.both tptp.barry)))) :rule resolution :premises (t200 a4))
% 0.37/0.60  (step t202 (cl (not (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole))) (not (tptp.both tptp.cole)) (tptp.salt tptp.cole)) :rule or_pos)
% 0.37/0.60  (step t203 (cl (tptp.salt tptp.cole) (not (tptp.both tptp.cole)) (not (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole)))) :rule reordering :premises (t202))
% 0.37/0.60  (step t204 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X))) (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole))) (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t205)
% 0.37/0.60  (assume t205.a0 (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X))))
% 0.37/0.60  (step t205.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X)))) (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole)))) :rule forall_inst :args ((:= X tptp.cole)))
% 0.37/0.60  (step t205.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X)))) (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole))) :rule or :premises (t205.t1))
% 0.37/0.60  (step t205.t3 (cl (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole))) :rule resolution :premises (t205.t2 t205.a0))
% 0.37/0.60  (step t205 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X)))) (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole))) :rule subproof :discharge (t205.a0))
% 0.37/0.60  (step t206 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X))) (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole))) (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole))) :rule resolution :premises (t204 t205))
% 0.37/0.60  (step t207 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X))) (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole))) (not (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole)))) :rule implies_neg2)
% 0.37/0.60  (step t208 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X))) (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole))) (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X))) (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole)))) :rule resolution :premises (t206 t207))
% 0.37/0.60  (step t209 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X))) (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole)))) :rule contraction :premises (t208))
% 0.37/0.60  (step t210 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X)))) (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole))) :rule implies :premises (t209))
% 0.37/0.60  (step t211 (cl (or (not (tptp.both tptp.cole)) (tptp.salt tptp.cole))) :rule resolution :premises (t210 a0))
% 0.37/0.60  (step t212 (cl (not (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole))) (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole)) :rule or_pos)
% 0.37/0.60  (step t213 (cl (tptp.oneof tptp.cole) (tptp.both tptp.cole) (tptp.neither tptp.cole) (not (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole)))) :rule reordering :premises (t212))
% 0.37/0.60  (step t214 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole))) (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t215)
% 0.37/0.60  (assume t215.a0 (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))))
% 0.37/0.60  (step t215.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole)))) :rule forall_inst :args ((:= X tptp.cole)))
% 0.37/0.60  (step t215.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole))) :rule or :premises (t215.t1))
% 0.37/0.60  (step t215.t3 (cl (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole))) :rule resolution :premises (t215.t2 t215.a0))
% 0.37/0.60  (step t215 (cl (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole))) :rule subproof :discharge (t215.a0))
% 0.37/0.60  (step t216 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole))) (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole))) :rule resolution :premises (t214 t215))
% 0.37/0.60  (step t217 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole))) (not (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole)))) :rule implies_neg2)
% 0.37/0.60  (step t218 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole))) (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole)))) :rule resolution :premises (t216 t217))
% 0.37/0.60  (step t219 (cl (=> (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X))) (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole)))) :rule contraction :premises (t218))
% 0.37/0.60  (step t220 (cl (not (forall ((X $$unsorted)) (or (tptp.both X) (tptp.neither X) (tptp.oneof X)))) (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole))) :rule implies :premises (t219))
% 0.37/0.60  (step t221 (cl (or (tptp.both tptp.cole) (tptp.neither tptp.cole) (tptp.oneof tptp.cole))) :rule resolution :premises (t220 a6))
% 0.37/0.60  (step t222 (cl (not (tptp.oneof tptp.cole)) (tptp.mustard tptp.mill)) :rule or :premises (a40))
% 0.37/0.60  (step t223 (cl (not (tptp.neither tptp.cole)) (tptp.mustard tptp.lang)) :rule or :premises (a34))
% 0.37/0.60  (step t224 (cl (tptp.mustard tptp.lang) (not (tptp.neither tptp.cole))) :rule reordering :premises (t223))
% 0.37/0.60  (step t225 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang))) (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t226)
% 0.37/0.60  (assume t226.a0 (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))))
% 0.37/0.60  (step t226.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang)))) :rule forall_inst :args ((:= X tptp.lang)))
% 0.37/0.60  (step t226.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang))) :rule or :premises (t226.t1))
% 0.37/0.60  (step t226.t3 (cl (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang))) :rule resolution :premises (t226.t2 t226.a0))
% 0.37/0.60  (step t226 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang))) :rule subproof :discharge (t226.a0))
% 0.37/0.60  (step t227 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang))) (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang))) :rule resolution :premises (t225 t226))
% 0.37/0.60  (step t228 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang))) (not (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang)))) :rule implies_neg2)
% 0.37/0.60  (step t229 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang))) (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang)))) :rule resolution :premises (t227 t228))
% 0.37/0.60  (step t230 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang)))) :rule contraction :premises (t229))
% 0.37/0.60  (step t231 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang))) :rule implies :premises (t230))
% 0.37/0.60  (step t232 (cl (tptp.neither tptp.mill) (tptp.neither tptp.mill) (tptp.mustard tptp.mill) (tptp.mustard tptp.mill) (tptp.mustard tptp.lang) (tptp.mustard tptp.lang)) :rule resolution :premises (t191 t193 t201 t203 t211 t15 t213 t221 t29 t37 t222 t224 t140 t231 a1))
% 0.37/0.60  (step t233 (cl (tptp.neither tptp.mill) (tptp.mustard tptp.mill) (tptp.mustard tptp.lang)) :rule contraction :premises (t232))
% 0.37/0.60  (step t234 (cl (tptp.neither tptp.mill) (tptp.mustard tptp.mill) (tptp.neither tptp.mill)) :rule resolution :premises (t233 t138))
% 0.37/0.60  (step t235 (cl (tptp.neither tptp.mill) (tptp.mustard tptp.mill)) :rule contraction :premises (t234))
% 0.37/0.60  (step t236 (cl (tptp.both tptp.lang) (tptp.mustard tptp.mill) (tptp.mustard tptp.mill)) :rule resolution :premises (t190 t235 t39 t47))
% 0.37/0.60  (step t237 (cl (tptp.both tptp.lang) (tptp.mustard tptp.mill)) :rule contraction :premises (t236))
% 0.37/0.60  (step t238 (cl (not (tptp.neither tptp.mill)) (tptp.mustard tptp.lang)) :rule or :premises (a35))
% 0.37/0.60  (step t239 (cl (not (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix))) (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix)) :rule or_pos)
% 0.37/0.60  (step t240 (cl (tptp.neither tptp.dix) (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (not (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix)))) :rule reordering :premises (t239))
% 0.37/0.60  (step t241 (cl (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix))) (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t242)
% 0.37/0.60  (assume t242.a0 (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))))
% 0.37/0.60  (step t242.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X)))) (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix)))) :rule forall_inst :args ((:= X tptp.dix)))
% 0.37/0.60  (step t242.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X)))) (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix))) :rule or :premises (t242.t1))
% 0.37/0.60  (step t242.t3 (cl (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix))) :rule resolution :premises (t242.t2 t242.a0))
% 0.37/0.60  (step t242 (cl (not (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X)))) (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix))) :rule subproof :discharge (t242.a0))
% 0.37/0.60  (step t243 (cl (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix))) (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix))) :rule resolution :premises (t241 t242))
% 0.37/0.60  (step t244 (cl (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix))) (not (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix)))) :rule implies_neg2)
% 0.37/0.60  (step t245 (cl (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix))) (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix)))) :rule resolution :premises (t243 t244))
% 0.37/0.60  (step t246 (cl (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix)))) :rule contraction :premises (t245))
% 0.37/0.60  (step t247 (cl (not (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X)))) (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix))) :rule implies :premises (t246))
% 0.37/0.60  (step t248 (cl (or (tptp.salt tptp.dix) (tptp.mustard tptp.dix) (tptp.neither tptp.dix))) :rule resolution :premises (t247 a11))
% 0.37/0.60  (step t249 (cl (not (tptp.salt tptp.dix)) (tptp.neither tptp.barry) (tptp.both tptp.cole)) :rule or :premises (a24))
% 0.37/0.60  (step t250 (cl (not (tptp.neither tptp.dix)) (tptp.mustard tptp.barry)) :rule or :premises (a16))
% 0.37/0.60  (step t251 (cl (tptp.mustard tptp.barry) (not (tptp.neither tptp.dix))) :rule reordering :premises (t250))
% 0.37/0.60  (step t252 (cl (not (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole))) (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole)) :rule or_pos)
% 0.37/0.60  (step t253 (cl (tptp.mustard tptp.cole) (not (tptp.both tptp.cole)) (not (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole)))) :rule reordering :premises (t252))
% 0.37/0.60  (step t254 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole))) (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t255)
% 0.37/0.60  (assume t255.a0 (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))))
% 0.37/0.60  (step t255.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole)))) :rule forall_inst :args ((:= X tptp.cole)))
% 0.37/0.60  (step t255.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole))) :rule or :premises (t255.t1))
% 0.37/0.60  (step t255.t3 (cl (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole))) :rule resolution :premises (t255.t2 t255.a0))
% 0.37/0.60  (step t255 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole))) :rule subproof :discharge (t255.a0))
% 0.37/0.60  (step t256 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole))) (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole))) :rule resolution :premises (t254 t255))
% 0.37/0.60  (step t257 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole))) (not (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole)))) :rule implies_neg2)
% 0.37/0.60  (step t258 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole))) (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole)))) :rule resolution :premises (t256 t257))
% 0.37/0.60  (step t259 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X))) (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole)))) :rule contraction :premises (t258))
% 0.37/0.60  (step t260 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.mustard X)))) (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole))) :rule implies :premises (t259))
% 0.37/0.60  (step t261 (cl (or (not (tptp.both tptp.cole)) (tptp.mustard tptp.cole))) :rule resolution :premises (t260 a1))
% 0.37/0.60  (step t262 (cl (not (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry))) (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry)) :rule or_pos)
% 0.37/0.60  (step t263 (cl (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry) (not (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry)))) :rule reordering :premises (t262))
% 0.37/0.60  (step t264 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry))) (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t265)
% 0.37/0.60  (assume t265.a0 (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))))
% 0.37/0.60  (step t265.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry)))) :rule forall_inst :args ((:= X tptp.barry)))
% 0.37/0.60  (step t265.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry))) :rule or :premises (t265.t1))
% 0.37/0.60  (step t265.t3 (cl (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry))) :rule resolution :premises (t265.t2 t265.a0))
% 0.37/0.60  (step t265 (cl (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry))) :rule subproof :discharge (t265.a0))
% 0.37/0.60  (step t266 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry))) (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry))) :rule resolution :premises (t264 t265))
% 0.37/0.60  (step t267 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry))) (not (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry)))) :rule implies_neg2)
% 0.37/0.60  (step t268 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry))) (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry)))) :rule resolution :premises (t266 t267))
% 0.37/0.60  (step t269 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry)))) :rule contraction :premises (t268))
% 0.37/0.60  (step t270 (cl (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry))) :rule implies :premises (t269))
% 0.37/0.60  (step t271 (cl (or (not (tptp.salt tptp.barry)) (not (tptp.mustard tptp.barry)) (tptp.both tptp.barry))) :rule resolution :premises (t270 a2))
% 0.37/0.60  (step t272 (cl (not (tptp.mustard tptp.cole)) (tptp.both tptp.dix) (tptp.both tptp.lang)) :rule or :premises (a21))
% 0.37/0.60  (step t273 (cl (tptp.mustard tptp.dix) (tptp.neither tptp.barry) (tptp.both tptp.barry) (tptp.both tptp.lang) (tptp.mustard tptp.dix) (tptp.both tptp.lang) (tptp.neither tptp.lang)) :rule resolution :premises (t240 t248 t249 t251 t253 t261 t263 t271 t272 t162 t91 t99 t67 t75))
% 0.37/0.60  (step t274 (cl (tptp.mustard tptp.dix) (tptp.neither tptp.barry) (tptp.both tptp.barry) (tptp.both tptp.lang) (tptp.neither tptp.lang)) :rule contraction :premises (t273))
% 0.37/0.60  (step t275 (cl (tptp.neither tptp.barry) (tptp.both tptp.barry) (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.neither tptp.mill) (tptp.neither tptp.lang)) :rule resolution :premises (t274 t121))
% 0.37/0.60  (step t276 (cl (tptp.neither tptp.barry) (tptp.both tptp.barry) (tptp.both tptp.lang) (tptp.neither tptp.lang) (tptp.neither tptp.mill)) :rule contraction :premises (t275))
% 0.37/0.60  (step t277 (cl (not (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang)))) (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang))) :rule or_pos)
% 0.37/0.60  (step t278 (cl (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang)) (not (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang))))) :rule reordering :premises (t277))
% 0.37/0.60  (step t279 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X)))) (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang)))) (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X))))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t280)
% 0.37/0.60  (assume t280.a0 (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X)))))
% 0.37/0.60  (step t280.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X))))) (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang))))) :rule forall_inst :args ((:= X tptp.lang)))
% 0.37/0.60  (step t280.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X))))) (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang)))) :rule or :premises (t280.t1))
% 0.37/0.60  (step t280.t3 (cl (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang)))) :rule resolution :premises (t280.t2 t280.a0))
% 0.37/0.60  (step t280 (cl (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X))))) (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang)))) :rule subproof :discharge (t280.a0))
% 0.37/0.60  (step t281 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X)))) (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang)))) (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang)))) :rule resolution :premises (t279 t280))
% 0.37/0.60  (step t282 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X)))) (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang)))) (not (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang))))) :rule implies_neg2)
% 0.37/0.60  (step t283 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X)))) (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang)))) (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X)))) (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang))))) :rule resolution :premises (t281 t282))
% 0.37/0.60  (step t284 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X)))) (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang))))) :rule contraction :premises (t283))
% 0.37/0.60  (step t285 (cl (not (forall ((X $$unsorted)) (or (not (tptp.neither X)) (not (tptp.salt X))))) (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang)))) :rule implies :premises (t284))
% 0.37/0.60  (step t286 (cl (or (not (tptp.neither tptp.lang)) (not (tptp.salt tptp.lang)))) :rule resolution :premises (t285 a9))
% 0.37/0.60  (step t287 (cl (not (tptp.oneof tptp.barry)) (tptp.salt tptp.lang)) :rule or :premises (a31))
% 0.37/0.60  (step t288 (cl (tptp.neither tptp.barry) (tptp.both tptp.barry) (tptp.both tptp.lang) (tptp.neither tptp.mill) (tptp.neither tptp.barry) (tptp.both tptp.barry)) :rule resolution :premises (t276 t278 t286 t287 t152 t160))
% 0.37/0.60  (step t289 (cl (tptp.neither tptp.barry) (tptp.both tptp.barry) (tptp.both tptp.lang) (tptp.neither tptp.mill)) :rule contraction :premises (t288))
% 0.37/0.60  (step t290 (cl (tptp.neither tptp.mill) (tptp.both tptp.lang) (tptp.neither tptp.barry) (tptp.both tptp.barry)) :rule reordering :premises (t289))
% 0.37/0.60  (step t291 (cl (not (tptp.neither tptp.mill)) (tptp.mustard tptp.dix)) :rule or :premises (a29))
% 0.37/0.60  (step t292 (cl (not (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix))) (not (tptp.both tptp.dix)) (tptp.salt tptp.dix)) :rule or_pos)
% 0.37/0.60  (step t293 (cl (not (tptp.both tptp.dix)) (tptp.salt tptp.dix) (not (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix)))) :rule reordering :premises (t292))
% 0.37/0.60  (step t294 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X))) (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix))) (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t295)
% 0.37/0.60  (assume t295.a0 (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X))))
% 0.37/0.60  (step t295.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X)))) (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix)))) :rule forall_inst :args ((:= X tptp.dix)))
% 0.37/0.60  (step t295.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X)))) (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix))) :rule or :premises (t295.t1))
% 0.37/0.60  (step t295.t3 (cl (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix))) :rule resolution :premises (t295.t2 t295.a0))
% 0.37/0.60  (step t295 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X)))) (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix))) :rule subproof :discharge (t295.a0))
% 0.37/0.60  (step t296 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X))) (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix))) (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix))) :rule resolution :premises (t294 t295))
% 0.37/0.60  (step t297 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X))) (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix))) (not (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix)))) :rule implies_neg2)
% 0.37/0.60  (step t298 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X))) (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix))) (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X))) (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix)))) :rule resolution :premises (t296 t297))
% 0.37/0.60  (step t299 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X))) (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix)))) :rule contraction :premises (t298))
% 0.37/0.60  (step t300 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (tptp.salt X)))) (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix))) :rule implies :premises (t299))
% 0.37/0.60  (step t301 (cl (or (not (tptp.both tptp.dix)) (tptp.salt tptp.dix))) :rule resolution :premises (t300 a0))
% 0.37/0.60  (step t302 (cl (not (tptp.salt tptp.dix)) (tptp.neither tptp.barry) (tptp.both tptp.cole)) :rule or :premises (a24))
% 0.37/0.60  (step t303 (cl (not (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole)))) (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole))) :rule or_pos)
% 0.37/0.60  (step t304 (cl (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole)) (not (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole))))) :rule reordering :premises (t303))
% 0.37/0.60  (step t305 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole)))) (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X))))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t306)
% 0.37/0.60  (assume t306.a0 (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))))
% 0.37/0.60  (step t306.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X))))) (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole))))) :rule forall_inst :args ((:= X tptp.cole)))
% 0.37/0.60  (step t306.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X))))) (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole)))) :rule or :premises (t306.t1))
% 0.37/0.60  (step t306.t3 (cl (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole)))) :rule resolution :premises (t306.t2 t306.a0))
% 0.37/0.60  (step t306 (cl (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X))))) (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole)))) :rule subproof :discharge (t306.a0))
% 0.37/0.60  (step t307 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole)))) (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole)))) :rule resolution :premises (t305 t306))
% 0.37/0.60  (step t308 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole)))) (not (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole))))) :rule implies_neg2)
% 0.37/0.60  (step t309 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole)))) (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole))))) :rule resolution :premises (t307 t308))
% 0.37/0.60  (step t310 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole))))) :rule contraction :premises (t309))
% 0.37/0.60  (step t311 (cl (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X))))) (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole)))) :rule implies :premises (t310))
% 0.37/0.60  (step t312 (cl (or (not (tptp.oneof tptp.cole)) (not (tptp.both tptp.cole)))) :rule resolution :premises (t311 a4))
% 0.37/0.60  (step t313 (cl (tptp.oneof tptp.dix) (not (tptp.mustard tptp.lang)) (tptp.neither tptp.barry) (not (tptp.oneof tptp.cole)) (not (tptp.oneof tptp.cole))) :rule resolution :premises (t176 t184 t49 t57 t291 t293 t301 t135 t302 t111 t119 t304 t312))
% 0.37/0.60  (step t314 (cl (tptp.oneof tptp.dix) (not (tptp.mustard tptp.lang)) (tptp.neither tptp.barry) (not (tptp.oneof tptp.cole))) :rule contraction :premises (t313))
% 0.37/0.60  (step t315 (cl (tptp.oneof tptp.dix) (not (tptp.mustard tptp.lang)) (tptp.neither tptp.barry) (tptp.oneof tptp.dix) (not (tptp.mustard tptp.mill))) :rule resolution :premises (t314 t61))
% 0.37/0.60  (step t316 (cl (tptp.oneof tptp.dix) (not (tptp.mustard tptp.lang)) (tptp.neither tptp.barry) (not (tptp.mustard tptp.mill))) :rule contraction :premises (t315))
% 0.37/0.60  (step t317 (cl (not (tptp.mustard tptp.lang)) (tptp.neither tptp.barry) (not (tptp.mustard tptp.mill)) (tptp.both tptp.lang) (not (tptp.mustard tptp.lang))) :rule resolution :premises (t316 t65 t77 t85))
% 0.37/0.60  (step t318 (cl (not (tptp.mustard tptp.lang)) (tptp.neither tptp.barry) (not (tptp.mustard tptp.mill)) (tptp.both tptp.lang)) :rule contraction :premises (t317))
% 0.37/0.60  (step t319 (cl (tptp.both tptp.lang) (tptp.neither tptp.barry) (not (tptp.mustard tptp.lang)) (not (tptp.mustard tptp.mill))) :rule reordering :premises (t318))
% 0.37/0.60  (step t320 (cl (tptp.both tptp.lang) (tptp.neither tptp.barry) (tptp.both tptp.barry) (tptp.both tptp.lang) (tptp.neither tptp.barry) (not (tptp.mustard tptp.mill))) :rule resolution :premises (t238 t290 t319))
% 0.37/0.60  (step t321 (cl (tptp.both tptp.lang) (tptp.neither tptp.barry) (tptp.both tptp.barry) (not (tptp.mustard tptp.mill))) :rule contraction :premises (t320))
% 0.37/0.60  (step t322 (cl (not (tptp.oneof tptp.cole)) (tptp.salt tptp.barry)) :rule or :premises (a13))
% 0.37/0.60  (step t323 (cl (tptp.salt tptp.barry) (not (tptp.oneof tptp.cole))) :rule reordering :premises (t322))
% 0.37/0.60  (step t324 (cl (tptp.both tptp.lang) (not (tptp.mustard tptp.mill)) (tptp.salt tptp.barry) (tptp.salt tptp.barry)) :rule resolution :premises (t278 t286 t65 t67 t75 t61 t162 t323))
% 0.37/0.60  (step t325 (cl (tptp.both tptp.lang) (not (tptp.mustard tptp.mill)) (tptp.salt tptp.barry)) :rule contraction :premises (t324))
% 0.37/0.60  (step t326 (cl (tptp.salt tptp.barry) (tptp.both tptp.lang) (not (tptp.mustard tptp.mill))) :rule reordering :premises (t325))
% 0.37/0.60  (step t327 (cl (not (tptp.mustard tptp.cole)) (tptp.both tptp.dix) (tptp.both tptp.lang)) :rule or :premises (a21))
% 0.37/0.60  (step t328 (cl (not (tptp.salt tptp.dix)) (tptp.neither tptp.barry) (tptp.both tptp.cole)) :rule or :premises (a24))
% 0.37/0.60  (step t329 (cl (not (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole))) (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole)) :rule or_pos)
% 0.37/0.60  (step t330 (cl (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole) (not (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole)))) :rule reordering :premises (t329))
% 0.37/0.60  (step t331 (cl (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole))) (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t332)
% 0.37/0.60  (assume t332.a0 (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))))
% 0.37/0.60  (step t332.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X)))) (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole)))) :rule forall_inst :args ((:= X tptp.cole)))
% 0.37/0.60  (step t332.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X)))) (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole))) :rule or :premises (t332.t1))
% 0.37/0.60  (step t332.t3 (cl (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole))) :rule resolution :premises (t332.t2 t332.a0))
% 0.37/0.60  (step t332 (cl (not (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X)))) (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole))) :rule subproof :discharge (t332.a0))
% 0.37/0.60  (step t333 (cl (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole))) (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole))) :rule resolution :premises (t331 t332))
% 0.37/0.60  (step t334 (cl (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole))) (not (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole)))) :rule implies_neg2)
% 0.37/0.60  (step t335 (cl (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole))) (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole)))) :rule resolution :premises (t333 t334))
% 0.37/0.60  (step t336 (cl (=> (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X))) (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole)))) :rule contraction :premises (t335))
% 0.37/0.60  (step t337 (cl (not (forall ((X $$unsorted)) (or (tptp.salt X) (tptp.mustard X) (tptp.neither X)))) (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole))) :rule implies :premises (t336))
% 0.37/0.60  (step t338 (cl (or (tptp.salt tptp.cole) (tptp.mustard tptp.cole) (tptp.neither tptp.cole))) :rule resolution :premises (t337 a11))
% 0.37/0.60  (step t339 (cl (tptp.both tptp.lang) (tptp.neither tptp.barry) (tptp.salt tptp.cole) (tptp.neither tptp.cole) (tptp.salt tptp.cole)) :rule resolution :premises (t293 t301 t327 t328 t330 t338 t203 t211))
% 0.37/0.60  (step t340 (cl (tptp.both tptp.lang) (tptp.neither tptp.barry) (tptp.salt tptp.cole) (tptp.neither tptp.cole)) :rule contraction :premises (t339))
% 0.37/0.60  (step t341 (cl (not (tptp.salt tptp.cole)) (tptp.oneof tptp.barry) (tptp.neither tptp.mill)) :rule or :premises (a18))
% 0.37/0.60  (step t342 (cl (not (tptp.neither tptp.mill)) (tptp.mustard tptp.lang)) :rule or :premises (a35))
% 0.37/0.60  (step t343 (cl (tptp.both tptp.lang) (tptp.neither tptp.barry) (tptp.mustard tptp.lang) (tptp.mustard tptp.lang) (tptp.both tptp.lang) (not (tptp.salt tptp.mill))) :rule resolution :premises (t340 t341 t342 t224 t193 t201 t15))
% 0.37/0.60  (step t344 (cl (tptp.both tptp.lang) (tptp.neither tptp.barry) (tptp.mustard tptp.lang) (not (tptp.salt tptp.mill))) :rule contraction :premises (t343))
% 0.37/0.60  (step t345 (cl (tptp.both tptp.lang) (tptp.neither tptp.barry) (not (tptp.salt tptp.mill)) (tptp.both tptp.lang) (tptp.neither tptp.barry) (not (tptp.mustard tptp.mill))) :rule resolution :premises (t344 t319))
% 0.37/0.60  (step t346 (cl (tptp.both tptp.lang) (tptp.neither tptp.barry) (not (tptp.salt tptp.mill)) (not (tptp.mustard tptp.mill))) :rule contraction :premises (t345))
% 0.37/0.60  (step t347 (cl (not (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry)))) (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry))) :rule or_pos)
% 0.37/0.60  (step t348 (cl (not (tptp.neither tptp.barry)) (not (tptp.both tptp.barry)) (not (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry))))) :rule reordering :premises (t347))
% 0.37/0.60  (step t349 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (not (tptp.neither X)))) (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry)))) (forall ((X $$unsorted)) (or (not (tptp.both X)) (not (tptp.neither X))))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t350)
% 0.37/0.60  (assume t350.a0 (forall ((X $$unsorted)) (or (not (tptp.both X)) (not (tptp.neither X)))))
% 0.37/0.60  (step t350.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (not (tptp.neither X))))) (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry))))) :rule forall_inst :args ((:= X tptp.barry)))
% 0.37/0.60  (step t350.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (not (tptp.neither X))))) (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry)))) :rule or :premises (t350.t1))
% 0.37/0.60  (step t350.t3 (cl (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry)))) :rule resolution :premises (t350.t2 t350.a0))
% 0.37/0.60  (step t350 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (not (tptp.neither X))))) (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry)))) :rule subproof :discharge (t350.a0))
% 0.37/0.60  (step t351 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (not (tptp.neither X)))) (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry)))) (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry)))) :rule resolution :premises (t349 t350))
% 0.37/0.60  (step t352 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (not (tptp.neither X)))) (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry)))) (not (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry))))) :rule implies_neg2)
% 0.37/0.60  (step t353 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (not (tptp.neither X)))) (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry)))) (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (not (tptp.neither X)))) (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry))))) :rule resolution :premises (t351 t352))
% 0.37/0.60  (step t354 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.both X)) (not (tptp.neither X)))) (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry))))) :rule contraction :premises (t353))
% 0.37/0.60  (step t355 (cl (not (forall ((X $$unsorted)) (or (not (tptp.both X)) (not (tptp.neither X))))) (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry)))) :rule implies :premises (t354))
% 0.37/0.60  (step t356 (cl (or (not (tptp.both tptp.barry)) (not (tptp.neither tptp.barry)))) :rule resolution :premises (t355 a8))
% 0.37/0.60  (step t357 (cl (not (tptp.both tptp.barry)) (tptp.salt tptp.mill)) :rule or :premises (a37))
% 0.37/0.60  (step t358 (cl (tptp.salt tptp.mill) (not (tptp.both tptp.barry))) :rule reordering :premises (t357))
% 0.37/0.60  (step t359 (cl (tptp.both tptp.lang) (not (tptp.mustard tptp.mill)) (not (tptp.both tptp.barry)) (not (tptp.both tptp.barry))) :rule resolution :premises (t346 t348 t356 t358))
% 0.37/0.60  (step t360 (cl (tptp.both tptp.lang) (not (tptp.mustard tptp.mill)) (not (tptp.both tptp.barry))) :rule contraction :premises (t359))
% 0.37/0.60  (step t361 (cl (tptp.both tptp.lang) (not (tptp.both tptp.barry)) (not (tptp.mustard tptp.mill))) :rule reordering :premises (t360))
% 0.37/0.60  (step t362 (cl (tptp.both tptp.lang) (not (tptp.mustard tptp.mill)) (tptp.both tptp.lang) (not (tptp.mustard tptp.mill)) (tptp.both tptp.lang) (not (tptp.mustard tptp.mill))) :rule resolution :premises (t321 t142 t150 t326 t361))
% 0.37/0.60  (step t363 (cl (tptp.both tptp.lang) (not (tptp.mustard tptp.mill))) :rule contraction :premises (t362))
% 0.37/0.60  (step t364 (cl (tptp.both tptp.lang) (tptp.both tptp.lang)) :rule resolution :premises (t237 t363))
% 0.37/0.60  (step t365 (cl (tptp.both tptp.lang)) :rule contraction :premises (t364))
% 0.37/0.60  (step t366 (cl (or (not (tptp.both tptp.lang)) (tptp.mustard tptp.lang))) :rule resolution :premises (t231 a1))
% 0.37/0.60  (step t367 (cl (tptp.mustard tptp.lang)) :rule resolution :premises (t140 t365 t366))
% 0.37/0.60  (step t368 (cl (tptp.neither tptp.mill)) :rule resolution :premises (t138 t367))
% 0.37/0.60  (step t369 (cl (tptp.salt tptp.cole)) :rule resolution :premises (t11 t368))
% 0.37/0.60  (step t370 (cl (tptp.mustard tptp.cole)) :rule resolution :premises (t89 t365))
% 0.37/0.60  (step t371 (cl (not (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix))) (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix)) :rule or_pos)
% 0.37/0.60  (step t372 (cl (tptp.both tptp.dix) (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (not (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix)))) :rule reordering :premises (t371))
% 0.37/0.60  (step t373 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix))) (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t374)
% 0.37/0.60  (assume t374.a0 (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))))
% 0.37/0.60  (step t374.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix)))) :rule forall_inst :args ((:= X tptp.dix)))
% 0.37/0.60  (step t374.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix))) :rule or :premises (t374.t1))
% 0.37/0.60  (step t374.t3 (cl (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix))) :rule resolution :premises (t374.t2 t374.a0))
% 0.37/0.60  (step t374 (cl (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix))) :rule subproof :discharge (t374.a0))
% 0.37/0.60  (step t375 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix))) (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix))) :rule resolution :premises (t373 t374))
% 0.37/0.60  (step t376 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix))) (not (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix)))) :rule implies_neg2)
% 0.37/0.60  (step t377 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix))) (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix)))) :rule resolution :premises (t375 t376))
% 0.37/0.60  (step t378 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X))) (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix)))) :rule contraction :premises (t377))
% 0.37/0.60  (step t379 (cl (not (forall ((X $$unsorted)) (or (not (tptp.salt X)) (not (tptp.mustard X)) (tptp.both X)))) (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix))) :rule implies :premises (t378))
% 0.37/0.60  (step t380 (cl (or (not (tptp.salt tptp.dix)) (not (tptp.mustard tptp.dix)) (tptp.both tptp.dix))) :rule resolution :premises (t379 a2))
% 0.37/0.60  (step t381 (cl (not (tptp.neither tptp.mill)) (tptp.mustard tptp.dix)) :rule or :premises (a29))
% 0.37/0.60  (step t382 (cl (tptp.mustard tptp.dix)) :rule resolution :premises (t381 t368))
% 0.37/0.60  (step t383 (cl (not (tptp.both tptp.cole)) (tptp.salt tptp.dix)) :rule or :premises (a26))
% 0.37/0.60  (step t384 (cl (tptp.salt tptp.dix) (not (tptp.both tptp.cole))) :rule reordering :premises (t383))
% 0.37/0.60  (step t385 (cl (not (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix)))) (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix))) :rule or_pos)
% 0.37/0.60  (step t386 (cl (not (tptp.both tptp.dix)) (not (tptp.oneof tptp.dix)) (not (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix))))) :rule reordering :premises (t385))
% 0.37/0.60  (step t387 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix)))) (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X))))) :rule implies_neg1)
% 0.37/0.60  (anchor :step t388)
% 0.37/0.60  (assume t388.a0 (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))))
% 0.37/0.60  (step t388.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X))))) (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix))))) :rule forall_inst :args ((:= X tptp.dix)))
% 0.37/0.60  (step t388.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X))))) (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix)))) :rule or :premises (t388.t1))
% 0.37/0.60  (step t388.t3 (cl (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix)))) :rule resolution :premises (t388.t2 t388.a0))
% 0.37/0.60  (step t388 (cl (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X))))) (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix)))) :rule subproof :discharge (t388.a0))
% 0.37/0.60  (step t389 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix)))) (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix)))) :rule resolution :premises (t387 t388))
% 0.37/0.60  (step t390 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix)))) (not (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix))))) :rule implies_neg2)
% 0.37/0.60  (step t391 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix)))) (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix))))) :rule resolution :premises (t389 t390))
% 0.37/0.60  (step t392 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X)))) (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix))))) :rule contraction :premises (t391))
% 0.37/0.60  (step t393 (cl (not (forall ((X $$unsorted)) (or (not (tptp.oneof X)) (not (tptp.both X))))) (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix)))) :rule implies :premises (t392))
% 0.37/0.60  (step t394 (cl (or (not (tptp.oneof tptp.dix)) (not (tptp.both tptp.dix)))) :rule resolution :premises (t393 a4))
% 0.37/0.60  (step t395 (cl (not (tptp.neither tptp.cole))) :rule resolution :premises (t101 t370 t109))
% 0.37/0.60  (step t396 (cl (not (tptp.both tptp.lang)) (tptp.mustard tptp.mill)) :rule or :premises (a38))
% 0.37/0.60  (step t397 (cl (tptp.mustard tptp.mill)) :rule resolution :premises (t396 t365))
% 0.37/0.60  (step t398 (cl (tptp.oneof tptp.cole) (tptp.oneof tptp.cole)) :rule resolution :premises (t372 t380 t382 t384 t386 t394 t213 t221 t395 t61 t397))
% 0.37/0.60  (step t399 (cl (tptp.oneof tptp.cole)) :rule contraction :premises (t398))
% 0.37/0.60  (step t400 (cl (not (tptp.both tptp.cole))) :rule resolution :premises (t304 t399 t312))
% 0.37/0.60  (step t401 (cl (not (or (not (tptp.salt tptp.cole)) (not (tptp.mustard tptp.cole)) (tptp.both tptp.cole)))) :rule resolution :premises (t9 t369 t370 t400))
% 0.37/0.60  (step t402 (cl) :rule resolution :premises (t7 t401 a2))
% 0.37/0.60  
% 0.37/0.60  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.dvVrkTvogw/cvc5---1.0.5_26274.smt2
% 0.37/0.61  % cvc5---1.0.5 exiting
% 0.37/0.61  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------