TSTP Solution File: SYN346-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN346-1 : TPTP v8.2.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n028.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 18:25:12 EDT 2024
% Result : Unsatisfiable 0.24s 0.53s
% Output : Proof 0.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.15/0.15 % Problem : SYN346-1 : TPTP v8.2.0. Released v1.2.0.
% 0.15/0.16 % Command : do_cvc5 %s %d
% 0.17/0.39 % Computer : n028.cluster.edu
% 0.17/0.39 % Model : x86_64 x86_64
% 0.17/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.39 % Memory : 8042.1875MB
% 0.17/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.39 % CPULimit : 300
% 0.17/0.39 % WCLimit : 300
% 0.17/0.39 % DateTime : Tue May 28 13:15:39 EDT 2024
% 0.17/0.39 % CPUTime :
% 0.24/0.51 %----Proving TF0_NAR, FOF, or CNF
% 0.24/0.52 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.24/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.DptA1EcEUE/cvc5---1.0.5_24238.smt2
% 0.24/0.53 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.DptA1EcEUE/cvc5---1.0.5_24238.smt2
% 0.24/0.54 (assume a0 (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (tptp.f tptp.b (tptp.z1 Y1 Y2))))
% 0.24/0.54 (assume a1 (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (tptp.f Y1 (tptp.z2 Y1 Y2))))
% 0.24/0.54 (assume a2 (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))))
% 0.24/0.54 (assume a3 (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f tptp.b (tptp.z2 Y1 Y2))) (not (tptp.f Y2 (tptp.z2 Y1 Y2))))))
% 0.24/0.54 (step t1 (cl (not (= (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))) (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))))) (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b)))))) (not (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))) (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b)))))) (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))))) :rule equiv_pos2)
% 0.24/0.54 (step t2 (cl (= (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))) (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))))) :rule refl)
% 0.24/0.54 (step t3 (cl (= (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b)))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))))) :rule all_simplify)
% 0.24/0.54 (step t4 (cl (= (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))) (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))))) (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b)))))) :rule cong :premises (t2 t3))
% 0.24/0.54 (step t5 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))) (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))))) (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2)))))) :rule implies_neg1)
% 0.24/0.54 (anchor :step t6)
% 0.24/0.54 (assume t6.a0 (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))))
% 0.24/0.54 (step t6.t1 (cl (or (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2)))))) (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b)))))) :rule forall_inst :args ((:= Y1 tptp.b) (:= Y2 tptp.b)))
% 0.24/0.54 (step t6.t2 (cl (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2)))))) (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))))) :rule or :premises (t6.t1))
% 0.24/0.54 (step t6.t3 (cl (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))))) :rule resolution :premises (t6.t2 t6.a0))
% 0.24/0.54 (step t6 (cl (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2)))))) (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))))) :rule subproof :discharge (t6.a0))
% 0.24/0.54 (step t7 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))) (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))))) (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))))) :rule resolution :premises (t5 t6))
% 0.24/0.54 (step t8 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))) (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))))) (not (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b)))))) :rule implies_neg2)
% 0.24/0.54 (step t9 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))) (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))))) (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))) (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b)))))) :rule resolution :premises (t7 t8))
% 0.24/0.54 (step t10 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))) (or (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b)))))) :rule contraction :premises (t9))
% 0.24/0.54 (step t11 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2))))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))))) :rule resolution :premises (t1 t4 t10))
% 0.24/0.54 (step t12 (cl (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (or (not (tptp.f Y1 (tptp.z1 Y1 Y2))) (not (tptp.f Y2 (tptp.z1 Y1 Y2)))))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b)))) :rule implies :premises (t11))
% 0.24/0.54 (step t13 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (tptp.f tptp.b (tptp.z1 Y1 Y2))) (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (tptp.f tptp.b (tptp.z1 Y1 Y2)))) :rule implies_neg1)
% 0.24/0.54 (anchor :step t14)
% 0.24/0.54 (assume t14.a0 (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (tptp.f tptp.b (tptp.z1 Y1 Y2))))
% 0.24/0.54 (step t14.t1 (cl (or (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (tptp.f tptp.b (tptp.z1 Y1 Y2)))) (tptp.f tptp.b (tptp.z1 tptp.b tptp.b)))) :rule forall_inst :args ((:= Y1 tptp.b) (:= Y2 tptp.b)))
% 0.24/0.54 (step t14.t2 (cl (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (tptp.f tptp.b (tptp.z1 Y1 Y2)))) (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) :rule or :premises (t14.t1))
% 0.24/0.54 (step t14.t3 (cl (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) :rule resolution :premises (t14.t2 t14.a0))
% 0.24/0.54 (step t14 (cl (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (tptp.f tptp.b (tptp.z1 Y1 Y2)))) (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) :rule subproof :discharge (t14.a0))
% 0.24/0.54 (step t15 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (tptp.f tptp.b (tptp.z1 Y1 Y2))) (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) :rule resolution :premises (t13 t14))
% 0.24/0.54 (step t16 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (tptp.f tptp.b (tptp.z1 Y1 Y2))) (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (not (tptp.f tptp.b (tptp.z1 tptp.b tptp.b)))) :rule implies_neg2)
% 0.24/0.54 (step t17 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (tptp.f tptp.b (tptp.z1 Y1 Y2))) (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (tptp.f tptp.b (tptp.z1 Y1 Y2))) (tptp.f tptp.b (tptp.z1 tptp.b tptp.b)))) :rule resolution :premises (t15 t16))
% 0.24/0.54 (step t18 (cl (=> (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (tptp.f tptp.b (tptp.z1 Y1 Y2))) (tptp.f tptp.b (tptp.z1 tptp.b tptp.b)))) :rule contraction :premises (t17))
% 0.24/0.54 (step t19 (cl (not (forall ((Y1 $$unsorted) (Y2 $$unsorted)) (tptp.f tptp.b (tptp.z1 Y1 Y2)))) (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) :rule implies :premises (t18))
% 0.24/0.54 (step t20 (cl (tptp.f tptp.b (tptp.z1 tptp.b tptp.b))) :rule resolution :premises (t19 a0))
% 0.24/0.54 (step t21 (cl) :rule resolution :premises (t12 t20 a2))
% 0.24/0.54
% 0.24/0.54 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.DptA1EcEUE/cvc5---1.0.5_24238.smt2
% 0.24/0.54 % cvc5---1.0.5 exiting
% 0.24/0.54 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------