TSTP Solution File: SYN323-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN323-1 : TPTP v8.2.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n018.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:04 EDT 2024
% Result : Unsatisfiable 0.43s 0.59s
% Output : Proof 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : SYN323-1 : TPTP v8.2.0. Released v1.2.0.
% 0.08/0.17 % Command : do_cvc5 %s %d
% 0.17/0.39 % Computer : n018.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:23:39 EDT 2024
% 0.17/0.39 % CPUTime :
% 0.26/0.56 %----Proving TF0_NAR, FOF, or CNF
% 0.26/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.43/0.59 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.qtU35y6hSG/cvc5---1.0.5_9022.smt2
% 0.43/0.59 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.qtU35y6hSG/cvc5---1.0.5_9022.smt2
% 0.43/0.59 (assume a0 (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (tptp.g X tptp.a))))
% 0.43/0.59 (assume a1 (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (tptp.g X tptp.a))))
% 0.43/0.59 (assume a2 (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (not (tptp.g X tptp.a)))))
% 0.43/0.59 (assume a3 (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (not (tptp.g X tptp.a)))))
% 0.43/0.59 (step t1 (cl (not (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a)))) (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a))) :rule or_pos)
% 0.43/0.59 (step t2 (cl (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a)) (not (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a))))) :rule reordering :premises (t1))
% 0.43/0.59 (step t3 (cl (not (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a))) (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a)) :rule or_pos)
% 0.43/0.59 (step t4 (cl (tptp.g tptp.a tptp.a) (not (tptp.f tptp.a tptp.a)) (not (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a)))) :rule reordering :premises (t3))
% 0.43/0.59 (step t5 (cl (not (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a)))) (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a))) :rule or_pos)
% 0.43/0.59 (step t6 (cl (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a)) (not (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a))))) :rule reordering :premises (t5))
% 0.43/0.59 (step t7 (cl (=> (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (not (tptp.g X tptp.a)))) (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a)))) (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (not (tptp.g X tptp.a))))) :rule implies_neg1)
% 0.43/0.59 (anchor :step t8)
% 0.43/0.59 (assume t8.a0 (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (not (tptp.g X tptp.a)))))
% 0.43/0.59 (step t8.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (not (tptp.g X tptp.a))))) (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a))))) :rule forall_inst :args ((:= X tptp.a)))
% 0.43/0.59 (step t8.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (not (tptp.g X tptp.a))))) (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a)))) :rule or :premises (t8.t1))
% 0.43/0.59 (step t8.t3 (cl (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a)))) :rule resolution :premises (t8.t2 t8.a0))
% 0.43/0.59 (step t8 (cl (not (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (not (tptp.g X tptp.a))))) (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a)))) :rule subproof :discharge (t8.a0))
% 0.43/0.59 (step t9 (cl (=> (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (not (tptp.g X tptp.a)))) (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a)))) (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a)))) :rule resolution :premises (t7 t8))
% 0.43/0.59 (step t10 (cl (=> (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (not (tptp.g X tptp.a)))) (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a)))) (not (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a))))) :rule implies_neg2)
% 0.43/0.59 (step t11 (cl (=> (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (not (tptp.g X tptp.a)))) (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a)))) (=> (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (not (tptp.g X tptp.a)))) (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a))))) :rule resolution :premises (t9 t10))
% 0.43/0.59 (step t12 (cl (=> (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (not (tptp.g X tptp.a)))) (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a))))) :rule contraction :premises (t11))
% 0.43/0.59 (step t13 (cl (not (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (not (tptp.g X tptp.a))))) (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a)))) :rule implies :premises (t12))
% 0.43/0.59 (step t14 (cl (or (tptp.f tptp.a tptp.a) (not (tptp.g tptp.a tptp.a)))) :rule resolution :premises (t13 a2))
% 0.43/0.59 (step t15 (cl (not (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a))) (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a)) :rule or_pos)
% 0.43/0.59 (step t16 (cl (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a) (not (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a)))) :rule reordering :premises (t15))
% 0.43/0.59 (step t17 (cl (=> (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (tptp.g X tptp.a))) (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a))) (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (tptp.g X tptp.a)))) :rule implies_neg1)
% 0.43/0.59 (anchor :step t18)
% 0.43/0.59 (assume t18.a0 (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (tptp.g X tptp.a))))
% 0.43/0.59 (step t18.t1 (cl (or (not (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (tptp.g X tptp.a)))) (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a)))) :rule forall_inst :args ((:= X tptp.a)))
% 0.43/0.59 (step t18.t2 (cl (not (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (tptp.g X tptp.a)))) (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a))) :rule or :premises (t18.t1))
% 0.43/0.59 (step t18.t3 (cl (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a))) :rule resolution :premises (t18.t2 t18.a0))
% 0.43/0.59 (step t18 (cl (not (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (tptp.g X tptp.a)))) (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a))) :rule subproof :discharge (t18.a0))
% 0.43/0.59 (step t19 (cl (=> (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (tptp.g X tptp.a))) (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a))) (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a))) :rule resolution :premises (t17 t18))
% 0.43/0.59 (step t20 (cl (=> (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (tptp.g X tptp.a))) (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a))) (not (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a)))) :rule implies_neg2)
% 0.43/0.59 (step t21 (cl (=> (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (tptp.g X tptp.a))) (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a))) (=> (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (tptp.g X tptp.a))) (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a)))) :rule resolution :premises (t19 t20))
% 0.43/0.59 (step t22 (cl (=> (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (tptp.g X tptp.a))) (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a)))) :rule contraction :premises (t21))
% 0.43/0.59 (step t23 (cl (not (forall ((X $$unsorted)) (or (tptp.f X tptp.a) (tptp.g X tptp.a)))) (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a))) :rule implies :premises (t22))
% 0.43/0.59 (step t24 (cl (or (tptp.f tptp.a tptp.a) (tptp.g tptp.a tptp.a))) :rule resolution :premises (t23 a0))
% 0.43/0.59 (step t25 (cl (tptp.f tptp.a tptp.a) (tptp.f tptp.a tptp.a)) :rule resolution :premises (t6 t14 t16 t24))
% 0.43/0.59 (step t26 (cl (tptp.f tptp.a tptp.a)) :rule contraction :premises (t25))
% 0.43/0.59 (step t27 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (tptp.g X tptp.a))) (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a))) (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (tptp.g X tptp.a)))) :rule implies_neg1)
% 0.43/0.59 (anchor :step t28)
% 0.43/0.59 (assume t28.a0 (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (tptp.g X tptp.a))))
% 0.43/0.59 (step t28.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (tptp.g X tptp.a)))) (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a)))) :rule forall_inst :args ((:= X tptp.a)))
% 0.43/0.59 (step t28.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (tptp.g X tptp.a)))) (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a))) :rule or :premises (t28.t1))
% 0.43/0.59 (step t28.t3 (cl (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a))) :rule resolution :premises (t28.t2 t28.a0))
% 0.43/0.59 (step t28 (cl (not (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (tptp.g X tptp.a)))) (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a))) :rule subproof :discharge (t28.a0))
% 0.43/0.59 (step t29 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (tptp.g X tptp.a))) (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a))) (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a))) :rule resolution :premises (t27 t28))
% 0.43/0.59 (step t30 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (tptp.g X tptp.a))) (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a))) (not (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a)))) :rule implies_neg2)
% 0.43/0.59 (step t31 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (tptp.g X tptp.a))) (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a))) (=> (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (tptp.g X tptp.a))) (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a)))) :rule resolution :premises (t29 t30))
% 0.43/0.59 (step t32 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (tptp.g X tptp.a))) (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a)))) :rule contraction :premises (t31))
% 0.43/0.59 (step t33 (cl (not (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (tptp.g X tptp.a)))) (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a))) :rule implies :premises (t32))
% 0.43/0.59 (step t34 (cl (or (not (tptp.f tptp.a tptp.a)) (tptp.g tptp.a tptp.a))) :rule resolution :premises (t33 a1))
% 0.43/0.59 (step t35 (cl (tptp.g tptp.a tptp.a)) :rule resolution :premises (t4 t26 t34))
% 0.43/0.59 (step t36 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (not (tptp.g X tptp.a)))) (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a)))) (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (not (tptp.g X tptp.a))))) :rule implies_neg1)
% 0.43/0.59 (anchor :step t37)
% 0.43/0.59 (assume t37.a0 (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (not (tptp.g X tptp.a)))))
% 0.43/0.59 (step t37.t1 (cl (or (not (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (not (tptp.g X tptp.a))))) (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a))))) :rule forall_inst :args ((:= X tptp.a)))
% 0.43/0.59 (step t37.t2 (cl (not (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (not (tptp.g X tptp.a))))) (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a)))) :rule or :premises (t37.t1))
% 0.43/0.59 (step t37.t3 (cl (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a)))) :rule resolution :premises (t37.t2 t37.a0))
% 0.43/0.59 (step t37 (cl (not (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (not (tptp.g X tptp.a))))) (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a)))) :rule subproof :discharge (t37.a0))
% 0.43/0.59 (step t38 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (not (tptp.g X tptp.a)))) (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a)))) (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a)))) :rule resolution :premises (t36 t37))
% 0.43/0.59 (step t39 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (not (tptp.g X tptp.a)))) (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a)))) (not (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a))))) :rule implies_neg2)
% 0.43/0.59 (step t40 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (not (tptp.g X tptp.a)))) (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a)))) (=> (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (not (tptp.g X tptp.a)))) (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a))))) :rule resolution :premises (t38 t39))
% 0.43/0.59 (step t41 (cl (=> (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (not (tptp.g X tptp.a)))) (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a))))) :rule contraction :premises (t40))
% 0.43/0.59 (step t42 (cl (not (forall ((X $$unsorted)) (or (not (tptp.f tptp.a X)) (not (tptp.g X tptp.a))))) (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a)))) :rule implies :premises (t41))
% 0.43/0.59 (step t43 (cl (or (not (tptp.f tptp.a tptp.a)) (not (tptp.g tptp.a tptp.a)))) :rule resolution :premises (t42 a3))
% 0.43/0.59 (step t44 (cl) :rule resolution :premises (t2 t35 t26 t43))
% 0.43/0.59
% 0.43/0.59 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.qtU35y6hSG/cvc5---1.0.5_9022.smt2
% 0.43/0.60 % cvc5---1.0.5 exiting
% 0.47/0.60 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------