TSTP Solution File: KRS067+1 by cvc5---1.0.5

View Problem - Process Solution

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

% Computer : n029.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:17:18 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : KRS067+1 : TPTP v8.2.0. Released v3.1.0.
% 0.06/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.34  % Computer : n029.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sun May 26 08:54:24 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.20/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.49  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.51  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.InsdCSNeUN/cvc5---1.0.5_20889.smt2
% 0.20/0.51  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.InsdCSNeUN/cvc5---1.0.5_20889.smt2
% 0.20/0.52  (assume a0 (forall ((X $$unsorted)) (and (tptp.cowlThing X) (not (tptp.cowlNothing X)))))
% 0.20/0.52  (assume a1 (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))))
% 0.20/0.52  (assume a2 (forall ((X $$unsorted)) (= (tptp.cUnsatisfiable X) (or (and (tptp.cc X) (tptp.cb X)) (and (tptp.cb X) (tptp.ca X)) (and (tptp.cc X) (tptp.ca X))))))
% 0.20/0.52  (assume a3 (forall ((X $$unsorted)) (=> (tptp.ca X) (not (or (tptp.cc X) (tptp.cb X))))))
% 0.20/0.52  (assume a4 (forall ((X $$unsorted)) (=> (tptp.cb X) (not (tptp.cc X)))))
% 0.20/0.52  (assume a5 (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956))
% 0.20/0.52  (step t1 (cl (not (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))))) (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956)))) :rule or_pos)
% 0.20/0.52  (step t2 (cl (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))) (not (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956)))))) :rule reordering :premises (t1))
% 0.20/0.52  (step t3 (cl (not (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956)))) (not (tptp.cc tptp.i2003_11_14_17_18_1956))) :rule and_pos)
% 0.20/0.52  (step t4 (cl (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))))) :rule reordering :premises (t3))
% 0.20/0.52  (step t5 (cl (not (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))) (tptp.cc tptp.i2003_11_14_17_18_1956)) :rule and_pos)
% 0.20/0.52  (step t6 (cl (tptp.cc tptp.i2003_11_14_17_18_1956) (not (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)))) :rule reordering :premises (t5))
% 0.20/0.52  (step t7 (cl (not (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)))) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))) :rule or_pos)
% 0.20/0.52  (step t8 (cl (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (not (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))))) :rule reordering :premises (t7))
% 0.20/0.52  (step t9 (cl (not (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956)))) (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956))) :rule or_pos)
% 0.20/0.52  (step t10 (cl (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956))))) :rule reordering :premises (t9))
% 0.20/0.52  (step t11 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X)))) (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956)))) (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X))))) :rule implies_neg1)
% 0.20/0.52  (anchor :step t12)
% 0.20/0.52  (assume t12.a0 (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X)))))
% 0.20/0.52  (step t12.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X))))) (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956))))) :rule forall_inst :args ((:= X tptp.i2003_11_14_17_18_1956)))
% 0.20/0.52  (step t12.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X))))) (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956)))) :rule or :premises (t12.t1))
% 0.20/0.52  (step t12.t3 (cl (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956)))) :rule resolution :premises (t12.t2 t12.a0))
% 0.20/0.52  (step t12 (cl (not (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X))))) (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956)))) :rule subproof :discharge (t12.a0))
% 0.20/0.52  (step t13 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X)))) (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956)))) (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956)))) :rule resolution :premises (t11 t12))
% 0.20/0.52  (step t14 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X)))) (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956)))) (not (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956))))) :rule implies_neg2)
% 0.20/0.52  (step t15 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X)))) (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956)))) (=> (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X)))) (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956))))) :rule resolution :premises (t13 t14))
% 0.20/0.52  (step t16 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X)))) (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956))))) :rule contraction :premises (t15))
% 0.20/0.52  (step t17 (cl (not (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X))))) (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956)))) :rule implies :premises (t16))
% 0.20/0.52  (step t18 (cl (not (= (forall ((X $$unsorted)) (=> (tptp.cb X) (not (tptp.cc X)))) (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X)))))) (not (forall ((X $$unsorted)) (=> (tptp.cb X) (not (tptp.cc X))))) (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X))))) :rule equiv_pos2)
% 0.20/0.52  (step t19 (cl (= (forall ((X $$unsorted)) (=> (tptp.cb X) (not (tptp.cc X)))) (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X)))))) :rule all_simplify)
% 0.20/0.52  (step t20 (cl (forall ((X $$unsorted)) (or (not (tptp.cb X)) (not (tptp.cc X))))) :rule resolution :premises (t18 t19 a4))
% 0.20/0.52  (step t21 (cl (or (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956)))) :rule resolution :premises (t17 t20))
% 0.20/0.52  (step t22 (cl (not (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956))) (tptp.cb tptp.i2003_11_14_17_18_1956)) :rule and_pos)
% 0.20/0.52  (step t23 (cl (tptp.cb tptp.i2003_11_14_17_18_1956) (not (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)))) :rule reordering :premises (t22))
% 0.20/0.52  (step t24 (cl (not (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956))) (tptp.cc tptp.i2003_11_14_17_18_1956)) :rule and_pos)
% 0.20/0.52  (step t25 (cl (tptp.cc tptp.i2003_11_14_17_18_1956) (not (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)))) :rule reordering :premises (t24))
% 0.20/0.52  (step t26 (cl (not (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956))) (not (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)))) :rule resolution :premises (t10 t21 t23 t25))
% 0.20/0.52  (step t27 (cl (not (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)))) :rule contraction :premises (t26))
% 0.20/0.52  (step t28 (cl (not (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))) (tptp.cb tptp.i2003_11_14_17_18_1956)) :rule and_pos)
% 0.20/0.52  (step t29 (cl (tptp.cb tptp.i2003_11_14_17_18_1956) (not (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)))) :rule reordering :premises (t28))
% 0.20/0.52  (step t30 (cl (not (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))) (tptp.ca tptp.i2003_11_14_17_18_1956)) :rule and_pos)
% 0.20/0.52  (step t31 (cl (tptp.ca tptp.i2003_11_14_17_18_1956) (not (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)))) :rule reordering :premises (t30))
% 0.20/0.52  (step t32 (cl (not (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))))) (not (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956)) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)))) :rule equiv_pos2)
% 0.20/0.52  (step t33 (cl (not (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956)) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))) (not (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)))))) :rule reordering :premises (t32))
% 0.20/0.52  (step t34 (cl (=> (forall ((X $$unsorted)) (= (tptp.cUnsatisfiable X) (or (and (tptp.cc X) (tptp.cb X)) (and (tptp.cb X) (tptp.ca X)) (and (tptp.cc X) (tptp.ca X))))) (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))))) (forall ((X $$unsorted)) (= (tptp.cUnsatisfiable X) (or (and (tptp.cc X) (tptp.cb X)) (and (tptp.cb X) (tptp.ca X)) (and (tptp.cc X) (tptp.ca X)))))) :rule implies_neg1)
% 0.20/0.52  (anchor :step t35)
% 0.20/0.52  (assume t35.a0 (forall ((X $$unsorted)) (= (tptp.cUnsatisfiable X) (or (and (tptp.cc X) (tptp.cb X)) (and (tptp.cb X) (tptp.ca X)) (and (tptp.cc X) (tptp.ca X))))))
% 0.20/0.52  (step t35.t1 (cl (or (not (forall ((X $$unsorted)) (= (tptp.cUnsatisfiable X) (or (and (tptp.cc X) (tptp.cb X)) (and (tptp.cb X) (tptp.ca X)) (and (tptp.cc X) (tptp.ca X)))))) (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)))))) :rule forall_inst :args ((:= X tptp.i2003_11_14_17_18_1956)))
% 0.20/0.52  (step t35.t2 (cl (not (forall ((X $$unsorted)) (= (tptp.cUnsatisfiable X) (or (and (tptp.cc X) (tptp.cb X)) (and (tptp.cb X) (tptp.ca X)) (and (tptp.cc X) (tptp.ca X)))))) (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))))) :rule or :premises (t35.t1))
% 0.20/0.52  (step t35.t3 (cl (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))))) :rule resolution :premises (t35.t2 t35.a0))
% 0.20/0.52  (step t35 (cl (not (forall ((X $$unsorted)) (= (tptp.cUnsatisfiable X) (or (and (tptp.cc X) (tptp.cb X)) (and (tptp.cb X) (tptp.ca X)) (and (tptp.cc X) (tptp.ca X)))))) (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))))) :rule subproof :discharge (t35.a0))
% 0.20/0.52  (step t36 (cl (=> (forall ((X $$unsorted)) (= (tptp.cUnsatisfiable X) (or (and (tptp.cc X) (tptp.cb X)) (and (tptp.cb X) (tptp.ca X)) (and (tptp.cc X) (tptp.ca X))))) (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))))) (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))))) :rule resolution :premises (t34 t35))
% 0.20/0.52  (step t37 (cl (=> (forall ((X $$unsorted)) (= (tptp.cUnsatisfiable X) (or (and (tptp.cc X) (tptp.cb X)) (and (tptp.cb X) (tptp.ca X)) (and (tptp.cc X) (tptp.ca X))))) (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))))) (not (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)))))) :rule implies_neg2)
% 0.20/0.52  (step t38 (cl (=> (forall ((X $$unsorted)) (= (tptp.cUnsatisfiable X) (or (and (tptp.cc X) (tptp.cb X)) (and (tptp.cb X) (tptp.ca X)) (and (tptp.cc X) (tptp.ca X))))) (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))))) (=> (forall ((X $$unsorted)) (= (tptp.cUnsatisfiable X) (or (and (tptp.cc X) (tptp.cb X)) (and (tptp.cb X) (tptp.ca X)) (and (tptp.cc X) (tptp.ca X))))) (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)))))) :rule resolution :premises (t36 t37))
% 0.20/0.52  (step t39 (cl (=> (forall ((X $$unsorted)) (= (tptp.cUnsatisfiable X) (or (and (tptp.cc X) (tptp.cb X)) (and (tptp.cb X) (tptp.ca X)) (and (tptp.cc X) (tptp.ca X))))) (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)))))) :rule contraction :premises (t38))
% 0.20/0.52  (step t40 (cl (not (forall ((X $$unsorted)) (= (tptp.cUnsatisfiable X) (or (and (tptp.cc X) (tptp.cb X)) (and (tptp.cb X) (tptp.ca X)) (and (tptp.cc X) (tptp.ca X)))))) (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))))) :rule implies :premises (t39))
% 0.20/0.52  (step t41 (cl (= (tptp.cUnsatisfiable tptp.i2003_11_14_17_18_1956) (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))))) :rule resolution :premises (t40 a2))
% 0.20/0.52  (step t42 (cl (or (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)))) :rule resolution :premises (t33 a5 t41))
% 0.20/0.52  (step t43 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X))))) (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))))) (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X)))))) :rule implies_neg1)
% 0.20/0.52  (anchor :step t44)
% 0.20/0.52  (assume t44.a0 (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X))))))
% 0.20/0.52  (step t44.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X)))))) (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956)))))) :rule forall_inst :args ((:= X tptp.i2003_11_14_17_18_1956)))
% 0.20/0.52  (step t44.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X)))))) (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))))) :rule or :premises (t44.t1))
% 0.20/0.52  (step t44.t3 (cl (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))))) :rule resolution :premises (t44.t2 t44.a0))
% 0.20/0.52  (step t44 (cl (not (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X)))))) (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))))) :rule subproof :discharge (t44.a0))
% 0.20/0.52  (step t45 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X))))) (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))))) (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))))) :rule resolution :premises (t43 t44))
% 0.20/0.52  (step t46 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X))))) (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))))) (not (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956)))))) :rule implies_neg2)
% 0.20/0.52  (step t47 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X))))) (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))))) (=> (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X))))) (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956)))))) :rule resolution :premises (t45 t46))
% 0.20/0.52  (step t48 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X))))) (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956)))))) :rule contraction :premises (t47))
% 0.20/0.52  (step t49 (cl (not (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X)))))) (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))))) :rule implies :premises (t48))
% 0.20/0.52  (step t50 (cl (not (= (forall ((X $$unsorted)) (=> (tptp.ca X) (not (or (tptp.cc X) (tptp.cb X))))) (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X))))))) (not (forall ((X $$unsorted)) (=> (tptp.ca X) (not (or (tptp.cc X) (tptp.cb X)))))) (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X)))))) :rule equiv_pos2)
% 0.20/0.52  (step t51 (cl (= (forall ((X $$unsorted)) (=> (tptp.ca X) (not (or (tptp.cc X) (tptp.cb X))))) (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X))))))) :rule all_simplify)
% 0.20/0.52  (step t52 (cl (forall ((X $$unsorted)) (or (not (tptp.ca X)) (and (not (tptp.cc X)) (not (tptp.cb X)))))) :rule resolution :premises (t50 t51 a3))
% 0.20/0.52  (step t53 (cl (or (not (tptp.ca tptp.i2003_11_14_17_18_1956)) (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))))) :rule resolution :premises (t49 t52))
% 0.20/0.52  (step t54 (cl (not (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956)))) (not (tptp.cb tptp.i2003_11_14_17_18_1956))) :rule and_pos)
% 0.20/0.52  (step t55 (cl (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))))) :rule reordering :premises (t54))
% 0.20/0.52  (step t56 (cl (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))) :rule and_neg)
% 0.20/0.52  (step t57 (cl (not (tptp.cb tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))) :rule resolution :premises (t31 t8 t27 t42 t2 t53 t6 t55 t56 t27))
% 0.20/0.52  (step t58 (cl (not (tptp.cb tptp.i2003_11_14_17_18_1956))) :rule contraction :premises (t57))
% 0.20/0.52  (step t59 (cl (not (and (tptp.cb tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)))) :rule resolution :premises (t29 t58))
% 0.20/0.52  (step t60 (cl (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))) :rule resolution :premises (t8 t27 t59 t42))
% 0.20/0.52  (step t61 (cl (tptp.cc tptp.i2003_11_14_17_18_1956)) :rule resolution :premises (t6 t60))
% 0.20/0.52  (step t62 (cl (not (and (not (tptp.cc tptp.i2003_11_14_17_18_1956)) (not (tptp.cb tptp.i2003_11_14_17_18_1956))))) :rule resolution :premises (t4 t61))
% 0.20/0.52  (step t63 (cl (not (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956))) (tptp.ca tptp.i2003_11_14_17_18_1956)) :rule and_pos)
% 0.20/0.52  (step t64 (cl (tptp.ca tptp.i2003_11_14_17_18_1956) (not (and (tptp.cc tptp.i2003_11_14_17_18_1956) (tptp.ca tptp.i2003_11_14_17_18_1956)))) :rule reordering :premises (t63))
% 0.20/0.52  (step t65 (cl (tptp.ca tptp.i2003_11_14_17_18_1956)) :rule resolution :premises (t64 t60))
% 0.20/0.52  (step t66 (cl) :rule resolution :premises (t2 t62 t65 t53))
% 0.20/0.52  
% 0.20/0.52  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.InsdCSNeUN/cvc5---1.0.5_20889.smt2
% 0.20/0.52  % cvc5---1.0.5 exiting
% 0.20/0.52  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------